0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/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   : n027.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 15:59:25 EDT 2021
0.13/0.34	% CPUTime    : 
0.19/0.37	# No SInE strategy applied
0.19/0.37	# Auto-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S
0.19/0.37	# and selection function SelectNewComplexAHPNS.
0.19/0.37	#
0.19/0.37	# Presaturation interreduction done
0.19/0.37	# Number of axioms: 25 Number of unprocessed: 25
0.19/0.37	# Tableaux proof search.
0.19/0.37	# APR header successfully linked.
0.19/0.37	# Hello from C++
0.19/0.37	# The folding up rule is enabled...
0.19/0.37	# Local unification is enabled...
0.19/0.37	# Any saturation attempts will use folding labels...
0.19/0.37	# 25 beginning clauses after preprocessing and clausification
0.19/0.37	# Creating start rules for all 3 conjectures.
0.19/0.37	# There are 3 start rule candidates:
0.19/0.37	# Found 13 unit axioms.
0.19/0.37	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.19/0.37	# 3 start rule tableaux created.
0.19/0.37	# 12 extension rule candidate clauses
0.19/0.37	# 13 unit axiom clauses
0.19/0.37	
0.19/0.37	# Requested 8, 32 cores available to the main process.
0.19/0.37	# There are not enough tableaux to fork, creating more from the initial 3
0.19/0.37	# Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
0.19/0.37	# We now have 8 tableaux to operate on
0.19/0.49	# There were 2 total branch saturation attempts.
0.19/0.49	# There were 0 of these attempts blocked.
0.19/0.49	# There were 0 deferred branch saturation attempts.
0.19/0.49	# There were 0 free duplicated saturations.
0.19/0.49	# There were 2 total successful branch saturations.
0.19/0.49	# There were 0 successful branch saturations in interreduction.
0.19/0.49	# There were 0 successful branch saturations on the branch.
0.19/0.49	# There were 2 successful branch saturations after the branch.
0.19/0.49	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.49	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.49	# Begin clausification derivation
0.19/0.49	
0.19/0.49	# End clausification derivation
0.19/0.49	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.49	cnf(i_0_25, negated_conjecture, (test(esk2_0))).
0.19/0.49	cnf(i_0_24, negated_conjecture, (test(esk3_0))).
0.19/0.49	cnf(i_0_1, plain, (multiplication(X1,one)=X1)).
0.19/0.49	cnf(i_0_4, plain, (multiplication(one,X1)=X1)).
0.19/0.49	cnf(i_0_13, plain, (addition(X1,X1)=X1)).
0.19/0.49	cnf(i_0_12, plain, (multiplication(zero,X1)=zero)).
0.19/0.49	cnf(i_0_6, plain, (multiplication(X1,zero)=zero)).
0.19/0.49	cnf(i_0_5, plain, (addition(X1,zero)=X1)).
0.19/0.49	cnf(i_0_11, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
0.19/0.49	cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
0.19/0.49	cnf(i_0_3, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))).
0.19/0.49	cnf(i_0_7, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))).
0.19/0.49	cnf(i_0_10, plain, (addition(X1,X2)=addition(X2,X1))).
0.19/0.49	cnf(i_0_14, plain, (c(X1)=zero|test(X1))).
0.19/0.49	cnf(i_0_8, plain, (addition(X1,X2)=X2|~leq(X1,X2))).
0.19/0.49	cnf(i_0_9, plain, (leq(X1,X2)|addition(X1,X2)!=X2)).
0.19/0.49	cnf(i_0_17, plain, (addition(X1,X2)=one|~complement(X2,X1))).
0.19/0.49	cnf(i_0_20, plain, (test(X1)|~complement(X2,X1))).
0.19/0.49	cnf(i_0_18, plain, (multiplication(X1,X2)=zero|~complement(X2,X1))).
0.19/0.49	cnf(i_0_19, plain, (complement(esk1_1(X1),X1)|~test(X1))).
0.19/0.49	cnf(i_0_16, plain, (multiplication(X1,X2)=zero|~complement(X1,X2))).
0.19/0.49	cnf(i_0_21, plain, (c(X1)=X2|~complement(X1,X2)|~test(X1))).
0.19/0.49	cnf(i_0_15, plain, (complement(X1,X2)|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero|addition(X2,X1)!=one)).
0.19/0.49	cnf(i_0_22, plain, (complement(X1,c(X1))|~test(X1))).
0.19/0.49	cnf(i_0_23, negated_conjecture, (~leq(one,addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(esk2_0,esk3_0),multiplication(addition(esk3_0,c(esk3_0)),esk2_0)))))|~leq(addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(esk2_0,esk3_0),multiplication(addition(esk3_0,c(esk3_0)),esk2_0)))),one))).
0.19/0.49	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.49	# Begin printing tableau
0.19/0.49	# Found 7 steps
0.19/0.49	cnf(i_0_24, negated_conjecture, (test(esk3_0)), inference(start_rule)).
0.19/0.49	cnf(i_0_29, plain, (test(esk3_0)), inference(extension_rule, [i_0_21])).
0.19/0.49	cnf(i_0_102, plain, (~complement(esk3_0,zero)), inference(extension_rule, [i_0_15])).
0.19/0.49	cnf(i_0_190, plain, (multiplication(esk3_0,zero)!=zero), inference(closure_rule, [i_0_6])).
0.19/0.49	cnf(i_0_191, plain, (multiplication(zero,esk3_0)!=zero), inference(closure_rule, [i_0_12])).
0.19/0.49	cnf(i_0_101, plain, (c(esk3_0)=zero), inference(etableau_closure_rule, [i_0_101, ...])).
0.19/0.49	cnf(i_0_192, plain, (addition(zero,esk3_0)!=one), inference(etableau_closure_rule, [i_0_192, ...])).
0.19/0.49	# End printing tableau
0.19/0.49	# SZS output end
0.19/0.49	# Branches closed with saturation will be marked with an "s"
0.19/0.49	# Child (15683) has found a proof.
0.19/0.49	
0.19/0.49	# Proof search is over...
0.19/0.49	# Freeing feature tree
0.19/0.49	EOF