%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COM022+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 : n008.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:15:02 EDT 2022 % Result : Theorem 0.20s 0.44s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : COM022+1 : TPTP v8.1.0. Released v4.0.0. % 0.14/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.15/0.34 % Computer : n008.cluster.edu % 0.15/0.34 % Model : x86_64 x86_64 % 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.34 % Memory : 8042.1875MB % 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.34 % CPULimit : 300 % 0.15/0.34 % WCLimit : 600 % 0.15/0.34 % DateTime : Thu Jun 16 20:02:07 EDT 2022 % 0.15/0.34 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 63 Number of unprocessed: 63 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 63 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 15 conjectures. % 0.20/0.38 # There are 15 start rule candidates: % 0.20/0.38 # Found 8 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 15 start rule tableaux created. % 0.20/0.38 # 55 extension rule candidate clauses % 0.20/0.38 # 8 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.44 # There were 5 total branch saturation attempts. % 0.20/0.44 # There were 0 of these attempts blocked. % 0.20/0.44 # There were 0 deferred branch saturation attempts. % 0.20/0.44 # There were 0 free duplicated saturations. % 0.20/0.44 # There were 5 total successful branch saturations. % 0.20/0.44 # There were 0 successful branch saturations in interreduction. % 0.20/0.44 # There were 0 successful branch saturations on the branch. % 0.20/0.44 # There were 5 successful branch saturations after the branch. % 0.20/0.44 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.44 # Begin clausification derivation % 0.20/0.44 % 0.20/0.44 # End clausification derivation % 0.20/0.44 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.44 cnf(i_0_49, hypothesis, (aElement0(xa))). % 0.20/0.44 cnf(i_0_48, hypothesis, (aElement0(xb))). % 0.20/0.44 cnf(i_0_47, hypothesis, (aElement0(xc))). % 0.20/0.44 cnf(i_0_55, negated_conjecture, (sdtmndtasgtdt0(xa,xR,xb))). % 0.20/0.44 cnf(i_0_54, negated_conjecture, (sdtmndtasgtdt0(xa,xR,xc))). % 0.20/0.44 cnf(i_0_44, hypothesis, (aRewritingSystem0(xR))). % 0.20/0.44 cnf(i_0_46, hypothesis, (isLocallyConfluent0(xR))). % 0.20/0.44 cnf(i_0_45, hypothesis, (isTerminating0(xR))). % 0.20/0.44 cnf(i_0_53, negated_conjecture, (~sdtmndtasgtdt0(xb,xR,X1)|~sdtmndtasgtdt0(xc,xR,X1)|~aElement0(X1))). % 0.20/0.44 cnf(i_0_3, plain, (aElement0(X1)|~aReductOfIn0(X1,X2,X3)|~aRewritingSystem0(X3)|~aElement0(X2))). % 0.20/0.44 cnf(i_0_42, plain, (aElement0(X1)|~aNormalFormOfIn0(X1,X2,X3)|~aRewritingSystem0(X3)|~aElement0(X2))). % 0.20/0.44 cnf(i_0_67, negated_conjecture, (aElement0(esk15_0)|~sdtmndtplgtdt0(xa,xR,xb)|~sdtmndtplgtdt0(xa,xR,xc))). % 0.20/0.44 cnf(i_0_64, negated_conjecture, (aElement0(esk16_0)|~sdtmndtplgtdt0(xa,xR,xb)|~sdtmndtplgtdt0(xa,xR,xc))). % 0.20/0.44 cnf(i_0_61, negated_conjecture, (aElement0(esk17_0)|~sdtmndtplgtdt0(xa,xR,xb)|~sdtmndtplgtdt0(xa,xR,xc))). % 0.20/0.44 cnf(i_0_57, negated_conjecture, (sdtmndtasgtdt0(xb,xR,esk18_0)|~sdtmndtplgtdt0(xa,xR,xb)|~sdtmndtplgtdt0(xa,xR,xc))). % 0.20/0.44 cnf(i_0_56, negated_conjecture, (sdtmndtasgtdt0(xc,xR,esk18_0)|~sdtmndtplgtdt0(xa,xR,xb)|~sdtmndtplgtdt0(xa,xR,xc))). % 0.20/0.44 cnf(i_0_21, plain, (isConfluent0(X1)|aElement0(esk3_1(X1))|~aRewritingSystem0(X1))). % 0.20/0.44 cnf(i_0_66, negated_conjecture, (aReductOfIn0(esk15_0,xa,xR)|~sdtmndtplgtdt0(xa,xR,xb)|~sdtmndtplgtdt0(xa,xR,xc))). % 0.20/0.44 cnf(i_0_34, plain, (isTerminating0(X1)|~iLess0(esk11_1(X1),esk10_1(X1))|~aRewritingSystem0(X1))). % 0.20/0.44 cnf(i_0_40, plain, (~aNormalFormOfIn0(X1,X2,X3)|~aReductOfIn0(X4,X1,X3)|~aRewritingSystem0(X3)|~aElement0(X2))). % 0.20/0.44 cnf(i_0_20, plain, (isConfluent0(X1)|aElement0(esk4_1(X1))|~aRewritingSystem0(X1))). % 0.20/0.44 cnf(i_0_19, plain, (isConfluent0(X1)|aElement0(esk5_1(X1))|~aRewritingSystem0(X1))). % 0.20/0.44 cnf(i_0_63, negated_conjecture, (aReductOfIn0(esk16_0,xa,xR)|~sdtmndtplgtdt0(xa,xR,xb)|~sdtmndtplgtdt0(xa,xR,xc))). % 0.20/0.44 cnf(i_0_65, negated_conjecture, (sdtmndtasgtdt0(esk15_0,xR,xb)|~sdtmndtplgtdt0(xa,xR,xb)|~sdtmndtplgtdt0(xa,xR,xc))). % 0.20/0.44 cnf(i_0_60, negated_conjecture, (sdtmndtasgtdt0(esk15_0,xR,esk17_0)|~sdtmndtplgtdt0(xa,xR,xb)|~sdtmndtplgtdt0(xa,xR,xc))). % 0.20/0.44 cnf(i_0_62, negated_conjecture, (sdtmndtasgtdt0(esk16_0,xR,xc)|~sdtmndtplgtdt0(xa,xR,xb)|~sdtmndtplgtdt0(xa,xR,xc))). % 0.20/0.44 cnf(i_0_59, negated_conjecture, (sdtmndtasgtdt0(esk16_0,xR,esk17_0)|~sdtmndtplgtdt0(xa,xR,xb)|~sdtmndtplgtdt0(xa,xR,xc))). % 0.20/0.44 cnf(i_0_30, plain, (isLocallyConfluent0(X1)|aElement0(esk7_1(X1))|~aRewritingSystem0(X1))). % 0.20/0.44 cnf(i_0_58, negated_conjecture, (aNormalFormOfIn0(esk18_0,esk17_0,xR)|~sdtmndtplgtdt0(xa,xR,xb)|~sdtmndtplgtdt0(xa,xR,xc))). % 0.20/0.44 cnf(i_0_29, plain, (isLocallyConfluent0(X1)|aElement0(esk8_1(X1))|~aRewritingSystem0(X1))). % 0.20/0.44 cnf(i_0_28, plain, (isLocallyConfluent0(X1)|aElement0(esk9_1(X1))|~aRewritingSystem0(X1))). % 0.20/0.44 cnf(i_0_37, plain, (isTerminating0(X1)|aElement0(esk10_1(X1))|~aRewritingSystem0(X1))). % 0.20/0.44 cnf(i_0_36, plain, (isTerminating0(X1)|aElement0(esk11_1(X1))|~aRewritingSystem0(X1))). % 0.20/0.44 cnf(i_0_18, plain, (isConfluent0(X1)|sdtmndtasgtdt0(esk3_1(X1),X1,esk4_1(X1))|~aRewritingSystem0(X1))). % 0.20/0.44 cnf(i_0_41, plain, (sdtmndtasgtdt0(X1,X2,X3)|~aNormalFormOfIn0(X3,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.20/0.44 cnf(i_0_13, plain, (sdtmndtasgtdt0(X1,X2,X1)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.20/0.44 cnf(i_0_7, plain, (sdtmndtplgtdt0(X1,X2,X3)|~aReductOfIn0(X3,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X1))). % 0.20/0.44 cnf(i_0_17, plain, (isConfluent0(X1)|sdtmndtasgtdt0(esk3_1(X1),X1,esk5_1(X1))|~aRewritingSystem0(X1))). % 0.20/0.44 cnf(i_0_35, plain, (isTerminating0(X1)|sdtmndtplgtdt0(esk10_1(X1),X1,esk11_1(X1))|~aRewritingSystem0(X1))). % 0.20/0.44 cnf(i_0_12, plain, (sdtmndtasgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X1,X2,X3)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.20/0.44 cnf(i_0_16, plain, (isConfluent0(X1)|~sdtmndtasgtdt0(esk4_1(X1),X1,X2)|~sdtmndtasgtdt0(esk5_1(X1),X1,X2)|~aRewritingSystem0(X1)|~aElement0(X2))). % 0.20/0.44 cnf(i_0_25, plain, (isLocallyConfluent0(X1)|~sdtmndtasgtdt0(esk8_1(X1),X1,X2)|~sdtmndtasgtdt0(esk9_1(X1),X1,X2)|~aRewritingSystem0(X1)|~aElement0(X2))). % 0.20/0.44 cnf(i_0_43, plain, (aNormalFormOfIn0(esk13_2(X1,X2),X2,X1)|~isTerminating0(X1)|~aRewritingSystem0(X1)|~aElement0(X2))). % 0.20/0.44 cnf(i_0_27, plain, (isLocallyConfluent0(X1)|aReductOfIn0(esk8_1(X1),esk7_1(X1),X1)|~aRewritingSystem0(X1))). % 0.20/0.44 cnf(i_0_26, plain, (isLocallyConfluent0(X1)|aReductOfIn0(esk9_1(X1),esk7_1(X1),X1)|~aRewritingSystem0(X1))). % 0.20/0.44 cnf(i_0_14, plain, (X1=X2|sdtmndtplgtdt0(X1,X3,X2)|~sdtmndtasgtdt0(X1,X3,X2)|~aRewritingSystem0(X3)|~aElement0(X2)|~aElement0(X1))). % 0.20/0.44 cnf(i_0_38, plain, (iLess0(X1,X2)|~isTerminating0(X3)|~sdtmndtplgtdt0(X2,X3,X1)|~aRewritingSystem0(X3)|~aElement0(X1)|~aElement0(X2))). % 0.20/0.44 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.20/0.44 cnf(i_0_6, plain, (sdtmndtplgtdt0(X1,X2,X3)|~sdtmndtplgtdt0(X4,X2,X3)|~aReductOfIn0(X4,X1,X2)|~aRewritingSystem0(X2)|~aElement0(X3)|~aElement0(X1))). % 0.20/0.44 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.20/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.20/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.20/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.20/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.20/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.20/0.44 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.20/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.20/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.20/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.20/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.20/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.20/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.20/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.20/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.44 # Begin printing tableau % 0.20/0.44 # Found 13 steps % 0.20/0.44 cnf(i_0_58, negated_conjecture, (aNormalFormOfIn0(esk18_0,esk17_0,xR)|~sdtmndtplgtdt0(xa,xR,xb)|~sdtmndtplgtdt0(xa,xR,xc)), inference(start_rule)). % 0.20/0.44 cnf(i_0_69, plain, (aNormalFormOfIn0(esk18_0,esk17_0,xR)), inference(extension_rule, [i_0_42])). % 0.20/0.44 cnf(i_0_116, plain, (~aRewritingSystem0(xR)), inference(closure_rule, [i_0_44])). % 0.20/0.44 cnf(i_0_114, plain, (aElement0(esk18_0)), inference(extension_rule, [i_0_3])). % 0.20/0.44 cnf(i_0_120, plain, (~aRewritingSystem0(xR)), inference(closure_rule, [i_0_44])). % 0.20/0.44 cnf(i_0_70, plain, (~sdtmndtplgtdt0(xa,xR,xb)), inference(etableau_closure_rule, [i_0_70, ...])). % 0.20/0.44 cnf(i_0_71, plain, (~sdtmndtplgtdt0(xa,xR,xc)), inference(etableau_closure_rule, [i_0_71, ...])). % 0.20/0.44 cnf(i_0_117, plain, (~aElement0(esk17_0)), inference(etableau_closure_rule, [i_0_117, ...])). % 0.20/0.44 cnf(i_0_118, plain, (aElement0(esk17_0)), inference(extension_rule, [i_0_40])). % 0.20/0.44 cnf(i_0_217, plain, (~aNormalFormOfIn0(esk18_0,esk17_0,xR)), inference(closure_rule, [i_0_69])). % 0.20/0.44 cnf(i_0_219, plain, (~aRewritingSystem0(xR)), inference(closure_rule, [i_0_44])). % 0.20/0.44 cnf(i_0_119, plain, (~aReductOfIn0(esk17_0,esk18_0,xR)), inference(etableau_closure_rule, [i_0_119, ...])). % 0.20/0.44 cnf(i_0_218, plain, (~aReductOfIn0(X8,esk18_0,xR)), inference(etableau_closure_rule, [i_0_218, ...])). % 0.20/0.44 # End printing tableau % 0.20/0.44 # SZS output end % 0.20/0.44 # Branches closed with saturation will be marked with an "s" % 0.20/0.44 # Child (16952) has found a proof. % 0.20/0.44 % 0.20/0.44 # Proof search is over... % 0.20/0.44 # Freeing feature tree %------------------------------------------------------------------------------