%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM460+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:15 EDT 2022 % Result : Theorem 0.18s 0.38s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : NUM460+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 10:26:59 EDT 2022 % 0.12/0.34 % CPUTime : % 0.18/0.37 # No SInE strategy applied % 0.18/0.37 # Auto-Mode selected heuristic U_____100_C07_23_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.18/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.18/0.37 # % 0.18/0.37 # Presaturation interreduction done % 0.18/0.37 # Number of axioms: 43 Number of unprocessed: 43 % 0.18/0.37 # Tableaux proof search. % 0.18/0.37 # APR header successfully linked. % 0.18/0.37 # 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 # 43 beginning clauses after preprocessing and clausification % 0.18/0.37 # Creating start rules for all 8 conjectures. % 0.18/0.37 # There are 8 start rule candidates: % 0.18/0.37 # Found 13 unit axioms. % 0.18/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.37 # 8 start rule tableaux created. % 0.18/0.37 # 30 extension rule candidate clauses % 0.18/0.37 # 13 unit axiom clauses % 0.18/0.37 % 0.18/0.37 # Requested 8, 32 cores available to the main process. % 0.18/0.38 # There were 1 total branch saturation attempts. % 0.18/0.38 # There were 0 of these attempts blocked. % 0.18/0.38 # There were 0 deferred branch saturation attempts. % 0.18/0.38 # There were 0 free duplicated saturations. % 0.18/0.38 # There were 1 total successful branch saturations. % 0.18/0.38 # There were 0 successful branch saturations in interreduction. % 0.18/0.38 # There were 0 successful branch saturations on the branch. % 0.18/0.38 # There were 1 successful branch saturations after the branch. % 0.18/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.38 # Begin clausification derivation % 0.18/0.38 % 0.18/0.38 # End clausification derivation % 0.18/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.38 cnf(i_0_2, plain, (aNaturalNumber0(sz00))). % 0.18/0.38 cnf(i_0_4, plain, (aNaturalNumber0(sz10))). % 0.18/0.38 cnf(i_0_36, hypothesis, (aNaturalNumber0(xm))). % 0.18/0.38 cnf(i_0_35, hypothesis, (aNaturalNumber0(xn))). % 0.18/0.38 cnf(i_0_34, hypothesis, (aNaturalNumber0(xl))). % 0.18/0.38 cnf(i_0_44, negated_conjecture, (aNaturalNumber0(esk2_0))). % 0.18/0.38 cnf(i_0_41, negated_conjecture, (aNaturalNumber0(esk3_0))). % 0.18/0.38 cnf(i_0_42, negated_conjecture, (sdtlseqdt0(xm,xn))). % 0.18/0.38 cnf(i_0_39, negated_conjecture, (sdtlseqdt0(xn,xl))). % 0.18/0.38 cnf(i_0_43, negated_conjecture, (sdtpldt0(xm,esk2_0)=xn)). % 0.18/0.38 cnf(i_0_40, negated_conjecture, (sdtpldt0(xn,esk3_0)=xl)). % 0.18/0.38 cnf(i_0_3, plain, (sz10!=sz00)). % 0.18/0.38 cnf(i_0_37, negated_conjecture, (~sdtlseqdt0(xm,xl))). % 0.18/0.38 cnf(i_0_38, negated_conjecture, (sdtpldt0(xm,X1)!=xl|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_32, plain, (sdtlseqdt0(X1,X1)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_23, plain, (X1=sz00|sdtpldt0(X2,X1)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_24, plain, (X1=sz00|sdtpldt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_33, plain, (X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_13, plain, (sdtasdt0(sz10,X1)=X1|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_14, plain, (sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_15, plain, (sdtasdt0(sz00,X1)=sz00|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_16, plain, (sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_5, plain, (aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_6, plain, (aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_11, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_28, plain, (aNaturalNumber0(esk1_2(X1,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_27, plain, (sdtpldt0(X1,esk1_2(X1,X2))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_25, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_12, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_20, plain, (X1=X2|sdtpldt0(X3,X1)!=sdtpldt0(X3,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))). % 0.18/0.38 cnf(i_0_19, plain, (X1=X2|sdtpldt0(X1,X3)!=sdtpldt0(X2,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_31, plain, (aNaturalNumber0(sdtmndt0(X1,X2))|~sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_26, plain, (sdtlseqdt0(X1,sdtpldt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.18/0.38 cnf(i_0_22, plain, (X1=sz00|X2=X3|sdtasdt0(X1,X2)!=sdtasdt0(X1,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_21, plain, (X1=sz00|X2=X3|sdtasdt0(X2,X1)!=sdtasdt0(X3,X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.18/0.38 cnf(i_0_30, plain, (sdtpldt0(X1,sdtmndt0(X2,X1))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.18/0.38 cnf(i_0_29, plain, (sdtmndt0(sdtpldt0(X1,X2),X1)=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.18/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.38 # Begin printing tableau % 0.18/0.38 # Found 6 steps % 0.18/0.38 cnf(i_0_39, negated_conjecture, (sdtlseqdt0(xn,xl)), inference(start_rule)). % 0.18/0.38 cnf(i_0_54, plain, (sdtlseqdt0(xn,xl)), inference(extension_rule, [i_0_28])). % 0.18/0.38 cnf(i_0_427, plain, (~aNaturalNumber0(xl)), inference(closure_rule, [i_0_34])). % 0.18/0.38 cnf(i_0_428, plain, (~aNaturalNumber0(xn)), inference(closure_rule, [i_0_35])). % 0.18/0.38 cnf(i_0_425, plain, (aNaturalNumber0(esk1_2(xn,xl))), inference(extension_rule, [i_0_32])). % 0.18/0.38 cnf(i_0_429, plain, (sdtlseqdt0(esk1_2(xn,xl),esk1_2(xn,xl))), inference(etableau_closure_rule, [i_0_429, ...])). % 0.18/0.38 # End printing tableau % 0.18/0.38 # SZS output end % 0.18/0.38 # Branches closed with saturation will be marked with an "s" % 0.18/0.38 # Child (22815) has found a proof. % 0.18/0.38 % 0.18/0.38 # Proof search is over... % 0.18/0.38 # Freeing feature tree %------------------------------------------------------------------------------