%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM472+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 : n018.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:22 EDT 2022 % Result : Theorem 0.11s 0.36s % Output : CNFRefutation 0.11s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : NUM472+1 : TPTP v8.1.0. Released v4.0.0. % 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.33 % Computer : n018.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 600 % 0.11/0.33 % DateTime : Thu Jul 7 10:05:54 EDT 2022 % 0.11/0.33 % CPUTime : % 0.11/0.36 # No SInE strategy applied % 0.11/0.36 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.11/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.11/0.36 # % 0.11/0.36 # Presaturation interreduction done % 0.11/0.36 # Number of axioms: 63 Number of unprocessed: 58 % 0.11/0.36 # Tableaux proof search. % 0.11/0.36 # APR header successfully linked. % 0.11/0.36 # Hello from C++ % 0.11/0.36 # The folding up rule is enabled... % 0.11/0.36 # Local unification is enabled... % 0.11/0.36 # Any saturation attempts will use folding labels... % 0.11/0.36 # 58 beginning clauses after preprocessing and clausification % 0.11/0.36 # Creating start rules for all 1 conjectures. % 0.11/0.36 # There are 1 start rule candidates: % 0.11/0.36 # Found 12 unit axioms. % 0.11/0.36 # 1 start rule tableaux created. % 0.11/0.36 # 46 extension rule candidate clauses % 0.11/0.36 # 12 unit axiom clauses % 0.11/0.36 % 0.11/0.36 # Requested 8, 32 cores available to the main process. % 0.11/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.11/0.36 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done. % 0.11/0.36 # There were 0 total branch saturation attempts. % 0.11/0.36 # There were 0 of these attempts blocked. % 0.11/0.36 # There were 0 deferred branch saturation attempts. % 0.11/0.36 # There were 0 free duplicated saturations. % 0.11/0.36 # There were 0 total successful branch saturations. % 0.11/0.36 # There were 0 successful branch saturations in interreduction. % 0.11/0.36 # There were 0 successful branch saturations on the branch. % 0.11/0.36 # There were 0 successful branch saturations after the branch. % 0.11/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.36 # Begin clausification derivation % 0.11/0.36 % 0.11/0.36 # End clausification derivation % 0.11/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.11/0.36 cnf(i_0_59, hypothesis, (aNaturalNumber0(xm))). % 0.11/0.36 cnf(i_0_58, hypothesis, (aNaturalNumber0(xn))). % 0.11/0.36 cnf(i_0_2, plain, (aNaturalNumber0(sz00))). % 0.11/0.36 cnf(i_0_4, plain, (aNaturalNumber0(sz10))). % 0.11/0.36 cnf(i_0_60, hypothesis, (aNaturalNumber0(xl))). % 0.11/0.36 cnf(i_0_62, hypothesis, (doDivides0(xl,xm))). % 0.11/0.36 cnf(i_0_64, hypothesis, (sdtsldt0(xm,xl)=xp)). % 0.11/0.36 cnf(i_0_61, hypothesis, (doDivides0(xl,sdtpldt0(xm,xn)))). % 0.11/0.36 cnf(i_0_65, hypothesis, (sdtsldt0(sdtpldt0(xm,xn),xl)=xq)). % 0.11/0.36 cnf(i_0_3, plain, (sz00!=sz10)). % 0.11/0.36 cnf(i_0_66, negated_conjecture, (~sdtlseqdt0(xm,sdtpldt0(xm,xn)))). % 0.11/0.36 cnf(i_0_63, hypothesis, (sz00!=xl)). % 0.11/0.36 cnf(i_0_32, plain, (sdtlseqdt0(X1,X1)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_15, plain, (sdtasdt0(sz00,X1)=sz00|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_16, plain, (sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_13, plain, (sdtasdt0(sz10,X1)=X1|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_14, plain, (sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_23, plain, (X1=sz00|sdtpldt0(X2,X1)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_5, plain, (aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_24, plain, (X1=sz00|sdtpldt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_45, plain, (X1=sz10|X1=sz00|sdtlseqdt0(sz10,X1)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_6, plain, (aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_25, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_35, plain, (sdtlseqdt0(X1,X2)|sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_33, plain, (X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_49, plain, (X1=X2|iLess0(X1,X2)|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_28, plain, (aNaturalNumber0(esk1_2(X1,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_52, plain, (aNaturalNumber0(esk2_2(X1,X2))|~doDivides0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_11, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_20, plain, (X1=X2|sdtpldt0(X3,X1)!=sdtpldt0(X3,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))). % 0.11/0.36 cnf(i_0_19, plain, (X1=X2|sdtpldt0(X1,X3)!=sdtpldt0(X2,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_26, plain, (sdtlseqdt0(X1,sdtpldt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.11/0.36 cnf(i_0_47, plain, (X1=sz00|sdtlseqdt0(X2,sdtasdt0(X2,X1))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_27, plain, (sdtpldt0(X1,esk1_2(X1,X2))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_31, plain, (aNaturalNumber0(sdtmndt0(X1,X2))|~sdtlseqdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_50, plain, (doDivides0(X1,sdtasdt0(X1,X2))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.11/0.36 cnf(i_0_51, plain, (sdtasdt0(X1,esk2_2(X1,X2))=X2|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.11/0.36 cnf(i_0_34, plain, (sdtlseqdt0(X1,X2)|~sdtlseqdt0(X3,X2)|~sdtlseqdt0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_55, plain, (X1=sz00|aNaturalNumber0(sdtsldt0(X2,X1))|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.11/0.36 cnf(i_0_56, plain, (doDivides0(X1,X2)|~doDivides0(X3,X2)|~doDivides0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_22, plain, (X1=sz00|X2=X3|sdtasdt0(X1,X2)!=sdtasdt0(X1,X3)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_21, plain, (X1=sz00|X2=X3|sdtasdt0(X2,X1)!=sdtasdt0(X3,X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.11/0.36 cnf(i_0_57, plain, (doDivides0(X1,sdtpldt0(X2,X3))|~doDivides0(X1,X3)|~doDivides0(X1,X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_12, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_30, plain, (sdtpldt0(X1,sdtmndt0(X2,X1))=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_39, plain, (X1=X2|sdtlseqdt0(sdtpldt0(X3,X1),sdtpldt0(X3,X2))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3))). % 0.11/0.36 cnf(i_0_37, plain, (X1=X2|sdtlseqdt0(sdtpldt0(X1,X3),sdtpldt0(X2,X3))|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_54, plain, (sdtasdt0(X1,sdtsldt0(X2,X1))=X2|X1=sz00|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.11/0.36 cnf(i_0_29, plain, (sdtmndt0(sdtpldt0(X1,X2),X1)=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.11/0.36 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1))). % 0.11/0.36 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1))). % 0.11/0.36 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))). % 0.11/0.36 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))). % 0.11/0.36 cnf(i_0_53, plain, (sdtsldt0(sdtasdt0(X1,X2),X1)=X2|X1=sz00|~aNaturalNumber0(X1)|~aNaturalNumber0(X2))). % 0.11/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.11/0.36 # Begin printing tableau % 0.11/0.36 # Found 4 steps % 0.11/0.36 cnf(i_0_66, negated_conjecture, (~sdtlseqdt0(xm,sdtpldt0(xm,xn))), inference(start_rule)). % 0.11/0.36 cnf(i_0_76, plain, (~sdtlseqdt0(xm,sdtpldt0(xm,xn))), inference(extension_rule, [i_0_26])). % 0.11/0.36 cnf(i_0_153, plain, (~aNaturalNumber0(xm)), inference(closure_rule, [i_0_59])). % 0.11/0.36 cnf(i_0_154, plain, (~aNaturalNumber0(xn)), inference(closure_rule, [i_0_58])). % 0.11/0.36 # End printing tableau % 0.11/0.36 # SZS output end % 0.11/0.36 # Branches closed with saturation will be marked with an "s" % 0.11/0.36 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 0.11/0.36 # We now have 3 tableaux to operate on % 0.11/0.36 # Found closed tableau during pool population. % 0.11/0.36 # Proof search is over... % 0.11/0.36 # Freeing feature tree %------------------------------------------------------------------------------