0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/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   : n006.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:10 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: 16 Number of unprocessed: 16
0.14/0.38	# Tableaux proof search.
0.14/0.38	# APR header successfully linked.
0.14/0.38	# Hello from C++
0.22/0.39	# The folding up rule is enabled...
0.22/0.39	# Local unification is enabled...
0.22/0.39	# Any saturation attempts will use folding labels...
0.22/0.39	# 16 beginning clauses after preprocessing and clausification
0.22/0.39	# Creating start rules for all 2 conjectures.
0.22/0.39	# There are 2 start rule candidates:
0.22/0.39	# Found 7 unit axioms.
0.22/0.39	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.22/0.39	# 2 start rule tableaux created.
0.22/0.39	# 9 extension rule candidate clauses
0.22/0.39	# 7 unit axiom clauses
0.22/0.39	
0.22/0.39	# Requested 8, 32 cores available to the main process.
0.22/0.39	# There are not enough tableaux to fork, creating more from the initial 2
0.22/0.39	# There were 1 total branch saturation attempts.
0.22/0.39	# There were 0 of these attempts blocked.
0.22/0.39	# There were 0 deferred branch saturation attempts.
0.22/0.39	# There were 0 free duplicated saturations.
0.22/0.39	# There were 1 total successful branch saturations.
0.22/0.39	# There were 0 successful branch saturations in interreduction.
0.22/0.39	# There were 0 successful branch saturations on the branch.
0.22/0.39	# There were 1 successful branch saturations after the branch.
0.22/0.39	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.22/0.39	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.22/0.39	# Begin clausification derivation
0.22/0.39	
0.22/0.39	# End clausification derivation
0.22/0.39	# Begin listing active clauses obtained from FOF to CNF conversion
0.22/0.39	cnf(i_0_9, plain, (empty(empty_set))).
0.22/0.39	cnf(i_0_2, plain, (empty(esk2_0))).
0.22/0.39	cnf(i_0_15, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
0.22/0.39	cnf(i_0_14, negated_conjecture, (esk4_0!=empty_set)).
0.22/0.39	cnf(i_0_1, plain, (~empty(esk1_0))).
0.22/0.39	cnf(i_0_11, plain, (~in(X1,empty_set))).
0.22/0.39	cnf(i_0_17, plain, (~empty(unordered_pair(singleton(X1),unordered_pair(X1,X2))))).
0.22/0.39	cnf(i_0_13, negated_conjecture, (cartesian_product2(singleton(esk5_0),esk4_0)=empty_set|cartesian_product2(esk4_0,singleton(esk5_0))=empty_set)).
0.22/0.39	cnf(i_0_12, plain, (X1=empty_set|in(esk3_1(X1),X1))).
0.22/0.39	cnf(i_0_16, plain, (~in(X1,X2)|~in(X2,X1))).
0.22/0.39	cnf(i_0_4, plain, (X1=X2|~in(unordered_pair(singleton(X3),unordered_pair(X3,X2)),cartesian_product2(X4,singleton(X1))))).
0.22/0.39	cnf(i_0_6, plain, (X1=X2|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(singleton(X2),X4)))).
0.22/0.39	cnf(i_0_5, plain, (in(X1,X2)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(X2,singleton(X4))))).
0.22/0.39	cnf(i_0_7, plain, (in(X1,X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(singleton(X4),X2)))).
0.22/0.39	cnf(i_0_3, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,singleton(X2)))|~in(X1,X3))).
0.22/0.39	cnf(i_0_8, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(singleton(X1),X3))|~in(X2,X3))).
0.22/0.39	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.22/0.39	# Begin printing tableau
0.22/0.39	# Found 4 steps
0.22/0.39	cnf(i_0_14, negated_conjecture, (esk4_0!=empty_set), inference(start_rule)).
0.22/0.39	cnf(i_0_23, plain, (esk4_0!=empty_set), inference(extension_rule, [i_0_6])).
0.22/0.39	cnf(i_0_67, plain, (~in(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,X12)),cartesian_product2(singleton(empty_set),X11))), inference(extension_rule, [i_0_5])).
0.22/0.39	cnf(i_0_87, plain, (~in(unordered_pair(singleton(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,X12))),unordered_pair(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,X12)),X9)),cartesian_product2(cartesian_product2(singleton(empty_set),X11),singleton(X10)))), inference(etableau_closure_rule, [i_0_87, ...])).
0.22/0.39	# End printing tableau
0.22/0.39	# SZS output end
0.22/0.39	# Branches closed with saturation will be marked with an "s"
0.22/0.39	# Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
0.22/0.39	# We now have 3 tableaux to operate on
0.22/0.39	# Found closed tableau during pool population.
0.22/0.39	# Proof search is over...
0.22/0.39	# Freeing feature tree
0.22/0.39	EOF