%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COL036-1 : 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 : n027.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 : Fri Jul 15 00:24:38 EDT 2022 % Result : Unsatisfiable 248.59s 31.70s % Output : CNFRefutation 248.59s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : COL036-1 : TPTP v8.1.0. Released v1.0.0. % 0.10/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 : n027.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 : Tue May 31 05:06:17 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_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: 4 Number of unprocessed: 4 % 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 # 4 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 4 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 0 extension rule candidate clauses % 0.12/0.36 # 4 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 # Creating equality axioms % 0.12/0.36 # Ran out of tableaux, making start rules for all clauses % 0.12/0.36 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 9 tableaux to operate on % 248.59/31.70 # There were 1 total branch saturation attempts. % 248.59/31.70 # There were 0 of these attempts blocked. % 248.59/31.70 # There were 0 deferred branch saturation attempts. % 248.59/31.70 # There were 0 free duplicated saturations. % 248.59/31.70 # There were 1 total successful branch saturations. % 248.59/31.70 # There were 0 successful branch saturations in interreduction. % 248.59/31.70 # There were 0 successful branch saturations on the branch. % 248.59/31.70 # There were 1 successful branch saturations after the branch. % 248.59/31.70 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 248.59/31.70 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 248.59/31.70 # Begin clausification derivation % 248.59/31.70 % 248.59/31.70 # End clausification derivation % 248.59/31.70 # Begin listing active clauses obtained from FOF to CNF conversion % 248.59/31.70 cnf(i_0_7, plain, (apply(apply(t,X1),X2)=apply(X2,X1))). % 248.59/31.70 cnf(i_0_6, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))). % 248.59/31.70 cnf(i_0_5, plain, (apply(apply(apply(s,X1),X2),X3)=apply(apply(X1,X3),apply(X2,X3)))). % 248.59/31.70 cnf(i_0_8, negated_conjecture, (apply(f(X1),apply(X1,f(X1)))!=apply(X1,f(X1)))). % 248.59/31.70 cnf(i_0_10, plain, (X4=X4)). % 248.59/31.70 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 248.59/31.70 # Begin printing tableau % 248.59/31.70 # Found 6 steps % 248.59/31.70 cnf(i_0_6, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3))), inference(start_rule)). % 248.59/31.70 cnf(i_0_17, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3))), inference(extension_rule, [i_0_13])). % 248.59/31.70 cnf(i_0_39, plain, (apply(apply(apply(b,X1),X2),X3)!=apply(X1,apply(X2,X3))), inference(closure_rule, [i_0_6])). % 248.59/31.70 cnf(i_0_37, plain, (apply(apply(apply(b,X1),X2),X3)=apply(apply(apply(b,X1),X2),X3)), inference(extension_rule, [i_0_14])). % 248.59/31.70 cnf(i_0_46, plain, (apply(apply(t,X1),X2)!=apply(X2,X1)), inference(closure_rule, [i_0_7])). % 248.59/31.70 cnf(i_0_44, plain, (apply(apply(apply(apply(b,X1),X2),X3),apply(apply(t,X1),X2))=apply(apply(apply(apply(b,X1),X2),X3),apply(X2,X1))), inference(etableau_closure_rule, [i_0_44, ...])). % 248.59/31.70 # End printing tableau % 248.59/31.70 # SZS output end % 248.59/31.70 # Branches closed with saturation will be marked with an "s" % 249.20/31.77 # There were 1 total branch saturation attempts. % 249.20/31.77 # There were 0 of these attempts blocked. % 249.20/31.77 # There were 0 deferred branch saturation attempts. % 249.20/31.77 # There were 0 free duplicated saturations. % 249.20/31.77 # There were 1 total successful branch saturations. % 249.20/31.77 # There were 0 successful branch saturations in interreduction. % 249.20/31.77 # There were 0 successful branch saturations on the branch. % 249.20/31.77 # There were 1 successful branch saturations after the branch. % 249.20/31.77 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 249.20/31.77 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 249.20/31.77 # Begin clausification derivation % 249.20/31.77 % 249.20/31.77 # End clausification derivation % 249.20/31.77 # Begin listing active clauses obtained from FOF to CNF conversion % 249.20/31.77 cnf(i_0_7, plain, (apply(apply(t,X1),X2)=apply(X2,X1))). % 249.20/31.77 cnf(i_0_6, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))). % 249.20/31.77 cnf(i_0_5, plain, (apply(apply(apply(s,X1),X2),X3)=apply(apply(X1,X3),apply(X2,X3)))). % 249.20/31.77 cnf(i_0_8, negated_conjecture, (apply(f(X1),apply(X1,f(X1)))!=apply(X1,f(X1)))). % 249.20/31.77 cnf(i_0_10, plain, (X4=X4)). % 249.20/31.77 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 249.20/31.77 # Begin printing tableau % 249.20/31.77 # Found 5 steps % 249.20/31.77 cnf(i_0_7, plain, (apply(apply(t,X9),X10)=apply(X10,X9)), inference(start_rule)). % 249.20/31.77 cnf(i_0_16, plain, (apply(apply(t,X9),X10)=apply(X10,X9)), inference(extension_rule, [i_0_15])). % 249.20/31.77 cnf(i_0_31, plain, (f(apply(apply(t,X9),X10))=f(apply(X10,X9))), inference(extension_rule, [i_0_14])). % 249.20/31.77 cnf(i_0_83, plain, ($false), inference(closure_rule, [i_0_10])). % 249.20/31.77 cnf(i_0_81, plain, (apply(f(apply(apply(t,X9),X10)),X3)=apply(f(apply(X10,X9)),X3)), inference(etableau_closure_rule, [i_0_81, ...])). % 249.20/31.77 # End printing tableau % 249.20/31.77 # SZS output end % 249.20/31.77 # Branches closed with saturation will be marked with an "s" % 249.48/31.80 # Child (15851) has found a proof. % 249.48/31.80 % 249.48/31.80 # Proof search is over... % 249.48/31.80 # Freeing feature tree %------------------------------------------------------------------------------