0.12/0.14 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/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.37 Computer : n005.cluster.edu 0.14/0.37 Model : x86_64 x86_64 0.14/0.37 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.37 RAMPerCPU : 8042.1875MB 0.14/0.37 OS : Linux 3.10.0-693.el7.x86_64 0.14/0.37 % CPULimit : 960 0.14/0.37 % WCLimit : 120 0.14/0.37 % DateTime : Tue Aug 9 03:57:04 EDT 2022 0.14/0.37 % CPUTime : 0.14/0.40 # No SInE strategy applied 0.14/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 0.14/0.40 # and selection function SelectComplexExceptUniqMaxHorn. 0.14/0.40 # 0.14/0.40 # Presaturation interreduction done 0.14/0.40 # Number of axioms: 27 Number of unprocessed: 27 0.14/0.40 # Tableaux proof search. 0.14/0.40 # APR header successfully linked. 0.14/0.40 # Hello from C++ 0.14/0.40 # The folding up rule is enabled... 0.14/0.40 # Local unification is enabled... 0.14/0.40 # Any saturation attempts will use folding labels... 0.14/0.40 # 27 beginning clauses after preprocessing and clausification 0.14/0.40 # Creating start rules for all 2 conjectures. 0.14/0.40 # There are 2 start rule candidates: 0.14/0.40 # Found 2 unit axioms. 0.14/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.14/0.40 # 2 start rule tableaux created. 0.14/0.40 # 25 extension rule candidate clauses 0.14/0.40 # 2 unit axiom clauses 0.14/0.40 0.14/0.40 # Requested 8, 32 cores available to the main process. 0.14/0.40 # There are not enough tableaux to fork, creating more from the initial 2 0.14/0.40 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. 0.14/0.40 # We now have 8 tableaux to operate on 0.22/0.49 # There were 3 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 3 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 3 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_15, plain, (lesseq(X1,X1))). 0.22/0.49 cnf(i_0_9, plain, (model_max(X1,X2,max(X1,X2)))). 0.22/0.49 cnf(i_0_7, negated_conjecture, (~minsol_model_max(esk1_0,esk2_0,esk3_0)|~minsol_model_ub(esk1_0,esk2_0,esk3_0))). 0.22/0.49 cnf(i_0_6, negated_conjecture, (minsol_model_max(esk1_0,esk2_0,esk3_0)|minsol_model_ub(esk1_0,esk2_0,esk3_0))). 0.22/0.49 cnf(i_0_3, plain, (lesseq(X1,X2)|~ub(X3,X1,X2))). 0.22/0.49 cnf(i_0_4, plain, (lesseq(X1,X2)|~ub(X1,X3,X2))). 0.22/0.49 cnf(i_0_11, plain, (lesseq(X1,X2)|lesseq(X2,X1))). 0.22/0.49 cnf(i_0_12, plain, (max(X1,X2)=X1|~lesseq(X2,X1))). 0.22/0.49 cnf(i_0_24, plain, (model_max(X1,X2,X3)|~minsol_model_max(X1,X2,X3))). 0.22/0.49 cnf(i_0_13, plain, (model_ub(X1,X2,X3)|~ub(X1,X2,X3))). 0.22/0.49 cnf(i_0_21, plain, (model_ub(X1,X2,X3)|~minsol_model_ub(X1,X2,X3))). 0.22/0.49 cnf(i_0_10, plain, (X1=X2|~lesseq(X2,X1)|~lesseq(X1,X2))). 0.22/0.49 cnf(i_0_22, plain, (max(X1,X2)=X2|~lesseq(X1,X2))). 0.22/0.49 cnf(i_0_1, plain, (lesseq(X1,X2)|~lesseq(summation(X1),summation(X2)))). 0.22/0.49 cnf(i_0_14, plain, (ub(X1,X2,X3)|~model_ub(X1,X2,X3))). 0.22/0.49 cnf(i_0_2, plain, (lesseq(summation(X1),summation(X2))|~lesseq(X1,X2))). 0.22/0.49 cnf(i_0_8, plain, (X1=max(X2,X3)|~model_max(X2,X3,X1))). 0.22/0.49 cnf(i_0_23, plain, (lesseq(X1,X2)|~lesseq(X3,X2)|~lesseq(X1,X3))). 0.22/0.49 cnf(i_0_17, plain, (lesseq(X1,X2)|~lesseq(sum(X3,X1),sum(X3,X2)))). 0.22/0.49 cnf(i_0_5, plain, (ub(X1,X2,X3)|~lesseq(X2,X3)|~lesseq(X1,X3))). 0.22/0.49 cnf(i_0_20, plain, (lesseq(X1,X2)|~model_ub(X3,X4,X2)|~minsol_model_ub(X3,X4,X1))). 0.22/0.49 cnf(i_0_16, plain, (lesseq(sum(X1,X2),sum(X1,X3))|~lesseq(X2,X3))). 0.22/0.49 cnf(i_0_25, plain, (lesseq(X1,X2)|~model_max(X3,X4,X2)|~minsol_model_max(X3,X4,X1))). 0.22/0.49 cnf(i_0_18, plain, (minsol_model_ub(X1,X2,X3)|~model_ub(X1,X2,X3)|~lesseq(X3,esk4_3(X1,X2,X3)))). 0.22/0.49 cnf(i_0_26, plain, (minsol_model_max(X1,X2,X3)|~model_max(X1,X2,X3)|~lesseq(X3,esk5_3(X1,X2,X3)))). 0.22/0.49 cnf(i_0_19, plain, (model_ub(X1,X2,esk4_3(X1,X2,X3))|minsol_model_ub(X1,X2,X3)|~model_ub(X1,X2,X3))). 0.22/0.49 cnf(i_0_27, plain, (model_max(X1,X2,esk5_3(X1,X2,X3))|minsol_model_max(X1,X2,X3)|~model_max(X1,X2,X3))). 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 6 steps 0.22/0.49 cnf(i_0_7, negated_conjecture, (~minsol_model_max(esk1_0,esk2_0,esk3_0)|~minsol_model_ub(esk1_0,esk2_0,esk3_0)), inference(start_rule)). 0.22/0.49 cnf(i_0_32, plain, (~minsol_model_ub(esk1_0,esk2_0,esk3_0)), inference(extension_rule, [i_0_19])). 0.22/0.49 cnf(i_0_259, plain, (model_ub(esk1_0,esk2_0,esk4_3(esk1_0,esk2_0,esk3_0))), inference(extension_rule, [i_0_14])). 0.22/0.49 cnf(i_0_31, plain, (~minsol_model_max(esk1_0,esk2_0,esk3_0)), inference(etableau_closure_rule, [i_0_31, ...])). 0.22/0.49 cnf(i_0_261, plain, (~model_ub(esk1_0,esk2_0,esk3_0)), inference(etableau_closure_rule, [i_0_261, ...])). 0.22/0.49 cnf(i_0_290, plain, (ub(esk1_0,esk2_0,esk4_3(esk1_0,esk2_0,esk3_0))), inference(etableau_closure_rule, [i_0_290, ...])). 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.49 # Child (11542) has found a proof. 0.22/0.49 0.22/0.49 # Proof search is over... 0.22/0.49 # Freeing feature tree 0.22/0.49 EOF