0.09/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/0.12	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.11/0.32	Computer   : n020.cluster.edu
0.11/0.32	Model      : x86_64 x86_64
0.11/0.32	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	RAMPerCPU  : 8042.1875MB
0.11/0.32	OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 960
0.11/0.32	% WCLimit    : 120
0.11/0.32	% DateTime   : Tue Aug  9 02:44:05 EDT 2022
0.11/0.32	% CPUTime    : 
0.11/0.36	# No SInE strategy applied
0.11/0.36	# Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
0.11/0.36	# and selection function SelectNewComplexAHP.
0.11/0.36	#
0.11/0.36	# Presaturation interreduction done
0.11/0.36	# Number of axioms: 88 Number of unprocessed: 88
0.11/0.36	# Tableaux proof search.
0.11/0.36	# APR header successfully linked.
0.11/0.36	# Hello from C++
0.11/0.36	# The folding up rule is enabled...
0.11/0.36	# Local unification is enabled...
0.11/0.36	# Any saturation attempts will use folding labels...
0.11/0.36	# 88 beginning clauses after preprocessing and clausification
0.11/0.36	# Creating start rules for all 3 conjectures.
0.11/0.36	# There are 3 start rule candidates:
0.11/0.36	# Found 13 unit axioms.
0.11/0.36	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.11/0.36	# 3 start rule tableaux created.
0.11/0.36	# 75 extension rule candidate clauses
0.11/0.36	# 13 unit axiom clauses
0.11/0.36	
0.11/0.36	# Requested 8, 32 cores available to the main process.
0.11/0.36	# There are not enough tableaux to fork, creating more from the initial 3
0.11/0.36	# Returning from population with 15 new_tableaux and 0 remaining starting tableaux.
0.11/0.36	# We now have 15 tableaux to operate on
0.18/0.47	# There were 1 total branch saturation attempts.
0.18/0.47	# There were 0 of these attempts blocked.
0.18/0.47	# There were 0 deferred branch saturation attempts.
0.18/0.47	# There were 0 free duplicated saturations.
0.18/0.47	# There were 1 total successful branch saturations.
0.18/0.47	# There were 0 successful branch saturations in interreduction.
0.18/0.47	# There were 0 successful branch saturations on the branch.
0.18/0.47	# There were 1 successful branch saturations after the branch.
0.18/0.47	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.47	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.47	# Begin clausification derivation
0.18/0.47	
0.18/0.47	# End clausification derivation
0.18/0.47	# Begin listing active clauses obtained from FOF to CNF conversion
0.18/0.47	cnf(i_0_88, negated_conjecture, (occurrence_of(esk19_0,tptp0))).
0.18/0.47	cnf(i_0_3, plain, (atomic(tptp3))).
0.18/0.47	cnf(i_0_78, plain, (atomic(tptp4))).
0.18/0.47	cnf(i_0_23, plain, (atomic(tptp2))).
0.18/0.47	cnf(i_0_79, plain, (atomic(tptp1))).
0.18/0.47	cnf(i_0_70, plain, (activity(tptp0))).
0.18/0.47	cnf(i_0_77, plain, (tptp2!=tptp3)).
0.18/0.47	cnf(i_0_47, plain, (tptp1!=tptp3)).
0.18/0.47	cnf(i_0_34, plain, (tptp1!=tptp2)).
0.18/0.47	cnf(i_0_2, plain, (tptp4!=tptp3)).
0.18/0.47	cnf(i_0_80, plain, (tptp4!=tptp2)).
0.18/0.47	cnf(i_0_35, plain, (tptp4!=tptp1)).
0.18/0.47	cnf(i_0_12, plain, (~atomic(tptp0))).
0.18/0.47	cnf(i_0_72, plain, (~min_precedes(X1,X2,X3)|~atomic(X3))).
0.18/0.47	cnf(i_0_61, plain, (occurrence_of(esk13_1(X1),tptp3)|~occurrence_of(X1,tptp0))).
0.18/0.47	cnf(i_0_65, plain, (arboreal(X1)|~legal(X1))).
0.18/0.47	cnf(i_0_74, plain, (activity(esk17_1(X1))|~activity_occurrence(X1))).
0.18/0.47	cnf(i_0_27, plain, (activity_occurrence(X1)|~occurrence_of(X1,X2))).
0.18/0.47	cnf(i_0_68, plain, (legal(X1)|~precedes(X2,X1))).
0.18/0.47	cnf(i_0_8, plain, (~root(X1,X2)|~min_precedes(X3,X1,X2))).
0.18/0.47	cnf(i_0_31, plain, (~leaf(X1,X2)|~min_precedes(X1,X3,X2))).
0.18/0.47	cnf(i_0_71, plain, (subactivity(X1,X1)|~activity(X1))).
0.18/0.47	cnf(i_0_26, plain, (activity(X1)|~occurrence_of(X2,X1))).
0.18/0.47	cnf(i_0_82, plain, (activity_occurrence(X1)|~subactivity_occurrence(X2,X1))).
0.18/0.47	cnf(i_0_81, plain, (activity_occurrence(X1)|~subactivity_occurrence(X1,X2))).
0.18/0.47	cnf(i_0_41, plain, (legal(X1)|~root(X1,X2))).
0.18/0.47	cnf(i_0_73, plain, (occurrence_of(X1,esk17_1(X1))|~activity_occurrence(X1))).
0.18/0.47	cnf(i_0_17, plain, (atomic(X1)|~arboreal(X2)|~occurrence_of(X2,X1))).
0.18/0.47	cnf(i_0_20, plain, (subactivity_occurrence(X1,X2)|~leaf_occ(X1,X2))).
0.18/0.47	cnf(i_0_36, plain, (~earlier(X1,X2)|~earlier(X2,X1))).
0.18/0.47	cnf(i_0_39, plain, (subactivity_occurrence(X1,X2)|~root_occ(X1,X2))).
0.18/0.47	cnf(i_0_67, plain, (earlier(X1,X2)|~precedes(X1,X2))).
0.18/0.47	cnf(i_0_18, plain, (arboreal(X1)|~atomic(X2)|~occurrence_of(X1,X2))).
0.18/0.47	cnf(i_0_60, plain, (occurrence_of(esk14_1(X1),tptp4)|~occurrence_of(X1,tptp0))).
0.18/0.47	cnf(i_0_86, negated_conjecture, (~root_occ(X1,esk19_0)|~leaf_occ(X2,esk19_0)|~min_precedes(X1,X2,tptp0)|~occurrence_of(X1,tptp3)|~occurrence_of(X2,tptp2))).
0.18/0.47	cnf(i_0_87, negated_conjecture, (~root_occ(X1,esk19_0)|~leaf_occ(X2,esk19_0)|~min_precedes(X1,X2,tptp0)|~occurrence_of(X1,tptp3)|~occurrence_of(X2,tptp1))).
0.18/0.47	cnf(i_0_58, plain, (leaf_occ(esk15_1(X1),X1)|~occurrence_of(X1,tptp0))).
0.18/0.47	cnf(i_0_55, plain, (root_occ(esk13_1(X1),X1)|~occurrence_of(X1,tptp0))).
0.18/0.47	cnf(i_0_64, plain, (legal(X1)|~legal(X2)|~earlier(X1,X2))).
0.18/0.47	cnf(i_0_84, plain, (X1=X2|~occurrence_of(X3,X2)|~occurrence_of(X3,X1))).
0.18/0.47	cnf(i_0_83, plain, (root(X1,X2)|~legal(X1)|~atocc(X1,X2))).
0.18/0.47	cnf(i_0_14, plain, (atomic(esk4_2(X1,X2))|~atocc(X1,X2))).
0.18/0.47	cnf(i_0_46, plain, (precedes(X1,X2)|~min_precedes(X1,X2,X3))).
0.18/0.47	cnf(i_0_66, plain, (precedes(X1,X2)|~legal(X2)|~earlier(X1,X2))).
0.18/0.47	cnf(i_0_22, plain, (occurrence_of(X1,esk5_2(X2,X1))|~leaf_occ(X2,X1))).
0.18/0.47	cnf(i_0_40, plain, (occurrence_of(X1,esk8_2(X2,X1))|~root_occ(X2,X1))).
0.18/0.47	cnf(i_0_59, plain, (occurrence_of(esk15_1(X1),tptp1)|occurrence_of(esk15_1(X1),tptp2)|~occurrence_of(X1,tptp0))).
0.18/0.47	cnf(i_0_15, plain, (occurrence_of(X1,esk4_2(X1,X2))|~atocc(X1,X2))).
0.18/0.47	cnf(i_0_38, plain, (root(X1,esk8_2(X1,X2))|~root_occ(X1,X2))).
0.18/0.47	cnf(i_0_25, plain, (subactivity_occurrence(X1,X2)|~subactivity_occurrence(X1,X3)|~subactivity_occurrence(X3,X2))).
0.18/0.47	cnf(i_0_16, plain, (subactivity(X1,esk4_2(X2,X1))|~atocc(X2,X1))).
0.18/0.47	cnf(i_0_50, plain, (min_precedes(X1,X2,X3)|~next_subocc(X1,X2,X3))).
0.18/0.47	cnf(i_0_51, plain, (~next_subocc(X1,X2,X3)|~min_precedes(X4,X2,X3)|~min_precedes(X1,X4,X3))).
0.18/0.47	cnf(i_0_19, plain, (leaf_occ(X1,X2)|~leaf(X1,X3)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,X3))).
0.18/0.47	cnf(i_0_13, plain, (atocc(X1,X2)|~subactivity(X2,X3)|~atomic(X3)|~occurrence_of(X1,X3))).
0.18/0.47	cnf(i_0_21, plain, (leaf(X1,esk5_2(X1,X2))|~leaf_occ(X1,X2))).
0.18/0.47	cnf(i_0_9, plain, (occurrence_of(esk3_3(X1,X2,X3),X1)|~min_precedes(X2,X3,X1))).
0.18/0.47	cnf(i_0_56, plain, (next_subocc(esk13_1(X1),esk14_1(X1),tptp0)|~occurrence_of(X1,tptp0))).
0.18/0.47	cnf(i_0_57, plain, (next_subocc(esk14_1(X1),esk15_1(X1),tptp0)|~occurrence_of(X1,tptp0))).
0.18/0.47	cnf(i_0_37, plain, (root_occ(X1,X2)|~root(X1,X3)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,X3))).
0.18/0.47	cnf(i_0_24, plain, (earlier(X1,X2)|~earlier(X1,X3)|~earlier(X3,X2))).
0.18/0.47	cnf(i_0_44, plain, (atocc(X1,esk10_2(X2,X1))|~root(X1,X2))).
0.18/0.47	cnf(i_0_45, plain, (subactivity(esk10_2(X1,X2),X1)|~root(X2,X1))).
0.18/0.47	cnf(i_0_53, plain, (subactivity_occurrence(X1,esk12_2(X2,X1))|atomic(X2)|~root(X1,X2))).
0.18/0.47	cnf(i_0_52, plain, (atomic(X1)|occurrence_of(esk12_2(X1,X2),X1)|~root(X2,X1))).
0.18/0.47	cnf(i_0_76, plain, (subactivity_occurrence(esk18_2(X1,X2),X2)|atomic(X1)|~occurrence_of(X2,X1))).
0.18/0.47	cnf(i_0_75, plain, (root(esk18_2(X1,X2),X1)|atomic(X1)|~occurrence_of(X2,X1))).
0.18/0.47	cnf(i_0_85, plain, (min_precedes(X1,X2,X3)|~precedes(X1,X2)|~min_precedes(X1,X4,X3)|~min_precedes(X2,X4,X3))).
0.18/0.47	cnf(i_0_28, plain, (min_precedes(X1,X2,X3)|~precedes(X1,X2)|~min_precedes(X4,X2,X3)|~min_precedes(X4,X1,X3))).
0.18/0.47	cnf(i_0_11, plain, (subactivity_occurrence(X1,esk3_3(X2,X3,X1))|~min_precedes(X3,X1,X2))).
0.18/0.47	cnf(i_0_10, plain, (subactivity_occurrence(X1,esk3_3(X2,X1,X3))|~min_precedes(X1,X3,X2))).
0.18/0.47	cnf(i_0_69, plain, (X1=X2|earlier(X1,X2)|earlier(X2,X1)|~earlier(X2,X3)|~earlier(X1,X3))).
0.18/0.47	cnf(i_0_6, plain, (atocc(X1,esk1_3(X2,X1,X3))|~min_precedes(X1,X3,X2))).
0.18/0.47	cnf(i_0_54, plain, (subactivity_occurrence(X1,X2)|~min_precedes(X1,X3,X4)|~subactivity_occurrence(X3,X2)|~occurrence_of(X2,X4))).
0.18/0.47	cnf(i_0_1, plain, (subactivity(X1,X2)|atomic(X1)|~subactivity_occurrence(X3,X4)|~occurrence_of(X4,X2)|~occurrence_of(X3,X1))).
0.18/0.47	cnf(i_0_5, plain, (atocc(X1,esk2_3(X2,X3,X1))|~min_precedes(X3,X1,X2))).
0.18/0.47	cnf(i_0_7, plain, (subactivity(esk1_3(X1,X2,X3),X1)|~min_precedes(X2,X3,X1))).
0.18/0.47	cnf(i_0_4, plain, (subactivity(esk2_3(X1,X2,X3),X1)|~min_precedes(X2,X3,X1))).
0.18/0.47	cnf(i_0_62, plain, (root(esk16_3(X1,X2,X3),X3)|~min_precedes(X1,X2,X3))).
0.18/0.47	cnf(i_0_30, plain, (root(X1,X2)|min_precedes(esk7_2(X1,X2),X1,X2)|~leaf(X1,X2))).
0.18/0.47	cnf(i_0_63, plain, (min_precedes(esk16_3(X1,X2,X3),X2,X3)|~min_precedes(X1,X2,X3))).
0.18/0.47	cnf(i_0_33, plain, (leaf(X1,X2)|min_precedes(X1,esk6_2(X1,X2),X2)|~root(X1,X2))).
0.18/0.47	cnf(i_0_32, plain, (leaf(X1,X2)|min_precedes(X1,esk6_2(X1,X2),X2)|~min_precedes(X3,X1,X2))).
0.18/0.47	cnf(i_0_49, plain, (next_subocc(X1,X2,X3)|min_precedes(X1,esk11_3(X1,X2,X3),X3)|~min_precedes(X1,X2,X3))).
0.18/0.47	cnf(i_0_43, plain, (subactivity_occurrence(X1,X2)|~subactivity(X3,X4)|~subactivity_occurrence(esk9_4(X3,X4,X1,X2),X1)|~occurrence_of(X2,X4)|~occurrence_of(X1,X3))).
0.18/0.47	cnf(i_0_48, plain, (next_subocc(X1,X2,X3)|min_precedes(esk11_3(X1,X2,X3),X2,X3)|~min_precedes(X1,X2,X3))).
0.18/0.47	cnf(i_0_42, plain, (subactivity_occurrence(esk9_4(X1,X2,X3,X4),X4)|subactivity_occurrence(X3,X4)|~subactivity(X1,X2)|~occurrence_of(X4,X2)|~occurrence_of(X3,X1))).
0.18/0.47	cnf(i_0_29, plain, (X1=X2|min_precedes(X1,X2,X3)|min_precedes(X2,X1,X3)|~arboreal(X2)|~arboreal(X1)|~subactivity_occurrence(X2,X4)|~subactivity_occurrence(X1,X4)|~occurrence_of(X4,X3))).
0.18/0.47	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.18/0.47	# Begin printing tableau
0.18/0.47	# Found 4 steps
0.18/0.47	cnf(i_0_88, negated_conjecture, (occurrence_of(esk19_0,tptp0)), inference(start_rule)).
0.18/0.47	cnf(i_0_99, plain, (occurrence_of(esk19_0,tptp0)), inference(extension_rule, [i_0_61])).
0.18/0.47	cnf(i_0_717, plain, (occurrence_of(esk13_1(esk19_0),tptp3)), inference(extension_rule, [i_0_27])).
0.18/0.47	cnf(i_0_725, plain, (activity_occurrence(esk13_1(esk19_0))), inference(etableau_closure_rule, [i_0_725, ...])).
0.18/0.47	# End printing tableau
0.18/0.47	# SZS output end
0.18/0.47	# Branches closed with saturation will be marked with an "s"
0.18/0.47	# Child (1854) has found a proof.
0.18/0.47	
0.18/0.47	# Proof search is over...
0.18/0.47	# Freeing feature tree
0.18/0.47	EOF