0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.12/0.35	% Computer   : n005.cluster.edu
0.12/0.35	% Model      : x86_64 x86_64
0.12/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.35	% Memory     : 8042.1875MB
0.12/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.35	% CPULimit   : 1200
0.12/0.35	% WCLimit    : 120
0.12/0.35	% DateTime   : Tue Jul 13 12:30:48 EDT 2021
0.12/0.35	% CPUTime    : 
0.19/0.38	# No SInE strategy applied
0.19/0.38	# Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y
0.19/0.38	# and selection function SelectMaxLComplexAvoidPosPred.
0.19/0.38	#
0.19/0.38	# Presaturation interreduction done
0.19/0.38	# Number of axioms: 22 Number of unprocessed: 22
0.19/0.38	# Tableaux proof search.
0.19/0.38	# APR header successfully linked.
0.19/0.38	# Hello from C++
0.19/0.38	# The folding up rule is enabled...
0.19/0.38	# Local unification is enabled...
0.19/0.38	# Any saturation attempts will use folding labels...
0.19/0.38	# 22 beginning clauses after preprocessing and clausification
0.19/0.38	# Creating start rules for all 1 conjectures.
0.19/0.38	# There are 1 start rule candidates:
0.19/0.38	# Found 22 unit axioms.
0.19/0.38	# 1 start rule tableaux created.
0.19/0.38	# 0 extension rule candidate clauses
0.19/0.38	# 22 unit axiom clauses
0.19/0.38	
0.19/0.38	# Requested 8, 32 cores available to the main process.
0.19/0.38	# There are not enough tableaux to fork, creating more from the initial 1
0.19/0.38	# Creating equality axioms
0.19/0.38	# Ran out of tableaux, making start rules for all clauses
0.19/0.38	# Returning from population with 40 new_tableaux and 0 remaining starting tableaux.
0.19/0.38	# We now have 40 tableaux to operate on
7.08/1.29	# There were 1 total branch saturation attempts.
7.08/1.29	# There were 0 of these attempts blocked.
7.08/1.29	# There were 0 deferred branch saturation attempts.
7.08/1.29	# There were 0 free duplicated saturations.
7.08/1.29	# There were 1 total successful branch saturations.
7.08/1.29	# There were 0 successful branch saturations in interreduction.
7.08/1.29	# There were 0 successful branch saturations on the branch.
7.08/1.29	# There were 1 successful branch saturations after the branch.
7.08/1.29	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
7.08/1.29	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
7.08/1.29	# Begin clausification derivation
7.08/1.29	
7.08/1.29	# End clausification derivation
7.08/1.29	# Begin listing active clauses obtained from FOF to CNF conversion
7.08/1.29	cnf(i_0_34, plain, (multiplication(X1,zero)=zero)).
7.08/1.29	cnf(i_0_40, plain, (multiplication(zero,X1)=zero)).
7.08/1.29	cnf(i_0_42, plain, (multiplication(X1,one)=X1)).
7.08/1.29	cnf(i_0_37, plain, (addition(X1,zero)=X1)).
7.08/1.29	cnf(i_0_47, plain, (multiplication(one,X1)=X1)).
7.08/1.29	cnf(i_0_28, plain, (addition(X1,X1)=X1)).
7.08/1.29	cnf(i_0_44, plain, (multiplication(antidomain(X1),X1)=zero)).
7.08/1.29	cnf(i_0_27, plain, (multiplication(X1,coantidomain(X1))=zero)).
7.08/1.29	cnf(i_0_41, plain, (addition(coantidomain(X1),coantidomain(coantidomain(X1)))=one)).
7.08/1.29	cnf(i_0_33, plain, (addition(antidomain(X1),antidomain(antidomain(X1)))=one)).
7.08/1.29	cnf(i_0_25, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
7.08/1.29	cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
7.08/1.29	cnf(i_0_36, plain, (ifeq(X1,X1,X2,X3)=X2)).
7.08/1.29	cnf(i_0_29, plain, (addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2)))))=antidomain(multiplication(X1,antidomain(antidomain(X2)))))).
7.08/1.29	cnf(i_0_32, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
7.08/1.29	cnf(i_0_38, plain, (ifeq2(addition(X1,X2),X2,leq(X1,X2),true)=true)).
7.08/1.29	cnf(i_0_43, plain, (ifeq(leq(X1,X2),true,addition(X1,X2),X2)=X2)).
7.08/1.29	cnf(i_0_31, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))).
7.08/1.29	cnf(i_0_35, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))).
7.08/1.29	cnf(i_0_45, plain, (addition(coantidomain(multiplication(X1,X2)),coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))=coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))).
7.08/1.29	cnf(i_0_30, plain, (addition(X1,X2)=addition(X2,X1))).
7.08/1.29	cnf(i_0_46, negated_conjecture, (antidomain(antidomain(multiplication(sK2_goals_X0,antidomain(antidomain(sK1_goals_X1)))))!=antidomain(antidomain(multiplication(sK2_goals_X0,sK1_goals_X1))))).
7.08/1.29	cnf(i_0_50, plain, (X4=X4)).
7.08/1.29	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
7.08/1.29	# Begin printing tableau
7.08/1.29	# Found 6 steps
7.08/1.29	cnf(i_0_34, plain, (multiplication(X7,zero)=zero), inference(start_rule)).
7.08/1.29	cnf(i_0_61, plain, (multiplication(X7,zero)=zero), inference(extension_rule, [i_0_60])).
7.08/1.29	cnf(i_0_112, plain, (multiplication(leq(zero,zero),zero)!=zero), inference(closure_rule, [i_0_34])).
7.08/1.29	cnf(i_0_111, plain, (leq(multiplication(leq(zero,zero),zero),multiplication(X7,zero))=leq(zero,zero)), inference(extension_rule, [i_0_53])).
7.08/1.29	cnf(i_0_120, plain, (leq(zero,zero)!=multiplication(leq(zero,zero),one)), inference(closure_rule, [i_0_42])).
7.08/1.29	cnf(i_0_118, plain, (leq(multiplication(leq(zero,zero),zero),multiplication(X7,zero))=multiplication(leq(zero,zero),one)), inference(etableau_closure_rule, [i_0_118, ...])).
7.08/1.29	# End printing tableau
7.08/1.29	# SZS output end
7.08/1.29	# Branches closed with saturation will be marked with an "s"
7.08/1.29	# Child (19756) has found a proof.
7.08/1.29	
7.08/1.29	# Proof search is over...
7.08/1.29	# Freeing feature tree
7.08/1.30	EOF