TSTP Solution File: SWC080+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC080+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 10:13:10 EST 2010
% Result : Theorem 0.37s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 5
% Syntax : Number of formulae : 69 ( 12 unt; 0 def)
% Number of atoms : 412 ( 50 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 565 ( 222 ~; 222 |; 105 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 118 ( 0 sgn 62 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/tmp/tmp-PcDf_/sel_SWC080+1.p_1',ax28) ).
fof(18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/tmp/tmp-PcDf_/sel_SWC080+1.p_1',ax7) ).
fof(19,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/tmp/tmp-PcDf_/sel_SWC080+1.p_1',ax5) ).
fof(27,axiom,
ssList(nil),
file('/tmp/tmp-PcDf_/sel_SWC080+1.p_1',ax17) ).
fof(34,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ frontsegP(X4,X6)
| ~ frontsegP(X3,X6) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ),
file('/tmp/tmp-PcDf_/sel_SWC080+1.p_1',co1) ).
fof(35,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ frontsegP(X4,X6)
| ~ frontsegP(X3,X6) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[34]) ).
fof(36,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ frontsegP(X4,X6)
| ~ frontsegP(X3,X6) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[35,theory(equality)]) ).
fof(64,plain,
! [X1] :
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(65,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[64]) ).
cnf(66,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[65]) ).
fof(112,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ segmentP(X1,X2)
| ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) )
& ( ! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| app(app(X3,X2),X4) != X1 ) )
| segmentP(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(113,plain,
! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ segmentP(X5,X6)
| ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(X7,X6),X8) = X5 ) ) )
& ( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X9,X6),X10) != X5 ) )
| segmentP(X5,X6) ) ) ) ),
inference(variable_rename,[status(thm)],[112]) ).
fof(114,plain,
! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ segmentP(X5,X6)
| ( ssList(esk5_2(X5,X6))
& ssList(esk6_2(X5,X6))
& app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6)) = X5 ) )
& ( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X9,X6),X10) != X5 ) )
| segmentP(X5,X6) ) ) ) ),
inference(skolemize,[status(esa)],[113]) ).
fof(115,plain,
! [X5,X6,X9,X10] :
( ( ( ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| ~ ssList(X9)
| segmentP(X5,X6) )
& ( ~ segmentP(X5,X6)
| ( ssList(esk5_2(X5,X6))
& ssList(esk6_2(X5,X6))
& app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6)) = X5 ) ) )
| ~ ssList(X6)
| ~ ssList(X5) ),
inference(shift_quantors,[status(thm)],[114]) ).
fof(116,plain,
! [X5,X6,X9,X10] :
( ( ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| ~ ssList(X9)
| segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk5_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk6_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6)) = X5
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) ) ),
inference(distribute,[status(thm)],[115]) ).
cnf(120,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[116]) ).
fof(121,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ frontsegP(X1,X2)
| ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) )
& ( ! [X3] :
( ~ ssList(X3)
| app(X2,X3) != X1 )
| frontsegP(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(122,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ( ( ~ frontsegP(X4,X5)
| ? [X6] :
( ssList(X6)
& app(X5,X6) = X4 ) )
& ( ! [X7] :
( ~ ssList(X7)
| app(X5,X7) != X4 )
| frontsegP(X4,X5) ) ) ) ),
inference(variable_rename,[status(thm)],[121]) ).
fof(123,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ( ( ~ frontsegP(X4,X5)
| ( ssList(esk7_2(X4,X5))
& app(X5,esk7_2(X4,X5)) = X4 ) )
& ( ! [X7] :
( ~ ssList(X7)
| app(X5,X7) != X4 )
| frontsegP(X4,X5) ) ) ) ),
inference(skolemize,[status(esa)],[122]) ).
fof(124,plain,
! [X4,X5,X7] :
( ( ( ~ ssList(X7)
| app(X5,X7) != X4
| frontsegP(X4,X5) )
& ( ~ frontsegP(X4,X5)
| ( ssList(esk7_2(X4,X5))
& app(X5,esk7_2(X4,X5)) = X4 ) ) )
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(shift_quantors,[status(thm)],[123]) ).
fof(125,plain,
! [X4,X5,X7] :
( ( ~ ssList(X7)
| app(X5,X7) != X4
| frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( ssList(esk7_2(X4,X5))
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( app(X5,esk7_2(X4,X5)) = X4
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) ) ),
inference(distribute,[status(thm)],[124]) ).
cnf(126,plain,
( app(X2,esk7_2(X1,X2)) = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[125]) ).
cnf(127,plain,
( ssList(esk7_2(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[125]) ).
cnf(162,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[27]) ).
fof(187,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ( ( neq(X2,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(X2,X5)
| ~ segmentP(X1,X5) )
& ? [X6] :
( ssList(X6)
& neq(X6,nil)
& frontsegP(X4,X6)
& frontsegP(X3,X6) ) )
| ( neq(X2,nil)
& ~ neq(X4,nil) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(188,negated_conjecture,
? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& X8 = X10
& X7 = X9
& ( ( neq(X8,nil)
& ! [X11] :
( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(X8,X11)
| ~ segmentP(X7,X11) )
& ? [X12] :
( ssList(X12)
& neq(X12,nil)
& frontsegP(X10,X12)
& frontsegP(X9,X12) ) )
| ( neq(X8,nil)
& ~ neq(X10,nil) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[187]) ).
fof(189,negated_conjecture,
( ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& ssList(esk11_0)
& esk9_0 = esk11_0
& esk8_0 = esk10_0
& ( ( neq(esk9_0,nil)
& ! [X11] :
( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk9_0,X11)
| ~ segmentP(esk8_0,X11) )
& ssList(esk12_0)
& neq(esk12_0,nil)
& frontsegP(esk11_0,esk12_0)
& frontsegP(esk10_0,esk12_0) )
| ( neq(esk9_0,nil)
& ~ neq(esk11_0,nil) ) ) ),
inference(skolemize,[status(esa)],[188]) ).
fof(190,negated_conjecture,
! [X11] :
( ( ( ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk9_0,X11)
| ~ segmentP(esk8_0,X11) )
& neq(esk9_0,nil)
& ssList(esk12_0)
& neq(esk12_0,nil)
& frontsegP(esk11_0,esk12_0)
& frontsegP(esk10_0,esk12_0) )
| ( neq(esk9_0,nil)
& ~ neq(esk11_0,nil) ) )
& ssList(esk11_0)
& esk9_0 = esk11_0
& esk8_0 = esk10_0
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0) ),
inference(shift_quantors,[status(thm)],[189]) ).
fof(191,negated_conjecture,
! [X11] :
( ( neq(esk9_0,nil)
| ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk9_0,X11)
| ~ segmentP(esk8_0,X11) )
& ( ~ neq(esk11_0,nil)
| ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk9_0,X11)
| ~ segmentP(esk8_0,X11) )
& ( neq(esk9_0,nil)
| neq(esk9_0,nil) )
& ( ~ neq(esk11_0,nil)
| neq(esk9_0,nil) )
& ( neq(esk9_0,nil)
| ssList(esk12_0) )
& ( ~ neq(esk11_0,nil)
| ssList(esk12_0) )
& ( neq(esk9_0,nil)
| neq(esk12_0,nil) )
& ( ~ neq(esk11_0,nil)
| neq(esk12_0,nil) )
& ( neq(esk9_0,nil)
| frontsegP(esk11_0,esk12_0) )
& ( ~ neq(esk11_0,nil)
| frontsegP(esk11_0,esk12_0) )
& ( neq(esk9_0,nil)
| frontsegP(esk10_0,esk12_0) )
& ( ~ neq(esk11_0,nil)
| frontsegP(esk10_0,esk12_0) )
& ssList(esk11_0)
& esk9_0 = esk11_0
& esk8_0 = esk10_0
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0) ),
inference(distribute,[status(thm)],[190]) ).
cnf(192,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(193,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(195,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[191]) ).
cnf(196,negated_conjecture,
esk9_0 = esk11_0,
inference(split_conjunct,[status(thm)],[191]) ).
cnf(198,negated_conjecture,
( frontsegP(esk10_0,esk12_0)
| ~ neq(esk11_0,nil) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(200,negated_conjecture,
( frontsegP(esk11_0,esk12_0)
| ~ neq(esk11_0,nil) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(202,negated_conjecture,
( neq(esk12_0,nil)
| ~ neq(esk11_0,nil) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(204,negated_conjecture,
( ssList(esk12_0)
| ~ neq(esk11_0,nil) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(207,negated_conjecture,
( neq(esk9_0,nil)
| neq(esk9_0,nil) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(208,negated_conjecture,
( ~ segmentP(esk8_0,X1)
| ~ segmentP(esk9_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| ~ neq(esk11_0,nil) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(215,negated_conjecture,
( ssList(esk12_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[204,196,theory(equality)]),207,theory(equality)]) ).
cnf(216,negated_conjecture,
ssList(esk12_0),
inference(cn,[status(thm)],[215,theory(equality)]) ).
cnf(222,negated_conjecture,
( frontsegP(esk8_0,esk12_0)
| ~ neq(esk11_0,nil) ),
inference(rw,[status(thm)],[198,195,theory(equality)]) ).
cnf(223,negated_conjecture,
( frontsegP(esk8_0,esk12_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[222,196,theory(equality)]),207,theory(equality)]) ).
cnf(224,negated_conjecture,
frontsegP(esk8_0,esk12_0),
inference(cn,[status(thm)],[223,theory(equality)]) ).
cnf(225,negated_conjecture,
( frontsegP(esk9_0,esk12_0)
| ~ neq(esk11_0,nil) ),
inference(rw,[status(thm)],[200,196,theory(equality)]) ).
cnf(226,negated_conjecture,
( frontsegP(esk9_0,esk12_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[225,196,theory(equality)]),207,theory(equality)]) ).
cnf(227,negated_conjecture,
frontsegP(esk9_0,esk12_0),
inference(cn,[status(thm)],[226,theory(equality)]) ).
cnf(231,negated_conjecture,
( neq(esk12_0,nil)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[202,196,theory(equality)]),207,theory(equality)]) ).
cnf(232,negated_conjecture,
neq(esk12_0,nil),
inference(cn,[status(thm)],[231,theory(equality)]) ).
cnf(320,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk8_0,X1)
| ~ segmentP(esk9_0,X1)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[208,196,theory(equality)]),207,theory(equality)]) ).
cnf(321,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk8_0,X1)
| ~ segmentP(esk9_0,X1) ),
inference(cn,[status(thm)],[320,theory(equality)]) ).
cnf(391,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(nil)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[120,66,theory(equality)]) ).
cnf(401,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| $false
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[391,162,theory(equality)]) ).
cnf(402,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[401,theory(equality)]) ).
cnf(2703,plain,
( segmentP(X1,X2)
| X3 != X1
| ~ ssList(esk7_2(X3,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X3,X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[402,126,theory(equality)]) ).
cnf(2721,plain,
( segmentP(X1,X2)
| ~ ssList(esk7_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
inference(er,[status(thm)],[2703,theory(equality)]) ).
cnf(2904,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[2721,127]) ).
cnf(2908,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(esk9_0,X1)
| ~ ssList(X1)
| ~ frontsegP(esk8_0,X1)
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[321,2904,theory(equality)]) ).
cnf(2916,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(esk9_0,X1)
| ~ ssList(X1)
| ~ frontsegP(esk8_0,X1)
| $false ),
inference(rw,[status(thm)],[2908,192,theory(equality)]) ).
cnf(2917,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(esk9_0,X1)
| ~ ssList(X1)
| ~ frontsegP(esk8_0,X1) ),
inference(cn,[status(thm)],[2916,theory(equality)]) ).
cnf(3110,negated_conjecture,
( ~ neq(X1,nil)
| ~ frontsegP(esk8_0,X1)
| ~ ssList(X1)
| ~ frontsegP(esk9_0,X1)
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[2917,2904,theory(equality)]) ).
cnf(3120,negated_conjecture,
( ~ neq(X1,nil)
| ~ frontsegP(esk8_0,X1)
| ~ ssList(X1)
| ~ frontsegP(esk9_0,X1)
| $false ),
inference(rw,[status(thm)],[3110,193,theory(equality)]) ).
cnf(3121,negated_conjecture,
( ~ neq(X1,nil)
| ~ frontsegP(esk8_0,X1)
| ~ ssList(X1)
| ~ frontsegP(esk9_0,X1) ),
inference(cn,[status(thm)],[3120,theory(equality)]) ).
cnf(3292,negated_conjecture,
( ~ frontsegP(esk8_0,esk12_0)
| ~ frontsegP(esk9_0,esk12_0)
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[3121,232,theory(equality)]) ).
cnf(3297,negated_conjecture,
( $false
| ~ frontsegP(esk9_0,esk12_0)
| ~ ssList(esk12_0) ),
inference(rw,[status(thm)],[3292,224,theory(equality)]) ).
cnf(3298,negated_conjecture,
( $false
| $false
| ~ ssList(esk12_0) ),
inference(rw,[status(thm)],[3297,227,theory(equality)]) ).
cnf(3299,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[3298,216,theory(equality)]) ).
cnf(3300,negated_conjecture,
$false,
inference(cn,[status(thm)],[3299,theory(equality)]) ).
cnf(3301,negated_conjecture,
$false,
3300,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC080+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp-PcDf_/sel_SWC080+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC080+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC080+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC080+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
%
%------------------------------------------------------------------------------