0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.13/0.34	% Computer   : n006.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% 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   : Tue Jul 13 16:26:25 EDT 2021
0.13/0.35	% CPUTime    : 
0.20/0.38	# No SInE strategy applied
0.20/0.38	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
0.20/0.38	# and selection function SelectCQIPrecW.
0.20/0.38	#
0.20/0.38	# Presaturation interreduction done
0.20/0.38	# Number of axioms: 39 Number of unprocessed: 15
0.20/0.38	# Tableaux proof search.
0.20/0.38	# APR header successfully linked.
0.20/0.38	# Hello from C++
0.20/0.38	# The folding up rule is enabled...
0.20/0.38	# Local unification is enabled...
0.20/0.38	# Any saturation attempts will use folding labels...
0.20/0.38	# 15 beginning clauses after preprocessing and clausification
0.20/0.38	# Creating start rules for all 3 conjectures.
0.20/0.38	# There are 3 start rule candidates:
0.20/0.38	# Found 10 unit axioms.
0.20/0.38	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.20/0.38	# 3 start rule tableaux created.
0.20/0.38	# 5 extension rule candidate clauses
0.20/0.38	# 10 unit axiom clauses
0.20/0.38	
0.20/0.38	# Requested 8, 32 cores available to the main process.
0.20/0.38	# There are not enough tableaux to fork, creating more from the initial 3
0.20/0.38	# Closed tableau found in foldup close cycle with 0 folds and 2 closures done.
0.20/0.38	# Closed tableau found in foldup close cycle with 0 folds and 2 closures done.
0.20/0.38	# There were 0 total branch saturation attempts.
0.20/0.38	# There were 0 of these attempts blocked.
0.20/0.38	# There were 0 deferred branch saturation attempts.
0.20/0.38	# There were 0 free duplicated saturations.
0.20/0.38	# There were 0 total successful branch saturations.
0.20/0.38	# There were 0 successful branch saturations in interreduction.
0.20/0.38	# There were 0 successful branch saturations on the branch.
0.20/0.38	# There were 0 successful branch saturations after the branch.
0.20/0.38	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.20/0.38	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.20/0.38	# Begin clausification derivation
0.20/0.38	
0.20/0.38	# End clausification derivation
0.20/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.20/0.38	cnf(i_0_38, plain, (m(X1))).
0.20/0.38	cnf(i_0_8, plain, (vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3)))).
0.20/0.38	cnf(i_0_1, plain, (vplus(X1,X2)=vplus(X2,X1))).
0.20/0.38	cnf(i_0_11, negated_conjecture, (vd151!=vd165)).
0.20/0.38	cnf(i_0_12, negated_conjecture, (vplus(vd165,X1)!=vd151)).
0.20/0.38	cnf(i_0_13, negated_conjecture, (vplus(vd151,X1)!=vd165)).
0.20/0.38	cnf(i_0_40, plain, (vplus(X1,v1)!=v1)).
0.20/0.38	cnf(i_0_33, plain, (vplus(X1,X2)!=X2)).
0.20/0.38	cnf(i_0_41, plain, (vplus(X1,v1)!=X1)).
0.20/0.38	cnf(i_0_23, plain, (vplus(X1,X2)!=X1)).
0.20/0.38	cnf(i_0_9, plain, (X1=X2|vplus(X1,v1)!=vplus(X2,v1))).
0.20/0.38	cnf(i_0_7, plain, (X1=X2|vplus(X3,X1)!=vplus(X3,X2))).
0.20/0.38	cnf(i_0_42, plain, (vplus(v1,vskolem2(X1))=X1|v1=X1)).
0.20/0.38	cnf(i_0_16, plain, (vplus(v1,esk1_1(v1))=vd151|vd151=v1)).
0.20/0.38	cnf(i_0_39, plain, (vplus(X1,esk2_2(X2,X1))=X2|vplus(X2,esk3_2(X2,X1))=X1|X1=X2)).
0.20/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.20/0.38	# Begin printing tableau
0.20/0.38	# Found 4 steps
0.20/0.38	cnf(i_0_13, negated_conjecture, (vplus(vd151,esk3_2(vd151,vd165))!=vd165), inference(start_rule)).
0.20/0.38	cnf(i_0_60, plain, (vplus(vd151,esk3_2(vd151,vd165))!=vd165), inference(extension_rule, [i_0_39])).
0.20/0.38	cnf(i_0_71, plain, (vplus(vd165,esk2_2(vd151,vd165))=vd151), inference(closure_rule, [i_0_12])).
0.20/0.38	cnf(i_0_73, plain, (vd165=vd151), inference(closure_rule, [i_0_11])).
0.20/0.38	# End printing tableau
0.20/0.38	# SZS output end
0.20/0.38	# Branches closed with saturation will be marked with an "s"
0.20/0.38	# Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
0.20/0.38	# We now have 7 tableaux to operate on
0.20/0.38	# Found closed tableau during pool population.
0.20/0.38	# Proof search is over...
0.20/0.38	# Freeing feature tree
0.20/0.38	EOF