%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM461+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 : n029.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:16 EDT 2022 % Result : Theorem 0.22s 0.49s % Output : CNFRefutation 0.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : NUM461+2 : TPTP v8.1.0. Released v4.0.0. % 0.04/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n029.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Tue Jul 5 18:58:27 EDT 2022 % 0.14/0.37 % CPUTime : % 0.22/0.40 # No SInE strategy applied % 0.22/0.40 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.22/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.22/0.40 # % 0.22/0.40 # Presaturation interreduction done % 0.22/0.40 # Number of axioms: 46 Number of unprocessed: 45 % 0.22/0.40 # Tableaux proof search. % 0.22/0.40 # APR header successfully linked. % 0.22/0.40 # Hello from C++ % 0.22/0.40 # The folding up rule is enabled... % 0.22/0.40 # Local unification is enabled... % 0.22/0.40 # Any saturation attempts will use folding labels... % 0.22/0.40 # 45 beginning clauses after preprocessing and clausification % 0.22/0.40 # Creating start rules for all 4 conjectures. % 0.22/0.40 # There are 4 start rule candidates: % 0.22/0.40 # Found 10 unit axioms. % 0.22/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.22/0.40 # 4 start rule tableaux created. % 0.22/0.40 # 35 extension rule candidate clauses % 0.22/0.40 # 10 unit axiom clauses % 0.22/0.40 % 0.22/0.40 # Requested 8, 32 cores available to the main process. % 0.22/0.40 # There are not enough tableaux to fork, creating more from the initial 4 % 0.22/0.40 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.22/0.40 # We now have 13 tableaux to operate on % 0.22/0.49 # Creating equality axioms % 0.22/0.49 # Ran out of tableaux, making start rules for all clauses % 0.22/0.49 # There were 1 total branch saturation attempts. % 0.22/0.49 # There were 0 of these attempts blocked. % 0.22/0.49 # There were 0 deferred branch saturation attempts. % 0.22/0.49 # There were 0 free duplicated saturations. % 0.22/0.49 # There were 1 total successful branch saturations. % 0.22/0.49 # There were 0 successful branch saturations in interreduction. % 0.22/0.49 # There were 0 successful branch saturations on the branch. % 0.22/0.49 # There were 1 successful branch saturations after the branch. % 0.22/0.49 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.49 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.49 # Begin clausification derivation % 0.22/0.49 % 0.22/0.49 # End clausification derivation % 0.22/0.49 # Begin listing active clauses obtained from FOF to CNF conversion % 0.22/0.49 cnf(i_0_38, hypothesis, (aNaturalNumber0(xl))). % 0.22/0.49 cnf(i_0_37, hypothesis, (aNaturalNumber0(xn))). % 0.22/0.49 cnf(i_0_43, hypothesis, (aNaturalNumber0(xm))). % 0.22/0.49 cnf(i_0_39, hypothesis, (sdtlseqdt0(xl,xn))). % 0.22/0.49 cnf(i_0_2, plain, (aNaturalNumber0(sz00))). % 0.22/0.49 cnf(i_0_4, plain, (aNaturalNumber0(sz10))). % 0.22/0.49 cnf(i_0_41, hypothesis, (aNaturalNumber0(esk2_0))). % 0.22/0.49 cnf(i_0_40, hypothesis, (sdtpldt0(xl,esk2_0)=xn)). % 0.22/0.49 cnf(i_0_42, hypothesis, (xn!=xl)). % 0.22/0.49 cnf(i_0_3, plain, (sz00!=sz10)). % 0.22/0.49 cnf(i_0_32, plain, (sdtlseqdt0(X1,X1)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_44, negated_conjecture, (sdtpldt0(xm,xn)=sdtpldt0(xm,xl)|sdtpldt0(xn,xm)=sdtpldt0(xl,xm)|~sdtlseqdt0(sdtpldt0(xl,xm),sdtpldt0(xn,xm))|~sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn)))). % 0.22/0.49 cnf(i_0_45, negated_conjecture, (sdtpldt0(xm,xn)=sdtpldt0(xm,xl)|sdtpldt0(xn,xm)=sdtpldt0(xl,xm)|sdtpldt0(sdtpldt0(xl,xm),X1)!=sdtpldt0(xn,xm)|~sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn))|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_46, negated_conjecture, (sdtpldt0(xm,xn)=sdtpldt0(xm,xl)|sdtpldt0(xn,xm)=sdtpldt0(xl,xm)|sdtpldt0(sdtpldt0(xm,xl),X1)!=sdtpldt0(xm,xn)|~sdtlseqdt0(sdtpldt0(xl,xm),sdtpldt0(xn,xm))|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_15, plain, (sdtasdt0(sz00,X1)=sz00|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_16, plain, (sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_13, plain, (sdtasdt0(sz10,X1)=X1|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_14, plain, (sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_5, plain, (aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_47, negated_conjecture, (sdtpldt0(xm,xn)=sdtpldt0(xm,xl)|sdtpldt0(xn,xm)=sdtpldt0(xl,xm)|sdtpldt0(sdtpldt0(xl,xm),X1)!=sdtpldt0(xn,xm)|sdtpldt0(sdtpldt0(xm,xl),X2)!=sdtpldt0(xm,xn)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_6, plain, (aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_23, plain, (X1=sz00|sdtpldt0(X2,X1)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_24, plain, (X1=sz00|sdtpldt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_25, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_33, plain, (X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_28, plain, (aNaturalNumber0(esk1_2(X1,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_20, plain, (X1=X2|sdtpldt0(X3,X1)!=sdtpldt0(X3,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))). % 0.22/0.49 cnf(i_0_19, plain, (X1=X2|sdtpldt0(X1,X3)!=sdtpldt0(X2,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_35, plain, (sdtlseqdt0(X1,X2)|sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_26, plain, (sdtlseqdt0(X1,sdtpldt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.22/0.49 cnf(i_0_31, plain, (aNaturalNumber0(sdtmndt0(X1,X2))|~sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_11, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_27, plain, (sdtpldt0(X1,esk1_2(X1,X2))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_34, plain, (sdtlseqdt0(X1,X2)|~sdtlseqdt0(X3,X2)|~sdtlseqdt0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_22, plain, (X1=sz00|X2=X3|sdtasdt0(X1,X2)!=sdtasdt0(X1,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_21, plain, (X1=sz00|X2=X3|sdtasdt0(X2,X1)!=sdtasdt0(X3,X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.22/0.49 cnf(i_0_30, plain, (sdtpldt0(X1,sdtmndt0(X2,X1))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_29, plain, (sdtmndt0(sdtpldt0(X1,X2),X1)=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.22/0.49 cnf(i_0_12, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.22/0.49 cnf(i_0_743, plain, (X52=X52)). % 0.22/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.22/0.49 # Begin printing tableau % 0.22/0.49 # Found 8 steps % 0.22/0.49 cnf(i_0_743, plain, (sdtpldt0(xl,xl)=sdtpldt0(xl,xl)), inference(start_rule)). % 0.22/0.49 cnf(i_0_896, plain, (sdtpldt0(xl,xl)=sdtpldt0(xl,xl)), inference(extension_rule, [i_0_20])). % 0.22/0.49 cnf(i_0_944, plain, (~aNaturalNumber0(xl)), inference(closure_rule, [i_0_38])). % 0.22/0.49 cnf(i_0_945, plain, (~aNaturalNumber0(xl)), inference(closure_rule, [i_0_38])). % 0.22/0.49 cnf(i_0_946, plain, (~aNaturalNumber0(xl)), inference(closure_rule, [i_0_38])). % 0.22/0.49 cnf(i_0_942, plain, (xl=xl), inference(extension_rule, [i_0_746])). % 0.22/0.49 cnf(i_0_1080, plain, (xl=xn), inference(closure_rule, [i_0_42])). % 0.22/0.49 cnf(i_0_1082, plain, (xl!=xn), inference(etableau_closure_rule, [i_0_1082, ...])). % 0.22/0.49 # End printing tableau % 0.22/0.49 # SZS output end % 0.22/0.49 # Branches closed with saturation will be marked with an "s" % 0.22/0.50 # Child (3387) has found a proof. % 0.22/0.50 % 0.22/0.50 # Proof search is over... % 0.22/0.50 # Freeing feature tree %------------------------------------------------------------------------------