%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM862+1 : TPTP v8.1.0. Released v4.1.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 : n020.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:46:18 EDT 2022 % Result : Theorem 25.60s 3.58s % Output : CNFRefutation 25.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : NUM862+1 : TPTP v8.1.0. Released v4.1.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.11/0.33 % Computer : n020.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 18:10:14 EDT 2022 % 0.11/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18CMA_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: 28 Number of unprocessed: 28 % 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.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 28 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 2 conjectures. % 0.18/0.36 # There are 2 start rule candidates: % 0.18/0.36 # Found 1 unit axioms. % 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.36 # 2 start rule tableaux created. % 0.18/0.36 # 27 extension rule candidate clauses % 0.18/0.36 # 1 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 2 % 0.18/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 8 tableaux to operate on % 25.60/3.58 # There were 4 total branch saturation attempts. % 25.60/3.58 # There were 0 of these attempts blocked. % 25.60/3.58 # There were 0 deferred branch saturation attempts. % 25.60/3.58 # There were 0 free duplicated saturations. % 25.60/3.58 # There were 3 total successful branch saturations. % 25.60/3.58 # There were 0 successful branch saturations in interreduction. % 25.60/3.58 # There were 0 successful branch saturations on the branch. % 25.60/3.58 # There were 3 successful branch saturations after the branch. % 25.60/3.58 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 25.60/3.58 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 25.60/3.58 # Begin clausification derivation % 25.60/3.58 % 25.60/3.58 # End clausification derivation % 25.60/3.58 # Begin listing active clauses obtained from FOF to CNF conversion % 25.60/3.58 cnf(i_0_1, plain, (lesseq(X1,X1))). % 25.60/3.58 cnf(i_0_28, negated_conjecture, (~minsol_model_ub(esk4_0,esk5_0,esk6_0)|~minsol_model_max(esk4_0,esk5_0,esk6_0))). % 25.60/3.58 cnf(i_0_27, negated_conjecture, (minsol_model_ub(esk4_0,esk5_0,esk6_0)|minsol_model_max(esk4_0,esk5_0,esk6_0))). % 25.60/3.58 cnf(i_0_12, plain, (lesseq(X1,X2)|~ub(X3,X1,X2))). % 25.60/3.58 cnf(i_0_13, plain, (lesseq(X1,X2)|~ub(X1,X3,X2))). % 25.60/3.58 cnf(i_0_4, plain, (lesseq(X1,X2)|lesseq(X2,X1))). % 25.60/3.58 cnf(i_0_10, plain, (max(X1,X2)=X2|~lesseq(X1,X2))). % 25.60/3.58 cnf(i_0_22, plain, (model_max(X1,X2,X3)|~minsol_model_max(X1,X2,X3))). % 25.60/3.58 cnf(i_0_26, plain, (model_ub(X1,X2,X3)|~minsol_model_ub(X1,X2,X3))). % 25.60/3.58 cnf(i_0_3, plain, (X1=X2|~lesseq(X2,X1)|~lesseq(X1,X2))). % 25.60/3.58 cnf(i_0_7, plain, (lesseq(X1,X2)|~lesseq(summation(X1),summation(X2)))). % 25.60/3.58 cnf(i_0_9, plain, (max(X1,X2)=X1|~lesseq(X2,X1))). % 25.60/3.58 cnf(i_0_8, plain, (lesseq(summation(X1),summation(X2))|~lesseq(X1,X2))). % 25.60/3.58 cnf(i_0_5, plain, (lesseq(X1,X2)|~lesseq(sum(X3,X1),sum(X3,X2)))). % 25.60/3.58 cnf(i_0_11, plain, (ub(X1,X2,X3)|~lesseq(X2,X3)|~lesseq(X1,X3))). % 25.60/3.58 cnf(i_0_2, plain, (lesseq(X1,X2)|~lesseq(X3,X2)|~lesseq(X1,X3))). % 25.60/3.58 cnf(i_0_6, plain, (lesseq(sum(X1,X2),sum(X1,X3))|~lesseq(X2,X3))). % 25.60/3.58 cnf(i_0_18, plain, (ub(X1,X2,esk1_3(X1,X2,X3))|~model_ub(X1,X2,X3))). % 25.60/3.58 cnf(i_0_21, plain, (lesseq(X1,X2)|~minsol_model_max(X3,X4,X1)|~model_max(X3,X4,X2))). % 25.60/3.58 cnf(i_0_25, plain, (lesseq(X1,X2)|~minsol_model_ub(X3,X4,X1)|~model_ub(X3,X4,X2))). % 25.60/3.58 cnf(i_0_19, plain, (minsol_model_max(X1,X2,X3)|~model_max(X1,X2,X3)|~lesseq(X3,esk2_3(X1,X2,X3)))). % 25.60/3.58 cnf(i_0_23, plain, (minsol_model_ub(X1,X2,X3)|~model_ub(X1,X2,X3)|~lesseq(X3,esk3_3(X1,X2,X3)))). % 25.60/3.58 cnf(i_0_15, plain, (lesseq(sum(c,summation(max(X1,X2))),X3)|~model_max(X1,X2,X3))). % 25.60/3.58 cnf(i_0_14, plain, (model_max(X1,X2,X3)|~lesseq(sum(c,summation(max(X1,X2))),X3))). % 25.60/3.58 cnf(i_0_16, plain, (model_ub(X1,X2,X3)|~ub(X1,X2,X4)|~lesseq(sum(c,summation(X4)),X3))). % 25.60/3.58 cnf(i_0_17, plain, (lesseq(sum(c,summation(esk1_3(X1,X2,X3))),X3)|~model_ub(X1,X2,X3))). % 25.60/3.58 cnf(i_0_20, plain, (minsol_model_max(X1,X2,X3)|model_max(X1,X2,esk2_3(X1,X2,X3))|~model_max(X1,X2,X3))). % 25.60/3.58 cnf(i_0_24, plain, (minsol_model_ub(X1,X2,X3)|model_ub(X1,X2,esk3_3(X1,X2,X3))|~model_ub(X1,X2,X3))). % 25.60/3.58 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 25.60/3.58 # Begin printing tableau % 25.60/3.58 # Found 8 steps % 25.60/3.58 cnf(i_0_28, negated_conjecture, (~minsol_model_ub(esk4_0,esk5_0,esk6_0)|~minsol_model_max(esk4_0,esk5_0,esk6_0)), inference(start_rule)). % 25.60/3.58 cnf(i_0_32, plain, (~minsol_model_max(esk4_0,esk5_0,esk6_0)), inference(extension_rule, [i_0_19])). % 25.60/3.58 cnf(i_0_265, plain, (~model_max(esk4_0,esk5_0,esk6_0)), inference(extension_rule, [i_0_14])). % 25.60/3.58 cnf(i_0_31, plain, (~minsol_model_ub(esk4_0,esk5_0,esk6_0)), inference(etableau_closure_rule, [i_0_31, ...])). % 25.60/3.58 cnf(i_0_337, plain, (~lesseq(sum(c,summation(max(esk4_0,esk5_0))),esk6_0)), inference(extension_rule, [i_0_12])). % 25.60/3.58 cnf(i_0_266, plain, (~lesseq(esk6_0,esk2_3(esk4_0,esk5_0,esk6_0))), inference(extension_rule, [i_0_13])). % 25.60/3.58 cnf(i_0_216923, plain, (~ub(X6,sum(c,summation(max(esk4_0,esk5_0))),esk6_0)), inference(etableau_closure_rule, [i_0_216923, ...])). % 25.60/3.58 cnf(i_0_216925, plain, (~ub(esk6_0,X7,esk2_3(esk4_0,esk5_0,esk6_0))), inference(etableau_closure_rule, [i_0_216925, ...])). % 25.60/3.58 # End printing tableau % 25.60/3.58 # SZS output end % 25.60/3.58 # Branches closed with saturation will be marked with an "s" % 25.60/3.59 # Child (26414) has found a proof. % 25.60/3.59 % 25.60/3.59 # Proof search is over... % 25.60/3.59 # Freeing feature tree %------------------------------------------------------------------------------