TSTP Solution File: SWC288+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC288+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 11:14:26 EST 2010
% Result : Theorem 0.28s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 209 ( 69 equ)
% Maximal formula atoms : 43 ( 8 avg)
% Number of connectives : 258 ( 74 ~; 77 |; 91 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 34 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
strictorderedP(nil),
file('/tmp/tmpIdlPzI/sel_SWC288+1.p_1',ax69) ).
fof(3,axiom,
! [X1] :
( ssItem(X1)
=> strictorderedP(cons(X1,nil)) ),
file('/tmp/tmpIdlPzI/sel_SWC288+1.p_1',ax68) ).
fof(38,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| strictorderedP(X1)
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
file('/tmp/tmpIdlPzI/sel_SWC288+1.p_1',co1) ).
fof(39,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| strictorderedP(X1)
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[38]) ).
fof(43,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| strictorderedP(X1)
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[39,theory(equality)]) ).
cnf(48,plain,
strictorderedP(nil),
inference(split_conjunct,[status(thm)],[2]) ).
fof(49,plain,
! [X1] :
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(50,plain,
! [X2] :
( ~ ssItem(X2)
| strictorderedP(cons(X2,nil)) ),
inference(variable_rename,[status(thm)],[49]) ).
cnf(51,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[50]) ).
fof(218,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ~ strictorderedP(X1)
& ( ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& cons(X5,nil) = X3
& app(app(X6,X3),X7) = X4
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X5,X8) )
& ! [X9] :
( ~ ssItem(X9)
| ~ memberP(X7,X9)
| ~ lt(X9,X5) ) ) ) )
| ( nil = X4
& nil = X3 ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[43]) ).
fof(219,negated_conjecture,
? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& ? [X13] :
( ssList(X13)
& X11 = X13
& X10 = X12
& ~ strictorderedP(X10)
& ( ? [X14] :
( ssItem(X14)
& ? [X15] :
( ssList(X15)
& ? [X16] :
( ssList(X16)
& cons(X14,nil) = X12
& app(app(X15,X12),X16) = X13
& ! [X17] :
( ~ ssItem(X17)
| ~ memberP(X15,X17)
| ~ lt(X14,X17) )
& ! [X18] :
( ~ ssItem(X18)
| ~ memberP(X16,X18)
| ~ lt(X18,X14) ) ) ) )
| ( nil = X13
& nil = X12 ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[218]) ).
fof(220,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)
& ( ( ssItem(esk17_0)
& ssList(esk18_0)
& ssList(esk19_0)
& cons(esk17_0,nil) = esk15_0
& app(app(esk18_0,esk15_0),esk19_0) = esk16_0
& ! [X17] :
( ~ ssItem(X17)
| ~ memberP(esk18_0,X17)
| ~ lt(esk17_0,X17) )
& ! [X18] :
( ~ ssItem(X18)
| ~ memberP(esk19_0,X18)
| ~ lt(X18,esk17_0) ) )
| ( nil = esk16_0
& nil = esk15_0 ) ) ),
inference(skolemize,[status(esa)],[219]) ).
fof(221,negated_conjecture,
! [X17,X18] :
( ( ( ( ~ ssItem(X18)
| ~ memberP(esk19_0,X18)
| ~ lt(X18,esk17_0) )
& ( ~ ssItem(X17)
| ~ memberP(esk18_0,X17)
| ~ lt(esk17_0,X17) )
& ssList(esk19_0)
& cons(esk17_0,nil) = esk15_0
& app(app(esk18_0,esk15_0),esk19_0) = esk16_0
& ssList(esk18_0)
& ssItem(esk17_0) )
| ( nil = esk16_0
& nil = esk15_0 ) )
& ssList(esk16_0)
& esk14_0 = esk16_0
& esk13_0 = esk15_0
& ~ strictorderedP(esk13_0)
& ssList(esk15_0)
& ssList(esk14_0)
& ssList(esk13_0) ),
inference(shift_quantors,[status(thm)],[220]) ).
fof(222,negated_conjecture,
! [X17,X18] :
( ( nil = esk16_0
| ~ ssItem(X18)
| ~ memberP(esk19_0,X18)
| ~ lt(X18,esk17_0) )
& ( nil = esk15_0
| ~ ssItem(X18)
| ~ memberP(esk19_0,X18)
| ~ lt(X18,esk17_0) )
& ( nil = esk16_0
| ~ ssItem(X17)
| ~ memberP(esk18_0,X17)
| ~ lt(esk17_0,X17) )
& ( nil = esk15_0
| ~ ssItem(X17)
| ~ memberP(esk18_0,X17)
| ~ lt(esk17_0,X17) )
& ( nil = esk16_0
| ssList(esk19_0) )
& ( nil = esk15_0
| ssList(esk19_0) )
& ( nil = esk16_0
| cons(esk17_0,nil) = esk15_0 )
& ( nil = esk15_0
| cons(esk17_0,nil) = esk15_0 )
& ( nil = esk16_0
| app(app(esk18_0,esk15_0),esk19_0) = esk16_0 )
& ( nil = esk15_0
| app(app(esk18_0,esk15_0),esk19_0) = esk16_0 )
& ( nil = esk16_0
| ssList(esk18_0) )
& ( nil = esk15_0
| ssList(esk18_0) )
& ( nil = esk16_0
| ssItem(esk17_0) )
& ( nil = esk15_0
| ssItem(esk17_0) )
& ssList(esk16_0)
& esk14_0 = esk16_0
& esk13_0 = esk15_0
& ~ strictorderedP(esk13_0)
& ssList(esk15_0)
& ssList(esk14_0)
& ssList(esk13_0) ),
inference(distribute,[status(thm)],[221]) ).
cnf(226,negated_conjecture,
~ strictorderedP(esk13_0),
inference(split_conjunct,[status(thm)],[222]) ).
cnf(227,negated_conjecture,
esk13_0 = esk15_0,
inference(split_conjunct,[status(thm)],[222]) ).
cnf(230,negated_conjecture,
( ssItem(esk17_0)
| nil = esk15_0 ),
inference(split_conjunct,[status(thm)],[222]) ).
cnf(236,negated_conjecture,
( cons(esk17_0,nil) = esk15_0
| nil = esk15_0 ),
inference(split_conjunct,[status(thm)],[222]) ).
cnf(246,negated_conjecture,
~ strictorderedP(esk15_0),
inference(rw,[status(thm)],[226,227,theory(equality)]) ).
cnf(247,negated_conjecture,
( strictorderedP(esk15_0)
| esk15_0 = nil
| ~ ssItem(esk17_0) ),
inference(spm,[status(thm)],[51,236,theory(equality)]) ).
cnf(248,negated_conjecture,
( esk15_0 = nil
| ~ ssItem(esk17_0) ),
inference(sr,[status(thm)],[247,246,theory(equality)]) ).
cnf(605,negated_conjecture,
esk15_0 = nil,
inference(csr,[status(thm)],[248,230]) ).
cnf(610,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[246,605,theory(equality)]),48,theory(equality)]) ).
cnf(611,negated_conjecture,
$false,
inference(cn,[status(thm)],[610,theory(equality)]) ).
cnf(612,negated_conjecture,
$false,
611,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC288+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpIdlPzI/sel_SWC288+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC288+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC288+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC288+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
%
%------------------------------------------------------------------------------