%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC292+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:15:11 EST 2010
% Result : Theorem 0.28s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of formulae : 50 ( 16 unt; 0 def)
% Number of atoms : 197 ( 69 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 220 ( 73 ~; 78 |; 50 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 28 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
strictorderedP(nil),
file('/tmp/tmpkwbIzo/sel_SWC292+1.p_1',ax69) ).
fof(3,axiom,
! [X1] :
( ssItem(X1)
=> strictorderedP(cons(X1,nil)) ),
file('/tmp/tmpkwbIzo/sel_SWC292+1.p_1',ax68) ).
fof(37,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpkwbIzo/sel_SWC292+1.p_1',ax15) ).
fof(39,axiom,
ssList(nil),
file('/tmp/tmpkwbIzo/sel_SWC292+1.p_1',ax17) ).
fof(40,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| strictorderedP(X1)
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& neq(X4,nil) ) ) ) ) ) ),
file('/tmp/tmpkwbIzo/sel_SWC292+1.p_1',co1) ).
fof(41,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| strictorderedP(X1)
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[40]) ).
fof(45,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| strictorderedP(X1)
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[41,theory(equality)]) ).
cnf(50,plain,
strictorderedP(nil),
inference(split_conjunct,[status(thm)],[2]) ).
fof(51,plain,
! [X1] :
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(52,plain,
! [X2] :
( ~ ssItem(X2)
| strictorderedP(cons(X2,nil)) ),
inference(variable_rename,[status(thm)],[51]) ).
cnf(53,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[52]) ).
fof(221,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(222,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[221]) ).
fof(223,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[222]) ).
fof(224,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[223]) ).
cnf(225,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[224]) ).
cnf(231,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[39]) ).
fof(232,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ~ strictorderedP(X1)
& ( nil = X3
| nil != X4 )
& ( ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X3
& memberP(X4,X5) )
| ~ neq(X4,nil) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[45]) ).
fof(233,negated_conjecture,
? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& X7 = X9
& X6 = X8
& ~ strictorderedP(X6)
& ( nil = X8
| nil != X9 )
& ( ? [X10] :
( ssItem(X10)
& cons(X10,nil) = X8
& memberP(X9,X10) )
| ~ neq(X9,nil) ) ) ) ) ),
inference(variable_rename,[status(thm)],[232]) ).
fof(234,negated_conjecture,
( ssList(esk13_0)
& ssList(esk14_0)
& ssList(esk15_0)
& ssList(esk16_0)
& esk14_0 = esk16_0
& esk13_0 = esk15_0
& ~ strictorderedP(esk13_0)
& ( nil = esk15_0
| nil != esk16_0 )
& ( ( ssItem(esk17_0)
& cons(esk17_0,nil) = esk15_0
& memberP(esk16_0,esk17_0) )
| ~ neq(esk16_0,nil) ) ),
inference(skolemize,[status(esa)],[233]) ).
fof(235,negated_conjecture,
( ssList(esk13_0)
& ssList(esk14_0)
& ssList(esk15_0)
& ssList(esk16_0)
& esk14_0 = esk16_0
& esk13_0 = esk15_0
& ~ strictorderedP(esk13_0)
& ( nil = esk15_0
| nil != esk16_0 )
& ( ssItem(esk17_0)
| ~ neq(esk16_0,nil) )
& ( cons(esk17_0,nil) = esk15_0
| ~ neq(esk16_0,nil) )
& ( memberP(esk16_0,esk17_0)
| ~ neq(esk16_0,nil) ) ),
inference(distribute,[status(thm)],[234]) ).
cnf(237,negated_conjecture,
( cons(esk17_0,nil) = esk15_0
| ~ neq(esk16_0,nil) ),
inference(split_conjunct,[status(thm)],[235]) ).
cnf(238,negated_conjecture,
( ssItem(esk17_0)
| ~ neq(esk16_0,nil) ),
inference(split_conjunct,[status(thm)],[235]) ).
cnf(239,negated_conjecture,
( nil = esk15_0
| nil != esk16_0 ),
inference(split_conjunct,[status(thm)],[235]) ).
cnf(240,negated_conjecture,
~ strictorderedP(esk13_0),
inference(split_conjunct,[status(thm)],[235]) ).
cnf(241,negated_conjecture,
esk13_0 = esk15_0,
inference(split_conjunct,[status(thm)],[235]) ).
cnf(242,negated_conjecture,
esk14_0 = esk16_0,
inference(split_conjunct,[status(thm)],[235]) ).
cnf(245,negated_conjecture,
ssList(esk14_0),
inference(split_conjunct,[status(thm)],[235]) ).
cnf(248,negated_conjecture,
ssList(esk16_0),
inference(rw,[status(thm)],[245,242,theory(equality)]) ).
cnf(249,negated_conjecture,
~ strictorderedP(esk15_0),
inference(rw,[status(thm)],[240,241,theory(equality)]) ).
cnf(251,negated_conjecture,
( ~ strictorderedP(nil)
| esk16_0 != nil ),
inference(spm,[status(thm)],[249,239,theory(equality)]) ).
cnf(253,negated_conjecture,
( $false
| esk16_0 != nil ),
inference(rw,[status(thm)],[251,50,theory(equality)]) ).
cnf(254,negated_conjecture,
esk16_0 != nil,
inference(cn,[status(thm)],[253,theory(equality)]) ).
cnf(265,negated_conjecture,
( ssItem(esk17_0)
| esk16_0 = nil
| ~ ssList(nil)
| ~ ssList(esk16_0) ),
inference(spm,[status(thm)],[238,225,theory(equality)]) ).
cnf(267,negated_conjecture,
( cons(esk17_0,nil) = esk15_0
| esk16_0 = nil
| ~ ssList(nil)
| ~ ssList(esk16_0) ),
inference(spm,[status(thm)],[237,225,theory(equality)]) ).
cnf(268,negated_conjecture,
( ssItem(esk17_0)
| esk16_0 = nil
| $false
| ~ ssList(esk16_0) ),
inference(rw,[status(thm)],[265,231,theory(equality)]) ).
cnf(269,negated_conjecture,
( ssItem(esk17_0)
| esk16_0 = nil
| ~ ssList(esk16_0) ),
inference(cn,[status(thm)],[268,theory(equality)]) ).
cnf(272,negated_conjecture,
( cons(esk17_0,nil) = esk15_0
| esk16_0 = nil
| $false
| ~ ssList(esk16_0) ),
inference(rw,[status(thm)],[267,231,theory(equality)]) ).
cnf(273,negated_conjecture,
( cons(esk17_0,nil) = esk15_0
| esk16_0 = nil
| ~ ssList(esk16_0) ),
inference(cn,[status(thm)],[272,theory(equality)]) ).
cnf(503,negated_conjecture,
( ssItem(esk17_0)
| esk16_0 = nil
| $false ),
inference(rw,[status(thm)],[269,248,theory(equality)]) ).
cnf(504,negated_conjecture,
( ssItem(esk17_0)
| esk16_0 = nil ),
inference(cn,[status(thm)],[503,theory(equality)]) ).
cnf(505,negated_conjecture,
ssItem(esk17_0),
inference(sr,[status(thm)],[504,254,theory(equality)]) ).
cnf(511,negated_conjecture,
( cons(esk17_0,nil) = esk15_0
| esk16_0 = nil
| $false ),
inference(rw,[status(thm)],[273,248,theory(equality)]) ).
cnf(512,negated_conjecture,
( cons(esk17_0,nil) = esk15_0
| esk16_0 = nil ),
inference(cn,[status(thm)],[511,theory(equality)]) ).
cnf(513,negated_conjecture,
cons(esk17_0,nil) = esk15_0,
inference(sr,[status(thm)],[512,254,theory(equality)]) ).
cnf(514,negated_conjecture,
( strictorderedP(esk15_0)
| ~ ssItem(esk17_0) ),
inference(spm,[status(thm)],[53,513,theory(equality)]) ).
cnf(532,negated_conjecture,
( strictorderedP(esk15_0)
| $false ),
inference(rw,[status(thm)],[514,505,theory(equality)]) ).
cnf(533,negated_conjecture,
strictorderedP(esk15_0),
inference(cn,[status(thm)],[532,theory(equality)]) ).
cnf(534,negated_conjecture,
$false,
inference(sr,[status(thm)],[533,249,theory(equality)]) ).
cnf(535,negated_conjecture,
$false,
534,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC292+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpkwbIzo/sel_SWC292+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC292+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC292+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC292+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
%
%------------------------------------------------------------------------------