TSTP Solution File: SWC351+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC351+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:37:21 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 226 ( 67 equ)
% Maximal formula atoms : 20 ( 7 avg)
% Number of connectives : 300 ( 106 ~; 96 |; 80 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn 48 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(22,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/tmp/tmpWpbTCe/sel_SWC351+1.p_1',ax5) ).
fof(44,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| frontsegP(X2,X1)
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/tmp/tmpWpbTCe/sel_SWC351+1.p_1',co1) ).
fof(45,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| frontsegP(X2,X1)
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[44]) ).
fof(48,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| frontsegP(X2,X1)
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[45,theory(equality)]) ).
fof(135,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ frontsegP(X1,X2)
| ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) )
& ( ! [X3] :
( ~ ssList(X3)
| app(X2,X3) != X1 )
| frontsegP(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(136,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ( ( ~ frontsegP(X4,X5)
| ? [X6] :
( ssList(X6)
& app(X5,X6) = X4 ) )
& ( ! [X7] :
( ~ ssList(X7)
| app(X5,X7) != X4 )
| frontsegP(X4,X5) ) ) ) ),
inference(variable_rename,[status(thm)],[135]) ).
fof(137,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ( ( ~ frontsegP(X4,X5)
| ( ssList(esk5_2(X4,X5))
& app(X5,esk5_2(X4,X5)) = X4 ) )
& ( ! [X7] :
( ~ ssList(X7)
| app(X5,X7) != X4 )
| frontsegP(X4,X5) ) ) ) ),
inference(skolemize,[status(esa)],[136]) ).
fof(138,plain,
! [X4,X5,X7] :
( ( ( ~ ssList(X7)
| app(X5,X7) != X4
| frontsegP(X4,X5) )
& ( ~ frontsegP(X4,X5)
| ( ssList(esk5_2(X4,X5))
& app(X5,esk5_2(X4,X5)) = X4 ) ) )
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(shift_quantors,[status(thm)],[137]) ).
fof(139,plain,
! [X4,X5,X7] :
( ( ~ ssList(X7)
| app(X5,X7) != X4
| frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( ssList(esk5_2(X4,X5))
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( app(X5,esk5_2(X4,X5)) = X4
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) ) ),
inference(distribute,[status(thm)],[138]) ).
cnf(142,plain,
( frontsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X2,X3) != X1
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[139]) ).
fof(247,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& neq(X2,nil)
& ? [X5] :
( ssList(X5)
& app(X3,X5) = X4
& strictorderedP(X3)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) != X3
| ~ lt(X8,X6) ) ) ) ) )
& ~ frontsegP(X2,X1)
& ( nil = X4
| nil != X3 ) ) ) ) ),
inference(fof_nnf,[status(thm)],[48]) ).
fof(248,negated_conjecture,
? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& ? [X13] :
( ssList(X13)
& X11 = X13
& X10 = X12
& neq(X11,nil)
& ? [X14] :
( ssList(X14)
& app(X12,X14) = X13
& strictorderedP(X12)
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| app(cons(X15,nil),X16) != X14
| ! [X17] :
( ~ ssItem(X17)
| ! [X18] :
( ~ ssList(X18)
| app(X18,cons(X17,nil)) != X12
| ~ lt(X17,X15) ) ) ) ) )
& ~ frontsegP(X11,X10)
& ( nil = X13
| nil != X12 ) ) ) ) ),
inference(variable_rename,[status(thm)],[247]) ).
fof(249,negated_conjecture,
( ssList(esk12_0)
& ssList(esk13_0)
& ssList(esk14_0)
& ssList(esk15_0)
& esk13_0 = esk15_0
& esk12_0 = esk14_0
& neq(esk13_0,nil)
& ssList(esk16_0)
& app(esk14_0,esk16_0) = esk15_0
& strictorderedP(esk14_0)
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| app(cons(X15,nil),X16) != esk16_0
| ! [X17] :
( ~ ssItem(X17)
| ! [X18] :
( ~ ssList(X18)
| app(X18,cons(X17,nil)) != esk14_0
| ~ lt(X17,X15) ) ) ) )
& ~ frontsegP(esk13_0,esk12_0)
& ( nil = esk15_0
| nil != esk14_0 ) ),
inference(skolemize,[status(esa)],[248]) ).
fof(250,negated_conjecture,
! [X15,X16,X17,X18] :
( ( ~ ssList(X18)
| app(X18,cons(X17,nil)) != esk14_0
| ~ lt(X17,X15)
| ~ ssItem(X17)
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk16_0
| ~ ssItem(X15) )
& app(esk14_0,esk16_0) = esk15_0
& strictorderedP(esk14_0)
& ssList(esk16_0)
& esk13_0 = esk15_0
& esk12_0 = esk14_0
& neq(esk13_0,nil)
& ~ frontsegP(esk13_0,esk12_0)
& ( nil = esk15_0
| nil != esk14_0 )
& ssList(esk15_0)
& ssList(esk14_0)
& ssList(esk13_0)
& ssList(esk12_0) ),
inference(shift_quantors,[status(thm)],[249]) ).
cnf(251,negated_conjecture,
ssList(esk12_0),
inference(split_conjunct,[status(thm)],[250]) ).
cnf(252,negated_conjecture,
ssList(esk13_0),
inference(split_conjunct,[status(thm)],[250]) ).
cnf(256,negated_conjecture,
~ frontsegP(esk13_0,esk12_0),
inference(split_conjunct,[status(thm)],[250]) ).
cnf(258,negated_conjecture,
esk12_0 = esk14_0,
inference(split_conjunct,[status(thm)],[250]) ).
cnf(259,negated_conjecture,
esk13_0 = esk15_0,
inference(split_conjunct,[status(thm)],[250]) ).
cnf(260,negated_conjecture,
ssList(esk16_0),
inference(split_conjunct,[status(thm)],[250]) ).
cnf(262,negated_conjecture,
app(esk14_0,esk16_0) = esk15_0,
inference(split_conjunct,[status(thm)],[250]) ).
cnf(264,negated_conjecture,
ssList(esk14_0),
inference(rw,[status(thm)],[251,258,theory(equality)]) ).
cnf(265,negated_conjecture,
ssList(esk15_0),
inference(rw,[status(thm)],[252,259,theory(equality)]) ).
cnf(270,negated_conjecture,
~ frontsegP(esk15_0,esk14_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[256,259,theory(equality)]),258,theory(equality)]) ).
cnf(318,negated_conjecture,
( frontsegP(X1,esk14_0)
| esk15_0 != X1
| ~ ssList(esk16_0)
| ~ ssList(esk14_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[142,262,theory(equality)]) ).
cnf(576,negated_conjecture,
( frontsegP(X1,esk14_0)
| esk15_0 != X1
| ~ ssList(esk16_0)
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[318,264,theory(equality)]) ).
cnf(577,negated_conjecture,
( frontsegP(X1,esk14_0)
| esk15_0 != X1
| ~ ssList(esk16_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[576,theory(equality)]) ).
cnf(578,negated_conjecture,
( ~ ssList(esk16_0)
| ~ ssList(esk15_0) ),
inference(spm,[status(thm)],[270,577,theory(equality)]) ).
cnf(582,negated_conjecture,
( ~ ssList(esk16_0)
| $false ),
inference(rw,[status(thm)],[578,265,theory(equality)]) ).
cnf(583,negated_conjecture,
~ ssList(esk16_0),
inference(cn,[status(thm)],[582,theory(equality)]) ).
cnf(605,negated_conjecture,
$false,
inference(sr,[status(thm)],[260,583,theory(equality)]) ).
cnf(606,negated_conjecture,
$false,
605,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC351+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpWpbTCe/sel_SWC351+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC351+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC351+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC351+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
%
%------------------------------------------------------------------------------