0.08/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/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   : n006.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 01:57:44 EDT 2022
0.12/0.34	% CPUTime    : 
0.12/0.39	# No SInE strategy applied
0.12/0.39	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
0.12/0.39	# and selection function SelectCQIPrecW.
0.12/0.39	#
0.12/0.39	# Presaturation interreduction done
0.12/0.39	# Number of axioms: 45 Number of unprocessed: 38
0.12/0.39	# Tableaux proof search.
0.12/0.39	# APR header successfully linked.
0.12/0.39	# Hello from C++
0.19/0.48	# The folding up rule is enabled...
0.19/0.48	# Local unification is enabled...
0.19/0.48	# Any saturation attempts will use folding labels...
0.19/0.48	# 38 beginning clauses after preprocessing and clausification
0.19/0.48	# Creating start rules for all 1 conjectures.
0.19/0.48	# There are 1 start rule candidates:
0.19/0.48	# Found 14 unit axioms.
0.19/0.48	# 1 start rule tableaux created.
0.19/0.48	# 24 extension rule candidate clauses
0.19/0.48	# 14 unit axiom clauses
0.19/0.48	
0.19/0.48	# Requested 8, 32 cores available to the main process.
0.19/0.48	# There are not enough tableaux to fork, creating more from the initial 1
0.37/0.61	# There were 2 total branch saturation attempts.
0.37/0.61	# There were 0 of these attempts blocked.
0.37/0.61	# There were 0 deferred branch saturation attempts.
0.37/0.61	# There were 0 free duplicated saturations.
0.37/0.61	# There were 2 total successful branch saturations.
0.37/0.61	# There were 0 successful branch saturations in interreduction.
0.37/0.61	# There were 0 successful branch saturations on the branch.
0.37/0.61	# There were 2 successful branch saturations after the branch.
0.37/0.61	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.37/0.61	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.37/0.61	# Begin clausification derivation
0.37/0.61	
0.37/0.61	# End clausification derivation
0.37/0.61	# Begin listing active clauses obtained from FOF to CNF conversion
0.37/0.61	cnf(i_0_3, plain, (leq(X1,X1))).
0.37/0.61	cnf(i_0_17, plain, (geq(X1,X1))).
0.37/0.61	cnf(i_0_38, plain, (greater(vplus(X1,X2),X1))).
0.37/0.61	cnf(i_0_31, plain, (less(vplus(vd328,vd330),vplus(vd330,vd329)))).
0.37/0.61	cnf(i_0_42, plain, (less(X1,vplus(X1,X2)))).
0.37/0.61	cnf(i_0_1, plain, (vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3)))).
0.37/0.61	cnf(i_0_36, plain, (vplus(X1,X2)=vplus(X2,X1))).
0.37/0.61	cnf(i_0_20, negated_conjecture, (~less(vd328,vd329))).
0.37/0.61	cnf(i_0_21, plain, (~less(X1,X1))).
0.37/0.61	cnf(i_0_32, plain, (vplus(X1,v1)!=v1)).
0.37/0.61	cnf(i_0_14, plain, (vplus(X1,v1)!=X1)).
0.37/0.61	cnf(i_0_41, plain, (vplus(X1,X2)!=X2)).
0.37/0.61	cnf(i_0_6, plain, (~greater(X1,X1))).
0.37/0.61	cnf(i_0_10, plain, (vplus(X1,X2)!=X1)).
0.37/0.61	cnf(i_0_24, plain, (~greater(X1,X2)|~less(X1,X2))).
0.37/0.61	cnf(i_0_9, plain, (less(X1,X2)|~greater(X2,X1))).
0.37/0.61	cnf(i_0_4, plain, (leq(X1,X2)|~less(X1,X2))).
0.37/0.61	cnf(i_0_29, plain, (leq(X1,X2)|~geq(X2,X1))).
0.37/0.61	cnf(i_0_8, plain, (greater(X1,X2)|~less(X2,X1))).
0.37/0.61	cnf(i_0_12, plain, (geq(X1,X2)|~leq(X2,X1))).
0.37/0.61	cnf(i_0_18, plain, (geq(X1,X2)|~greater(X1,X2))).
0.37/0.61	cnf(i_0_37, plain, (X1=X2|vplus(X3,X1)!=vplus(X3,X2))).
0.37/0.61	cnf(i_0_2, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))).
0.37/0.61	cnf(i_0_34, plain, (vd329=vd328|vplus(vd330,vd329)!=vplus(vd328,vd330))).
0.37/0.61	cnf(i_0_22, plain, (greater(vd328,vd329)|~greater(vplus(vd328,vd330),vplus(vd330,vd329)))).
0.37/0.61	cnf(i_0_23, plain, (vplus(v1,vskolem2(X1))=X1|X1=v1)).
0.37/0.61	cnf(i_0_19, plain, (X1=X2|greater(X1,X2)|~geq(X1,X2))).
0.37/0.61	cnf(i_0_15, plain, (X1=X2|vplus(X1,v1)!=vplus(X2,v1))).
0.37/0.61	cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|less(X1,X2))).
0.37/0.61	cnf(i_0_5, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))).
0.37/0.61	cnf(i_0_28, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))).
0.37/0.61	cnf(i_0_27, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))).
0.37/0.61	cnf(i_0_43, plain, (vplus(X1,esk3_2(X2,X1))=X2|~less(X1,X2))).
0.37/0.61	cnf(i_0_13, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3))).
0.37/0.61	cnf(i_0_47, plain, (vplus(X1,esk4_2(X1,X2))=X2|~greater(X2,X1))).
0.37/0.61	cnf(i_0_7, plain, (less(vplus(X1,X2),vplus(X3,X2))|~less(X1,X3))).
0.37/0.61	cnf(i_0_39, plain, (greater(vplus(X1,X2),vplus(X3,X2))|~greater(X1,X3))).
0.37/0.61	cnf(i_0_30, plain, (vplus(X1,esk1_2(X2,X1))=X2|vplus(X2,esk2_2(X2,X1))=X1|X2=X1)).
0.37/0.61	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.37/0.61	# Begin printing tableau
0.37/0.61	# Found 6 steps
0.37/0.61	cnf(i_0_20, negated_conjecture, (~less(vd328,vd329)), inference(start_rule)).
0.37/0.61	cnf(i_0_57, plain, (~less(vd328,vd329)), inference(extension_rule, [i_0_27])).
0.37/0.61	cnf(i_0_99, plain, (~less(vplus(vd329,v1),vd329)), inference(extension_rule, [i_0_2])).
0.37/0.61	cnf(i_0_130, plain, (vplus(vd329,v1)=vd329), inference(closure_rule, [i_0_14])).
0.37/0.61	cnf(i_0_98, plain, (~leq(vd328,vplus(vd329,v1))), inference(etableau_closure_rule, [i_0_98, ...])).
0.37/0.61	cnf(i_0_132, plain, (~leq(vplus(vd329,v1),vd329)), inference(etableau_closure_rule, [i_0_132, ...])).
0.37/0.61	# End printing tableau
0.37/0.61	# SZS output end
0.37/0.61	# Branches closed with saturation will be marked with an "s"
0.37/0.61	# Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
0.37/0.61	# We now have 7 tableaux to operate on
0.37/0.61	# Found closed tableau during pool population.
0.37/0.61	# Proof search is over...
0.37/0.61	# Freeing feature tree
0.37/0.61	EOF