TSTP Solution File: GRA002+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GRA002+3 : TPTP v5.0.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sat Dec 25 09:52:48 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 69 ( 16 unt; 0 def)
% Number of atoms : 285 ( 44 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 357 ( 141 ~; 142 |; 58 &)
% ( 1 <=>; 14 =>; 1 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 2 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-5 aty)
% Number of variables : 229 ( 22 sgn 136 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X4,X5,X6] :
( shortest_path(X4,X5,X6)
<=> ( path(X4,X5,X6)
& X4 != X5
& ! [X7] :
( path(X4,X5,X7)
=> less_or_equal(length_of(X6),length_of(X7)) ) ) ),
file('/tmp/tmpDxktXv/sel_GRA002+3.p_1',shortest_path_defn) ).
fof(8,axiom,
! [X7,X4,X5] :
( path(X4,X5,X7)
=> ! [X2,X3] :
( precedes(X2,X3,X7)
<= ( on_path(X2,X7)
& on_path(X3,X7)
& ( sequential(X2,X3)
| ? [X8] :
( sequential(X2,X8)
& precedes(X8,X3,X7) ) ) ) ) ),
file('/tmp/tmpDxktXv/sel_GRA002+3.p_1',precedes_defn) ).
fof(9,axiom,
! [X4,X5,X7] :
( path(X4,X5,X7)
=> length_of(X7) = number_of_in(edges,X7) ),
file('/tmp/tmpDxktXv/sel_GRA002+3.p_1',length_defn) ).
fof(10,axiom,
! [X9,X10] : less_or_equal(number_of_in(X9,X10),number_of_in(X9,graph)),
file('/tmp/tmpDxktXv/sel_GRA002+3.p_1',graph_has_them_all) ).
fof(11,axiom,
! [X7,X4,X5] :
( ( path(X4,X5,X7)
& ! [X2,X3] :
( ( on_path(X2,X7)
& on_path(X3,X7)
& sequential(X2,X3) )
=> ? [X8] : triangle(X2,X3,X8) ) )
=> number_of_in(sequential_pairs,X7) = number_of_in(triangles,X7) ),
file('/tmp/tmpDxktXv/sel_GRA002+3.p_1',sequential_pairs_and_triangles) ).
fof(12,axiom,
! [X4,X5,X7] :
( path(X4,X5,X7)
=> number_of_in(sequential_pairs,X7) = minus(length_of(X7),n1) ),
file('/tmp/tmpDxktXv/sel_GRA002+3.p_1',path_length_sequential_pairs) ).
fof(13,axiom,
( complete
=> ! [X4,X5,X2,X3,X7] :
( ( shortest_path(X4,X5,X7)
& precedes(X2,X3,X7)
& sequential(X2,X3) )
=> ? [X8] : triangle(X2,X3,X8) ) ),
file('/tmp/tmpDxktXv/sel_GRA002+3.p_1',sequential_is_triangle) ).
fof(15,conjecture,
( complete
=> ! [X7,X4,X5] :
( shortest_path(X4,X5,X7)
=> less_or_equal(minus(length_of(X7),n1),number_of_in(triangles,graph)) ) ),
file('/tmp/tmpDxktXv/sel_GRA002+3.p_1',maximal_path_length) ).
fof(16,negated_conjecture,
~ ( complete
=> ! [X7,X4,X5] :
( shortest_path(X4,X5,X7)
=> less_or_equal(minus(length_of(X7),n1),number_of_in(triangles,graph)) ) ),
inference(assume_negation,[status(cth)],[15]) ).
fof(20,plain,
! [X7,X4,X5] :
( path(X4,X5,X7)
=> ! [X2,X3] :
( ( on_path(X2,X7)
& on_path(X3,X7)
& ( sequential(X2,X3)
| ? [X8] :
( sequential(X2,X8)
& precedes(X8,X3,X7) ) ) )
=> precedes(X2,X3,X7) ) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
fof(37,plain,
! [X4,X5,X6] :
( ( ~ shortest_path(X4,X5,X6)
| ( path(X4,X5,X6)
& X4 != X5
& ! [X7] :
( ~ path(X4,X5,X7)
| less_or_equal(length_of(X6),length_of(X7)) ) ) )
& ( ~ path(X4,X5,X6)
| X4 = X5
| ? [X7] :
( path(X4,X5,X7)
& ~ less_or_equal(length_of(X6),length_of(X7)) )
| shortest_path(X4,X5,X6) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(38,plain,
! [X8,X9,X10] :
( ( ~ shortest_path(X8,X9,X10)
| ( path(X8,X9,X10)
& X8 != X9
& ! [X11] :
( ~ path(X8,X9,X11)
| less_or_equal(length_of(X10),length_of(X11)) ) ) )
& ( ~ path(X8,X9,X10)
| X8 = X9
| ? [X12] :
( path(X8,X9,X12)
& ~ less_or_equal(length_of(X10),length_of(X12)) )
| shortest_path(X8,X9,X10) ) ),
inference(variable_rename,[status(thm)],[37]) ).
fof(39,plain,
! [X8,X9,X10] :
( ( ~ shortest_path(X8,X9,X10)
| ( path(X8,X9,X10)
& X8 != X9
& ! [X11] :
( ~ path(X8,X9,X11)
| less_or_equal(length_of(X10),length_of(X11)) ) ) )
& ( ~ path(X8,X9,X10)
| X8 = X9
| ( path(X8,X9,esk1_3(X8,X9,X10))
& ~ less_or_equal(length_of(X10),length_of(esk1_3(X8,X9,X10))) )
| shortest_path(X8,X9,X10) ) ),
inference(skolemize,[status(esa)],[38]) ).
fof(40,plain,
! [X8,X9,X10,X11] :
( ( ( ( ~ path(X8,X9,X11)
| less_or_equal(length_of(X10),length_of(X11)) )
& path(X8,X9,X10)
& X8 != X9 )
| ~ shortest_path(X8,X9,X10) )
& ( ~ path(X8,X9,X10)
| X8 = X9
| ( path(X8,X9,esk1_3(X8,X9,X10))
& ~ less_or_equal(length_of(X10),length_of(esk1_3(X8,X9,X10))) )
| shortest_path(X8,X9,X10) ) ),
inference(shift_quantors,[status(thm)],[39]) ).
fof(41,plain,
! [X8,X9,X10,X11] :
( ( ~ path(X8,X9,X11)
| less_or_equal(length_of(X10),length_of(X11))
| ~ shortest_path(X8,X9,X10) )
& ( path(X8,X9,X10)
| ~ shortest_path(X8,X9,X10) )
& ( X8 != X9
| ~ shortest_path(X8,X9,X10) )
& ( path(X8,X9,esk1_3(X8,X9,X10))
| ~ path(X8,X9,X10)
| X8 = X9
| shortest_path(X8,X9,X10) )
& ( ~ less_or_equal(length_of(X10),length_of(esk1_3(X8,X9,X10)))
| ~ path(X8,X9,X10)
| X8 = X9
| shortest_path(X8,X9,X10) ) ),
inference(distribute,[status(thm)],[40]) ).
cnf(45,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(74,plain,
! [X7,X4,X5] :
( ~ path(X4,X5,X7)
| ! [X2,X3] :
( ~ on_path(X2,X7)
| ~ on_path(X3,X7)
| ( ~ sequential(X2,X3)
& ! [X8] :
( ~ sequential(X2,X8)
| ~ precedes(X8,X3,X7) ) )
| precedes(X2,X3,X7) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(75,plain,
! [X9,X10,X11] :
( ~ path(X10,X11,X9)
| ! [X12,X13] :
( ~ on_path(X12,X9)
| ~ on_path(X13,X9)
| ( ~ sequential(X12,X13)
& ! [X14] :
( ~ sequential(X12,X14)
| ~ precedes(X14,X13,X9) ) )
| precedes(X12,X13,X9) ) ),
inference(variable_rename,[status(thm)],[74]) ).
fof(76,plain,
! [X9,X10,X11,X12,X13,X14] :
( ( ( ~ sequential(X12,X14)
| ~ precedes(X14,X13,X9) )
& ~ sequential(X12,X13) )
| ~ on_path(X12,X9)
| ~ on_path(X13,X9)
| precedes(X12,X13,X9)
| ~ path(X10,X11,X9) ),
inference(shift_quantors,[status(thm)],[75]) ).
fof(77,plain,
! [X9,X10,X11,X12,X13,X14] :
( ( ~ sequential(X12,X14)
| ~ precedes(X14,X13,X9)
| ~ on_path(X12,X9)
| ~ on_path(X13,X9)
| precedes(X12,X13,X9)
| ~ path(X10,X11,X9) )
& ( ~ sequential(X12,X13)
| ~ on_path(X12,X9)
| ~ on_path(X13,X9)
| precedes(X12,X13,X9)
| ~ path(X10,X11,X9) ) ),
inference(distribute,[status(thm)],[76]) ).
cnf(78,plain,
( precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| ~ on_path(X5,X3)
| ~ on_path(X4,X3)
| ~ sequential(X4,X5) ),
inference(split_conjunct,[status(thm)],[77]) ).
fof(80,plain,
! [X4,X5,X7] :
( ~ path(X4,X5,X7)
| length_of(X7) = number_of_in(edges,X7) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(81,plain,
! [X8,X9,X10] :
( ~ path(X8,X9,X10)
| length_of(X10) = number_of_in(edges,X10) ),
inference(variable_rename,[status(thm)],[80]) ).
cnf(82,plain,
( length_of(X1) = number_of_in(edges,X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[81]) ).
fof(83,plain,
! [X11,X12] : less_or_equal(number_of_in(X11,X12),number_of_in(X11,graph)),
inference(variable_rename,[status(thm)],[10]) ).
cnf(84,plain,
less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),
inference(split_conjunct,[status(thm)],[83]) ).
fof(85,plain,
! [X7,X4,X5] :
( ~ path(X4,X5,X7)
| ? [X2,X3] :
( on_path(X2,X7)
& on_path(X3,X7)
& sequential(X2,X3)
& ! [X8] : ~ triangle(X2,X3,X8) )
| number_of_in(sequential_pairs,X7) = number_of_in(triangles,X7) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(86,plain,
! [X9,X10,X11] :
( ~ path(X10,X11,X9)
| ? [X12,X13] :
( on_path(X12,X9)
& on_path(X13,X9)
& sequential(X12,X13)
& ! [X14] : ~ triangle(X12,X13,X14) )
| number_of_in(sequential_pairs,X9) = number_of_in(triangles,X9) ),
inference(variable_rename,[status(thm)],[85]) ).
fof(87,plain,
! [X9,X10,X11] :
( ~ path(X10,X11,X9)
| ( on_path(esk4_3(X9,X10,X11),X9)
& on_path(esk5_3(X9,X10,X11),X9)
& sequential(esk4_3(X9,X10,X11),esk5_3(X9,X10,X11))
& ! [X14] : ~ triangle(esk4_3(X9,X10,X11),esk5_3(X9,X10,X11),X14) )
| number_of_in(sequential_pairs,X9) = number_of_in(triangles,X9) ),
inference(skolemize,[status(esa)],[86]) ).
fof(88,plain,
! [X9,X10,X11,X14] :
( ( ~ triangle(esk4_3(X9,X10,X11),esk5_3(X9,X10,X11),X14)
& on_path(esk4_3(X9,X10,X11),X9)
& on_path(esk5_3(X9,X10,X11),X9)
& sequential(esk4_3(X9,X10,X11),esk5_3(X9,X10,X11)) )
| ~ path(X10,X11,X9)
| number_of_in(sequential_pairs,X9) = number_of_in(triangles,X9) ),
inference(shift_quantors,[status(thm)],[87]) ).
fof(89,plain,
! [X9,X10,X11,X14] :
( ( ~ triangle(esk4_3(X9,X10,X11),esk5_3(X9,X10,X11),X14)
| ~ path(X10,X11,X9)
| number_of_in(sequential_pairs,X9) = number_of_in(triangles,X9) )
& ( on_path(esk4_3(X9,X10,X11),X9)
| ~ path(X10,X11,X9)
| number_of_in(sequential_pairs,X9) = number_of_in(triangles,X9) )
& ( on_path(esk5_3(X9,X10,X11),X9)
| ~ path(X10,X11,X9)
| number_of_in(sequential_pairs,X9) = number_of_in(triangles,X9) )
& ( sequential(esk4_3(X9,X10,X11),esk5_3(X9,X10,X11))
| ~ path(X10,X11,X9)
| number_of_in(sequential_pairs,X9) = number_of_in(triangles,X9) ) ),
inference(distribute,[status(thm)],[88]) ).
cnf(90,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| sequential(esk4_3(X1,X2,X3),esk5_3(X1,X2,X3))
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[89]) ).
cnf(91,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk5_3(X1,X2,X3),X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[89]) ).
cnf(92,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk4_3(X1,X2,X3),X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[89]) ).
cnf(93,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| ~ path(X2,X3,X1)
| ~ triangle(esk4_3(X1,X2,X3),esk5_3(X1,X2,X3),X4) ),
inference(split_conjunct,[status(thm)],[89]) ).
fof(94,plain,
! [X4,X5,X7] :
( ~ path(X4,X5,X7)
| number_of_in(sequential_pairs,X7) = minus(length_of(X7),n1) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(95,plain,
! [X8,X9,X10] :
( ~ path(X8,X9,X10)
| number_of_in(sequential_pairs,X10) = minus(length_of(X10),n1) ),
inference(variable_rename,[status(thm)],[94]) ).
cnf(96,plain,
( number_of_in(sequential_pairs,X1) = minus(length_of(X1),n1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[95]) ).
fof(97,plain,
( ~ complete
| ! [X4,X5,X2,X3,X7] :
( ~ shortest_path(X4,X5,X7)
| ~ precedes(X2,X3,X7)
| ~ sequential(X2,X3)
| ? [X8] : triangle(X2,X3,X8) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(98,plain,
( ~ complete
| ! [X9,X10,X11,X12,X13] :
( ~ shortest_path(X9,X10,X13)
| ~ precedes(X11,X12,X13)
| ~ sequential(X11,X12)
| ? [X14] : triangle(X11,X12,X14) ) ),
inference(variable_rename,[status(thm)],[97]) ).
fof(99,plain,
( ~ complete
| ! [X9,X10,X11,X12,X13] :
( ~ shortest_path(X9,X10,X13)
| ~ precedes(X11,X12,X13)
| ~ sequential(X11,X12)
| triangle(X11,X12,esk6_5(X9,X10,X11,X12,X13)) ) ),
inference(skolemize,[status(esa)],[98]) ).
fof(100,plain,
! [X9,X10,X11,X12,X13] :
( ~ shortest_path(X9,X10,X13)
| ~ precedes(X11,X12,X13)
| ~ sequential(X11,X12)
| triangle(X11,X12,esk6_5(X9,X10,X11,X12,X13))
| ~ complete ),
inference(shift_quantors,[status(thm)],[99]) ).
cnf(101,plain,
( triangle(X1,X2,esk6_5(X3,X4,X1,X2,X5))
| ~ complete
| ~ sequential(X1,X2)
| ~ precedes(X1,X2,X5)
| ~ shortest_path(X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[100]) ).
fof(112,negated_conjecture,
( complete
& ? [X7,X4,X5] :
( shortest_path(X4,X5,X7)
& ~ less_or_equal(minus(length_of(X7),n1),number_of_in(triangles,graph)) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(113,negated_conjecture,
( complete
& ? [X8,X9,X10] :
( shortest_path(X9,X10,X8)
& ~ less_or_equal(minus(length_of(X8),n1),number_of_in(triangles,graph)) ) ),
inference(variable_rename,[status(thm)],[112]) ).
fof(114,negated_conjecture,
( complete
& shortest_path(esk8_0,esk9_0,esk7_0)
& ~ less_or_equal(minus(length_of(esk7_0),n1),number_of_in(triangles,graph)) ),
inference(skolemize,[status(esa)],[113]) ).
cnf(115,negated_conjecture,
~ less_or_equal(minus(length_of(esk7_0),n1),number_of_in(triangles,graph)),
inference(split_conjunct,[status(thm)],[114]) ).
cnf(116,negated_conjecture,
shortest_path(esk8_0,esk9_0,esk7_0),
inference(split_conjunct,[status(thm)],[114]) ).
cnf(117,negated_conjecture,
complete,
inference(split_conjunct,[status(thm)],[114]) ).
cnf(120,negated_conjecture,
path(esk8_0,esk9_0,esk7_0),
inference(spm,[status(thm)],[45,116,theory(equality)]) ).
cnf(149,plain,
( triangle(X1,X2,esk6_5(X3,X4,X1,X2,X5))
| $false
| ~ sequential(X1,X2)
| ~ shortest_path(X3,X4,X5)
| ~ precedes(X1,X2,X5) ),
inference(rw,[status(thm)],[101,117,theory(equality)]) ).
cnf(150,plain,
( triangle(X1,X2,esk6_5(X3,X4,X1,X2,X5))
| ~ sequential(X1,X2)
| ~ shortest_path(X3,X4,X5)
| ~ precedes(X1,X2,X5) ),
inference(cn,[status(thm)],[149,theory(equality)]) ).
cnf(157,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1)
| ~ precedes(esk4_3(X1,X2,X3),esk5_3(X1,X2,X3),X6)
| ~ shortest_path(X4,X5,X6)
| ~ sequential(esk4_3(X1,X2,X3),esk5_3(X1,X2,X3)) ),
inference(spm,[status(thm)],[93,150,theory(equality)]) ).
cnf(179,negated_conjecture,
length_of(esk7_0) = number_of_in(edges,esk7_0),
inference(spm,[status(thm)],[82,120,theory(equality)]) ).
cnf(181,negated_conjecture,
minus(length_of(esk7_0),n1) = number_of_in(sequential_pairs,esk7_0),
inference(spm,[status(thm)],[96,120,theory(equality)]) ).
cnf(182,negated_conjecture,
( precedes(X1,X2,esk7_0)
| ~ on_path(X2,esk7_0)
| ~ on_path(X1,esk7_0)
| ~ sequential(X1,X2) ),
inference(spm,[status(thm)],[78,120,theory(equality)]) ).
cnf(185,negated_conjecture,
~ less_or_equal(minus(number_of_in(edges,esk7_0),n1),number_of_in(triangles,graph)),
inference(rw,[status(thm)],[115,179,theory(equality)]) ).
cnf(186,negated_conjecture,
minus(number_of_in(edges,esk7_0),n1) = number_of_in(sequential_pairs,esk7_0),
inference(rw,[status(thm)],[181,179,theory(equality)]) ).
cnf(187,negated_conjecture,
~ less_or_equal(number_of_in(sequential_pairs,esk7_0),number_of_in(triangles,graph)),
inference(rw,[status(thm)],[185,186,theory(equality)]) ).
cnf(214,negated_conjecture,
( precedes(X1,esk5_3(esk7_0,X2,X3),esk7_0)
| number_of_in(triangles,esk7_0) = number_of_in(sequential_pairs,esk7_0)
| ~ on_path(X1,esk7_0)
| ~ sequential(X1,esk5_3(esk7_0,X2,X3))
| ~ path(X2,X3,esk7_0) ),
inference(spm,[status(thm)],[182,91,theory(equality)]) ).
cnf(383,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ precedes(esk4_3(X1,X2,X3),esk5_3(X1,X2,X3),X6)
| ~ path(X2,X3,X1)
| ~ shortest_path(X4,X5,X6) ),
inference(csr,[status(thm)],[157,90]) ).
cnf(384,negated_conjecture,
( number_of_in(triangles,esk7_0) = number_of_in(sequential_pairs,esk7_0)
| ~ path(X1,X2,esk7_0)
| ~ shortest_path(X3,X4,esk7_0)
| ~ on_path(esk4_3(esk7_0,X1,X2),esk7_0)
| ~ sequential(esk4_3(esk7_0,X1,X2),esk5_3(esk7_0,X1,X2)) ),
inference(spm,[status(thm)],[383,214,theory(equality)]) ).
cnf(393,negated_conjecture,
( number_of_in(triangles,esk7_0) = number_of_in(sequential_pairs,esk7_0)
| ~ on_path(esk4_3(esk7_0,X1,X2),esk7_0)
| ~ path(X1,X2,esk7_0)
| ~ shortest_path(X3,X4,esk7_0) ),
inference(csr,[status(thm)],[384,90]) ).
cnf(394,negated_conjecture,
( number_of_in(triangles,esk7_0) = number_of_in(sequential_pairs,esk7_0)
| ~ path(X1,X2,esk7_0)
| ~ shortest_path(X3,X4,esk7_0) ),
inference(csr,[status(thm)],[393,92]) ).
cnf(395,negated_conjecture,
( number_of_in(triangles,esk7_0) = number_of_in(sequential_pairs,esk7_0)
| ~ shortest_path(X1,X2,esk7_0) ),
inference(spm,[status(thm)],[394,120,theory(equality)]) ).
cnf(396,negated_conjecture,
number_of_in(triangles,esk7_0) = number_of_in(sequential_pairs,esk7_0),
inference(spm,[status(thm)],[395,116,theory(equality)]) ).
cnf(397,negated_conjecture,
less_or_equal(number_of_in(sequential_pairs,esk7_0),number_of_in(triangles,graph)),
inference(spm,[status(thm)],[84,396,theory(equality)]) ).
cnf(409,negated_conjecture,
$false,
inference(sr,[status(thm)],[397,187,theory(equality)]) ).
cnf(410,negated_conjecture,
$false,
409,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GRA/GRA002+3.p
% --creating new selector for [GRA001+0.ax]
% -running prover on /tmp/tmpDxktXv/sel_GRA002+3.p_1 with time limit 29
% -prover status Theorem
% Problem GRA002+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GRA/GRA002+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GRA/GRA002+3.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------