%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM467+2 : 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 : n026.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 : Mon Jul 18 09:41:19 EDT 2022 % Result : Theorem 0.20s 0.52s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : NUM467+2 : TPTP v8.1.0. Released v4.0.0. % 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n026.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Thu Jul 7 09:21:54 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic U_____100_C07_23_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: 64 Number of unprocessed: 59 % 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 # 59 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 2 conjectures. % 0.20/0.38 # There are 2 start rule candidates: % 0.20/0.38 # Found 13 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 2 start rule tableaux created. % 0.20/0.38 # 46 extension rule candidate clauses % 0.20/0.38 # 13 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 2 % 0.20/0.38 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.20/0.38 # We now have 11 tableaux to operate on % 0.20/0.52 # There were 6 total branch saturation attempts. % 0.20/0.52 # There were 0 of these attempts blocked. % 0.20/0.52 # There were 0 deferred branch saturation attempts. % 0.20/0.52 # There were 0 free duplicated saturations. % 0.20/0.52 # There were 6 total successful branch saturations. % 0.20/0.52 # There were 0 successful branch saturations in interreduction. % 0.20/0.52 # There were 0 successful branch saturations on the branch. % 0.20/0.52 # There were 6 successful branch saturations after the branch. % 0.20/0.52 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.52 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.52 # Begin clausification derivation % 0.20/0.52 % 0.20/0.52 # End clausification derivation % 0.20/0.52 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.52 cnf(i_0_2, plain, (aNaturalNumber0(sz00))). % 0.20/0.52 cnf(i_0_4, plain, (aNaturalNumber0(sz10))). % 0.20/0.52 cnf(i_0_59, hypothesis, (aNaturalNumber0(xl))). % 0.20/0.52 cnf(i_0_58, hypothesis, (aNaturalNumber0(xm))). % 0.20/0.52 cnf(i_0_57, hypothesis, (aNaturalNumber0(xn))). % 0.20/0.52 cnf(i_0_65, hypothesis, (aNaturalNumber0(esk3_0))). % 0.20/0.52 cnf(i_0_62, hypothesis, (aNaturalNumber0(esk4_0))). % 0.20/0.52 cnf(i_0_63, hypothesis, (doDivides0(xl,xm))). % 0.20/0.52 cnf(i_0_60, hypothesis, (doDivides0(xl,xn))). % 0.20/0.52 cnf(i_0_64, hypothesis, (sdtasdt0(xl,esk3_0)=xm)). % 0.20/0.52 cnf(i_0_61, hypothesis, (sdtasdt0(xl,esk4_0)=xn)). % 0.20/0.52 cnf(i_0_3, plain, (sz10!=sz00)). % 0.20/0.52 cnf(i_0_66, negated_conjecture, (~doDivides0(xl,sdtpldt0(xm,xn)))). % 0.20/0.52 cnf(i_0_67, negated_conjecture, (sdtpldt0(xm,xn)!=sdtasdt0(xl,X1)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_32, plain, (sdtlseqdt0(X1,X1)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_23, plain, (X1=sz00|sdtpldt0(X2,X1)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_24, plain, (X1=sz00|sdtpldt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_33, plain, (X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_13, plain, (sdtasdt0(sz10,X1)=X1|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_15, plain, (sdtasdt0(sz00,X1)=sz00|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_16, plain, (sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_14, plain, (sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_45, plain, (X1=sz10|X1=sz00|sdtlseqdt0(sz10,X1)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_5, plain, (aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_6, plain, (aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_47, plain, (X1=sz00|sdtlseqdt0(X2,sdtasdt0(X2,X1))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_35, plain, (sdtlseqdt0(X1,X2)|sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_11, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_28, plain, (aNaturalNumber0(esk1_2(X1,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_52, plain, (aNaturalNumber0(esk2_2(X1,X2))|~doDivides0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_49, plain, (X1=X2|iLess0(X1,X2)|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_20, plain, (X1=X2|sdtpldt0(X3,X1)!=sdtpldt0(X3,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))). % 0.20/0.52 cnf(i_0_19, plain, (X1=X2|sdtpldt0(X1,X3)!=sdtpldt0(X2,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_25, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_31, plain, (aNaturalNumber0(sdtmndt0(X1,X2))|~sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_50, plain, (doDivides0(X1,sdtasdt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.52 cnf(i_0_26, plain, (sdtlseqdt0(X1,sdtpldt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.52 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_12, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_51, plain, (sdtasdt0(X1,esk2_2(X1,X2))=X2|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.52 cnf(i_0_27, plain, (sdtpldt0(X1,esk1_2(X1,X2))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_34, plain, (sdtlseqdt0(X1,X2)|~sdtlseqdt0(X3,X2)|~sdtlseqdt0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_39, plain, (X1=X2|sdtlseqdt0(sdtpldt0(X3,X1),sdtpldt0(X3,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))). % 0.20/0.52 cnf(i_0_37, plain, (X1=X2|sdtlseqdt0(sdtpldt0(X1,X3),sdtpldt0(X2,X3))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_43, plain, (X1=sz00|X2=X3|sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))|~sdtlseqdt0(X2,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_41, plain, (X1=sz00|X2=X3|sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))|~sdtlseqdt0(X2,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.52 cnf(i_0_55, plain, (X1=sz00|aNaturalNumber0(sdtsldt0(X2,X1))|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.52 cnf(i_0_30, plain, (sdtpldt0(X1,sdtmndt0(X2,X1))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_22, plain, (X1=sz00|X2=X3|sdtasdt0(X1,X2)!=sdtasdt0(X1,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_21, plain, (X1=sz00|X2=X3|sdtasdt0(X2,X1)!=sdtasdt0(X3,X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.52 cnf(i_0_56, plain, (doDivides0(X1,X2)|~doDivides0(X3,X2)|~doDivides0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.20/0.52 cnf(i_0_29, plain, (sdtmndt0(sdtpldt0(X1,X2),X1)=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.52 cnf(i_0_54, plain, (sdtasdt0(X1,sdtsldt0(X2,X1))=X2|X1=sz00|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.52 cnf(i_0_53, plain, (sdtsldt0(sdtasdt0(X1,X2),X1)=X2|X1=sz00|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.52 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.52 # Begin printing tableau % 0.20/0.52 # Found 12 steps % 0.20/0.52 cnf(i_0_67, negated_conjecture, (sdtpldt0(xm,xn)!=sdtasdt0(xl,sz00)|~aNaturalNumber0(sz00)), inference(start_rule)). % 0.20/0.52 cnf(i_0_78, plain, (~aNaturalNumber0(sz00)), inference(closure_rule, [i_0_2])). % 0.20/0.52 cnf(i_0_77, plain, (sdtpldt0(xm,xn)!=sdtasdt0(xl,sz00)), inference(extension_rule, [i_0_22])). % 0.20/0.52 cnf(i_0_234, plain, (sz10=sz00), inference(closure_rule, [i_0_3])). % 0.20/0.52 cnf(i_0_239, plain, (~aNaturalNumber0(sz10)), inference(closure_rule, [i_0_4])). % 0.20/0.52 cnf(i_0_236, plain, (sdtasdt0(sz10,sdtpldt0(xm,xn))!=sdtasdt0(sz10,sdtasdt0(xl,sz00))), inference(extension_rule, [i_0_33])). % 0.20/0.52 cnf(i_0_237, plain, (~aNaturalNumber0(sdtasdt0(xl,sz00))), inference(etableau_closure_rule, [i_0_237, ...])). % 0.20/0.52 cnf(i_0_238, plain, (~aNaturalNumber0(sdtpldt0(xm,xn))), inference(etableau_closure_rule, [i_0_238, ...])). % 0.20/0.52 cnf(i_0_277, plain, (~sdtlseqdt0(sdtasdt0(sz10,sdtasdt0(xl,sz00)),sdtasdt0(sz10,sdtpldt0(xm,xn)))), inference(etableau_closure_rule, [i_0_277, ...])). % 0.20/0.52 cnf(i_0_278, plain, (~sdtlseqdt0(sdtasdt0(sz10,sdtpldt0(xm,xn)),sdtasdt0(sz10,sdtasdt0(xl,sz00)))), inference(etableau_closure_rule, [i_0_278, ...])). % 0.20/0.52 cnf(i_0_279, plain, (~aNaturalNumber0(sdtasdt0(sz10,sdtasdt0(xl,sz00)))), inference(etableau_closure_rule, [i_0_279, ...])). % 0.20/0.52 cnf(i_0_280, plain, (~aNaturalNumber0(sdtasdt0(sz10,sdtpldt0(xm,xn)))), inference(etableau_closure_rule, [i_0_280, ...])). % 0.20/0.52 # End printing tableau % 0.20/0.52 # SZS output end % 0.20/0.52 # Branches closed with saturation will be marked with an "s" % 0.20/0.52 # Child (10368) has found a proof. % 0.20/0.52 % 0.20/0.52 # Proof search is over... % 0.20/0.52 # Freeing feature tree %------------------------------------------------------------------------------