TSTP Solution File: PUZ129+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : PUZ129+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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 : Sun Dec 26 00:57:12 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 2
% Syntax : Number of formulae : 57 ( 10 unt; 0 def)
% Number of atoms : 441 ( 94 equ)
% Maximal formula atoms : 58 ( 7 avg)
% Number of connectives : 609 ( 225 ~; 199 |; 151 &)
% ( 0 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-1 aty)
% Number of variables : 174 ( 0 sgn 90 !; 46 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ( ! [X1] :
( ( person(X1)
& property1(X1,honest,pos)
& property1(X1,industrious,pos) )
=> ? [X2] :
( property1(X2,healthy,pos)
& X1 = X2 ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( property1(X4,healthy,pos)
& X3 = X4 ) )
& ! [X5] :
( ( grocer(X5)
& property1(X5,industrious,pos) )
=> ? [X6] :
( property1(X6,honest,pos)
& X5 = X6 ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( property1(X8,industrious,pos)
& X7 = X8 ) )
& ! [X9] :
( ( cyclist(X9)
& property1(X9,unhealthy,pos) )
=> ? [X10] :
( property1(X10,dishonest,pos)
& X9 = X10 ) )
& ! [X11] :
( ( person(X11)
& property1(X11,healthy,pos) )
=> ~ ? [X12] :
( property1(X12,unhealthy,pos)
& X11 = X12 ) )
& ! [X13] :
( ( person(X13)
& property1(X13,honest,pos) )
=> ~ ? [X14] :
( property1(X14,dishonest,pos)
& X13 = X14 ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( person(X16)
& X15 = X16 ) )
& ! [X17] :
( cyclist(X17)
=> ? [X18] :
( person(X18)
& X17 = X18 ) ) )
=> ! [X19] :
( grocer(X19)
=> ~ ? [X20] :
( cyclist(X20)
& X19 = X20 ) ) ),
file('/tmp/tmp6ZSDhU/sel_PUZ129+2.p_1',prove) ).
fof(2,negated_conjecture,
~ ( ( ! [X1] :
( ( person(X1)
& property1(X1,honest,pos)
& property1(X1,industrious,pos) )
=> ? [X2] :
( property1(X2,healthy,pos)
& X1 = X2 ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( property1(X4,healthy,pos)
& X3 = X4 ) )
& ! [X5] :
( ( grocer(X5)
& property1(X5,industrious,pos) )
=> ? [X6] :
( property1(X6,honest,pos)
& X5 = X6 ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( property1(X8,industrious,pos)
& X7 = X8 ) )
& ! [X9] :
( ( cyclist(X9)
& property1(X9,unhealthy,pos) )
=> ? [X10] :
( property1(X10,dishonest,pos)
& X9 = X10 ) )
& ! [X11] :
( ( person(X11)
& property1(X11,healthy,pos) )
=> ~ ? [X12] :
( property1(X12,unhealthy,pos)
& X11 = X12 ) )
& ! [X13] :
( ( person(X13)
& property1(X13,honest,pos) )
=> ~ ? [X14] :
( property1(X14,dishonest,pos)
& X13 = X14 ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( person(X16)
& X15 = X16 ) )
& ! [X17] :
( cyclist(X17)
=> ? [X18] :
( person(X18)
& X17 = X18 ) ) )
=> ! [X19] :
( grocer(X19)
=> ~ ? [X20] :
( cyclist(X20)
& X19 = X20 ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,plain,
( epred1_0
=> ( ! [X1] :
( ( person(X1)
& property1(X1,honest,pos)
& property1(X1,industrious,pos) )
=> ? [X2] :
( property1(X2,healthy,pos)
& X1 = X2 ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( property1(X4,healthy,pos)
& X3 = X4 ) )
& ! [X5] :
( ( grocer(X5)
& property1(X5,industrious,pos) )
=> ? [X6] :
( property1(X6,honest,pos)
& X5 = X6 ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( property1(X8,industrious,pos)
& X7 = X8 ) )
& ! [X9] :
( ( cyclist(X9)
& property1(X9,unhealthy,pos) )
=> ? [X10] :
( property1(X10,dishonest,pos)
& X9 = X10 ) )
& ! [X11] :
( ( person(X11)
& property1(X11,healthy,pos) )
=> ~ ? [X12] :
( property1(X12,unhealthy,pos)
& X11 = X12 ) )
& ! [X13] :
( ( person(X13)
& property1(X13,honest,pos) )
=> ~ ? [X14] :
( property1(X14,dishonest,pos)
& X13 = X14 ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( person(X16)
& X15 = X16 ) )
& ! [X17] :
( cyclist(X17)
=> ? [X18] :
( person(X18)
& X17 = X18 ) ) ) ),
introduced(definition) ).
fof(4,negated_conjecture,
~ ( epred1_0
=> ! [X19] :
( grocer(X19)
=> ~ ? [X20] :
( cyclist(X20)
& X19 = X20 ) ) ),
inference(apply_def,[status(esa)],[2,3,theory(equality)]) ).
fof(5,negated_conjecture,
( epred1_0
& ? [X19] :
( grocer(X19)
& ? [X20] :
( cyclist(X20)
& X19 = X20 ) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(6,negated_conjecture,
( epred1_0
& ? [X21] :
( grocer(X21)
& ? [X22] :
( cyclist(X22)
& X21 = X22 ) ) ),
inference(variable_rename,[status(thm)],[5]) ).
fof(7,negated_conjecture,
( epred1_0
& grocer(esk1_0)
& cyclist(esk2_0)
& esk1_0 = esk2_0 ),
inference(skolemize,[status(esa)],[6]) ).
cnf(8,negated_conjecture,
esk1_0 = esk2_0,
inference(split_conjunct,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
cyclist(esk2_0),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(10,negated_conjecture,
grocer(esk1_0),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(11,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[7]) ).
fof(12,plain,
( ~ epred1_0
| ( ! [X1] :
( ~ person(X1)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos)
| ? [X2] :
( property1(X2,healthy,pos)
& X1 = X2 ) )
& ! [X3] :
( ~ grocer(X3)
| ! [X4] :
( ~ property1(X4,healthy,pos)
| X3 != X4 ) )
& ! [X5] :
( ~ grocer(X5)
| ~ property1(X5,industrious,pos)
| ? [X6] :
( property1(X6,honest,pos)
& X5 = X6 ) )
& ! [X7] :
( ~ cyclist(X7)
| ? [X8] :
( property1(X8,industrious,pos)
& X7 = X8 ) )
& ! [X9] :
( ~ cyclist(X9)
| ~ property1(X9,unhealthy,pos)
| ? [X10] :
( property1(X10,dishonest,pos)
& X9 = X10 ) )
& ! [X11] :
( ~ person(X11)
| ~ property1(X11,healthy,pos)
| ! [X12] :
( ~ property1(X12,unhealthy,pos)
| X11 != X12 ) )
& ! [X13] :
( ~ person(X13)
| ~ property1(X13,honest,pos)
| ! [X14] :
( ~ property1(X14,dishonest,pos)
| X13 != X14 ) )
& ! [X15] :
( ~ grocer(X15)
| ? [X16] :
( person(X16)
& X15 = X16 ) )
& ! [X17] :
( ~ cyclist(X17)
| ? [X18] :
( person(X18)
& X17 = X18 ) ) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(13,plain,
( ~ epred1_0
| ( ! [X19] :
( ~ person(X19)
| ~ property1(X19,honest,pos)
| ~ property1(X19,industrious,pos)
| ? [X20] :
( property1(X20,healthy,pos)
& X19 = X20 ) )
& ! [X21] :
( ~ grocer(X21)
| ! [X22] :
( ~ property1(X22,healthy,pos)
| X21 != X22 ) )
& ! [X23] :
( ~ grocer(X23)
| ~ property1(X23,industrious,pos)
| ? [X24] :
( property1(X24,honest,pos)
& X23 = X24 ) )
& ! [X25] :
( ~ cyclist(X25)
| ? [X26] :
( property1(X26,industrious,pos)
& X25 = X26 ) )
& ! [X27] :
( ~ cyclist(X27)
| ~ property1(X27,unhealthy,pos)
| ? [X28] :
( property1(X28,dishonest,pos)
& X27 = X28 ) )
& ! [X29] :
( ~ person(X29)
| ~ property1(X29,healthy,pos)
| ! [X30] :
( ~ property1(X30,unhealthy,pos)
| X29 != X30 ) )
& ! [X31] :
( ~ person(X31)
| ~ property1(X31,honest,pos)
| ! [X32] :
( ~ property1(X32,dishonest,pos)
| X31 != X32 ) )
& ! [X33] :
( ~ grocer(X33)
| ? [X34] :
( person(X34)
& X33 = X34 ) )
& ! [X35] :
( ~ cyclist(X35)
| ? [X36] :
( person(X36)
& X35 = X36 ) ) ) ),
inference(variable_rename,[status(thm)],[12]) ).
fof(14,plain,
( ~ epred1_0
| ( ! [X19] :
( ~ person(X19)
| ~ property1(X19,honest,pos)
| ~ property1(X19,industrious,pos)
| ( property1(esk3_1(X19),healthy,pos)
& X19 = esk3_1(X19) ) )
& ! [X21] :
( ~ grocer(X21)
| ! [X22] :
( ~ property1(X22,healthy,pos)
| X21 != X22 ) )
& ! [X23] :
( ~ grocer(X23)
| ~ property1(X23,industrious,pos)
| ( property1(esk4_1(X23),honest,pos)
& X23 = esk4_1(X23) ) )
& ! [X25] :
( ~ cyclist(X25)
| ( property1(esk5_1(X25),industrious,pos)
& X25 = esk5_1(X25) ) )
& ! [X27] :
( ~ cyclist(X27)
| ~ property1(X27,unhealthy,pos)
| ( property1(esk6_1(X27),dishonest,pos)
& X27 = esk6_1(X27) ) )
& ! [X29] :
( ~ person(X29)
| ~ property1(X29,healthy,pos)
| ! [X30] :
( ~ property1(X30,unhealthy,pos)
| X29 != X30 ) )
& ! [X31] :
( ~ person(X31)
| ~ property1(X31,honest,pos)
| ! [X32] :
( ~ property1(X32,dishonest,pos)
| X31 != X32 ) )
& ! [X33] :
( ~ grocer(X33)
| ( person(esk7_1(X33))
& X33 = esk7_1(X33) ) )
& ! [X35] :
( ~ cyclist(X35)
| ( person(esk8_1(X35))
& X35 = esk8_1(X35) ) ) ) ),
inference(skolemize,[status(esa)],[13]) ).
fof(15,plain,
! [X19,X21,X22,X23,X25,X27,X29,X30,X31,X32,X33,X35] :
( ( ( ~ cyclist(X35)
| ( person(esk8_1(X35))
& X35 = esk8_1(X35) ) )
& ( ~ grocer(X33)
| ( person(esk7_1(X33))
& X33 = esk7_1(X33) ) )
& ( ~ property1(X32,dishonest,pos)
| X31 != X32
| ~ person(X31)
| ~ property1(X31,honest,pos) )
& ( ~ property1(X30,unhealthy,pos)
| X29 != X30
| ~ person(X29)
| ~ property1(X29,healthy,pos) )
& ( ~ cyclist(X27)
| ~ property1(X27,unhealthy,pos)
| ( property1(esk6_1(X27),dishonest,pos)
& X27 = esk6_1(X27) ) )
& ( ~ cyclist(X25)
| ( property1(esk5_1(X25),industrious,pos)
& X25 = esk5_1(X25) ) )
& ( ~ grocer(X23)
| ~ property1(X23,industrious,pos)
| ( property1(esk4_1(X23),honest,pos)
& X23 = esk4_1(X23) ) )
& ( ~ property1(X22,healthy,pos)
| X21 != X22
| ~ grocer(X21) )
& ( ~ person(X19)
| ~ property1(X19,honest,pos)
| ~ property1(X19,industrious,pos)
| ( property1(esk3_1(X19),healthy,pos)
& X19 = esk3_1(X19) ) ) )
| ~ epred1_0 ),
inference(shift_quantors,[status(thm)],[14]) ).
fof(16,plain,
! [X19,X21,X22,X23,X25,X27,X29,X30,X31,X32,X33,X35] :
( ( person(esk8_1(X35))
| ~ cyclist(X35)
| ~ epred1_0 )
& ( X35 = esk8_1(X35)
| ~ cyclist(X35)
| ~ epred1_0 )
& ( person(esk7_1(X33))
| ~ grocer(X33)
| ~ epred1_0 )
& ( X33 = esk7_1(X33)
| ~ grocer(X33)
| ~ epred1_0 )
& ( ~ property1(X32,dishonest,pos)
| X31 != X32
| ~ person(X31)
| ~ property1(X31,honest,pos)
| ~ epred1_0 )
& ( ~ property1(X30,unhealthy,pos)
| X29 != X30
| ~ person(X29)
| ~ property1(X29,healthy,pos)
| ~ epred1_0 )
& ( property1(esk6_1(X27),dishonest,pos)
| ~ cyclist(X27)
| ~ property1(X27,unhealthy,pos)
| ~ epred1_0 )
& ( X27 = esk6_1(X27)
| ~ cyclist(X27)
| ~ property1(X27,unhealthy,pos)
| ~ epred1_0 )
& ( property1(esk5_1(X25),industrious,pos)
| ~ cyclist(X25)
| ~ epred1_0 )
& ( X25 = esk5_1(X25)
| ~ cyclist(X25)
| ~ epred1_0 )
& ( property1(esk4_1(X23),honest,pos)
| ~ grocer(X23)
| ~ property1(X23,industrious,pos)
| ~ epred1_0 )
& ( X23 = esk4_1(X23)
| ~ grocer(X23)
| ~ property1(X23,industrious,pos)
| ~ epred1_0 )
& ( ~ property1(X22,healthy,pos)
| X21 != X22
| ~ grocer(X21)
| ~ epred1_0 )
& ( property1(esk3_1(X19),healthy,pos)
| ~ person(X19)
| ~ property1(X19,honest,pos)
| ~ property1(X19,industrious,pos)
| ~ epred1_0 )
& ( X19 = esk3_1(X19)
| ~ person(X19)
| ~ property1(X19,honest,pos)
| ~ property1(X19,industrious,pos)
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[15]) ).
cnf(17,plain,
( X1 = esk3_1(X1)
| ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ property1(X1,honest,pos)
| ~ person(X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(18,plain,
( property1(esk3_1(X1),healthy,pos)
| ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ property1(X1,honest,pos)
| ~ person(X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(19,plain,
( ~ epred1_0
| ~ grocer(X1)
| X1 != X2
| ~ property1(X2,healthy,pos) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(20,plain,
( X1 = esk4_1(X1)
| ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ grocer(X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(21,plain,
( property1(esk4_1(X1),honest,pos)
| ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ grocer(X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(22,plain,
( X1 = esk5_1(X1)
| ~ epred1_0
| ~ cyclist(X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(23,plain,
( property1(esk5_1(X1),industrious,pos)
| ~ epred1_0
| ~ cyclist(X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(28,plain,
( X1 = esk7_1(X1)
| ~ epred1_0
| ~ grocer(X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(29,plain,
( person(esk7_1(X1))
| ~ epred1_0
| ~ grocer(X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(32,negated_conjecture,
cyclist(esk1_0),
inference(rw,[status(thm)],[9,8,theory(equality)]) ).
cnf(33,plain,
( esk5_1(X1) = X1
| $false
| ~ cyclist(X1) ),
inference(rw,[status(thm)],[22,11,theory(equality)]) ).
cnf(34,plain,
( esk5_1(X1) = X1
| ~ cyclist(X1) ),
inference(cn,[status(thm)],[33,theory(equality)]) ).
cnf(35,plain,
( esk7_1(X1) = X1
| $false
| ~ grocer(X1) ),
inference(rw,[status(thm)],[28,11,theory(equality)]) ).
cnf(36,plain,
( esk7_1(X1) = X1
| ~ grocer(X1) ),
inference(cn,[status(thm)],[35,theory(equality)]) ).
cnf(39,plain,
( person(esk7_1(X1))
| $false
| ~ grocer(X1) ),
inference(rw,[status(thm)],[29,11,theory(equality)]) ).
cnf(40,plain,
( person(esk7_1(X1))
| ~ grocer(X1) ),
inference(cn,[status(thm)],[39,theory(equality)]) ).
cnf(41,plain,
( person(X1)
| ~ grocer(X1) ),
inference(spm,[status(thm)],[40,36,theory(equality)]) ).
cnf(45,plain,
( property1(esk5_1(X1),industrious,pos)
| $false
| ~ cyclist(X1) ),
inference(rw,[status(thm)],[23,11,theory(equality)]) ).
cnf(46,plain,
( property1(esk5_1(X1),industrious,pos)
| ~ cyclist(X1) ),
inference(cn,[status(thm)],[45,theory(equality)]) ).
cnf(47,plain,
( property1(X1,industrious,pos)
| ~ cyclist(X1) ),
inference(spm,[status(thm)],[46,34,theory(equality)]) ).
cnf(48,plain,
( X1 != X2
| $false
| ~ grocer(X1)
| ~ property1(X2,healthy,pos) ),
inference(rw,[status(thm)],[19,11,theory(equality)]) ).
cnf(49,plain,
( X1 != X2
| ~ grocer(X1)
| ~ property1(X2,healthy,pos) ),
inference(cn,[status(thm)],[48,theory(equality)]) ).
cnf(50,plain,
( ~ grocer(X1)
| ~ property1(X1,healthy,pos) ),
inference(er,[status(thm)],[49,theory(equality)]) ).
cnf(51,plain,
( esk4_1(X1) = X1
| $false
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(rw,[status(thm)],[20,11,theory(equality)]) ).
cnf(52,plain,
( esk4_1(X1) = X1
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(cn,[status(thm)],[51,theory(equality)]) ).
cnf(55,plain,
( property1(esk4_1(X1),honest,pos)
| $false
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(rw,[status(thm)],[21,11,theory(equality)]) ).
cnf(56,plain,
( property1(esk4_1(X1),honest,pos)
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(cn,[status(thm)],[55,theory(equality)]) ).
cnf(57,plain,
( property1(X1,honest,pos)
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(spm,[status(thm)],[56,52,theory(equality)]) ).
cnf(61,plain,
( esk3_1(X1) = X1
| $false
| ~ person(X1)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos) ),
inference(rw,[status(thm)],[17,11,theory(equality)]) ).
cnf(62,plain,
( esk3_1(X1) = X1
| ~ person(X1)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos) ),
inference(cn,[status(thm)],[61,theory(equality)]) ).
cnf(69,plain,
( property1(esk3_1(X1),healthy,pos)
| $false
| ~ person(X1)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos) ),
inference(rw,[status(thm)],[18,11,theory(equality)]) ).
cnf(70,plain,
( property1(esk3_1(X1),healthy,pos)
| ~ person(X1)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos) ),
inference(cn,[status(thm)],[69,theory(equality)]) ).
cnf(71,plain,
( property1(X1,healthy,pos)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos)
| ~ person(X1) ),
inference(spm,[status(thm)],[70,62,theory(equality)]) ).
cnf(77,negated_conjecture,
property1(esk1_0,industrious,pos),
inference(spm,[status(thm)],[47,32,theory(equality)]) ).
cnf(90,plain,
( property1(X1,healthy,pos)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos)
| ~ grocer(X1) ),
inference(spm,[status(thm)],[71,41,theory(equality)]) ).
cnf(99,plain,
( property1(X1,healthy,pos)
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(csr,[status(thm)],[90,57]) ).
cnf(100,plain,
( ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(csr,[status(thm)],[99,50]) ).
cnf(101,negated_conjecture,
~ property1(esk1_0,industrious,pos),
inference(spm,[status(thm)],[100,10,theory(equality)]) ).
cnf(102,negated_conjecture,
$false,
inference(rw,[status(thm)],[101,77,theory(equality)]) ).
cnf(103,negated_conjecture,
$false,
inference(cn,[status(thm)],[102,theory(equality)]) ).
cnf(104,negated_conjecture,
$false,
103,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/PUZ/PUZ129+2.p
% --creating new selector for []
% -running prover on /tmp/tmp6ZSDhU/sel_PUZ129+2.p_1 with time limit 29
% -prover status Theorem
% Problem PUZ129+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/PUZ/PUZ129+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/PUZ/PUZ129+2.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
%
%------------------------------------------------------------------------------