TSTP Solution File: GRA010+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n019.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:17:25 EDT 2022
% Result : Theorem 151.60s 151.83s
% Output : CNFRefutation 151.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 25
% Syntax : Number of formulae : 406 ( 15 unt; 0 def)
% Number of atoms : 1745 ( 465 equ)
% Maximal formula atoms : 37 ( 4 avg)
% Number of connectives : 2358 (1019 ~;1142 |; 143 &)
% ( 9 <=>; 40 =>; 2 <=; 3 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 2 prp; 0-3 aty)
% Number of functors : 36 ( 36 usr; 12 con; 0-4 aty)
% Number of variables : 1323 ( 307 sgn 190 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X2,X3,X4,X6] :
( ( path(X2,X3,X4)
& in_path(X6,X4) )
=> ( vertex(X6)
& ? [X1] :
( on_path(X1,X4)
& ( X6 = head_of(X1)
| X6 = tail_of(X1) ) ) ) ),
file('<stdin>',in_path_properties) ).
fof(c_0_1,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> ( vertex(X2)
& vertex(X3)
& ? [X1] :
( edge(X1)
& X2 = tail_of(X1)
& ( ( X3 = head_of(X1)
& X4 = path_cons(X1,empty) )
<~> ? [X5] :
( path(head_of(X1),X3,X5)
& X4 = path_cons(X1,X5) ) ) ) ) ),
file('<stdin>',path_properties) ).
fof(c_0_2,axiom,
! [X2,X3,X10] :
( shortest_path(X2,X3,X10)
<=> ( path(X2,X3,X10)
& X2 != X3
& ! [X4] :
( path(X2,X3,X4)
=> less_or_equal(length_of(X10),length_of(X4)) ) ) ),
file('<stdin>',shortest_path_defn) ).
fof(c_0_3,axiom,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
=> ( on_path(X7,X4)
& on_path(X8,X4)
& ( sequential(X7,X8)
<~> ? [X9] :
( sequential(X7,X9)
& precedes(X9,X8,X4) ) ) ) ) ),
file('<stdin>',precedes_properties) ).
fof(c_0_4,axiom,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
<= ( on_path(X7,X4)
& on_path(X8,X4)
& ( sequential(X7,X8)
| ? [X9] :
( sequential(X7,X9)
& precedes(X9,X8,X4) ) ) ) ) ),
file('<stdin>',precedes_defn) ).
fof(c_0_5,axiom,
! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( ~ ? [X9] :
( tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) )
& ~ precedes(X8,X7,X4) ) ),
file('<stdin>',shortest_path_properties) ).
fof(c_0_6,axiom,
! [X4,X2,X3] :
( ( path(X2,X3,X4)
& ! [X7,X8] :
( ( on_path(X7,X4)
& on_path(X8,X4)
& sequential(X7,X8) )
=> ? [X9] : triangle(X7,X8,X9) ) )
=> number_of_in(sequential_pairs,X4) = number_of_in(triangles,X4) ),
file('<stdin>',sequential_pairs_and_triangles) ).
fof(c_0_7,axiom,
( complete
=> ! [X2,X3] :
( ( vertex(X2)
& vertex(X3)
& X2 != X3 )
=> ? [X1] :
( edge(X1)
& ( ( X2 = head_of(X1)
& X3 = tail_of(X1) )
<~> ( X3 = head_of(X1)
& X2 = tail_of(X1) ) ) ) ) ),
file('<stdin>',complete_properties) ).
fof(c_0_8,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
<= ( vertex(X2)
& vertex(X3)
& ? [X1] :
( edge(X1)
& X2 = tail_of(X1)
& ( ( X3 = head_of(X1)
& X4 = path_cons(X1,empty) )
| ? [X5] :
( path(head_of(X1),X3,X5)
& X4 = path_cons(X1,X5) ) ) ) ) ),
file('<stdin>',path_defn) ).
fof(c_0_9,axiom,
! [X7,X8,X9] :
( triangle(X7,X8,X9)
<=> ( edge(X7)
& edge(X8)
& edge(X9)
& sequential(X7,X8)
& sequential(X8,X9)
& sequential(X9,X7) ) ),
file('<stdin>',triangle_defn) ).
fof(c_0_10,axiom,
! [X2,X3,X4,X1] :
( ( path(X2,X3,X4)
& on_path(X1,X4) )
=> ( edge(X1)
& in_path(head_of(X1),X4)
& in_path(tail_of(X1),X4) ) ),
file('<stdin>',on_path_properties) ).
fof(c_0_11,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> number_of_in(sequential_pairs,X4) = minus(length_of(X4),n1) ),
file('<stdin>',path_length_sequential_pairs) ).
fof(c_0_12,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> length_of(X4) = number_of_in(edges,X4) ),
file('<stdin>',length_defn) ).
fof(c_0_13,axiom,
! [X11,X12] : less_or_equal(number_of_in(X11,X12),number_of_in(X11,graph)),
file('<stdin>',graph_has_them_all) ).
fof(c_0_14,axiom,
! [X7,X8] :
( sequential(X7,X8)
<=> ( edge(X7)
& edge(X8)
& X7 != X8
& head_of(X7) = tail_of(X8) ) ),
file('<stdin>',sequential_defn) ).
fof(c_0_15,axiom,
! [X1] :
( edge(X1)
=> head_of(X1) != tail_of(X1) ),
file('<stdin>',no_loops) ).
fof(c_0_16,axiom,
! [X1] :
( edge(X1)
=> ( vertex(head_of(X1))
& vertex(tail_of(X1)) ) ),
file('<stdin>',edge_ends_are_vertices) ).
fof(c_0_17,axiom,
! [X2,X3,X4,X6] :
( ( path(X2,X3,X4)
& in_path(X6,X4) )
=> ( vertex(X6)
& ? [X1] :
( on_path(X1,X4)
& ( X6 = head_of(X1)
| X6 = tail_of(X1) ) ) ) ),
c_0_0 ).
fof(c_0_18,plain,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> ( vertex(X2)
& vertex(X3)
& ? [X1] :
( edge(X1)
& X2 = tail_of(X1)
& ~ ( ( X3 = head_of(X1)
& X4 = path_cons(X1,empty) )
<=> ? [X5] :
( path(head_of(X1),X3,X5)
& X4 = path_cons(X1,X5) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_19,axiom,
! [X2,X3,X10] :
( shortest_path(X2,X3,X10)
<=> ( path(X2,X3,X10)
& X2 != X3
& ! [X4] :
( path(X2,X3,X4)
=> less_or_equal(length_of(X10),length_of(X4)) ) ) ),
c_0_2 ).
fof(c_0_20,plain,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
=> ( on_path(X7,X4)
& on_path(X8,X4)
& ~ ( sequential(X7,X8)
<=> ? [X9] :
( sequential(X7,X9)
& precedes(X9,X8,X4) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_21,plain,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( ( on_path(X7,X4)
& on_path(X8,X4)
& ( sequential(X7,X8)
| ? [X9] :
( sequential(X7,X9)
& precedes(X9,X8,X4) ) ) )
=> precedes(X7,X8,X4) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_22,plain,
! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( ~ ? [X9] :
( tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) )
& ~ precedes(X8,X7,X4) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_23,axiom,
! [X4,X2,X3] :
( ( path(X2,X3,X4)
& ! [X7,X8] :
( ( on_path(X7,X4)
& on_path(X8,X4)
& sequential(X7,X8) )
=> ? [X9] : triangle(X7,X8,X9) ) )
=> number_of_in(sequential_pairs,X4) = number_of_in(triangles,X4) ),
c_0_6 ).
fof(c_0_24,plain,
( complete
=> ! [X2,X3] :
( ( vertex(X2)
& vertex(X3)
& X2 != X3 )
=> ? [X1] :
( edge(X1)
& ~ ( ( X2 = head_of(X1)
& X3 = tail_of(X1) )
<=> ( X3 = head_of(X1)
& X2 = tail_of(X1) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_25,plain,
! [X2,X3,X4] :
( ( vertex(X2)
& vertex(X3)
& ? [X1] :
( edge(X1)
& X2 = tail_of(X1)
& ( ( X3 = head_of(X1)
& X4 = path_cons(X1,empty) )
| ? [X5] :
( path(head_of(X1),X3,X5)
& X4 = path_cons(X1,X5) ) ) ) )
=> path(X2,X3,X4) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_26,axiom,
! [X7,X8,X9] :
( triangle(X7,X8,X9)
<=> ( edge(X7)
& edge(X8)
& edge(X9)
& sequential(X7,X8)
& sequential(X8,X9)
& sequential(X9,X7) ) ),
c_0_9 ).
fof(c_0_27,axiom,
! [X2,X3,X4,X1] :
( ( path(X2,X3,X4)
& on_path(X1,X4) )
=> ( edge(X1)
& in_path(head_of(X1),X4)
& in_path(tail_of(X1),X4) ) ),
c_0_10 ).
fof(c_0_28,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> number_of_in(sequential_pairs,X4) = minus(length_of(X4),n1) ),
c_0_11 ).
fof(c_0_29,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> length_of(X4) = number_of_in(edges,X4) ),
c_0_12 ).
fof(c_0_30,axiom,
! [X11,X12] : less_or_equal(number_of_in(X11,X12),number_of_in(X11,graph)),
c_0_13 ).
fof(c_0_31,axiom,
! [X7,X8] :
( sequential(X7,X8)
<=> ( edge(X7)
& edge(X8)
& X7 != X8
& head_of(X7) = tail_of(X8) ) ),
c_0_14 ).
fof(c_0_32,axiom,
! [X1] :
( edge(X1)
=> head_of(X1) != tail_of(X1) ),
c_0_15 ).
fof(c_0_33,axiom,
! [X1] :
( edge(X1)
=> ( vertex(head_of(X1))
& vertex(tail_of(X1)) ) ),
c_0_16 ).
fof(c_0_34,plain,
! [X7,X8,X9,X10] :
( ( vertex(X10)
| ~ path(X7,X8,X9)
| ~ in_path(X10,X9) )
& ( on_path(esk4_4(X7,X8,X9,X10),X9)
| ~ path(X7,X8,X9)
| ~ in_path(X10,X9) )
& ( X10 = head_of(esk4_4(X7,X8,X9,X10))
| X10 = tail_of(esk4_4(X7,X8,X9,X10))
| ~ path(X7,X8,X9)
| ~ in_path(X10,X9) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
fof(c_0_35,plain,
! [X6,X7,X8,X10] :
( ( vertex(X6)
| ~ path(X6,X7,X8) )
& ( vertex(X7)
| ~ path(X6,X7,X8) )
& ( edge(esk2_3(X6,X7,X8))
| ~ path(X6,X7,X8) )
& ( X6 = tail_of(esk2_3(X6,X7,X8))
| ~ path(X6,X7,X8) )
& ( X7 != head_of(esk2_3(X6,X7,X8))
| X8 != path_cons(esk2_3(X6,X7,X8),empty)
| ~ path(head_of(esk2_3(X6,X7,X8)),X7,X10)
| X8 != path_cons(esk2_3(X6,X7,X8),X10)
| ~ path(X6,X7,X8) )
& ( path(head_of(esk2_3(X6,X7,X8)),X7,esk3_3(X6,X7,X8))
| X7 = head_of(esk2_3(X6,X7,X8))
| ~ path(X6,X7,X8) )
& ( X8 = path_cons(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8))
| X7 = head_of(esk2_3(X6,X7,X8))
| ~ path(X6,X7,X8) )
& ( path(head_of(esk2_3(X6,X7,X8)),X7,esk3_3(X6,X7,X8))
| X8 = path_cons(esk2_3(X6,X7,X8),empty)
| ~ path(X6,X7,X8) )
& ( X8 = path_cons(esk2_3(X6,X7,X8),esk3_3(X6,X7,X8))
| X8 = path_cons(esk2_3(X6,X7,X8),empty)
| ~ path(X6,X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])]) ).
fof(c_0_36,plain,
! [X11,X12,X13,X14,X15,X16,X17] :
( ( path(X11,X12,X13)
| ~ shortest_path(X11,X12,X13) )
& ( X11 != X12
| ~ shortest_path(X11,X12,X13) )
& ( ~ path(X11,X12,X14)
| less_or_equal(length_of(X13),length_of(X14))
| ~ shortest_path(X11,X12,X13) )
& ( path(X15,X16,esk6_3(X15,X16,X17))
| X15 = X16
| ~ path(X15,X16,X17)
| shortest_path(X15,X16,X17) )
& ( ~ less_or_equal(length_of(X17),length_of(esk6_3(X15,X16,X17)))
| X15 = X16
| ~ path(X15,X16,X17)
| shortest_path(X15,X16,X17) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])])]) ).
fof(c_0_37,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( on_path(X13,X10)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( on_path(X14,X10)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( ~ sequential(X13,X14)
| ~ sequential(X13,X15)
| ~ precedes(X15,X14,X10)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( sequential(X13,esk5_3(X10,X13,X14))
| sequential(X13,X14)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( precedes(esk5_3(X10,X13,X14),X14,X10)
| sequential(X13,X14)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])])])]) ).
fof(c_0_38,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( ~ sequential(X13,X14)
| ~ on_path(X14,X10)
| ~ on_path(X13,X10)
| precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( ~ sequential(X13,X15)
| ~ precedes(X15,X14,X10)
| ~ on_path(X14,X10)
| ~ on_path(X13,X10)
| precedes(X13,X14,X10)
| ~ path(X11,X12,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])])]) ).
fof(c_0_39,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( tail_of(X15) != tail_of(X12)
| head_of(X15) != head_of(X13)
| ~ shortest_path(X10,X11,X14)
| ~ precedes(X12,X13,X14) )
& ( ~ precedes(X13,X12,X14)
| ~ shortest_path(X10,X11,X14)
| ~ precedes(X12,X13,X14) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
fof(c_0_40,plain,
! [X10,X11,X12,X15] :
( ( on_path(esk7_1(X10),X10)
| ~ path(X11,X12,X10)
| number_of_in(sequential_pairs,X10) = number_of_in(triangles,X10) )
& ( on_path(esk8_1(X10),X10)
| ~ path(X11,X12,X10)
| number_of_in(sequential_pairs,X10) = number_of_in(triangles,X10) )
& ( sequential(esk7_1(X10),esk8_1(X10))
| ~ path(X11,X12,X10)
| number_of_in(sequential_pairs,X10) = number_of_in(triangles,X10) )
& ( ~ triangle(esk7_1(X10),esk8_1(X10),X15)
| ~ path(X11,X12,X10)
| number_of_in(sequential_pairs,X10) = number_of_in(triangles,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])])])]) ).
fof(c_0_41,plain,
! [X4,X5] :
( ( edge(esk1_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete )
& ( X4 != head_of(esk1_2(X4,X5))
| X5 != tail_of(esk1_2(X4,X5))
| X5 != head_of(esk1_2(X4,X5))
| X4 != tail_of(esk1_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete )
& ( X5 = head_of(esk1_2(X4,X5))
| X4 = head_of(esk1_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete )
& ( X4 = tail_of(esk1_2(X4,X5))
| X4 = head_of(esk1_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete )
& ( X5 = head_of(esk1_2(X4,X5))
| X5 = tail_of(esk1_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete )
& ( X4 = tail_of(esk1_2(X4,X5))
| X5 = tail_of(esk1_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])])]) ).
fof(c_0_42,plain,
! [X6,X7,X8,X9,X10] :
( ( X7 != head_of(X9)
| X8 != path_cons(X9,empty)
| X6 != tail_of(X9)
| ~ edge(X9)
| ~ vertex(X7)
| ~ vertex(X6)
| path(X6,X7,X8) )
& ( ~ path(head_of(X9),X7,X10)
| X8 != path_cons(X9,X10)
| X6 != tail_of(X9)
| ~ edge(X9)
| ~ vertex(X7)
| ~ vertex(X6)
| path(X6,X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
fof(c_0_43,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( edge(X10)
| ~ triangle(X10,X11,X12) )
& ( edge(X11)
| ~ triangle(X10,X11,X12) )
& ( edge(X12)
| ~ triangle(X10,X11,X12) )
& ( sequential(X10,X11)
| ~ triangle(X10,X11,X12) )
& ( sequential(X11,X12)
| ~ triangle(X10,X11,X12) )
& ( sequential(X12,X10)
| ~ triangle(X10,X11,X12) )
& ( ~ edge(X13)
| ~ edge(X14)
| ~ edge(X15)
| ~ sequential(X13,X14)
| ~ sequential(X14,X15)
| ~ sequential(X15,X13)
| triangle(X13,X14,X15) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])])]) ).
fof(c_0_44,plain,
! [X5,X6,X7,X8] :
( ( edge(X8)
| ~ path(X5,X6,X7)
| ~ on_path(X8,X7) )
& ( in_path(head_of(X8),X7)
| ~ path(X5,X6,X7)
| ~ on_path(X8,X7) )
& ( in_path(tail_of(X8),X7)
| ~ path(X5,X6,X7)
| ~ on_path(X8,X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])]) ).
fof(c_0_45,plain,
! [X5,X6,X7] :
( ~ path(X5,X6,X7)
| number_of_in(sequential_pairs,X7) = minus(length_of(X7),n1) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])]) ).
fof(c_0_46,plain,
! [X5,X6,X7] :
( ~ path(X5,X6,X7)
| length_of(X7) = number_of_in(edges,X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])]) ).
fof(c_0_47,plain,
! [X13,X14] : less_or_equal(number_of_in(X13,X14),number_of_in(X13,graph)),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_48,plain,
! [X9,X10,X11,X12] :
( ( edge(X9)
| ~ sequential(X9,X10) )
& ( edge(X10)
| ~ sequential(X9,X10) )
& ( X9 != X10
| ~ sequential(X9,X10) )
& ( head_of(X9) = tail_of(X10)
| ~ sequential(X9,X10) )
& ( ~ edge(X11)
| ~ edge(X12)
| X11 = X12
| head_of(X11) != tail_of(X12)
| sequential(X11,X12) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])])]) ).
fof(c_0_49,plain,
! [X2] :
( ~ edge(X2)
| head_of(X2) != tail_of(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])]) ).
fof(c_0_50,plain,
! [X2] :
( ( vertex(head_of(X2))
| ~ edge(X2) )
& ( vertex(tail_of(X2))
| ~ edge(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])]) ).
cnf(c_0_51,plain,
( X1 = tail_of(esk4_4(X3,X4,X2,X1))
| X1 = head_of(esk4_4(X3,X4,X2,X1))
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_52,plain,
( ~ path(X1,X2,X3)
| X3 != path_cons(esk2_3(X1,X2,X3),X4)
| ~ path(head_of(esk2_3(X1,X2,X3)),X2,X4)
| X3 != path_cons(esk2_3(X1,X2,X3),empty)
| X2 != head_of(esk2_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_53,plain,
( on_path(esk4_4(X3,X4,X2,X1),X2)
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_54,plain,
( X3 = path_cons(esk2_3(X1,X2,X3),empty)
| path(head_of(esk2_3(X1,X2,X3)),X2,esk3_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_55,plain,
( X2 = head_of(esk2_3(X1,X2,X3))
| path(head_of(esk2_3(X1,X2,X3)),X2,esk3_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_56,plain,
( shortest_path(X1,X2,X3)
| X1 = X2
| ~ path(X1,X2,X3)
| ~ less_or_equal(length_of(X3),length_of(esk6_3(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_57,plain,
( X3 = path_cons(esk2_3(X1,X2,X3),empty)
| X3 = path_cons(esk2_3(X1,X2,X3),esk3_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_58,plain,
( X2 = head_of(esk2_3(X1,X2,X3))
| X3 = path_cons(esk2_3(X1,X2,X3),esk3_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_59,plain,
( sequential(X4,X5)
| precedes(esk5_3(X3,X4,X5),X5,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_60,plain,
( sequential(X4,X5)
| sequential(X4,esk5_3(X3,X4,X5))
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_61,plain,
( shortest_path(X1,X2,X3)
| X1 = X2
| path(X1,X2,esk6_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_62,plain,
( ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3)
| ~ precedes(X6,X5,X3)
| ~ sequential(X4,X6)
| ~ sequential(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_63,plain,
( precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| ~ on_path(X4,X3)
| ~ on_path(X5,X3)
| ~ precedes(X6,X5,X3)
| ~ sequential(X4,X6) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_64,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_65,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| ~ path(X2,X3,X1)
| ~ triangle(esk7_1(X1),esk8_1(X1),X4) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_66,plain,
( X1 = X2
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1)
| X1 != tail_of(esk1_2(X1,X2))
| X2 != head_of(esk1_2(X1,X2))
| X2 != tail_of(esk1_2(X1,X2))
| X1 != head_of(esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_67,plain,
( precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| ~ on_path(X4,X3)
| ~ on_path(X5,X3)
| ~ sequential(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_68,plain,
( path(X1,X2,X3)
| ~ vertex(X1)
| ~ vertex(X2)
| ~ edge(X4)
| X1 != tail_of(X4)
| X3 != path_cons(X4,X5)
| ~ path(head_of(X4),X2,X5) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_69,plain,
( less_or_equal(length_of(X3),length_of(X4))
| ~ shortest_path(X1,X2,X3)
| ~ path(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_70,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| head_of(X6) != head_of(X2)
| tail_of(X6) != tail_of(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_71,plain,
( X1 = tail_of(esk2_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_72,plain,
( edge(esk2_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_73,plain,
( on_path(X4,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_74,plain,
( on_path(X5,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_75,plain,
( triangle(X1,X2,X3)
| ~ sequential(X3,X1)
| ~ sequential(X2,X3)
| ~ sequential(X1,X2)
| ~ edge(X3)
| ~ edge(X2)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_76,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_77,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| sequential(esk7_1(X1),esk8_1(X1))
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_78,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk7_1(X1),X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_79,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk8_1(X1),X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_80,plain,
( in_path(head_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_81,plain,
( in_path(tail_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_82,plain,
( number_of_in(sequential_pairs,X1) = minus(length_of(X1),n1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_83,plain,
( path(X1,X2,X3)
| ~ vertex(X1)
| ~ vertex(X2)
| ~ edge(X4)
| X1 != tail_of(X4)
| X3 != path_cons(X4,empty)
| X2 != head_of(X4) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_84,plain,
( vertex(X1)
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_85,plain,
( edge(X1)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_86,plain,
( length_of(X1) = number_of_in(edges,X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_87,plain,
( sequential(X1,X2)
| ~ triangle(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_88,plain,
( sequential(X2,X3)
| ~ triangle(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_89,plain,
( sequential(X3,X1)
| ~ triangle(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_90,plain,
( edge(X1)
| ~ triangle(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_91,plain,
( edge(X2)
| ~ triangle(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_92,plain,
( edge(X3)
| ~ triangle(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_93,plain,
( vertex(X1)
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_94,plain,
( vertex(X2)
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_95,plain,
( ~ shortest_path(X1,X2,X3)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_96,plain,
( X1 = X2
| X1 = head_of(esk1_2(X1,X2))
| X2 = head_of(esk1_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_97,plain,
( X1 = X2
| X1 = head_of(esk1_2(X1,X2))
| X1 = tail_of(esk1_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_98,plain,
( X1 = X2
| X2 = tail_of(esk1_2(X1,X2))
| X2 = head_of(esk1_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_99,plain,
( X1 = X2
| X2 = tail_of(esk1_2(X1,X2))
| X1 = tail_of(esk1_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_100,plain,
less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_101,plain,
( X1 = X2
| edge(esk1_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_102,plain,
( sequential(X1,X2)
| X1 = X2
| head_of(X1) != tail_of(X2)
| ~ edge(X2)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_103,plain,
( head_of(X1) = tail_of(X2)
| ~ sequential(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_104,plain,
( edge(X1)
| ~ sequential(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_105,plain,
( edge(X2)
| ~ sequential(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_106,plain,
( ~ sequential(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_107,plain,
( head_of(X1) != tail_of(X1)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_108,plain,
( vertex(head_of(X1))
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_109,plain,
( vertex(tail_of(X1))
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_110,plain,
( tail_of(esk4_4(X3,X4,X2,X1)) = X1
| head_of(esk4_4(X3,X4,X2,X1)) = X1
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
c_0_51,
[final] ).
cnf(c_0_111,plain,
( ~ path(X1,X2,X3)
| path_cons(esk2_3(X1,X2,X3),X4) != X3
| ~ path(head_of(esk2_3(X1,X2,X3)),X2,X4)
| path_cons(esk2_3(X1,X2,X3),empty) != X3
| head_of(esk2_3(X1,X2,X3)) != X2 ),
c_0_52,
[final] ).
cnf(c_0_112,plain,
( on_path(esk4_4(X3,X4,X2,X1),X2)
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
c_0_53,
[final] ).
cnf(c_0_113,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) ),
c_0_54,
[final] ).
cnf(c_0_114,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) ),
c_0_55,
[final] ).
cnf(c_0_115,plain,
( shortest_path(X1,X2,X3)
| X1 = X2
| ~ path(X1,X2,X3)
| ~ less_or_equal(length_of(X3),length_of(esk6_3(X1,X2,X3))) ),
c_0_56,
[final] ).
cnf(c_0_116,plain,
( path_cons(esk2_3(X1,X2,X3),empty) = X3
| path_cons(esk2_3(X1,X2,X3),esk3_3(X1,X2,X3)) = X3
| ~ path(X1,X2,X3) ),
c_0_57,
[final] ).
cnf(c_0_117,plain,
( head_of(esk2_3(X1,X2,X3)) = X2
| path_cons(esk2_3(X1,X2,X3),esk3_3(X1,X2,X3)) = X3
| ~ path(X1,X2,X3) ),
c_0_58,
[final] ).
cnf(c_0_118,plain,
( sequential(X4,X5)
| precedes(esk5_3(X3,X4,X5),X5,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
c_0_59,
[final] ).
cnf(c_0_119,plain,
( sequential(X4,X5)
| sequential(X4,esk5_3(X3,X4,X5))
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
c_0_60,
[final] ).
cnf(c_0_120,plain,
( shortest_path(X1,X2,X3)
| X1 = X2
| path(X1,X2,esk6_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
c_0_61,
[final] ).
cnf(c_0_121,plain,
( ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3)
| ~ precedes(X6,X5,X3)
| ~ sequential(X4,X6)
| ~ sequential(X4,X5) ),
c_0_62,
[final] ).
cnf(c_0_122,plain,
( precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| ~ on_path(X4,X3)
| ~ on_path(X5,X3)
| ~ precedes(X6,X5,X3)
| ~ sequential(X4,X6) ),
c_0_63,
[final] ).
cnf(c_0_123,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X2,X1,X3) ),
c_0_64,
[final] ).
cnf(c_0_124,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1)
| ~ triangle(esk7_1(X1),esk8_1(X1),X4) ),
c_0_65,
[final] ).
cnf(c_0_125,plain,
( X1 = X2
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1)
| tail_of(esk1_2(X1,X2)) != X1
| head_of(esk1_2(X1,X2)) != X2
| tail_of(esk1_2(X1,X2)) != X2
| head_of(esk1_2(X1,X2)) != X1 ),
c_0_66,
[final] ).
cnf(c_0_126,plain,
( precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| ~ on_path(X4,X3)
| ~ on_path(X5,X3)
| ~ sequential(X4,X5) ),
c_0_67,
[final] ).
cnf(c_0_127,plain,
( path(X1,X2,X3)
| ~ vertex(X1)
| ~ vertex(X2)
| ~ edge(X4)
| X1 != tail_of(X4)
| X3 != path_cons(X4,X5)
| ~ path(head_of(X4),X2,X5) ),
c_0_68,
[final] ).
cnf(c_0_128,plain,
( less_or_equal(length_of(X3),length_of(X4))
| ~ shortest_path(X1,X2,X3)
| ~ path(X1,X2,X4) ),
c_0_69,
[final] ).
cnf(c_0_129,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| head_of(X6) != head_of(X2)
| tail_of(X6) != tail_of(X1) ),
c_0_70,
[final] ).
cnf(c_0_130,plain,
( tail_of(esk2_3(X1,X2,X3)) = X1
| ~ path(X1,X2,X3) ),
c_0_71,
[final] ).
cnf(c_0_131,plain,
( edge(esk2_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
c_0_72,
[final] ).
cnf(c_0_132,plain,
( on_path(X4,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
c_0_73,
[final] ).
cnf(c_0_133,plain,
( on_path(X5,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
c_0_74,
[final] ).
cnf(c_0_134,plain,
( triangle(X1,X2,X3)
| ~ sequential(X3,X1)
| ~ sequential(X2,X3)
| ~ sequential(X1,X2)
| ~ edge(X3)
| ~ edge(X2)
| ~ edge(X1) ),
c_0_75,
[final] ).
cnf(c_0_135,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
c_0_76,
[final] ).
cnf(c_0_136,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| sequential(esk7_1(X1),esk8_1(X1))
| ~ path(X2,X3,X1) ),
c_0_77,
[final] ).
cnf(c_0_137,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk7_1(X1),X1)
| ~ path(X2,X3,X1) ),
c_0_78,
[final] ).
cnf(c_0_138,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk8_1(X1),X1)
| ~ path(X2,X3,X1) ),
c_0_79,
[final] ).
cnf(c_0_139,plain,
( in_path(head_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
c_0_80,
[final] ).
cnf(c_0_140,plain,
( in_path(tail_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
c_0_81,
[final] ).
cnf(c_0_141,plain,
( minus(length_of(X1),n1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1) ),
c_0_82,
[final] ).
cnf(c_0_142,plain,
( path(X1,X2,X3)
| ~ vertex(X1)
| ~ vertex(X2)
| ~ edge(X4)
| X1 != tail_of(X4)
| X3 != path_cons(X4,empty)
| X2 != head_of(X4) ),
c_0_83,
[final] ).
cnf(c_0_143,plain,
( vertex(X1)
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
c_0_84,
[final] ).
cnf(c_0_144,plain,
( edge(X1)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
c_0_85,
[final] ).
cnf(c_0_145,plain,
( number_of_in(edges,X1) = length_of(X1)
| ~ path(X2,X3,X1) ),
c_0_86,
[final] ).
cnf(c_0_146,plain,
( sequential(X1,X2)
| ~ triangle(X1,X2,X3) ),
c_0_87,
[final] ).
cnf(c_0_147,plain,
( sequential(X2,X3)
| ~ triangle(X1,X2,X3) ),
c_0_88,
[final] ).
cnf(c_0_148,plain,
( sequential(X3,X1)
| ~ triangle(X1,X2,X3) ),
c_0_89,
[final] ).
cnf(c_0_149,plain,
( edge(X1)
| ~ triangle(X1,X2,X3) ),
c_0_90,
[final] ).
cnf(c_0_150,plain,
( edge(X2)
| ~ triangle(X1,X2,X3) ),
c_0_91,
[final] ).
cnf(c_0_151,plain,
( edge(X3)
| ~ triangle(X1,X2,X3) ),
c_0_92,
[final] ).
cnf(c_0_152,plain,
( vertex(X1)
| ~ path(X1,X2,X3) ),
c_0_93,
[final] ).
cnf(c_0_153,plain,
( vertex(X2)
| ~ path(X1,X2,X3) ),
c_0_94,
[final] ).
cnf(c_0_154,plain,
( ~ shortest_path(X1,X2,X3)
| X1 != X2 ),
c_0_95,
[final] ).
cnf(c_0_155,plain,
( X1 = X2
| head_of(esk1_2(X1,X2)) = X1
| head_of(esk1_2(X1,X2)) = X2
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
c_0_96,
[final] ).
cnf(c_0_156,plain,
( X1 = X2
| head_of(esk1_2(X1,X2)) = X1
| tail_of(esk1_2(X1,X2)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
c_0_97,
[final] ).
cnf(c_0_157,plain,
( X1 = X2
| tail_of(esk1_2(X1,X2)) = X2
| head_of(esk1_2(X1,X2)) = X2
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
c_0_98,
[final] ).
cnf(c_0_158,plain,
( X1 = X2
| tail_of(esk1_2(X1,X2)) = X2
| tail_of(esk1_2(X1,X2)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
c_0_99,
[final] ).
cnf(c_0_159,plain,
less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),
c_0_100,
[final] ).
cnf(c_0_160,plain,
( X1 = X2
| edge(esk1_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
c_0_101,
[final] ).
cnf(c_0_161,plain,
( sequential(X1,X2)
| X1 = X2
| head_of(X1) != tail_of(X2)
| ~ edge(X2)
| ~ edge(X1) ),
c_0_102,
[final] ).
cnf(c_0_162,plain,
( head_of(X1) = tail_of(X2)
| ~ sequential(X1,X2) ),
c_0_103,
[final] ).
cnf(c_0_163,plain,
( edge(X1)
| ~ sequential(X1,X2) ),
c_0_104,
[final] ).
cnf(c_0_164,plain,
( edge(X2)
| ~ sequential(X1,X2) ),
c_0_105,
[final] ).
cnf(c_0_165,plain,
( ~ sequential(X1,X2)
| X1 != X2 ),
c_0_106,
[final] ).
cnf(c_0_166,plain,
( head_of(X1) != tail_of(X1)
| ~ edge(X1) ),
c_0_107,
[final] ).
cnf(c_0_167,plain,
( vertex(head_of(X1))
| ~ edge(X1) ),
c_0_108,
[final] ).
cnf(c_0_168,plain,
( vertex(tail_of(X1))
| ~ edge(X1) ),
c_0_109,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_110_0,axiom,
( tail_of(sk1_esk4_4(X3,X4,X2,X1)) = X1
| head_of(sk1_esk4_4(X3,X4,X2,X1)) = X1
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_110]) ).
cnf(c_0_110_1,axiom,
( head_of(sk1_esk4_4(X3,X4,X2,X1)) = X1
| tail_of(sk1_esk4_4(X3,X4,X2,X1)) = X1
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_110]) ).
cnf(c_0_110_2,axiom,
( ~ in_path(X1,X2)
| head_of(sk1_esk4_4(X3,X4,X2,X1)) = X1
| tail_of(sk1_esk4_4(X3,X4,X2,X1)) = X1
| ~ path(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_110]) ).
cnf(c_0_110_3,axiom,
( ~ path(X3,X4,X2)
| ~ in_path(X1,X2)
| head_of(sk1_esk4_4(X3,X4,X2,X1)) = X1
| tail_of(sk1_esk4_4(X3,X4,X2,X1)) = X1 ),
inference(literals_permutation,[status(thm)],[c_0_110]) ).
cnf(c_0_111_0,axiom,
( ~ path(X1,X2,X3)
| path_cons(sk1_esk2_3(X1,X2,X3),X4) != X3
| ~ path(head_of(sk1_esk2_3(X1,X2,X3)),X2,X4)
| path_cons(sk1_esk2_3(X1,X2,X3),empty) != X3
| head_of(sk1_esk2_3(X1,X2,X3)) != X2 ),
inference(literals_permutation,[status(thm)],[c_0_111]) ).
cnf(c_0_111_1,axiom,
( path_cons(sk1_esk2_3(X1,X2,X3),X4) != X3
| ~ path(X1,X2,X3)
| ~ path(head_of(sk1_esk2_3(X1,X2,X3)),X2,X4)
| path_cons(sk1_esk2_3(X1,X2,X3),empty) != X3
| head_of(sk1_esk2_3(X1,X2,X3)) != X2 ),
inference(literals_permutation,[status(thm)],[c_0_111]) ).
cnf(c_0_111_2,axiom,
( ~ path(head_of(sk1_esk2_3(X1,X2,X3)),X2,X4)
| path_cons(sk1_esk2_3(X1,X2,X3),X4) != X3
| ~ path(X1,X2,X3)
| path_cons(sk1_esk2_3(X1,X2,X3),empty) != X3
| head_of(sk1_esk2_3(X1,X2,X3)) != X2 ),
inference(literals_permutation,[status(thm)],[c_0_111]) ).
cnf(c_0_111_3,axiom,
( path_cons(sk1_esk2_3(X1,X2,X3),empty) != X3
| ~ path(head_of(sk1_esk2_3(X1,X2,X3)),X2,X4)
| path_cons(sk1_esk2_3(X1,X2,X3),X4) != X3
| ~ path(X1,X2,X3)
| head_of(sk1_esk2_3(X1,X2,X3)) != X2 ),
inference(literals_permutation,[status(thm)],[c_0_111]) ).
cnf(c_0_111_4,axiom,
( head_of(sk1_esk2_3(X1,X2,X3)) != X2
| path_cons(sk1_esk2_3(X1,X2,X3),empty) != X3
| ~ path(head_of(sk1_esk2_3(X1,X2,X3)),X2,X4)
| path_cons(sk1_esk2_3(X1,X2,X3),X4) != X3
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_111]) ).
cnf(c_0_112_0,axiom,
( on_path(sk1_esk4_4(X3,X4,X2,X1),X2)
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_112]) ).
cnf(c_0_112_1,axiom,
( ~ in_path(X1,X2)
| on_path(sk1_esk4_4(X3,X4,X2,X1),X2)
| ~ path(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_112]) ).
cnf(c_0_112_2,axiom,
( ~ path(X3,X4,X2)
| ~ in_path(X1,X2)
| on_path(sk1_esk4_4(X3,X4,X2,X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_112]) ).
cnf(c_0_113_0,axiom,
( path_cons(sk1_esk2_3(X1,X2,X3),empty) = X3
| path(head_of(sk1_esk2_3(X1,X2,X3)),X2,sk1_esk3_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_113]) ).
cnf(c_0_113_1,axiom,
( path(head_of(sk1_esk2_3(X1,X2,X3)),X2,sk1_esk3_3(X1,X2,X3))
| path_cons(sk1_esk2_3(X1,X2,X3),empty) = X3
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_113]) ).
cnf(c_0_113_2,axiom,
( ~ path(X1,X2,X3)
| path(head_of(sk1_esk2_3(X1,X2,X3)),X2,sk1_esk3_3(X1,X2,X3))
| path_cons(sk1_esk2_3(X1,X2,X3),empty) = X3 ),
inference(literals_permutation,[status(thm)],[c_0_113]) ).
cnf(c_0_114_0,axiom,
( head_of(sk1_esk2_3(X1,X2,X3)) = X2
| path(head_of(sk1_esk2_3(X1,X2,X3)),X2,sk1_esk3_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_114]) ).
cnf(c_0_114_1,axiom,
( path(head_of(sk1_esk2_3(X1,X2,X3)),X2,sk1_esk3_3(X1,X2,X3))
| head_of(sk1_esk2_3(X1,X2,X3)) = X2
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_114]) ).
cnf(c_0_114_2,axiom,
( ~ path(X1,X2,X3)
| path(head_of(sk1_esk2_3(X1,X2,X3)),X2,sk1_esk3_3(X1,X2,X3))
| head_of(sk1_esk2_3(X1,X2,X3)) = X2 ),
inference(literals_permutation,[status(thm)],[c_0_114]) ).
cnf(c_0_115_0,axiom,
( shortest_path(X1,X2,X3)
| X1 = X2
| ~ path(X1,X2,X3)
| ~ less_or_equal(length_of(X3),length_of(sk1_esk6_3(X1,X2,X3))) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_115_1,axiom,
( X1 = X2
| shortest_path(X1,X2,X3)
| ~ path(X1,X2,X3)
| ~ less_or_equal(length_of(X3),length_of(sk1_esk6_3(X1,X2,X3))) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_115_2,axiom,
( ~ path(X1,X2,X3)
| X1 = X2
| shortest_path(X1,X2,X3)
| ~ less_or_equal(length_of(X3),length_of(sk1_esk6_3(X1,X2,X3))) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_115_3,axiom,
( ~ less_or_equal(length_of(X3),length_of(sk1_esk6_3(X1,X2,X3)))
| ~ path(X1,X2,X3)
| X1 = X2
| shortest_path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_115]) ).
cnf(c_0_116_0,axiom,
( path_cons(sk1_esk2_3(X1,X2,X3),empty) = X3
| path_cons(sk1_esk2_3(X1,X2,X3),sk1_esk3_3(X1,X2,X3)) = X3
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_116]) ).
cnf(c_0_116_1,axiom,
( path_cons(sk1_esk2_3(X1,X2,X3),sk1_esk3_3(X1,X2,X3)) = X3
| path_cons(sk1_esk2_3(X1,X2,X3),empty) = X3
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_116]) ).
cnf(c_0_116_2,axiom,
( ~ path(X1,X2,X3)
| path_cons(sk1_esk2_3(X1,X2,X3),sk1_esk3_3(X1,X2,X3)) = X3
| path_cons(sk1_esk2_3(X1,X2,X3),empty) = X3 ),
inference(literals_permutation,[status(thm)],[c_0_116]) ).
cnf(c_0_117_0,axiom,
( head_of(sk1_esk2_3(X1,X2,X3)) = X2
| path_cons(sk1_esk2_3(X1,X2,X3),sk1_esk3_3(X1,X2,X3)) = X3
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_117_1,axiom,
( path_cons(sk1_esk2_3(X1,X2,X3),sk1_esk3_3(X1,X2,X3)) = X3
| head_of(sk1_esk2_3(X1,X2,X3)) = X2
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_117_2,axiom,
( ~ path(X1,X2,X3)
| path_cons(sk1_esk2_3(X1,X2,X3),sk1_esk3_3(X1,X2,X3)) = X3
| head_of(sk1_esk2_3(X1,X2,X3)) = X2 ),
inference(literals_permutation,[status(thm)],[c_0_117]) ).
cnf(c_0_118_0,axiom,
( sequential(X4,X5)
| precedes(sk1_esk5_3(X3,X4,X5),X5,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_118_1,axiom,
( precedes(sk1_esk5_3(X3,X4,X5),X5,X3)
| sequential(X4,X5)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_118_2,axiom,
( ~ path(X1,X2,X3)
| precedes(sk1_esk5_3(X3,X4,X5),X5,X3)
| sequential(X4,X5)
| ~ precedes(X4,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_118_3,axiom,
( ~ precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| precedes(sk1_esk5_3(X3,X4,X5),X5,X3)
| sequential(X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_118]) ).
cnf(c_0_119_0,axiom,
( sequential(X4,X5)
| sequential(X4,sk1_esk5_3(X3,X4,X5))
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_119]) ).
cnf(c_0_119_1,axiom,
( sequential(X4,sk1_esk5_3(X3,X4,X5))
| sequential(X4,X5)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_119]) ).
cnf(c_0_119_2,axiom,
( ~ path(X1,X2,X3)
| sequential(X4,sk1_esk5_3(X3,X4,X5))
| sequential(X4,X5)
| ~ precedes(X4,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_119]) ).
cnf(c_0_119_3,axiom,
( ~ precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| sequential(X4,sk1_esk5_3(X3,X4,X5))
| sequential(X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_119]) ).
cnf(c_0_120_0,axiom,
( shortest_path(X1,X2,X3)
| X1 = X2
| path(X1,X2,sk1_esk6_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_120]) ).
cnf(c_0_120_1,axiom,
( X1 = X2
| shortest_path(X1,X2,X3)
| path(X1,X2,sk1_esk6_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_120]) ).
cnf(c_0_120_2,axiom,
( path(X1,X2,sk1_esk6_3(X1,X2,X3))
| X1 = X2
| shortest_path(X1,X2,X3)
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_120]) ).
cnf(c_0_120_3,axiom,
( ~ path(X1,X2,X3)
| path(X1,X2,sk1_esk6_3(X1,X2,X3))
| X1 = X2
| shortest_path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_120]) ).
cnf(c_0_121_0,axiom,
( ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3)
| ~ precedes(X6,X5,X3)
| ~ sequential(X4,X6)
| ~ sequential(X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_121]) ).
cnf(c_0_121_1,axiom,
( ~ precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X6,X5,X3)
| ~ sequential(X4,X6)
| ~ sequential(X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_121]) ).
cnf(c_0_121_2,axiom,
( ~ precedes(X6,X5,X3)
| ~ precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| ~ sequential(X4,X6)
| ~ sequential(X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_121]) ).
cnf(c_0_121_3,axiom,
( ~ sequential(X4,X6)
| ~ precedes(X6,X5,X3)
| ~ precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| ~ sequential(X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_121]) ).
cnf(c_0_121_4,axiom,
( ~ sequential(X4,X5)
| ~ sequential(X4,X6)
| ~ precedes(X6,X5,X3)
| ~ precedes(X4,X5,X3)
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_121]) ).
cnf(c_0_122_0,axiom,
( precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| ~ on_path(X4,X3)
| ~ on_path(X5,X3)
| ~ precedes(X6,X5,X3)
| ~ sequential(X4,X6) ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_122_1,axiom,
( ~ path(X1,X2,X3)
| precedes(X4,X5,X3)
| ~ on_path(X4,X3)
| ~ on_path(X5,X3)
| ~ precedes(X6,X5,X3)
| ~ sequential(X4,X6) ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_122_2,axiom,
( ~ on_path(X4,X3)
| ~ path(X1,X2,X3)
| precedes(X4,X5,X3)
| ~ on_path(X5,X3)
| ~ precedes(X6,X5,X3)
| ~ sequential(X4,X6) ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_122_3,axiom,
( ~ on_path(X5,X3)
| ~ on_path(X4,X3)
| ~ path(X1,X2,X3)
| precedes(X4,X5,X3)
| ~ precedes(X6,X5,X3)
| ~ sequential(X4,X6) ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_122_4,axiom,
( ~ precedes(X6,X5,X3)
| ~ on_path(X5,X3)
| ~ on_path(X4,X3)
| ~ path(X1,X2,X3)
| precedes(X4,X5,X3)
| ~ sequential(X4,X6) ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_122_5,axiom,
( ~ sequential(X4,X6)
| ~ precedes(X6,X5,X3)
| ~ on_path(X5,X3)
| ~ on_path(X4,X3)
| ~ path(X1,X2,X3)
| precedes(X4,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_122]) ).
cnf(c_0_123_0,axiom,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X2,X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_123]) ).
cnf(c_0_123_1,axiom,
( ~ shortest_path(X4,X5,X3)
| ~ precedes(X1,X2,X3)
| ~ precedes(X2,X1,X3) ),
inference(literals_permutation,[status(thm)],[c_0_123]) ).
cnf(c_0_123_2,axiom,
( ~ precedes(X2,X1,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_123]) ).
cnf(c_0_124_0,axiom,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1)
| ~ triangle(sk1_esk7_1(X1),sk1_esk8_1(X1),X4) ),
inference(literals_permutation,[status(thm)],[c_0_124]) ).
cnf(c_0_124_1,axiom,
( ~ path(X2,X3,X1)
| number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ triangle(sk1_esk7_1(X1),sk1_esk8_1(X1),X4) ),
inference(literals_permutation,[status(thm)],[c_0_124]) ).
cnf(c_0_124_2,axiom,
( ~ triangle(sk1_esk7_1(X1),sk1_esk8_1(X1),X4)
| ~ path(X2,X3,X1)
| number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1) ),
inference(literals_permutation,[status(thm)],[c_0_124]) ).
cnf(c_0_125_0,axiom,
( X1 = X2
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1)
| tail_of(sk1_esk1_2(X1,X2)) != X1
| head_of(sk1_esk1_2(X1,X2)) != X2
| tail_of(sk1_esk1_2(X1,X2)) != X2
| head_of(sk1_esk1_2(X1,X2)) != X1 ),
inference(literals_permutation,[status(thm)],[c_0_125]) ).
cnf(c_0_125_1,axiom,
( ~ complete
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1)
| tail_of(sk1_esk1_2(X1,X2)) != X1
| head_of(sk1_esk1_2(X1,X2)) != X2
| tail_of(sk1_esk1_2(X1,X2)) != X2
| head_of(sk1_esk1_2(X1,X2)) != X1 ),
inference(literals_permutation,[status(thm)],[c_0_125]) ).
cnf(c_0_125_2,axiom,
( ~ vertex(X2)
| ~ complete
| X1 = X2
| ~ vertex(X1)
| tail_of(sk1_esk1_2(X1,X2)) != X1
| head_of(sk1_esk1_2(X1,X2)) != X2
| tail_of(sk1_esk1_2(X1,X2)) != X2
| head_of(sk1_esk1_2(X1,X2)) != X1 ),
inference(literals_permutation,[status(thm)],[c_0_125]) ).
cnf(c_0_125_3,axiom,
( ~ vertex(X1)
| ~ vertex(X2)
| ~ complete
| X1 = X2
| tail_of(sk1_esk1_2(X1,X2)) != X1
| head_of(sk1_esk1_2(X1,X2)) != X2
| tail_of(sk1_esk1_2(X1,X2)) != X2
| head_of(sk1_esk1_2(X1,X2)) != X1 ),
inference(literals_permutation,[status(thm)],[c_0_125]) ).
cnf(c_0_125_4,axiom,
( tail_of(sk1_esk1_2(X1,X2)) != X1
| ~ vertex(X1)
| ~ vertex(X2)
| ~ complete
| X1 = X2
| head_of(sk1_esk1_2(X1,X2)) != X2
| tail_of(sk1_esk1_2(X1,X2)) != X2
| head_of(sk1_esk1_2(X1,X2)) != X1 ),
inference(literals_permutation,[status(thm)],[c_0_125]) ).
cnf(c_0_125_5,axiom,
( head_of(sk1_esk1_2(X1,X2)) != X2
| tail_of(sk1_esk1_2(X1,X2)) != X1
| ~ vertex(X1)
| ~ vertex(X2)
| ~ complete
| X1 = X2
| tail_of(sk1_esk1_2(X1,X2)) != X2
| head_of(sk1_esk1_2(X1,X2)) != X1 ),
inference(literals_permutation,[status(thm)],[c_0_125]) ).
cnf(c_0_125_6,axiom,
( tail_of(sk1_esk1_2(X1,X2)) != X2
| head_of(sk1_esk1_2(X1,X2)) != X2
| tail_of(sk1_esk1_2(X1,X2)) != X1
| ~ vertex(X1)
| ~ vertex(X2)
| ~ complete
| X1 = X2
| head_of(sk1_esk1_2(X1,X2)) != X1 ),
inference(literals_permutation,[status(thm)],[c_0_125]) ).
cnf(c_0_125_7,axiom,
( head_of(sk1_esk1_2(X1,X2)) != X1
| tail_of(sk1_esk1_2(X1,X2)) != X2
| head_of(sk1_esk1_2(X1,X2)) != X2
| tail_of(sk1_esk1_2(X1,X2)) != X1
| ~ vertex(X1)
| ~ vertex(X2)
| ~ complete
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_125]) ).
cnf(c_0_126_0,axiom,
( precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| ~ on_path(X4,X3)
| ~ on_path(X5,X3)
| ~ sequential(X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_126]) ).
cnf(c_0_126_1,axiom,
( ~ path(X1,X2,X3)
| precedes(X4,X5,X3)
| ~ on_path(X4,X3)
| ~ on_path(X5,X3)
| ~ sequential(X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_126]) ).
cnf(c_0_126_2,axiom,
( ~ on_path(X4,X3)
| ~ path(X1,X2,X3)
| precedes(X4,X5,X3)
| ~ on_path(X5,X3)
| ~ sequential(X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_126]) ).
cnf(c_0_126_3,axiom,
( ~ on_path(X5,X3)
| ~ on_path(X4,X3)
| ~ path(X1,X2,X3)
| precedes(X4,X5,X3)
| ~ sequential(X4,X5) ),
inference(literals_permutation,[status(thm)],[c_0_126]) ).
cnf(c_0_126_4,axiom,
( ~ sequential(X4,X5)
| ~ on_path(X5,X3)
| ~ on_path(X4,X3)
| ~ path(X1,X2,X3)
| precedes(X4,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_126]) ).
cnf(c_0_127_0,axiom,
( path(X1,X2,X3)
| ~ vertex(X1)
| ~ vertex(X2)
| ~ edge(X4)
| X1 != tail_of(X4)
| X3 != path_cons(X4,X5)
| ~ path(head_of(X4),X2,X5) ),
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_127_1,axiom,
( ~ vertex(X1)
| path(X1,X2,X3)
| ~ vertex(X2)
| ~ edge(X4)
| X1 != tail_of(X4)
| X3 != path_cons(X4,X5)
| ~ path(head_of(X4),X2,X5) ),
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_127_2,axiom,
( ~ vertex(X2)
| ~ vertex(X1)
| path(X1,X2,X3)
| ~ edge(X4)
| X1 != tail_of(X4)
| X3 != path_cons(X4,X5)
| ~ path(head_of(X4),X2,X5) ),
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_127_3,axiom,
( ~ edge(X4)
| ~ vertex(X2)
| ~ vertex(X1)
| path(X1,X2,X3)
| X1 != tail_of(X4)
| X3 != path_cons(X4,X5)
| ~ path(head_of(X4),X2,X5) ),
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_127_4,axiom,
( X1 != tail_of(X4)
| ~ edge(X4)
| ~ vertex(X2)
| ~ vertex(X1)
| path(X1,X2,X3)
| X3 != path_cons(X4,X5)
| ~ path(head_of(X4),X2,X5) ),
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_127_5,axiom,
( X3 != path_cons(X4,X5)
| X1 != tail_of(X4)
| ~ edge(X4)
| ~ vertex(X2)
| ~ vertex(X1)
| path(X1,X2,X3)
| ~ path(head_of(X4),X2,X5) ),
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_127_6,axiom,
( ~ path(head_of(X4),X2,X5)
| X3 != path_cons(X4,X5)
| X1 != tail_of(X4)
| ~ edge(X4)
| ~ vertex(X2)
| ~ vertex(X1)
| path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_127]) ).
cnf(c_0_128_0,axiom,
( less_or_equal(length_of(X3),length_of(X4))
| ~ shortest_path(X1,X2,X3)
| ~ path(X1,X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_128]) ).
cnf(c_0_128_1,axiom,
( ~ shortest_path(X1,X2,X3)
| less_or_equal(length_of(X3),length_of(X4))
| ~ path(X1,X2,X4) ),
inference(literals_permutation,[status(thm)],[c_0_128]) ).
cnf(c_0_128_2,axiom,
( ~ path(X1,X2,X4)
| ~ shortest_path(X1,X2,X3)
| less_or_equal(length_of(X3),length_of(X4)) ),
inference(literals_permutation,[status(thm)],[c_0_128]) ).
cnf(c_0_129_0,axiom,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| head_of(X6) != head_of(X2)
| tail_of(X6) != tail_of(X1) ),
inference(literals_permutation,[status(thm)],[c_0_129]) ).
cnf(c_0_129_1,axiom,
( ~ shortest_path(X4,X5,X3)
| ~ precedes(X1,X2,X3)
| head_of(X6) != head_of(X2)
| tail_of(X6) != tail_of(X1) ),
inference(literals_permutation,[status(thm)],[c_0_129]) ).
cnf(c_0_129_2,axiom,
( head_of(X6) != head_of(X2)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X1,X2,X3)
| tail_of(X6) != tail_of(X1) ),
inference(literals_permutation,[status(thm)],[c_0_129]) ).
cnf(c_0_129_3,axiom,
( tail_of(X6) != tail_of(X1)
| head_of(X6) != head_of(X2)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_129]) ).
cnf(c_0_130_0,axiom,
( tail_of(sk1_esk2_3(X1,X2,X3)) = X1
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_130]) ).
cnf(c_0_130_1,axiom,
( ~ path(X1,X2,X3)
| tail_of(sk1_esk2_3(X1,X2,X3)) = X1 ),
inference(literals_permutation,[status(thm)],[c_0_130]) ).
cnf(c_0_131_0,axiom,
( edge(sk1_esk2_3(X1,X2,X3))
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_131]) ).
cnf(c_0_131_1,axiom,
( ~ path(X1,X2,X3)
| edge(sk1_esk2_3(X1,X2,X3)) ),
inference(literals_permutation,[status(thm)],[c_0_131]) ).
cnf(c_0_132_0,axiom,
( on_path(X4,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_132]) ).
cnf(c_0_132_1,axiom,
( ~ path(X1,X2,X3)
| on_path(X4,X3)
| ~ precedes(X4,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_132]) ).
cnf(c_0_132_2,axiom,
( ~ precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| on_path(X4,X3) ),
inference(literals_permutation,[status(thm)],[c_0_132]) ).
cnf(c_0_133_0,axiom,
( on_path(X5,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_133]) ).
cnf(c_0_133_1,axiom,
( ~ path(X1,X2,X3)
| on_path(X5,X3)
| ~ precedes(X4,X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_133]) ).
cnf(c_0_133_2,axiom,
( ~ precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| on_path(X5,X3) ),
inference(literals_permutation,[status(thm)],[c_0_133]) ).
cnf(c_0_134_0,axiom,
( triangle(X1,X2,X3)
| ~ sequential(X3,X1)
| ~ sequential(X2,X3)
| ~ sequential(X1,X2)
| ~ edge(X3)
| ~ edge(X2)
| ~ edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_134]) ).
cnf(c_0_134_1,axiom,
( ~ sequential(X3,X1)
| triangle(X1,X2,X3)
| ~ sequential(X2,X3)
| ~ sequential(X1,X2)
| ~ edge(X3)
| ~ edge(X2)
| ~ edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_134]) ).
cnf(c_0_134_2,axiom,
( ~ sequential(X2,X3)
| ~ sequential(X3,X1)
| triangle(X1,X2,X3)
| ~ sequential(X1,X2)
| ~ edge(X3)
| ~ edge(X2)
| ~ edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_134]) ).
cnf(c_0_134_3,axiom,
( ~ sequential(X1,X2)
| ~ sequential(X2,X3)
| ~ sequential(X3,X1)
| triangle(X1,X2,X3)
| ~ edge(X3)
| ~ edge(X2)
| ~ edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_134]) ).
cnf(c_0_134_4,axiom,
( ~ edge(X3)
| ~ sequential(X1,X2)
| ~ sequential(X2,X3)
| ~ sequential(X3,X1)
| triangle(X1,X2,X3)
| ~ edge(X2)
| ~ edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_134]) ).
cnf(c_0_134_5,axiom,
( ~ edge(X2)
| ~ edge(X3)
| ~ sequential(X1,X2)
| ~ sequential(X2,X3)
| ~ sequential(X3,X1)
| triangle(X1,X2,X3)
| ~ edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_134]) ).
cnf(c_0_134_6,axiom,
( ~ edge(X1)
| ~ edge(X2)
| ~ edge(X3)
| ~ sequential(X1,X2)
| ~ sequential(X2,X3)
| ~ sequential(X3,X1)
| triangle(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_134]) ).
cnf(c_0_135_0,axiom,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_135]) ).
cnf(c_0_135_1,axiom,
( ~ shortest_path(X1,X2,X3)
| path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_135]) ).
cnf(c_0_136_0,axiom,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| sequential(sk1_esk7_1(X1),sk1_esk8_1(X1))
| ~ path(X2,X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_136]) ).
cnf(c_0_136_1,axiom,
( sequential(sk1_esk7_1(X1),sk1_esk8_1(X1))
| number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_136]) ).
cnf(c_0_136_2,axiom,
( ~ path(X2,X3,X1)
| sequential(sk1_esk7_1(X1),sk1_esk8_1(X1))
| number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1) ),
inference(literals_permutation,[status(thm)],[c_0_136]) ).
cnf(c_0_137_0,axiom,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(sk1_esk7_1(X1),X1)
| ~ path(X2,X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_137]) ).
cnf(c_0_137_1,axiom,
( on_path(sk1_esk7_1(X1),X1)
| number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_137]) ).
cnf(c_0_137_2,axiom,
( ~ path(X2,X3,X1)
| on_path(sk1_esk7_1(X1),X1)
| number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1) ),
inference(literals_permutation,[status(thm)],[c_0_137]) ).
cnf(c_0_138_0,axiom,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(sk1_esk8_1(X1),X1)
| ~ path(X2,X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_138]) ).
cnf(c_0_138_1,axiom,
( on_path(sk1_esk8_1(X1),X1)
| number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_138]) ).
cnf(c_0_138_2,axiom,
( ~ path(X2,X3,X1)
| on_path(sk1_esk8_1(X1),X1)
| number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1) ),
inference(literals_permutation,[status(thm)],[c_0_138]) ).
cnf(c_0_139_0,axiom,
( in_path(head_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_139]) ).
cnf(c_0_139_1,axiom,
( ~ on_path(X1,X2)
| in_path(head_of(X1),X2)
| ~ path(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_139]) ).
cnf(c_0_139_2,axiom,
( ~ path(X3,X4,X2)
| ~ on_path(X1,X2)
| in_path(head_of(X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_139]) ).
cnf(c_0_140_0,axiom,
( in_path(tail_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_140]) ).
cnf(c_0_140_1,axiom,
( ~ on_path(X1,X2)
| in_path(tail_of(X1),X2)
| ~ path(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_140]) ).
cnf(c_0_140_2,axiom,
( ~ path(X3,X4,X2)
| ~ on_path(X1,X2)
| in_path(tail_of(X1),X2) ),
inference(literals_permutation,[status(thm)],[c_0_140]) ).
cnf(c_0_141_0,axiom,
( minus(length_of(X1),n1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_141]) ).
cnf(c_0_141_1,axiom,
( ~ path(X2,X3,X1)
| minus(length_of(X1),n1) = number_of_in(sequential_pairs,X1) ),
inference(literals_permutation,[status(thm)],[c_0_141]) ).
cnf(c_0_142_0,axiom,
( path(X1,X2,X3)
| ~ vertex(X1)
| ~ vertex(X2)
| ~ edge(X4)
| X1 != tail_of(X4)
| X3 != path_cons(X4,empty)
| X2 != head_of(X4) ),
inference(literals_permutation,[status(thm)],[c_0_142]) ).
cnf(c_0_142_1,axiom,
( ~ vertex(X1)
| path(X1,X2,X3)
| ~ vertex(X2)
| ~ edge(X4)
| X1 != tail_of(X4)
| X3 != path_cons(X4,empty)
| X2 != head_of(X4) ),
inference(literals_permutation,[status(thm)],[c_0_142]) ).
cnf(c_0_142_2,axiom,
( ~ vertex(X2)
| ~ vertex(X1)
| path(X1,X2,X3)
| ~ edge(X4)
| X1 != tail_of(X4)
| X3 != path_cons(X4,empty)
| X2 != head_of(X4) ),
inference(literals_permutation,[status(thm)],[c_0_142]) ).
cnf(c_0_142_3,axiom,
( ~ edge(X4)
| ~ vertex(X2)
| ~ vertex(X1)
| path(X1,X2,X3)
| X1 != tail_of(X4)
| X3 != path_cons(X4,empty)
| X2 != head_of(X4) ),
inference(literals_permutation,[status(thm)],[c_0_142]) ).
cnf(c_0_142_4,axiom,
( X1 != tail_of(X4)
| ~ edge(X4)
| ~ vertex(X2)
| ~ vertex(X1)
| path(X1,X2,X3)
| X3 != path_cons(X4,empty)
| X2 != head_of(X4) ),
inference(literals_permutation,[status(thm)],[c_0_142]) ).
cnf(c_0_142_5,axiom,
( X3 != path_cons(X4,empty)
| X1 != tail_of(X4)
| ~ edge(X4)
| ~ vertex(X2)
| ~ vertex(X1)
| path(X1,X2,X3)
| X2 != head_of(X4) ),
inference(literals_permutation,[status(thm)],[c_0_142]) ).
cnf(c_0_142_6,axiom,
( X2 != head_of(X4)
| X3 != path_cons(X4,empty)
| X1 != tail_of(X4)
| ~ edge(X4)
| ~ vertex(X2)
| ~ vertex(X1)
| path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_142]) ).
cnf(c_0_143_0,axiom,
( vertex(X1)
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_143]) ).
cnf(c_0_143_1,axiom,
( ~ in_path(X1,X2)
| vertex(X1)
| ~ path(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_143]) ).
cnf(c_0_143_2,axiom,
( ~ path(X3,X4,X2)
| ~ in_path(X1,X2)
| vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_143]) ).
cnf(c_0_144_0,axiom,
( edge(X1)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_144]) ).
cnf(c_0_144_1,axiom,
( ~ on_path(X1,X2)
| edge(X1)
| ~ path(X3,X4,X2) ),
inference(literals_permutation,[status(thm)],[c_0_144]) ).
cnf(c_0_144_2,axiom,
( ~ path(X3,X4,X2)
| ~ on_path(X1,X2)
| edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_144]) ).
cnf(c_0_145_0,axiom,
( number_of_in(edges,X1) = length_of(X1)
| ~ path(X2,X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_145]) ).
cnf(c_0_145_1,axiom,
( ~ path(X2,X3,X1)
| number_of_in(edges,X1) = length_of(X1) ),
inference(literals_permutation,[status(thm)],[c_0_145]) ).
cnf(c_0_146_0,axiom,
( sequential(X1,X2)
| ~ triangle(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_146]) ).
cnf(c_0_146_1,axiom,
( ~ triangle(X1,X2,X3)
| sequential(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_146]) ).
cnf(c_0_147_0,axiom,
( sequential(X2,X3)
| ~ triangle(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_147]) ).
cnf(c_0_147_1,axiom,
( ~ triangle(X1,X2,X3)
| sequential(X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_147]) ).
cnf(c_0_148_0,axiom,
( sequential(X3,X1)
| ~ triangle(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_148]) ).
cnf(c_0_148_1,axiom,
( ~ triangle(X1,X2,X3)
| sequential(X3,X1) ),
inference(literals_permutation,[status(thm)],[c_0_148]) ).
cnf(c_0_149_0,axiom,
( edge(X1)
| ~ triangle(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_149]) ).
cnf(c_0_149_1,axiom,
( ~ triangle(X1,X2,X3)
| edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_149]) ).
cnf(c_0_150_0,axiom,
( edge(X2)
| ~ triangle(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_150]) ).
cnf(c_0_150_1,axiom,
( ~ triangle(X1,X2,X3)
| edge(X2) ),
inference(literals_permutation,[status(thm)],[c_0_150]) ).
cnf(c_0_151_0,axiom,
( edge(X3)
| ~ triangle(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_151]) ).
cnf(c_0_151_1,axiom,
( ~ triangle(X1,X2,X3)
| edge(X3) ),
inference(literals_permutation,[status(thm)],[c_0_151]) ).
cnf(c_0_152_0,axiom,
( vertex(X1)
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_152]) ).
cnf(c_0_152_1,axiom,
( ~ path(X1,X2,X3)
| vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_152]) ).
cnf(c_0_153_0,axiom,
( vertex(X2)
| ~ path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_153]) ).
cnf(c_0_153_1,axiom,
( ~ path(X1,X2,X3)
| vertex(X2) ),
inference(literals_permutation,[status(thm)],[c_0_153]) ).
cnf(c_0_154_0,axiom,
( ~ shortest_path(X1,X2,X3)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_154]) ).
cnf(c_0_154_1,axiom,
( X1 != X2
| ~ shortest_path(X1,X2,X3) ),
inference(literals_permutation,[status(thm)],[c_0_154]) ).
cnf(c_0_155_0,axiom,
( X1 = X2
| head_of(sk1_esk1_2(X1,X2)) = X1
| head_of(sk1_esk1_2(X1,X2)) = X2
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_155]) ).
cnf(c_0_155_1,axiom,
( head_of(sk1_esk1_2(X1,X2)) = X1
| X1 = X2
| head_of(sk1_esk1_2(X1,X2)) = X2
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_155]) ).
cnf(c_0_155_2,axiom,
( head_of(sk1_esk1_2(X1,X2)) = X2
| head_of(sk1_esk1_2(X1,X2)) = X1
| X1 = X2
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_155]) ).
cnf(c_0_155_3,axiom,
( ~ complete
| head_of(sk1_esk1_2(X1,X2)) = X2
| head_of(sk1_esk1_2(X1,X2)) = X1
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_155]) ).
cnf(c_0_155_4,axiom,
( ~ vertex(X2)
| ~ complete
| head_of(sk1_esk1_2(X1,X2)) = X2
| head_of(sk1_esk1_2(X1,X2)) = X1
| X1 = X2
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_155]) ).
cnf(c_0_155_5,axiom,
( ~ vertex(X1)
| ~ vertex(X2)
| ~ complete
| head_of(sk1_esk1_2(X1,X2)) = X2
| head_of(sk1_esk1_2(X1,X2)) = X1
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_155]) ).
cnf(c_0_156_0,axiom,
( X1 = X2
| head_of(sk1_esk1_2(X1,X2)) = X1
| tail_of(sk1_esk1_2(X1,X2)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_156]) ).
cnf(c_0_156_1,axiom,
( head_of(sk1_esk1_2(X1,X2)) = X1
| X1 = X2
| tail_of(sk1_esk1_2(X1,X2)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_156]) ).
cnf(c_0_156_2,axiom,
( tail_of(sk1_esk1_2(X1,X2)) = X1
| head_of(sk1_esk1_2(X1,X2)) = X1
| X1 = X2
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_156]) ).
cnf(c_0_156_3,axiom,
( ~ complete
| tail_of(sk1_esk1_2(X1,X2)) = X1
| head_of(sk1_esk1_2(X1,X2)) = X1
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_156]) ).
cnf(c_0_156_4,axiom,
( ~ vertex(X2)
| ~ complete
| tail_of(sk1_esk1_2(X1,X2)) = X1
| head_of(sk1_esk1_2(X1,X2)) = X1
| X1 = X2
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_156]) ).
cnf(c_0_156_5,axiom,
( ~ vertex(X1)
| ~ vertex(X2)
| ~ complete
| tail_of(sk1_esk1_2(X1,X2)) = X1
| head_of(sk1_esk1_2(X1,X2)) = X1
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_156]) ).
cnf(c_0_157_0,axiom,
( X1 = X2
| tail_of(sk1_esk1_2(X1,X2)) = X2
| head_of(sk1_esk1_2(X1,X2)) = X2
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_157]) ).
cnf(c_0_157_1,axiom,
( tail_of(sk1_esk1_2(X1,X2)) = X2
| X1 = X2
| head_of(sk1_esk1_2(X1,X2)) = X2
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_157]) ).
cnf(c_0_157_2,axiom,
( head_of(sk1_esk1_2(X1,X2)) = X2
| tail_of(sk1_esk1_2(X1,X2)) = X2
| X1 = X2
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_157]) ).
cnf(c_0_157_3,axiom,
( ~ complete
| head_of(sk1_esk1_2(X1,X2)) = X2
| tail_of(sk1_esk1_2(X1,X2)) = X2
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_157]) ).
cnf(c_0_157_4,axiom,
( ~ vertex(X2)
| ~ complete
| head_of(sk1_esk1_2(X1,X2)) = X2
| tail_of(sk1_esk1_2(X1,X2)) = X2
| X1 = X2
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_157]) ).
cnf(c_0_157_5,axiom,
( ~ vertex(X1)
| ~ vertex(X2)
| ~ complete
| head_of(sk1_esk1_2(X1,X2)) = X2
| tail_of(sk1_esk1_2(X1,X2)) = X2
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_157]) ).
cnf(c_0_158_0,axiom,
( X1 = X2
| tail_of(sk1_esk1_2(X1,X2)) = X2
| tail_of(sk1_esk1_2(X1,X2)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_158]) ).
cnf(c_0_158_1,axiom,
( tail_of(sk1_esk1_2(X1,X2)) = X2
| X1 = X2
| tail_of(sk1_esk1_2(X1,X2)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_158]) ).
cnf(c_0_158_2,axiom,
( tail_of(sk1_esk1_2(X1,X2)) = X1
| tail_of(sk1_esk1_2(X1,X2)) = X2
| X1 = X2
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_158]) ).
cnf(c_0_158_3,axiom,
( ~ complete
| tail_of(sk1_esk1_2(X1,X2)) = X1
| tail_of(sk1_esk1_2(X1,X2)) = X2
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_158]) ).
cnf(c_0_158_4,axiom,
( ~ vertex(X2)
| ~ complete
| tail_of(sk1_esk1_2(X1,X2)) = X1
| tail_of(sk1_esk1_2(X1,X2)) = X2
| X1 = X2
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_158]) ).
cnf(c_0_158_5,axiom,
( ~ vertex(X1)
| ~ vertex(X2)
| ~ complete
| tail_of(sk1_esk1_2(X1,X2)) = X1
| tail_of(sk1_esk1_2(X1,X2)) = X2
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_158]) ).
cnf(c_0_160_0,axiom,
( X1 = X2
| edge(sk1_esk1_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_160]) ).
cnf(c_0_160_1,axiom,
( edge(sk1_esk1_2(X1,X2))
| X1 = X2
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_160]) ).
cnf(c_0_160_2,axiom,
( ~ complete
| edge(sk1_esk1_2(X1,X2))
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_160]) ).
cnf(c_0_160_3,axiom,
( ~ vertex(X2)
| ~ complete
| edge(sk1_esk1_2(X1,X2))
| X1 = X2
| ~ vertex(X1) ),
inference(literals_permutation,[status(thm)],[c_0_160]) ).
cnf(c_0_160_4,axiom,
( ~ vertex(X1)
| ~ vertex(X2)
| ~ complete
| edge(sk1_esk1_2(X1,X2))
| X1 = X2 ),
inference(literals_permutation,[status(thm)],[c_0_160]) ).
cnf(c_0_161_0,axiom,
( sequential(X1,X2)
| X1 = X2
| head_of(X1) != tail_of(X2)
| ~ edge(X2)
| ~ edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_161]) ).
cnf(c_0_161_1,axiom,
( X1 = X2
| sequential(X1,X2)
| head_of(X1) != tail_of(X2)
| ~ edge(X2)
| ~ edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_161]) ).
cnf(c_0_161_2,axiom,
( head_of(X1) != tail_of(X2)
| X1 = X2
| sequential(X1,X2)
| ~ edge(X2)
| ~ edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_161]) ).
cnf(c_0_161_3,axiom,
( ~ edge(X2)
| head_of(X1) != tail_of(X2)
| X1 = X2
| sequential(X1,X2)
| ~ edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_161]) ).
cnf(c_0_161_4,axiom,
( ~ edge(X1)
| ~ edge(X2)
| head_of(X1) != tail_of(X2)
| X1 = X2
| sequential(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_161]) ).
cnf(c_0_162_0,axiom,
( head_of(X1) = tail_of(X2)
| ~ sequential(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_162]) ).
cnf(c_0_162_1,axiom,
( ~ sequential(X1,X2)
| head_of(X1) = tail_of(X2) ),
inference(literals_permutation,[status(thm)],[c_0_162]) ).
cnf(c_0_163_0,axiom,
( edge(X1)
| ~ sequential(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_163]) ).
cnf(c_0_163_1,axiom,
( ~ sequential(X1,X2)
| edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_163]) ).
cnf(c_0_164_0,axiom,
( edge(X2)
| ~ sequential(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_164]) ).
cnf(c_0_164_1,axiom,
( ~ sequential(X1,X2)
| edge(X2) ),
inference(literals_permutation,[status(thm)],[c_0_164]) ).
cnf(c_0_165_0,axiom,
( ~ sequential(X1,X2)
| X1 != X2 ),
inference(literals_permutation,[status(thm)],[c_0_165]) ).
cnf(c_0_165_1,axiom,
( X1 != X2
| ~ sequential(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_165]) ).
cnf(c_0_166_0,axiom,
( head_of(X1) != tail_of(X1)
| ~ edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_166]) ).
cnf(c_0_166_1,axiom,
( ~ edge(X1)
| head_of(X1) != tail_of(X1) ),
inference(literals_permutation,[status(thm)],[c_0_166]) ).
cnf(c_0_167_0,axiom,
( vertex(head_of(X1))
| ~ edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_167]) ).
cnf(c_0_167_1,axiom,
( ~ edge(X1)
| vertex(head_of(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_167]) ).
cnf(c_0_168_0,axiom,
( vertex(tail_of(X1))
| ~ edge(X1) ),
inference(literals_permutation,[status(thm)],[c_0_168]) ).
cnf(c_0_168_1,axiom,
( ~ edge(X1)
| vertex(tail_of(X1)) ),
inference(literals_permutation,[status(thm)],[c_0_168]) ).
cnf(c_0_159_0,axiom,
less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),
inference(literals_permutation,[status(thm)],[c_0_159]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
( complete
=> ! [X1,X2,X3] :
( ( path(X2,X3,X1)
& ! [X4,X5] :
( ( on_path(X4,X1)
& on_path(X5,X1)
& sequential(X4,X5) )
=> ? [X6] : triangle(X4,X5,X6) ) )
=> number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1) ) ),
file('<stdin>',complete_means_sequential_pairs_and_triangles) ).
fof(c_0_1_002,negated_conjecture,
~ ( complete
=> ! [X1,X2,X3] :
( ( path(X2,X3,X1)
& ! [X4,X5] :
( ( on_path(X4,X1)
& on_path(X5,X1)
& sequential(X4,X5) )
=> ? [X6] : triangle(X4,X5,X6) ) )
=> number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1) ) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
! [X10,X11] :
( complete
& path(esk2_0,esk3_0,esk1_0)
& ( ~ on_path(X10,esk1_0)
| ~ on_path(X11,esk1_0)
| ~ sequential(X10,X11)
| triangle(X10,X11,esk4_2(X10,X11)) )
& number_of_in(sequential_pairs,esk1_0) != number_of_in(triangles,esk1_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3_004,negated_conjecture,
( triangle(X1,X2,esk4_2(X1,X2))
| ~ sequential(X1,X2)
| ~ on_path(X2,esk1_0)
| ~ on_path(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
path(esk2_0,esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5_006,negated_conjecture,
number_of_in(sequential_pairs,esk1_0) != number_of_in(triangles,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6_007,negated_conjecture,
complete,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7_008,negated_conjecture,
( triangle(X1,X2,esk4_2(X1,X2))
| ~ sequential(X1,X2)
| ~ on_path(X2,esk1_0)
| ~ on_path(X1,esk1_0) ),
c_0_3,
[final] ).
cnf(c_0_8_009,negated_conjecture,
path(esk2_0,esk3_0,esk1_0),
c_0_4,
[final] ).
cnf(c_0_9_010,negated_conjecture,
number_of_in(triangles,esk1_0) != number_of_in(sequential_pairs,esk1_0),
c_0_5,
[final] ).
cnf(c_0_10_011,negated_conjecture,
complete,
c_0_6,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_145,plain,
( number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0)
| ~ path(X1,X2,X0)
| ~ triangle(sk1_esk7_1(X0),sk1_esk8_1(X0),X3) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_886c94.p',c_0_124_2) ).
cnf(c_429,plain,
( number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0)
| ~ path(X1,X2,X0)
| ~ triangle(sk1_esk7_1(X0),sk1_esk8_1(X0),X3) ),
inference(copy,[status(esa)],[c_145]) ).
cnf(c_38362,plain,
( ~ path(sk2_esk2_0,sk2_esk3_0,sk2_esk1_0)
| ~ triangle(sk1_esk7_1(sk2_esk1_0),sk1_esk8_1(sk2_esk1_0),X0)
| number_of_in(triangles,sk2_esk1_0) = number_of_in(sequential_pairs,sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_429]) ).
cnf(c_38826,plain,
( ~ path(sk2_esk2_0,sk2_esk3_0,sk2_esk1_0)
| ~ triangle(sk1_esk7_1(sk2_esk1_0),sk1_esk8_1(sk2_esk1_0),sk2_esk4_2(sk1_esk7_1(sk2_esk1_0),sk1_esk8_1(sk2_esk1_0)))
| number_of_in(triangles,sk2_esk1_0) = number_of_in(sequential_pairs,sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_38362]) ).
cnf(c_202,negated_conjecture,
( ~ sequential(X0,X1)
| triangle(X0,X1,sk2_esk4_2(X0,X1))
| ~ on_path(X0,sk2_esk1_0)
| ~ on_path(X1,sk2_esk1_0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_886c94.p',c_0_7) ).
cnf(c_256,negated_conjecture,
( ~ sequential(X0,X1)
| triangle(X0,X1,sk2_esk4_2(X0,X1))
| ~ on_path(X0,sk2_esk1_0)
| ~ on_path(X1,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_202]) ).
cnf(c_272,negated_conjecture,
( ~ sequential(X0,X1)
| triangle(X0,X1,sk2_esk4_2(X0,X1))
| ~ on_path(X0,sk2_esk1_0)
| ~ on_path(X1,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_256]) ).
cnf(c_279,negated_conjecture,
( ~ sequential(X0,X1)
| triangle(X0,X1,sk2_esk4_2(X0,X1))
| ~ on_path(X0,sk2_esk1_0)
| ~ on_path(X1,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_272]) ).
cnf(c_280,negated_conjecture,
( ~ sequential(X0,X1)
| triangle(X0,X1,sk2_esk4_2(X0,X1))
| ~ on_path(X0,sk2_esk1_0)
| ~ on_path(X1,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_279]) ).
cnf(c_486,negated_conjecture,
( ~ sequential(X0,X1)
| triangle(X0,X1,sk2_esk4_2(X0,X1))
| ~ on_path(X0,sk2_esk1_0)
| ~ on_path(X1,sk2_esk1_0) ),
inference(copy,[status(esa)],[c_280]) ).
cnf(c_38584,plain,
( ~ sequential(sk1_esk7_1(sk2_esk1_0),X0)
| triangle(sk1_esk7_1(sk2_esk1_0),X0,sk2_esk4_2(sk1_esk7_1(sk2_esk1_0),X0))
| ~ on_path(sk1_esk7_1(sk2_esk1_0),sk2_esk1_0)
| ~ on_path(X0,sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_486]) ).
cnf(c_38628,plain,
( ~ sequential(sk1_esk7_1(sk2_esk1_0),sk1_esk8_1(sk2_esk1_0))
| triangle(sk1_esk7_1(sk2_esk1_0),sk1_esk8_1(sk2_esk1_0),sk2_esk4_2(sk1_esk7_1(sk2_esk1_0),sk1_esk8_1(sk2_esk1_0)))
| ~ on_path(sk1_esk8_1(sk2_esk1_0),sk2_esk1_0)
| ~ on_path(sk1_esk7_1(sk2_esk1_0),sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_38584]) ).
cnf(c_96,plain,
( number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0)
| sequential(sk1_esk7_1(X0),sk1_esk8_1(X0))
| ~ path(X1,X2,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_886c94.p',c_0_136_2) ).
cnf(c_380,plain,
( number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0)
| sequential(sk1_esk7_1(X0),sk1_esk8_1(X0))
| ~ path(X1,X2,X0) ),
inference(copy,[status(esa)],[c_96]) ).
cnf(c_38351,plain,
( sequential(sk1_esk7_1(sk2_esk1_0),sk1_esk8_1(sk2_esk1_0))
| ~ path(sk2_esk2_0,sk2_esk3_0,sk2_esk1_0)
| number_of_in(triangles,sk2_esk1_0) = number_of_in(sequential_pairs,sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_380]) ).
cnf(c_93,plain,
( number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0)
| on_path(sk1_esk7_1(X0),X0)
| ~ path(X1,X2,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_886c94.p',c_0_137_2) ).
cnf(c_377,plain,
( number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0)
| on_path(sk1_esk7_1(X0),X0)
| ~ path(X1,X2,X0) ),
inference(copy,[status(esa)],[c_93]) ).
cnf(c_38348,plain,
( ~ path(sk2_esk2_0,sk2_esk3_0,sk2_esk1_0)
| on_path(sk1_esk7_1(sk2_esk1_0),sk2_esk1_0)
| number_of_in(triangles,sk2_esk1_0) = number_of_in(sequential_pairs,sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_377]) ).
cnf(c_90,plain,
( number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0)
| on_path(sk1_esk8_1(X0),X0)
| ~ path(X1,X2,X0) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_886c94.p',c_0_138_2) ).
cnf(c_374,plain,
( number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0)
| on_path(sk1_esk8_1(X0),X0)
| ~ path(X1,X2,X0) ),
inference(copy,[status(esa)],[c_90]) ).
cnf(c_38345,plain,
( ~ path(sk2_esk2_0,sk2_esk3_0,sk2_esk1_0)
| on_path(sk1_esk8_1(sk2_esk1_0),sk2_esk1_0)
| number_of_in(triangles,sk2_esk1_0) = number_of_in(sequential_pairs,sk2_esk1_0) ),
inference(instantiation,[status(thm)],[c_374]) ).
cnf(c_203,negated_conjecture,
number_of_in(triangles,sk2_esk1_0) != number_of_in(sequential_pairs,sk2_esk1_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_886c94.p',c_0_9) ).
cnf(c_204,negated_conjecture,
path(sk2_esk2_0,sk2_esk3_0,sk2_esk1_0),
file('/export/starexec/sandbox/tmp/iprover_modulo_886c94.p',c_0_8) ).
cnf(contradiction,plain,
$false,
inference(minisat,[status(thm)],[c_38826,c_38628,c_38351,c_38348,c_38345,c_203,c_204]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.07/0.14 % Command : iprover_modulo %s %d
% 0.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon May 30 23:06:40 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % Running in mono-core mode
% 0.22/0.44 % Orienting using strategy Equiv(ClausalAll)
% 0.22/0.44 % FOF problem with conjecture
% 0.22/0.44 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_fe9297.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_886c94.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_b29c31 | grep -v "SZS"
% 0.22/0.47
% 0.22/0.47 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.22/0.47
% 0.22/0.47 %
% 0.22/0.47 % ------ iProver source info
% 0.22/0.47
% 0.22/0.47 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.22/0.47 % git: non_committed_changes: true
% 0.22/0.47 % git: last_make_outside_of_git: true
% 0.22/0.47
% 0.22/0.47 %
% 0.22/0.47 % ------ Input Options
% 0.22/0.47
% 0.22/0.47 % --out_options all
% 0.22/0.47 % --tptp_safe_out true
% 0.22/0.47 % --problem_path ""
% 0.22/0.47 % --include_path ""
% 0.22/0.47 % --clausifier .//eprover
% 0.22/0.47 % --clausifier_options --tstp-format
% 0.22/0.47 % --stdin false
% 0.22/0.47 % --dbg_backtrace false
% 0.22/0.47 % --dbg_dump_prop_clauses false
% 0.22/0.47 % --dbg_dump_prop_clauses_file -
% 0.22/0.47 % --dbg_out_stat false
% 0.22/0.47
% 0.22/0.47 % ------ General Options
% 0.22/0.47
% 0.22/0.47 % --fof false
% 0.22/0.47 % --time_out_real 150.
% 0.22/0.47 % --time_out_prep_mult 0.2
% 0.22/0.47 % --time_out_virtual -1.
% 0.22/0.47 % --schedule none
% 0.22/0.47 % --ground_splitting input
% 0.22/0.47 % --splitting_nvd 16
% 0.22/0.47 % --non_eq_to_eq false
% 0.22/0.47 % --prep_gs_sim true
% 0.22/0.47 % --prep_unflatten false
% 0.22/0.47 % --prep_res_sim true
% 0.22/0.47 % --prep_upred true
% 0.22/0.47 % --res_sim_input true
% 0.22/0.47 % --clause_weak_htbl true
% 0.22/0.47 % --gc_record_bc_elim false
% 0.22/0.47 % --symbol_type_check false
% 0.22/0.47 % --clausify_out false
% 0.22/0.47 % --large_theory_mode false
% 0.22/0.47 % --prep_sem_filter none
% 0.22/0.47 % --prep_sem_filter_out false
% 0.22/0.47 % --preprocessed_out false
% 0.22/0.47 % --sub_typing false
% 0.22/0.47 % --brand_transform false
% 0.22/0.47 % --pure_diseq_elim true
% 0.22/0.47 % --min_unsat_core false
% 0.22/0.47 % --pred_elim true
% 0.22/0.47 % --add_important_lit false
% 0.22/0.47 % --soft_assumptions false
% 0.22/0.47 % --reset_solvers false
% 0.22/0.47 % --bc_imp_inh []
% 0.22/0.47 % --conj_cone_tolerance 1.5
% 0.22/0.47 % --prolific_symb_bound 500
% 0.22/0.47 % --lt_threshold 2000
% 0.22/0.47
% 0.22/0.47 % ------ SAT Options
% 0.22/0.47
% 0.22/0.47 % --sat_mode false
% 0.22/0.47 % --sat_fm_restart_options ""
% 0.22/0.47 % --sat_gr_def false
% 0.22/0.47 % --sat_epr_types true
% 0.22/0.47 % --sat_non_cyclic_types false
% 0.22/0.47 % --sat_finite_models false
% 0.22/0.47 % --sat_fm_lemmas false
% 0.22/0.47 % --sat_fm_prep false
% 0.22/0.47 % --sat_fm_uc_incr true
% 0.22/0.47 % --sat_out_model small
% 0.22/0.47 % --sat_out_clauses false
% 0.22/0.47
% 0.22/0.47 % ------ QBF Options
% 0.22/0.47
% 0.22/0.47 % --qbf_mode false
% 0.22/0.47 % --qbf_elim_univ true
% 0.22/0.47 % --qbf_sk_in true
% 0.22/0.47 % --qbf_pred_elim true
% 0.22/0.47 % --qbf_split 32
% 0.22/0.47
% 0.22/0.47 % ------ BMC1 Options
% 0.22/0.47
% 0.22/0.47 % --bmc1_incremental false
% 0.22/0.47 % --bmc1_axioms reachable_all
% 0.22/0.47 % --bmc1_min_bound 0
% 0.22/0.47 % --bmc1_max_bound -1
% 0.22/0.47 % --bmc1_max_bound_default -1
% 0.22/0.47 % --bmc1_symbol_reachability true
% 0.22/0.47 % --bmc1_property_lemmas false
% 0.22/0.47 % --bmc1_k_induction false
% 0.22/0.47 % --bmc1_non_equiv_states false
% 0.22/0.47 % --bmc1_deadlock false
% 0.22/0.47 % --bmc1_ucm false
% 0.22/0.47 % --bmc1_add_unsat_core none
% 0.22/0.47 % --bmc1_unsat_core_children false
% 0.22/0.47 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.47 % --bmc1_out_stat full
% 0.22/0.47 % --bmc1_ground_init false
% 0.22/0.47 % --bmc1_pre_inst_next_state false
% 0.22/0.47 % --bmc1_pre_inst_state false
% 0.22/0.47 % --bmc1_pre_inst_reach_state false
% 0.22/0.47 % --bmc1_out_unsat_core false
% 0.22/0.47 % --bmc1_aig_witness_out false
% 0.22/0.47 % --bmc1_verbose false
% 0.22/0.47 % --bmc1_dump_clauses_tptp false
% 0.22/0.48 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.48 % --bmc1_dump_file -
% 0.22/0.48 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.48 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.48 % --bmc1_ucm_extend_mode 1
% 0.22/0.48 % --bmc1_ucm_init_mode 2
% 0.22/0.48 % --bmc1_ucm_cone_mode none
% 0.22/0.48 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.48 % --bmc1_ucm_relax_model 4
% 0.22/0.48 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.48 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.48 % --bmc1_ucm_layered_model none
% 0.22/0.48 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.48
% 0.22/0.48 % ------ AIG Options
% 0.22/0.48
% 0.22/0.48 % --aig_mode false
% 0.22/0.48
% 0.22/0.48 % ------ Instantiation Options
% 0.22/0.48
% 0.22/0.48 % --instantiation_flag true
% 0.22/0.48 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.48 % --inst_solver_per_active 750
% 0.22/0.48 % --inst_solver_calls_frac 0.5
% 0.22/0.48 % --inst_passive_queue_type priority_queues
% 0.22/0.48 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.48 % --inst_passive_queues_freq [25;2]
% 0.22/0.48 % --inst_dismatching true
% 0.22/0.48 % --inst_eager_unprocessed_to_passive true
% 0.22/0.48 % --inst_prop_sim_given true
% 0.22/0.48 % --inst_prop_sim_new false
% 0.22/0.48 % --inst_orphan_elimination true
% 0.22/0.48 % --inst_learning_loop_flag true
% 0.22/0.48 % --inst_learning_start 3000
% 0.22/0.48 % --inst_learning_factor 2
% 0.22/0.48 % --inst_start_prop_sim_after_learn 3
% 0.22/0.48 % --inst_sel_renew solver
% 0.22/0.48 % --inst_lit_activity_flag true
% 0.22/0.48 % --inst_out_proof true
% 0.22/0.48
% 0.22/0.48 % ------ Resolution Options
% 0.22/0.48
% 0.22/0.48 % --resolution_flag true
% 0.22/0.48 % --res_lit_sel kbo_max
% 0.22/0.48 % --res_to_prop_solver none
% 0.22/0.48 % --res_prop_simpl_new false
% 0.22/0.48 % --res_prop_simpl_given false
% 0.22/0.48 % --res_passive_queue_type priority_queues
% 0.22/0.48 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.22/0.48 % --res_passive_queues_freq [15;5]
% 0.22/0.48 % --res_forward_subs full
% 0.22/0.48 % --res_backward_subs full
% 0.22/0.48 % --res_forward_subs_resolution true
% 0.22/0.48 % --res_backward_subs_resolution true
% 0.22/0.48 % --res_orphan_elimination false
% 0.22/0.48 % --res_time_limit 1000.
% 0.22/0.48 % --res_out_proof true
% 0.22/0.48 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_fe9297.s
% 0.22/0.48 % --modulo true
% 0.22/0.48
% 0.22/0.48 % ------ Combination Options
% 0.22/0.48
% 0.22/0.48 % --comb_res_mult 1000
% 0.22/0.48 % --comb_inst_mult 300
% 0.22/0.48 % ------
% 0.22/0.48
% 0.22/0.48 % ------ Parsing...% successful
% 0.22/0.48
% 0.22/0.48 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.22/0.48
% 0.22/0.48 % ------ Proving...
% 0.22/0.48 % ------ Problem Properties
% 0.22/0.48
% 0.22/0.48 %
% 0.22/0.48 % EPR false
% 0.22/0.48 % Horn false
% 0.22/0.48 % Has equality true
% 0.22/0.48
% 0.22/0.48 % % ------ Input Options Time Limit: Unbounded
% 0.22/0.48
% 0.22/0.48
% 0.22/0.48 % % ------ Current options:
% 0.22/0.48
% 0.22/0.48 % ------ Input Options
% 0.22/0.48
% 0.22/0.48 % --out_options all
% 0.22/0.48 % --tptp_safe_out true
% 0.22/0.48 % --problem_path ""
% 0.22/0.48 % --include_path ""
% 0.22/0.48 % --clausifier .//eprover
% 0.22/0.48 % --clausifier_options --tstp-format
% 0.22/0.48 % --stdin false
% 0.22/0.48 % --dbg_backtrace false
% 0.22/0.48 % --dbg_dump_prop_clauses false
% 0.22/0.48 % --dbg_dump_prop_clauses_file -
% 0.22/0.48 % --dbg_out_stat false
% 0.22/0.48
% 0.22/0.48 % ------ General Options
% 0.22/0.48
% 0.22/0.48 % --fof false
% 0.22/0.48 % --time_out_real 150.
% 0.22/0.48 % --time_out_prep_mult 0.2
% 0.22/0.48 % --time_out_virtual -1.
% 0.22/0.48 % --schedule none
% 0.22/0.48 % --ground_splitting input
% 0.22/0.48 % --splitting_nvd 16
% 0.22/0.48 % --non_eq_to_eq false
% 0.22/0.48 % --prep_gs_sim true
% 0.22/0.48 % --prep_unflatten false
% 0.22/0.48 % --prep_res_sim true
% 0.22/0.48 % --prep_upred true
% 0.22/0.48 % --res_sim_input true
% 0.22/0.48 % --clause_weak_htbl true
% 0.22/0.48 % --gc_record_bc_elim false
% 0.22/0.48 % --symbol_type_check false
% 0.22/0.48 % --clausify_out false
% 0.22/0.48 % --large_theory_mode false
% 0.22/0.48 % --prep_sem_filter none
% 0.22/0.48 % --prep_sem_filter_out false
% 0.22/0.48 % --preprocessed_out false
% 0.22/0.48 % --sub_typing false
% 0.22/0.48 % --brand_transform false
% 0.22/0.48 % --pure_diseq_elim true
% 0.22/0.48 % --min_unsat_core false
% 0.22/0.48 % --pred_elim true
% 0.22/0.48 % --add_important_lit false
% 0.22/0.48 % --soft_assumptions false
% 0.22/0.48 % --reset_solvers false
% 0.22/0.48 % --bc_imp_inh []
% 0.22/0.48 % --conj_cone_tolerance 1.5
% 0.22/0.48 % --prolific_symb_bound 500
% 0.22/0.48 % --lt_threshold 2000
% 0.22/0.48
% 0.22/0.48 % ------ SAT Options
% 0.22/0.48
% 0.22/0.48 % --sat_mode false
% 0.22/0.48 % --sat_fm_restart_options ""
% 0.22/0.48 % --sat_gr_def false
% 0.22/0.48 % --sat_epr_types true
% 0.22/0.48 % --sat_non_cyclic_types false
% 0.22/0.48 % --sat_finite_models false
% 0.22/0.48 % --sat_fm_lemmas false
% 0.22/0.48 % --sat_fm_prep false
% 0.22/0.48 % --sat_fm_uc_incr true
% 0.22/0.48 % --sat_out_model small
% 0.22/0.48 % --sat_out_clauses false
% 0.22/0.48
% 0.22/0.48 % ------ QBF Options
% 0.22/0.48
% 0.22/0.48 % --qbf_mode false
% 0.22/0.48 % --qbf_elim_univ true
% 0.22/0.48 % --qbf_sk_in true
% 0.22/0.48 % --qbf_pred_elim true
% 0.22/0.48 % --qbf_split 32
% 0.22/0.48
% 0.22/0.48 % ------ BMC1 Options
% 0.22/0.48
% 0.22/0.48 % --bmc1_incremental false
% 0.22/0.48 % --bmc1_axioms reachable_all
% 0.22/0.48 % --bmc1_min_bound 0
% 0.22/0.48 % --bmc1_max_bound -1
% 0.22/0.48 % --bmc1_max_bound_default -1
% 0.22/0.48 % --bmc1_symbol_reachability true
% 0.22/0.48 % --bmc1_property_lemmas false
% 0.22/0.48 % --bmc1_k_induction false
% 0.22/0.48 % --bmc1_non_equiv_states false
% 0.22/0.48 % --bmc1_deadlock false
% 0.22/0.48 % --bmc1_ucm false
% 0.22/0.48 % --bmc1_add_unsat_core none
% 0.22/0.48 % --bmc1_unsat_core_children false
% 0.22/0.48 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.48 % --bmc1_out_stat full
% 0.22/0.48 % --bmc1_ground_init false
% 0.22/0.48 % --bmc1_pre_inst_next_state false
% 0.22/0.48 % --bmc1_pre_inst_state false
% 0.22/0.48 % --bmc1_pre_inst_reach_state false
% 0.22/0.48 % --bmc1_out_unsat_core false
% 0.22/0.48 % --bmc1_aig_witness_out false
% 0.22/0.48 % --bmc1_verbose false
% 0.22/0.48 % --bmc1_dump_clauses_tptp false
% 0.22/0.48 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.48 % --bmc1_dump_file -
% 0.22/0.48 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.48 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.48 % --bmc1_ucm_extend_mode 1
% 0.22/0.48 % --bmc1_ucm_init_mode 2
% 0.22/0.48 % --bmc1_ucm_cone_mode none
% 0.22/0.48 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.48 % --bmc1_ucm_relax_model 4
% 0.22/0.48 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.48 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.48 % --bmc1_ucm_layered_model none
% 0.22/0.48 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.48
% 0.22/0.48 % ------ AIG Options
% 0.22/0.48
% 0.22/0.48 % --aig_mode false
% 0.22/0.48
% 0.22/0.48 % ------ Instantiation Options
% 0.22/0.48
% 0.22/0.48 % --instantiation_flag true
% 0.22/0.48 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.48 % --inst_solver_per_active 750
% 0.22/0.48 % --inst_solver_calls_frac 0.5
% 0.22/0.48 % --inst_passive_queue_type priority_queues
% 0.22/0.48 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.48 % --inst_passive_queues_freq [25;2]
% 0.22/0.48 % --inst_dismatching true
% 0.22/0.48 % --inst_eager_unprocessed_to_passive true
% 0.22/0.48 % --inst_prop_sim_given true
% 150.27/150.47 % --inst_prop_sim_new false
% 150.27/150.47 % --inst_orphan_elimination true
% 150.27/150.47 % --inst_learning_loop_flag true
% 150.27/150.47 % --inst_learning_start 3000
% 150.27/150.47 % --inst_learning_factor 2
% 150.27/150.47 % --inst_start_prop_sim_after_learn 3
% 150.27/150.47 % --inst_sel_renew solver
% 150.27/150.47 % --inst_lit_activity_flag true
% 150.27/150.47 % --inst_out_proof true
% 150.27/150.47
% 150.27/150.47 % ------ Resolution Options
% 150.27/150.47
% 150.27/150.47 % --resolution_flag true
% 150.27/150.47 % --res_lit_sel kbo_max
% 150.27/150.47 % --res_to_prop_solver none
% 150.27/150.47 % --res_prop_simpl_new false
% 150.27/150.47 % --res_prop_simpl_given false
% 150.27/150.47 % --res_passive_queue_type priority_queues
% 150.27/150.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.27/150.47 % --res_passive_queues_freq [15;5]
% 150.27/150.47 % --res_forward_subs full
% 150.27/150.47 % --res_backward_subs full
% 150.27/150.47 % --res_forward_subs_resolution true
% 150.27/150.47 % --res_backward_subs_resolution true
% 150.27/150.47 % --res_orphan_elimination false
% 150.27/150.47 % --res_time_limit 1000.
% 150.27/150.47 % --res_out_proof true
% 150.27/150.47 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_fe9297.s
% 150.27/150.47 % --modulo true
% 150.27/150.47
% 150.27/150.47 % ------ Combination Options
% 150.27/150.47
% 150.27/150.47 % --comb_res_mult 1000
% 150.27/150.47 % --comb_inst_mult 300
% 150.27/150.47 % ------
% 150.27/150.47
% 150.27/150.47
% 150.27/150.47
% 150.27/150.47 % ------ Proving...
% 150.27/150.47 %
% 150.27/150.47
% 150.27/150.47
% 150.27/150.47 % Time Out Real
% 150.27/150.47
% 150.27/150.47 % ------ Statistics
% 150.27/150.47
% 150.27/150.47 % ------ General
% 150.27/150.47
% 150.27/150.47 % num_of_input_clauses: 81
% 150.27/150.47 % num_of_input_neg_conjectures: 4
% 150.27/150.47 % num_of_splits: 0
% 150.27/150.47 % num_of_split_atoms: 0
% 150.27/150.47 % num_of_sem_filtered_clauses: 0
% 150.27/150.47 % num_of_subtypes: 0
% 150.27/150.47 % monotx_restored_types: 0
% 150.27/150.47 % sat_num_of_epr_types: 0
% 150.27/150.47 % sat_num_of_non_cyclic_types: 0
% 150.27/150.47 % sat_guarded_non_collapsed_types: 0
% 150.27/150.47 % is_epr: 0
% 150.27/150.47 % is_horn: 0
% 150.27/150.47 % has_eq: 1
% 150.27/150.47 % num_pure_diseq_elim: 0
% 150.27/150.47 % simp_replaced_by: 0
% 150.27/150.47 % res_preprocessed: 8
% 150.27/150.47 % prep_upred: 0
% 150.27/150.47 % prep_unflattend: 0
% 150.27/150.47 % pred_elim_cands: 0
% 150.27/150.47 % pred_elim: 0
% 150.27/150.47 % pred_elim_cl: 0
% 150.27/150.47 % pred_elim_cycles: 0
% 150.27/150.47 % forced_gc_time: 0
% 150.27/150.47 % gc_basic_clause_elim: 0
% 150.27/150.47 % parsing_time: 0.004
% 150.27/150.47 % sem_filter_time: 0.
% 150.27/150.47 % pred_elim_time: 0.
% 150.27/150.47 % out_proof_time: 0.
% 150.27/150.47 % monotx_time: 0.
% 150.27/150.47 % subtype_inf_time: 0.
% 150.27/150.47 % unif_index_cands_time: 0.008
% 150.27/150.47 % unif_index_add_time: 0.004
% 150.27/150.47 % total_time: 150.017
% 150.27/150.47 % num_of_symbols: 60
% 150.27/150.47 % num_of_terms: 46334
% 150.27/150.47
% 150.27/150.47 % ------ Propositional Solver
% 150.27/150.47
% 150.27/150.47 % prop_solver_calls: 1
% 150.27/150.47 % prop_fast_solver_calls: 21
% 150.27/150.47 % prop_num_of_clauses: 119
% 150.27/150.47 % prop_preprocess_simplified: 239
% 150.27/150.47 % prop_fo_subsumed: 0
% 150.27/150.47 % prop_solver_time: 0.
% 150.27/150.47 % prop_fast_solver_time: 0.
% 150.27/150.47 % prop_unsat_core_time: 0.
% 150.27/150.47
% 150.27/150.47 % ------ QBF
% 150.27/150.47
% 150.27/150.47 % qbf_q_res: 0
% 150.27/150.47 % qbf_num_tautologies: 0
% 150.27/150.47 % qbf_prep_cycles: 0
% 150.27/150.47
% 150.27/150.47 % ------ BMC1
% 150.27/150.47
% 150.27/150.47 % bmc1_current_bound: -1
% 150.27/150.47 % bmc1_last_solved_bound: -1
% 150.27/150.47 % bmc1_unsat_core_size: -1
% 150.27/150.47 % bmc1_unsat_core_parents_size: -1
% 150.27/150.47 % bmc1_merge_next_fun: 0
% 150.27/150.47 % bmc1_unsat_core_clauses_time: 0.
% 150.27/150.47
% 150.27/150.47 % ------ Instantiation
% 150.27/150.47
% 150.27/150.47 % inst_num_of_clauses: 80
% 150.27/150.47 % inst_num_in_passive: 0
% 150.27/150.47 % inst_num_in_active: 0
% 150.27/150.47 % inst_num_in_unprocessed: 81
% 150.27/150.47 % inst_num_of_loops: 0
% 150.27/150.47 % inst_num_of_learning_restarts: 0
% 150.27/150.47 % inst_num_moves_active_passive: 0
% 150.27/150.47 % inst_lit_activity: 0
% 150.27/150.47 % inst_lit_activity_moves: 0
% 150.27/150.47 % inst_num_tautologies: 0
% 150.27/150.47 % inst_num_prop_implied: 0
% 150.27/150.47 % inst_num_existing_simplified: 0
% 150.27/150.47 % inst_num_eq_res_simplified: 0
% 150.27/150.47 % inst_num_child_elim: 0
% 150.27/150.47 % inst_num_of_dismatching_blockings: 0
% 150.27/150.47 % inst_num_of_non_proper_insts: 0
% 150.27/150.47 % inst_num_of_duplicates: 0
% 150.27/150.47 % inst_inst_num_from_inst_to_res: 0
% 150.27/150.47 % inst_dismatching_checking_time: 0.
% 150.27/150.47
% 150.27/150.47 % ------ Resolution
% 150.27/150.47
% 150.27/150.47 % res_num_of_clauses: 23806
% 150.27/150.47 % res_num_in_passive: 22965
% 150.27/150.47 % res_num_in_active: 773
% 150.27/150.47 % res_num_of_loops: 973
% 150.27/150.47 % res_forward_subset_subsumed: 2190
% 150.27/150.47 % res_backward_subset_subsumed: 10
% 150.27/150.47 % res_forward_subsumed: 208
% 150.27/150.47 % res_backward_subsumed: 2
% 150.27/150.47 % res_forward_subsumption_resolution: 563
% 150.27/150.47 % res_backward_subsumption_resolution: 6
% 150.27/150.47 % res_clause_to_clause_subsumption: 389026
% 150.27/150.47 % res_orphan_elimination: 0
% 150.27/150.47 % res_tautology_del: 55
% 150.27/150.47 % res_num_eq_res_simplified: 0
% 150.27/150.47 % res_num_sel_changes: 0
% 150.27/150.47 % res_moves_from_active_to_pass: 0
% 150.27/150.47
% 150.27/150.47 % Status Unknown
% 150.27/150.50 % Orienting using strategy ClausalAll
% 150.27/150.50 % FOF problem with conjecture
% 150.27/150.50 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_fe9297.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_886c94.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_36eff4 | grep -v "SZS"
% 150.27/150.52
% 150.27/150.52 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 150.27/150.52
% 150.27/150.52 %
% 150.27/150.52 % ------ iProver source info
% 150.27/150.52
% 150.27/150.52 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 150.27/150.52 % git: non_committed_changes: true
% 150.27/150.52 % git: last_make_outside_of_git: true
% 150.27/150.52
% 150.27/150.52 %
% 150.27/150.52 % ------ Input Options
% 150.27/150.52
% 150.27/150.52 % --out_options all
% 150.27/150.52 % --tptp_safe_out true
% 150.27/150.52 % --problem_path ""
% 150.27/150.52 % --include_path ""
% 150.27/150.52 % --clausifier .//eprover
% 150.27/150.52 % --clausifier_options --tstp-format
% 150.27/150.52 % --stdin false
% 150.27/150.52 % --dbg_backtrace false
% 150.27/150.52 % --dbg_dump_prop_clauses false
% 150.27/150.52 % --dbg_dump_prop_clauses_file -
% 150.27/150.52 % --dbg_out_stat false
% 150.27/150.52
% 150.27/150.52 % ------ General Options
% 150.27/150.52
% 150.27/150.52 % --fof false
% 150.27/150.52 % --time_out_real 150.
% 150.27/150.52 % --time_out_prep_mult 0.2
% 150.27/150.52 % --time_out_virtual -1.
% 150.27/150.52 % --schedule none
% 150.27/150.52 % --ground_splitting input
% 150.27/150.52 % --splitting_nvd 16
% 150.27/150.52 % --non_eq_to_eq false
% 150.27/150.52 % --prep_gs_sim true
% 150.27/150.52 % --prep_unflatten false
% 150.27/150.52 % --prep_res_sim true
% 150.27/150.52 % --prep_upred true
% 150.27/150.52 % --res_sim_input true
% 150.27/150.52 % --clause_weak_htbl true
% 150.27/150.52 % --gc_record_bc_elim false
% 150.27/150.52 % --symbol_type_check false
% 150.27/150.52 % --clausify_out false
% 150.27/150.52 % --large_theory_mode false
% 150.27/150.52 % --prep_sem_filter none
% 150.27/150.52 % --prep_sem_filter_out false
% 150.27/150.52 % --preprocessed_out false
% 150.27/150.52 % --sub_typing false
% 150.27/150.52 % --brand_transform false
% 150.27/150.52 % --pure_diseq_elim true
% 150.27/150.52 % --min_unsat_core false
% 150.27/150.52 % --pred_elim true
% 150.27/150.52 % --add_important_lit false
% 150.27/150.52 % --soft_assumptions false
% 150.27/150.52 % --reset_solvers false
% 150.27/150.52 % --bc_imp_inh []
% 150.27/150.52 % --conj_cone_tolerance 1.5
% 150.27/150.52 % --prolific_symb_bound 500
% 150.27/150.52 % --lt_threshold 2000
% 150.27/150.52
% 150.27/150.52 % ------ SAT Options
% 150.27/150.52
% 150.27/150.52 % --sat_mode false
% 150.27/150.52 % --sat_fm_restart_options ""
% 150.27/150.52 % --sat_gr_def false
% 150.27/150.52 % --sat_epr_types true
% 150.27/150.52 % --sat_non_cyclic_types false
% 150.27/150.52 % --sat_finite_models false
% 150.27/150.52 % --sat_fm_lemmas false
% 150.27/150.52 % --sat_fm_prep false
% 150.27/150.52 % --sat_fm_uc_incr true
% 150.27/150.52 % --sat_out_model small
% 150.27/150.52 % --sat_out_clauses false
% 150.27/150.52
% 150.27/150.52 % ------ QBF Options
% 150.27/150.52
% 150.27/150.52 % --qbf_mode false
% 150.27/150.52 % --qbf_elim_univ true
% 150.27/150.52 % --qbf_sk_in true
% 150.27/150.52 % --qbf_pred_elim true
% 150.27/150.52 % --qbf_split 32
% 150.27/150.52
% 150.27/150.52 % ------ BMC1 Options
% 150.27/150.52
% 150.27/150.52 % --bmc1_incremental false
% 150.27/150.52 % --bmc1_axioms reachable_all
% 150.27/150.52 % --bmc1_min_bound 0
% 150.27/150.52 % --bmc1_max_bound -1
% 150.27/150.52 % --bmc1_max_bound_default -1
% 150.27/150.52 % --bmc1_symbol_reachability true
% 150.27/150.52 % --bmc1_property_lemmas false
% 150.27/150.52 % --bmc1_k_induction false
% 150.27/150.52 % --bmc1_non_equiv_states false
% 150.27/150.52 % --bmc1_deadlock false
% 150.27/150.52 % --bmc1_ucm false
% 150.27/150.52 % --bmc1_add_unsat_core none
% 150.27/150.52 % --bmc1_unsat_core_children false
% 150.27/150.52 % --bmc1_unsat_core_extrapolate_axioms false
% 150.27/150.52 % --bmc1_out_stat full
% 150.27/150.52 % --bmc1_ground_init false
% 150.27/150.52 % --bmc1_pre_inst_next_state false
% 150.27/150.52 % --bmc1_pre_inst_state false
% 150.27/150.52 % --bmc1_pre_inst_reach_state false
% 150.27/150.52 % --bmc1_out_unsat_core false
% 150.27/150.52 % --bmc1_aig_witness_out false
% 150.27/150.52 % --bmc1_verbose false
% 150.27/150.52 % --bmc1_dump_clauses_tptp false
% 150.27/150.53 % --bmc1_dump_unsat_core_tptp false
% 150.27/150.53 % --bmc1_dump_file -
% 150.27/150.53 % --bmc1_ucm_expand_uc_limit 128
% 150.27/150.53 % --bmc1_ucm_n_expand_iterations 6
% 150.27/150.53 % --bmc1_ucm_extend_mode 1
% 150.27/150.53 % --bmc1_ucm_init_mode 2
% 150.27/150.53 % --bmc1_ucm_cone_mode none
% 150.27/150.53 % --bmc1_ucm_reduced_relation_type 0
% 150.27/150.53 % --bmc1_ucm_relax_model 4
% 150.27/150.53 % --bmc1_ucm_full_tr_after_sat true
% 150.27/150.53 % --bmc1_ucm_expand_neg_assumptions false
% 150.27/150.53 % --bmc1_ucm_layered_model none
% 150.27/150.53 % --bmc1_ucm_max_lemma_size 10
% 150.27/150.53
% 150.27/150.53 % ------ AIG Options
% 150.27/150.53
% 150.27/150.53 % --aig_mode false
% 150.27/150.53
% 150.27/150.53 % ------ Instantiation Options
% 150.27/150.53
% 150.27/150.53 % --instantiation_flag true
% 150.27/150.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.27/150.53 % --inst_solver_per_active 750
% 150.27/150.53 % --inst_solver_calls_frac 0.5
% 150.27/150.53 % --inst_passive_queue_type priority_queues
% 150.27/150.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.27/150.53 % --inst_passive_queues_freq [25;2]
% 150.27/150.53 % --inst_dismatching true
% 150.27/150.53 % --inst_eager_unprocessed_to_passive true
% 150.27/150.53 % --inst_prop_sim_given true
% 150.27/150.53 % --inst_prop_sim_new false
% 150.27/150.53 % --inst_orphan_elimination true
% 150.27/150.53 % --inst_learning_loop_flag true
% 150.27/150.53 % --inst_learning_start 3000
% 150.27/150.53 % --inst_learning_factor 2
% 150.27/150.53 % --inst_start_prop_sim_after_learn 3
% 150.27/150.53 % --inst_sel_renew solver
% 150.27/150.53 % --inst_lit_activity_flag true
% 150.27/150.53 % --inst_out_proof true
% 150.27/150.53
% 150.27/150.53 % ------ Resolution Options
% 150.27/150.53
% 150.27/150.53 % --resolution_flag true
% 150.27/150.53 % --res_lit_sel kbo_max
% 150.27/150.53 % --res_to_prop_solver none
% 150.27/150.53 % --res_prop_simpl_new false
% 150.27/150.53 % --res_prop_simpl_given false
% 150.27/150.53 % --res_passive_queue_type priority_queues
% 150.27/150.53 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.27/150.53 % --res_passive_queues_freq [15;5]
% 150.27/150.53 % --res_forward_subs full
% 150.27/150.53 % --res_backward_subs full
% 150.27/150.53 % --res_forward_subs_resolution true
% 150.27/150.53 % --res_backward_subs_resolution true
% 150.27/150.53 % --res_orphan_elimination false
% 150.27/150.53 % --res_time_limit 1000.
% 150.27/150.53 % --res_out_proof true
% 150.27/150.53 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_fe9297.s
% 150.27/150.53 % --modulo true
% 150.27/150.53
% 150.27/150.53 % ------ Combination Options
% 150.27/150.53
% 150.27/150.53 % --comb_res_mult 1000
% 150.27/150.53 % --comb_inst_mult 300
% 150.27/150.53 % ------
% 150.27/150.53
% 150.27/150.53 % ------ Parsing...% successful
% 150.27/150.53
% 150.27/150.53 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 150.27/150.53
% 150.27/150.53 % ------ Proving...
% 150.27/150.53 % ------ Problem Properties
% 150.27/150.53
% 150.27/150.53 %
% 150.27/150.53 % EPR false
% 150.27/150.53 % Horn false
% 150.27/150.53 % Has equality true
% 150.27/150.53
% 150.27/150.53 % % ------ Input Options Time Limit: Unbounded
% 150.27/150.53
% 150.27/150.53
% 150.27/150.53 % % ------ Current options:
% 150.27/150.53
% 150.27/150.53 % ------ Input Options
% 150.27/150.53
% 150.27/150.53 % --out_options all
% 150.27/150.53 % --tptp_safe_out true
% 150.27/150.53 % --problem_path ""
% 150.27/150.53 % --include_path ""
% 150.27/150.53 % --clausifier .//eprover
% 150.27/150.53 % --clausifier_options --tstp-format
% 150.27/150.53 % --stdin false
% 150.27/150.53 % --dbg_backtrace false
% 150.27/150.53 % --dbg_dump_prop_clauses false
% 150.27/150.53 % --dbg_dump_prop_clauses_file -
% 150.27/150.53 % --dbg_out_stat false
% 150.27/150.53
% 150.27/150.53 % ------ General Options
% 150.27/150.53
% 150.27/150.53 % --fof false
% 150.27/150.53 % --time_out_real 150.
% 150.27/150.53 % --time_out_prep_mult 0.2
% 150.27/150.53 % --time_out_virtual -1.
% 150.27/150.53 % --schedule none
% 150.27/150.53 % --ground_splitting input
% 150.27/150.53 % --splitting_nvd 16
% 150.27/150.53 % --non_eq_to_eq false
% 150.27/150.53 % --prep_gs_sim true
% 150.27/150.53 % --prep_unflatten false
% 150.27/150.53 % --prep_res_sim true
% 150.27/150.53 % --prep_upred true
% 150.27/150.53 % --res_sim_input true
% 150.27/150.53 % --clause_weak_htbl true
% 150.27/150.53 % --gc_record_bc_elim false
% 150.27/150.53 % --symbol_type_check false
% 150.27/150.53 % --clausify_out false
% 150.27/150.53 % --large_theory_mode false
% 150.27/150.53 % --prep_sem_filter none
% 150.27/150.53 % --prep_sem_filter_out false
% 150.27/150.53 % --preprocessed_out false
% 150.27/150.53 % --sub_typing false
% 150.27/150.53 % --brand_transform false
% 150.27/150.53 % --pure_diseq_elim true
% 150.27/150.53 % --min_unsat_core false
% 150.27/150.53 % --pred_elim true
% 150.27/150.53 % --add_important_lit false
% 150.27/150.53 % --soft_assumptions false
% 150.27/150.53 % --reset_solvers false
% 150.27/150.53 % --bc_imp_inh []
% 150.27/150.53 % --conj_cone_tolerance 1.5
% 150.27/150.53 % --prolific_symb_bound 500
% 150.27/150.53 % --lt_threshold 2000
% 150.27/150.53
% 150.27/150.53 % ------ SAT Options
% 150.27/150.53
% 150.27/150.53 % --sat_mode false
% 150.27/150.53 % --sat_fm_restart_options ""
% 150.27/150.53 % --sat_gr_def false
% 150.27/150.53 % --sat_epr_types true
% 150.27/150.53 % --sat_non_cyclic_types false
% 150.27/150.53 % --sat_finite_models false
% 150.27/150.53 % --sat_fm_lemmas false
% 150.27/150.53 % --sat_fm_prep false
% 150.27/150.53 % --sat_fm_uc_incr true
% 150.27/150.53 % --sat_out_model small
% 150.27/150.53 % --sat_out_clauses false
% 150.27/150.53
% 150.27/150.53 % ------ QBF Options
% 150.27/150.53
% 150.27/150.53 % --qbf_mode false
% 150.27/150.53 % --qbf_elim_univ true
% 150.27/150.53 % --qbf_sk_in true
% 150.27/150.53 % --qbf_pred_elim true
% 150.27/150.53 % --qbf_split 32
% 150.27/150.53
% 150.27/150.53 % ------ BMC1 Options
% 150.27/150.53
% 150.27/150.53 % --bmc1_incremental false
% 150.27/150.53 % --bmc1_axioms reachable_all
% 150.27/150.53 % --bmc1_min_bound 0
% 150.27/150.53 % --bmc1_max_bound -1
% 150.27/150.53 % --bmc1_max_bound_default -1
% 150.27/150.53 % --bmc1_symbol_reachability true
% 150.27/150.53 % --bmc1_property_lemmas false
% 150.27/150.53 % --bmc1_k_induction false
% 150.27/150.53 % --bmc1_non_equiv_states false
% 150.27/150.53 % --bmc1_deadlock false
% 150.27/150.53 % --bmc1_ucm false
% 150.27/150.53 % --bmc1_add_unsat_core none
% 150.27/150.53 % --bmc1_unsat_core_children false
% 150.27/150.53 % --bmc1_unsat_core_extrapolate_axioms false
% 150.27/150.53 % --bmc1_out_stat full
% 150.27/150.53 % --bmc1_ground_init false
% 150.27/150.53 % --bmc1_pre_inst_next_state false
% 150.27/150.53 % --bmc1_pre_inst_state false
% 150.27/150.53 % --bmc1_pre_inst_reach_state false
% 150.27/150.53 % --bmc1_out_unsat_core false
% 150.27/150.53 % --bmc1_aig_witness_out false
% 150.27/150.53 % --bmc1_verbose false
% 150.27/150.53 % --bmc1_dump_clauses_tptp false
% 150.27/150.53 % --bmc1_dump_unsat_core_tptp false
% 150.27/150.53 % --bmc1_dump_file -
% 150.27/150.53 % --bmc1_ucm_expand_uc_limit 128
% 150.27/150.53 % --bmc1_ucm_n_expand_iterations 6
% 150.27/150.53 % --bmc1_ucm_extend_mode 1
% 150.27/150.53 % --bmc1_ucm_init_mode 2
% 150.27/150.53 % --bmc1_ucm_cone_mode none
% 150.27/150.53 % --bmc1_ucm_reduced_relation_type 0
% 150.27/150.53 % --bmc1_ucm_relax_model 4
% 150.27/150.53 % --bmc1_ucm_full_tr_after_sat true
% 150.27/150.53 % --bmc1_ucm_expand_neg_assumptions false
% 150.27/150.53 % --bmc1_ucm_layered_model none
% 150.27/150.53 % --bmc1_ucm_max_lemma_size 10
% 150.27/150.53
% 150.27/150.53 % ------ AIG Options
% 150.27/150.53
% 150.27/150.53 % --aig_mode false
% 150.27/150.53
% 150.27/150.53 % ------ Instantiation Options
% 150.27/150.53
% 150.27/150.53 % --instantiation_flag true
% 150.27/150.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.27/150.53 % --inst_solver_per_active 750
% 150.27/150.53 % --inst_solver_calls_frac 0.5
% 150.27/150.53 % --inst_passive_queue_type priority_queues
% 150.27/150.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.27/150.53 % --inst_passive_queues_freq [25;2]
% 150.27/150.53 % --inst_dismatching true
% 150.27/150.53 % --inst_eager_unprocessed_to_passive true
% 150.27/150.53 % --inst_prop_sim_given true
% 151.60/151.83 % --inst_prop_sim_new false
% 151.60/151.83 % --inst_orphan_elimination true
% 151.60/151.83 % --inst_learning_loop_flag true
% 151.60/151.83 % --inst_learning_start 3000
% 151.60/151.83 % --inst_learning_factor 2
% 151.60/151.83 % --inst_start_prop_sim_after_learn 3
% 151.60/151.83 % --inst_sel_renew solver
% 151.60/151.83 % --inst_lit_activity_flag true
% 151.60/151.83 % --inst_out_proof true
% 151.60/151.83
% 151.60/151.83 % ------ Resolution Options
% 151.60/151.83
% 151.60/151.83 % --resolution_flag true
% 151.60/151.83 % --res_lit_sel kbo_max
% 151.60/151.83 % --res_to_prop_solver none
% 151.60/151.83 % --res_prop_simpl_new false
% 151.60/151.83 % --res_prop_simpl_given false
% 151.60/151.83 % --res_passive_queue_type priority_queues
% 151.60/151.83 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 151.60/151.83 % --res_passive_queues_freq [15;5]
% 151.60/151.83 % --res_forward_subs full
% 151.60/151.83 % --res_backward_subs full
% 151.60/151.83 % --res_forward_subs_resolution true
% 151.60/151.83 % --res_backward_subs_resolution true
% 151.60/151.83 % --res_orphan_elimination false
% 151.60/151.83 % --res_time_limit 1000.
% 151.60/151.83 % --res_out_proof true
% 151.60/151.83 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_fe9297.s
% 151.60/151.83 % --modulo true
% 151.60/151.83
% 151.60/151.83 % ------ Combination Options
% 151.60/151.83
% 151.60/151.83 % --comb_res_mult 1000
% 151.60/151.83 % --comb_inst_mult 300
% 151.60/151.83 % ------
% 151.60/151.83
% 151.60/151.83
% 151.60/151.83
% 151.60/151.83 % ------ Proving...
% 151.60/151.83 %
% 151.60/151.83
% 151.60/151.83
% 151.60/151.83 % ------ Statistics
% 151.60/151.83
% 151.60/151.83 % ------ General
% 151.60/151.83
% 151.60/151.83 % num_of_input_clauses: 206
% 151.60/151.83 % num_of_input_neg_conjectures: 4
% 151.60/151.83 % num_of_splits: 0
% 151.60/151.83 % num_of_split_atoms: 0
% 151.60/151.83 % num_of_sem_filtered_clauses: 0
% 151.60/151.83 % num_of_subtypes: 0
% 151.60/151.83 % monotx_restored_types: 0
% 151.60/151.83 % sat_num_of_epr_types: 0
% 151.60/151.83 % sat_num_of_non_cyclic_types: 0
% 151.60/151.83 % sat_guarded_non_collapsed_types: 0
% 151.60/151.83 % is_epr: 0
% 151.60/151.83 % is_horn: 0
% 151.60/151.83 % has_eq: 1
% 151.60/151.83 % num_pure_diseq_elim: 0
% 151.60/151.83 % simp_replaced_by: 0
% 151.60/151.83 % res_preprocessed: 8
% 151.60/151.83 % prep_upred: 0
% 151.60/151.83 % prep_unflattend: 0
% 151.60/151.83 % pred_elim_cands: 0
% 151.60/151.83 % pred_elim: 0
% 151.60/151.83 % pred_elim_cl: 0
% 151.60/151.83 % pred_elim_cycles: 0
% 151.60/151.83 % forced_gc_time: 0
% 151.60/151.83 % gc_basic_clause_elim: 0
% 151.60/151.83 % parsing_time: 0.005
% 151.60/151.83 % sem_filter_time: 0.
% 151.60/151.83 % pred_elim_time: 0.
% 151.60/151.83 % out_proof_time: 0.
% 151.60/151.83 % monotx_time: 0.
% 151.60/151.83 % subtype_inf_time: 0.
% 151.60/151.83 % unif_index_cands_time: 0.002
% 151.60/151.83 % unif_index_add_time: 0.001
% 151.60/151.83 % total_time: 1.324
% 151.60/151.83 % num_of_symbols: 60
% 151.60/151.83 % num_of_terms: 11701
% 151.60/151.83
% 151.60/151.83 % ------ Propositional Solver
% 151.60/151.83
% 151.60/151.83 % prop_solver_calls: 5
% 151.60/151.83 % prop_fast_solver_calls: 21
% 151.60/151.83 % prop_num_of_clauses: 400
% 151.60/151.83 % prop_preprocess_simplified: 1323
% 151.60/151.83 % prop_fo_subsumed: 0
% 151.60/151.83 % prop_solver_time: 0.
% 151.60/151.83 % prop_fast_solver_time: 0.
% 151.60/151.83 % prop_unsat_core_time: 0.
% 151.60/151.83
% 151.60/151.83 % ------ QBF
% 151.60/151.83
% 151.60/151.83 % qbf_q_res: 0
% 151.60/151.83 % qbf_num_tautologies: 0
% 151.60/151.83 % qbf_prep_cycles: 0
% 151.60/151.83
% 151.60/151.83 % ------ BMC1
% 151.60/151.83
% 151.60/151.83 % bmc1_current_bound: -1
% 151.60/151.83 % bmc1_last_solved_bound: -1
% 151.60/151.83 % bmc1_unsat_core_size: -1
% 151.60/151.83 % bmc1_unsat_core_parents_size: -1
% 151.60/151.83 % bmc1_merge_next_fun: 0
% 151.60/151.83 % bmc1_unsat_core_clauses_time: 0.
% 151.60/151.83
% 151.60/151.83 % ------ Instantiation
% 151.60/151.83
% 151.60/151.83 % inst_num_of_clauses: 360
% 151.60/151.83 % inst_num_in_passive: 72
% 151.60/151.83 % inst_num_in_active: 240
% 151.60/151.83 % inst_num_in_unprocessed: 46
% 151.60/151.83 % inst_num_of_loops: 246
% 151.60/151.83 % inst_num_of_learning_restarts: 0
% 151.60/151.83 % inst_num_moves_active_passive: 2
% 151.60/151.83 % inst_lit_activity: 101
% 151.60/151.83 % inst_lit_activity_moves: 0
% 151.60/151.83 % inst_num_tautologies: 0
% 151.60/151.83 % inst_num_prop_implied: 0
% 151.60/151.83 % inst_num_existing_simplified: 0
% 151.60/151.83 % inst_num_eq_res_simplified: 0
% 151.60/151.83 % inst_num_child_elim: 0
% 151.60/151.83 % inst_num_of_dismatching_blockings: 0
% 151.60/151.83 % inst_num_of_non_proper_insts: 103
% 151.60/151.83 % inst_num_of_duplicates: 233
% 151.60/151.83 % inst_inst_num_from_inst_to_res: 0
% 151.60/151.83 % inst_dismatching_checking_time: 0.
% 151.60/151.83
% 151.60/151.83 % ------ Resolution
% 151.60/151.83
% 151.60/151.83 % res_num_of_clauses: 10841
% 151.60/151.83 % res_num_in_passive: 9838
% 151.60/151.83 % res_num_in_active: 837
% 151.60/151.83 % res_num_of_loops: 1000
% 151.60/151.83 % res_forward_subset_subsumed: 1030
% 151.60/151.83 % res_backward_subset_subsumed: 2
% 151.60/151.83 % res_forward_subsumed: 229
% 151.60/151.83 % res_backward_subsumed: 0
% 151.60/151.83 % res_forward_subsumption_resolution: 302
% 151.60/151.83 % res_backward_subsumption_resolution: 12
% 151.60/151.83 % res_clause_to_clause_subsumption: 18324
% 151.60/151.83 % res_orphan_elimination: 0
% 151.60/151.83 % res_tautology_del: 1180
% 151.60/151.83 % res_num_eq_res_simplified: 0
% 151.60/151.83 % res_num_sel_changes: 0
% 151.60/151.83 % res_moves_from_active_to_pass: 0
% 151.60/151.83
% 151.60/151.83 % Status Unsatisfiable
% 151.60/151.83 % SZS status Theorem
% 151.60/151.83 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------