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