0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.12/0.34	Computer   : n005.cluster.edu
0.12/0.34	Model      : x86_64 x86_64
0.12/0.34	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	RAMPerCPU  : 8042.1875MB
0.12/0.34	OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 960
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Aug  9 03:18:04 EDT 2022
0.12/0.34	% CPUTime    : 
0.12/0.38	# No SInE strategy applied
0.12/0.38	# Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
0.12/0.38	# and selection function SelectNewComplexAHP.
0.12/0.38	#
0.12/0.38	# Presaturation interreduction done
0.12/0.38	# Number of axioms: 85 Number of unprocessed: 84
0.12/0.38	# Tableaux proof search.
0.12/0.38	# APR header successfully linked.
0.12/0.38	# Hello from C++
0.12/0.38	# The folding up rule is enabled...
0.12/0.38	# Local unification is enabled...
0.12/0.38	# Any saturation attempts will use folding labels...
0.12/0.38	# 84 beginning clauses after preprocessing and clausification
0.12/0.38	# Creating start rules for all 1 conjectures.
0.12/0.38	# There are 1 start rule candidates:
0.12/0.38	# Found 13 unit axioms.
0.12/0.38	# 1 start rule tableaux created.
0.12/0.38	# 71 extension rule candidate clauses
0.12/0.38	# 13 unit axiom clauses
0.12/0.38	
0.12/0.38	# Requested 8, 32 cores available to the main process.
0.12/0.38	# There are not enough tableaux to fork, creating more from the initial 1
0.12/0.38	# Returning from population with 24 new_tableaux and 0 remaining starting tableaux.
0.12/0.38	# We now have 24 tableaux to operate on
0.19/0.50	# There were 1 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 0 free duplicated saturations.
0.19/0.50	# There were 1 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_22, negated_conjecture, (occurrence_of(esk7_0,tptp0))).
0.19/0.50	cnf(i_0_84, plain, (activity(tptp0))).
0.19/0.50	cnf(i_0_60, plain, (atomic(tptp4))).
0.19/0.50	cnf(i_0_53, plain, (atomic(tptp3))).
0.19/0.50	cnf(i_0_75, plain, (atomic(tptp2))).
0.19/0.50	cnf(i_0_54, plain, (atomic(tptp1))).
0.19/0.50	cnf(i_0_29, plain, (tptp3!=tptp4)).
0.19/0.50	cnf(i_0_59, plain, (~atomic(tptp0))).
0.19/0.50	cnf(i_0_78, plain, (tptp2!=tptp4)).
0.19/0.50	cnf(i_0_20, plain, (tptp2!=tptp3)).
0.19/0.50	cnf(i_0_32, plain, (tptp1!=tptp4)).
0.19/0.50	cnf(i_0_37, plain, (tptp1!=tptp3)).
0.19/0.50	cnf(i_0_39, plain, (tptp2!=tptp1)).
0.19/0.50	cnf(i_0_73, plain, (arboreal(X1)|~legal(X1))).
0.19/0.50	cnf(i_0_83, plain, (activity_occurrence(X1)|~occurrence_of(X1,X2))).
0.19/0.50	cnf(i_0_82, plain, (activity(X1)|~occurrence_of(X2,X1))).
0.19/0.50	cnf(i_0_7, plain, (activity(esk3_1(X1))|~activity_occurrence(X1))).
0.19/0.50	cnf(i_0_38, plain, (subactivity(X1,X1)|~activity(X1))).
0.19/0.50	cnf(i_0_72, plain, (legal(X1)|~precedes(X2,X1))).
0.19/0.50	cnf(i_0_35, plain, (~root(X1,X2)|~min_precedes(X3,X1,X2))).
0.19/0.50	cnf(i_0_16, plain, (~leaf(X1,X2)|~min_precedes(X1,X3,X2))).
0.19/0.50	cnf(i_0_10, plain, (activity_occurrence(X1)|~subactivity_occurrence(X2,X1))).
0.19/0.50	cnf(i_0_11, plain, (activity_occurrence(X1)|~subactivity_occurrence(X1,X2))).
0.19/0.50	cnf(i_0_74, plain, (legal(X1)|~root(X1,X2))).
0.19/0.50	cnf(i_0_6, plain, (occurrence_of(X1,esk3_1(X1))|~activity_occurrence(X1))).
0.19/0.50	cnf(i_0_76, plain, (atomic(X1)|~arboreal(X2)|~occurrence_of(X2,X1))).
0.19/0.50	cnf(i_0_5, plain, (occurrence_of(esk1_1(X1),tptp4)|~occurrence_of(X1,tptp0))).
0.19/0.50	cnf(i_0_77, plain, (arboreal(X1)|~atomic(X2)|~occurrence_of(X1,X2))).
0.19/0.50	cnf(i_0_2, plain, (occurrence_of(esk2_1(X1),tptp3)|~occurrence_of(X1,tptp0))).
0.19/0.50	cnf(i_0_62, plain, (~earlier(X1,X2)|~earlier(X2,X1))).
0.19/0.50	cnf(i_0_13, plain, (arboreal(X1)|~next_subocc(X2,X1,X3))).
0.19/0.50	cnf(i_0_12, plain, (arboreal(X1)|~next_subocc(X1,X2,X3))).
0.19/0.50	cnf(i_0_25, plain, (subactivity_occurrence(X1,X2)|~leaf_occ(X1,X2))).
0.19/0.50	cnf(i_0_47, plain, (subactivity_occurrence(X1,X2)|~root_occ(X1,X2))).
0.19/0.50	cnf(i_0_67, plain, (X1=X2|~occurrence_of(X3,X2)|~occurrence_of(X3,X1))).
0.19/0.50	cnf(i_0_71, plain, (earlier(X1,X2)|~precedes(X1,X2))).
0.19/0.50	cnf(i_0_3, plain, (leaf_occ(esk2_1(X1),X1)|~occurrence_of(X1,tptp0))).
0.19/0.50	cnf(i_0_1, plain, (root_occ(esk1_1(X1),X1)|~occurrence_of(X1,tptp0))).
0.19/0.50	cnf(i_0_21, plain, (root(X1,X2)|~legal(X1)|~atocc(X1,X2))).
0.19/0.50	cnf(i_0_66, plain, (atomic(esk18_2(X1,X2))|~atocc(X1,X2))).
0.19/0.50	cnf(i_0_61, plain, (~min_precedes(X1,X2,X3)|~root_occ(X2,X4)|~occurrence_of(X4,X3))).
0.19/0.50	cnf(i_0_69, plain, (~min_precedes(X1,X2,X3)|~leaf_occ(X1,X4)|~occurrence_of(X4,X3))).
0.19/0.50	cnf(i_0_81, plain, (precedes(X1,X2)|~min_precedes(X1,X2,X3))).
0.19/0.50	cnf(i_0_70, plain, (precedes(X1,X2)|~earlier(X1,X2)|~legal(X2))).
0.19/0.50	cnf(i_0_23, plain, (occurrence_of(X1,esk8_2(X2,X1))|~leaf_occ(X2,X1))).
0.19/0.50	cnf(i_0_48, plain, (occurrence_of(X1,esk14_2(X2,X1))|~root_occ(X2,X1))).
0.19/0.50	cnf(i_0_65, plain, (occurrence_of(X1,esk18_2(X1,X2))|~atocc(X1,X2))).
0.19/0.50	cnf(i_0_46, plain, (root(X1,esk14_2(X1,X2))|~root_occ(X1,X2))).
0.19/0.50	cnf(i_0_42, plain, (min_precedes(X1,X2,X3)|~next_subocc(X1,X2,X3))).
0.19/0.50	cnf(i_0_85, plain, (earlier(X1,X2)|~earlier(X3,X2)|~earlier(X1,X3))).
0.19/0.50	cnf(i_0_4, plain, (next_subocc(esk1_1(X1),esk2_1(X1),tptp0)|~occurrence_of(X1,tptp0))).
0.19/0.50	cnf(i_0_43, plain, (~min_precedes(X1,X2,X3)|~min_precedes(X4,X1,X3)|~next_subocc(X4,X2,X3))).
0.19/0.50	cnf(i_0_63, plain, (atocc(X1,X2)|~atomic(X3)|~subactivity(X2,X3)|~occurrence_of(X1,X3))).
0.19/0.50	cnf(i_0_36, plain, (X1=X2|~root_occ(X2,X3)|~root_occ(X1,X3)|~occurrence_of(X3,X4))).
0.19/0.50	cnf(i_0_26, plain, (leaf_occ(X1,X2)|~leaf(X1,X3)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,X3))).
0.19/0.50	cnf(i_0_15, plain, (atocc(X1,esk4_2(X2,X1))|~root(X1,X2))).
0.19/0.50	cnf(i_0_50, plain, (occurrence_of(esk15_3(X1,X2,X3),X1)|~min_precedes(X2,X3,X1))).
0.19/0.50	cnf(i_0_34, plain, (atomic(X1)|occurrence_of(esk11_2(X2,X1),X1)|~leaf(X2,X1))).
0.19/0.50	cnf(i_0_41, plain, (atomic(X1)|occurrence_of(esk12_2(X2,X1),X1)|~leaf(X2,X1))).
0.19/0.50	cnf(i_0_64, plain, (subactivity(X1,esk18_2(X2,X1))|~atocc(X2,X1))).
0.19/0.50	cnf(i_0_24, plain, (leaf(X1,esk8_2(X1,X2))|~leaf_occ(X1,X2))).
0.19/0.50	cnf(i_0_14, plain, (subactivity(esk4_2(X1,X2),X1)|~root(X2,X1))).
0.19/0.50	cnf(i_0_49, plain, (root_occ(X1,X2)|~root(X1,X3)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,X3))).
0.19/0.50	cnf(i_0_33, plain, (atomic(X1)|leaf_occ(X2,esk11_2(X2,X1))|~leaf(X2,X1))).
0.19/0.50	cnf(i_0_40, plain, (atomic(X1)|leaf_occ(X2,esk12_2(X2,X1))|~leaf(X2,X1))).
0.19/0.50	cnf(i_0_80, plain, (X1=X2|atomic(X3)|~leaf_occ(X2,X4)|~leaf_occ(X1,X4)|~occurrence_of(X4,X3))).
0.19/0.50	cnf(i_0_31, plain, (atomic(X1)|subactivity_occurrence(esk10_2(X1,X2),X2)|~occurrence_of(X2,X1))).
0.19/0.50	cnf(i_0_30, plain, (atomic(X1)|root(esk10_2(X1,X2),X1)|~occurrence_of(X2,X1))).
0.19/0.50	cnf(i_0_27, plain, (leaf_occ(X1,X2)|occurrence_of(esk9_1(X1),tptp1)|~subactivity_occurrence(X1,X2)|~arboreal(X1)|~occurrence_of(X2,tptp0))).
0.19/0.50	cnf(i_0_52, plain, (subactivity_occurrence(X1,esk15_3(X2,X3,X1))|~min_precedes(X3,X1,X2))).
0.19/0.50	cnf(i_0_51, plain, (subactivity_occurrence(X1,esk15_3(X2,X1,X3))|~min_precedes(X1,X3,X2))).
0.19/0.50	cnf(i_0_8, plain, (root_occ(X1,X2)|leaf_occ(X1,X2)|~subactivity_occurrence(X1,X2)|~arboreal(X1)|~occurrence_of(X2,tptp0))).
0.19/0.50	cnf(i_0_55, plain, (atocc(X1,esk16_3(X2,X1,X3))|~min_precedes(X1,X3,X2))).
0.19/0.50	cnf(i_0_56, plain, (atocc(X1,esk17_3(X2,X3,X1))|~min_precedes(X3,X1,X2))).
0.19/0.50	cnf(i_0_58, plain, (subactivity(esk16_3(X1,X2,X3),X1)|~min_precedes(X2,X3,X1))).
0.19/0.50	cnf(i_0_57, plain, (subactivity(esk17_3(X1,X2,X3),X1)|~min_precedes(X2,X3,X1))).
0.19/0.50	cnf(i_0_17, plain, (root(X1,X2)|min_precedes(esk6_2(X1,X2),X1,X2)|~leaf(X1,X2))).
0.19/0.50	cnf(i_0_19, plain, (leaf(X1,X2)|min_precedes(X1,esk5_2(X1,X2),X2)|~root(X1,X2))).
0.19/0.50	cnf(i_0_18, plain, (leaf(X1,X2)|min_precedes(X1,esk5_2(X1,X2),X2)|~min_precedes(X3,X1,X2))).
0.19/0.50	cnf(i_0_28, plain, (leaf_occ(X1,X2)|next_subocc(X1,esk9_1(X1),tptp0)|~subactivity_occurrence(X1,X2)|~arboreal(X1)|~occurrence_of(X2,tptp0))).
0.19/0.50	cnf(i_0_9, plain, (min_precedes(X1,X2,X3)|~min_precedes(X4,X2,X3)|~min_precedes(X1,X4,X3))).
0.19/0.50	cnf(i_0_68, plain, (X1=X2|min_precedes(X1,X2,X3)|min_precedes(X2,X1,X3)|~subactivity_occurrence(X2,X4)|~subactivity_occurrence(X1,X4)|~arboreal(X2)|~arboreal(X1)|~occurrence_of(X4,X3))).
0.19/0.50	cnf(i_0_45, plain, (min_precedes(X1,esk13_3(X1,X2,X3),X3)|next_subocc(X1,X2,X3)|~min_precedes(X1,X2,X3))).
0.19/0.50	cnf(i_0_44, plain, (min_precedes(esk13_3(X1,X2,X3),X2,X3)|next_subocc(X1,X2,X3)|~min_precedes(X1,X2,X3))).
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 5 steps
0.19/0.50	cnf(i_0_22, negated_conjecture, (occurrence_of(esk7_0,tptp0)), inference(start_rule)).
0.19/0.50	cnf(i_0_86, plain, (occurrence_of(esk7_0,tptp0)), inference(extension_rule, [i_0_30])).
0.19/0.50	cnf(i_0_220, plain, (atomic(tptp0)), inference(closure_rule, [i_0_59])).
0.19/0.50	cnf(i_0_221, plain, (root(esk10_2(tptp0,esk7_0),tptp0)), inference(extension_rule, [i_0_35])).
0.19/0.50	cnf(i_0_289, plain, (~min_precedes(X6,esk10_2(tptp0,esk7_0),tptp0)), inference(etableau_closure_rule, [i_0_289, ...])).
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.51	# Child (13111) has found a proof.
0.19/0.51	
0.19/0.51	# Proof search is over...
0.19/0.51	# Freeing feature tree
0.19/0.51	EOF