%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM495+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 : n007.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:38 EDT 2022 % Result : Theorem 0.20s 0.41s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : NUM495+1 : TPTP v8.1.0. Released v4.0.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n007.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Tue Jul 5 06:57:57 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m % 0.13/0.37 # and selection function SelectCQArNTNpEqFirst. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 82 Number of unprocessed: 77 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 77 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 2 conjectures. % 0.13/0.37 # There are 2 start rule candidates: % 0.13/0.37 # Found 19 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 2 start rule tableaux created. % 0.13/0.37 # 58 extension rule candidate clauses % 0.13/0.37 # 19 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.13/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 8 tableaux to operate on % 0.20/0.41 # There were 3 total branch saturation attempts. % 0.20/0.41 # There were 0 of these attempts blocked. % 0.20/0.41 # There were 0 deferred branch saturation attempts. % 0.20/0.41 # There were 0 free duplicated saturations. % 0.20/0.41 # There were 3 total successful branch saturations. % 0.20/0.41 # There were 0 successful branch saturations in interreduction. % 0.20/0.41 # There were 0 successful branch saturations on the branch. % 0.20/0.41 # There were 3 successful branch saturations after the branch. % 0.20/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.41 # Begin clausification derivation % 0.20/0.41 % 0.20/0.41 # End clausification derivation % 0.20/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.41 cnf(i_0_72, hypothesis, (aNaturalNumber0(xm))). % 0.20/0.41 cnf(i_0_2, plain, (aNaturalNumber0(sz00))). % 0.20/0.41 cnf(i_0_71, hypothesis, (aNaturalNumber0(xp))). % 0.20/0.41 cnf(i_0_4, plain, (aNaturalNumber0(sz10))). % 0.20/0.41 cnf(i_0_73, hypothesis, (aNaturalNumber0(xn))). % 0.20/0.41 cnf(i_0_76, hypothesis, (isPrime0(xp))). % 0.20/0.41 cnf(i_0_81, hypothesis, (doDivides0(xp,sdtasdt0(xr,xm)))). % 0.20/0.41 cnf(i_0_78, hypothesis, (sdtmndt0(xn,xp)=xr)). % 0.20/0.41 cnf(i_0_77, hypothesis, (sdtlseqdt0(xp,xn))). % 0.20/0.41 cnf(i_0_79, hypothesis, (sdtlseqdt0(xr,xn))). % 0.20/0.41 cnf(i_0_75, hypothesis, (doDivides0(xp,sdtasdt0(xn,xm)))). % 0.20/0.41 cnf(i_0_82, hypothesis, (sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)))). % 0.20/0.41 cnf(i_0_80, hypothesis, (xr!=xn)). % 0.20/0.41 cnf(i_0_84, negated_conjecture, (~doDivides0(xp,xm))). % 0.20/0.41 cnf(i_0_85, negated_conjecture, (~doDivides0(xp,xr))). % 0.20/0.41 cnf(i_0_3, plain, (sz10!=sz00)). % 0.20/0.41 cnf(i_0_67, plain, (~isPrime0(sz00))). % 0.20/0.41 cnf(i_0_66, plain, (~isPrime0(sz10))). % 0.20/0.41 cnf(i_0_83, hypothesis, (sdtpldt0(sdtpldt0(xr,xm),xp)!=sdtpldt0(sdtpldt0(xn,xm),xp))). % 0.20/0.41 cnf(i_0_32, plain, (sdtlseqdt0(X1,X1)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_15, plain, (sdtasdt0(sz00,X1)=sz00|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_16, plain, (sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_13, plain, (sdtasdt0(sz10,X1)=X1|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_14, plain, (sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_70, plain, (X1=sz10|X1=sz00|aNaturalNumber0(esk4_1(X1))|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_5, plain, (aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_23, plain, (X1=sz00|sdtpldt0(X2,X1)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_24, plain, (X1=sz00|sdtpldt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_6, plain, (aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_68, plain, (X1=sz10|X1=sz00|isPrime0(esk4_1(X1))|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_45, plain, (X1=sz10|X1=sz00|sdtlseqdt0(sz10,X1)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_59, plain, (X1=sz00|sdtlseqdt0(X2,X1)|~doDivides0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.41 cnf(i_0_62, plain, (X1=sz10|X1=sz00|isPrime0(X1)|esk3_1(X1)!=sz10|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_69, plain, (X1=sz10|X1=sz00|doDivides0(esk4_1(X1),X1)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_33, plain, (X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_28, plain, (aNaturalNumber0(esk1_2(X1,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_52, plain, (aNaturalNumber0(esk2_2(X1,X2))|~doDivides0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_61, plain, (X1=sz10|X1=sz00|isPrime0(X1)|esk3_1(X1)!=X1|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_25, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_31, plain, (aNaturalNumber0(sdtmndt0(X1,X2))|~sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_65, plain, (X1=sz10|X1=X2|~isPrime0(X2)|~doDivides0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_50, plain, (doDivides0(X1,sdtasdt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.41 cnf(i_0_64, plain, (X1=sz10|X1=sz00|isPrime0(X1)|aNaturalNumber0(esk3_1(X1))|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_49, plain, (X1=X2|iLess0(X1,X2)|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_20, plain, (X1=X2|sdtpldt0(X3,X1)!=sdtpldt0(X3,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))). % 0.20/0.41 cnf(i_0_19, plain, (X1=X2|sdtpldt0(X1,X3)!=sdtpldt0(X2,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_56, plain, (doDivides0(X1,X2)|~doDivides0(X3,X2)|~doDivides0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_11, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_58, plain, (doDivides0(X1,X2)|~doDivides0(X1,sdtpldt0(X3,X2))|~doDivides0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_35, plain, (sdtlseqdt0(X1,X2)|sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_26, plain, (sdtlseqdt0(X1,sdtpldt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.41 cnf(i_0_63, plain, (X1=sz10|X1=sz00|isPrime0(X1)|doDivides0(esk3_1(X1),X1)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_34, plain, (sdtlseqdt0(X1,X2)|~sdtlseqdt0(X3,X2)|~sdtlseqdt0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_47, plain, (X1=sz00|sdtlseqdt0(X2,sdtasdt0(X2,X1))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_51, plain, (sdtasdt0(X1,esk2_2(X1,X2))=X2|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.41 cnf(i_0_57, plain, (doDivides0(X1,sdtpldt0(X2,X3))|~doDivides0(X1,X3)|~doDivides0(X1,X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_55, plain, (X1=sz00|aNaturalNumber0(sdtsldt0(X2,X1))|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.41 cnf(i_0_27, plain, (sdtpldt0(X1,esk1_2(X1,X2))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_22, plain, (X1=sz00|X2=X3|sdtasdt0(X1,X2)!=sdtasdt0(X1,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_21, plain, (X1=sz00|X2=X3|sdtasdt0(X2,X1)!=sdtasdt0(X3,X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.41 cnf(i_0_30, plain, (sdtpldt0(X1,sdtmndt0(X2,X1))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_12, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.20/0.41 cnf(i_0_54, plain, (sdtasdt0(X1,sdtsldt0(X2,X1))=X2|X1=sz00|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.41 cnf(i_0_29, plain, (sdtmndt0(sdtpldt0(X1,X2),X1)=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.41 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.41 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.41 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.41 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.41 cnf(i_0_60, plain, (sdtsldt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtsldt0(X2,X3))|X3=sz00|~doDivides0(X3,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3))). % 0.20/0.41 cnf(i_0_53, plain, (sdtsldt0(sdtasdt0(X1,X2),X1)=X2|X1=sz00|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.20/0.41 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.41 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.41 cnf(i_0_74, hypothesis, (doDivides0(X1,X2)|doDivides0(X1,X3)|~isPrime0(X1)|~doDivides0(X1,sdtasdt0(X2,X3))|~iLess0(sdtpldt0(sdtpldt0(X2,X3),X1),sdtpldt0(sdtpldt0(xn,xm),xp))|~aNaturalNumber0(X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2))). % 0.20/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.41 # Begin printing tableau % 0.20/0.41 # Found 13 steps % 0.20/0.41 cnf(i_0_84, negated_conjecture, (~doDivides0(xp,xm)), inference(start_rule)). % 0.20/0.41 cnf(i_0_98, plain, (~doDivides0(xp,xm)), inference(extension_rule, [i_0_74])). % 0.20/0.41 cnf(i_0_597, plain, (doDivides0(xp,xr)), inference(closure_rule, [i_0_85])). % 0.20/0.41 cnf(i_0_599, plain, (~isPrime0(xp)), inference(closure_rule, [i_0_76])). % 0.20/0.41 cnf(i_0_600, plain, (~doDivides0(xp,sdtasdt0(xr,xm))), inference(closure_rule, [i_0_81])). % 0.20/0.41 cnf(i_0_602, plain, (~aNaturalNumber0(xp)), inference(closure_rule, [i_0_71])). % 0.20/0.41 cnf(i_0_603, plain, (~aNaturalNumber0(xm)), inference(closure_rule, [i_0_72])). % 0.20/0.41 cnf(i_0_601, plain, (~iLess0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp))), inference(extension_rule, [i_0_49])). % 0.20/0.41 cnf(i_0_700, plain, (sdtpldt0(sdtpldt0(xr,xm),xp)=sdtpldt0(sdtpldt0(xn,xm),xp)), inference(closure_rule, [i_0_83])). % 0.20/0.41 cnf(i_0_702, plain, (~sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp))), inference(closure_rule, [i_0_82])). % 0.20/0.41 cnf(i_0_604, plain, (~aNaturalNumber0(xr)), inference(etableau_closure_rule, [i_0_604, ...])). % 0.20/0.41 cnf(i_0_703, plain, (~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))), inference(etableau_closure_rule, [i_0_703, ...])). % 0.20/0.41 cnf(i_0_704, plain, (~aNaturalNumber0(sdtpldt0(sdtpldt0(xr,xm),xp))), inference(etableau_closure_rule, [i_0_704, ...])). % 0.20/0.41 # End printing tableau % 0.20/0.41 # SZS output end % 0.20/0.41 # Branches closed with saturation will be marked with an "s" % 0.20/0.41 # Child (14758) has found a proof. % 0.20/0.41 % 0.20/0.41 # Proof search is over... % 0.20/0.41 # Freeing feature tree %------------------------------------------------------------------------------