0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% 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   : n031.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1200
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Jul 13 12:01:59 EDT 2021
0.13/0.35	% CPUTime    : 
0.13/0.38	# No SInE strategy applied
0.13/0.38	# Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
0.13/0.38	# and selection function PSelectComplexExceptUniqMaxHorn.
0.13/0.38	#
0.13/0.38	# Presaturation interreduction done
0.13/0.38	# Number of axioms: 62 Number of unprocessed: 62
0.13/0.38	# Tableaux proof search.
0.13/0.38	# APR header successfully linked.
0.13/0.38	# Hello from C++
0.13/0.39	# The folding up rule is enabled...
0.13/0.39	# Local unification is enabled...
0.13/0.39	# Any saturation attempts will use folding labels...
0.13/0.39	# 62 beginning clauses after preprocessing and clausification
0.13/0.39	# Creating start rules for all 3 conjectures.
0.13/0.39	# There are 3 start rule candidates:
0.13/0.39	# Found 3 unit axioms.
0.13/0.39	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.13/0.39	# 3 start rule tableaux created.
0.13/0.39	# 59 extension rule candidate clauses
0.13/0.39	# 3 unit axiom clauses
0.13/0.39	
0.13/0.39	# Requested 8, 32 cores available to the main process.
0.13/0.39	# There are not enough tableaux to fork, creating more from the initial 3
0.13/0.39	# Returning from population with 60 new_tableaux and 0 remaining starting tableaux.
0.13/0.39	# We now have 60 tableaux to operate on
4.80/1.06	# 7581 Satisfiable branch
4.80/1.07	# Satisfiable branch found.
4.80/1.07	# There were 2 total branch saturation attempts.
4.80/1.07	# There were 0 of these attempts blocked.
4.80/1.07	# There were 0 deferred branch saturation attempts.
4.80/1.07	# There were 0 free duplicated saturations.
4.80/1.07	# There were 1 total successful branch saturations.
4.80/1.07	# There were 0 successful branch saturations in interreduction.
4.80/1.07	# There were 0 successful branch saturations on the branch.
4.80/1.07	# There were 1 successful branch saturations after the branch.
4.80/1.07	# SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
4.80/1.07	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
4.80/1.07	# Begin clausification derivation
4.80/1.07	
4.80/1.07	# End clausification derivation
4.80/1.07	# Begin listing active clauses obtained from FOF to CNF conversion
4.80/1.07	cnf(i_0_2, negated_conjecture, (p100(esk1_0))).
4.80/1.07	cnf(i_0_4, plain, (r1(X1,X1))).
4.80/1.07	cnf(i_0_1, negated_conjecture, (~p101(esk1_0))).
4.80/1.07	cnf(i_0_37, plain, (p100(X1)|~epred1_1(X1)|~p101(X1))).
4.80/1.07	cnf(i_0_36, plain, (p101(X1)|~epred1_1(X1)|~p102(X1))).
4.80/1.07	cnf(i_0_33, plain, (p105(X1)|~epred1_1(X1)|~p106(X1))).
4.80/1.07	cnf(i_0_34, plain, (p104(X1)|~epred1_1(X1)|~p105(X1))).
4.80/1.07	cnf(i_0_38, plain, (p103(X1)|~epred1_1(X1)|~p104(X1))).
4.80/1.07	cnf(i_0_35, plain, (p102(X1)|~epred1_1(X1)|~p103(X1))).
4.80/1.07	cnf(i_0_55, plain, (p105(X1)|~epred1_1(X1)|~p104(X1)|~p6(esk3_1(X1)))).
4.80/1.07	cnf(i_0_60, plain, (p105(X1)|~epred1_1(X1)|~p104(X1)|~p106(esk2_1(X1)))).
4.80/1.07	cnf(i_0_25, plain, (p101(esk6_1(X1))|p101(X1)|~epred1_1(X1)|~p100(X1))).
4.80/1.07	cnf(i_0_23, plain, (p101(X1)|~epred1_1(X1)|~p100(X1)|~p2(esk7_1(X1)))).
4.80/1.07	cnf(i_0_26, plain, (p101(X1)|~epred1_1(X1)|~p102(esk6_1(X1))|~p100(X1))).
4.80/1.07	cnf(i_0_22, plain, (p101(X1)|~epred1_1(X1)|~p102(esk7_1(X1))|~p100(X1))).
4.80/1.07	cnf(i_0_21, plain, (p101(esk7_1(X1))|p101(X1)|~epred1_1(X1)|~p100(X1))).
4.80/1.07	cnf(i_0_62, plain, (p105(X1)|p6(esk2_1(X1))|~epred1_1(X1)|~p104(X1))).
4.80/1.07	cnf(i_0_27, plain, (p2(esk6_1(X1))|p101(X1)|~epred1_1(X1)|~p100(X1))).
4.80/1.07	cnf(i_0_57, plain, (p105(X1)|~epred1_1(X1)|~p104(X1)|~p106(esk3_1(X1)))).
4.80/1.07	cnf(i_0_51, plain, (p104(X1)|~epred1_1(X1)|~p103(X1)|~p105(esk4_1(X1)))).
4.80/1.07	cnf(i_0_48, plain, (p104(X1)|~epred1_1(X1)|~p103(X1)|~p105(esk5_1(X1)))).
4.80/1.07	cnf(i_0_53, plain, (p104(X1)|~epred1_1(X1)|~p103(X1)|~p5(esk4_1(X1)))).
4.80/1.07	cnf(i_0_19, plain, (p102(esk8_1(X1))|p102(X1)|~epred1_1(X1)|~p101(X1))).
4.80/1.07	cnf(i_0_18, plain, (p102(X1)|~epred1_1(X1)|~p101(X1)|~p103(esk8_1(X1)))).
4.80/1.07	cnf(i_0_15, plain, (p102(X1)|~epred1_1(X1)|~p101(X1)|~p103(esk9_1(X1)))).
4.80/1.07	cnf(i_0_16, plain, (p102(X1)|~epred1_1(X1)|~p3(esk9_1(X1))|~p101(X1))).
4.80/1.07	cnf(i_0_11, plain, (p103(X1)|~epred1_1(X1)|~p102(X1)|~p104(esk10_1(X1)))).
4.80/1.07	cnf(i_0_61, plain, (p105(esk2_1(X1))|p105(X1)|~epred1_1(X1)|~p104(X1))).
4.80/1.07	cnf(i_0_14, plain, (p102(esk9_1(X1))|p102(X1)|~epred1_1(X1)|~p101(X1))).
4.80/1.07	cnf(i_0_7, plain, (p103(X1)|~epred1_1(X1)|~p102(X1)|~p104(esk11_1(X1)))).
4.80/1.07	cnf(i_0_12, plain, (p103(X1)|~epred1_1(X1)|~p102(X1)|~p4(esk10_1(X1)))).
4.80/1.07	cnf(i_0_56, plain, (p105(esk3_1(X1))|p105(X1)|~epred1_1(X1)|~p104(X1))).
4.80/1.07	cnf(i_0_52, plain, (p104(esk4_1(X1))|p104(X1)|~epred1_1(X1)|~p103(X1))).
4.80/1.07	cnf(i_0_20, plain, (p3(esk8_1(X1))|p102(X1)|~epred1_1(X1)|~p101(X1))).
4.80/1.07	cnf(i_0_28, plain, (p101(X1)|r1(X1,esk6_1(X1))|~epred1_1(X1)|~p100(X1))).
4.80/1.07	cnf(i_0_24, plain, (p101(X1)|r1(X1,esk7_1(X1))|~epred1_1(X1)|~p100(X1))).
4.80/1.07	cnf(i_0_17, plain, (p102(X1)|r1(X1,esk8_1(X1))|~epred1_1(X1)|~p101(X1))).
4.80/1.07	cnf(i_0_13, plain, (p102(X1)|r1(X1,esk9_1(X1))|~epred1_1(X1)|~p101(X1))).
4.80/1.07	cnf(i_0_47, plain, (p104(esk5_1(X1))|p104(X1)|~epred1_1(X1)|~p103(X1))).
4.80/1.07	cnf(i_0_49, plain, (p5(esk5_1(X1))|p104(X1)|~epred1_1(X1)|~p103(X1))).
4.80/1.07	cnf(i_0_10, plain, (p103(esk10_1(X1))|p103(X1)|~epred1_1(X1)|~p102(X1))).
4.80/1.07	cnf(i_0_8, plain, (p103(esk11_1(X1))|p103(X1)|~epred1_1(X1)|~p102(X1))).
4.80/1.07	cnf(i_0_6, plain, (p4(esk11_1(X1))|p103(X1)|~epred1_1(X1)|~p102(X1))).
4.80/1.07	cnf(i_0_30, plain, (p6(X1)|~epred1_1(X1)|~p105(X2)|~p105(X1)|~p6(X2)|~r1(X1,X2))).
4.80/1.07	cnf(i_0_59, plain, (p105(X1)|r1(X1,esk2_1(X1))|~epred1_1(X1)|~p104(X1))).
4.80/1.07	cnf(i_0_58, plain, (p105(X1)|r1(X1,esk3_1(X1))|~epred1_1(X1)|~p104(X1))).
4.80/1.07	cnf(i_0_54, plain, (p104(X1)|r1(X1,esk4_1(X1))|~epred1_1(X1)|~p103(X1))).
4.80/1.07	cnf(i_0_50, plain, (p104(X1)|r1(X1,esk5_1(X1))|~epred1_1(X1)|~p103(X1))).
4.80/1.07	cnf(i_0_9, plain, (p103(X1)|r1(X1,esk10_1(X1))|~epred1_1(X1)|~p102(X1))).
4.80/1.07	cnf(i_0_5, plain, (p103(X1)|r1(X1,esk11_1(X1))|~epred1_1(X1)|~p102(X1))).
4.80/1.07	cnf(i_0_42, plain, (p2(X1)|~epred1_1(X2)|~p2(X2)|~p101(X1)|~p101(X2)|~r1(X2,X1))).
4.80/1.07	cnf(i_0_45, plain, (p5(X1)|~epred1_1(X1)|~p5(X2)|~p104(X1)|~p104(X2)|~r1(X1,X2))).
4.80/1.07	cnf(i_0_43, plain, (p4(X1)|~epred1_1(X1)|~p4(X2)|~p103(X1)|~p103(X2)|~r1(X1,X2))).
4.80/1.07	cnf(i_0_41, plain, (p2(X1)|~epred1_1(X1)|~p2(X2)|~p101(X2)|~p101(X1)|~r1(X1,X2))).
4.80/1.07	cnf(i_0_40, plain, (p1(X1)|~epred1_1(X1)|~p1(X2)|~p100(X1)|~p100(X2)|~r1(X1,X2))).
4.80/1.07	cnf(i_0_39, plain, (p1(X1)|~epred1_1(X2)|~p1(X2)|~p100(X1)|~p100(X2)|~r1(X2,X1))).
4.80/1.07	cnf(i_0_31, plain, (p3(X1)|~epred1_1(X1)|~p3(X2)|~p102(X1)|~p102(X2)|~r1(X1,X2))).
4.80/1.07	cnf(i_0_29, plain, (p6(X1)|~epred1_1(X2)|~p105(X1)|~p105(X2)|~p6(X2)|~r1(X2,X1))).
4.80/1.07	cnf(i_0_46, plain, (p5(X1)|~epred1_1(X2)|~p5(X2)|~p104(X1)|~p104(X2)|~r1(X2,X1))).
4.80/1.07	cnf(i_0_44, plain, (p4(X1)|~epred1_1(X2)|~p4(X2)|~p103(X1)|~p103(X2)|~r1(X2,X1))).
4.80/1.07	cnf(i_0_32, plain, (p3(X1)|~epred1_1(X2)|~p3(X2)|~p102(X1)|~p102(X2)|~r1(X2,X1))).
4.80/1.07	cnf(i_0_3, negated_conjecture, (epred1_1(X1)|~r1(esk1_0,X2)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1)|~r1(X2,X3))).
4.80/1.07	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
4.80/1.07	# Begin printing tableau
4.80/1.07	# Found 5 steps
4.80/1.07	cnf(i_0_2, negated_conjecture, (p100(esk1_0)), inference(start_rule)).
4.80/1.07	cnf(i_0_70, plain, (p100(esk1_0)), inference(extension_rule, [i_0_25])).
4.80/1.07	cnf(i_0_354, plain, (p101(esk1_0)), inference(closure_rule, [i_0_1])).
4.80/1.07	cnf(i_0_353, plain, (p101(esk6_1(esk1_0))), inference(extension_rule, [i_0_37])).
4.80/1.07	cnf(i_0_355, plain, (~epred1_1(esk1_0)), inference(etableau_closure_rule, [i_0_355, ...])).
4.80/1.07	# End printing tableau
4.80/1.07	# SZS output end
4.80/1.07	# Branches closed with saturation will be marked with an "s"
4.80/1.07	# Child (7581) has found a proof.
4.80/1.07	
4.80/1.08	# Proof search is over...
4.80/1.08	# Freeing feature tree
4.80/1.08	EOF