TSTP Solution File: SWC264+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC264+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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 11:07:57 EST 2010
% Result : Theorem 0.54s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 53 ( 8 unt; 0 def)
% Number of atoms : 415 ( 47 equ)
% Maximal formula atoms : 30 ( 7 avg)
% Number of connectives : 577 ( 215 ~; 234 |; 100 &)
% ( 3 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 9 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 149 ( 0 sgn 94 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(31,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/tmp/tmp0CNr3U/sel_SWC264+1.p_1',ax11) ).
fof(32,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/tmp/tmp0CNr3U/sel_SWC264+1.p_1',ax12) ).
fof(33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
file('/tmp/tmp0CNr3U/sel_SWC264+1.p_1',ax93) ).
fof(38,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ~ strictorderedP(X3)
| totalorderedP(X1) ) ) ) ),
file('/tmp/tmp0CNr3U/sel_SWC264+1.p_1',co1) ).
fof(39,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ~ strictorderedP(X3)
| totalorderedP(X1) ) ) ) ),
inference(assume_negation,[status(cth)],[38]) ).
fof(42,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ~ strictorderedP(X3)
| totalorderedP(X1) ) ) ) ),
inference(fof_simplification,[status(thm)],[39,theory(equality)]) ).
fof(167,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ totalorderedP(X1)
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssItem(X3)
| ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| leq(X2,X3) ) ) ) ) ) )
& ( ? [X2] :
( ssItem(X2)
& ? [X3] :
( ssItem(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
& ~ leq(X2,X3) ) ) ) ) )
| totalorderedP(X1) ) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(168,plain,
! [X7] :
( ~ ssList(X7)
| ( ( ~ totalorderedP(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| leq(X8,X9) ) ) ) ) ) )
& ( ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssItem(X14)
& ? [X15] :
( ssList(X15)
& ? [X16] :
( ssList(X16)
& ? [X17] :
( ssList(X17)
& app(app(X15,cons(X13,X16)),cons(X14,X17)) = X7
& ~ leq(X13,X14) ) ) ) ) )
| totalorderedP(X7) ) ) ),
inference(variable_rename,[status(thm)],[167]) ).
fof(169,plain,
! [X7] :
( ~ ssList(X7)
| ( ( ~ totalorderedP(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| leq(X8,X9) ) ) ) ) ) )
& ( ( ssItem(esk6_1(X7))
& ssItem(esk7_1(X7))
& ssList(esk8_1(X7))
& ssList(esk9_1(X7))
& ssList(esk10_1(X7))
& app(app(esk8_1(X7),cons(esk6_1(X7),esk9_1(X7))),cons(esk7_1(X7),esk10_1(X7))) = X7
& ~ leq(esk6_1(X7),esk7_1(X7)) )
| totalorderedP(X7) ) ) ),
inference(skolemize,[status(esa)],[168]) ).
fof(170,plain,
! [X7,X8,X9,X10,X11,X12] :
( ( ( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| leq(X8,X9)
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssItem(X9)
| ~ ssItem(X8)
| ~ totalorderedP(X7) )
& ( ( ssItem(esk6_1(X7))
& ssItem(esk7_1(X7))
& ssList(esk8_1(X7))
& ssList(esk9_1(X7))
& ssList(esk10_1(X7))
& app(app(esk8_1(X7),cons(esk6_1(X7),esk9_1(X7))),cons(esk7_1(X7),esk10_1(X7))) = X7
& ~ leq(esk6_1(X7),esk7_1(X7)) )
| totalorderedP(X7) ) )
| ~ ssList(X7) ),
inference(shift_quantors,[status(thm)],[169]) ).
fof(171,plain,
! [X7,X8,X9,X10,X11,X12] :
( ( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| leq(X8,X9)
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssItem(X9)
| ~ ssItem(X8)
| ~ totalorderedP(X7)
| ~ ssList(X7) )
& ( ssItem(esk6_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssItem(esk7_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk8_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk9_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk10_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) )
& ( app(app(esk8_1(X7),cons(esk6_1(X7),esk9_1(X7))),cons(esk7_1(X7),esk10_1(X7))) = X7
| totalorderedP(X7)
| ~ ssList(X7) )
& ( ~ leq(esk6_1(X7),esk7_1(X7))
| totalorderedP(X7)
| ~ ssList(X7) ) ),
inference(distribute,[status(thm)],[170]) ).
cnf(172,plain,
( totalorderedP(X1)
| ~ ssList(X1)
| ~ leq(esk6_1(X1),esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(173,plain,
( totalorderedP(X1)
| app(app(esk8_1(X1),cons(esk6_1(X1),esk9_1(X1))),cons(esk7_1(X1),esk10_1(X1))) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(174,plain,
( totalorderedP(X1)
| ssList(esk10_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(175,plain,
( totalorderedP(X1)
| ssList(esk9_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(176,plain,
( totalorderedP(X1)
| ssList(esk8_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(177,plain,
( totalorderedP(X1)
| ssItem(esk7_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(178,plain,
( totalorderedP(X1)
| ssItem(esk6_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[171]) ).
fof(180,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ strictorderedP(X1)
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssItem(X3)
| ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| lt(X2,X3) ) ) ) ) ) )
& ( ? [X2] :
( ssItem(X2)
& ? [X3] :
( ssItem(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
& ~ lt(X2,X3) ) ) ) ) )
| strictorderedP(X1) ) ) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(181,plain,
! [X7] :
( ~ ssList(X7)
| ( ( ~ strictorderedP(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| lt(X8,X9) ) ) ) ) ) )
& ( ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssItem(X14)
& ? [X15] :
( ssList(X15)
& ? [X16] :
( ssList(X16)
& ? [X17] :
( ssList(X17)
& app(app(X15,cons(X13,X16)),cons(X14,X17)) = X7
& ~ lt(X13,X14) ) ) ) ) )
| strictorderedP(X7) ) ) ),
inference(variable_rename,[status(thm)],[180]) ).
fof(182,plain,
! [X7] :
( ~ ssList(X7)
| ( ( ~ strictorderedP(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| ! [X12] :
( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| lt(X8,X9) ) ) ) ) ) )
& ( ( ssItem(esk11_1(X7))
& ssItem(esk12_1(X7))
& ssList(esk13_1(X7))
& ssList(esk14_1(X7))
& ssList(esk15_1(X7))
& app(app(esk13_1(X7),cons(esk11_1(X7),esk14_1(X7))),cons(esk12_1(X7),esk15_1(X7))) = X7
& ~ lt(esk11_1(X7),esk12_1(X7)) )
| strictorderedP(X7) ) ) ),
inference(skolemize,[status(esa)],[181]) ).
fof(183,plain,
! [X7,X8,X9,X10,X11,X12] :
( ( ( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| lt(X8,X9)
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssItem(X9)
| ~ ssItem(X8)
| ~ strictorderedP(X7) )
& ( ( ssItem(esk11_1(X7))
& ssItem(esk12_1(X7))
& ssList(esk13_1(X7))
& ssList(esk14_1(X7))
& ssList(esk15_1(X7))
& app(app(esk13_1(X7),cons(esk11_1(X7),esk14_1(X7))),cons(esk12_1(X7),esk15_1(X7))) = X7
& ~ lt(esk11_1(X7),esk12_1(X7)) )
| strictorderedP(X7) ) )
| ~ ssList(X7) ),
inference(shift_quantors,[status(thm)],[182]) ).
fof(184,plain,
! [X7,X8,X9,X10,X11,X12] :
( ( ~ ssList(X12)
| app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
| lt(X8,X9)
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssItem(X9)
| ~ ssItem(X8)
| ~ strictorderedP(X7)
| ~ ssList(X7) )
& ( ssItem(esk11_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssItem(esk12_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk13_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk14_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ssList(esk15_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) )
& ( app(app(esk13_1(X7),cons(esk11_1(X7),esk14_1(X7))),cons(esk12_1(X7),esk15_1(X7))) = X7
| strictorderedP(X7)
| ~ ssList(X7) )
& ( ~ lt(esk11_1(X7),esk12_1(X7))
| strictorderedP(X7)
| ~ ssList(X7) ) ),
inference(distribute,[status(thm)],[183]) ).
cnf(192,plain,
( lt(X2,X3)
| ~ ssList(X1)
| ~ strictorderedP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6) ),
inference(split_conjunct,[status(thm)],[184]) ).
fof(193,plain,
! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssItem(X2)
| ( ( ~ lt(X1,X2)
| ( X1 != X2
& leq(X1,X2) ) )
& ( X1 = X2
| ~ leq(X1,X2)
| lt(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[33]) ).
fof(194,plain,
! [X3] :
( ~ ssItem(X3)
| ! [X4] :
( ~ ssItem(X4)
| ( ( ~ lt(X3,X4)
| ( X3 != X4
& leq(X3,X4) ) )
& ( X3 = X4
| ~ leq(X3,X4)
| lt(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[193]) ).
fof(195,plain,
! [X3,X4] :
( ~ ssItem(X4)
| ( ( ~ lt(X3,X4)
| ( X3 != X4
& leq(X3,X4) ) )
& ( X3 = X4
| ~ leq(X3,X4)
| lt(X3,X4) ) )
| ~ ssItem(X3) ),
inference(shift_quantors,[status(thm)],[194]) ).
fof(196,plain,
! [X3,X4] :
( ( X3 != X4
| ~ lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) )
& ( leq(X3,X4)
| ~ lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) )
& ( X3 = X4
| ~ leq(X3,X4)
| lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) ) ),
inference(distribute,[status(thm)],[195]) ).
cnf(198,plain,
( leq(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2) ),
inference(split_conjunct,[status(thm)],[196]) ).
fof(217,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& strictorderedP(X3)
& ~ totalorderedP(X1) ) ) ) ),
inference(fof_nnf,[status(thm)],[42]) ).
fof(218,negated_conjecture,
? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& X6 = X8
& X5 = X7
& strictorderedP(X7)
& ~ totalorderedP(X5) ) ) ) ),
inference(variable_rename,[status(thm)],[217]) ).
fof(219,negated_conjecture,
( ssList(esk16_0)
& ssList(esk17_0)
& ssList(esk18_0)
& ssList(esk19_0)
& esk17_0 = esk19_0
& esk16_0 = esk18_0
& strictorderedP(esk18_0)
& ~ totalorderedP(esk16_0) ),
inference(skolemize,[status(esa)],[218]) ).
cnf(220,negated_conjecture,
~ totalorderedP(esk16_0),
inference(split_conjunct,[status(thm)],[219]) ).
cnf(221,negated_conjecture,
strictorderedP(esk18_0),
inference(split_conjunct,[status(thm)],[219]) ).
cnf(222,negated_conjecture,
esk16_0 = esk18_0,
inference(split_conjunct,[status(thm)],[219]) ).
cnf(227,negated_conjecture,
ssList(esk16_0),
inference(split_conjunct,[status(thm)],[219]) ).
cnf(228,negated_conjecture,
strictorderedP(esk16_0),
inference(rw,[status(thm)],[221,222,theory(equality)]) ).
cnf(269,plain,
( totalorderedP(X1)
| ~ ssList(X1)
| ~ lt(esk6_1(X1),esk7_1(X1))
| ~ ssItem(esk7_1(X1))
| ~ ssItem(esk6_1(X1)) ),
inference(spm,[status(thm)],[172,198,theory(equality)]) ).
cnf(416,plain,
( lt(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| X1 != X2
| ~ strictorderedP(X2)
| ~ ssList(esk10_1(X1))
| ~ ssList(esk9_1(X1))
| ~ ssList(esk8_1(X1))
| ~ ssList(X2)
| ~ ssItem(esk7_1(X1))
| ~ ssItem(esk6_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[192,173,theory(equality)]) ).
cnf(421,plain,
( lt(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(esk10_1(X1))
| ~ ssList(esk9_1(X1))
| ~ ssList(esk8_1(X1))
| ~ ssList(X1)
| ~ ssItem(esk7_1(X1))
| ~ ssItem(esk6_1(X1)) ),
inference(er,[status(thm)],[416,theory(equality)]) ).
cnf(787,plain,
( totalorderedP(X1)
| ~ ssList(X1)
| ~ lt(esk6_1(X1),esk7_1(X1))
| ~ ssItem(esk7_1(X1)) ),
inference(csr,[status(thm)],[269,178]) ).
cnf(788,plain,
( totalorderedP(X1)
| ~ ssList(X1)
| ~ lt(esk6_1(X1),esk7_1(X1)) ),
inference(csr,[status(thm)],[787,177]) ).
cnf(7129,plain,
( lt(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(esk10_1(X1))
| ~ ssList(esk9_1(X1))
| ~ ssList(esk8_1(X1))
| ~ ssList(X1)
| ~ ssItem(esk7_1(X1)) ),
inference(csr,[status(thm)],[421,178]) ).
cnf(7130,plain,
( lt(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(esk10_1(X1))
| ~ ssList(esk9_1(X1))
| ~ ssList(esk8_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[7129,177]) ).
cnf(7131,plain,
( lt(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(esk10_1(X1))
| ~ ssList(esk9_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[7130,176]) ).
cnf(7132,plain,
( lt(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(esk10_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[7131,175]) ).
cnf(7133,plain,
( lt(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[7132,174]) ).
cnf(7134,plain,
( totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[7133,788]) ).
cnf(7136,negated_conjecture,
( totalorderedP(esk16_0)
| ~ ssList(esk16_0) ),
inference(spm,[status(thm)],[7134,228,theory(equality)]) ).
cnf(7145,negated_conjecture,
( totalorderedP(esk16_0)
| $false ),
inference(rw,[status(thm)],[7136,227,theory(equality)]) ).
cnf(7146,negated_conjecture,
totalorderedP(esk16_0),
inference(cn,[status(thm)],[7145,theory(equality)]) ).
cnf(7147,negated_conjecture,
$false,
inference(sr,[status(thm)],[7146,220,theory(equality)]) ).
cnf(7148,negated_conjecture,
$false,
7147,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC264+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp0CNr3U/sel_SWC264+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC264+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC264+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC264+1.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
%
%------------------------------------------------------------------------------