TSTP Solution File: SWC007+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC007+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:04:28 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of formulae : 45 ( 13 unt; 0 def)
% Number of atoms : 185 ( 91 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 232 ( 92 ~; 82 |; 45 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 36 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/tmp/tmp9CoI1a/sel_SWC007+1.p_1',ax84) ).
fof(6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/tmp/tmp9CoI1a/sel_SWC007+1.p_1',ax83) ).
fof(11,axiom,
ssList(nil),
file('/tmp/tmp9CoI1a/sel_SWC007+1.p_1',ax17) ).
fof(12,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/tmp/tmp9CoI1a/sel_SWC007+1.p_1',ax28) ).
fof(17,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X3
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1 ) ) ) ) ) ) ) ),
file('/tmp/tmp9CoI1a/sel_SWC007+1.p_1',co1) ).
fof(18,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X3
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1 ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[17]) ).
fof(36,plain,
! [X1] :
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(37,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[36]) ).
cnf(38,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[37]) ).
fof(39,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( nil != app(X1,X2)
| ( nil = X2
& nil = X1 ) )
& ( nil != X2
| nil != X1
| nil = app(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(40,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( nil != app(X3,X4)
| ( nil = X4
& nil = X3 ) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[39]) ).
fof(41,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( nil != app(X3,X4)
| ( nil = X4
& nil = X3 ) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[40]) ).
fof(42,plain,
! [X3,X4] :
( ( nil = X4
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil = X3
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[41]) ).
cnf(43,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(65,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[11]) ).
fof(66,plain,
! [X1] :
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(67,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[66]) ).
cnf(68,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[67]) ).
fof(87,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& nil = X3
& X2 = X4
& X1 = X3
& ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| app(app(X5,X6),X7) != X2
| app(X5,X7) != X1 ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(88,negated_conjecture,
? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& nil = X10
& X9 = X11
& X8 = X10
& ! [X12] :
( ~ ssList(X12)
| ! [X13] :
( ~ ssList(X13)
| ! [X14] :
( ~ ssList(X14)
| app(app(X12,X13),X14) != X9
| app(X12,X14) != X8 ) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[87]) ).
fof(89,negated_conjecture,
( ssList(esk5_0)
& ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& nil = esk7_0
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& ! [X12] :
( ~ ssList(X12)
| ! [X13] :
( ~ ssList(X13)
| ! [X14] :
( ~ ssList(X14)
| app(app(X12,X13),X14) != esk6_0
| app(X12,X14) != esk5_0 ) ) ) ),
inference(skolemize,[status(esa)],[88]) ).
fof(90,negated_conjecture,
! [X12,X13,X14] :
( ( ~ ssList(X14)
| app(app(X12,X13),X14) != esk6_0
| app(X12,X14) != esk5_0
| ~ ssList(X13)
| ~ ssList(X12) )
& nil = esk7_0
& 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)],[89]) ).
cnf(94,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(95,negated_conjecture,
esk5_0 = esk7_0,
inference(split_conjunct,[status(thm)],[90]) ).
cnf(96,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[90]) ).
cnf(97,negated_conjecture,
nil = esk7_0,
inference(split_conjunct,[status(thm)],[90]) ).
cnf(98,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X3) != esk5_0
| app(app(X1,X2),X3) != esk6_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(101,negated_conjecture,
nil = esk5_0,
inference(rw,[status(thm)],[95,97,theory(equality)]) ).
cnf(104,negated_conjecture,
ssList(esk6_0),
inference(rw,[status(thm)],[94,96,theory(equality)]) ).
cnf(111,plain,
( app(X1,nil) = nil
| nil != X1
| ~ ssList(nil)
| ~ ssList(X1) ),
inference(er,[status(thm)],[43,theory(equality)]) ).
cnf(112,plain,
( app(X1,nil) = nil
| nil != X1
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[111,65,theory(equality)]) ).
cnf(113,plain,
( app(X1,nil) = nil
| nil != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[112,theory(equality)]) ).
cnf(178,negated_conjecture,
( app(X1,X3) != nil
| app(app(X1,X2),X3) != esk6_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[98,101,theory(equality)]) ).
cnf(206,plain,
( app(nil,nil) = nil
| ~ ssList(nil) ),
inference(er,[status(thm)],[113,theory(equality)]) ).
cnf(207,plain,
( app(nil,nil) = nil
| $false ),
inference(rw,[status(thm)],[206,65,theory(equality)]) ).
cnf(208,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[207,theory(equality)]) ).
cnf(215,negated_conjecture,
( app(app(nil,X1),nil) != esk6_0
| ~ ssList(nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[178,208,theory(equality)]) ).
cnf(230,negated_conjecture,
( app(app(nil,X1),nil) != esk6_0
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[215,65,theory(equality)]) ).
cnf(231,negated_conjecture,
( app(app(nil,X1),nil) != esk6_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[230,theory(equality)]) ).
cnf(237,negated_conjecture,
( app(X1,nil) != esk6_0
| ~ ssList(X1) ),
inference(spm,[status(thm)],[231,68,theory(equality)]) ).
cnf(250,negated_conjecture,
( X1 != esk6_0
| ~ ssList(X1) ),
inference(spm,[status(thm)],[237,38,theory(equality)]) ).
cnf(271,negated_conjecture,
~ ssList(esk6_0),
inference(er,[status(thm)],[250,theory(equality)]) ).
cnf(272,negated_conjecture,
$false,
inference(rw,[status(thm)],[271,104,theory(equality)]) ).
cnf(273,negated_conjecture,
$false,
inference(cn,[status(thm)],[272,theory(equality)]) ).
cnf(274,negated_conjecture,
$false,
273,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC007+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp9CoI1a/sel_SWC007+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC007+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC007+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC007+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
%
%------------------------------------------------------------------------------