TSTP Solution File: SWC096+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC096+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:16:50 EST 2010
% Result : Theorem 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 1
% Syntax : Number of formulae : 36 ( 10 unt; 0 def)
% Number of atoms : 211 ( 72 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 263 ( 88 ~; 86 |; 77 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 28 !; 18 ?)
% 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)
& cons(X5,nil) = X1
& app(X6,cons(X5,nil)) = X2 ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ~ ssList(X8)
| cons(X7,nil) != X3
| app(X8,cons(X7,nil)) != X4 ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ),
file('/tmp/tmpZyz2jw/sel_SWC096+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)
& cons(X5,nil) = X1
& app(X6,cons(X5,nil)) = X2 ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ~ ssList(X8)
| cons(X7,nil) != X3
| app(X8,cons(X7,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)
& cons(X5,nil) = X1
& app(X6,cons(X5,nil)) = X2 ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ~ ssList(X8)
| cons(X7,nil) != X3
| app(X8,cons(X7,nil)) != X4 ) ) )
& ( ~ 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)
| cons(X5,nil) != X1
| app(X6,cons(X5,nil)) != X2 ) )
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& cons(X7,nil) = X3
& app(X8,cons(X7,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)
| cons(X13,nil) != X9
| app(X14,cons(X13,nil)) != X10 ) )
& ? [X15] :
( ssItem(X15)
& ? [X16] :
( ssList(X16)
& cons(X15,nil) = X11
& app(X16,cons(X15,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)
| cons(X13,nil) != esk5_0
| app(X14,cons(X13,nil)) != esk6_0 ) )
& ssItem(esk9_0)
& ssList(esk10_0)
& cons(esk9_0,nil) = esk7_0
& app(esk10_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] :
( ( ( ( ~ ssList(X14)
| cons(X13,nil) != esk5_0
| app(X14,cons(X13,nil)) != esk6_0
| ~ ssItem(X13) )
& neq(esk6_0,nil)
& ssItem(esk9_0)
& ssList(esk10_0)
& cons(esk9_0,nil) = esk7_0
& app(esk10_0,cons(esk9_0,nil)) = esk8_0 )
| ( neq(esk6_0,nil)
& ~ neq(esk8_0,nil) ) )
& ssList(esk8_0)
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& ssList(esk7_0)
& ssList(esk6_0)
& ssList(esk5_0) ),
inference(shift_quantors,[status(thm)],[104]) ).
fof(106,negated_conjecture,
! [X13,X14] :
( ( neq(esk6_0,nil)
| ~ ssList(X14)
| cons(X13,nil) != esk5_0
| app(X14,cons(X13,nil)) != esk6_0
| ~ ssItem(X13) )
& ( ~ neq(esk8_0,nil)
| ~ ssList(X14)
| cons(X13,nil) != esk5_0
| app(X14,cons(X13,nil)) != esk6_0
| ~ 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)
| ssList(esk10_0) )
& ( ~ neq(esk8_0,nil)
| ssList(esk10_0) )
& ( neq(esk6_0,nil)
| cons(esk9_0,nil) = esk7_0 )
& ( ~ neq(esk8_0,nil)
| cons(esk9_0,nil) = esk7_0 )
& ( neq(esk6_0,nil)
| app(esk10_0,cons(esk9_0,nil)) = esk8_0 )
& ( ~ neq(esk8_0,nil)
| app(esk10_0,cons(esk9_0,nil)) = esk8_0 )
& ssList(esk8_0)
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& ssList(esk7_0)
& ssList(esk6_0)
& ssList(esk5_0) ),
inference(distribute,[status(thm)],[105]) ).
cnf(110,negated_conjecture,
esk5_0 = esk7_0,
inference(split_conjunct,[status(thm)],[106]) ).
cnf(111,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[106]) ).
cnf(113,negated_conjecture,
( app(esk10_0,cons(esk9_0,nil)) = esk8_0
| ~ neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(115,negated_conjecture,
( cons(esk9_0,nil) = esk7_0
| ~ neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(117,negated_conjecture,
( ssList(esk10_0)
| ~ neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(119,negated_conjecture,
( ssItem(esk9_0)
| ~ neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(122,negated_conjecture,
( neq(esk6_0,nil)
| neq(esk6_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(123,negated_conjecture,
( ~ ssItem(X1)
| app(X2,cons(X1,nil)) != esk6_0
| cons(X1,nil) != esk5_0
| ~ ssList(X2)
| ~ neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(131,negated_conjecture,
( ssItem(esk9_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[119,111,theory(equality)]),122,theory(equality)]) ).
cnf(132,negated_conjecture,
ssItem(esk9_0),
inference(cn,[status(thm)],[131,theory(equality)]) ).
cnf(133,negated_conjecture,
( ssList(esk10_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[117,111,theory(equality)]),122,theory(equality)]) ).
cnf(134,negated_conjecture,
ssList(esk10_0),
inference(cn,[status(thm)],[133,theory(equality)]) ).
cnf(146,negated_conjecture,
( cons(esk9_0,nil) = esk5_0
| ~ neq(esk8_0,nil) ),
inference(rw,[status(thm)],[115,110,theory(equality)]) ).
cnf(147,negated_conjecture,
( cons(esk9_0,nil) = esk5_0
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[146,111,theory(equality)]),122,theory(equality)]) ).
cnf(148,negated_conjecture,
cons(esk9_0,nil) = esk5_0,
inference(cn,[status(thm)],[147,theory(equality)]) ).
cnf(157,negated_conjecture,
( app(esk10_0,esk5_0) = esk8_0
| ~ neq(esk8_0,nil) ),
inference(rw,[status(thm)],[113,148,theory(equality)]) ).
cnf(158,negated_conjecture,
( app(esk10_0,esk5_0) = esk6_0
| ~ neq(esk8_0,nil) ),
inference(rw,[status(thm)],[157,111,theory(equality)]) ).
cnf(159,negated_conjecture,
( app(esk10_0,esk5_0) = esk6_0
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[158,111,theory(equality)]),122,theory(equality)]) ).
cnf(160,negated_conjecture,
app(esk10_0,esk5_0) = esk6_0,
inference(cn,[status(thm)],[159,theory(equality)]) ).
cnf(313,negated_conjecture,
( cons(X1,nil) != esk5_0
| app(X2,cons(X1,nil)) != esk6_0
| ~ ssItem(X1)
| ~ ssList(X2)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[123,111,theory(equality)]),122,theory(equality)]) ).
cnf(314,negated_conjecture,
( cons(X1,nil) != esk5_0
| app(X2,cons(X1,nil)) != esk6_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[313,theory(equality)]) ).
cnf(315,negated_conjecture,
( app(X1,esk5_0) != esk6_0
| ~ ssList(X1)
| ~ ssItem(esk9_0) ),
inference(spm,[status(thm)],[314,148,theory(equality)]) ).
cnf(316,negated_conjecture,
( app(X1,esk5_0) != esk6_0
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[315,132,theory(equality)]) ).
cnf(317,negated_conjecture,
( app(X1,esk5_0) != esk6_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[316,theory(equality)]) ).
cnf(350,negated_conjecture,
~ ssList(esk10_0),
inference(spm,[status(thm)],[317,160,theory(equality)]) ).
cnf(354,negated_conjecture,
$false,
inference(rw,[status(thm)],[350,134,theory(equality)]) ).
cnf(355,negated_conjecture,
$false,
inference(cn,[status(thm)],[354,theory(equality)]) ).
cnf(356,negated_conjecture,
$false,
355,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC096+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpZyz2jw/sel_SWC096+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC096+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC096+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC096+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
%
%------------------------------------------------------------------------------