0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% 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   : n018.cluster.edu
0.13/0.34	Model      : x86_64 x86_64
0.13/0.34	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	RAMPerCPU  : 8042.1875MB
0.13/0.34	OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 960
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Aug  9 02:41:15 EDT 2022
0.13/0.34	% CPUTime    : 
0.13/0.37	# No SInE strategy applied
0.13/0.37	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N
0.13/0.37	# and selection function SelectUnlessUniqMax.
0.13/0.37	#
0.13/0.37	# Presaturation interreduction done
0.13/0.37	# Number of axioms: 17 Number of unprocessed: 17
0.13/0.37	# Tableaux proof search.
0.13/0.37	# APR header successfully linked.
0.13/0.37	# Hello from C++
0.13/0.37	# The folding up rule is enabled...
0.13/0.37	# Local unification is enabled...
0.13/0.37	# Any saturation attempts will use folding labels...
0.13/0.37	# 17 beginning clauses after preprocessing and clausification
0.13/0.37	# Creating start rules for all 2 conjectures.
0.13/0.37	# There are 2 start rule candidates:
0.13/0.37	# Found 3 unit axioms.
0.13/0.37	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.13/0.37	# 2 start rule tableaux created.
0.13/0.37	# 14 extension rule candidate clauses
0.13/0.37	# 3 unit axiom clauses
0.13/0.37	
0.13/0.37	# Requested 8, 32 cores available to the main process.
0.13/0.37	# There are not enough tableaux to fork, creating more from the initial 2
0.13/0.38	# There were 5 total branch saturation attempts.
0.13/0.38	# There were 0 of these attempts blocked.
0.13/0.38	# There were 0 deferred branch saturation attempts.
0.13/0.38	# There were 2 free duplicated saturations.
0.13/0.38	# There were 5 total successful branch saturations.
0.13/0.38	# There were 0 successful branch saturations in interreduction.
0.13/0.38	# There were 0 successful branch saturations on the branch.
0.13/0.38	# There were 3 successful branch saturations after the branch.
0.13/0.38	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# Begin clausification derivation
0.13/0.38	
0.13/0.38	# End clausification derivation
0.13/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.13/0.38	cnf(i_0_10, plain, (intersection(X1,X2)=intersection(X2,X1))).
0.13/0.38	cnf(i_0_6, plain, (~member(X1,empty_set))).
0.13/0.38	cnf(i_0_4, plain, (~not_equal(X1,X1))).
0.13/0.38	cnf(i_0_2, negated_conjecture, (~intersect(esk1_0,esk2_0)|~not_equal(intersection(esk1_0,esk2_0),empty_set))).
0.13/0.38	cnf(i_0_1, negated_conjecture, (intersect(esk1_0,esk2_0)|not_equal(intersection(esk1_0,esk2_0),empty_set))).
0.13/0.38	cnf(i_0_3, plain, (X1=X2|not_equal(X2,X1))).
0.13/0.38	cnf(i_0_15, plain, (~empty(X1)|~member(X2,X1))).
0.13/0.38	cnf(i_0_5, plain, (intersect(X1,X2)|~intersect(X2,X1))).
0.13/0.38	cnf(i_0_17, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))).
0.13/0.38	cnf(i_0_18, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))).
0.13/0.38	cnf(i_0_16, plain, (empty(X1)|member(esk5_1(X1),X1))).
0.13/0.38	cnf(i_0_8, plain, (member(esk3_2(X1,X2),X2)|~intersect(X1,X2))).
0.13/0.38	cnf(i_0_9, plain, (member(esk3_2(X1,X2),X1)|~intersect(X1,X2))).
0.13/0.38	cnf(i_0_7, plain, (intersect(X1,X2)|~member(X3,X2)|~member(X3,X1))).
0.13/0.38	cnf(i_0_19, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))).
0.13/0.38	cnf(i_0_13, plain, (X1=X2|member(esk4_2(X1,X2),X1)|member(esk4_2(X1,X2),X2))).
0.13/0.38	cnf(i_0_14, plain, (X1=X2|~member(esk4_2(X1,X2),X2)|~member(esk4_2(X1,X2),X1))).
0.13/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.13/0.38	# Begin printing tableau
0.13/0.38	# Found 6 steps
0.13/0.38	cnf(i_0_2, negated_conjecture, (~intersect(esk1_0,esk2_0)|~not_equal(intersection(esk1_0,esk2_0),empty_set)), inference(start_rule)).
0.13/0.38	cnf(i_0_23, plain, (~intersect(esk1_0,esk2_0)), inference(extension_rule, [i_0_7])).
0.13/0.38	cnf(i_0_106, plain, (~member(esk5_1(esk2_0),esk2_0)), inference(extension_rule, [i_0_16])).
0.13/0.38	cnf(i_0_107, plain, (~member(esk5_1(esk2_0),esk1_0)), inference(etableau_closure_rule, [i_0_107, ...])).
0.13/0.38	cnf(i_0_24, plain, (~not_equal(intersection(esk1_0,esk2_0),empty_set)), inference(etableau_closure_rule, [i_0_24, ...])).
0.13/0.38	cnf(i_0_266, plain, (empty(esk2_0)), inference(etableau_closure_rule, [i_0_266, ...])).
0.13/0.38	# End printing tableau
0.13/0.38	# SZS output end
0.13/0.38	# Branches closed with saturation will be marked with an "s"
0.13/0.38	# Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
0.13/0.38	# We now have 8 tableaux to operate on
0.13/0.38	# Found closed tableau during pool population.
0.13/0.38	# Proof search is over...
0.13/0.38	# Freeing feature tree
0.13/0.39	EOF