0.08/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.14	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.14/0.35	% Computer   : n011.cluster.edu
0.14/0.35	% Model      : x86_64 x86_64
0.14/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory     : 8042.1875MB
0.14/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 1200
0.14/0.35	% WCLimit    : 120
0.14/0.35	% DateTime   : Tue Jul 13 17:01:25 EDT 2021
0.14/0.35	% CPUTime    : 
0.14/0.38	# No SInE strategy applied
0.14/0.38	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.14/0.38	# and selection function SelectComplexExceptUniqMaxHorn.
0.14/0.38	#
0.14/0.38	# Presaturation interreduction done
0.14/0.38	# Number of axioms: 11 Number of unprocessed: 11
0.14/0.38	# Tableaux proof search.
0.14/0.38	# APR header successfully linked.
0.14/0.38	# Hello from C++
0.14/0.38	# The folding up rule is enabled...
0.14/0.38	# Local unification is enabled...
0.14/0.38	# Any saturation attempts will use folding labels...
0.14/0.38	# 11 beginning clauses after preprocessing and clausification
0.14/0.38	# Creating start rules for all 2 conjectures.
0.14/0.38	# There are 2 start rule candidates:
0.14/0.38	# Found 6 unit axioms.
0.14/0.38	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.14/0.38	# 2 start rule tableaux created.
0.14/0.38	# 5 extension rule candidate clauses
0.14/0.38	# 6 unit axiom clauses
0.14/0.38	
0.14/0.38	# Requested 8, 32 cores available to the main process.
0.14/0.38	# There are not enough tableaux to fork, creating more from the initial 2
0.14/0.38	# Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
0.14/0.38	# We now have 11 tableaux to operate on
0.14/0.39	# There were 2 total branch saturation attempts.
0.14/0.39	# There were 0 of these attempts blocked.
0.14/0.39	# There were 0 deferred branch saturation attempts.
0.14/0.39	# There were 0 free duplicated saturations.
0.14/0.39	# There were 2 total successful branch saturations.
0.14/0.39	# There were 0 successful branch saturations in interreduction.
0.14/0.39	# There were 0 successful branch saturations on the branch.
0.14/0.39	# There were 2 successful branch saturations after the branch.
0.14/0.39	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.14/0.39	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.14/0.39	# Begin clausification derivation
0.14/0.39	
0.14/0.39	# End clausification derivation
0.14/0.39	# Begin listing active clauses obtained from FOF to CNF conversion
0.14/0.39	cnf(i_0_9, plain, (empty(esk5_0))).
0.14/0.39	cnf(i_0_3, plain, (subset(X1,X1))).
0.14/0.39	cnf(i_0_5, negated_conjecture, (unordered_pair(unordered_pair(esk1_0,esk1_0),unordered_pair(esk1_0,esk2_0))=unordered_pair(unordered_pair(esk3_0,esk3_0),unordered_pair(esk3_0,esk4_0)))).
0.14/0.39	cnf(i_0_8, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
0.14/0.39	cnf(i_0_13, plain, (~empty(esk6_0))).
0.14/0.39	cnf(i_0_11, plain, (~empty(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))))).
0.14/0.39	cnf(i_0_4, negated_conjecture, (esk1_0!=esk3_0|esk2_0!=esk4_0)).
0.14/0.39	cnf(i_0_7, plain, (X1=X2|unordered_pair(X3,X3)!=unordered_pair(X1,X2))).
0.14/0.39	cnf(i_0_2, plain, (X1=X2|unordered_pair(X1,X1)!=unordered_pair(X2,X3))).
0.14/0.39	cnf(i_0_1, plain, (X1=X2|~subset(unordered_pair(X1,X1),unordered_pair(X2,X2)))).
0.14/0.39	cnf(i_0_12, plain, (X1=X2|X1=X3|unordered_pair(X1,X4)!=unordered_pair(X2,X3))).
0.14/0.39	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.14/0.39	# Begin printing tableau
0.14/0.39	# Found 5 steps
0.14/0.39	cnf(i_0_5, negated_conjecture, (unordered_pair(unordered_pair(esk1_0,esk1_0),unordered_pair(esk1_0,esk2_0))=unordered_pair(unordered_pair(esk3_0,esk3_0),unordered_pair(esk3_0,esk4_0))), inference(start_rule)).
0.14/0.39	cnf(i_0_16, plain, (unordered_pair(unordered_pair(esk1_0,esk1_0),unordered_pair(esk1_0,esk2_0))=unordered_pair(unordered_pair(esk3_0,esk3_0),unordered_pair(esk3_0,esk4_0))), inference(extension_rule, [i_0_12])).
0.14/0.39	cnf(i_0_45, plain, (unordered_pair(esk1_0,esk1_0)=unordered_pair(esk3_0,esk3_0)), inference(extension_rule, [i_0_7])).
0.14/0.39	cnf(i_0_46, plain, (unordered_pair(esk1_0,esk1_0)=unordered_pair(esk3_0,esk4_0)), inference(etableau_closure_rule, [i_0_46, ...])).
0.14/0.39	cnf(i_0_48, plain, (esk3_0=esk3_0), inference(etableau_closure_rule, [i_0_48, ...])).
0.14/0.39	# End printing tableau
0.14/0.39	# SZS output end
0.14/0.39	# Branches closed with saturation will be marked with an "s"
0.14/0.39	# Child (28868) has found a proof.
0.14/0.39	
0.14/0.39	# Proof search is over...
0.14/0.39	# Freeing feature tree
0.14/0.39	EOF