0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/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   : n010.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 13:53:21 EDT 2021
0.13/0.34	% CPUTime    : 
0.13/0.37	# No SInE strategy applied
0.13/0.37	# Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y
0.13/0.37	# and selection function SelectMaxLComplexAvoidPosPred.
0.13/0.37	#
0.13/0.37	# Presaturation interreduction done
0.13/0.37	# Number of axioms: 21 Number of unprocessed: 21
0.13/0.37	# Tableaux proof search.
0.13/0.37	# APR header successfully linked.
0.13/0.37	# 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	# 21 beginning clauses after preprocessing and clausification
0.13/0.38	# Creating start rules for all 1 conjectures.
0.13/0.38	# There are 1 start rule candidates:
0.13/0.38	# Found 21 unit axioms.
0.13/0.38	# 1 start rule tableaux created.
0.13/0.38	# 0 extension rule candidate clauses
0.13/0.38	# 21 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 1
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 43 new_tableaux and 0 remaining starting tableaux.
0.13/0.38	# We now have 43 tableaux to operate on
2.14/0.64	# There were 1 total branch saturation attempts.
2.14/0.64	# There were 0 of these attempts blocked.
2.14/0.64	# There were 0 deferred branch saturation attempts.
2.14/0.64	# There were 0 free duplicated saturations.
2.14/0.64	# There were 1 total successful branch saturations.
2.14/0.64	# There were 0 successful branch saturations in interreduction.
2.14/0.64	# There were 0 successful branch saturations on the branch.
2.14/0.64	# There were 1 successful branch saturations after the branch.
2.14/0.64	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
2.14/0.64	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
2.14/0.64	# Begin clausification derivation
2.14/0.64	
2.14/0.64	# End clausification derivation
2.14/0.64	# Begin listing active clauses obtained from FOF to CNF conversion
2.14/0.64	cnf(i_0_25, plain, (addition(X1,zero)=X1)).
2.14/0.64	cnf(i_0_27, plain, (multiplication(zero,X1)=zero)).
2.14/0.64	cnf(i_0_35, plain, (multiplication(X1,zero)=zero)).
2.14/0.64	cnf(i_0_31, plain, (multiplication(one,X1)=X1)).
2.14/0.64	cnf(i_0_23, plain, (multiplication(X1,one)=X1)).
2.14/0.64	cnf(i_0_38, plain, (addition(X1,X1)=X1)).
2.14/0.64	cnf(i_0_32, plain, (ifeq2(X1,X1,X2,X3)=X2)).
2.14/0.64	cnf(i_0_40, plain, (ifeq(X1,X1,X2,X3)=X2)).
2.14/0.64	cnf(i_0_28, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
2.14/0.64	cnf(i_0_41, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
2.14/0.64	cnf(i_0_37, plain, (ifeq3(X1,X1,X2,X3)=X2)).
2.14/0.64	cnf(i_0_30, plain, (leq(addition(one,multiplication(X1,star(X1))),star(X1))=true)).
2.14/0.64	cnf(i_0_22, plain, (leq(addition(one,multiplication(star(X1),X1)),star(X1))=true)).
2.14/0.64	cnf(i_0_39, plain, (ifeq3(addition(X1,X2),X2,leq(X1,X2),true)=true)).
2.14/0.64	cnf(i_0_34, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))).
2.14/0.64	cnf(i_0_24, plain, (ifeq2(leq(X1,X2),true,addition(X1,X2),X2)=X2)).
2.14/0.64	cnf(i_0_33, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))).
2.14/0.64	cnf(i_0_29, plain, (ifeq(leq(addition(multiplication(X1,X2),X3),X2),true,leq(multiplication(star(X1),X3),X2),true)=true)).
2.14/0.64	cnf(i_0_26, plain, (ifeq(leq(addition(multiplication(X1,X2),X3),X1),true,leq(multiplication(X3,star(X2)),X1),true)=true)).
2.14/0.64	cnf(i_0_36, plain, (addition(X1,X2)=addition(X2,X1))).
2.14/0.64	cnf(i_0_42, negated_conjecture, (tuple(leq(star(addition(one,sK2_goals_X0)),star(sK2_goals_X0)),leq(star(sK1_goals_X0),star(addition(one,sK1_goals_X0))))!=tuple(true,true))).
2.14/0.64	cnf(i_0_44, plain, (X4=X4)).
2.14/0.64	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
2.14/0.64	# Begin printing tableau
2.14/0.64	# Found 8 steps
2.14/0.64	cnf(i_0_25, plain, (addition(X7,zero)=X7), inference(start_rule)).
2.14/0.64	cnf(i_0_56, plain, (addition(X7,zero)=X7), inference(extension_rule, [i_0_54])).
2.14/0.64	cnf(i_0_107, plain, (addition(X3,zero)!=X3), inference(closure_rule, [i_0_25])).
2.14/0.64	cnf(i_0_108, plain, (addition(X5,zero)!=X5), inference(closure_rule, [i_0_25])).
2.14/0.64	cnf(i_0_110, plain, (addition(X9,zero)!=X9), inference(closure_rule, [i_0_25])).
2.14/0.64	cnf(i_0_106, plain, (ifeq3(addition(X3,zero),addition(X5,zero),addition(X7,zero),addition(X9,zero))=ifeq3(X3,X5,X7,X9)), inference(extension_rule, [i_0_47])).
2.14/0.64	cnf(i_0_120, plain, (ifeq3(X3,X5,X7,X9)!=addition(ifeq3(X3,X5,X7,X9),zero)), inference(closure_rule, [i_0_25])).
2.14/0.64	cnf(i_0_118, plain, (ifeq3(addition(X3,zero),addition(X5,zero),addition(X7,zero),addition(X9,zero))=addition(ifeq3(X3,X5,X7,X9),zero)), inference(etableau_closure_rule, [i_0_118, ...])).
2.14/0.64	# End printing tableau
2.14/0.64	# SZS output end
2.14/0.64	# Branches closed with saturation will be marked with an "s"
2.14/0.64	# Child (6380) has found a proof.
2.14/0.64	
2.14/0.64	# Proof search is over...
2.14/0.64	# Freeing feature tree
2.14/0.64	EOF