%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COM016+1 : TPTP v8.1.0. Released v4.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 : n012.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 01:14:58 EDT 2022 % Result : Theorem 0.21s 0.43s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : COM016+1 : TPTP v8.1.0. Released v4.0.0. % 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n012.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Thu Jun 16 19:15:24 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.40 # No SInE strategy applied % 0.14/0.40 # Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.40 # % 0.14/0.40 # Presaturation interreduction done % 0.14/0.40 # Number of axioms: 51 Number of unprocessed: 51 % 0.14/0.40 # Tableaux proof search. % 0.14/0.40 # APR header successfully linked. % 0.14/0.40 # Hello from C++ % 0.21/0.41 # The folding up rule is enabled... % 0.21/0.41 # Local unification is enabled... % 0.21/0.41 # Any saturation attempts will use folding labels... % 0.21/0.41 # 51 beginning clauses after preprocessing and clausification % 0.21/0.41 # Creating start rules for all 1 conjectures. % 0.21/0.41 # There are 1 start rule candidates: % 0.21/0.41 # Found 8 unit axioms. % 0.21/0.41 # 1 start rule tableaux created. % 0.21/0.41 # 43 extension rule candidate clauses % 0.21/0.41 # 8 unit axiom clauses % 0.21/0.41 % 0.21/0.41 # Requested 8, 32 cores available to the main process. % 0.21/0.41 # There are not enough tableaux to fork, creating more from the initial 1 % 0.21/0.41 # Creating equality axioms % 0.21/0.41 # Ran out of tableaux, making start rules for all clauses % 0.21/0.41 # Returning from population with 105 new_tableaux and 0 remaining starting tableaux. % 0.21/0.41 # We now have 105 tableaux to operate on % 0.21/0.43 # There were 2 total branch saturation attempts. % 0.21/0.43 # There were 0 of these attempts blocked. % 0.21/0.43 # There were 0 deferred branch saturation attempts. % 0.21/0.43 # There were 0 free duplicated saturations. % 0.21/0.43 # There were 2 total successful branch saturations. % 0.21/0.43 # There were 0 successful branch saturations in interreduction. % 0.21/0.43 # There were 0 successful branch saturations on the branch. % 0.21/0.43 # There were 2 successful branch saturations after the branch. % 0.21/0.43 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.43 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.43 # Begin clausification derivation % 0.21/0.43 % 0.21/0.43 # End clausification derivation % 0.21/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.43 cnf(i_0_49, hypothesis, (aElement0(xa))). % 0.21/0.43 cnf(i_0_48, hypothesis, (aElement0(xb))). % 0.21/0.43 cnf(i_0_47, hypothesis, (aElement0(xc))). % 0.21/0.43 cnf(i_0_44, hypothesis, (aRewritingSystem0(xR))). % 0.21/0.43 cnf(i_0_46, hypothesis, (isLocallyConfluent0(xR))). % 0.21/0.43 cnf(i_0_45, hypothesis, (isTerminating0(xR))). % 0.21/0.43 cnf(i_0_54, hypothesis, (sdtmndtplgtdt0(xa,xR,xb))). % 0.21/0.43 cnf(i_0_53, hypothesis, (sdtmndtplgtdt0(xa,xR,xc))). % 0.21/0.43 cnf(i_0_55, negated_conjecture, (~sdtmndtasgtdt0(X1,xR,xb)|~aReductOfIn0(X1,xa,xR)|~aElement0(X1))). % 0.21/0.43 cnf(i_0_3, plain, (aElement0(X1)|~aReductOfIn0(X1,X2,X3)|~aRewritingSystem0(X3)|~aElement0(X2))). % 0.21/0.43 cnf(i_0_42, plain, (aElement0(X1)|~aNormalFormOfIn0(X1,X2,X3)|~aRewritingSystem0(X3)|~aElement0(X2))). % 0.21/0.43 cnf(i_0_34, plain, (isTerminating0(X1)|~iLess0(esk11_1(X1),esk10_1(X1))|~aRewritingSystem0(X1))). % 0.21/0.43 cnf(i_0_21, plain, (isConfluent0(X1)|aElement0(esk3_1(X1))|~aRewritingSystem0(X1))). % 0.21/0.43 cnf(i_0_20, plain, (isConfluent0(X1)|aElement0(esk4_1(X1))|~aRewritingSystem0(X1))). % 0.21/0.43 cnf(i_0_19, plain, (isConfluent0(X1)|aElement0(esk5_1(X1))|~aRewritingSystem0(X1))). % 0.21/0.43 cnf(i_0_30, plain, (isLocallyConfluent0(X1)|aElement0(esk7_1(X1))|~aRewritingSystem0(X1))). % 0.21/0.43 cnf(i_0_29, plain, (isLocallyConfluent0(X1)|aElement0(esk8_1(X1))|~aRewritingSystem0(X1))). % 0.21/0.43 cnf(i_0_28, plain, (isLocallyConfluent0(X1)|aElement0(esk9_1(X1))|~aRewritingSystem0(X1))). % 0.21/0.43 cnf(i_0_40, plain, (~aNormalFormOfIn0(X1,X2,X3)|~aReductOfIn0(X4,X1,X3)|~aRewritingSystem0(X3)|~aElement0(X2))). % 0.21/0.43 cnf(i_0_37, plain, (isTerminating0(X1)|aElement0(esk10_1(X1))|~aRewritingSystem0(X1))). % 0.21/0.43 cnf(i_0_36, plain, (isTerminating0(X1)|aElement0(esk11_1(X1))|~aRewritingSystem0(X1))). % 0.21/0.43 cnf(i_0_41, plain, (sdtmndtasgtdt0(X1,X2,X3)|~aNormalFormOfIn0(X3,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.21/0.43 cnf(i_0_18, plain, (isConfluent0(X1)|sdtmndtasgtdt0(esk3_1(X1),X1,esk4_1(X1))|~aRewritingSystem0(X1))). % 0.21/0.43 cnf(i_0_13, plain, (sdtmndtasgtdt0(X1,X2,X1)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.21/0.43 cnf(i_0_12, plain, (sdtmndtasgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.21/0.43 cnf(i_0_7, plain, (sdtmndtplgtdt0(X1,X2,X3)|~aReductOfIn0(X3,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.21/0.43 cnf(i_0_17, plain, (isConfluent0(X1)|sdtmndtasgtdt0(esk3_1(X1),X1,esk5_1(X1))|~aRewritingSystem0(X1))). % 0.21/0.43 cnf(i_0_27, plain, (isLocallyConfluent0(X1)|aReductOfIn0(esk8_1(X1),esk7_1(X1),X1)|~aRewritingSystem0(X1))). % 0.21/0.43 cnf(i_0_16, plain, (isConfluent0(X1)|~sdtmndtasgtdt0(esk4_1(X1),X1,X2)|~sdtmndtasgtdt0(esk5_1(X1),X1,X2)|~aRewritingSystem0(X1)|~aElement0(X2))). % 0.21/0.43 cnf(i_0_25, plain, (isLocallyConfluent0(X1)|~sdtmndtasgtdt0(esk8_1(X1),X1,X2)|~sdtmndtasgtdt0(esk9_1(X1),X1,X2)|~aRewritingSystem0(X1)|~aElement0(X2))). % 0.21/0.43 cnf(i_0_43, plain, (aNormalFormOfIn0(esk13_2(X1,X2),X2,X1)|~isTerminating0(X1)|~aRewritingSystem0(X1)|~aElement0(X2))). % 0.21/0.43 cnf(i_0_38, plain, (iLess0(X1,X2)|~isTerminating0(X3)|~sdtmndtplgtdt0(X2,X3,X1)|~aRewritingSystem0(X3)|~aElement0(X1)|~aElement0(X2))). % 0.21/0.43 cnf(i_0_26, plain, (isLocallyConfluent0(X1)|aReductOfIn0(esk9_1(X1),esk7_1(X1),X1)|~aRewritingSystem0(X1))). % 0.21/0.43 cnf(i_0_35, plain, (isTerminating0(X1)|sdtmndtplgtdt0(esk10_1(X1),X1,esk11_1(X1))|~aRewritingSystem0(X1))). % 0.21/0.43 cnf(i_0_52, hypothesis, (aElement0(esk14_3(X1,X2,X3))|~sdtmndtasgtdt0(X1,xR,X3)|~sdtmndtasgtdt0(X1,xR,X2)|~iLess0(X1,xa)|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))). % 0.21/0.43 cnf(i_0_14, plain, (X1=X2|sdtmndtplgtdt0(X1,X3,X2)|~sdtmndtasgtdt0(X1,X3,X2)|~aRewritingSystem0(X3)|~aElement0(X2)|~aElement0(X1))). % 0.21/0.43 cnf(i_0_50, hypothesis, (sdtmndtasgtdt0(X1,xR,esk14_3(X2,X3,X1))|~sdtmndtasgtdt0(X2,xR,X3)|~sdtmndtasgtdt0(X2,xR,X1)|~iLess0(X2,xa)|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))). % 0.21/0.43 cnf(i_0_6, plain, (sdtmndtplgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X4,X2,X3)|~aReductOfIn0(X4,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.21/0.43 cnf(i_0_10, plain, (aReductOfIn0(X1,X2,X3)|aElement0(esk1_3(X2,X3,X1))|~sdtmndtplgtdt0(X2,X3,X1)|~aRewritingSystem0(X3)|~aElement0(X1)|~aElement0(X2))). % 0.21/0.44 cnf(i_0_11, plain, (sdtmndtplgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X4,X2,X3)|~sdtmndtplgtdt0(X1,X2,X4)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X4)|~aElement0(X1))). % 0.21/0.44 cnf(i_0_15, plain, (sdtmndtasgtdt0(X1,X2,X3)|~sdtmndtasgtdt0(X4,X2,X3)|~sdtmndtasgtdt0(X1,X2,X4)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X4)|~aElement0(X1))). % 0.21/0.44 cnf(i_0_24, plain, (aElement0(esk2_4(X1,X2,X3,X4))|~isConfluent0(X1)|~sdtmndtasgtdt0(X2,X1,X4)|~sdtmndtasgtdt0(X2,X1,X3)|~aRewritingSystem0(X1)|~aElement0(X4)|~aElement0(X3)|~aElement0(X2))). % 0.21/0.44 cnf(i_0_33, plain, (aElement0(esk6_4(X1,X2,X3,X4))|~isLocallyConfluent0(X1)|~aReductOfIn0(X4,X2,X1)|~aReductOfIn0(X3,X2,X1)|~aRewritingSystem0(X1)|~aElement0(X2))). % 0.21/0.44 cnf(i_0_9, plain, (aReductOfIn0(esk1_3(X1,X2,X3),X1,X2)|aReductOfIn0(X3,X1,X2)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.21/0.44 cnf(i_0_51, hypothesis, (sdtmndtasgtdt0(X1,xR,esk14_3(X2,X1,X3))|~sdtmndtasgtdt0(X2,xR,X3)|~sdtmndtasgtdt0(X2,xR,X1)|~iLess0(X2,xa)|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))). % 0.21/0.44 cnf(i_0_39, plain, (aNormalFormOfIn0(X1,X2,X3)|aReductOfIn0(esk12_3(X2,X3,X1),X1,X3)|~sdtmndtasgtdt0(X2,X3,X1)|~aRewritingSystem0(X3)|~aElement0(X2)|~aElement0(X1))). % 0.21/0.44 cnf(i_0_8, plain, (sdtmndtplgtdt0(esk1_3(X1,X2,X3),X2,X3)|aReductOfIn0(X3,X1,X2)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.21/0.44 cnf(i_0_22, plain, (sdtmndtasgtdt0(X1,X2,esk2_4(X2,X3,X4,X1))|~isConfluent0(X2)|~sdtmndtasgtdt0(X3,X2,X4)|~sdtmndtasgtdt0(X3,X2,X1)|~aRewritingSystem0(X2)|~aElement0(X4)|~aElement0(X3)|~aElement0(X1))). % 0.21/0.44 cnf(i_0_23, plain, (sdtmndtasgtdt0(X1,X2,esk2_4(X2,X3,X1,X4))|~isConfluent0(X2)|~sdtmndtasgtdt0(X3,X2,X4)|~sdtmndtasgtdt0(X3,X2,X1)|~aRewritingSystem0(X2)|~aElement0(X4)|~aElement0(X3)|~aElement0(X1))). % 0.21/0.44 cnf(i_0_31, plain, (sdtmndtasgtdt0(X1,X2,esk6_4(X2,X3,X4,X1))|~isLocallyConfluent0(X2)|~aReductOfIn0(X4,X3,X2)|~aReductOfIn0(X1,X3,X2)|~aRewritingSystem0(X2)|~aElement0(X3))). % 0.21/0.44 cnf(i_0_32, plain, (sdtmndtasgtdt0(X1,X2,esk6_4(X2,X3,X1,X4))|~isLocallyConfluent0(X2)|~aReductOfIn0(X4,X3,X2)|~aReductOfIn0(X1,X3,X2)|~aRewritingSystem0(X2)|~aElement0(X3))). % 0.21/0.44 cnf(i_0_472, plain, (X62=X62)). % 0.21/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.44 # Begin printing tableau % 0.21/0.44 # Found 12 steps % 0.21/0.44 cnf(i_0_49, hypothesis, (aElement0(xa)), inference(start_rule)). % 0.21/0.44 cnf(i_0_486, plain, (aElement0(xa)), inference(extension_rule, [i_0_55])). % 0.21/0.44 cnf(i_0_904, plain, (~sdtmndtasgtdt0(xa,xR,xb)), inference(extension_rule, [i_0_481])). % 0.21/0.44 cnf(i_0_1187, plain, ($false), inference(closure_rule, [i_0_472])). % 0.21/0.44 cnf(i_0_1188, plain, ($false), inference(closure_rule, [i_0_472])). % 0.21/0.44 cnf(i_0_905, plain, (~aReductOfIn0(xa,xa,xR)), inference(etableau_closure_rule, [i_0_905, ...])). % 0.21/0.44 cnf(i_0_1190, plain, (~sdtmndtasgtdt0(xa,xR,xb)), inference(extension_rule, [i_0_41])). % 0.21/0.44 cnf(i_0_1361, plain, (~aRewritingSystem0(xR)), inference(closure_rule, [i_0_44])). % 0.21/0.44 cnf(i_0_1362, plain, (~aElement0(xa)), inference(closure_rule, [i_0_49])). % 0.21/0.44 cnf(i_0_1189, plain, ($false), inference(extension_rule, [i_0_473])). % 0.21/0.44 cnf(i_0_1659, plain, ($false), inference(closure_rule, [i_0_472])). % 0.21/0.44 cnf(i_0_1360, plain, (~aNormalFormOfIn0(xb,xa,xR)), inference(etableau_closure_rule, [i_0_1360, ...])). % 0.21/0.44 # End printing tableau % 0.21/0.44 # SZS output end % 0.21/0.44 # Branches closed with saturation will be marked with an "s" % 0.21/0.44 # Child (12693) has found a proof. % 0.21/0.44 % 0.21/0.44 # Proof search is over... % 0.21/0.44 # Freeing feature tree %------------------------------------------------------------------------------