0.00/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.10	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.09/0.31	% Computer   : n002.cluster.edu
0.09/0.31	% Model      : x86_64 x86_64
0.09/0.31	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.31	% Memory     : 8042.1875MB
0.09/0.31	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.31	% CPULimit   : 1200
0.09/0.31	% WCLimit    : 120
0.09/0.31	% DateTime   : Tue Jul 13 16:19:48 EDT 2021
0.09/0.31	% CPUTime    : 
0.16/0.33	# No SInE strategy applied
0.16/0.33	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.16/0.33	# and selection function SelectComplexExceptUniqMaxHorn.
0.16/0.33	#
0.16/0.33	# Presaturation interreduction done
0.16/0.33	# Number of axioms: 11 Number of unprocessed: 11
0.16/0.33	# Tableaux proof search.
0.16/0.33	# APR header successfully linked.
0.16/0.33	# Hello from C++
0.16/0.33	# The folding up rule is enabled...
0.16/0.33	# Local unification is enabled...
0.16/0.33	# Any saturation attempts will use folding labels...
0.16/0.33	# 11 beginning clauses after preprocessing and clausification
0.16/0.33	# Creating start rules for all 3 conjectures.
0.16/0.33	# There are 3 start rule candidates:
0.16/0.33	# Found 8 unit axioms.
0.16/0.33	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.16/0.33	# 3 start rule tableaux created.
0.16/0.33	# 3 extension rule candidate clauses
0.16/0.33	# 8 unit axiom clauses
0.16/0.33	
0.16/0.33	# Requested 8, 32 cores available to the main process.
0.16/0.33	# There are not enough tableaux to fork, creating more from the initial 3
0.16/0.33	# Creating equality axioms
0.16/0.33	# Ran out of tableaux, making start rules for all clauses
0.16/0.33	# Returning from population with 17 new_tableaux and 0 remaining starting tableaux.
0.16/0.33	# We now have 17 tableaux to operate on
298.62/37.98	# There were 2 total branch saturation attempts.
298.62/37.98	# There were 0 of these attempts blocked.
298.62/37.98	# There were 0 deferred branch saturation attempts.
298.62/37.98	# There were 0 free duplicated saturations.
298.62/37.98	# There were 1 total successful branch saturations.
298.62/37.98	# There were 0 successful branch saturations in interreduction.
298.62/37.98	# There were 0 successful branch saturations on the branch.
298.62/37.98	# There were 1 successful branch saturations after the branch.
298.62/37.98	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
298.62/37.98	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
298.62/37.98	# Begin clausification derivation
298.62/37.98	
298.62/37.98	# End clausification derivation
298.62/37.98	# Begin listing active clauses obtained from FOF to CNF conversion
298.62/37.98	cnf(i_0_5, plain, ('==>'(X1,'0')='0')).
298.62/37.98	cnf(i_0_6, plain, ('==>'('0',X1)=X1)).
298.62/37.98	cnf(i_0_4, plain, ('+'(X1,'0')=X1)).
298.62/37.98	cnf(i_0_11, plain, ('==>'(X1,X1)='0')).
298.62/37.98	cnf(i_0_3, plain, ('+'('+'(X1,X2),X3)='+'(X1,'+'(X2,X3)))).
298.62/37.98	cnf(i_0_1, plain, ('==>'('+'(X1,X2),X3)='==>'(X1,'==>'(X2,X3)))).
298.62/37.98	cnf(i_0_7, plain, ('+'(X1,X2)='+'(X2,X1))).
298.62/37.98	cnf(i_0_2, plain, ('+'(X1,'==>'(X1,X2))='+'(X2,'==>'(X2,X1)))).
298.62/37.98	cnf(i_0_10, negated_conjecture, ('==>'(c,'+'(a,'==>'(a,b)))!='0'|'==>'(c,b)!='0'|'==>'(c,a)!='0')).
298.62/37.98	cnf(i_0_9, negated_conjecture, ('==>'(c,'+'(a,'==>'(a,b)))='0'|'==>'(c,b)='0')).
298.62/37.98	cnf(i_0_8, negated_conjecture, ('==>'(c,'+'(a,'==>'(a,b)))='0'|'==>'(c,a)='0')).
298.62/37.98	cnf(i_0_68, plain, (X18=X18)).
298.62/37.98	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
298.62/37.98	# Begin printing tableau
298.62/37.98	# Found 8 steps
298.62/37.98	cnf(i_0_5, plain, ('==>'(X7,'0')='0'), inference(start_rule)).
298.62/37.98	cnf(i_0_74, plain, ('==>'(X7,'0')='0'), inference(extension_rule, [i_0_73])).
298.62/37.98	cnf(i_0_108, plain, ('==>'('0','0')!='0'), inference(closure_rule, [i_0_5])).
298.62/37.98	cnf(i_0_107, plain, ('==>'('==>'('0','0'),'==>'(X7,'0'))='==>'('0','0')), inference(extension_rule, [i_0_71])).
298.62/37.98	cnf(i_0_123, plain, ('==>'('0','0')!='0'), inference(closure_rule, [i_0_5])).
298.62/37.98	cnf(i_0_121, plain, ('==>'('==>'('0','0'),'==>'(X7,'0'))='0'), inference(extension_rule, [i_0_72])).
298.62/37.98	cnf(i_0_1180687, plain, ('==>'(X1,'0')!='0'), inference(closure_rule, [i_0_5])).
298.62/37.98	cnf(i_0_1180685, plain, ('+'('==>'('==>'('0','0'),'==>'(X7,'0')),'==>'(X1,'0'))='+'('0','0')), inference(etableau_closure_rule, [i_0_1180685, ...])).
298.62/37.98	# End printing tableau
298.62/37.98	# SZS output end
298.62/37.98	# Branches closed with saturation will be marked with an "s"
299.57/38.12	# Child (4580) has found a proof.
299.57/38.12	
299.57/38.12	# Proof search is over...
299.57/38.12	# Freeing feature tree
299.57/38.38	EOF