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