TSTP Solution File: SWC006+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC006+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 10:04:11 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of formulae : 25 ( 12 unt; 0 def)
% Number of atoms : 148 ( 55 equ)
% Maximal formula atoms : 16 ( 5 avg)
% Number of connectives : 185 ( 62 ~; 52 |; 56 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 33 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(17,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1 ) ) )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ~ ssList(X10)
| app(app(X8,X9),X10) != X4
| app(X8,X10) != X3 ) ) ) ) ) ) ),
file('/tmp/tmpDOzlG3/sel_SWC006+1.p_1',co1) ).
fof(18,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1 ) ) )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ~ ssList(X10)
| app(app(X8,X9),X10) != X4
| app(X8,X10) != X3 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[17]) ).
fof(19,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1 ) ) )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ~ ssList(X10)
| app(app(X8,X9),X10) != X4
| app(X8,X10) != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[18,theory(equality)]) ).
fof(88,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| app(app(X5,X6),X7) != X2
| app(X5,X7) != X1 ) ) )
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& app(app(X8,X9),X10) = X4
& app(X8,X10) = X3 ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(89,negated_conjecture,
? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& ? [X13] :
( ssList(X13)
& ? [X14] :
( ssList(X14)
& X12 = X14
& X11 = X13
& ! [X15] :
( ~ ssList(X15)
| ! [X16] :
( ~ ssList(X16)
| ! [X17] :
( ~ ssList(X17)
| app(app(X15,X16),X17) != X12
| app(X15,X17) != X11 ) ) )
& ? [X18] :
( ssList(X18)
& ? [X19] :
( ssList(X19)
& ? [X20] :
( ssList(X20)
& app(app(X18,X19),X20) = X14
& app(X18,X20) = X13 ) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[88]) ).
fof(90,negated_conjecture,
( ssList(esk5_0)
& ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& ! [X15] :
( ~ ssList(X15)
| ! [X16] :
( ~ ssList(X16)
| ! [X17] :
( ~ ssList(X17)
| app(app(X15,X16),X17) != esk6_0
| app(X15,X17) != esk5_0 ) ) )
& ssList(esk9_0)
& ssList(esk10_0)
& ssList(esk11_0)
& app(app(esk9_0,esk10_0),esk11_0) = esk8_0
& app(esk9_0,esk11_0) = esk7_0 ),
inference(skolemize,[status(esa)],[89]) ).
fof(91,negated_conjecture,
! [X15,X16,X17] :
( ( ~ ssList(X17)
| app(app(X15,X16),X17) != esk6_0
| app(X15,X17) != esk5_0
| ~ ssList(X16)
| ~ ssList(X15) )
& ssList(esk8_0)
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& ssList(esk9_0)
& ssList(esk10_0)
& ssList(esk11_0)
& app(app(esk9_0,esk10_0),esk11_0) = esk8_0
& app(esk9_0,esk11_0) = esk7_0
& ssList(esk7_0)
& ssList(esk6_0)
& ssList(esk5_0) ),
inference(shift_quantors,[status(thm)],[90]) ).
cnf(95,negated_conjecture,
app(esk9_0,esk11_0) = esk7_0,
inference(split_conjunct,[status(thm)],[91]) ).
cnf(96,negated_conjecture,
app(app(esk9_0,esk10_0),esk11_0) = esk8_0,
inference(split_conjunct,[status(thm)],[91]) ).
cnf(97,negated_conjecture,
ssList(esk11_0),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(98,negated_conjecture,
ssList(esk10_0),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(99,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(100,negated_conjecture,
esk5_0 = esk7_0,
inference(split_conjunct,[status(thm)],[91]) ).
cnf(101,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[91]) ).
cnf(103,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X3) != esk5_0
| app(app(X1,X2),X3) != esk6_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(107,negated_conjecture,
app(esk9_0,esk11_0) = esk5_0,
inference(rw,[status(thm)],[95,100,theory(equality)]) ).
cnf(233,negated_conjecture,
( app(X1,X3) != esk5_0
| app(app(X1,X2),X3) != esk8_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[103,101,theory(equality)]) ).
cnf(234,negated_conjecture,
( app(app(esk9_0,X1),esk11_0) != esk8_0
| ~ ssList(esk11_0)
| ~ ssList(X1)
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[233,107,theory(equality)]) ).
cnf(239,negated_conjecture,
( app(app(esk9_0,X1),esk11_0) != esk8_0
| $false
| ~ ssList(X1)
| ~ ssList(esk9_0) ),
inference(rw,[status(thm)],[234,97,theory(equality)]) ).
cnf(240,negated_conjecture,
( app(app(esk9_0,X1),esk11_0) != esk8_0
| $false
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[239,99,theory(equality)]) ).
cnf(241,negated_conjecture,
( app(app(esk9_0,X1),esk11_0) != esk8_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[240,theory(equality)]) ).
cnf(287,negated_conjecture,
~ ssList(esk10_0),
inference(spm,[status(thm)],[241,96,theory(equality)]) ).
cnf(292,negated_conjecture,
$false,
inference(rw,[status(thm)],[287,98,theory(equality)]) ).
cnf(293,negated_conjecture,
$false,
inference(cn,[status(thm)],[292,theory(equality)]) ).
cnf(294,negated_conjecture,
$false,
293,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC006+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpDOzlG3/sel_SWC006+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC006+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC006+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC006+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
%
%------------------------------------------------------------------------------