%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COL030-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 : 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 : Fri Jul 15 00:24:37 EDT 2022 % Result : Unsatisfiable 0.19s 0.37s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : COL030-1 : TPTP v8.1.0. Released v1.0.0. % 0.13/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n020.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Tue May 31 09:06:23 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S04AN % 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 3 Number of unprocessed: 3 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.36 # The folding up rule is enabled... % 0.19/0.36 # Local unification is enabled... % 0.19/0.36 # Any saturation attempts will use folding labels... % 0.19/0.36 # 3 beginning clauses after preprocessing and clausification % 0.19/0.36 # Creating start rules for all 1 conjectures. % 0.19/0.36 # There are 1 start rule candidates: % 0.19/0.36 # Found 3 unit axioms. % 0.19/0.36 # 1 start rule tableaux created. % 0.19/0.36 # 0 extension rule candidate clauses % 0.19/0.36 # 3 unit axiom clauses % 0.19/0.36 % 0.19/0.36 # Requested 8, 32 cores available to the main process. % 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.36 # Creating equality axioms % 0.19/0.36 # Ran out of tableaux, making start rules for all clauses % 0.19/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.19/0.36 # We now have 8 tableaux to operate on % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 1 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 1 successful branch saturations after the branch. % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 1 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 1 successful branch saturations after the branch. % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 1 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 1 successful branch saturations after the branch. % 0.19/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_5, plain, (apply(apply(l,X1),X2)=apply(X1,apply(X2,X2)))). % 0.19/0.37 cnf(i_0_4, plain, (apply(apply(apply(s,X1),X2),X3)=apply(apply(X1,X3),apply(X2,X3)))). % 0.19/0.37 cnf(i_0_6, negated_conjecture, (apply(f(X1),apply(X1,f(X1)))!=apply(X1,f(X1)))). % 0.19/0.37 cnf(i_0_8, plain, (X4=X4)). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 6 steps % 0.19/0.37 cnf(i_0_5, plain, (apply(apply(l,X12),apply(f(apply(l,apply(l,X12))),f(apply(l,apply(l,X12)))))=apply(X12,apply(apply(f(apply(l,apply(l,X12))),f(apply(l,apply(l,X12)))),apply(f(apply(l,apply(l,X12))),f(apply(l,apply(l,X12))))))), inference(start_rule)). % 0.19/0.37 cnf(i_0_14, plain, (apply(apply(l,X12),apply(f(apply(l,apply(l,X12))),f(apply(l,apply(l,X12)))))=apply(X12,apply(apply(f(apply(l,apply(l,X12))),f(apply(l,apply(l,X12)))),apply(f(apply(l,apply(l,X12))),f(apply(l,apply(l,X12))))))), inference(extension_rule, [i_0_11])). % 0.19/0.37 cnf(i_0_23, plain, (apply(apply(l,apply(l,X12)),f(apply(l,apply(l,X12))))!=apply(apply(l,X12),apply(f(apply(l,apply(l,X12))),f(apply(l,apply(l,X12)))))), inference(closure_rule, [i_0_5])). % 0.19/0.37 cnf(i_0_22, plain, (apply(apply(l,apply(l,X12)),f(apply(l,apply(l,X12))))=apply(X12,apply(apply(f(apply(l,apply(l,X12))),f(apply(l,apply(l,X12)))),apply(f(apply(l,apply(l,X12))),f(apply(l,apply(l,X12))))))), inference(extension_rule, [i_0_11])). % 0.19/0.37 cnf(i_0_34, plain, (apply(apply(l,apply(l,X12)),f(apply(l,apply(l,X12))))=apply(f(apply(l,apply(l,X12))),apply(apply(l,apply(l,X12)),f(apply(l,apply(l,X12)))))), inference(closure_rule, [i_0_6])). % 0.19/0.37 cnf(i_0_36, plain, (apply(X12,apply(apply(f(apply(l,apply(l,X12))),f(apply(l,apply(l,X12)))),apply(f(apply(l,apply(l,X12))),f(apply(l,apply(l,X12))))))!=apply(f(apply(l,apply(l,X12))),apply(apply(l,apply(l,X12)),f(apply(l,apply(l,X12)))))), inference(etableau_closure_rule, [i_0_36, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_5, plain, (apply(apply(l,X1),X2)=apply(X1,apply(X2,X2)))). % 0.19/0.37 cnf(i_0_4, plain, (apply(apply(apply(s,X1),X2),X3)=apply(apply(X1,X3),apply(X2,X3)))). % 0.19/0.37 cnf(i_0_6, negated_conjecture, (apply(f(X1),apply(X1,f(X1)))!=apply(X1,f(X1)))). % 0.19/0.37 cnf(i_0_8, plain, (X4=X4)). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 6 steps % 0.19/0.37 cnf(i_0_4, plain, (apply(apply(apply(s,X1),X2),X3)=apply(apply(X1,X3),apply(X2,X3))), inference(start_rule)). % 0.19/0.37 cnf(i_0_15, plain, (apply(apply(apply(s,X1),X2),X3)=apply(apply(X1,X3),apply(X2,X3))), inference(extension_rule, [i_0_11])). % 0.19/0.37 cnf(i_0_36, plain, (apply(apply(X1,X3),apply(X2,X3))!=apply(apply(apply(s,X1),X2),X3)), inference(closure_rule, [i_0_4])). % 0.19/0.37 cnf(i_0_34, plain, (apply(apply(apply(s,X1),X2),X3)=apply(apply(apply(s,X1),X2),X3)), inference(extension_rule, [i_0_12])). % 0.19/0.37 cnf(i_0_43, plain, (apply(apply(l,X1),X2)!=apply(X1,apply(X2,X2))), inference(closure_rule, [i_0_5])). % 0.19/0.37 cnf(i_0_41, plain, (apply(apply(apply(apply(s,X1),X2),X3),apply(apply(l,X1),X2))=apply(apply(apply(apply(s,X1),X2),X3),apply(X1,apply(X2,X2)))), inference(etableau_closure_rule, [i_0_41, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 1 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 1 successful branch saturations after the branch. % 0.19/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_5, plain, (apply(apply(l,X1),X2)=apply(X1,apply(X2,X2)))). % 0.19/0.37 cnf(i_0_4, plain, (apply(apply(apply(s,X1),X2),X3)=apply(apply(X1,X3),apply(X2,X3)))). % 0.19/0.37 cnf(i_0_6, negated_conjecture, (apply(f(X1),apply(X1,f(X1)))!=apply(X1,f(X1)))). % 0.19/0.37 cnf(i_0_8, plain, (X4=X4)). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 6 steps % 0.19/0.37 cnf(i_0_5, plain, (apply(apply(l,apply(s,X1)),X11)=apply(apply(s,X1),apply(X11,X11))), inference(start_rule)). % 0.19/0.37 cnf(i_0_14, plain, (apply(apply(l,apply(s,X1)),X11)=apply(apply(s,X1),apply(X11,X11))), inference(extension_rule, [i_0_12])). % 0.19/0.37 cnf(i_0_27, plain, (apply(apply(l,X1),apply(X11,X11))!=apply(X1,apply(apply(X11,X11),apply(X11,X11)))), inference(closure_rule, [i_0_5])). % 0.19/0.37 cnf(i_0_25, plain, (apply(apply(apply(l,apply(s,X1)),X11),apply(apply(l,X1),apply(X11,X11)))=apply(apply(apply(s,X1),apply(X11,X11)),apply(X1,apply(apply(X11,X11),apply(X11,X11))))), inference(extension_rule, [i_0_11])). % 0.19/0.37 cnf(i_0_36, plain, (apply(apply(apply(s,X1),apply(X11,X11)),apply(X1,apply(apply(X11,X11),apply(X11,X11))))!=apply(apply(X1,apply(X1,apply(apply(X11,X11),apply(X11,X11)))),apply(apply(X11,X11),apply(X1,apply(apply(X11,X11),apply(X11,X11)))))), inference(closure_rule, [i_0_4])). % 0.19/0.37 cnf(i_0_34, plain, (apply(apply(apply(l,apply(s,X1)),X11),apply(apply(l,X1),apply(X11,X11)))=apply(apply(X1,apply(X1,apply(apply(X11,X11),apply(X11,X11)))),apply(apply(X11,X11),apply(X1,apply(apply(X11,X11),apply(X11,X11)))))), inference(etableau_closure_rule, [i_0_34, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_5, plain, (apply(apply(l,X1),X2)=apply(X1,apply(X2,X2)))). % 0.19/0.37 cnf(i_0_4, plain, (apply(apply(apply(s,X1),X2),X3)=apply(apply(X1,X3),apply(X2,X3)))). % 0.19/0.37 cnf(i_0_6, negated_conjecture, (apply(f(X1),apply(X1,f(X1)))!=apply(X1,f(X1)))). % 0.19/0.37 cnf(i_0_8, plain, (X4=X4)). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 6 steps % 0.19/0.37 cnf(i_0_5, plain, (apply(apply(l,X13),X13)=apply(X13,apply(X13,X13))), inference(start_rule)). % 0.19/0.37 cnf(i_0_14, plain, (apply(apply(l,X13),X13)=apply(X13,apply(X13,X13))), inference(extension_rule, [i_0_12])). % 0.19/0.37 cnf(i_0_26, plain, (apply(apply(l,X1),X13)!=apply(X1,apply(X13,X13))), inference(closure_rule, [i_0_5])). % 0.19/0.37 cnf(i_0_25, plain, (apply(apply(apply(l,X1),X13),apply(apply(l,X13),X13))=apply(apply(X1,apply(X13,X13)),apply(X13,apply(X13,X13)))), inference(extension_rule, [i_0_11])). % 0.19/0.37 cnf(i_0_36, plain, (apply(apply(X1,apply(X13,X13)),apply(X13,apply(X13,X13)))!=apply(apply(apply(s,X1),X13),apply(X13,X13))), inference(closure_rule, [i_0_4])). % 0.19/0.37 cnf(i_0_34, plain, (apply(apply(apply(l,X1),X13),apply(apply(l,X13),X13))=apply(apply(apply(s,X1),X13),apply(X13,X13))), inference(etableau_closure_rule, [i_0_34, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # Child (4121) has found a proof. % 0.19/0.37 % 0.19/0.37 # Proof search is over... % 0.19/0.37 # Freeing feature tree %------------------------------------------------------------------------------