%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM462+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 : n012.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 44.83s 5.98s % Output : CNFRefutation 44.83s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : NUM462+2 : TPTP v8.1.0. Released v4.0.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n012.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Thu Jul 7 17:57:44 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.18/0.36 # % 0.18/0.36 # Presaturation interreduction done % 0.18/0.36 # Number of axioms: 51 Number of unprocessed: 48 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.37 # The folding up rule is enabled... % 0.18/0.37 # Local unification is enabled... % 0.18/0.37 # Any saturation attempts will use folding labels... % 0.18/0.37 # 48 beginning clauses after preprocessing and clausification % 0.18/0.37 # Creating start rules for all 4 conjectures. % 0.18/0.37 # There are 4 start rule candidates: % 0.18/0.37 # Found 11 unit axioms. % 0.18/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.37 # 4 start rule tableaux created. % 0.18/0.37 # 37 extension rule candidate clauses % 0.18/0.37 # 11 unit axiom clauses % 0.18/0.37 % 0.18/0.37 # Requested 8, 32 cores available to the main process. % 0.18/0.37 # There are not enough tableaux to fork, creating more from the initial 4 % 0.18/0.37 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux. % 0.18/0.37 # We now have 17 tableaux to operate on % 9.46/1.60 # Creating equality axioms % 9.46/1.60 # Ran out of tableaux, making start rules for all clauses % 23.61/3.33 # Creating equality axioms % 23.61/3.33 # Ran out of tableaux, making start rules for all clauses % 23.88/3.43 # Creating equality axioms % 23.88/3.43 # Ran out of tableaux, making start rules for all clauses % 32.10/4.42 # Creating equality axioms % 32.10/4.42 # Ran out of tableaux, making start rules for all clauses % 34.43/4.71 # Creating equality axioms % 34.43/4.71 # Ran out of tableaux, making start rules for all clauses % 35.11/4.77 # Creating equality axioms % 35.11/4.77 # Ran out of tableaux, making start rules for all clauses % 35.33/4.82 # Creating equality axioms % 35.33/4.82 # Ran out of tableaux, making start rules for all clauses % 35.78/4.85 # Creating equality axioms % 35.78/4.85 # Ran out of tableaux, making start rules for all clauses % 44.83/5.98 # There were 8 total branch saturation attempts. % 44.83/5.98 # There were 1 of these attempts blocked. % 44.83/5.98 # There were 0 deferred branch saturation attempts. % 44.83/5.98 # There were 0 free duplicated saturations. % 44.83/5.98 # There were 1 total successful branch saturations. % 44.83/5.98 # There were 0 successful branch saturations in interreduction. % 44.83/5.98 # There were 0 successful branch saturations on the branch. % 44.83/5.98 # There were 1 successful branch saturations after the branch. % 44.83/5.98 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 44.83/5.98 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 44.83/5.98 # Begin clausification derivation % 44.83/5.98 % 44.83/5.98 # End clausification derivation % 44.83/5.98 # Begin listing active clauses obtained from FOF to CNF conversion % 44.83/5.98 cnf(i_0_43, hypothesis, (aNaturalNumber0(xm))). % 44.83/5.98 cnf(i_0_42, hypothesis, (aNaturalNumber0(xl))). % 44.83/5.98 cnf(i_0_41, hypothesis, (aNaturalNumber0(xn))). % 44.83/5.98 cnf(i_0_44, hypothesis, (sdtlseqdt0(xl,xn))). % 44.83/5.98 cnf(i_0_2, plain, (aNaturalNumber0(sz00))). % 44.83/5.98 cnf(i_0_4, plain, (aNaturalNumber0(sz10))). % 44.83/5.98 cnf(i_0_46, hypothesis, (aNaturalNumber0(esk2_0))). % 44.83/5.98 cnf(i_0_45, hypothesis, (sdtpldt0(xl,esk2_0)=xn)). % 44.83/5.98 cnf(i_0_47, hypothesis, (xn!=xl)). % 44.83/5.98 cnf(i_0_3, plain, (sz00!=sz10)). % 44.83/5.98 cnf(i_0_48, hypothesis, (xm!=sz00)). % 44.83/5.98 cnf(i_0_32, plain, (sdtlseqdt0(X1,X1)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_49, negated_conjecture, (sdtasdt0(xn,xm)=sdtasdt0(xl,xm)|sdtasdt0(xm,xn)=sdtasdt0(xm,xl)|~sdtlseqdt0(sdtasdt0(xm,xl),sdtasdt0(xm,xn))|~sdtlseqdt0(sdtasdt0(xl,xm),sdtasdt0(xn,xm)))). % 44.83/5.98 cnf(i_0_51, negated_conjecture, (sdtasdt0(xn,xm)=sdtasdt0(xl,xm)|sdtasdt0(xm,xn)=sdtasdt0(xm,xl)|sdtpldt0(sdtasdt0(xm,xl),X1)!=sdtasdt0(xm,xn)|~sdtlseqdt0(sdtasdt0(xl,xm),sdtasdt0(xn,xm))|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_50, negated_conjecture, (sdtasdt0(xn,xm)=sdtasdt0(xl,xm)|sdtasdt0(xm,xn)=sdtasdt0(xm,xl)|sdtpldt0(sdtasdt0(xl,xm),X1)!=sdtasdt0(xn,xm)|~sdtlseqdt0(sdtasdt0(xm,xl),sdtasdt0(xm,xn))|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_15, plain, (sdtasdt0(sz00,X1)=sz00|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_16, plain, (sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_13, plain, (sdtasdt0(sz10,X1)=X1|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_14, plain, (sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_5, plain, (aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_6, plain, (aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_52, negated_conjecture, (sdtasdt0(xn,xm)=sdtasdt0(xl,xm)|sdtasdt0(xm,xn)=sdtasdt0(xm,xl)|sdtpldt0(sdtasdt0(xm,xl),X1)!=sdtasdt0(xm,xn)|sdtpldt0(sdtasdt0(xl,xm),X2)!=sdtasdt0(xn,xm)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 44.83/5.98 cnf(i_0_23, plain, (X1=sz00|sdtpldt0(X2,X1)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_24, plain, (X1=sz00|sdtpldt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_33, plain, (X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_28, plain, (aNaturalNumber0(esk1_2(X1,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_20, plain, (X1=X2|sdtpldt0(X3,X1)!=sdtpldt0(X3,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))). % 44.83/5.98 cnf(i_0_19, plain, (X1=X2|sdtpldt0(X1,X3)!=sdtpldt0(X2,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_11, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_35, plain, (sdtlseqdt0(X1,X2)|sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_25, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_26, plain, (sdtlseqdt0(X1,sdtpldt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 44.83/5.98 cnf(i_0_31, plain, (aNaturalNumber0(sdtmndt0(X1,X2))|~sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_34, plain, (sdtlseqdt0(X1,X2)|~sdtlseqdt0(X3,X2)|~sdtlseqdt0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_27, plain, (sdtpldt0(X1,esk1_2(X1,X2))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_12, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_22, plain, (X1=sz00|X2=X3|sdtasdt0(X1,X2)!=sdtasdt0(X1,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_21, plain, (X1=sz00|X2=X3|sdtasdt0(X2,X1)!=sdtasdt0(X3,X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 44.83/5.98 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_30, plain, (sdtpldt0(X1,sdtmndt0(X2,X1))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_29, plain, (sdtmndt0(sdtpldt0(X1,X2),X1)=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 44.83/5.98 cnf(i_0_39, plain, (X1=X2|sdtlseqdt0(sdtpldt0(X3,X1),sdtpldt0(X3,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))). % 44.83/5.98 cnf(i_0_37, plain, (X1=X2|sdtlseqdt0(sdtpldt0(X1,X3),sdtpldt0(X2,X3))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 44.83/5.98 cnf(i_0_954, plain, (X55=X55)). % 44.83/5.98 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 44.83/5.98 # Begin printing tableau % 44.83/5.98 # Found 13 steps % 44.83/5.98 cnf(i_0_954, plain, (sdtpldt0(xm,xm)=sdtpldt0(xm,xm)), inference(start_rule)). % 44.83/5.98 cnf(i_0_1120, plain, (sdtpldt0(xm,xm)=sdtpldt0(xm,xm)), inference(extension_rule, [i_0_20])). % 44.83/5.98 cnf(i_0_1163, plain, (~aNaturalNumber0(xm)), inference(closure_rule, [i_0_43])). % 44.83/5.98 cnf(i_0_1164, plain, (~aNaturalNumber0(xm)), inference(closure_rule, [i_0_43])). % 44.83/5.98 cnf(i_0_1165, plain, (~aNaturalNumber0(xm)), inference(closure_rule, [i_0_43])). % 44.83/5.98 cnf(i_0_1161, plain, (xm=xm), inference(extension_rule, [i_0_957])). % 44.83/5.98 cnf(i_0_1311, plain, (xm=sz00), inference(closure_rule, [i_0_48])). % 44.83/5.98 cnf(i_0_1313, plain, (xm!=sz00), inference(extension_rule, [i_0_21])). % 44.83/5.98 cnf(i_0_367809, plain, (xn=xl), inference(closure_rule, [i_0_47])). % 44.83/5.98 cnf(i_0_367811, plain, (~aNaturalNumber0(xl)), inference(closure_rule, [i_0_42])). % 44.83/5.98 cnf(i_0_367812, plain, (~aNaturalNumber0(xm)), inference(closure_rule, [i_0_43])). % 44.83/5.98 cnf(i_0_367813, plain, (~aNaturalNumber0(xn)), inference(closure_rule, [i_0_41])). % 44.83/5.98 cnf(i_0_367810, plain, (sdtasdt0(xn,xm)!=sdtasdt0(xl,xm)), inference(etableau_closure_rule, [i_0_367810, ...])). % 44.83/5.98 # End printing tableau % 44.83/5.98 # SZS output end % 44.83/5.98 # Branches closed with saturation will be marked with an "s" % 44.83/5.99 # Child (24808) has found a proof. % 44.83/5.99 % 44.83/5.99 # Proof search is over... % 44.83/5.99 # Freeing feature tree %------------------------------------------------------------------------------