0.10/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.12	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.10/0.32	Computer   : n024.cluster.edu
0.10/0.32	Model      : x86_64 x86_64
0.10/0.32	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	RAMPerCPU  : 8042.1875MB
0.10/0.32	OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit   : 960
0.10/0.32	% WCLimit    : 120
0.10/0.32	% DateTime   : Tue Aug  9 05:04:37 EDT 2022
0.10/0.32	% CPUTime    : 
0.10/0.35	# No SInE strategy applied
0.10/0.35	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.10/0.35	# and selection function SelectComplexExceptUniqMaxHorn.
0.10/0.35	#
0.10/0.35	# Presaturation interreduction done
0.10/0.35	# Number of axioms: 31 Number of unprocessed: 27
0.10/0.35	# Tableaux proof search.
0.10/0.35	# APR header successfully linked.
0.10/0.35	# Hello from C++
0.10/0.35	# The folding up rule is enabled...
0.10/0.35	# Local unification is enabled...
0.10/0.35	# Any saturation attempts will use folding labels...
0.10/0.35	# 27 beginning clauses after preprocessing and clausification
0.10/0.35	# Creating start rules for all 8 conjectures.
0.10/0.35	# There are 8 start rule candidates:
0.10/0.35	# Found 10 unit axioms.
0.10/0.35	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.10/0.35	# 8 start rule tableaux created.
0.10/0.35	# 17 extension rule candidate clauses
0.10/0.35	# 10 unit axiom clauses
0.10/0.35	
0.10/0.35	# Requested 8, 32 cores available to the main process.
2.70/0.76	# There were 1 total branch saturation attempts.
2.70/0.76	# There were 0 of these attempts blocked.
2.70/0.76	# There were 0 deferred branch saturation attempts.
2.70/0.76	# There were 0 free duplicated saturations.
2.70/0.76	# There were 1 total successful branch saturations.
2.70/0.76	# There were 0 successful branch saturations in interreduction.
2.70/0.76	# There were 0 successful branch saturations on the branch.
2.70/0.76	# There were 1 successful branch saturations after the branch.
2.70/0.76	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
2.70/0.76	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
2.70/0.76	# Begin clausification derivation
2.70/0.76	
2.70/0.76	# End clausification derivation
2.70/0.76	# Begin listing active clauses obtained from FOF to CNF conversion
2.70/0.76	cnf(i_0_18, negated_conjecture, (int_leq(int_one,esk2_0))).
2.70/0.76	cnf(i_0_21, negated_conjecture, (int_leq(int_one,esk3_0))).
2.70/0.76	cnf(i_0_19, negated_conjecture, (int_leq(esk2_0,n))).
2.70/0.76	cnf(i_0_5, plain, (int_less(int_zero,int_one))).
2.70/0.76	cnf(i_0_20, negated_conjecture, (int_leq(esk3_0,n))).
2.70/0.76	cnf(i_0_27, plain, (int_leq(X1,X1))).
2.70/0.76	cnf(i_0_29, plain, (plus(X1,int_zero)=X1)).
2.70/0.76	cnf(i_0_1, plain, (plus(X1,X2)=plus(X2,X1))).
2.70/0.76	cnf(i_0_30, plain, (real_one!=real_zero)).
2.70/0.76	cnf(i_0_28, plain, (~int_less(X1,X1))).
2.70/0.76	cnf(i_0_14, negated_conjecture, (esk3_0=esk2_0|a(esk2_0,esk3_0)!=real_zero)).
2.70/0.76	cnf(i_0_26, plain, (int_leq(X1,X2)|~int_less(X1,X2))).
2.70/0.76	cnf(i_0_10, negated_conjecture, (a(esk2_0,esk3_0)!=real_zero|a(esk2_0,esk3_0)!=real_one)).
2.70/0.76	cnf(i_0_17, negated_conjecture, (esk3_0=esk2_0|int_less(esk3_0,esk2_0)|int_less(esk2_0,esk3_0))).
2.70/0.76	cnf(i_0_3, plain, (int_leq(int_one,X1)|~int_less(int_zero,X1))).
2.70/0.76	cnf(i_0_4, plain, (int_less(int_zero,X1)|~int_leq(int_one,X1))).
2.70/0.76	cnf(i_0_9, plain, (int_leq(X1,X2)|int_less(X2,X1))).
2.70/0.76	cnf(i_0_25, plain, (X1=X2|int_less(X1,X2)|~int_leq(X1,X2))).
2.70/0.76	cnf(i_0_13, negated_conjecture, (int_less(esk3_0,esk2_0)|int_less(esk2_0,esk3_0)|a(esk2_0,esk3_0)!=real_one)).
2.70/0.76	cnf(i_0_31, plain, (int_less(X1,X2)|~int_less(X3,X2)|~int_less(X1,X3))).
2.70/0.76	cnf(i_0_6, plain, (int_less(int_zero,esk1_2(X1,X2))|~int_less(X1,X2))).
2.70/0.76	cnf(i_0_8, plain, (int_less(X1,plus(X1,X2))|~int_less(int_zero,X2))).
2.70/0.76	cnf(i_0_7, plain, (plus(X1,esk1_2(X1,X2))=X2|~int_less(X1,X2))).
2.70/0.76	cnf(i_0_2, plain, (int_leq(plus(X1,X2),plus(X3,X4))|~int_leq(X2,X4)|~int_less(X1,X3))).
2.70/0.76	cnf(i_0_23, 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))).
2.70/0.76	cnf(i_0_22, 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))).
2.70/0.76	cnf(i_0_24, 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))).
2.70/0.76	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
2.70/0.76	# Begin printing tableau
2.70/0.76	# Found 4 steps
2.70/0.76	cnf(i_0_21, negated_conjecture, (int_leq(int_one,esk3_0)), inference(start_rule)).
2.70/0.76	cnf(i_0_49, plain, (int_leq(int_one,esk3_0)), inference(extension_rule, [i_0_4])).
2.70/0.76	cnf(i_0_55, plain, (int_less(int_zero,esk3_0)), inference(extension_rule, [i_0_26])).
2.70/0.76	cnf(i_0_57, plain, (int_leq(int_zero,esk3_0)), inference(etableau_closure_rule, [i_0_57, ...])).
2.70/0.76	# End printing tableau
2.70/0.76	# SZS output end
2.70/0.76	# Branches closed with saturation will be marked with an "s"
2.70/0.76	# Child (18133) has found a proof.
2.70/0.76	
2.70/0.76	# Proof search is over...
2.70/0.76	# Freeing feature tree
2.70/0.76	EOF