%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COM013+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 : n016.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:57 EDT 2022 % Result : Theorem 2.04s 0.67s % Output : CNFRefutation 2.04s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : COM013+1 : TPTP v8.1.0. Released v4.0.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.12/0.33 % Computer : n016.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 : Thu Jun 16 17:26:04 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y % 0.12/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.37 # % 0.12/0.37 # Number of axioms: 43 Number of unprocessed: 43 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 43 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 3 conjectures. % 0.12/0.37 # There are 3 start rule candidates: % 0.12/0.37 # Found 4 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 3 start rule tableaux created. % 0.12/0.37 # 39 extension rule candidate clauses % 0.12/0.37 # 4 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.12/0.37 # Returning from population with 54 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 54 tableaux to operate on % 0.18/0.38 # Creating equality axioms % 0.18/0.38 # Ran out of tableaux, making start rules for all clauses % 0.18/0.38 # Creating equality axioms % 0.18/0.38 # Ran out of tableaux, making start rules for all clauses % 2.04/0.67 # There were 7 total branch saturation attempts. % 2.04/0.67 # There were 0 of these attempts blocked. % 2.04/0.67 # There were 0 deferred branch saturation attempts. % 2.04/0.67 # There were 2 free duplicated saturations. % 2.04/0.67 # There were 7 total successful branch saturations. % 2.04/0.67 # There were 3 successful branch saturations in interreduction. % 2.04/0.67 # There were 0 successful branch saturations on the branch. % 2.04/0.67 # There were 2 successful branch saturations after the branch. % 2.04/0.67 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.04/0.67 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.04/0.67 # Begin clausification derivation % 2.04/0.67 % 2.04/0.67 # End clausification derivation % 2.04/0.67 # Begin listing active clauses obtained from FOF to CNF conversion % 2.04/0.67 cnf(i_0_47, negated_conjecture, (aElement0(esk13_0))). % 2.04/0.67 cnf(i_0_44, hypothesis, (aRewritingSystem0(xR))). % 2.04/0.67 cnf(i_0_43, hypothesis, (isTerminating0(xR))). % 2.04/0.67 cnf(i_0_21, plain, (isConfluent0(X1)|aElement0(esk3_1(X1))|~aRewritingSystem0(X1))). % 2.04/0.67 cnf(i_0_20, plain, (isConfluent0(X1)|aElement0(esk4_1(X1))|~aRewritingSystem0(X1))). % 2.04/0.67 cnf(i_0_19, plain, (isConfluent0(X1)|aElement0(esk5_1(X1))|~aRewritingSystem0(X1))). % 2.04/0.67 cnf(i_0_30, plain, (isLocallyConfluent0(X1)|aElement0(esk7_1(X1))|~aRewritingSystem0(X1))). % 2.04/0.67 cnf(i_0_29, plain, (isLocallyConfluent0(X1)|aElement0(esk8_1(X1))|~aRewritingSystem0(X1))). % 2.04/0.67 cnf(i_0_28, plain, (isLocallyConfluent0(X1)|aElement0(esk9_1(X1))|~aRewritingSystem0(X1))). % 2.04/0.67 cnf(i_0_37, plain, (isTerminating0(X1)|aElement0(esk10_1(X1))|~aRewritingSystem0(X1))). % 2.04/0.67 cnf(i_0_36, plain, (isTerminating0(X1)|aElement0(esk11_1(X1))|~aRewritingSystem0(X1))). % 2.04/0.67 cnf(i_0_34, plain, (isTerminating0(X1)|~aRewritingSystem0(X1)|~iLess0(esk11_1(X1),esk10_1(X1)))). % 2.04/0.67 cnf(i_0_18, plain, (isConfluent0(X1)|sdtmndtasgtdt0(esk3_1(X1),X1,esk4_1(X1))|~aRewritingSystem0(X1))). % 2.04/0.67 cnf(i_0_17, plain, (isConfluent0(X1)|sdtmndtasgtdt0(esk3_1(X1),X1,esk5_1(X1))|~aRewritingSystem0(X1))). % 2.04/0.67 cnf(i_0_35, plain, (isTerminating0(X1)|sdtmndtplgtdt0(esk10_1(X1),X1,esk11_1(X1))|~aRewritingSystem0(X1))). % 2.04/0.67 cnf(i_0_27, plain, (isLocallyConfluent0(X1)|aReductOfIn0(esk8_1(X1),esk7_1(X1),X1)|~aRewritingSystem0(X1))). % 2.04/0.67 cnf(i_0_26, plain, (isLocallyConfluent0(X1)|aReductOfIn0(esk9_1(X1),esk7_1(X1),X1)|~aRewritingSystem0(X1))). % 2.04/0.67 cnf(i_0_13, plain, (sdtmndtasgtdt0(X1,X3,X2)|X1!=X2|~aElement0(X2)|~aElement0(X1)|~aRewritingSystem0(X3))). % 2.04/0.67 cnf(i_0_45, negated_conjecture, (~aNormalFormOfIn0(X1,esk13_0,xR))). % 2.04/0.67 cnf(i_0_46, negated_conjecture, (aNormalFormOfIn0(esk14_1(X1),X1,xR)|~aElement0(X1)|~iLess0(X1,esk13_0))). % 2.04/0.67 cnf(i_0_3, plain, (aElement0(X3)|~aElement0(X1)|~aRewritingSystem0(X2)|~aReductOfIn0(X3,X1,X2))). % 2.04/0.67 cnf(i_0_42, plain, (aElement0(X1)|~aElement0(X2)|~aRewritingSystem0(X3)|~aNormalFormOfIn0(X1,X2,X3))). % 2.04/0.67 cnf(i_0_38, plain, (iLess0(X3,X2)|~aElement0(X3)|~aElement0(X2)|~aRewritingSystem0(X1)|~isTerminating0(X1)|~sdtmndtplgtdt0(X2,X1,X3))). % 2.04/0.67 cnf(i_0_41, plain, (sdtmndtasgtdt0(X1,X2,X3)|~aElement0(X1)|~aRewritingSystem0(X2)|~aNormalFormOfIn0(X3,X1,X2))). % 2.04/0.67 cnf(i_0_7, plain, (sdtmndtplgtdt0(X2,X3,X1)|~aElement0(X2)|~aElement0(X1)|~aRewritingSystem0(X3)|~aReductOfIn0(X1,X2,X3))). % 2.04/0.67 cnf(i_0_12, plain, (sdtmndtasgtdt0(X1,X2,X3)|~aElement0(X3)|~aElement0(X1)|~aRewritingSystem0(X2)|~sdtmndtplgtdt0(X1,X2,X3))). % 2.04/0.67 cnf(i_0_14, plain, (X1=X3|sdtmndtplgtdt0(X1,X2,X3)|~aElement0(X3)|~aElement0(X1)|~aRewritingSystem0(X2)|~sdtmndtasgtdt0(X1,X2,X3))). % 2.04/0.67 cnf(i_0_40, plain, (~aElement0(X4)|~aRewritingSystem0(X3)|~aReductOfIn0(X1,X2,X3)|~aNormalFormOfIn0(X2,X4,X3))). % 2.04/0.67 cnf(i_0_16, plain, (isConfluent0(X2)|~aElement0(X1)|~aRewritingSystem0(X2)|~sdtmndtasgtdt0(esk4_1(X2),X2,X1)|~sdtmndtasgtdt0(esk5_1(X2),X2,X1))). % 2.04/0.67 cnf(i_0_25, plain, (isLocallyConfluent0(X2)|~aElement0(X1)|~aRewritingSystem0(X2)|~sdtmndtasgtdt0(esk8_1(X2),X2,X1)|~sdtmndtasgtdt0(esk9_1(X2),X2,X1))). % 2.04/0.67 cnf(i_0_6, plain, (sdtmndtplgtdt0(X2,X3,X4)|~aElement0(X4)|~aElement0(X2)|~aElement0(X1)|~aRewritingSystem0(X3)|~aReductOfIn0(X1,X2,X3)|~sdtmndtplgtdt0(X1,X3,X4))). % 2.04/0.67 cnf(i_0_11, plain, (sdtmndtplgtdt0(X1,X2,X4)|~aElement0(X4)|~aElement0(X3)|~aElement0(X1)|~aRewritingSystem0(X2)|~sdtmndtplgtdt0(X3,X2,X4)|~sdtmndtplgtdt0(X1,X2,X3))). % 2.04/0.67 cnf(i_0_15, plain, (sdtmndtasgtdt0(X1,X2,X4)|~aElement0(X4)|~aElement0(X3)|~aElement0(X1)|~aRewritingSystem0(X2)|~sdtmndtasgtdt0(X3,X2,X4)|~sdtmndtasgtdt0(X1,X2,X3))). % 2.04/0.67 cnf(i_0_10, plain, (aReductOfIn0(X3,X1,X2)|aElement0(esk1_3(X1,X2,X3))|~aElement0(X3)|~aElement0(X1)|~aRewritingSystem0(X2)|~sdtmndtplgtdt0(X1,X2,X3))). % 2.04/0.67 cnf(i_0_9, plain, (aReductOfIn0(X3,X1,X2)|aReductOfIn0(esk1_3(X1,X2,X3),X1,X2)|~aElement0(X3)|~aElement0(X1)|~aRewritingSystem0(X2)|~sdtmndtplgtdt0(X1,X2,X3))). % 2.04/0.67 cnf(i_0_8, plain, (aReductOfIn0(X3,X1,X2)|sdtmndtplgtdt0(esk1_3(X1,X2,X3),X2,X3)|~aElement0(X3)|~aElement0(X1)|~aRewritingSystem0(X2)|~sdtmndtplgtdt0(X1,X2,X3))). % 2.04/0.67 cnf(i_0_39, plain, (aNormalFormOfIn0(X1,X2,X3)|aReductOfIn0(esk12_3(X2,X3,X1),X1,X3)|~aElement0(X2)|~aElement0(X1)|~aRewritingSystem0(X3)|~sdtmndtasgtdt0(X2,X3,X1))). % 2.04/0.67 cnf(i_0_24, plain, (aElement0(esk2_4(X1,X2,X3,X4))|~aElement0(X4)|~aElement0(X3)|~aElement0(X2)|~aRewritingSystem0(X1)|~isConfluent0(X1)|~sdtmndtasgtdt0(X2,X1,X4)|~sdtmndtasgtdt0(X2,X1,X3))). % 2.04/0.67 cnf(i_0_33, plain, (aElement0(esk6_4(X1,X2,X3,X4))|~aElement0(X4)|~aElement0(X3)|~aElement0(X2)|~aRewritingSystem0(X1)|~isLocallyConfluent0(X1)|~aReductOfIn0(X4,X2,X1)|~aReductOfIn0(X3,X2,X1))). % 2.04/0.67 cnf(i_0_22, plain, (sdtmndtasgtdt0(X1,X2,esk2_4(X2,X3,X4,X1))|~aElement0(X4)|~aElement0(X3)|~aElement0(X1)|~aRewritingSystem0(X2)|~isConfluent0(X2)|~sdtmndtasgtdt0(X3,X2,X4)|~sdtmndtasgtdt0(X3,X2,X1))). % 2.04/0.67 cnf(i_0_23, plain, (sdtmndtasgtdt0(X1,X2,esk2_4(X2,X3,X1,X4))|~aElement0(X4)|~aElement0(X3)|~aElement0(X1)|~aRewritingSystem0(X2)|~isConfluent0(X2)|~sdtmndtasgtdt0(X3,X2,X4)|~sdtmndtasgtdt0(X3,X2,X1))). % 2.04/0.67 cnf(i_0_31, plain, (sdtmndtasgtdt0(X1,X2,esk6_4(X2,X3,X4,X1))|~aElement0(X4)|~aElement0(X3)|~aElement0(X1)|~aRewritingSystem0(X2)|~isLocallyConfluent0(X2)|~aReductOfIn0(X4,X3,X2)|~aReductOfIn0(X1,X3,X2))). % 2.04/0.67 cnf(i_0_32, plain, (sdtmndtasgtdt0(X1,X2,esk6_4(X2,X3,X1,X4))|~aElement0(X4)|~aElement0(X3)|~aElement0(X1)|~aRewritingSystem0(X2)|~isLocallyConfluent0(X2)|~aReductOfIn0(X4,X3,X2)|~aReductOfIn0(X1,X3,X2))). % 2.04/0.67 cnf(i_0_1963, plain, (X58=X58)). % 2.04/0.67 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.04/0.67 # Begin printing tableau % 2.04/0.67 # Found 8 steps % 2.04/0.67 cnf(i_0_1963, plain, (esk13_0=esk13_0), inference(start_rule)). % 2.04/0.67 cnf(i_0_2172, plain, (esk13_0=esk13_0), inference(extension_rule, [i_0_1967])). % 2.04/0.67 cnf(i_0_5465, plain, (~aElement0(esk13_0)), inference(closure_rule, [i_0_47])). % 2.04/0.67 cnf(i_0_5463, plain, (aElement0(esk13_0)), inference(extension_rule, [i_0_7])). % 2.04/0.67 cnf(i_0_8440, plain, (~aElement0(esk13_0)), inference(closure_rule, [i_0_47])). % 2.04/0.67 cnf(i_0_8441, plain, (~aRewritingSystem0(xR)), inference(closure_rule, [i_0_44])). % 2.04/0.67 cnf(i_0_8438, plain, (sdtmndtplgtdt0(esk13_0,xR,esk13_0)), inference(etableau_closure_rule, [i_0_8438, ...])). % 2.04/0.67 cnf(i_0_8442, plain, (~aReductOfIn0(esk13_0,esk13_0,xR)), inference(etableau_closure_rule, [i_0_8442, ...])). % 2.04/0.67 # End printing tableau % 2.04/0.67 # SZS output end % 2.04/0.67 # Branches closed with saturation will be marked with an "s" % 2.46/0.68 # Child (15227) has found a proof. % 2.46/0.68 % 2.46/0.68 # Proof search is over... % 2.46/0.68 # Freeing feature tree %------------------------------------------------------------------------------