%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COL125+1 : TPTP v8.1.0. Released v7.5.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 : n023.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:25:00 EDT 2022 % Result : CounterSatisfiable 22.24s 3.16s % Output : CNFRefutation 22.24s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : COL125+1 : TPTP v8.1.0. Released v7.5.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.34 % Computer : n023.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Tue May 31 09:16:56 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.38 # No SInE strategy applied % 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.38 # % 0.14/0.38 # Presaturation interreduction done % 0.14/0.38 # Number of axioms: 10 Number of unprocessed: 10 % 0.14/0.38 # Tableaux proof search. % 0.14/0.38 # APR header successfully linked. % 0.14/0.38 # Hello from C++ % 0.14/0.38 # The folding up rule is enabled... % 0.14/0.38 # Local unification is enabled... % 0.14/0.38 # Any saturation attempts will use folding labels... % 0.14/0.38 # 10 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 8 conjectures. % 0.14/0.38 # There are 8 start rule candidates: % 0.14/0.38 # Found 10 unit axioms. % 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.38 # 8 start rule tableaux created. % 0.14/0.38 # 0 extension rule candidate clauses % 0.14/0.38 # 10 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 21.12/3.07 # Creating equality axioms % 21.12/3.07 # Ran out of tableaux, making start rules for all clauses % 21.12/3.07 # 7631 Satisfiable branch % 21.12/3.07 # Creating equality axioms % 21.12/3.07 # Ran out of tableaux, making start rules for all clauses % 21.12/3.07 # 7628 Satisfiable branch % 21.60/3.09 # Creating equality axioms % 21.60/3.09 # Ran out of tableaux, making start rules for all clauses % 21.60/3.09 # 7633 Satisfiable branch % 21.60/3.09 # Creating equality axioms % 21.60/3.09 # Ran out of tableaux, making start rules for all clauses % 21.60/3.09 # 7632 Satisfiable branch % 21.60/3.09 # Creating equality axioms % 21.60/3.09 # Ran out of tableaux, making start rules for all clauses % 21.60/3.09 # 7634 Satisfiable branch % 21.60/3.12 # Creating equality axioms % 21.60/3.12 # Ran out of tableaux, making start rules for all clauses % 21.60/3.12 # 7629 Satisfiable branch % 22.24/3.16 # Satisfiable branch found. % 22.24/3.16 # There were 1 total branch saturation attempts. % 22.24/3.16 # There were 0 of these attempts blocked. % 22.24/3.16 # There were 0 deferred branch saturation attempts. % 22.24/3.16 # There were 0 free duplicated saturations. % 22.24/3.16 # There were 0 total successful branch saturations. % 22.24/3.16 # There were 0 successful branch saturations in interreduction. % 22.24/3.16 # There were 0 successful branch saturations on the branch. % 22.24/3.16 # There were 0 successful branch saturations after the branch. % 22.24/3.16 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 22.24/3.16 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 22.24/3.16 # Begin clausification derivation % 22.24/3.16 % 22.24/3.16 # End clausification derivation % 22.24/3.16 # Begin listing active clauses obtained from FOF to CNF conversion % 22.24/3.16 cnf(i_0_1, plain, (a(a(k,X1),X2)=X1)). % 22.24/3.16 cnf(i_0_9, negated_conjecture, (a(a(a(a(a(a(a(esk4_0,X1),X2),X3),X1),a(k,a(a(X4,X4),a(a(a(esk1_0,esk3_0),X1),X1)))),a(k,a(esk2_0,esk3_0))),a(a(X4,a(s,s)),k))=a(k,a(a(s,a(a(a(esk3_0,X2),esk1_0),s)),a(esk4_0,k))))). % 22.24/3.16 cnf(i_0_8, negated_conjecture, (a(a(a(a(a(a(a(esk3_0,X1),X2),X3),X3),a(a(s,a(k,X2)),a(X1,a(X2,k)))),esk1_0),s)=a(k,a(a(a(a(a(esk4_0,X2),esk3_0),a(a(esk1_0,k),k)),esk2_0),a(esk2_0,s))))). % 22.24/3.16 cnf(i_0_5, negated_conjecture, (a(a(a(a(a(a(a(a(a(esk2_0,X1),X2),X1),X2),a(esk1_0,a(a(X3,a(a(s,X1),esk2_0)),a(s,X4)))),a(esk2_0,X4)),a(X3,s)),a(a(esk4_0,k),X2)),s)=a(k,a(a(a(s,s),a(a(s,s),s)),a(k,s))))). % 22.24/3.16 cnf(i_0_6, negated_conjecture, (a(a(a(a(a(a(a(a(a(esk2_0,X1),X2),X1),X1),a(a(a(a(s,s),esk4_0),a(k,k)),X1)),esk4_0),esk2_0),a(a(X2,X3),k)),a(a(X2,s),k))=a(a(a(X3,a(a(s,a(esk2_0,s)),esk3_0)),a(a(esk2_0,X1),s)),s))). % 22.24/3.16 cnf(i_0_2, plain, (a(a(a(s,X1),X2),X3)=a(a(X1,X3),a(X2,X3)))). % 22.24/3.16 cnf(i_0_4, negated_conjecture, (a(a(a(a(a(a(a(esk1_0,X1),X1),X2),X3),a(a(esk2_0,a(a(s,a(k,k)),a(esk3_0,esk3_0))),esk1_0)),X1),X2)=a(k,a(esk2_0,X4)))). % 22.24/3.16 cnf(i_0_3, negated_conjecture, (a(a(a(a(a(a(a(esk1_0,X1),X2),X2),X3),a(k,a(a(X2,esk4_0),k))),a(a(a(X3,esk2_0),a(s,esk2_0)),X4)),s)=a(a(a(X1,a(a(a(s,s),X4),a(X4,X1))),a(X3,s)),a(X2,s)))). % 22.24/3.16 cnf(i_0_10, negated_conjecture, (a(a(a(a(a(a(a(esk4_0,X1),X1),X2),X2),a(X2,X2)),a(k,X1)),k)=a(s,a(a(a(a(a(esk3_0,esk4_0),a(a(X3,s),s)),a(s,k)),s),a(a(a(X3,a(s,s)),esk4_0),s))))). % 22.24/3.16 cnf(i_0_7, negated_conjecture, (a(a(a(a(a(a(a(a(esk3_0,X1),X1),X2),X2),a(a(a(a(a(a(a(a(esk3_0,esk4_0),esk2_0),s),k),s),esk3_0),X3),k)),s),a(s,X1)),a(a(a(a(a(s,X4),k),X2),k),k))=a(a(a(X4,a(a(a(s,X2),k),a(a(esk2_0,X3),k))),a(esk1_0,a(k,s))),a(a(a(a(a(a(a(a(esk3_0,s),X4),esk2_0),k),esk1_0),s),s),k)))). % 22.24/3.16 cnf(i_0_19, plain, (X51=X51)). % 22.24/3.16 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 22.24/3.16 # Begin printing tableau % 22.24/3.16 # Found 5 steps % 22.24/3.16 cnf(i_0_19, plain, (a(k,X5)=a(k,X5)), inference(start_rule)). % 22.24/3.16 cnf(i_0_34, plain, (a(k,X5)=a(k,X5)), inference(extension_rule, [i_0_23])). % 22.24/3.16 cnf(i_0_44, plain, ($false), inference(closure_rule, [i_0_19])). % 22.24/3.16 cnf(i_0_42, plain, (a(a(k,X5),X2)=a(a(k,X5),X2)), inference(extension_rule, [i_0_22])). % 22.24/3.16 cnf(i_0_51, plain, (a(a(k,X5),X2)!=X5), inference(closure_rule, [i_0_1])). % 22.24/3.16 # End printing tableau % 22.24/3.16 # SZS output end % 22.24/3.16 # Branches closed with saturation will be marked with an "s" % 22.24/3.17 # Satisfiable branch found. % 22.24/3.17 # There were 1 total branch saturation attempts. % 22.24/3.17 # There were 0 of these attempts blocked. % 22.24/3.17 # There were 0 deferred branch saturation attempts. % 22.24/3.17 # There were 0 free duplicated saturations. % 22.24/3.17 # There were 0 total successful branch saturations. % 22.24/3.17 # There were 0 successful branch saturations in interreduction. % 22.24/3.17 # There were 0 successful branch saturations on the branch. % 22.24/3.17 # There were 0 successful branch saturations after the branch. % 22.24/3.17 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 22.24/3.17 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 22.24/3.17 # Begin clausification derivation % 22.24/3.17 % 22.24/3.17 # End clausification derivation % 22.24/3.17 # Begin listing active clauses obtained from FOF to CNF conversion % 22.24/3.17 cnf(i_0_1, plain, (a(a(k,X1),X2)=X1)). % 22.24/3.17 cnf(i_0_9, negated_conjecture, (a(a(a(a(a(a(a(esk4_0,X1),X2),X3),X1),a(k,a(a(X4,X4),a(a(a(esk1_0,esk3_0),X1),X1)))),a(k,a(esk2_0,esk3_0))),a(a(X4,a(s,s)),k))=a(k,a(a(s,a(a(a(esk3_0,X2),esk1_0),s)),a(esk4_0,k))))). % 22.24/3.17 cnf(i_0_8, negated_conjecture, (a(a(a(a(a(a(a(esk3_0,X1),X2),X3),X3),a(a(s,a(k,X2)),a(X1,a(X2,k)))),esk1_0),s)=a(k,a(a(a(a(a(esk4_0,X2),esk3_0),a(a(esk1_0,k),k)),esk2_0),a(esk2_0,s))))). % 22.24/3.17 cnf(i_0_5, negated_conjecture, (a(a(a(a(a(a(a(a(a(esk2_0,X1),X2),X1),X2),a(esk1_0,a(a(X3,a(a(s,X1),esk2_0)),a(s,X4)))),a(esk2_0,X4)),a(X3,s)),a(a(esk4_0,k),X2)),s)=a(k,a(a(a(s,s),a(a(s,s),s)),a(k,s))))). % 22.24/3.17 cnf(i_0_6, negated_conjecture, (a(a(a(a(a(a(a(a(a(esk2_0,X1),X2),X1),X1),a(a(a(a(s,s),esk4_0),a(k,k)),X1)),esk4_0),esk2_0),a(a(X2,X3),k)),a(a(X2,s),k))=a(a(a(X3,a(a(s,a(esk2_0,s)),esk3_0)),a(a(esk2_0,X1),s)),s))). % 22.24/3.17 cnf(i_0_2, plain, (a(a(a(s,X1),X2),X3)=a(a(X1,X3),a(X2,X3)))). % 22.24/3.17 cnf(i_0_4, negated_conjecture, (a(a(a(a(a(a(a(esk1_0,X1),X1),X2),X3),a(a(esk2_0,a(a(s,a(k,k)),a(esk3_0,esk3_0))),esk1_0)),X1),X2)=a(k,a(esk2_0,X4)))). % 22.24/3.17 cnf(i_0_3, negated_conjecture, (a(a(a(a(a(a(a(esk1_0,X1),X2),X2),X3),a(k,a(a(X2,esk4_0),k))),a(a(a(X3,esk2_0),a(s,esk2_0)),X4)),s)=a(a(a(X1,a(a(a(s,s),X4),a(X4,X1))),a(X3,s)),a(X2,s)))). % 22.24/3.17 cnf(i_0_10, negated_conjecture, (a(a(a(a(a(a(a(esk4_0,X1),X1),X2),X2),a(X2,X2)),a(k,X1)),k)=a(s,a(a(a(a(a(esk3_0,esk4_0),a(a(X3,s),s)),a(s,k)),s),a(a(a(X3,a(s,s)),esk4_0),s))))). % 22.24/3.17 cnf(i_0_7, negated_conjecture, (a(a(a(a(a(a(a(a(esk3_0,X1),X1),X2),X2),a(a(a(a(a(a(a(a(esk3_0,esk4_0),esk2_0),s),k),s),esk3_0),X3),k)),s),a(s,X1)),a(a(a(a(a(s,X4),k),X2),k),k))=a(a(a(X4,a(a(a(s,X2),k),a(a(esk2_0,X3),k))),a(esk1_0,a(k,s))),a(a(a(a(a(a(a(a(esk3_0,s),X4),esk2_0),k),esk1_0),s),s),k)))). % 22.24/3.17 cnf(i_0_19, plain, (X51=X51)). % 22.24/3.17 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 22.24/3.17 # Begin printing tableau % 22.24/3.17 # Found 5 steps % 22.24/3.17 cnf(i_0_19, plain, (a(k,X5)=a(k,X5)), inference(start_rule)). % 22.24/3.17 cnf(i_0_34, plain, (a(k,X5)=a(k,X5)), inference(extension_rule, [i_0_23])). % 22.24/3.17 cnf(i_0_44, plain, ($false), inference(closure_rule, [i_0_19])). % 22.24/3.17 cnf(i_0_42, plain, (a(a(k,X5),X2)=a(a(k,X5),X2)), inference(extension_rule, [i_0_22])). % 22.24/3.17 cnf(i_0_51, plain, (a(a(k,X5),X2)!=X5), inference(closure_rule, [i_0_1])). % 22.24/3.17 # End printing tableau % 22.24/3.17 # SZS output end % 22.24/3.17 # Branches closed with saturation will be marked with an "s" % 22.24/3.18 # Child (7631) has found a proof. % 22.24/3.18 % 22.24/3.18 # Proof search is over... % 22.24/3.18 # Freeing feature tree %------------------------------------------------------------------------------