%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM459+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 : 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 : Mon Jul 18 09:41:14 EDT 2022 % Result : Theorem 1.85s 0.59s % Output : CNFRefutation 1.85s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : NUM459+2 : TPTP v8.1.0. Released v4.0.0. % 0.06/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 : n016.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 : Wed Jul 6 17:29:05 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 40 Number of unprocessed: 40 % 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 # 40 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 7 conjectures. % 0.13/0.37 # There are 7 start rule candidates: % 0.13/0.37 # Found 12 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 7 start rule tableaux created. % 0.13/0.37 # 28 extension rule candidate clauses % 0.13/0.37 # 12 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 7 % 0.13/0.37 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 11 tableaux to operate on % 1.85/0.59 # There were 3 total branch saturation attempts. % 1.85/0.59 # There were 0 of these attempts blocked. % 1.85/0.59 # There were 0 deferred branch saturation attempts. % 1.85/0.59 # There were 0 free duplicated saturations. % 1.85/0.59 # There were 3 total successful branch saturations. % 1.85/0.59 # There were 0 successful branch saturations in interreduction. % 1.85/0.59 # There were 0 successful branch saturations on the branch. % 1.85/0.59 # There were 3 successful branch saturations after the branch. % 1.85/0.59 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.85/0.59 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.85/0.59 # Begin clausification derivation % 1.85/0.59 % 1.85/0.59 # End clausification derivation % 1.85/0.59 # Begin listing active clauses obtained from FOF to CNF conversion % 1.85/0.59 cnf(i_0_34, hypothesis, (aNaturalNumber0(xm))). % 1.85/0.59 cnf(i_0_33, hypothesis, (aNaturalNumber0(xn))). % 1.85/0.59 cnf(i_0_41, negated_conjecture, (aNaturalNumber0(esk2_0))). % 1.85/0.59 cnf(i_0_38, negated_conjecture, (aNaturalNumber0(esk3_0))). % 1.85/0.59 cnf(i_0_2, plain, (aNaturalNumber0(sz00))). % 1.85/0.59 cnf(i_0_4, plain, (aNaturalNumber0(sz10))). % 1.85/0.59 cnf(i_0_39, negated_conjecture, (sdtlseqdt0(xm,xn))). % 1.85/0.59 cnf(i_0_36, negated_conjecture, (sdtlseqdt0(xn,xm))). % 1.85/0.59 cnf(i_0_40, negated_conjecture, (sdtpldt0(xm,esk2_0)=xn)). % 1.85/0.59 cnf(i_0_37, negated_conjecture, (sdtpldt0(xn,esk3_0)=xm)). % 1.85/0.59 cnf(i_0_35, negated_conjecture, (xn!=xm)). % 1.85/0.59 cnf(i_0_3, plain, (sz00!=sz10)). % 1.85/0.59 cnf(i_0_32, plain, (sdtlseqdt0(X1,X1)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_5, plain, (aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_15, plain, (sdtasdt0(sz00,X1)=sz00|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_16, plain, (sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_13, plain, (sdtasdt0(sz10,X1)=X1|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_14, plain, (sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_23, plain, (X1=sz00|sdtpldt0(X2,X1)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_24, plain, (X1=sz00|sdtpldt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_6, plain, (aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_28, plain, (aNaturalNumber0(esk1_2(X1,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_20, plain, (X1=X2|sdtpldt0(X3,X1)!=sdtpldt0(X3,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))). % 1.85/0.59 cnf(i_0_19, plain, (X1=X2|sdtpldt0(X1,X3)!=sdtpldt0(X2,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_25, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_11, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_31, plain, (aNaturalNumber0(sdtmndt0(X1,X2))|~sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_26, plain, (sdtlseqdt0(X1,sdtpldt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 1.85/0.59 cnf(i_0_27, plain, (sdtpldt0(X1,esk1_2(X1,X2))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_22, plain, (X1=sz00|X2=X3|sdtasdt0(X1,X2)!=sdtasdt0(X1,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_21, plain, (X1=sz00|X2=X3|sdtasdt0(X2,X1)!=sdtasdt0(X3,X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 1.85/0.59 cnf(i_0_30, plain, (sdtpldt0(X1,sdtmndt0(X2,X1))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_12, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_29, plain, (sdtmndt0(sdtpldt0(X1,X2),X1)=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 1.85/0.59 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 1.85/0.59 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 1.85/0.59 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.85/0.59 # Begin printing tableau % 1.85/0.59 # Found 11 steps % 1.85/0.59 cnf(i_0_35, negated_conjecture, (xn!=xm), inference(start_rule)). % 1.85/0.59 cnf(i_0_46, plain, (xn!=xm), inference(extension_rule, [i_0_21])). % 1.85/0.59 cnf(i_0_127, plain, (sz00=sz10), inference(closure_rule, [i_0_3])). % 1.85/0.59 cnf(i_0_130, plain, (~aNaturalNumber0(xm)), inference(closure_rule, [i_0_34])). % 1.85/0.59 cnf(i_0_131, plain, (~aNaturalNumber0(sz10)), inference(closure_rule, [i_0_4])). % 1.85/0.59 cnf(i_0_132, plain, (~aNaturalNumber0(xn)), inference(closure_rule, [i_0_33])). % 1.85/0.59 cnf(i_0_129, plain, (sdtasdt0(xn,sz10)!=sdtasdt0(xm,sz10)), inference(extension_rule, [i_0_20])). % 1.85/0.59 cnf(i_0_488, plain, (~aNaturalNumber0(xm)), inference(closure_rule, [i_0_34])). % 1.85/0.59 cnf(i_0_485, plain, (sdtpldt0(xm,sdtasdt0(xn,sz10))!=sdtpldt0(xm,sdtasdt0(xm,sz10))), inference(etableau_closure_rule, [i_0_485, ...])). % 1.85/0.59 cnf(i_0_486, plain, (~aNaturalNumber0(sdtasdt0(xm,sz10))), inference(etableau_closure_rule, [i_0_486, ...])). % 1.85/0.59 cnf(i_0_487, plain, (~aNaturalNumber0(sdtasdt0(xn,sz10))), inference(etableau_closure_rule, [i_0_487, ...])). % 1.85/0.59 # End printing tableau % 1.85/0.59 # SZS output end % 1.85/0.59 # Branches closed with saturation will be marked with an "s" % 1.85/0.59 # Child (19779) has found a proof. % 1.85/0.59 % 1.85/0.59 # Proof search is over... % 1.85/0.59 # Freeing feature tree %------------------------------------------------------------------------------