TSTP Solution File: SWC012+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC012+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:18 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 3
% Syntax : Number of formulae : 43 ( 13 unt; 0 def)
% Number of atoms : 220 ( 72 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 280 ( 103 ~; 93 |; 68 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 33 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/tmp/tmpS6pIn6/sel_SWC012+1.p_1',ax84) ).
fof(12,axiom,
ssList(nil),
file('/tmp/tmpS6pIn6/sel_SWC012+1.p_1',ax17) ).
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)
=> app(X3,cons(X8,nil)) != X4 ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/tmp/tmpS6pIn6/sel_SWC012+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)
=> app(X3,cons(X8,nil)) != X4 ) )
& ( ~ 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)
=> app(X3,cons(X8,nil)) != X4 ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[20,theory(equality)]) ).
fof(39,plain,
! [X1] :
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(40,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[39]) ).
cnf(41,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(74,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[12]) ).
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)
& app(X3,cons(X8,nil)) = X4 ) )
| ( neq(X2,nil)
& ~ neq(X4,nil) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(103,negated_conjecture,
? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& X10 = X12
& X9 = X11
& ( ( neq(X10,nil)
& ! [X13] :
( ~ ssItem(X13)
| ! [X14] :
( ~ ssList(X14)
| ! [X15] :
( ~ ssList(X15)
| app(app(X14,cons(X13,nil)),X15) != X10
| app(X14,X15) != X9 ) ) )
& ? [X16] :
( ssItem(X16)
& app(X11,cons(X16,nil)) = X12 ) )
| ( neq(X10,nil)
& ~ neq(X12,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)
& ! [X13] :
( ~ ssItem(X13)
| ! [X14] :
( ~ ssList(X14)
| ! [X15] :
( ~ ssList(X15)
| app(app(X14,cons(X13,nil)),X15) != esk6_0
| app(X14,X15) != esk5_0 ) ) )
& ssItem(esk9_0)
& app(esk7_0,cons(esk9_0,nil)) = esk8_0 )
| ( neq(esk6_0,nil)
& ~ neq(esk8_0,nil) ) ) ),
inference(skolemize,[status(esa)],[103]) ).
fof(105,negated_conjecture,
! [X13,X14,X15] :
( ( ( ( ~ ssList(X15)
| app(app(X14,cons(X13,nil)),X15) != esk6_0
| app(X14,X15) != esk5_0
| ~ ssList(X14)
| ~ ssItem(X13) )
& neq(esk6_0,nil)
& ssItem(esk9_0)
& app(esk7_0,cons(esk9_0,nil)) = esk8_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,
! [X13,X14,X15] :
( ( neq(esk6_0,nil)
| ~ ssList(X15)
| app(app(X14,cons(X13,nil)),X15) != esk6_0
| app(X14,X15) != esk5_0
| ~ ssList(X14)
| ~ ssItem(X13) )
& ( ~ neq(esk8_0,nil)
| ~ ssList(X15)
| app(app(X14,cons(X13,nil)),X15) != esk6_0
| app(X14,X15) != esk5_0
| ~ ssList(X14)
| ~ ssItem(X13) )
& ( 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)
| app(esk7_0,cons(esk9_0,nil)) = esk8_0 )
& ( ~ neq(esk8_0,nil)
| app(esk7_0,cons(esk9_0,nil)) = esk8_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(107,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(108,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[106]) ).
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(esk7_0,cons(esk9_0,nil)) = esk8_0
| ~ neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(115,negated_conjecture,
( ssItem(esk9_0)
| ~ neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(118,negated_conjecture,
( neq(esk6_0,nil)
| neq(esk6_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(119,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(126,negated_conjecture,
( ssItem(esk9_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[115,112,theory(equality)]),118,theory(equality)]) ).
cnf(127,negated_conjecture,
ssItem(esk9_0),
inference(cn,[status(thm)],[126,theory(equality)]) ).
cnf(140,negated_conjecture,
( app(esk5_0,cons(esk9_0,nil)) = esk8_0
| ~ neq(esk8_0,nil) ),
inference(rw,[status(thm)],[113,111,theory(equality)]) ).
cnf(141,negated_conjecture,
( app(esk5_0,cons(esk9_0,nil)) = esk6_0
| ~ neq(esk8_0,nil) ),
inference(rw,[status(thm)],[140,112,theory(equality)]) ).
cnf(142,negated_conjecture,
( app(esk5_0,cons(esk9_0,nil)) = esk6_0
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[141,112,theory(equality)]),118,theory(equality)]) ).
cnf(143,negated_conjecture,
app(esk5_0,cons(esk9_0,nil)) = esk6_0,
inference(cn,[status(thm)],[142,theory(equality)]) ).
cnf(260,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)],[119,112,theory(equality)]),118,theory(equality)]) ).
cnf(261,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)],[260,theory(equality)]) ).
cnf(263,negated_conjecture,
( app(app(X1,cons(X2,nil)),nil) != esk6_0
| X1 != esk5_0
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[261,41,theory(equality)]) ).
cnf(269,negated_conjecture,
( app(app(X1,cons(X2,nil)),nil) != esk6_0
| X1 != esk5_0
| $false
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[263,74,theory(equality)]) ).
cnf(270,negated_conjecture,
( app(app(X1,cons(X2,nil)),nil) != esk6_0
| X1 != esk5_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[269,theory(equality)]) ).
cnf(326,negated_conjecture,
( app(app(esk5_0,cons(X1,nil)),nil) != esk6_0
| ~ ssList(esk5_0)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[270,theory(equality)]) ).
cnf(327,negated_conjecture,
( app(app(esk5_0,cons(X1,nil)),nil) != esk6_0
| $false
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[326,107,theory(equality)]) ).
cnf(328,negated_conjecture,
( app(app(esk5_0,cons(X1,nil)),nil) != esk6_0
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[327,theory(equality)]) ).
cnf(329,negated_conjecture,
( app(esk6_0,nil) != esk6_0
| ~ ssItem(esk9_0) ),
inference(spm,[status(thm)],[328,143,theory(equality)]) ).
cnf(332,negated_conjecture,
( app(esk6_0,nil) != esk6_0
| $false ),
inference(rw,[status(thm)],[329,127,theory(equality)]) ).
cnf(333,negated_conjecture,
app(esk6_0,nil) != esk6_0,
inference(cn,[status(thm)],[332,theory(equality)]) ).
cnf(376,negated_conjecture,
~ ssList(esk6_0),
inference(spm,[status(thm)],[333,41,theory(equality)]) ).
cnf(377,negated_conjecture,
$false,
inference(rw,[status(thm)],[376,108,theory(equality)]) ).
cnf(378,negated_conjecture,
$false,
inference(cn,[status(thm)],[377,theory(equality)]) ).
cnf(379,negated_conjecture,
$false,
378,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC012+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpS6pIn6/sel_SWC012+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC012+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC012+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC012+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
%
%------------------------------------------------------------------------------