0.05/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.10	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.10/0.31	% Computer   : n013.cluster.edu
0.10/0.31	% Model      : x86_64 x86_64
0.10/0.31	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory     : 8042.1875MB
0.10/0.31	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit   : 1200
0.10/0.31	% WCLimit    : 120
0.10/0.31	% DateTime   : Tue Jul 13 16:29:33 EDT 2021
0.10/0.31	% CPUTime    : 
0.10/0.33	# No SInE strategy applied
0.10/0.33	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
0.10/0.33	# and selection function SelectComplexExceptUniqMaxHorn.
0.10/0.33	#
0.10/0.33	# Presaturation interreduction done
0.10/0.33	# Number of axioms: 27 Number of unprocessed: 27
0.10/0.33	# Tableaux proof search.
0.10/0.33	# APR header successfully linked.
0.10/0.33	# Hello from C++
0.10/0.33	# The folding up rule is enabled...
0.10/0.33	# Local unification is enabled...
0.10/0.33	# Any saturation attempts will use folding labels...
0.10/0.33	# 27 beginning clauses after preprocessing and clausification
0.10/0.33	# Creating start rules for all 2 conjectures.
0.10/0.33	# There are 2 start rule candidates:
0.10/0.33	# Found 2 unit axioms.
0.10/0.33	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.10/0.33	# 2 start rule tableaux created.
0.10/0.33	# 25 extension rule candidate clauses
0.10/0.33	# 2 unit axiom clauses
0.10/0.33	
0.10/0.33	# Requested 8, 32 cores available to the main process.
0.10/0.33	# There are not enough tableaux to fork, creating more from the initial 2
0.10/0.33	# Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
0.10/0.33	# We now have 8 tableaux to operate on
0.15/0.36	# There were 3 total branch saturation attempts.
0.15/0.36	# There were 0 of these attempts blocked.
0.15/0.36	# There were 0 deferred branch saturation attempts.
0.15/0.36	# There were 0 free duplicated saturations.
0.15/0.36	# There were 3 total successful branch saturations.
0.15/0.36	# There were 0 successful branch saturations in interreduction.
0.15/0.36	# There were 0 successful branch saturations on the branch.
0.15/0.36	# There were 3 successful branch saturations after the branch.
0.15/0.36	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/0.36	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.15/0.36	# Begin clausification derivation
0.15/0.36	
0.15/0.36	# End clausification derivation
0.15/0.36	# Begin listing active clauses obtained from FOF to CNF conversion
0.15/0.36	cnf(i_0_3, plain, (lesseq(X1,X1))).
0.15/0.36	cnf(i_0_16, plain, (model_max(X1,X2,max(X1,X2)))).
0.15/0.36	cnf(i_0_13, negated_conjecture, (~minsol_model_ub(esk2_0,esk3_0,esk4_0)|~minsol_model_max(esk2_0,esk3_0,esk4_0))).
0.15/0.36	cnf(i_0_12, negated_conjecture, (minsol_model_ub(esk2_0,esk3_0,esk4_0)|minsol_model_max(esk2_0,esk3_0,esk4_0))).
0.15/0.36	cnf(i_0_6, plain, (lesseq(X1,X2)|~ub(X3,X1,X2))).
0.15/0.36	cnf(i_0_5, plain, (lesseq(X1,X2)|~ub(X1,X3,X2))).
0.15/0.36	cnf(i_0_15, plain, (lesseq(X1,X2)|lesseq(X2,X1))).
0.15/0.36	cnf(i_0_14, plain, (max(X1,X2)=X2|~lesseq(X1,X2))).
0.15/0.36	cnf(i_0_8, plain, (model_max(X1,X2,X3)|~minsol_model_max(X1,X2,X3))).
0.15/0.36	cnf(i_0_20, plain, (model_ub(X1,X2,X3)|~ub(X1,X2,X3))).
0.15/0.36	cnf(i_0_27, plain, (model_ub(X1,X2,X3)|~minsol_model_ub(X1,X2,X3))).
0.15/0.36	cnf(i_0_1, plain, (X1=X2|~lesseq(X2,X1)|~lesseq(X1,X2))).
0.15/0.36	cnf(i_0_4, plain, (max(X1,X2)=X1|~lesseq(X2,X1))).
0.15/0.36	cnf(i_0_18, plain, (lesseq(X1,X2)|~lesseq(summation(X1),summation(X2)))).
0.15/0.36	cnf(i_0_21, plain, (ub(X1,X2,X3)|~model_ub(X1,X2,X3))).
0.15/0.36	cnf(i_0_19, plain, (lesseq(summation(X1),summation(X2))|~lesseq(X1,X2))).
0.15/0.36	cnf(i_0_17, plain, (X1=max(X2,X3)|~model_max(X2,X3,X1))).
0.15/0.36	cnf(i_0_2, plain, (lesseq(X1,X2)|~lesseq(X1,X3)|~lesseq(X3,X2))).
0.15/0.36	cnf(i_0_22, plain, (lesseq(X1,X2)|~lesseq(sum(X3,X1),sum(X3,X2)))).
0.15/0.36	cnf(i_0_7, plain, (ub(X1,X2,X3)|~lesseq(X1,X3)|~lesseq(X2,X3))).
0.15/0.36	cnf(i_0_9, plain, (lesseq(X1,X2)|~minsol_model_max(X3,X4,X1)|~model_max(X3,X4,X2))).
0.15/0.36	cnf(i_0_23, plain, (lesseq(sum(X1,X2),sum(X1,X3))|~lesseq(X2,X3))).
0.15/0.36	cnf(i_0_26, plain, (lesseq(X1,X2)|~model_ub(X3,X4,X2)|~minsol_model_ub(X3,X4,X1))).
0.15/0.36	cnf(i_0_10, plain, (minsol_model_max(X1,X2,X3)|~model_max(X1,X2,X3)|~lesseq(X3,esk1_3(X1,X2,X3)))).
0.15/0.36	cnf(i_0_24, plain, (minsol_model_ub(X1,X2,X3)|~model_ub(X1,X2,X3)|~lesseq(X3,esk5_3(X1,X2,X3)))).
0.15/0.36	cnf(i_0_11, plain, (minsol_model_max(X1,X2,X3)|model_max(X1,X2,esk1_3(X1,X2,X3))|~model_max(X1,X2,X3))).
0.15/0.36	cnf(i_0_25, plain, (model_ub(X1,X2,esk5_3(X1,X2,X3))|minsol_model_ub(X1,X2,X3)|~model_ub(X1,X2,X3))).
0.15/0.36	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.15/0.36	# Begin printing tableau
0.15/0.36	# Found 6 steps
0.15/0.36	cnf(i_0_13, negated_conjecture, (~minsol_model_ub(esk2_0,esk3_0,esk4_0)|~minsol_model_max(esk2_0,esk3_0,esk4_0)), inference(start_rule)).
0.15/0.36	cnf(i_0_31, plain, (~minsol_model_ub(esk2_0,esk3_0,esk4_0)), inference(extension_rule, [i_0_25])).
0.15/0.36	cnf(i_0_203, plain, (model_ub(esk2_0,esk3_0,esk5_3(esk2_0,esk3_0,esk4_0))), inference(extension_rule, [i_0_21])).
0.15/0.36	cnf(i_0_32, plain, (~minsol_model_max(esk2_0,esk3_0,esk4_0)), inference(etableau_closure_rule, [i_0_32, ...])).
0.15/0.36	cnf(i_0_205, plain, (~model_ub(esk2_0,esk3_0,esk4_0)), inference(etableau_closure_rule, [i_0_205, ...])).
0.15/0.36	cnf(i_0_290, plain, (ub(esk2_0,esk3_0,esk5_3(esk2_0,esk3_0,esk4_0))), inference(etableau_closure_rule, [i_0_290, ...])).
0.15/0.36	# End printing tableau
0.15/0.36	# SZS output end
0.15/0.36	# Branches closed with saturation will be marked with an "s"
0.15/0.37	# Child (4311) has found a proof.
0.15/0.37	
0.15/0.37	# Proof search is over...
0.15/0.37	# Freeing feature tree
0.15/0.37	EOF