0.03/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/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.33	Computer   : n016.cluster.edu
0.11/0.33	Model      : x86_64 x86_64
0.11/0.33	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.33	RAMPerCPU  : 8042.1875MB
0.11/0.33	OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.33	% CPULimit   : 960
0.11/0.33	% WCLimit    : 120
0.11/0.33	% DateTime   : Tue Aug  9 05:08:57 EDT 2022
0.11/0.33	% CPUTime    : 
0.18/0.36	# No SInE strategy applied
0.18/0.36	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
0.18/0.36	# and selection function SelectComplexExceptUniqMaxHorn.
0.18/0.36	#
0.18/0.36	# Presaturation interreduction done
0.18/0.36	# Number of axioms: 63 Number of unprocessed: 62
0.18/0.36	# Tableaux proof search.
0.18/0.36	# APR header successfully linked.
0.18/0.36	# Hello from C++
0.18/0.36	# The folding up rule is enabled...
0.18/0.36	# Local unification is enabled...
0.18/0.36	# Any saturation attempts will use folding labels...
0.18/0.36	# 62 beginning clauses after preprocessing and clausification
0.18/0.36	# Creating start rules for all 4 conjectures.
0.18/0.36	# There are 4 start rule candidates:
0.18/0.36	# Found 6 unit axioms.
0.18/0.36	# Unsuccessfully attempted saturation on 1 start tableaux, moving on.
0.18/0.36	# 4 start rule tableaux created.
0.18/0.36	# 56 extension rule candidate clauses
0.18/0.36	# 6 unit axiom clauses
0.18/0.36	
0.18/0.36	# Requested 8, 32 cores available to the main process.
0.18/0.36	# There are not enough tableaux to fork, creating more from the initial 4
0.18/0.36	# Returning from population with 18 new_tableaux and 0 remaining starting tableaux.
0.18/0.36	# We now have 18 tableaux to operate on
1.74/0.58	# There were 4 total branch saturation attempts.
1.74/0.58	# There were 0 of these attempts blocked.
1.74/0.58	# There were 0 deferred branch saturation attempts.
1.74/0.58	# There were 0 free duplicated saturations.
1.74/0.58	# There were 4 total successful branch saturations.
1.74/0.58	# There were 0 successful branch saturations in interreduction.
1.74/0.58	# There were 0 successful branch saturations on the branch.
1.74/0.58	# There were 4 successful branch saturations after the branch.
1.74/0.58	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
1.74/0.58	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
1.74/0.58	# Begin clausification derivation
1.74/0.58	
1.74/0.58	# End clausification derivation
1.74/0.58	# Begin listing active clauses obtained from FOF to CNF conversion
1.74/0.58	cnf(i_0_49, negated_conjecture, (complete)).
1.74/0.58	cnf(i_0_48, negated_conjecture, (precedes(esk9_0,esk10_0,esk11_0))).
1.74/0.58	cnf(i_0_47, negated_conjecture, (shortest_path(esk7_0,esk8_0,esk11_0))).
1.74/0.58	cnf(i_0_57, plain, (less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)))).
1.74/0.58	cnf(i_0_2, plain, (~sequential(X1,X1))).
1.74/0.58	cnf(i_0_19, plain, (~shortest_path(X1,X1,X2))).
1.74/0.58	cnf(i_0_29, plain, (tail_of(X1)!=head_of(X1)|~edge(X1))).
1.74/0.58	cnf(i_0_46, negated_conjecture, (tail_of(X1)!=head_of(esk10_0)|tail_of(esk9_0)!=head_of(X1)|~edge(X1))).
1.74/0.58	cnf(i_0_18, plain, (vertex(head_of(X1))|~edge(X1))).
1.74/0.58	cnf(i_0_17, plain, (vertex(tail_of(X1))|~edge(X1))).
1.74/0.58	cnf(i_0_1, plain, (edge(X1)|~sequential(X2,X1))).
1.74/0.58	cnf(i_0_4, plain, (edge(X1)|~sequential(X1,X2))).
1.74/0.58	cnf(i_0_60, plain, (edge(X1)|~triangle(X2,X3,X1))).
1.74/0.58	cnf(i_0_64, plain, (edge(X1)|~triangle(X2,X1,X3))).
1.74/0.58	cnf(i_0_59, plain, (edge(X1)|~triangle(X1,X2,X3))).
1.74/0.58	cnf(i_0_3, plain, (tail_of(X1)=head_of(X2)|~sequential(X2,X1))).
1.74/0.58	cnf(i_0_62, plain, (sequential(X1,X2)|~triangle(X3,X1,X2))).
1.74/0.58	cnf(i_0_61, plain, (sequential(X1,X2)|~triangle(X2,X3,X1))).
1.74/0.58	cnf(i_0_63, plain, (sequential(X1,X2)|~triangle(X1,X2,X3))).
1.74/0.58	cnf(i_0_31, plain, (vertex(X1)|~path(X2,X1,X3))).
1.74/0.58	cnf(i_0_30, plain, (vertex(X1)|~path(X1,X2,X3))).
1.74/0.58	cnf(i_0_21, plain, (path(X1,X2,X3)|~shortest_path(X1,X2,X3))).
1.74/0.58	cnf(i_0_45, plain, (edge(X1)|~on_path(X1,X2)|~path(X3,X4,X2))).
1.74/0.58	cnf(i_0_32, plain, (edge(esk5_3(X1,X2,X3))|~path(X1,X2,X3))).
1.74/0.58	cnf(i_0_14, plain, (vertex(X1)|~in_path(X1,X2)|~path(X3,X4,X2))).
1.74/0.58	cnf(i_0_41, plain, (~shortest_path(X1,X2,X3)|~precedes(X4,X5,X3)|~precedes(X5,X4,X3))).
1.74/0.58	cnf(i_0_5, plain, (X1=X2|sequential(X1,X2)|tail_of(X2)!=head_of(X1)|~edge(X2)|~edge(X1))).
1.74/0.58	cnf(i_0_54, plain, (length_of(X1)=number_of_in(edges,X1)|~path(X2,X3,X1))).
1.74/0.58	cnf(i_0_28, plain, (on_path(X1,X2)|~precedes(X3,X1,X2)|~path(X4,X5,X2))).
1.74/0.58	cnf(i_0_24, plain, (on_path(X1,X2)|~precedes(X1,X3,X2)|~path(X4,X5,X2))).
1.74/0.58	cnf(i_0_44, plain, (in_path(head_of(X1),X2)|~on_path(X1,X2)|~path(X3,X4,X2))).
1.74/0.58	cnf(i_0_33, plain, (tail_of(esk5_3(X1,X2,X3))=X1|~path(X1,X2,X3))).
1.74/0.58	cnf(i_0_6, plain, (X1=X2|edge(esk1_2(X1,X2))|~vertex(X2)|~vertex(X1))).
1.74/0.58	cnf(i_0_42, plain, (head_of(X1)!=head_of(X2)|tail_of(X3)!=tail_of(X1)|~shortest_path(X4,X5,X6)|~precedes(X3,X2,X6))).
1.74/0.58	cnf(i_0_43, plain, (in_path(tail_of(X1),X2)|~on_path(X1,X2)|~path(X3,X4,X2))).
1.74/0.58	cnf(i_0_9, plain, (tail_of(esk1_2(X1,X2))=X1|head_of(esk1_2(X1,X2))=X1|X1=X2|~vertex(X2)|~vertex(X1))).
1.74/0.58	cnf(i_0_55, plain, (minus(length_of(X1),n1)=number_of_in(sequential_pairs,X1)|~path(X2,X3,X1))).
1.74/0.58	cnf(i_0_27, plain, (~precedes(X1,X2,X3)|~precedes(X4,X2,X3)|~path(X5,X6,X3)|~sequential(X4,X1)|~sequential(X4,X2))).
1.74/0.58	cnf(i_0_58, plain, (triangle(X1,X2,X3)|~sequential(X3,X1)|~sequential(X1,X2)|~sequential(X2,X3))).
1.74/0.58	cnf(i_0_50, plain, (number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|~triangle(esk12_1(X1),esk13_1(X1),X2)|~path(X3,X4,X1))).
1.74/0.58	cnf(i_0_16, plain, (on_path(esk2_4(X1,X2,X3,X4),X3)|~in_path(X4,X3)|~path(X1,X2,X3))).
1.74/0.58	cnf(i_0_8, plain, (tail_of(esk1_2(X1,X2))=X2|head_of(esk1_2(X1,X2))=X2|X1=X2|~vertex(X2)|~vertex(X1))).
1.74/0.58	cnf(i_0_20, plain, (less_or_equal(length_of(X1),length_of(X2))|~shortest_path(X3,X4,X1)|~path(X3,X4,X2))).
1.74/0.58	cnf(i_0_51, plain, (number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|on_path(esk12_1(X1),X1)|~path(X2,X3,X1))).
1.74/0.58	cnf(i_0_53, plain, (number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|on_path(esk13_1(X1),X1)|~path(X2,X3,X1))).
1.74/0.58	cnf(i_0_22, plain, (X1=X2|shortest_path(X1,X2,X3)|~less_or_equal(length_of(X3),length_of(esk3_3(X1,X2,X3)))|~path(X1,X2,X3))).
1.74/0.58	cnf(i_0_10, plain, (head_of(esk1_2(X1,X2))=X2|head_of(esk1_2(X1,X2))=X1|X1=X2|~vertex(X2)|~vertex(X1))).
1.74/0.58	cnf(i_0_52, plain, (number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|sequential(esk12_1(X1),esk13_1(X1))|~path(X2,X3,X1))).
1.74/0.58	cnf(i_0_12, plain, (precedes(X1,X2,X3)|~on_path(X2,X3)|~on_path(X1,X3)|~path(X4,X5,X3)|~sequential(X1,X2))).
1.74/0.58	cnf(i_0_25, plain, (sequential(X1,esk4_3(X2,X1,X3))|sequential(X1,X3)|~precedes(X1,X3,X2)|~path(X4,X5,X2))).
1.74/0.58	cnf(i_0_26, plain, (precedes(esk4_3(X1,X2,X3),X3,X1)|sequential(X2,X3)|~precedes(X2,X3,X1)|~path(X4,X5,X1))).
1.74/0.58	cnf(i_0_13, plain, (precedes(X1,X2,X3)|~on_path(X1,X3)|~precedes(X4,X2,X3)|~path(X5,X6,X3)|~sequential(X1,X4))).
1.74/0.58	cnf(i_0_7, plain, (tail_of(esk1_2(X1,X2))=X2|tail_of(esk1_2(X1,X2))=X1|X1=X2|~vertex(X2)|~vertex(X1))).
1.74/0.58	cnf(i_0_23, plain, (X1=X2|shortest_path(X1,X2,X3)|path(X1,X2,esk3_3(X1,X2,X3))|~path(X1,X2,X3))).
1.74/0.58	cnf(i_0_15, plain, (tail_of(esk2_4(X1,X2,X3,X4))=X4|head_of(esk2_4(X1,X2,X3,X4))=X4|~in_path(X4,X3)|~path(X1,X2,X3))).
1.74/0.58	cnf(i_0_39, plain, (path(tail_of(X1),head_of(X1),path_cons(X1,empty))|~edge(X1))).
1.74/0.58	cnf(i_0_40, plain, (path(tail_of(X1),X2,path_cons(X1,X3))|~path(head_of(X1),X2,X3)|~edge(X1))).
1.74/0.58	cnf(i_0_38, plain, (path_cons(esk5_3(X1,X2,X3),empty)!=X3|path_cons(esk5_3(X1,X2,X3),X4)!=X3|head_of(esk5_3(X1,X2,X3))!=X2|~path(head_of(esk5_3(X1,X2,X3)),X2,X4)|~path(X1,X2,X3))).
1.74/0.58	cnf(i_0_35, plain, (path_cons(esk5_3(X1,X2,X3),esk6_3(X1,X2,X3))=X3|head_of(esk5_3(X1,X2,X3))=X2|~path(X1,X2,X3))).
1.74/0.58	cnf(i_0_37, plain, (path_cons(esk5_3(X1,X2,X3),esk6_3(X1,X2,X3))=X3|path_cons(esk5_3(X1,X2,X3),empty)=X3|~path(X1,X2,X3))).
1.74/0.58	cnf(i_0_34, plain, (head_of(esk5_3(X1,X2,X3))=X2|path(head_of(esk5_3(X1,X2,X3)),X2,esk6_3(X1,X2,X3))|~path(X1,X2,X3))).
1.74/0.58	cnf(i_0_36, plain, (path_cons(esk5_3(X1,X2,X3),empty)=X3|path(head_of(esk5_3(X1,X2,X3)),X2,esk6_3(X1,X2,X3))|~path(X1,X2,X3))).
1.74/0.58	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
1.74/0.58	# Begin printing tableau
1.74/0.58	# Found 8 steps
1.74/0.58	cnf(i_0_48, negated_conjecture, (precedes(esk9_0,esk10_0,esk11_0)), inference(start_rule)).
1.74/0.58	cnf(i_0_76, plain, (precedes(esk9_0,esk10_0,esk11_0)), inference(extension_rule, [i_0_41])).
1.74/0.58	cnf(i_0_290, plain, (~shortest_path(esk7_0,esk8_0,esk11_0)), inference(closure_rule, [i_0_47])).
1.74/0.58	cnf(i_0_292, plain, (~precedes(esk10_0,esk9_0,esk11_0)), inference(extension_rule, [i_0_12])).
1.74/0.58	cnf(i_0_409, plain, (~on_path(esk9_0,esk11_0)), inference(etableau_closure_rule, [i_0_409, ...])).
1.74/0.58	cnf(i_0_410, plain, (~on_path(esk10_0,esk11_0)), inference(etableau_closure_rule, [i_0_410, ...])).
1.74/0.58	cnf(i_0_411, plain, (~path(X9,X10,esk11_0)), inference(etableau_closure_rule, [i_0_411, ...])).
1.74/0.58	cnf(i_0_412, plain, (~sequential(esk10_0,esk9_0)), inference(etableau_closure_rule, [i_0_412, ...])).
1.74/0.58	# End printing tableau
1.74/0.58	# SZS output end
1.74/0.58	# Branches closed with saturation will be marked with an "s"
1.74/0.58	# Child (27056) has found a proof.
1.74/0.58	
1.74/0.58	# Proof search is over...
1.74/0.58	# Freeing feature tree
1.74/0.58	EOF