TSTP Solution File: SWC008+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC008+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:35 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 5
% Syntax : Number of formulae : 46 ( 9 unt; 0 def)
% Number of atoms : 273 ( 66 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 381 ( 154 ~; 138 |; 71 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 109 ( 0 sgn 56 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/tmp/tmpqBrGqf/sel_SWC008+1.p_1',ax84) ).
fof(12,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/tmp/tmpqBrGqf/sel_SWC008+1.p_1',ax26) ).
fof(20,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/tmp/tmpqBrGqf/sel_SWC008+1.p_1',ax5) ).
fof(29,axiom,
ssList(nil),
file('/tmp/tmpqBrGqf/sel_SWC008+1.p_1',ax17) ).
fof(37,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ equalelemsP(X3)
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1 ) ) )
| ? [X8] :
( ssList(X8)
& neq(X3,X8)
& frontsegP(X4,X8)
& segmentP(X8,X3)
& equalelemsP(X8) ) ) ) ) ) ),
file('/tmp/tmpqBrGqf/sel_SWC008+1.p_1',co1) ).
fof(38,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ equalelemsP(X3)
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1 ) ) )
| ? [X8] :
( ssList(X8)
& neq(X3,X8)
& frontsegP(X4,X8)
& segmentP(X8,X3)
& equalelemsP(X8) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[37]) ).
fof(39,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ equalelemsP(X3)
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1 ) ) )
| ? [X8] :
( ssList(X8)
& neq(X3,X8)
& frontsegP(X4,X8)
& segmentP(X8,X3)
& equalelemsP(X8) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[38,theory(equality)]) ).
fof(41,plain,
! [X1] :
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(42,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[41]) ).
cnf(43,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[42]) ).
fof(82,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ssList(app(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(83,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ssList(app(X3,X4)) ) ),
inference(variable_rename,[status(thm)],[82]) ).
fof(84,plain,
! [X3,X4] :
( ~ ssList(X4)
| ssList(app(X3,X4))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[83]) ).
cnf(85,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[84]) ).
fof(125,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)],[20]) ).
fof(126,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)],[125]) ).
fof(127,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ( ( ~ frontsegP(X4,X5)
| ( ssList(esk7_2(X4,X5))
& app(X5,esk7_2(X4,X5)) = X4 ) )
& ( ! [X7] :
( ~ ssList(X7)
| app(X5,X7) != X4 )
| frontsegP(X4,X5) ) ) ) ),
inference(skolemize,[status(esa)],[126]) ).
fof(128,plain,
! [X4,X5,X7] :
( ( ( ~ ssList(X7)
| app(X5,X7) != X4
| frontsegP(X4,X5) )
& ( ~ frontsegP(X4,X5)
| ( ssList(esk7_2(X4,X5))
& app(X5,esk7_2(X4,X5)) = X4 ) ) )
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(shift_quantors,[status(thm)],[127]) ).
fof(129,plain,
! [X4,X5,X7] :
( ( ~ ssList(X7)
| app(X5,X7) != X4
| frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( ssList(esk7_2(X4,X5))
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( app(X5,esk7_2(X4,X5)) = X4
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) ) ),
inference(distribute,[status(thm)],[128]) ).
cnf(130,plain,
( app(X2,esk7_2(X1,X2)) = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[129]) ).
cnf(131,plain,
( ssList(esk7_2(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[129]) ).
cnf(169,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[29]) ).
fof(206,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& frontsegP(X4,X3)
& equalelemsP(X3)
& ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| app(app(X5,X6),X7) != X2
| app(X5,X7) != X1 ) ) )
& ! [X8] :
( ~ ssList(X8)
| ~ neq(X3,X8)
| ~ frontsegP(X4,X8)
| ~ segmentP(X8,X3)
| ~ equalelemsP(X8) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[39]) ).
fof(207,negated_conjecture,
? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& X10 = X12
& X9 = X11
& frontsegP(X12,X11)
& equalelemsP(X11)
& ! [X13] :
( ~ ssList(X13)
| ! [X14] :
( ~ ssList(X14)
| ! [X15] :
( ~ ssList(X15)
| app(app(X13,X14),X15) != X10
| app(X13,X15) != X9 ) ) )
& ! [X16] :
( ~ ssList(X16)
| ~ neq(X11,X16)
| ~ frontsegP(X12,X16)
| ~ segmentP(X16,X11)
| ~ equalelemsP(X16) ) ) ) ) ),
inference(variable_rename,[status(thm)],[206]) ).
fof(208,negated_conjecture,
( ssList(esk12_0)
& ssList(esk13_0)
& ssList(esk14_0)
& ssList(esk15_0)
& esk13_0 = esk15_0
& esk12_0 = esk14_0
& frontsegP(esk15_0,esk14_0)
& equalelemsP(esk14_0)
& ! [X13] :
( ~ ssList(X13)
| ! [X14] :
( ~ ssList(X14)
| ! [X15] :
( ~ ssList(X15)
| app(app(X13,X14),X15) != esk13_0
| app(X13,X15) != esk12_0 ) ) )
& ! [X16] :
( ~ ssList(X16)
| ~ neq(esk14_0,X16)
| ~ frontsegP(esk15_0,X16)
| ~ segmentP(X16,esk14_0)
| ~ equalelemsP(X16) ) ),
inference(skolemize,[status(esa)],[207]) ).
fof(209,negated_conjecture,
! [X13,X14,X15,X16] :
( ( ~ ssList(X16)
| ~ neq(esk14_0,X16)
| ~ frontsegP(esk15_0,X16)
| ~ segmentP(X16,esk14_0)
| ~ equalelemsP(X16) )
& ( ~ ssList(X15)
| app(app(X13,X14),X15) != esk13_0
| app(X13,X15) != esk12_0
| ~ ssList(X14)
| ~ ssList(X13) )
& esk13_0 = esk15_0
& esk12_0 = esk14_0
& frontsegP(esk15_0,esk14_0)
& equalelemsP(esk14_0)
& ssList(esk15_0)
& ssList(esk14_0)
& ssList(esk13_0)
& ssList(esk12_0) ),
inference(shift_quantors,[status(thm)],[208]) ).
cnf(212,negated_conjecture,
ssList(esk14_0),
inference(split_conjunct,[status(thm)],[209]) ).
cnf(213,negated_conjecture,
ssList(esk15_0),
inference(split_conjunct,[status(thm)],[209]) ).
cnf(215,negated_conjecture,
frontsegP(esk15_0,esk14_0),
inference(split_conjunct,[status(thm)],[209]) ).
cnf(216,negated_conjecture,
esk12_0 = esk14_0,
inference(split_conjunct,[status(thm)],[209]) ).
cnf(217,negated_conjecture,
esk13_0 = esk15_0,
inference(split_conjunct,[status(thm)],[209]) ).
cnf(218,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X3) != esk12_0
| app(app(X1,X2),X3) != esk13_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[209]) ).
cnf(465,negated_conjecture,
( app(X1,X3) != esk14_0
| app(app(X1,X2),X3) != esk13_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[218,216,theory(equality)]) ).
cnf(466,negated_conjecture,
( app(X1,X3) != esk14_0
| app(app(X1,X2),X3) != esk15_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[465,217,theory(equality)]) ).
cnf(468,negated_conjecture,
( app(X1,X2) != esk15_0
| app(X1,nil) != esk14_0
| ~ ssList(nil)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(spm,[status(thm)],[466,43,theory(equality)]) ).
cnf(481,negated_conjecture,
( app(X1,X2) != esk15_0
| app(X1,nil) != esk14_0
| $false
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(rw,[status(thm)],[468,169,theory(equality)]) ).
cnf(482,negated_conjecture,
( app(X1,X2) != esk15_0
| app(X1,nil) != esk14_0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(cn,[status(thm)],[481,theory(equality)]) ).
cnf(807,negated_conjecture,
( app(X1,nil) != esk14_0
| app(X1,X2) != esk15_0
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[482,85]) ).
cnf(808,negated_conjecture,
( X1 != esk14_0
| app(X1,X2) != esk15_0
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[807,43,theory(equality)]) ).
cnf(868,negated_conjecture,
( X2 != esk15_0
| X1 != esk14_0
| ~ ssList(esk7_2(X2,X1))
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[808,130,theory(equality)]) ).
cnf(896,negated_conjecture,
( X2 != esk15_0
| X1 != esk14_0
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[868,131]) ).
cnf(897,negated_conjecture,
( ~ ssList(esk14_0)
| ~ ssList(esk15_0) ),
inference(spm,[status(thm)],[896,215,theory(equality)]) ).
cnf(906,negated_conjecture,
( $false
| ~ ssList(esk15_0) ),
inference(rw,[status(thm)],[897,212,theory(equality)]) ).
cnf(907,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[906,213,theory(equality)]) ).
cnf(908,negated_conjecture,
$false,
inference(cn,[status(thm)],[907,theory(equality)]) ).
cnf(909,negated_conjecture,
$false,
908,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC008+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpqBrGqf/sel_SWC008+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC008+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC008+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC008+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
%
%------------------------------------------------------------------------------