0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.11	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.10/0.32	Computer   : n009.cluster.edu
0.10/0.32	Model      : x86_64 x86_64
0.10/0.32	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	RAMPerCPU  : 8042.1875MB
0.10/0.32	OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit   : 960
0.10/0.32	% WCLimit    : 120
0.10/0.32	% DateTime   : Tue Aug  9 02:07:35 EDT 2022
0.10/0.32	% CPUTime    : 
0.10/0.35	# No SInE strategy applied
0.10/0.35	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.10/0.35	# and selection function SelectComplexExceptUniqMaxHorn.
0.10/0.35	#
0.10/0.35	# Presaturation interreduction done
0.10/0.35	# Number of axioms: 12 Number of unprocessed: 12
0.10/0.35	# Tableaux proof search.
0.10/0.35	# APR header successfully linked.
0.10/0.35	# Hello from C++
0.10/0.35	# The folding up rule is enabled...
0.10/0.35	# Local unification is enabled...
0.10/0.35	# Any saturation attempts will use folding labels...
0.10/0.35	# 12 beginning clauses after preprocessing and clausification
0.10/0.35	# Creating start rules for all 6 conjectures.
0.10/0.35	# There are 6 start rule candidates:
0.10/0.35	# Found 1 unit axioms.
0.10/0.35	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.10/0.35	# 6 start rule tableaux created.
0.10/0.35	# 11 extension rule candidate clauses
0.10/0.35	# 1 unit axiom clauses
0.10/0.35	
0.10/0.35	# Requested 8, 32 cores available to the main process.
0.10/0.35	# There are not enough tableaux to fork, creating more from the initial 6
0.10/0.35	# Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
0.10/0.35	# We now have 11 tableaux to operate on
0.10/0.35	# There were 1 total branch saturation attempts.
0.10/0.35	# There were 0 of these attempts blocked.
0.10/0.35	# There were 0 deferred branch saturation attempts.
0.10/0.35	# There were 0 free duplicated saturations.
0.10/0.35	# There were 1 total successful branch saturations.
0.10/0.35	# There were 0 successful branch saturations in interreduction.
0.10/0.35	# There were 0 successful branch saturations on the branch.
0.10/0.35	# There were 1 successful branch saturations after the branch.
0.10/0.35	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.10/0.35	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.10/0.35	# Begin clausification derivation
0.10/0.35	
0.10/0.35	# End clausification derivation
0.10/0.35	# Begin listing active clauses obtained from FOF to CNF conversion
0.10/0.35	cnf(i_0_12, plain, (sorti2(esk2_0))).
0.10/0.35	cnf(i_0_5, negated_conjecture, (sorti1(j(X1))|~sorti2(X1))).
0.10/0.35	cnf(i_0_6, negated_conjecture, (sorti2(h(X1))|~sorti1(X1))).
0.10/0.35	cnf(i_0_2, negated_conjecture, (j(h(X1))=X1|~sorti1(X1))).
0.10/0.35	cnf(i_0_1, negated_conjecture, (h(j(X1))=X1|~sorti2(X1))).
0.10/0.35	cnf(i_0_10, plain, (sorti1(esk1_1(X1))|~sorti1(X1))).
0.10/0.35	cnf(i_0_11, plain, (op2(X1,X1)=esk2_0|~sorti2(X1))).
0.10/0.35	cnf(i_0_9, plain, (op1(esk1_1(X1),esk1_1(X1))!=X1|~sorti1(X1))).
0.10/0.35	cnf(i_0_7, plain, (sorti1(op1(X1,X2))|~sorti1(X2)|~sorti1(X1))).
0.10/0.35	cnf(i_0_8, plain, (sorti2(op2(X1,X2))|~sorti2(X2)|~sorti2(X1))).
0.10/0.35	cnf(i_0_4, negated_conjecture, (op2(h(X1),h(X2))=h(op1(X1,X2))|~sorti1(X2)|~sorti1(X1))).
0.10/0.35	cnf(i_0_3, negated_conjecture, (op1(j(X1),j(X2))=j(op2(X1,X2))|~sorti2(X2)|~sorti2(X1))).
0.10/0.35	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.10/0.35	# Begin printing tableau
0.10/0.35	# Found 5 steps
0.10/0.35	cnf(i_0_5, negated_conjecture, (sorti1(j(esk2_0))|~sorti2(esk2_0)), inference(start_rule)).
0.10/0.35	cnf(i_0_26, plain, (~sorti2(esk2_0)), inference(closure_rule, [i_0_12])).
0.10/0.35	cnf(i_0_25, plain, (sorti1(j(esk2_0))), inference(extension_rule, [i_0_10])).
0.10/0.35	cnf(i_0_209, plain, (sorti1(esk1_1(j(esk2_0)))), inference(extension_rule, [i_0_9])).
0.10/0.35	cnf(i_0_213, plain, (op1(esk1_1(esk1_1(j(esk2_0))),esk1_1(esk1_1(j(esk2_0))))!=esk1_1(j(esk2_0))), inference(etableau_closure_rule, [i_0_213, ...])).
0.10/0.35	# End printing tableau
0.10/0.35	# SZS output end
0.10/0.35	# Branches closed with saturation will be marked with an "s"
0.10/0.35	# Child (17717) has found a proof.
0.10/0.35	
0.10/0.35	# Proof search is over...
0.10/0.35	# Freeing feature tree
0.10/0.35	EOF