TSTP Solution File: SWC364+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC364+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 11:43:16 EST 2010
% Result : Theorem 0.29s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 5
% Syntax : Number of formulae : 55 ( 12 unt; 0 def)
% Number of atoms : 263 ( 45 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 327 ( 119 ~; 124 |; 63 &)
% ( 1 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 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 : 81 ( 0 sgn 48 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/tmp/tmpraovth/sel_SWC364+1.p_1',ax84) ).
fof(13,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/tmp/tmpraovth/sel_SWC364+1.p_1',ax7) ).
fof(19,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/tmp/tmpraovth/sel_SWC364+1.p_1',ax16) ).
fof(20,axiom,
ssList(nil),
file('/tmp/tmpraovth/sel_SWC364+1.p_1',ax17) ).
fof(26,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> app(cons(X5,nil),X3) != X4 )
| segmentP(X2,X1) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/tmp/tmpraovth/sel_SWC364+1.p_1',co1) ).
fof(27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> app(cons(X5,nil),X3) != X4 )
| segmentP(X2,X1) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[26]) ).
fof(28,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> app(cons(X5,nil),X3) != X4 )
| segmentP(X2,X1) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
fof(29,plain,
! [X1] :
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(30,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[29]) ).
cnf(31,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[30]) ).
fof(84,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)],[13]) ).
fof(85,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)],[84]) ).
fof(86,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)],[85]) ).
fof(87,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)],[86]) ).
fof(88,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)],[87]) ).
cnf(92,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[88]) ).
fof(118,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| ssList(cons(X2,X1)) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(119,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3)) ) ),
inference(variable_rename,[status(thm)],[118]) ).
fof(120,plain,
! [X3,X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[119]) ).
cnf(121,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[120]) ).
cnf(122,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[20]) ).
fof(141,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ( ( neq(X2,nil)
& ? [X5] :
( ssItem(X5)
& app(cons(X5,nil),X3) = X4 )
& ~ segmentP(X2,X1) )
| ( neq(X2,nil)
& ~ neq(X4,nil) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(142,negated_conjecture,
? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& X7 = X9
& X6 = X8
& ( ( neq(X7,nil)
& ? [X10] :
( ssItem(X10)
& app(cons(X10,nil),X8) = X9 )
& ~ segmentP(X7,X6) )
| ( neq(X7,nil)
& ~ neq(X9,nil) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[141]) ).
fof(143,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( ( neq(esk8_0,nil)
& ssItem(esk11_0)
& app(cons(esk11_0,nil),esk9_0) = esk10_0
& ~ segmentP(esk8_0,esk7_0) )
| ( neq(esk8_0,nil)
& ~ neq(esk10_0,nil) ) ) ),
inference(skolemize,[status(esa)],[142]) ).
fof(144,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( neq(esk8_0,nil)
| neq(esk8_0,nil) )
& ( ~ neq(esk10_0,nil)
| neq(esk8_0,nil) )
& ( neq(esk8_0,nil)
| ssItem(esk11_0) )
& ( ~ neq(esk10_0,nil)
| ssItem(esk11_0) )
& ( neq(esk8_0,nil)
| app(cons(esk11_0,nil),esk9_0) = esk10_0 )
& ( ~ neq(esk10_0,nil)
| app(cons(esk11_0,nil),esk9_0) = esk10_0 )
& ( neq(esk8_0,nil)
| ~ segmentP(esk8_0,esk7_0) )
& ( ~ neq(esk10_0,nil)
| ~ segmentP(esk8_0,esk7_0) ) ),
inference(distribute,[status(thm)],[143]) ).
cnf(145,negated_conjecture,
( ~ segmentP(esk8_0,esk7_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(147,negated_conjecture,
( app(cons(esk11_0,nil),esk9_0) = esk10_0
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(149,negated_conjecture,
( ssItem(esk11_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(152,negated_conjecture,
( neq(esk8_0,nil)
| neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(153,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(154,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(157,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(158,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(164,negated_conjecture,
( ssItem(esk11_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[149,154,theory(equality)]),152,theory(equality)]) ).
cnf(165,negated_conjecture,
ssItem(esk11_0),
inference(cn,[status(thm)],[164,theory(equality)]) ).
cnf(170,negated_conjecture,
( $false
| ~ segmentP(esk8_0,esk7_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[145,154,theory(equality)]),152,theory(equality)]) ).
cnf(171,negated_conjecture,
~ segmentP(esk8_0,esk7_0),
inference(cn,[status(thm)],[170,theory(equality)]) ).
cnf(178,negated_conjecture,
( app(cons(esk11_0,nil),esk7_0) = esk10_0
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[147,153,theory(equality)]) ).
cnf(179,negated_conjecture,
( app(cons(esk11_0,nil),esk7_0) = esk8_0
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[178,154,theory(equality)]) ).
cnf(180,negated_conjecture,
( app(cons(esk11_0,nil),esk7_0) = esk8_0
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[179,154,theory(equality)]),152,theory(equality)]) ).
cnf(181,negated_conjecture,
app(cons(esk11_0,nil),esk7_0) = esk8_0,
inference(cn,[status(thm)],[180,theory(equality)]) ).
cnf(282,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(app(app(X1,X2),X3)) ),
inference(er,[status(thm)],[92,theory(equality)]) ).
cnf(1899,negated_conjecture,
( segmentP(app(esk8_0,X1),esk7_0)
| ~ ssList(app(esk8_0,X1))
| ~ ssList(X1)
| ~ ssList(cons(esk11_0,nil))
| ~ ssList(esk7_0) ),
inference(spm,[status(thm)],[282,181,theory(equality)]) ).
cnf(1913,negated_conjecture,
( segmentP(app(esk8_0,X1),esk7_0)
| ~ ssList(app(esk8_0,X1))
| ~ ssList(X1)
| ~ ssList(cons(esk11_0,nil))
| $false ),
inference(rw,[status(thm)],[1899,158,theory(equality)]) ).
cnf(1914,negated_conjecture,
( segmentP(app(esk8_0,X1),esk7_0)
| ~ ssList(app(esk8_0,X1))
| ~ ssList(X1)
| ~ ssList(cons(esk11_0,nil)) ),
inference(cn,[status(thm)],[1913,theory(equality)]) ).
cnf(1939,negated_conjecture,
( segmentP(app(esk8_0,X1),esk7_0)
| ~ ssList(app(esk8_0,X1))
| ~ ssList(X1)
| ~ ssItem(esk11_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[1914,121,theory(equality)]) ).
cnf(1940,negated_conjecture,
( segmentP(app(esk8_0,X1),esk7_0)
| ~ ssList(app(esk8_0,X1))
| ~ ssList(X1)
| $false
| ~ ssList(nil) ),
inference(rw,[status(thm)],[1939,165,theory(equality)]) ).
cnf(1941,negated_conjecture,
( segmentP(app(esk8_0,X1),esk7_0)
| ~ ssList(app(esk8_0,X1))
| ~ ssList(X1)
| $false
| $false ),
inference(rw,[status(thm)],[1940,122,theory(equality)]) ).
cnf(1942,negated_conjecture,
( segmentP(app(esk8_0,X1),esk7_0)
| ~ ssList(app(esk8_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[1941,theory(equality)]) ).
cnf(1943,negated_conjecture,
( segmentP(esk8_0,esk7_0)
| ~ ssList(esk8_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[1942,31,theory(equality)]) ).
cnf(1945,negated_conjecture,
( segmentP(esk8_0,esk7_0)
| $false
| ~ ssList(nil) ),
inference(rw,[status(thm)],[1943,157,theory(equality)]) ).
cnf(1946,negated_conjecture,
( segmentP(esk8_0,esk7_0)
| $false
| $false ),
inference(rw,[status(thm)],[1945,122,theory(equality)]) ).
cnf(1947,negated_conjecture,
segmentP(esk8_0,esk7_0),
inference(cn,[status(thm)],[1946,theory(equality)]) ).
cnf(1948,negated_conjecture,
$false,
inference(sr,[status(thm)],[1947,171,theory(equality)]) ).
cnf(1949,negated_conjecture,
$false,
1948,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC364+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpraovth/sel_SWC364+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC364+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC364+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC364+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
%
%------------------------------------------------------------------------------