0.08/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/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.35	Computer   : n004.cluster.edu
0.13/0.35	Model      : x86_64 x86_64
0.13/0.35	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	RAMPerCPU  : 8042.1875MB
0.13/0.35	OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 960
0.13/0.35	% WCLimit    : 120
0.13/0.35	% DateTime   : Tue Aug  9 03:27:20 EDT 2022
0.13/0.35	% CPUTime    : 
0.13/0.38	# No SInE strategy applied
0.13/0.38	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.13/0.38	# and selection function SelectComplexExceptUniqMaxHorn.
0.13/0.38	#
0.13/0.38	# Presaturation interreduction done
0.13/0.38	# Number of axioms: 11 Number of unprocessed: 11
0.13/0.38	# Tableaux proof search.
0.13/0.38	# APR header successfully linked.
0.13/0.38	# Hello from C++
0.13/0.38	# The folding up rule is enabled...
0.13/0.38	# Local unification is enabled...
0.13/0.38	# Any saturation attempts will use folding labels...
0.13/0.38	# 11 beginning clauses after preprocessing and clausification
0.13/0.38	# Creating start rules for all 3 conjectures.
0.13/0.38	# There are 3 start rule candidates:
0.13/0.38	# Found 8 unit axioms.
0.13/0.38	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.13/0.38	# 3 start rule tableaux created.
0.13/0.38	# 3 extension rule candidate clauses
0.13/0.38	# 8 unit axiom clauses
0.13/0.38	
0.13/0.38	# Requested 8, 32 cores available to the main process.
0.13/0.38	# There are not enough tableaux to fork, creating more from the initial 3
0.13/0.38	# Creating equality axioms
0.13/0.38	# Ran out of tableaux, making start rules for all clauses
0.13/0.38	# Returning from population with 17 new_tableaux and 0 remaining starting tableaux.
0.13/0.38	# We now have 17 tableaux to operate on
240.02/30.48	# There were 2 total branch saturation attempts.
240.02/30.48	# There were 0 of these attempts blocked.
240.02/30.48	# There were 0 deferred branch saturation attempts.
240.02/30.48	# There were 0 free duplicated saturations.
240.02/30.48	# There were 1 total successful branch saturations.
240.02/30.48	# There were 0 successful branch saturations in interreduction.
240.02/30.48	# There were 0 successful branch saturations on the branch.
240.02/30.48	# There were 1 successful branch saturations after the branch.
240.02/30.48	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
240.02/30.48	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
240.02/30.48	# Begin clausification derivation
240.02/30.48	
240.02/30.48	# End clausification derivation
240.02/30.48	# Begin listing active clauses obtained from FOF to CNF conversion
240.02/30.48	cnf(i_0_1, plain, ('==>'(X1,'0')='0')).
240.02/30.48	cnf(i_0_6, plain, ('==>'('0',X1)=X1)).
240.02/30.48	cnf(i_0_5, plain, ('+'(X1,'0')=X1)).
240.02/30.48	cnf(i_0_8, plain, ('==>'(X1,X1)='0')).
240.02/30.48	cnf(i_0_11, plain, ('==>'('+'(X1,X2),X3)='==>'(X1,'==>'(X2,X3)))).
240.02/30.48	cnf(i_0_10, plain, ('+'('+'(X1,X2),X3)='+'(X1,'+'(X2,X3)))).
240.02/30.48	cnf(i_0_7, plain, ('+'(X1,X2)='+'(X2,X1))).
240.02/30.48	cnf(i_0_9, plain, ('+'(X1,'==>'(X1,X2))='+'(X2,'==>'(X2,X1)))).
240.02/30.48	cnf(i_0_4, negated_conjecture, ('==>'(c,'+'(a,'==>'(a,b)))!='0'|'==>'(c,a)!='0'|'==>'(c,b)!='0')).
240.02/30.48	cnf(i_0_2, negated_conjecture, ('==>'(c,'+'(a,'==>'(a,b)))='0'|'==>'(c,a)='0')).
240.02/30.48	cnf(i_0_3, negated_conjecture, ('==>'(c,'+'(a,'==>'(a,b)))='0'|'==>'(c,b)='0')).
240.02/30.48	cnf(i_0_68, plain, (X18=X18)).
240.02/30.48	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
240.02/30.48	# Begin printing tableau
240.02/30.48	# Found 8 steps
240.02/30.48	cnf(i_0_1, plain, ('==>'(X6,'0')='0'), inference(start_rule)).
240.02/30.48	cnf(i_0_74, plain, ('==>'(X6,'0')='0'), inference(extension_rule, [i_0_73])).
240.02/30.48	cnf(i_0_109, plain, ('==>'('+'('0','0'),'0')!='0'), inference(closure_rule, [i_0_1])).
240.02/30.48	cnf(i_0_107, plain, ('+'('==>'(X6,'0'),'==>'('+'('0','0'),'0'))='+'('0','0')), inference(extension_rule, [i_0_71])).
240.02/30.48	cnf(i_0_123, plain, ('==>'('0','+'('0','0'))!='+'('0','0')), inference(closure_rule, [i_0_6])).
240.02/30.48	cnf(i_0_121, plain, ('+'('==>'(X6,'0'),'==>'('+'('0','0'),'0'))='==>'('0','+'('0','0'))), inference(extension_rule, [i_0_72])).
240.02/30.48	cnf(i_0_1069351, plain, ('==>'(X1,'0')!='0'), inference(closure_rule, [i_0_1])).
240.02/30.48	cnf(i_0_1069349, plain, ('==>'('+'('==>'(X6,'0'),'==>'('+'('0','0'),'0')),'==>'(X1,'0'))='==>'('==>'('0','+'('0','0')),'0')), inference(etableau_closure_rule, [i_0_1069349, ...])).
240.02/30.48	# End printing tableau
240.02/30.48	# SZS output end
240.02/30.48	# Branches closed with saturation will be marked with an "s"
240.65/30.58	# Child (16695) has found a proof.
240.65/30.58	
240.65/30.58	# Proof search is over...
240.65/30.58	# Freeing feature tree
240.65/30.82	EOF