TSTP Solution File: SWC040+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC040+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:08:06 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 9 unt; 0 def)
% Number of atoms : 106 ( 58 equ)
% Maximal formula atoms : 18 ( 6 avg)
% Number of connectives : 120 ( 31 ~; 25 |; 52 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 8 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 : 24 ( 0 sgn 12 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(19,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(cons(X5,nil),X6) != X3
| app(X6,cons(X5,nil)) != X4 ) ) )
& neq(X4,nil) ) ) ) ) ) ),
file('/tmp/tmpNFW5S6/sel_SWC040+1.p_1',co1) ).
fof(20,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(cons(X5,nil),X6) != X3
| app(X6,cons(X5,nil)) != X4 ) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[19]) ).
fof(101,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& nil = X2
& X2 = X4
& X1 = X3
& nil != X1
& ( nil = X3
| nil != X4 )
& ( ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X3
& app(X6,cons(X5,nil)) = X4 ) )
| ~ neq(X4,nil) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(102,negated_conjecture,
? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& nil = X8
& X8 = X10
& X7 = X9
& nil != X7
& ( nil = X9
| nil != X10 )
& ( ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X9
& app(X12,cons(X11,nil)) = X10 ) )
| ~ neq(X10,nil) ) ) ) ) ),
inference(variable_rename,[status(thm)],[101]) ).
fof(103,negated_conjecture,
( ssList(esk5_0)
& ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& nil = esk6_0
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& nil != esk5_0
& ( nil = esk7_0
| nil != esk8_0 )
& ( ( ssItem(esk9_0)
& ssList(esk10_0)
& app(cons(esk9_0,nil),esk10_0) = esk7_0
& app(esk10_0,cons(esk9_0,nil)) = esk8_0 )
| ~ neq(esk8_0,nil) ) ),
inference(skolemize,[status(esa)],[102]) ).
fof(104,negated_conjecture,
( ssList(esk5_0)
& ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& nil = esk6_0
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& nil != esk5_0
& ( nil = esk7_0
| nil != esk8_0 )
& ( ssItem(esk9_0)
| ~ neq(esk8_0,nil) )
& ( ssList(esk10_0)
| ~ neq(esk8_0,nil) )
& ( app(cons(esk9_0,nil),esk10_0) = esk7_0
| ~ neq(esk8_0,nil) )
& ( app(esk10_0,cons(esk9_0,nil)) = esk8_0
| ~ neq(esk8_0,nil) ) ),
inference(distribute,[status(thm)],[103]) ).
cnf(109,negated_conjecture,
( nil = esk7_0
| nil != esk8_0 ),
inference(split_conjunct,[status(thm)],[104]) ).
cnf(110,negated_conjecture,
nil != esk5_0,
inference(split_conjunct,[status(thm)],[104]) ).
cnf(111,negated_conjecture,
esk5_0 = esk7_0,
inference(split_conjunct,[status(thm)],[104]) ).
cnf(112,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[104]) ).
cnf(113,negated_conjecture,
nil = esk6_0,
inference(split_conjunct,[status(thm)],[104]) ).
cnf(121,negated_conjecture,
esk8_0 = nil,
inference(rw,[status(thm)],[112,113,theory(equality)]) ).
cnf(124,negated_conjecture,
esk7_0 != nil,
inference(rw,[status(thm)],[110,111,theory(equality)]) ).
cnf(127,negated_conjecture,
( esk7_0 = nil
| $false ),
inference(rw,[status(thm)],[109,121,theory(equality)]) ).
cnf(128,negated_conjecture,
esk7_0 = nil,
inference(cn,[status(thm)],[127,theory(equality)]) ).
cnf(129,negated_conjecture,
$false,
inference(sr,[status(thm)],[128,124,theory(equality)]) ).
cnf(130,negated_conjecture,
$false,
129,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC040+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpNFW5S6/sel_SWC040+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC040+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC040+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC040+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
%
%------------------------------------------------------------------------------