0.00/0.12	% 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   : n017.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 05:12:15 EDT 2022
0.12/0.33	% CPUTime    : 
0.12/0.37	# No SInE strategy applied
0.12/0.37	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S038I
0.12/0.37	# and selection function SelectUnlessUniqMaxPos.
0.12/0.37	#
0.12/0.37	# Presaturation interreduction done
0.12/0.37	# Number of axioms: 23 Number of unprocessed: 22
0.12/0.37	# Tableaux proof search.
0.12/0.37	# APR header successfully linked.
0.12/0.37	# Hello from C++
0.19/0.50	# The folding up rule is enabled...
0.19/0.50	# Local unification is enabled...
0.19/0.50	# Any saturation attempts will use folding labels...
0.19/0.50	# 22 beginning clauses after preprocessing and clausification
0.19/0.50	# Creating start rules for all 1 conjectures.
0.19/0.50	# There are 1 start rule candidates:
0.19/0.50	# Found 6 unit axioms.
0.19/0.50	# 1 start rule tableaux created.
0.19/0.50	# 16 extension rule candidate clauses
0.19/0.50	# 6 unit axiom clauses
0.19/0.50	
0.19/0.50	# Requested 8, 32 cores available to the main process.
0.19/0.50	# There are not enough tableaux to fork, creating more from the initial 1
0.19/0.50	# There were 2 total branch saturation attempts.
0.19/0.50	# There were 0 of these attempts blocked.
0.19/0.50	# There were 0 deferred branch saturation attempts.
0.19/0.50	# There were 1 free duplicated saturations.
0.19/0.50	# There were 2 total successful branch saturations.
0.19/0.50	# There were 0 successful branch saturations in interreduction.
0.19/0.50	# There were 0 successful branch saturations on the branch.
0.19/0.50	# There were 1 successful branch saturations after the branch.
0.19/0.50	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.50	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.50	# Begin clausification derivation
0.19/0.50	
0.19/0.50	# End clausification derivation
0.19/0.50	# Begin listing active clauses obtained from FOF to CNF conversion
0.19/0.50	cnf(i_0_9, plain, (empty(esk3_0))).
0.19/0.50	cnf(i_0_8, plain, (subset(X1,X1))).
0.19/0.50	cnf(i_0_22, plain, (set_union2(X1,X1)=X1)).
0.19/0.50	cnf(i_0_16, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
0.19/0.50	cnf(i_0_17, negated_conjecture, (~subset(set_union2(powerset(set_difference(esk5_0,esk6_0)),powerset(set_difference(esk6_0,esk5_0))),powerset(set_union2(set_difference(esk5_0,esk6_0),set_difference(esk6_0,esk5_0)))))).
0.19/0.50	cnf(i_0_7, plain, (~empty(esk2_0))).
0.19/0.50	cnf(i_0_10, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
0.19/0.50	cnf(i_0_15, plain, (~in(X1,X2)|~in(X2,X1))).
0.19/0.50	cnf(i_0_24, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
0.19/0.50	cnf(i_0_14, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))).
0.19/0.50	cnf(i_0_20, plain, (in(X1,powerset(X2))|~subset(X1,X2))).
0.19/0.50	cnf(i_0_12, plain, (subset(X1,X2)|~in(esk4_2(X1,X2),X2))).
0.19/0.50	cnf(i_0_21, plain, (subset(X1,X2)|~in(X1,powerset(X2)))).
0.19/0.50	cnf(i_0_13, plain, (subset(X1,X2)|in(esk4_2(X1,X2),X1))).
0.19/0.50	cnf(i_0_1, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))).
0.19/0.50	cnf(i_0_2, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))).
0.19/0.50	cnf(i_0_19, plain, (X1=powerset(X2)|~subset(esk7_2(X2,X1),X2)|~in(esk7_2(X2,X1),X1))).
0.19/0.50	cnf(i_0_3, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))).
0.19/0.50	cnf(i_0_18, plain, (X1=powerset(X2)|subset(esk7_2(X2,X1),X2)|in(esk7_2(X2,X1),X1))).
0.19/0.50	cnf(i_0_5, plain, (X1=set_union2(X2,X3)|~in(esk1_3(X2,X3,X1),X1)|~in(esk1_3(X2,X3,X1),X3))).
0.19/0.50	cnf(i_0_6, plain, (X1=set_union2(X2,X3)|~in(esk1_3(X2,X3,X1),X1)|~in(esk1_3(X2,X3,X1),X2))).
0.19/0.50	cnf(i_0_4, plain, (X1=set_union2(X2,X3)|in(esk1_3(X2,X3,X1),X2)|in(esk1_3(X2,X3,X1),X3)|in(esk1_3(X2,X3,X1),X1))).
0.19/0.50	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.19/0.50	# Begin printing tableau
0.19/0.50	# Found 4 steps
0.19/0.50	cnf(i_0_17, negated_conjecture, (~subset(set_union2(powerset(set_difference(esk5_0,esk6_0)),powerset(set_difference(esk6_0,esk5_0))),powerset(set_union2(set_difference(esk5_0,esk6_0),set_difference(esk6_0,esk5_0))))), inference(start_rule)).
0.19/0.50	cnf(i_0_30, plain, (~subset(set_union2(powerset(set_difference(esk5_0,esk6_0)),powerset(set_difference(esk6_0,esk5_0))),powerset(set_union2(set_difference(esk5_0,esk6_0),set_difference(esk6_0,esk5_0))))), inference(extension_rule, [i_0_13])).
0.19/0.50	cnf(i_0_47, plain, (in(esk4_2(set_union2(powerset(set_difference(esk5_0,esk6_0)),powerset(set_difference(esk6_0,esk5_0))),powerset(set_union2(set_difference(esk5_0,esk6_0),set_difference(esk6_0,esk5_0)))),set_union2(powerset(set_difference(esk5_0,esk6_0)),powerset(set_difference(esk6_0,esk5_0))))), inference(extension_rule, [i_0_15])).
0.19/0.50	cnf(i_0_73, plain, (~in(set_union2(powerset(set_difference(esk5_0,esk6_0)),powerset(set_difference(esk6_0,esk5_0))),esk4_2(set_union2(powerset(set_difference(esk5_0,esk6_0)),powerset(set_difference(esk6_0,esk5_0))),powerset(set_union2(set_difference(esk5_0,esk6_0),set_difference(esk6_0,esk5_0)))))), inference(etableau_closure_rule, [i_0_73, ...])).
0.19/0.50	# End printing tableau
0.19/0.50	# SZS output end
0.19/0.50	# Branches closed with saturation will be marked with an "s"
0.19/0.50	# Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
0.19/0.50	# We now have 4 tableaux to operate on
0.19/0.50	# Found closed tableau during pool population.
0.19/0.50	# Proof search is over...
0.19/0.50	# Freeing feature tree
0.19/0.51	EOF