0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.11	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.11/0.32	% Computer   : n031.cluster.edu
0.11/0.32	% Model      : x86_64 x86_64
0.11/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory     : 8042.1875MB
0.11/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 1200
0.11/0.32	% WCLimit    : 120
0.11/0.32	% DateTime   : Tue Jul 13 15:26:44 EDT 2021
0.11/0.32	% CPUTime    : 
0.11/0.35	# No SInE strategy applied
0.11/0.35	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.11/0.35	# and selection function SelectComplexExceptUniqMaxHorn.
0.11/0.35	#
0.11/0.35	# Presaturation interreduction done
0.11/0.35	# Number of axioms: 20 Number of unprocessed: 20
0.11/0.35	# Tableaux proof search.
0.11/0.35	# APR header successfully linked.
0.11/0.35	# Hello from C++
0.11/0.35	# The folding up rule is enabled...
0.11/0.35	# Local unification is enabled...
0.11/0.35	# Any saturation attempts will use folding labels...
0.11/0.35	# 20 beginning clauses after preprocessing and clausification
0.11/0.35	# Creating start rules for all 2 conjectures.
0.11/0.35	# There are 2 start rule candidates:
0.11/0.35	# Found 3 unit axioms.
0.11/0.35	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.11/0.35	# 2 start rule tableaux created.
0.11/0.35	# 17 extension rule candidate clauses
0.11/0.35	# 3 unit axiom clauses
0.11/0.35	
0.11/0.35	# Requested 8, 32 cores available to the main process.
0.11/0.35	# There are not enough tableaux to fork, creating more from the initial 2
0.11/0.35	# Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
0.11/0.35	# We now have 11 tableaux to operate on
17.59/2.57	# There were 2 total branch saturation attempts.
17.59/2.57	# There were 0 of these attempts blocked.
17.59/2.57	# There were 0 deferred branch saturation attempts.
17.59/2.57	# There were 0 free duplicated saturations.
17.59/2.57	# There were 2 total successful branch saturations.
17.59/2.57	# There were 0 successful branch saturations in interreduction.
17.59/2.57	# There were 0 successful branch saturations on the branch.
17.59/2.57	# There were 2 successful branch saturations after the branch.
17.59/2.57	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
17.59/2.57	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
17.59/2.57	# Begin clausification derivation
17.59/2.57	
17.59/2.57	# End clausification derivation
17.59/2.57	# Begin listing active clauses obtained from FOF to CNF conversion
17.59/2.57	cnf(i_0_8, plain, (g(eh))).
17.59/2.57	cnf(i_0_18, plain, (h(eg))).
17.59/2.57	cnf(i_0_7, plain, (sum(f(X1),f(X2))=f(product(X1,X2)))).
17.59/2.57	cnf(i_0_3, negated_conjecture, (g(esk1_0)|f(eh)!=eg)).
17.59/2.57	cnf(i_0_4, negated_conjecture, (opp(f(esk1_0))!=f(inv(esk1_0))|f(eh)!=eg)).
17.59/2.57	cnf(i_0_6, plain, (g(inv(X1))|~g(X1))).
17.59/2.57	cnf(i_0_2, plain, (h(opp(X1))|~h(X2))).
17.59/2.57	cnf(i_0_5, plain, (h(f(X1))|~g(X1))).
17.59/2.57	cnf(i_0_13, plain, (sum(X1,eg)=X1|~h(X1))).
17.59/2.57	cnf(i_0_16, plain, (sum(eg,X1)=X1|~h(X1))).
17.59/2.57	cnf(i_0_20, plain, (product(X1,eh)=X1|~g(X1))).
17.59/2.57	cnf(i_0_1, plain, (product(eh,X1)=X1|~g(X1))).
17.59/2.57	cnf(i_0_17, plain, (product(X1,inv(X1))=eh|~g(X1))).
17.59/2.57	cnf(i_0_19, plain, (product(inv(X1),X1)=eh|~g(X1))).
17.59/2.57	cnf(i_0_9, plain, (sum(X1,opp(X1))=eg|~h(X1))).
17.59/2.57	cnf(i_0_10, plain, (sum(opp(X1),X1)=eg|~h(X1))).
17.59/2.57	cnf(i_0_14, plain, (g(product(X1,X2))|~g(X1)|~g(X2))).
17.59/2.57	cnf(i_0_11, plain, (h(sum(X1,X2))|~h(X1)|~h(X2))).
17.59/2.57	cnf(i_0_15, plain, (product(product(X1,X2),X3)=product(X1,product(X2,X3))|~g(X3)|~g(X2)|~g(X1))).
17.59/2.57	cnf(i_0_12, plain, (sum(sum(X1,X2),X3)=sum(X1,sum(X2,X3))|~h(X1)|~h(X2)|~h(X3))).
17.59/2.57	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
17.59/2.57	# Begin printing tableau
17.59/2.57	# Found 5 steps
17.59/2.57	cnf(i_0_3, negated_conjecture, (g(esk1_0)|f(eh)!=eg), inference(start_rule)).
17.59/2.57	cnf(i_0_23, plain, (g(esk1_0)), inference(extension_rule, [i_0_6])).
17.59/2.57	cnf(i_0_105, plain, (g(inv(esk1_0))), inference(extension_rule, [i_0_6])).
17.59/2.57	cnf(i_0_24, plain, (f(eh)!=eg), inference(etableau_closure_rule, [i_0_24, ...])).
17.59/2.57	cnf(i_0_185, plain, (g(inv(inv(esk1_0)))), inference(etableau_closure_rule, [i_0_185, ...])).
17.59/2.57	# End printing tableau
17.59/2.57	# SZS output end
17.59/2.57	# Branches closed with saturation will be marked with an "s"
17.59/2.58	# Child (22109) has found a proof.
17.59/2.58	
17.59/2.58	# Proof search is over...
17.59/2.58	# Freeing feature tree
17.59/2.60	EOF