%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COL019-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:36 EDT 2022 % Result : Unsatisfiable 0.18s 0.37s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : COL019-1 : TPTP v8.1.0. Released v1.0.0. % 0.03/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 14:56:02 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN % 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.18/0.36 # % 0.18/0.36 # Presaturation interreduction done % 0.18/0.36 # Number of axioms: 4 Number of unprocessed: 4 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 4 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 1 conjectures. % 0.18/0.36 # There are 1 start rule candidates: % 0.18/0.36 # Found 4 unit axioms. % 0.18/0.36 # 1 start rule tableaux created. % 0.18/0.36 # 0 extension rule candidate clauses % 0.18/0.36 # 4 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.18/0.36 # Creating equality axioms % 0.18/0.36 # Ran out of tableaux, making start rules for all clauses % 0.18/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 8 tableaux to operate on % 0.18/0.37 # There were 1 total branch saturation attempts. % 0.18/0.37 # There were 0 of these attempts blocked. % 0.18/0.37 # There were 0 deferred branch saturation attempts. % 0.18/0.37 # There were 0 free duplicated saturations. % 0.18/0.37 # There were 1 total successful branch saturations. % 0.18/0.37 # There were 0 successful branch saturations in interreduction. % 0.18/0.37 # There were 0 successful branch saturations on the branch. % 0.18/0.37 # There were 1 successful branch saturations after the branch. % 0.18/0.37 # There were 1 total branch saturation attempts. % 0.18/0.37 # There were 0 of these attempts blocked. % 0.18/0.37 # There were 0 deferred branch saturation attempts. % 0.18/0.37 # There were 0 free duplicated saturations. % 0.18/0.37 # There were 1 total successful branch saturations. % 0.18/0.37 # There were 0 successful branch saturations in interreduction. % 0.18/0.37 # There were 0 successful branch saturations on the branch. % 0.18/0.37 # There were 1 successful branch saturations after the branch. % 0.18/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # Begin clausification derivation % 0.18/0.37 % 0.18/0.37 # End clausification derivation % 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.37 cnf(i_0_7, plain, (apply(apply(t,X1),X2)=apply(X2,X1))). % 0.18/0.37 cnf(i_0_6, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))). % 0.18/0.37 cnf(i_0_5, plain, (apply(apply(apply(s,X1),X2),X3)=apply(apply(X1,X3),apply(X2,X3)))). % 0.18/0.37 cnf(i_0_8, negated_conjecture, (apply(combinator,X1)!=X1)). % 0.18/0.37 cnf(i_0_10, plain, (X4=X4)). % 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.37 # Begin printing tableau % 0.18/0.37 # Found 6 steps % 0.18/0.37 cnf(i_0_7, plain, (apply(apply(t,X14),X14)=apply(X14,X14)), inference(start_rule)). % 0.18/0.37 cnf(i_0_15, plain, (apply(apply(t,X14),X14)=apply(X14,X14)), inference(extension_rule, [i_0_14])). % 0.18/0.37 cnf(i_0_28, plain, (apply(apply(t,X14),X14)!=apply(X14,X14)), inference(closure_rule, [i_0_7])). % 0.18/0.37 cnf(i_0_27, plain, (apply(apply(apply(t,X14),X14),apply(apply(t,X14),X14))=apply(apply(X14,X14),apply(X14,X14))), inference(extension_rule, [i_0_13])). % 0.18/0.37 cnf(i_0_36, plain, (apply(apply(X14,X14),apply(X14,X14))!=apply(apply(apply(s,X14),X14),X14)), inference(closure_rule, [i_0_5])). % 0.18/0.37 cnf(i_0_34, plain, (apply(apply(apply(t,X14),X14),apply(apply(t,X14),X14))=apply(apply(apply(s,X14),X14),X14)), inference(etableau_closure_rule, [i_0_34, ...])). % 0.18/0.37 # End printing tableau % 0.18/0.37 # SZS output end % 0.18/0.37 # Branches closed with saturation will be marked with an "s" % 0.18/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # Begin clausification derivation % 0.18/0.37 % 0.18/0.37 # End clausification derivation % 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.37 cnf(i_0_7, plain, (apply(apply(t,X1),X2)=apply(X2,X1))). % 0.18/0.37 cnf(i_0_6, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))). % 0.18/0.37 cnf(i_0_5, plain, (apply(apply(apply(s,X1),X2),X3)=apply(apply(X1,X3),apply(X2,X3)))). % 0.18/0.37 cnf(i_0_8, negated_conjecture, (apply(combinator,X1)!=X1)). % 0.18/0.37 cnf(i_0_10, plain, (X4=X4)). % 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.37 # Begin printing tableau % 0.18/0.37 # Found 6 steps % 0.18/0.37 cnf(i_0_10, plain, (combinator=combinator), inference(start_rule)). % 0.18/0.37 cnf(i_0_19, plain, (combinator=combinator), inference(extension_rule, [i_0_14])). % 0.18/0.37 cnf(i_0_39, plain, ($false), inference(closure_rule, [i_0_10])). % 0.18/0.37 cnf(i_0_37, plain, (apply(combinator,combinator)=apply(combinator,combinator)), inference(extension_rule, [i_0_13])). % 0.18/0.37 cnf(i_0_44, plain, (apply(combinator,combinator)=combinator), inference(closure_rule, [i_0_8])). % 0.18/0.37 cnf(i_0_46, plain, (apply(combinator,combinator)!=combinator), inference(etableau_closure_rule, [i_0_46, ...])). % 0.18/0.37 # End printing tableau % 0.18/0.37 # SZS output end % 0.18/0.37 # Branches closed with saturation will be marked with an "s" % 0.18/0.37 # There were 1 total branch saturation attempts. % 0.18/0.37 # There were 0 of these attempts blocked. % 0.18/0.37 # There were 0 deferred branch saturation attempts. % 0.18/0.37 # There were 0 free duplicated saturations. % 0.18/0.37 # There were 1 total successful branch saturations. % 0.18/0.37 # There were 0 successful branch saturations in interreduction. % 0.18/0.37 # There were 0 successful branch saturations on the branch. % 0.18/0.37 # There were 1 successful branch saturations after the branch. % 0.18/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # Begin clausification derivation % 0.18/0.37 % 0.18/0.37 # End clausification derivation % 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.37 cnf(i_0_7, plain, (apply(apply(t,X1),X2)=apply(X2,X1))). % 0.18/0.37 cnf(i_0_6, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))). % 0.18/0.37 cnf(i_0_5, plain, (apply(apply(apply(s,X1),X2),X3)=apply(apply(X1,X3),apply(X2,X3)))). % 0.18/0.37 cnf(i_0_8, negated_conjecture, (apply(combinator,X1)!=X1)). % 0.18/0.37 cnf(i_0_10, plain, (X4=X4)). % 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.37 # Begin printing tableau % 0.18/0.37 # Found 6 steps % 0.18/0.37 cnf(i_0_7, plain, (apply(apply(t,X11),apply(b,X1))=apply(apply(b,X1),X11)), inference(start_rule)). % 0.18/0.37 cnf(i_0_15, plain, (apply(apply(t,X11),apply(b,X1))=apply(apply(b,X1),X11)), inference(extension_rule, [i_0_14])). % 0.18/0.37 cnf(i_0_29, plain, (apply(apply(t,X1),X11)!=apply(X11,X1)), inference(closure_rule, [i_0_7])). % 0.18/0.37 cnf(i_0_27, plain, (apply(apply(apply(t,X11),apply(b,X1)),apply(apply(t,X1),X11))=apply(apply(apply(b,X1),X11),apply(X11,X1))), inference(extension_rule, [i_0_13])). % 0.18/0.37 cnf(i_0_36, plain, (apply(apply(apply(b,X1),X11),apply(X11,X1))!=apply(X1,apply(X11,apply(X11,X1)))), inference(closure_rule, [i_0_6])). % 0.18/0.37 cnf(i_0_34, plain, (apply(apply(apply(t,X11),apply(b,X1)),apply(apply(t,X1),X11))=apply(X1,apply(X11,apply(X11,X1)))), inference(etableau_closure_rule, [i_0_34, ...])). % 0.18/0.37 # End printing tableau % 0.18/0.37 # SZS output end % 0.18/0.37 # Branches closed with saturation will be marked with an "s" % 0.18/0.37 # Child (14258) has found a proof. % 0.18/0.37 % 0.18/0.37 # Proof search is over... % 0.18/0.37 # Freeing feature tree %------------------------------------------------------------------------------