TSTP Solution File: SWC101+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC101+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:17:18 EST 2010
% Result : Theorem 0.28s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 4
% Syntax : Number of formulae : 53 ( 15 unt; 0 def)
% Number of atoms : 294 ( 104 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 391 ( 150 ~; 136 |; 84 &)
% ( 2 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn 54 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(17,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/tmp/tmpZYaDfJ/sel_SWC101+1.p_1',ax5) ).
fof(24,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpZYaDfJ/sel_SWC101+1.p_1',ax15) ).
fof(26,axiom,
ssList(nil),
file('/tmp/tmpZYaDfJ/sel_SWC101+1.p_1',ax17) ).
fof(30,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( nil = X2
& nil = X1 )
| ( neq(X1,nil)
& frontsegP(X2,X1) ) ) ) ) ) ),
file('/tmp/tmpZYaDfJ/sel_SWC101+1.p_1',co1) ).
fof(31,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( nil = X2
& nil = X1 )
| ( neq(X1,nil)
& frontsegP(X2,X1) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[30]) ).
fof(32,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( nil = X2
& nil = X1 )
| ( neq(X1,nil)
& frontsegP(X2,X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[31,theory(equality)]) ).
fof(102,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)],[17]) ).
fof(103,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)],[102]) ).
fof(104,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ( ( ~ frontsegP(X4,X5)
| ( ssList(esk3_2(X4,X5))
& app(X5,esk3_2(X4,X5)) = X4 ) )
& ( ! [X7] :
( ~ ssList(X7)
| app(X5,X7) != X4 )
| frontsegP(X4,X5) ) ) ) ),
inference(skolemize,[status(esa)],[103]) ).
fof(105,plain,
! [X4,X5,X7] :
( ( ( ~ ssList(X7)
| app(X5,X7) != X4
| frontsegP(X4,X5) )
& ( ~ frontsegP(X4,X5)
| ( ssList(esk3_2(X4,X5))
& app(X5,esk3_2(X4,X5)) = X4 ) ) )
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(shift_quantors,[status(thm)],[104]) ).
fof(106,plain,
! [X4,X5,X7] :
( ( ~ ssList(X7)
| app(X5,X7) != X4
| frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( ssList(esk3_2(X4,X5))
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( app(X5,esk3_2(X4,X5)) = X4
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) ) ),
inference(distribute,[status(thm)],[105]) ).
cnf(109,plain,
( frontsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X2,X3) != X1
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[106]) ).
fof(140,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(141,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[140]) ).
fof(142,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[141]) ).
fof(143,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[142]) ).
cnf(144,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(150,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[26]) ).
fof(167,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ? [X5] :
( ssList(X5)
& app(X3,X5) = X4
& equalelemsP(X3)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X6,nil)) != X3 ) ) ) )
& ( nil = X4
| nil != X3 )
& ( nil != X2
| nil != X1 )
& ( ~ neq(X1,nil)
| ~ frontsegP(X2,X1) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(168,negated_conjecture,
? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& X10 = X12
& X9 = X11
& ? [X13] :
( ssList(X13)
& app(X11,X13) = X12
& equalelemsP(X11)
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ~ ssList(X15)
| app(cons(X14,nil),X15) != X13
| ! [X16] :
( ~ ssList(X16)
| app(X16,cons(X14,nil)) != X11 ) ) ) )
& ( nil = X12
| nil != X11 )
& ( nil != X10
| nil != X9 )
& ( ~ neq(X9,nil)
| ~ frontsegP(X10,X9) ) ) ) ) ),
inference(variable_rename,[status(thm)],[167]) ).
fof(169,negated_conjecture,
( ssList(esk10_0)
& ssList(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& esk11_0 = esk13_0
& esk10_0 = esk12_0
& ssList(esk14_0)
& app(esk12_0,esk14_0) = esk13_0
& equalelemsP(esk12_0)
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ~ ssList(X15)
| app(cons(X14,nil),X15) != esk14_0
| ! [X16] :
( ~ ssList(X16)
| app(X16,cons(X14,nil)) != esk12_0 ) ) )
& ( nil = esk13_0
| nil != esk12_0 )
& ( nil != esk11_0
| nil != esk10_0 )
& ( ~ neq(esk10_0,nil)
| ~ frontsegP(esk11_0,esk10_0) ) ),
inference(skolemize,[status(esa)],[168]) ).
fof(170,negated_conjecture,
! [X14,X15,X16] :
( ( ~ ssList(X16)
| app(X16,cons(X14,nil)) != esk12_0
| ~ ssList(X15)
| app(cons(X14,nil),X15) != esk14_0
| ~ ssItem(X14) )
& app(esk12_0,esk14_0) = esk13_0
& equalelemsP(esk12_0)
& ssList(esk14_0)
& esk11_0 = esk13_0
& esk10_0 = esk12_0
& ( nil = esk13_0
| nil != esk12_0 )
& ( nil != esk11_0
| nil != esk10_0 )
& ( ~ neq(esk10_0,nil)
| ~ frontsegP(esk11_0,esk10_0) )
& ssList(esk13_0)
& ssList(esk12_0)
& ssList(esk11_0)
& ssList(esk10_0) ),
inference(shift_quantors,[status(thm)],[169]) ).
cnf(171,negated_conjecture,
ssList(esk10_0),
inference(split_conjunct,[status(thm)],[170]) ).
cnf(172,negated_conjecture,
ssList(esk11_0),
inference(split_conjunct,[status(thm)],[170]) ).
cnf(175,negated_conjecture,
( ~ frontsegP(esk11_0,esk10_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[170]) ).
cnf(176,negated_conjecture,
( nil != esk10_0
| nil != esk11_0 ),
inference(split_conjunct,[status(thm)],[170]) ).
cnf(177,negated_conjecture,
( nil = esk13_0
| nil != esk12_0 ),
inference(split_conjunct,[status(thm)],[170]) ).
cnf(178,negated_conjecture,
esk10_0 = esk12_0,
inference(split_conjunct,[status(thm)],[170]) ).
cnf(179,negated_conjecture,
esk11_0 = esk13_0,
inference(split_conjunct,[status(thm)],[170]) ).
cnf(180,negated_conjecture,
ssList(esk14_0),
inference(split_conjunct,[status(thm)],[170]) ).
cnf(182,negated_conjecture,
app(esk12_0,esk14_0) = esk13_0,
inference(split_conjunct,[status(thm)],[170]) ).
cnf(184,negated_conjecture,
ssList(esk12_0),
inference(rw,[status(thm)],[171,178,theory(equality)]) ).
cnf(185,negated_conjecture,
ssList(esk13_0),
inference(rw,[status(thm)],[172,179,theory(equality)]) ).
cnf(186,negated_conjecture,
( esk12_0 != nil
| esk11_0 != nil ),
inference(rw,[status(thm)],[176,178,theory(equality)]) ).
cnf(187,negated_conjecture,
( esk12_0 != nil
| esk13_0 != nil ),
inference(rw,[status(thm)],[186,179,theory(equality)]) ).
cnf(188,negated_conjecture,
esk12_0 != nil,
inference(csr,[status(thm)],[187,177]) ).
cnf(189,negated_conjecture,
( ~ frontsegP(esk13_0,esk12_0)
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[175,179,theory(equality)]),178,theory(equality)]) ).
cnf(190,negated_conjecture,
( ~ frontsegP(esk13_0,esk12_0)
| ~ neq(esk12_0,nil) ),
inference(rw,[status(thm)],[189,178,theory(equality)]) ).
cnf(201,negated_conjecture,
( esk12_0 = nil
| ~ frontsegP(esk13_0,esk12_0)
| ~ ssList(nil)
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[190,144,theory(equality)]) ).
cnf(202,negated_conjecture,
( esk12_0 = nil
| ~ frontsegP(esk13_0,esk12_0)
| $false
| ~ ssList(esk12_0) ),
inference(rw,[status(thm)],[201,150,theory(equality)]) ).
cnf(203,negated_conjecture,
( esk12_0 = nil
| ~ frontsegP(esk13_0,esk12_0)
| ~ ssList(esk12_0) ),
inference(cn,[status(thm)],[202,theory(equality)]) ).
cnf(204,negated_conjecture,
( ~ frontsegP(esk13_0,esk12_0)
| ~ ssList(esk12_0) ),
inference(sr,[status(thm)],[203,188,theory(equality)]) ).
cnf(235,negated_conjecture,
( frontsegP(X1,esk12_0)
| esk13_0 != X1
| ~ ssList(esk14_0)
| ~ ssList(esk12_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[109,182,theory(equality)]) ).
cnf(371,negated_conjecture,
( ~ frontsegP(esk13_0,esk12_0)
| $false ),
inference(rw,[status(thm)],[204,184,theory(equality)]) ).
cnf(372,negated_conjecture,
~ frontsegP(esk13_0,esk12_0),
inference(cn,[status(thm)],[371,theory(equality)]) ).
cnf(555,negated_conjecture,
( frontsegP(X1,esk12_0)
| esk13_0 != X1
| ~ ssList(esk14_0)
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[235,184,theory(equality)]) ).
cnf(556,negated_conjecture,
( frontsegP(X1,esk12_0)
| esk13_0 != X1
| ~ ssList(esk14_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[555,theory(equality)]) ).
cnf(557,negated_conjecture,
( frontsegP(X1,esk12_0)
| esk13_0 != X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[556,180,theory(equality)]) ).
cnf(584,negated_conjecture,
( frontsegP(esk13_0,esk12_0)
| ~ ssList(esk13_0) ),
inference(er,[status(thm)],[557,theory(equality)]) ).
cnf(585,negated_conjecture,
( frontsegP(esk13_0,esk12_0)
| $false ),
inference(rw,[status(thm)],[584,185,theory(equality)]) ).
cnf(586,negated_conjecture,
frontsegP(esk13_0,esk12_0),
inference(cn,[status(thm)],[585,theory(equality)]) ).
cnf(587,negated_conjecture,
$false,
inference(sr,[status(thm)],[586,372,theory(equality)]) ).
cnf(588,negated_conjecture,
$false,
587,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC101+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpZYaDfJ/sel_SWC101+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC101+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC101+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC101+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
%
%------------------------------------------------------------------------------