%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : CAT003-3 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n020.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Thu Jul 14 23:59:53 EDT 2022 % Result : Unsatisfiable 0.12s 0.36s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : CAT003-3 : TPTP v8.1.0. Released v1.0.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n020.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sun May 29 16:41:24 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 21 Number of unprocessed: 20 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 20 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 7 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 13 extension rule candidate clauses % 0.12/0.36 # 7 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.36 # There were 1 total branch saturation attempts. % 0.12/0.36 # There were 0 of these attempts blocked. % 0.12/0.36 # There were 0 deferred branch saturation attempts. % 0.12/0.36 # There were 0 free duplicated saturations. % 0.12/0.36 # There were 1 total successful branch saturations. % 0.12/0.36 # There were 0 successful branch saturations in interreduction. % 0.12/0.36 # There were 0 successful branch saturations on the branch. % 0.12/0.36 # There were 1 successful branch saturations after the branch. % 0.12/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.36 # Begin clausification derivation % 0.12/0.36 % 0.12/0.36 # End clausification derivation % 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.36 cnf(i_0_42, hypothesis, (there_exists(h))). % 0.12/0.36 cnf(i_0_43, hypothesis, (compose(g,a)=compose(h,a))). % 0.12/0.36 cnf(i_0_32, plain, (compose(X1,domain(X1))=X1)). % 0.12/0.36 cnf(i_0_33, plain, (compose(codomain(X1),X1)=X1)). % 0.12/0.36 cnf(i_0_40, hypothesis, (there_exists(compose(a,b)))). % 0.12/0.36 cnf(i_0_31, plain, (compose(compose(X1,X2),X3)=compose(X1,compose(X2,X3)))). % 0.12/0.36 cnf(i_0_44, negated_conjecture, (g!=h)). % 0.12/0.36 cnf(i_0_24, plain, (X1=X2|~equivalent(X1,X2))). % 0.12/0.36 cnf(i_0_26, plain, (there_exists(X1)|~there_exists(domain(X1)))). % 0.12/0.36 cnf(i_0_34, plain, (there_exists(X1)|~equivalent(X2,X1))). % 0.12/0.36 cnf(i_0_23, plain, (there_exists(X1)|~equivalent(X1,X2))). % 0.12/0.36 cnf(i_0_27, plain, (there_exists(X1)|~there_exists(codomain(X1)))). % 0.12/0.36 cnf(i_0_25, plain, (equivalent(X1,X1)|~there_exists(X1))). % 0.12/0.36 cnf(i_0_37, plain, (X1=X2|there_exists(f1(X1,X2)))). % 0.12/0.36 cnf(i_0_28, plain, (there_exists(domain(X1))|~there_exists(compose(X1,X2)))). % 0.12/0.36 cnf(i_0_36, plain, (there_exists(codomain(X1))|~there_exists(compose(X1,X2)))). % 0.12/0.36 cnf(i_0_29, plain, (codomain(X1)=domain(X2)|~there_exists(compose(X2,X1)))). % 0.12/0.36 cnf(i_0_30, plain, (there_exists(compose(X1,X2))|codomain(X2)!=domain(X1)|~there_exists(domain(X1)))). % 0.12/0.36 cnf(i_0_38, plain, (f1(X1,X2)=X1|f1(X1,X2)=X2|X1=X2)). % 0.12/0.36 cnf(i_0_41, hypothesis, (X1=X2|compose(X1,compose(a,b))!=compose(X2,compose(a,b)))). % 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.36 # Begin printing tableau % 0.12/0.36 # Found 4 steps % 0.12/0.36 cnf(i_0_44, negated_conjecture, (g!=h), inference(start_rule)). % 0.12/0.36 cnf(i_0_48, plain, (g!=h), inference(extension_rule, [i_0_41])). % 0.12/0.36 cnf(i_0_76, plain, (compose(g,compose(a,b))!=compose(h,compose(a,b))), inference(extension_rule, [i_0_24])). % 0.12/0.36 cnf(i_0_78, plain, (~equivalent(compose(g,compose(a,b)),compose(h,compose(a,b)))), inference(etableau_closure_rule, [i_0_78, ...])). % 0.12/0.36 # End printing tableau % 0.12/0.36 # SZS output end % 0.12/0.36 # Branches closed with saturation will be marked with an "s" % 0.12/0.36 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 4 tableaux to operate on % 0.12/0.36 # Found closed tableau during pool population. % 0.12/0.36 # Proof search is over... % 0.12/0.36 # Freeing feature tree %------------------------------------------------------------------------------