TSTP Solution File: SWC189+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC189+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:42:27 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 1
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 150 ( 47 equ)
% Maximal formula atoms : 18 ( 6 avg)
% Number of connectives : 185 ( 58 ~; 53 |; 58 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn 32 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(17,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& X5 != X6
& app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) = X3 ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ! [X12] :
( ssList(X12)
=> ( app(app(app(X11,cons(X9,nil)),cons(X10,nil)),X12) != X1
| X9 = X10 ) ) ) ) ) ) ) ) ) ),
file('/tmp/tmp9ay56W/sel_SWC189+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] :
( ssItem(X5)
& ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& X5 != X6
& app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) = X3 ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ! [X12] :
( ssList(X12)
=> ( app(app(app(X11,cons(X9,nil)),cons(X10,nil)),X12) != X1
| X9 = X10 ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[17]) ).
fof(87,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ~ ssList(X8)
| X5 = X6
| app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X3 ) ) ) )
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& app(app(app(X11,cons(X9,nil)),cons(X10,nil)),X12) = X1
& X9 != X10 ) ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(88,negated_conjecture,
? [X13] :
( ssList(X13)
& ? [X14] :
( ssList(X14)
& ? [X15] :
( ssList(X15)
& ? [X16] :
( ssList(X16)
& X14 = X16
& X13 = X15
& ! [X17] :
( ~ ssItem(X17)
| ! [X18] :
( ~ ssItem(X18)
| ! [X19] :
( ~ ssList(X19)
| ! [X20] :
( ~ ssList(X20)
| X17 = X18
| app(app(app(X19,cons(X17,nil)),cons(X18,nil)),X20) != X15 ) ) ) )
& ? [X21] :
( ssItem(X21)
& ? [X22] :
( ssItem(X22)
& ? [X23] :
( ssList(X23)
& ? [X24] :
( ssList(X24)
& app(app(app(X23,cons(X21,nil)),cons(X22,nil)),X24) = X13
& X21 != X22 ) ) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[87]) ).
fof(89,negated_conjecture,
( ssList(esk5_0)
& ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& ! [X17] :
( ~ ssItem(X17)
| ! [X18] :
( ~ ssItem(X18)
| ! [X19] :
( ~ ssList(X19)
| ! [X20] :
( ~ ssList(X20)
| X17 = X18
| app(app(app(X19,cons(X17,nil)),cons(X18,nil)),X20) != esk7_0 ) ) ) )
& ssItem(esk9_0)
& ssItem(esk10_0)
& ssList(esk11_0)
& ssList(esk12_0)
& app(app(app(esk11_0,cons(esk9_0,nil)),cons(esk10_0,nil)),esk12_0) = esk5_0
& esk9_0 != esk10_0 ),
inference(skolemize,[status(esa)],[88]) ).
fof(90,negated_conjecture,
! [X17,X18,X19,X20] :
( ( ~ ssList(X20)
| X17 = X18
| app(app(app(X19,cons(X17,nil)),cons(X18,nil)),X20) != esk7_0
| ~ ssList(X19)
| ~ ssItem(X18)
| ~ ssItem(X17) )
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& ssItem(esk9_0)
& ssItem(esk10_0)
& ssList(esk11_0)
& ssList(esk12_0)
& app(app(app(esk11_0,cons(esk9_0,nil)),cons(esk10_0,nil)),esk12_0) = esk5_0
& esk9_0 != esk10_0
& ssList(esk8_0)
& ssList(esk7_0)
& ssList(esk6_0)
& ssList(esk5_0) ),
inference(shift_quantors,[status(thm)],[89]) ).
cnf(95,negated_conjecture,
esk9_0 != esk10_0,
inference(split_conjunct,[status(thm)],[90]) ).
cnf(96,negated_conjecture,
app(app(app(esk11_0,cons(esk9_0,nil)),cons(esk10_0,nil)),esk12_0) = esk5_0,
inference(split_conjunct,[status(thm)],[90]) ).
cnf(97,negated_conjecture,
ssList(esk12_0),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(98,negated_conjecture,
ssList(esk11_0),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(99,negated_conjecture,
ssItem(esk10_0),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(100,negated_conjecture,
ssItem(esk9_0),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(101,negated_conjecture,
esk5_0 = esk7_0,
inference(split_conjunct,[status(thm)],[90]) ).
cnf(103,negated_conjecture,
( X1 = X2
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(app(X3,cons(X1,nil)),cons(X2,nil)),X4) != esk7_0
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(210,negated_conjecture,
( X1 = X2
| app(app(app(X3,cons(X1,nil)),cons(X2,nil)),X4) != esk5_0
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(rw,[status(thm)],[103,101,theory(equality)]) ).
cnf(211,negated_conjecture,
( esk9_0 = esk10_0
| ~ ssList(esk12_0)
| ~ ssList(esk11_0)
| ~ ssItem(esk10_0)
| ~ ssItem(esk9_0) ),
inference(spm,[status(thm)],[210,96,theory(equality)]) ).
cnf(218,negated_conjecture,
( esk9_0 = esk10_0
| ~ ssList(esk12_0)
| ~ ssList(esk11_0)
| $false
| ~ ssItem(esk9_0) ),
inference(rw,[status(thm)],[211,99,theory(equality)]) ).
cnf(219,negated_conjecture,
( esk9_0 = esk10_0
| ~ ssList(esk12_0)
| ~ ssList(esk11_0)
| $false
| $false ),
inference(rw,[status(thm)],[218,100,theory(equality)]) ).
cnf(220,negated_conjecture,
( esk9_0 = esk10_0
| ~ ssList(esk12_0)
| ~ ssList(esk11_0) ),
inference(cn,[status(thm)],[219,theory(equality)]) ).
cnf(221,negated_conjecture,
( ~ ssList(esk12_0)
| ~ ssList(esk11_0) ),
inference(sr,[status(thm)],[220,95,theory(equality)]) ).
cnf(226,negated_conjecture,
~ ssList(esk11_0),
inference(spm,[status(thm)],[221,97,theory(equality)]) ).
cnf(227,negated_conjecture,
$false,
inference(sr,[status(thm)],[98,226,theory(equality)]) ).
cnf(228,negated_conjecture,
$false,
227,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC189+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp9ay56W/sel_SWC189+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC189+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC189+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC189+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
%
%------------------------------------------------------------------------------