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.10/0.29	% Computer   : n008.cluster.edu
0.10/0.29	% Model      : x86_64 x86_64
0.10/0.29	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.29	% Memory     : 8042.1875MB
0.10/0.29	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.29	% CPULimit   : 1200
0.10/0.29	% WCLimit    : 120
0.10/0.29	% DateTime   : Tue Jul 13 16:43:44 EDT 2021
0.10/0.29	% CPUTime    : 
0.15/0.33	# No SInE strategy applied
0.15/0.33	# Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
0.15/0.33	# and selection function SelectNewComplexAHP.
0.15/0.33	#
0.15/0.33	# Presaturation interreduction done
0.15/0.33	# Number of axioms: 107 Number of unprocessed: 107
0.15/0.33	# Tableaux proof search.
0.15/0.33	# APR header successfully linked.
0.15/0.33	# Hello from C++
0.15/0.33	# The folding up rule is enabled...
0.15/0.33	# Local unification is enabled...
0.15/0.33	# Any saturation attempts will use folding labels...
0.15/0.33	# 107 beginning clauses after preprocessing and clausification
0.15/0.33	# Creating start rules for all 6 conjectures.
0.15/0.33	# There are 6 start rule candidates:
0.15/0.33	# Found 16 unit axioms.
0.15/0.33	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.15/0.33	# 6 start rule tableaux created.
0.15/0.33	# 91 extension rule candidate clauses
0.15/0.33	# 16 unit axiom clauses
0.15/0.33	
0.15/0.33	# Requested 8, 32 cores available to the main process.
0.15/0.33	# There are not enough tableaux to fork, creating more from the initial 6
0.15/0.33	# Returning from population with 15 new_tableaux and 0 remaining starting tableaux.
0.15/0.33	# We now have 15 tableaux to operate on
7.80/1.36	# There were 1 total branch saturation attempts.
7.80/1.36	# There were 0 of these attempts blocked.
7.80/1.36	# There were 0 deferred branch saturation attempts.
7.80/1.36	# There were 0 free duplicated saturations.
7.80/1.36	# There were 1 total successful branch saturations.
7.80/1.36	# There were 0 successful branch saturations in interreduction.
7.80/1.36	# There were 0 successful branch saturations on the branch.
7.80/1.36	# There were 1 successful branch saturations after the branch.
7.80/1.36	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
7.80/1.36	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
7.80/1.36	# Begin clausification derivation
7.80/1.36	
7.80/1.36	# End clausification derivation
7.80/1.36	# Begin listing active clauses obtained from FOF to CNF conversion
7.80/1.36	cnf(i_0_87, negated_conjecture, (arboreal(esk18_0))).
7.80/1.36	cnf(i_0_49, plain, (atomic(tptp1))).
7.80/1.36	cnf(i_0_14, plain, (atomic(tptp4))).
7.80/1.36	cnf(i_0_107, plain, (atomic(tptp2))).
7.80/1.36	cnf(i_0_88, negated_conjecture, (occurrence_of(esk19_0,tptp0))).
7.80/1.36	cnf(i_0_85, negated_conjecture, (subactivity_occurrence(esk18_0,esk19_0))).
7.80/1.36	cnf(i_0_67, plain, (atomic(tptp3))).
7.80/1.36	cnf(i_0_20, plain, (activity(tptp0))).
7.80/1.36	cnf(i_0_13, plain, (tptp2!=tptp1)).
7.80/1.36	cnf(i_0_25, plain, (tptp1!=tptp3)).
7.80/1.36	cnf(i_0_95, plain, (tptp2!=tptp3)).
7.80/1.36	cnf(i_0_86, negated_conjecture, (~leaf_occ(esk18_0,esk19_0))).
7.80/1.36	cnf(i_0_2, plain, (tptp4!=tptp1)).
7.80/1.36	cnf(i_0_47, plain, (tptp4!=tptp2)).
7.80/1.36	cnf(i_0_62, plain, (tptp4!=tptp3)).
7.80/1.36	cnf(i_0_12, plain, (~atomic(tptp0))).
7.80/1.36	cnf(i_0_32, plain, (arboreal(X1)|~legal(X1))).
7.80/1.36	cnf(i_0_106, plain, (activity(X1)|~occurrence_of(X2,X1))).
7.80/1.36	cnf(i_0_51, plain, (~atomic(X1)|~min_precedes(X2,X3,X1))).
7.80/1.36	cnf(i_0_22, plain, (legal(X1)|~precedes(X2,X1))).
7.80/1.36	cnf(i_0_29, plain, (~leaf(X1,X2)|~min_precedes(X1,X3,X2))).
7.80/1.36	cnf(i_0_90, plain, (~root(X1,X2)|~min_precedes(X3,X1,X2))).
7.80/1.36	cnf(i_0_105, plain, (activity_occurrence(X1)|~occurrence_of(X1,X2))).
7.80/1.36	cnf(i_0_1, plain, (arboreal(X1)|~min_precedes(X1,X2,X3))).
7.80/1.36	cnf(i_0_6, plain, (subactivity_occurrence(X1,X2)|~leaf_occ(X1,X2))).
7.80/1.36	cnf(i_0_53, plain, (arboreal(X1)|~next_subocc(X2,X1,X3))).
7.80/1.36	cnf(i_0_52, plain, (arboreal(X1)|~next_subocc(X1,X2,X3))).
7.80/1.36	cnf(i_0_104, plain, (activity(esk21_1(X1))|~activity_occurrence(X1))).
7.80/1.36	cnf(i_0_98, plain, (activity_occurrence(X1)|~subactivity_occurrence(X2,X1))).
7.80/1.36	cnf(i_0_48, plain, (subactivity(X1,X1)|~activity(X1))).
7.80/1.36	cnf(i_0_96, plain, (legal(X1)|~root(X1,X2))).
7.80/1.36	cnf(i_0_99, plain, (activity_occurrence(X1)|~subactivity_occurrence(X1,X2))).
7.80/1.36	cnf(i_0_37, plain, (~earlier(X1,X2)|~earlier(X2,X1))).
7.80/1.36	cnf(i_0_103, plain, (occurrence_of(X1,esk21_1(X1))|~activity_occurrence(X1))).
7.80/1.36	cnf(i_0_100, plain, (arboreal(X1)|~atomic(X2)|~occurrence_of(X1,X2))).
7.80/1.36	cnf(i_0_55, plain, (subactivity_occurrence(X1,X2)|~root_occ(X1,X2))).
7.80/1.36	cnf(i_0_101, plain, (atomic(X1)|~occurrence_of(X2,X1)|~arboreal(X2))).
7.80/1.36	cnf(i_0_84, negated_conjecture, (~next_subocc(esk18_0,X1,tptp0)|~leaf(X2,tptp0)|~occurrence_of(X1,tptp3)|~occurrence_of(X2,tptp1)|~min_precedes(X1,X2,tptp0))).
7.80/1.36	cnf(i_0_17, plain, (legal(X1)|~legal(X2)|~earlier(X1,X2))).
7.80/1.36	cnf(i_0_23, plain, (earlier(X1,X2)|~precedes(X1,X2))).
7.80/1.36	cnf(i_0_3, plain, (~occurrence_of(X1,X2)|~leaf_occ(X3,X1)|~min_precedes(X3,X4,X2))).
7.80/1.36	cnf(i_0_94, plain, (~root_occ(X1,X2)|~occurrence_of(X2,X3)|~min_precedes(X4,X1,X3))).
7.80/1.36	cnf(i_0_97, plain, (root(X1,X2)|~atocc(X1,X2)|~legal(X1))).
7.80/1.36	cnf(i_0_60, plain, (atomic(esk11_2(X1,X2))|~atocc(X1,X2))).
7.80/1.36	cnf(i_0_81, plain, (X1=X2|~occurrence_of(X3,X2)|~occurrence_of(X3,X1))).
7.80/1.36	cnf(i_0_83, negated_conjecture, (~next_subocc(esk18_0,X1,tptp0)|~leaf(X2,tptp0)|~occurrence_of(X1,tptp3)|~occurrence_of(X2,tptp2)|~min_precedes(X1,X2,tptp0))).
7.80/1.36	cnf(i_0_8, plain, (occurrence_of(X1,esk1_2(X2,X1))|~leaf_occ(X2,X1))).
7.80/1.36	cnf(i_0_36, plain, (min_precedes(X1,X2,X3)|~next_subocc(X1,X2,X3))).
7.80/1.36	cnf(i_0_73, plain, (precedes(X1,X2)|~min_precedes(X1,X2,X3))).
7.80/1.36	cnf(i_0_24, plain, (precedes(X1,X2)|~legal(X2)|~earlier(X1,X2))).
7.80/1.36	cnf(i_0_54, plain, (occurrence_of(X1,esk10_2(X2,X1))|~root_occ(X2,X1))).
7.80/1.36	cnf(i_0_35, plain, (~next_subocc(X1,X2,X3)|~min_precedes(X4,X2,X3)|~min_precedes(X1,X4,X3))).
7.80/1.36	cnf(i_0_59, plain, (occurrence_of(X1,esk11_2(X1,X2))|~atocc(X1,X2))).
7.80/1.36	cnf(i_0_56, plain, (root(X1,esk10_2(X1,X2))|~root_occ(X1,X2))).
7.80/1.36	cnf(i_0_61, plain, (subactivity(X1,esk11_2(X2,X1))|~atocc(X2,X1))).
7.80/1.36	cnf(i_0_7, plain, (leaf(X1,esk1_2(X1,X2))|~leaf_occ(X1,X2))).
7.80/1.36	cnf(i_0_5, plain, (leaf_occ(X1,X2)|~leaf(X1,X3)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,X3))).
7.80/1.36	cnf(i_0_71, plain, (X1=X2|~next_subocc(X2,X3,X4)|~next_subocc(X1,X3,X4))).
7.80/1.36	cnf(i_0_102, plain, (subactivity_occurrence(X1,X2)|~subactivity_occurrence(X1,X3)|~subactivity_occurrence(X3,X2))).
7.80/1.36	cnf(i_0_74, plain, (occurrence_of(esk15_1(X1),tptp3)|leaf_occ(X1,X2)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)|~arboreal(X1))).
7.80/1.36	cnf(i_0_18, plain, (earlier(X1,X2)|~earlier(X1,X3)|~earlier(X3,X2))).
7.80/1.36	cnf(i_0_16, plain, (atomic(X1)|subactivity_occurrence(esk3_2(X1,X2),X2)|~occurrence_of(X2,X1))).
7.80/1.36	cnf(i_0_26, plain, (X1=X2|~root_occ(X2,X3)|~root_occ(X1,X3)|~occurrence_of(X3,X4))).
7.80/1.36	cnf(i_0_58, plain, (atocc(X1,X2)|~subactivity(X2,X3)|~atomic(X3)|~occurrence_of(X1,X3))).
7.80/1.36	cnf(i_0_70, plain, (atocc(X1,esk14_2(X2,X1))|~root(X1,X2))).
7.80/1.36	cnf(i_0_69, plain, (subactivity(esk14_2(X1,X2),X1)|~root(X2,X1))).
7.80/1.36	cnf(i_0_38, plain, (atomic(X1)|leaf_occ(X2,esk7_2(X2,X1))|~leaf(X2,X1))).
7.80/1.36	cnf(i_0_9, plain, (occurrence_of(esk2_3(X1,X2,X3),X1)|~min_precedes(X2,X3,X1))).
7.80/1.36	cnf(i_0_39, plain, (atomic(X1)|occurrence_of(esk7_2(X2,X1),X1)|~leaf(X2,X1))).
7.80/1.36	cnf(i_0_77, plain, (leaf(esk17_1(X1),tptp0)|leaf_occ(X1,X2)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)|~arboreal(X1))).
7.80/1.36	cnf(i_0_79, plain, (occurrence_of(esk16_1(X1),tptp4)|leaf_occ(X1,X2)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)|~arboreal(X1))).
7.80/1.36	cnf(i_0_92, plain, (atomic(X1)|subactivity_occurrence(X2,esk20_2(X1,X2))|~root(X2,X1))).
7.80/1.36	cnf(i_0_93, plain, (atomic(X1)|occurrence_of(esk20_2(X1,X2),X1)|~root(X2,X1))).
7.80/1.36	cnf(i_0_57, plain, (root_occ(X1,X2)|~root(X1,X3)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,X3))).
7.80/1.36	cnf(i_0_21, plain, (X1=X2|atomic(X3)|~occurrence_of(X4,X3)|~leaf_occ(X2,X4)|~leaf_occ(X1,X4))).
7.80/1.36	cnf(i_0_31, plain, (subactivity_occurrence(X1,X2)|~subactivity_occurrence(X3,X2)|~occurrence_of(X2,X4)|~min_precedes(X1,X3,X4))).
7.80/1.36	cnf(i_0_50, plain, (min_precedes(X1,X2,X3)|~precedes(X1,X2)|~min_precedes(X4,X2,X3)|~min_precedes(X4,X1,X3))).
7.80/1.36	cnf(i_0_11, plain, (subactivity_occurrence(X1,esk2_3(X2,X3,X1))|~min_precedes(X3,X1,X2))).
7.80/1.36	cnf(i_0_10, plain, (subactivity_occurrence(X1,esk2_3(X2,X1,X3))|~min_precedes(X1,X3,X2))).
7.80/1.36	cnf(i_0_80, plain, (next_subocc(X1,esk15_1(X1),tptp0)|leaf_occ(X1,X2)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)|~arboreal(X1))).
7.80/1.36	cnf(i_0_76, plain, (occurrence_of(esk17_1(X1),tptp2)|occurrence_of(esk17_1(X1),tptp1)|leaf_occ(X1,X2)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)|~arboreal(X1))).
7.80/1.36	cnf(i_0_30, plain, (root(X1,X2)|min_precedes(esk4_2(X1,X2),X1,X2)|~leaf(X1,X2))).
7.80/1.36	cnf(i_0_15, plain, (root(esk3_2(X1,X2),X1)|atomic(X1)|~occurrence_of(X2,X1))).
7.80/1.36	cnf(i_0_42, plain, (atocc(X1,esk8_3(X2,X1,X3))|~min_precedes(X1,X3,X2))).
7.80/1.36	cnf(i_0_45, plain, (min_precedes(X1,X2,X3)|~precedes(X1,X2)|~min_precedes(X2,X4,X3)|~min_precedes(X1,X4,X3))).
7.80/1.36	cnf(i_0_91, plain, (subactivity(X1,X2)|atomic(X1)|~subactivity_occurrence(X3,X4)|~occurrence_of(X4,X2)|~occurrence_of(X3,X1))).
7.80/1.36	cnf(i_0_41, plain, (atocc(X1,esk9_3(X2,X3,X1))|~min_precedes(X3,X1,X2))).
7.80/1.36	cnf(i_0_66, plain, (root(esk13_3(X1,X2,X3),X3)|~min_precedes(X1,X2,X3))).
7.80/1.36	cnf(i_0_44, plain, (subactivity(esk8_3(X1,X2,X3),X1)|~min_precedes(X2,X3,X1))).
7.80/1.36	cnf(i_0_28, plain, (leaf(X1,X2)|min_precedes(X1,esk5_2(X1,X2),X2)|~root(X1,X2))).
7.80/1.36	cnf(i_0_27, plain, (leaf(X1,X2)|min_precedes(X1,esk5_2(X1,X2),X2)|~min_precedes(X3,X1,X2))).
7.80/1.36	cnf(i_0_40, plain, (X1=X2|min_precedes(X1,X2,X3)|~root_occ(X1,X4)|~occurrence_of(X4,X3)|~leaf_occ(X2,X4))).
7.80/1.36	cnf(i_0_43, plain, (subactivity(esk9_3(X1,X2,X3),X1)|~min_precedes(X2,X3,X1))).
7.80/1.36	cnf(i_0_46, plain, (X1=X2|earlier(X1,X2)|earlier(X2,X1)|~earlier(X2,X3)|~earlier(X1,X3))).
7.80/1.36	cnf(i_0_65, plain, (min_precedes(esk13_3(X1,X2,X3),X2,X3)|~min_precedes(X1,X2,X3))).
7.80/1.36	cnf(i_0_63, plain, (subactivity_occurrence(X1,X2)|~subactivity(X3,X4)|~subactivity_occurrence(esk12_4(X3,X4,X1,X2),X1)|~occurrence_of(X2,X4)|~occurrence_of(X1,X3))).
7.80/1.36	cnf(i_0_19, plain, (X1=X2|~next_subocc(X3,X2,X4)|~next_subocc(X3,X1,X4)|~subactivity_occurrence(X2,X5)|~subactivity_occurrence(X1,X5)|~occurrence_of(X5,X4))).
7.80/1.36	cnf(i_0_68, plain, (X1=X2|min_precedes(X1,X2,X3)|~subactivity_occurrence(X1,X4)|~occurrence_of(X4,X3)|~leaf_occ(X2,X4)|~arboreal(X1))).
7.80/1.36	cnf(i_0_4, plain, (X1=X2|min_precedes(X1,X2,X3)|~subactivity_occurrence(X2,X4)|~root_occ(X1,X4)|~occurrence_of(X4,X3)|~arboreal(X2))).
7.80/1.36	cnf(i_0_34, plain, (next_subocc(X1,X2,X3)|min_precedes(X1,esk6_3(X1,X2,X3),X3)|~min_precedes(X1,X2,X3))).
7.80/1.36	cnf(i_0_75, plain, (next_subocc(esk15_1(X1),esk16_1(X1),tptp0)|leaf_occ(X1,X2)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)|~arboreal(X1))).
7.80/1.36	cnf(i_0_78, plain, (next_subocc(esk16_1(X1),esk17_1(X1),tptp0)|leaf_occ(X1,X2)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)|~arboreal(X1))).
7.80/1.36	cnf(i_0_33, plain, (next_subocc(X1,X2,X3)|min_precedes(esk6_3(X1,X2,X3),X2,X3)|~min_precedes(X1,X2,X3))).
7.80/1.36	cnf(i_0_64, plain, (subactivity_occurrence(esk12_4(X1,X2,X3,X4),X4)|subactivity_occurrence(X3,X4)|~subactivity(X1,X2)|~occurrence_of(X4,X2)|~occurrence_of(X3,X1))).
7.80/1.36	cnf(i_0_72, plain, (X1=X2|min_precedes(X1,X2,X3)|min_precedes(X2,X1,X3)|~subactivity_occurrence(X2,X4)|~subactivity_occurrence(X1,X4)|~occurrence_of(X4,X3)|~arboreal(X2)|~arboreal(X1))).
7.80/1.36	cnf(i_0_82, plain, (X1=X2|min_precedes(X2,X1,X3)|~subactivity_occurrence(X2,X4)|~root_occ(X5,X4)|~occurrence_of(X4,X3)|~leaf_occ(X1,X4)|~min_precedes(X5,X2,X3))).
7.80/1.36	cnf(i_0_89, plain, (X1=X2|min_precedes(X2,X1,X3)|~subactivity_occurrence(X1,X4)|~root_occ(X2,X4)|~occurrence_of(X4,X3)|~leaf_occ(X5,X4)|~min_precedes(X1,X5,X3))).
7.80/1.36	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
7.80/1.36	# Begin printing tableau
7.80/1.36	# Found 4 steps
7.80/1.36	cnf(i_0_88, negated_conjecture, (occurrence_of(esk19_0,tptp0)), inference(start_rule)).
7.80/1.36	cnf(i_0_120, plain, (occurrence_of(esk19_0,tptp0)), inference(extension_rule, [i_0_106])).
7.80/1.36	cnf(i_0_1003, plain, (activity(tptp0)), inference(extension_rule, [i_0_48])).
7.80/1.36	cnf(i_0_1029, plain, (subactivity(tptp0,tptp0)), inference(etableau_closure_rule, [i_0_1029, ...])).
7.80/1.36	# End printing tableau
7.80/1.36	# SZS output end
7.80/1.36	# Branches closed with saturation will be marked with an "s"
7.80/1.37	# Child (14495) has found a proof.
7.80/1.37	
7.80/1.37	# Proof search is over...
7.80/1.37	# Freeing feature tree
7.80/1.37	EOF