TSTP Solution File: SWC011+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC011+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:05:06 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 1
% Syntax : Number of formulae : 39 ( 11 unt; 0 def)
% Number of atoms : 243 ( 72 equ)
% Maximal formula atoms : 42 ( 6 avg)
% Number of connectives : 300 ( 96 ~; 97 |; 86 &)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 36 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(19,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X2
& app(X6,X7) = X1 ) ) )
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(X9,cons(X8,nil)),X10) != X4
| app(X9,X10) != X3 ) ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/tmp/tmpVA9Txo/sel_SWC011+1.p_1',co1) ).
fof(20,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X2
& app(X6,X7) = X1 ) ) )
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(X9,cons(X8,nil)),X10) != X4
| app(X9,X10) != X3 ) ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[19]) ).
fof(21,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X2
& app(X6,X7) = X1 ) ) )
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(X9,cons(X8,nil)),X10) != X4
| app(X9,X10) != X3 ) ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[20,theory(equality)]) ).
fof(102,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ( ( neq(X2,nil)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X2
| app(X6,X7) != X1 ) ) )
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& app(app(X9,cons(X8,nil)),X10) = X4
& app(X9,X10) = X3 ) ) ) )
| ( neq(X2,nil)
& ~ neq(X4,nil) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(103,negated_conjecture,
? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& ? [X13] :
( ssList(X13)
& ? [X14] :
( ssList(X14)
& X12 = X14
& X11 = X13
& ( ( neq(X12,nil)
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| ! [X17] :
( ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != X12
| app(X16,X17) != X11 ) ) )
& ? [X18] :
( ssItem(X18)
& ? [X19] :
( ssList(X19)
& ? [X20] :
( ssList(X20)
& app(app(X19,cons(X18,nil)),X20) = X14
& app(X19,X20) = X13 ) ) ) )
| ( neq(X12,nil)
& ~ neq(X14,nil) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[102]) ).
fof(104,negated_conjecture,
( ssList(esk5_0)
& ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& ( ( neq(esk6_0,nil)
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| ! [X17] :
( ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk6_0
| app(X16,X17) != esk5_0 ) ) )
& ssItem(esk9_0)
& ssList(esk10_0)
& ssList(esk11_0)
& app(app(esk10_0,cons(esk9_0,nil)),esk11_0) = esk8_0
& app(esk10_0,esk11_0) = esk7_0 )
| ( neq(esk6_0,nil)
& ~ neq(esk8_0,nil) ) ) ),
inference(skolemize,[status(esa)],[103]) ).
fof(105,negated_conjecture,
! [X15,X16,X17] :
( ( ( ( ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk6_0
| app(X16,X17) != esk5_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& neq(esk6_0,nil)
& ssItem(esk9_0)
& ssList(esk10_0)
& ssList(esk11_0)
& app(app(esk10_0,cons(esk9_0,nil)),esk11_0) = esk8_0
& app(esk10_0,esk11_0) = esk7_0 )
| ( neq(esk6_0,nil)
& ~ neq(esk8_0,nil) ) )
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& ssList(esk8_0)
& ssList(esk7_0)
& ssList(esk6_0)
& ssList(esk5_0) ),
inference(shift_quantors,[status(thm)],[104]) ).
fof(106,negated_conjecture,
! [X15,X16,X17] :
( ( neq(esk6_0,nil)
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk6_0
| app(X16,X17) != esk5_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( ~ neq(esk8_0,nil)
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk6_0
| app(X16,X17) != esk5_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( neq(esk6_0,nil)
| neq(esk6_0,nil) )
& ( ~ neq(esk8_0,nil)
| neq(esk6_0,nil) )
& ( neq(esk6_0,nil)
| ssItem(esk9_0) )
& ( ~ neq(esk8_0,nil)
| ssItem(esk9_0) )
& ( neq(esk6_0,nil)
| ssList(esk10_0) )
& ( ~ neq(esk8_0,nil)
| ssList(esk10_0) )
& ( neq(esk6_0,nil)
| ssList(esk11_0) )
& ( ~ neq(esk8_0,nil)
| ssList(esk11_0) )
& ( neq(esk6_0,nil)
| app(app(esk10_0,cons(esk9_0,nil)),esk11_0) = esk8_0 )
& ( ~ neq(esk8_0,nil)
| app(app(esk10_0,cons(esk9_0,nil)),esk11_0) = esk8_0 )
& ( neq(esk6_0,nil)
| app(esk10_0,esk11_0) = esk7_0 )
& ( ~ neq(esk8_0,nil)
| app(esk10_0,esk11_0) = esk7_0 )
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& ssList(esk8_0)
& ssList(esk7_0)
& ssList(esk6_0)
& ssList(esk5_0) ),
inference(distribute,[status(thm)],[105]) ).
cnf(111,negated_conjecture,
esk5_0 = esk7_0,
inference(split_conjunct,[status(thm)],[106]) ).
cnf(112,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[106]) ).
cnf(113,negated_conjecture,
( app(esk10_0,esk11_0) = esk7_0
| ~ neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(115,negated_conjecture,
( app(app(esk10_0,cons(esk9_0,nil)),esk11_0) = esk8_0
| ~ neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(117,negated_conjecture,
( ssList(esk11_0)
| ~ neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(119,negated_conjecture,
( ssList(esk10_0)
| ~ neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(121,negated_conjecture,
( ssItem(esk9_0)
| ~ neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(124,negated_conjecture,
( neq(esk6_0,nil)
| neq(esk6_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(125,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(X2,X3) != esk5_0
| app(app(X2,cons(X1,nil)),X3) != esk6_0
| ~ ssList(X3)
| ~ neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(134,negated_conjecture,
( ssItem(esk9_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[121,112,theory(equality)]),124,theory(equality)]) ).
cnf(135,negated_conjecture,
ssItem(esk9_0),
inference(cn,[status(thm)],[134,theory(equality)]) ).
cnf(136,negated_conjecture,
( ssList(esk10_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[119,112,theory(equality)]),124,theory(equality)]) ).
cnf(137,negated_conjecture,
ssList(esk10_0),
inference(cn,[status(thm)],[136,theory(equality)]) ).
cnf(138,negated_conjecture,
( ssList(esk11_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[117,112,theory(equality)]),124,theory(equality)]) ).
cnf(139,negated_conjecture,
ssList(esk11_0),
inference(cn,[status(thm)],[138,theory(equality)]) ).
cnf(151,negated_conjecture,
( app(esk10_0,esk11_0) = esk5_0
| ~ neq(esk8_0,nil) ),
inference(rw,[status(thm)],[113,111,theory(equality)]) ).
cnf(152,negated_conjecture,
( app(esk10_0,esk11_0) = esk5_0
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[151,112,theory(equality)]),124,theory(equality)]) ).
cnf(153,negated_conjecture,
app(esk10_0,esk11_0) = esk5_0,
inference(cn,[status(thm)],[152,theory(equality)]) ).
cnf(162,negated_conjecture,
( app(app(esk10_0,cons(esk9_0,nil)),esk11_0) = esk6_0
| ~ neq(esk8_0,nil) ),
inference(rw,[status(thm)],[115,112,theory(equality)]) ).
cnf(163,negated_conjecture,
( app(app(esk10_0,cons(esk9_0,nil)),esk11_0) = esk6_0
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[162,112,theory(equality)]),124,theory(equality)]) ).
cnf(164,negated_conjecture,
app(app(esk10_0,cons(esk9_0,nil)),esk11_0) = esk6_0,
inference(cn,[status(thm)],[163,theory(equality)]) ).
cnf(316,negated_conjecture,
( app(X2,X3) != esk5_0
| app(app(X2,cons(X1,nil)),X3) != esk6_0
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[125,112,theory(equality)]),124,theory(equality)]) ).
cnf(317,negated_conjecture,
( app(X2,X3) != esk5_0
| app(app(X2,cons(X1,nil)),X3) != esk6_0
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[316,theory(equality)]) ).
cnf(318,negated_conjecture,
( app(app(esk10_0,cons(X1,nil)),esk11_0) != esk6_0
| ~ ssList(esk11_0)
| ~ ssList(esk10_0)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[317,153,theory(equality)]) ).
cnf(324,negated_conjecture,
( app(app(esk10_0,cons(X1,nil)),esk11_0) != esk6_0
| $false
| ~ ssList(esk10_0)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[318,139,theory(equality)]) ).
cnf(325,negated_conjecture,
( app(app(esk10_0,cons(X1,nil)),esk11_0) != esk6_0
| $false
| $false
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[324,137,theory(equality)]) ).
cnf(326,negated_conjecture,
( app(app(esk10_0,cons(X1,nil)),esk11_0) != esk6_0
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[325,theory(equality)]) ).
cnf(340,negated_conjecture,
~ ssItem(esk9_0),
inference(spm,[status(thm)],[326,164,theory(equality)]) ).
cnf(342,negated_conjecture,
$false,
inference(rw,[status(thm)],[340,135,theory(equality)]) ).
cnf(343,negated_conjecture,
$false,
inference(cn,[status(thm)],[342,theory(equality)]) ).
cnf(344,negated_conjecture,
$false,
343,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC011+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpVA9Txo/sel_SWC011+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC011+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC011+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC011+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
%
%------------------------------------------------------------------------------