TSTP Solution File: SWC398+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC398+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 11:43:01 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 2
% Syntax : Number of formulae : 33 ( 14 unt; 0 def)
% Number of atoms : 219 ( 52 equ)
% Maximal formula atoms : 19 ( 6 avg)
% Number of connectives : 281 ( 95 ~; 89 |; 75 &)
% ( 1 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn 45 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(19,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/tmp/tmpEk-F0j/sel_SWC398+1.p_1',ax36) ).
fof(24,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X1,X9)
| memberP(X2,X9) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/tmp/tmpEk-F0j/sel_SWC398+1.p_1',co1) ).
fof(25,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X1,X9)
| memberP(X2,X9) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[24]) ).
fof(27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X1,X9)
| memberP(X2,X9) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[25,theory(equality)]) ).
fof(111,plain,
! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| ( ( ~ memberP(app(X2,X3),X1)
| memberP(X2,X1)
| memberP(X3,X1) )
& ( ( ~ memberP(X2,X1)
& ~ memberP(X3,X1) )
| memberP(app(X2,X3),X1) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(112,plain,
! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ memberP(app(X5,X6),X4)
| memberP(X5,X4)
| memberP(X6,X4) )
& ( ( ~ memberP(X5,X4)
& ~ memberP(X6,X4) )
| memberP(app(X5,X6),X4) ) ) ) ) ),
inference(variable_rename,[status(thm)],[111]) ).
fof(113,plain,
! [X4,X5,X6] :
( ~ ssList(X6)
| ( ( ~ memberP(app(X5,X6),X4)
| memberP(X5,X4)
| memberP(X6,X4) )
& ( ( ~ memberP(X5,X4)
& ~ memberP(X6,X4) )
| memberP(app(X5,X6),X4) ) )
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(shift_quantors,[status(thm)],[112]) ).
fof(114,plain,
! [X4,X5,X6] :
( ( ~ memberP(app(X5,X6),X4)
| memberP(X5,X4)
| memberP(X6,X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X5,X4)
| memberP(app(X5,X6),X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X6,X4)
| memberP(app(X5,X6),X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ) ),
inference(distribute,[status(thm)],[113]) ).
cnf(116,plain,
( memberP(app(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(X2,X1) ),
inference(split_conjunct,[status(thm)],[114]) ).
fof(138,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ? [X5] :
( ssList(X5)
& app(X3,X5) = X4
& equalelemsP(X3)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X6,nil)) != X3 ) ) ) )
& ? [X9] :
( ssItem(X9)
& memberP(X1,X9)
& ~ memberP(X2,X9) )
& ( nil = X4
| nil != X3 ) ) ) ) ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(139,negated_conjecture,
? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& ? [X13] :
( ssList(X13)
& X11 = X13
& X10 = X12
& ? [X14] :
( ssList(X14)
& app(X12,X14) = X13
& equalelemsP(X12)
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| app(cons(X15,nil),X16) != X14
| ! [X17] :
( ~ ssList(X17)
| app(X17,cons(X15,nil)) != X12 ) ) ) )
& ? [X18] :
( ssItem(X18)
& memberP(X10,X18)
& ~ memberP(X11,X18) )
& ( nil = X13
| nil != X12 ) ) ) ) ),
inference(variable_rename,[status(thm)],[138]) ).
fof(140,negated_conjecture,
( ssList(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& ssList(esk14_0)
& esk12_0 = esk14_0
& esk11_0 = esk13_0
& ssList(esk15_0)
& app(esk13_0,esk15_0) = esk14_0
& equalelemsP(esk13_0)
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| app(cons(X15,nil),X16) != esk15_0
| ! [X17] :
( ~ ssList(X17)
| app(X17,cons(X15,nil)) != esk13_0 ) ) )
& ssItem(esk16_0)
& memberP(esk11_0,esk16_0)
& ~ memberP(esk12_0,esk16_0)
& ( nil = esk14_0
| nil != esk13_0 ) ),
inference(skolemize,[status(esa)],[139]) ).
fof(141,negated_conjecture,
! [X15,X16,X17] :
( ( ~ ssList(X17)
| app(X17,cons(X15,nil)) != esk13_0
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk15_0
| ~ ssItem(X15) )
& app(esk13_0,esk15_0) = esk14_0
& equalelemsP(esk13_0)
& ssList(esk15_0)
& esk12_0 = esk14_0
& esk11_0 = esk13_0
& ssItem(esk16_0)
& memberP(esk11_0,esk16_0)
& ~ memberP(esk12_0,esk16_0)
& ( nil = esk14_0
| nil != esk13_0 )
& ssList(esk14_0)
& ssList(esk13_0)
& ssList(esk12_0)
& ssList(esk11_0) ),
inference(shift_quantors,[status(thm)],[140]) ).
cnf(142,negated_conjecture,
ssList(esk11_0),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(147,negated_conjecture,
~ memberP(esk12_0,esk16_0),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(148,negated_conjecture,
memberP(esk11_0,esk16_0),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(149,negated_conjecture,
ssItem(esk16_0),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(150,negated_conjecture,
esk11_0 = esk13_0,
inference(split_conjunct,[status(thm)],[141]) ).
cnf(151,negated_conjecture,
esk12_0 = esk14_0,
inference(split_conjunct,[status(thm)],[141]) ).
cnf(152,negated_conjecture,
ssList(esk15_0),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(154,negated_conjecture,
app(esk13_0,esk15_0) = esk14_0,
inference(split_conjunct,[status(thm)],[141]) ).
cnf(156,negated_conjecture,
ssList(esk13_0),
inference(rw,[status(thm)],[142,150,theory(equality)]) ).
cnf(158,negated_conjecture,
memberP(esk13_0,esk16_0),
inference(rw,[status(thm)],[148,150,theory(equality)]) ).
cnf(159,negated_conjecture,
~ memberP(esk14_0,esk16_0),
inference(rw,[status(thm)],[147,151,theory(equality)]) ).
cnf(191,negated_conjecture,
( memberP(app(esk13_0,X1),esk16_0)
| ~ ssItem(esk16_0)
| ~ ssList(X1)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[116,158,theory(equality)]) ).
cnf(192,negated_conjecture,
( memberP(app(esk13_0,X1),esk16_0)
| $false
| ~ ssList(X1)
| ~ ssList(esk13_0) ),
inference(rw,[status(thm)],[191,149,theory(equality)]) ).
cnf(193,negated_conjecture,
( memberP(app(esk13_0,X1),esk16_0)
| ~ ssList(X1)
| ~ ssList(esk13_0) ),
inference(cn,[status(thm)],[192,theory(equality)]) ).
cnf(447,negated_conjecture,
( memberP(app(esk13_0,X1),esk16_0)
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[193,156,theory(equality)]) ).
cnf(448,negated_conjecture,
( memberP(app(esk13_0,X1),esk16_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[447,theory(equality)]) ).
cnf(449,negated_conjecture,
( memberP(esk14_0,esk16_0)
| ~ ssList(esk15_0) ),
inference(spm,[status(thm)],[448,154,theory(equality)]) ).
cnf(458,negated_conjecture,
~ ssList(esk15_0),
inference(sr,[status(thm)],[449,159,theory(equality)]) ).
cnf(504,negated_conjecture,
$false,
inference(sr,[status(thm)],[152,458,theory(equality)]) ).
cnf(505,negated_conjecture,
$false,
504,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC398+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpEk-F0j/sel_SWC398+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC398+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC398+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC398+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
%
%------------------------------------------------------------------------------