TSTP Solution File: GRA002+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRA002+3 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 07:16:15 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRA002+3 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.10/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue May 31 03:07:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 62 Number of unprocessed: 62
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 62 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 3 conjectures.
% 0.13/0.38 # There are 3 start rule candidates:
% 0.13/0.38 # Found 6 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 3 start rule tableaux created.
% 0.13/0.38 # 56 extension rule candidate clauses
% 0.13/0.38 # 6 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 3
% 0.13/0.38 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 10 tableaux to operate on
% 0.13/0.40 # Creating equality axioms
% 0.13/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.44 # There were 5 total branch saturation attempts.
% 0.20/0.44 # There were 0 of these attempts blocked.
% 0.20/0.44 # There were 0 deferred branch saturation attempts.
% 0.20/0.44 # There were 0 free duplicated saturations.
% 0.20/0.44 # There were 5 total successful branch saturations.
% 0.20/0.44 # There were 0 successful branch saturations in interreduction.
% 0.20/0.44 # There were 0 successful branch saturations on the branch.
% 0.20/0.44 # There were 5 successful branch saturations after the branch.
% 0.20/0.44 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.44 # Begin clausification derivation
% 0.20/0.44
% 0.20/0.44 # End clausification derivation
% 0.20/0.44 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.44 cnf(i_0_63, negated_conjecture, (complete)).
% 0.20/0.44 cnf(i_0_62, negated_conjecture, (shortest_path(esk11_0,esk12_0,esk10_0))).
% 0.20/0.44 cnf(i_0_59, plain, (less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)))).
% 0.20/0.44 cnf(i_0_61, negated_conjecture, (~less_or_equal(minus(length_of(esk10_0),n1),number_of_in(triangles,graph)))).
% 0.20/0.44 cnf(i_0_29, plain, (~sequential(X1,X1))).
% 0.20/0.44 cnf(i_0_42, plain, (~shortest_path(X1,X1,X2))).
% 0.20/0.44 cnf(i_0_3, plain, (vertex(head_of(X1))|~edge(X1))).
% 0.20/0.44 cnf(i_0_2, plain, (vertex(tail_of(X1))|~edge(X1))).
% 0.20/0.44 cnf(i_0_1, plain, (tail_of(X1)!=head_of(X1)|~edge(X1))).
% 0.20/0.44 cnf(i_0_50, plain, (edge(X1)|~triangle(X2,X3,X1))).
% 0.20/0.44 cnf(i_0_51, plain, (edge(X1)|~triangle(X2,X1,X3))).
% 0.20/0.44 cnf(i_0_52, plain, (edge(X1)|~triangle(X1,X2,X3))).
% 0.20/0.44 cnf(i_0_30, plain, (edge(X1)|~sequential(X2,X1))).
% 0.20/0.44 cnf(i_0_31, plain, (edge(X1)|~sequential(X1,X2))).
% 0.20/0.44 cnf(i_0_28, plain, (tail_of(X1)=head_of(X2)|~sequential(X2,X1))).
% 0.20/0.44 cnf(i_0_48, plain, (sequential(X1,X2)|~triangle(X3,X1,X2))).
% 0.20/0.44 cnf(i_0_47, plain, (sequential(X1,X2)|~triangle(X2,X3,X1))).
% 0.20/0.44 cnf(i_0_49, plain, (sequential(X1,X2)|~triangle(X1,X2,X3))).
% 0.20/0.44 cnf(i_0_19, plain, (vertex(X1)|~path(X2,X1,X3))).
% 0.20/0.44 cnf(i_0_20, plain, (vertex(X1)|~path(X1,X2,X3))).
% 0.20/0.44 cnf(i_0_43, plain, (path(X1,X2,X3)|~shortest_path(X1,X2,X3))).
% 0.20/0.44 cnf(i_0_53, plain, (length_of(X1)=number_of_in(edges,X1)|~path(X2,X3,X1))).
% 0.20/0.44 cnf(i_0_54, plain, (minus(length_of(X1),n1)=number_of_in(sequential_pairs,X1)|~path(X2,X3,X1))).
% 0.20/0.44 cnf(i_0_23, plain, (edge(X1)|~on_path(X1,X2)|~path(X3,X4,X2))).
% 0.20/0.44 cnf(i_0_26, plain, (vertex(X1)|~in_path(X1,X2)|~path(X3,X4,X2))).
% 0.20/0.44 cnf(i_0_27, plain, (X1=X2|sequential(X1,X2)|tail_of(X2)!=head_of(X1)|~edge(X2)|~edge(X1))).
% 0.20/0.44 cnf(i_0_18, plain, (edge(esk2_3(X1,X2,X3))|~path(X1,X2,X3))).
% 0.20/0.44 cnf(i_0_44, plain, (~shortest_path(X1,X2,X3)|~precedes(X4,X5,X3)|~precedes(X5,X4,X3))).
% 0.20/0.44 cnf(i_0_37, plain, (on_path(X1,X2)|~precedes(X3,X1,X2)|~path(X4,X5,X2))).
% 0.20/0.44 cnf(i_0_38, plain, (on_path(X1,X2)|~precedes(X1,X3,X2)|~path(X4,X5,X2))).
% 0.20/0.44 cnf(i_0_22, plain, (in_path(head_of(X1),X2)|~on_path(X1,X2)|~path(X3,X4,X2))).
% 0.20/0.44 cnf(i_0_17, plain, (tail_of(esk2_3(X1,X2,X3))=X1|~path(X1,X2,X3))).
% 0.20/0.44 cnf(i_0_41, plain, (less_or_equal(length_of(X1),length_of(X2))|~shortest_path(X3,X4,X1)|~path(X3,X4,X2))).
% 0.20/0.44 cnf(i_0_9, plain, (X1=X2|edge(esk1_2(X1,X2))|~vertex(X2)|~vertex(X1))).
% 0.20/0.44 cnf(i_0_21, plain, (in_path(tail_of(X1),X2)|~on_path(X1,X2)|~path(X3,X4,X2))).
% 0.20/0.44 cnf(i_0_55, plain, (number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|~triangle(esk7_1(X1),esk8_1(X1),X2)|~path(X3,X4,X1))).
% 0.20/0.44 cnf(i_0_7, plain, (head_of(esk1_2(X1,X2))=X2|head_of(esk1_2(X1,X2))=X1|X2=X1|~vertex(X1)|~vertex(X2))).
% 0.20/0.44 cnf(i_0_58, plain, (number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|on_path(esk7_1(X1),X1)|~path(X2,X3,X1))).
% 0.20/0.44 cnf(i_0_36, plain, (~precedes(X1,X2,X3)|~precedes(X4,X2,X3)|~sequential(X4,X1)|~sequential(X4,X2)|~path(X5,X6,X3))).
% 0.20/0.44 cnf(i_0_45, plain, (head_of(X1)!=head_of(X2)|tail_of(X1)!=tail_of(X3)|~shortest_path(X4,X5,X6)|~precedes(X3,X2,X6))).
% 0.20/0.44 cnf(i_0_46, plain, (triangle(X1,X2,X3)|~sequential(X3,X1)|~sequential(X2,X3)|~sequential(X1,X2))).
% 0.20/0.44 cnf(i_0_25, plain, (on_path(esk4_4(X1,X2,X3,X4),X3)|~in_path(X4,X3)|~path(X1,X2,X3))).
% 0.20/0.44 cnf(i_0_57, plain, (number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|on_path(esk8_1(X1),X1)|~path(X2,X3,X1))).
% 0.20/0.44 cnf(i_0_39, plain, (X1=X2|shortest_path(X1,X2,X3)|~less_or_equal(length_of(X3),length_of(esk6_3(X1,X2,X3)))|~path(X1,X2,X3))).
% 0.20/0.44 cnf(i_0_56, plain, (number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|sequential(esk7_1(X1),esk8_1(X1))|~path(X2,X3,X1))).
% 0.20/0.44 cnf(i_0_5, plain, (tail_of(esk1_2(X1,X2))=X2|head_of(esk1_2(X1,X2))=X2|X2=X1|~vertex(X1)|~vertex(X2))).
% 0.20/0.44 cnf(i_0_6, plain, (tail_of(esk1_2(X1,X2))=X1|head_of(esk1_2(X1,X2))=X1|X1=X2|~vertex(X2)|~vertex(X1))).
% 0.20/0.44 cnf(i_0_4, plain, (tail_of(esk1_2(X1,X2))=X1|tail_of(esk1_2(X1,X2))=X2|X1=X2|~vertex(X2)|~vertex(X1))).
% 0.20/0.44 cnf(i_0_40, plain, (X1=X2|shortest_path(X1,X2,X3)|path(X1,X2,esk6_3(X1,X2,X3))|~path(X1,X2,X3))).
% 0.20/0.44 cnf(i_0_33, plain, (precedes(X1,X2,X3)|~sequential(X1,X2)|~on_path(X2,X3)|~on_path(X1,X3)|~path(X4,X5,X3))).
% 0.20/0.44 cnf(i_0_35, plain, (sequential(X1,esk5_3(X2,X1,X3))|sequential(X1,X3)|~precedes(X1,X3,X2)|~path(X4,X5,X2))).
% 0.20/0.44 cnf(i_0_34, plain, (precedes(esk5_3(X1,X2,X3),X3,X1)|sequential(X2,X3)|~precedes(X2,X3,X1)|~path(X4,X5,X1))).
% 0.20/0.44 cnf(i_0_32, plain, (precedes(X1,X2,X3)|~precedes(X4,X2,X3)|~sequential(X1,X4)|~on_path(X1,X3)|~path(X5,X6,X3))).
% 0.20/0.44 cnf(i_0_24, plain, (tail_of(esk4_4(X1,X2,X3,X4))=X4|head_of(esk4_4(X1,X2,X3,X4))=X4|~in_path(X4,X3)|~path(X1,X2,X3))).
% 0.20/0.44 cnf(i_0_60, lemma, (triangle(X1,X2,esk9_4(X3,X4,X1,X2))|~shortest_path(X3,X4,X5)|~precedes(X1,X2,X5)|~sequential(X1,X2))).
% 0.20/0.44 cnf(i_0_11, plain, (path(tail_of(X1),head_of(X1),path_cons(X1,empty))|~edge(X1))).
% 0.20/0.44 cnf(i_0_14, plain, (path_cons(esk2_3(X1,X2,X3),esk3_3(X1,X2,X3))=X3|head_of(esk2_3(X1,X2,X3))=X2|~path(X1,X2,X3))).
% 0.20/0.44 cnf(i_0_10, plain, (path(tail_of(X1),X2,path_cons(X1,X3))|~path(head_of(X1),X2,X3)|~edge(X1))).
% 0.20/0.44 cnf(i_0_16, plain, (path_cons(esk2_3(X1,X2,X3),empty)!=X3|path_cons(esk2_3(X1,X2,X3),X4)!=X3|head_of(esk2_3(X1,X2,X3))!=X2|~path(head_of(esk2_3(X1,X2,X3)),X2,X4)|~path(X1,X2,X3))).
% 0.20/0.44 cnf(i_0_12, plain, (path_cons(esk2_3(X1,X2,X3),esk3_3(X1,X2,X3))=X3|path_cons(esk2_3(X1,X2,X3),empty)=X3|~path(X1,X2,X3))).
% 0.20/0.44 cnf(i_0_15, plain, (head_of(esk2_3(X1,X2,X3))=X2|path(head_of(esk2_3(X1,X2,X3)),X2,esk3_3(X1,X2,X3))|~path(X1,X2,X3))).
% 0.20/0.44 cnf(i_0_13, plain, (path_cons(esk2_3(X1,X2,X3),empty)=X3|path(head_of(esk2_3(X1,X2,X3)),X2,esk3_3(X1,X2,X3))|~path(X1,X2,X3))).
% 0.20/0.44 cnf(i_0_2225, plain, (X93=X93)).
% 0.20/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.44 # Begin printing tableau
% 0.20/0.44 # Found 12 steps
% 0.20/0.44 cnf(i_0_2225, plain, (head_of(esk7_1(esk10_0))=head_of(esk7_1(esk10_0))), inference(start_rule)).
% 0.20/0.44 cnf(i_0_2426, plain, (head_of(esk7_1(esk10_0))=head_of(esk7_1(esk10_0))), inference(extension_rule, [i_0_45])).
% 0.20/0.44 cnf(i_0_2597, plain, ($false), inference(closure_rule, [i_0_2225])).
% 0.20/0.44 cnf(i_0_2598, plain, (~shortest_path(esk11_0,esk12_0,esk10_0)), inference(closure_rule, [i_0_62])).
% 0.20/0.44 cnf(i_0_2599, plain, (~precedes(esk7_1(esk10_0),esk7_1(esk10_0),esk10_0)), inference(extension_rule, [i_0_33])).
% 0.20/0.44 cnf(i_0_2718, plain, (~sequential(esk7_1(esk10_0),esk7_1(esk10_0))), inference(extension_rule, [i_0_48])).
% 0.20/0.44 cnf(i_0_2719, plain, (~on_path(esk7_1(esk10_0),esk10_0)), inference(extension_rule, [i_0_58])).
% 0.20/0.44 cnf(i_0_2720, plain, (~on_path(esk7_1(esk10_0),esk10_0)), inference(etableau_closure_rule, [i_0_2720, ...])).
% 0.20/0.44 cnf(i_0_2721, plain, (~path(X10,X11,esk10_0)), inference(etableau_closure_rule, [i_0_2721, ...])).
% 0.20/0.44 cnf(i_0_2741, plain, (~triangle(X7,esk7_1(esk10_0),esk7_1(esk10_0))), inference(etableau_closure_rule, [i_0_2741, ...])).
% 0.20/0.44 cnf(i_0_2817, plain, (number_of_in(triangles,esk10_0)=number_of_in(sequential_pairs,esk10_0)), inference(etableau_closure_rule, [i_0_2817, ...])).
% 0.20/0.44 cnf(i_0_2819, plain, (~path(X6,X8,esk10_0)), inference(etableau_closure_rule, [i_0_2819, ...])).
% 0.20/0.44 # End printing tableau
% 0.20/0.44 # SZS output end
% 0.20/0.44 # Branches closed with saturation will be marked with an "s"
% 0.20/0.45 # Child (14070) has found a proof.
% 0.20/0.45
% 0.20/0.45 # Proof search is over...
% 0.20/0.45 # Freeing feature tree
%------------------------------------------------------------------------------