0.12/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/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   : n025.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 03:48:26 EDT 2022
0.12/0.33	% CPUTime    : 
0.12/0.36	# No SInE strategy applied
0.12/0.36	# Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.12/0.36	# and selection function SelectComplexExceptUniqMaxHorn.
0.12/0.36	#
0.12/0.36	# Presaturation interreduction done
0.12/0.36	# Number of axioms: 18 Number of unprocessed: 18
0.12/0.36	# Tableaux proof search.
0.12/0.36	# APR header successfully linked.
0.12/0.36	# Hello from C++
0.12/0.36	# The folding up rule is enabled...
0.12/0.36	# Local unification is enabled...
0.12/0.36	# Any saturation attempts will use folding labels...
0.12/0.36	# 18 beginning clauses after preprocessing and clausification
0.12/0.36	# Creating start rules for all 1 conjectures.
0.12/0.36	# There are 1 start rule candidates:
0.12/0.36	# Found 14 unit axioms.
0.12/0.36	# 1 start rule tableaux created.
0.12/0.36	# 4 extension rule candidate clauses
0.12/0.36	# 14 unit axiom clauses
0.12/0.36	
0.12/0.36	# Requested 8, 32 cores available to the main process.
0.12/0.36	# There are not enough tableaux to fork, creating more from the initial 1
0.12/0.36	# Creating equality axioms
0.12/0.36	# Ran out of tableaux, making start rules for all clauses
0.12/0.36	# Returning from population with 27 new_tableaux and 0 remaining starting tableaux.
0.12/0.36	# We now have 27 tableaux to operate on
19.42/2.89	# There were 1 total branch saturation attempts.
19.42/2.89	# There were 0 of these attempts blocked.
19.42/2.89	# There were 0 deferred branch saturation attempts.
19.42/2.89	# There were 0 free duplicated saturations.
19.42/2.89	# There were 1 total successful branch saturations.
19.42/2.89	# There were 0 successful branch saturations in interreduction.
19.42/2.89	# There were 0 successful branch saturations on the branch.
19.42/2.89	# There were 1 successful branch saturations after the branch.
19.42/2.89	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
19.42/2.89	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
19.42/2.89	# Begin clausification derivation
19.42/2.89	
19.42/2.89	# End clausification derivation
19.42/2.89	# Begin listing active clauses obtained from FOF to CNF conversion
19.42/2.89	cnf(i_0_8, plain, (multiplication(X1,zero)=zero)).
19.42/2.89	cnf(i_0_17, plain, (multiplication(zero,X1)=zero)).
19.42/2.89	cnf(i_0_11, plain, (multiplication(one,X1)=X1)).
19.42/2.89	cnf(i_0_15, plain, (multiplication(X1,one)=X1)).
19.42/2.89	cnf(i_0_13, plain, (addition(X1,zero)=X1)).
19.42/2.89	cnf(i_0_10, plain, (addition(X1,X1)=X1)).
19.42/2.89	cnf(i_0_6, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
19.42/2.89	cnf(i_0_14, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
19.42/2.89	cnf(i_0_3, plain, (leq(addition(one,multiplication(X1,star(X1))),star(X1)))).
19.42/2.89	cnf(i_0_16, plain, (leq(addition(one,multiplication(star(X1),X1)),star(X1)))).
19.42/2.89	cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))).
19.42/2.89	cnf(i_0_5, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))).
19.42/2.89	cnf(i_0_7, plain, (addition(X1,X2)=addition(X2,X1))).
19.42/2.89	cnf(i_0_18, negated_conjecture, (~leq(multiplication(a,a),star(a)))).
19.42/2.89	cnf(i_0_2, plain, (addition(X1,X2)=X2|~leq(X1,X2))).
19.42/2.89	cnf(i_0_1, plain, (leq(X1,X2)|addition(X1,X2)!=X2)).
19.42/2.89	cnf(i_0_12, plain, (leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3))).
19.42/2.89	cnf(i_0_4, plain, (leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3))).
19.42/2.89	cnf(i_0_36, plain, (X34=X34)).
19.42/2.89	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
19.42/2.89	# Begin printing tableau
19.42/2.89	# Found 7 steps
19.42/2.89	cnf(i_0_8, plain, (multiplication(X6,zero)=zero), inference(start_rule)).
19.42/2.89	cnf(i_0_44, plain, (multiplication(X6,zero)=zero), inference(extension_rule, [i_0_39])).
19.42/2.89	cnf(i_0_80, plain, (multiplication(X6,zero)!=zero), inference(closure_rule, [i_0_8])).
19.42/2.89	cnf(i_0_79, plain, (zero=zero), inference(extension_rule, [i_0_39])).
19.42/2.89	cnf(i_0_106, plain, (zero=addition(zero,zero)), inference(extension_rule, [i_0_1])).
19.42/2.89	cnf(i_0_108, plain, (addition(zero,zero)!=zero), inference(closure_rule, [i_0_13])).
19.42/2.89	cnf(i_0_111, plain, (leq(zero,zero)), inference(etableau_closure_rule, [i_0_111, ...])).
19.42/2.89	# End printing tableau
19.42/2.89	# SZS output end
19.42/2.89	# Branches closed with saturation will be marked with an "s"
19.42/2.90	# Child (16795) has found a proof.
19.42/2.90	
19.42/2.90	# Proof search is over...
19.42/2.90	# Freeing feature tree
19.42/2.92	EOF