0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.13/0.33	% Computer   : n008.cluster.edu
0.13/0.33	% Model      : x86_64 x86_64
0.13/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory     : 8042.1875MB
0.13/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1200
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Wed Jul 14 15:12:44 EDT 2021
0.13/0.34	% CPUTime    : 
0.13/0.37	# No SInE strategy applied
0.13/0.37	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.13/0.37	# and selection function SelectComplexExceptUniqMaxHorn.
0.13/0.37	#
0.13/0.37	# Presaturation interreduction done
0.13/0.37	# Number of axioms: 23 Number of unprocessed: 23
0.13/0.37	# Tableaux proof search.
0.13/0.37	# APR header successfully linked.
0.13/0.37	# Hello from C++
0.13/0.37	# The folding up rule is enabled...
0.13/0.37	# Local unification is enabled...
0.13/0.37	# Any saturation attempts will use folding labels...
0.13/0.37	# 23 beginning clauses after preprocessing and clausification
0.13/0.37	# Creating start rules for all 4 conjectures.
0.13/0.37	# There are 4 start rule candidates:
0.13/0.37	# Found 10 unit axioms.
0.13/0.37	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.13/0.37	# 4 start rule tableaux created.
0.13/0.37	# 13 extension rule candidate clauses
0.13/0.37	# 10 unit axiom clauses
0.13/0.37	
0.13/0.37	# Requested 8, 32 cores available to the main process.
0.13/0.37	# There are not enough tableaux to fork, creating more from the initial 4
0.13/0.37	# Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
0.13/0.37	# We now have 12 tableaux to operate on
5.45/1.15	# There were 1 total branch saturation attempts.
5.45/1.15	# There were 0 of these attempts blocked.
5.45/1.15	# There were 0 deferred branch saturation attempts.
5.45/1.15	# There were 0 free duplicated saturations.
5.45/1.15	# There were 1 total successful branch saturations.
5.45/1.15	# There were 0 successful branch saturations in interreduction.
5.45/1.15	# There were 0 successful branch saturations on the branch.
5.45/1.15	# There were 1 successful branch saturations after the branch.
5.45/1.15	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
5.45/1.15	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
5.45/1.15	# Begin clausification derivation
5.45/1.15	
5.45/1.15	# End clausification derivation
5.45/1.15	# Begin listing active clauses obtained from FOF to CNF conversion
5.45/1.15	cnf(i_0_21, negated_conjecture, (int_less(esk2_0,esk3_0))).
5.45/1.15	cnf(i_0_19, negated_conjecture, (int_leq(int_one,esk2_0))).
5.45/1.15	cnf(i_0_20, negated_conjecture, (int_leq(esk3_0,n))).
5.45/1.15	cnf(i_0_3, plain, (int_less(int_zero,int_one))).
5.45/1.15	cnf(i_0_22, plain, (plus(X1,int_zero)=X1)).
5.45/1.15	cnf(i_0_11, plain, (int_leq(X1,X1))).
5.45/1.15	cnf(i_0_4, plain, (plus(X1,X2)=plus(X2,X1))).
5.45/1.15	cnf(i_0_1, plain, (real_one!=real_zero)).
5.45/1.15	cnf(i_0_18, negated_conjecture, (a(esk2_0,esk3_0)!=real_zero)).
5.45/1.15	cnf(i_0_6, plain, (~int_less(X1,X1))).
5.45/1.15	cnf(i_0_10, plain, (int_leq(X1,X2)|~int_less(X1,X2))).
5.45/1.15	cnf(i_0_16, plain, (int_leq(int_one,X1)|~int_less(int_zero,X1))).
5.45/1.15	cnf(i_0_17, plain, (int_less(int_zero,X1)|~int_leq(int_one,X1))).
5.45/1.15	cnf(i_0_2, plain, (int_leq(X1,X2)|int_less(X2,X1))).
5.45/1.15	cnf(i_0_12, plain, (X1=X2|int_less(X1,X2)|~int_leq(X1,X2))).
5.45/1.15	cnf(i_0_15, plain, (int_less(int_zero,esk1_2(X1,X2))|~int_less(X1,X2))).
5.45/1.15	cnf(i_0_23, plain, (int_less(X1,X2)|~int_less(X1,X3)|~int_less(X3,X2))).
5.45/1.15	cnf(i_0_13, plain, (int_less(X1,plus(X1,X2))|~int_less(int_zero,X2))).
5.45/1.15	cnf(i_0_14, plain, (plus(X1,esk1_2(X1,X2))=X2|~int_less(X1,X2))).
5.45/1.15	cnf(i_0_5, plain, (int_leq(plus(X1,X2),plus(X3,X4))|~int_leq(X2,X4)|~int_less(X1,X3))).
5.45/1.15	cnf(i_0_8, hypothesis, (a(X1,X1)=real_one|~int_leq(X2,n)|~int_leq(X3,n)|~int_leq(int_one,X2)|~int_leq(int_one,X3)|~int_leq(int_one,X1)|~int_leq(X1,X3))).
5.45/1.15	cnf(i_0_7, hypothesis, (a(plus(X1,X2),X1)=real_zero|~int_leq(plus(X3,X2),n)|~int_leq(int_one,plus(X3,X2))|~int_leq(X3,n)|~int_leq(int_one,X1)|~int_leq(int_one,X3)|~int_leq(X1,X3)|~int_less(int_zero,X2))).
5.45/1.15	cnf(i_0_9, hypothesis, (a(X1,plus(X1,X2))=real_zero|~int_leq(plus(X3,X2),n)|~int_leq(int_one,plus(X3,X2))|~int_leq(X3,n)|~int_leq(int_one,X1)|~int_leq(int_one,X3)|~int_leq(X1,X3)|~int_less(int_zero,X2))).
5.45/1.15	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
5.45/1.15	# Begin printing tableau
5.45/1.15	# Found 4 steps
5.45/1.15	cnf(i_0_19, negated_conjecture, (int_leq(int_one,esk2_0)), inference(start_rule)).
5.45/1.15	cnf(i_0_31, plain, (int_leq(int_one,esk2_0)), inference(extension_rule, [i_0_17])).
5.45/1.15	cnf(i_0_129, plain, (int_less(int_zero,esk2_0)), inference(extension_rule, [i_0_10])).
5.45/1.15	cnf(i_0_131, plain, (int_leq(int_zero,esk2_0)), inference(etableau_closure_rule, [i_0_131, ...])).
5.45/1.15	# End printing tableau
5.45/1.15	# SZS output end
5.45/1.15	# Branches closed with saturation will be marked with an "s"
5.45/1.16	# Child (10973) has found a proof.
5.45/1.16	
5.45/1.16	# Proof search is over...
5.45/1.16	# Freeing feature tree
6.29/1.16	EOF