%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM468+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 : n011.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:20 EDT 2022 % Result : Theorem 2.01s 0.68s % Output : CNFRefutation 2.01s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : NUM468+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.35 % Computer : n011.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Wed Jul 6 18:42:38 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 60 Number of unprocessed: 55 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 55 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 2 conjectures. % 0.14/0.39 # There are 2 start rule candidates: % 0.14/0.39 # Found 10 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 2 start rule tableaux created. % 0.14/0.39 # 45 extension rule candidate clauses % 0.14/0.39 # 10 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 2 % 0.14/0.39 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 11 tableaux to operate on % 2.01/0.66 # Creating equality axioms % 2.01/0.66 # Ran out of tableaux, making start rules for all clauses % 2.01/0.68 # There were 1 total branch saturation attempts. % 2.01/0.68 # There were 0 of these attempts blocked. % 2.01/0.68 # There were 0 deferred branch saturation attempts. % 2.01/0.68 # There were 0 free duplicated saturations. % 2.01/0.68 # There were 1 total successful branch saturations. % 2.01/0.68 # There were 0 successful branch saturations in interreduction. % 2.01/0.68 # There were 0 successful branch saturations on the branch. % 2.01/0.68 # There were 1 successful branch saturations after the branch. % 2.01/0.68 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.01/0.68 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.01/0.68 # Begin clausification derivation % 2.01/0.68 % 2.01/0.68 # End clausification derivation % 2.01/0.68 # Begin listing active clauses obtained from FOF to CNF conversion % 2.01/0.68 cnf(i_0_2, plain, (aNaturalNumber0(sz00))). % 2.01/0.68 cnf(i_0_59, hypothesis, (aNaturalNumber0(xl))). % 2.01/0.68 cnf(i_0_4, plain, (aNaturalNumber0(sz10))). % 2.01/0.68 cnf(i_0_58, hypothesis, (aNaturalNumber0(xm))). % 2.01/0.68 cnf(i_0_57, hypothesis, (aNaturalNumber0(xn))). % 2.01/0.68 cnf(i_0_61, hypothesis, (doDivides0(xl,xm))). % 2.01/0.68 cnf(i_0_60, hypothesis, (doDivides0(xl,xn))). % 2.01/0.68 cnf(i_0_63, negated_conjecture, (xl!=sz00)). % 2.01/0.68 cnf(i_0_3, plain, (sz10!=sz00)). % 2.01/0.68 cnf(i_0_62, negated_conjecture, (sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl)))!=sdtpldt0(xm,xn))). % 2.01/0.68 cnf(i_0_32, plain, (sdtlseqdt0(X1,X1)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_15, plain, (sdtasdt0(sz00,X1)=sz00|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_16, plain, (sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_13, plain, (sdtasdt0(sz10,X1)=X1|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_14, plain, (sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_23, plain, (X1=sz00|sdtpldt0(X2,X1)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_24, plain, (X1=sz00|sdtpldt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_5, plain, (aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_6, plain, (aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_25, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_11, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_45, plain, (X1=sz10|X1=sz00|sdtlseqdt0(sz10,X1)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_35, plain, (sdtlseqdt0(X1,X2)|sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_47, plain, (X1=sz00|sdtlseqdt0(X2,sdtasdt0(X2,X1))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_33, plain, (X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_28, plain, (aNaturalNumber0(esk1_2(X1,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_52, plain, (aNaturalNumber0(esk2_2(X1,X2))|~doDivides0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_31, plain, (aNaturalNumber0(sdtmndt0(X1,X2))|~sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_20, plain, (X1=X2|sdtpldt0(X3,X1)!=sdtpldt0(X3,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))). % 2.01/0.68 cnf(i_0_19, plain, (X1=X2|sdtpldt0(X1,X3)!=sdtpldt0(X2,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_22, plain, (X1=sz00|X2=X3|sdtasdt0(X1,X2)!=sdtasdt0(X1,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_21, plain, (X1=sz00|X2=X3|sdtasdt0(X2,X1)!=sdtasdt0(X3,X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 2.01/0.68 cnf(i_0_49, plain, (X1=X2|iLess0(X1,X2)|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_51, plain, (sdtasdt0(X1,esk2_2(X1,X2))=X2|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 2.01/0.68 cnf(i_0_50, plain, (doDivides0(X1,sdtasdt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 2.01/0.68 cnf(i_0_26, plain, (sdtlseqdt0(X1,sdtpldt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 2.01/0.68 cnf(i_0_27, plain, (sdtpldt0(X1,esk1_2(X1,X2))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_12, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_55, plain, (X1=sz00|aNaturalNumber0(sdtsldt0(X2,X1))|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 2.01/0.68 cnf(i_0_30, plain, (sdtpldt0(X1,sdtmndt0(X2,X1))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_34, plain, (sdtlseqdt0(X1,X2)|~sdtlseqdt0(X3,X2)|~sdtlseqdt0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_56, plain, (doDivides0(X1,X2)|~doDivides0(X3,X2)|~doDivides0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_54, plain, (sdtasdt0(X1,sdtsldt0(X2,X1))=X2|X1=sz00|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 2.01/0.68 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_29, plain, (sdtmndt0(sdtpldt0(X1,X2),X1)=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 2.01/0.68 cnf(i_0_39, plain, (X1=X2|sdtlseqdt0(sdtpldt0(X3,X1),sdtpldt0(X3,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))). % 2.01/0.68 cnf(i_0_37, plain, (X1=X2|sdtlseqdt0(sdtpldt0(X1,X3),sdtpldt0(X2,X3))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 2.01/0.68 cnf(i_0_53, plain, (sdtsldt0(sdtasdt0(X1,X2),X1)=X2|X1=sz00|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 2.01/0.68 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))). % 2.01/0.68 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))). % 2.01/0.68 cnf(i_0_443, plain, (X70=X70)). % 2.01/0.68 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.01/0.68 # Begin printing tableau % 2.01/0.68 # Found 8 steps % 2.01/0.68 cnf(i_0_443, plain, (sdtpldt0(sz00,sz00)=sdtpldt0(sz00,sz00)), inference(start_rule)). % 2.01/0.68 cnf(i_0_649, plain, (sdtpldt0(sz00,sz00)=sdtpldt0(sz00,sz00)), inference(extension_rule, [i_0_20])). % 2.01/0.68 cnf(i_0_720, plain, (~aNaturalNumber0(sz00)), inference(closure_rule, [i_0_2])). % 2.01/0.68 cnf(i_0_721, plain, (~aNaturalNumber0(sz00)), inference(closure_rule, [i_0_2])). % 2.01/0.68 cnf(i_0_722, plain, (~aNaturalNumber0(sz00)), inference(closure_rule, [i_0_2])). % 2.01/0.68 cnf(i_0_718, plain, (sz00=sz00), inference(extension_rule, [i_0_446])). % 2.01/0.68 cnf(i_0_906, plain, (sz00=xl), inference(closure_rule, [i_0_63])). % 2.01/0.68 cnf(i_0_908, plain, (sz00!=xl), inference(etableau_closure_rule, [i_0_908, ...])). % 2.01/0.68 # End printing tableau % 2.01/0.68 # SZS output end % 2.01/0.68 # Branches closed with saturation will be marked with an "s" % 2.01/0.68 # Child (1659) has found a proof. % 2.01/0.68 % 2.01/0.68 # Proof search is over... % 2.01/0.68 # Freeing feature tree %------------------------------------------------------------------------------