0.03/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.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.12/0.33	Computer   : n026.cluster.edu
0.12/0.33	Model      : x86_64 x86_64
0.12/0.33	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	RAMPerCPU  : 8042.1875MB
0.12/0.33	OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 960
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Aug  9 04:37:34 EDT 2022
0.12/0.33	% CPUTime    : 
0.18/0.36	# No SInE strategy applied
0.18/0.36	# Auto-Mode selected heuristic G_E___208_C02CMA_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: 26 Number of unprocessed: 20
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	# 20 beginning clauses after preprocessing and clausification
0.18/0.36	# Creating start rules for all 1 conjectures.
0.18/0.36	# There are 1 start rule candidates:
0.18/0.36	# Found 9 unit axioms.
0.18/0.36	# 1 start rule tableaux created.
0.18/0.36	# 11 extension rule candidate clauses
0.18/0.36	# 9 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 1
0.18/0.37	# There were 2 total branch saturation attempts.
0.18/0.37	# There were 0 of these attempts blocked.
0.18/0.37	# There were 0 deferred branch saturation attempts.
0.18/0.37	# There were 0 free duplicated saturations.
0.18/0.37	# There were 2 total successful branch saturations.
0.18/0.37	# There were 0 successful branch saturations in interreduction.
0.18/0.37	# There were 0 successful branch saturations on the branch.
0.18/0.37	# There were 2 successful branch saturations after the branch.
0.18/0.37	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.18/0.37	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.18/0.37	# Begin clausification derivation
0.18/0.37	
0.18/0.37	# End clausification derivation
0.18/0.37	# Begin listing active clauses obtained from FOF to CNF conversion
0.18/0.37	cnf(i_0_19, plain, (greater(vd344,vd345))).
0.18/0.37	cnf(i_0_12, plain, (greater(vd347,vd348))).
0.18/0.37	cnf(i_0_22, plain, (greater(vplus(vd344,vd347),vplus(vd345,vd347)))).
0.18/0.37	cnf(i_0_10, plain, (greater(vplus(vd345,vd347),vplus(vd345,vd348)))).
0.18/0.37	cnf(i_0_24, plain, (greater(vplus(X1,X2),X1))).
0.18/0.37	cnf(i_0_23, plain, (vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3)))).
0.18/0.37	cnf(i_0_1, plain, (vplus(X1,X2)=vplus(X2,X1))).
0.18/0.37	cnf(i_0_3, negated_conjecture, (~greater(vplus(vd344,vd347),vplus(vd345,vd348)))).
0.18/0.37	cnf(i_0_26, plain, (vplus(X1,X2)!=X1)).
0.18/0.37	cnf(i_0_21, plain, (~less(X1,X2)|~greater(X1,X2))).
0.18/0.37	cnf(i_0_16, plain, (less(X1,X2)|~greater(X2,X1))).
0.18/0.37	cnf(i_0_18, plain, (greater(X1,X2)|~less(X2,X1))).
0.18/0.37	cnf(i_0_14, plain, (X1=X2|vplus(X1,X3)!=vplus(X2,X3))).
0.18/0.37	cnf(i_0_6, plain, (vplus(v1,vskolem2(X1))=X1|X1=v1)).
0.18/0.37	cnf(i_0_28, plain, (greater(X1,X2)|~greater(vplus(X1,X3),vplus(X2,X3)))).
0.18/0.37	cnf(i_0_7, plain, (less(X1,X2)|~less(vplus(X1,X3),vplus(X2,X3)))).
0.18/0.37	cnf(i_0_11, plain, (X1=X2|less(X1,X2)|greater(X1,X2))).
0.18/0.37	cnf(i_0_20, plain, (greater(vplus(X1,X2),vplus(X3,X2))|~greater(X1,X3))).
0.18/0.37	cnf(i_0_4, plain, (vplus(X1,esk1_2(X1,X2))=X2|~greater(X2,X1))).
0.18/0.37	cnf(i_0_13, plain, (less(vplus(X1,X2),vplus(X3,X2))|~less(X1,X3))).
0.18/0.37	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.18/0.37	# Begin printing tableau
0.18/0.37	# Found 5 steps
0.18/0.37	cnf(i_0_3, negated_conjecture, (~greater(vplus(vd344,vd347),vplus(vd345,vd348))), inference(start_rule)).
0.18/0.37	cnf(i_0_31, plain, (~greater(vplus(vd344,vd347),vplus(vd345,vd348))), inference(extension_rule, [i_0_11])).
0.18/0.37	cnf(i_0_47, plain, (less(vplus(vd344,vd347),vplus(vd345,vd348))), inference(extension_rule, [i_0_18])).
0.18/0.37	cnf(i_0_46, plain, (vplus(vd345,vd348)=vplus(vd344,vd347)), inference(etableau_closure_rule, [i_0_46, ...])).
0.18/0.37	cnf(i_0_82, plain, (greater(vplus(vd345,vd348),vplus(vd344,vd347))), inference(etableau_closure_rule, [i_0_82, ...])).
0.18/0.37	# End printing tableau
0.18/0.37	# SZS output end
0.18/0.37	# Branches closed with saturation will be marked with an "s"
0.18/0.37	# Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
0.18/0.37	# We now have 3 tableaux to operate on
0.18/0.37	# Found closed tableau during pool population.
0.18/0.37	# Proof search is over...
0.18/0.37	# Freeing feature tree
0.18/0.37	EOF