%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC185+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:41:18 EST 2010
% Result : Theorem 0.30s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 1
% Syntax : Number of formulae : 31 ( 11 unt; 0 def)
% Number of atoms : 200 ( 38 equ)
% Maximal formula atoms : 22 ( 6 avg)
% Number of connectives : 258 ( 89 ~; 73 |; 75 &)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn 36 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(21,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X3
& ( memberP(X6,X5)
| memberP(X7,X5) ) ) ) )
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(X9,cons(X8,nil)),X10) != X1
| ( ~ memberP(X9,X8)
& ~ memberP(X10,X8) ) ) ) ) ) ) ) ) ) ),
file('/tmp/tmp3arb4F/sel_SWC185+1.p_1',co1) ).
fof(22,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X3
& ( memberP(X6,X5)
| memberP(X7,X5) ) ) ) )
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(X9,cons(X8,nil)),X10) != X1
| ( ~ memberP(X9,X8)
& ~ memberP(X10,X8) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[21]) ).
fof(24,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X3
& ( memberP(X6,X5)
| memberP(X7,X5) ) ) ) )
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(X9,cons(X8,nil)),X10) != X1
| ( ~ memberP(X9,X8)
& ~ memberP(X10,X8) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[22,theory(equality)]) ).
fof(119,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X3
| ( ~ memberP(X6,X5)
& ~ memberP(X7,X5) ) ) ) )
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& app(app(X9,cons(X8,nil)),X10) = X1
& ( memberP(X9,X8)
| memberP(X10,X8) ) ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(120,negated_conjecture,
? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& ? [X13] :
( ssList(X13)
& ? [X14] :
( ssList(X14)
& X12 = X14
& X11 = X13
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| ! [X17] :
( ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != X13
| ( ~ memberP(X16,X15)
& ~ memberP(X17,X15) ) ) ) )
& ? [X18] :
( ssItem(X18)
& ? [X19] :
( ssList(X19)
& ? [X20] :
( ssList(X20)
& app(app(X19,cons(X18,nil)),X20) = X11
& ( memberP(X19,X18)
| memberP(X20,X18) ) ) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[119]) ).
fof(121,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| ! [X17] :
( ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk9_0
| ( ~ memberP(X16,X15)
& ~ memberP(X17,X15) ) ) ) )
& ssItem(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& app(app(esk12_0,cons(esk11_0,nil)),esk13_0) = esk7_0
& ( memberP(esk12_0,esk11_0)
| memberP(esk13_0,esk11_0) ) ),
inference(skolemize,[status(esa)],[120]) ).
fof(122,negated_conjecture,
! [X15,X16,X17] :
( ( ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk9_0
| ( ~ memberP(X16,X15)
& ~ memberP(X17,X15) )
| ~ ssList(X16)
| ~ ssItem(X15) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssItem(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& app(app(esk12_0,cons(esk11_0,nil)),esk13_0) = esk7_0
& ( memberP(esk12_0,esk11_0)
| memberP(esk13_0,esk11_0) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[121]) ).
fof(123,negated_conjecture,
! [X15,X16,X17] :
( ( ~ memberP(X16,X15)
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk9_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( ~ memberP(X17,X15)
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk9_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssItem(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& app(app(esk12_0,cons(esk11_0,nil)),esk13_0) = esk7_0
& ( memberP(esk12_0,esk11_0)
| memberP(esk13_0,esk11_0) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(distribute,[status(thm)],[122]) ).
cnf(128,negated_conjecture,
( memberP(esk13_0,esk11_0)
| memberP(esk12_0,esk11_0) ),
inference(split_conjunct,[status(thm)],[123]) ).
cnf(129,negated_conjecture,
app(app(esk12_0,cons(esk11_0,nil)),esk13_0) = esk7_0,
inference(split_conjunct,[status(thm)],[123]) ).
cnf(130,negated_conjecture,
ssList(esk13_0),
inference(split_conjunct,[status(thm)],[123]) ).
cnf(131,negated_conjecture,
ssList(esk12_0),
inference(split_conjunct,[status(thm)],[123]) ).
cnf(132,negated_conjecture,
ssItem(esk11_0),
inference(split_conjunct,[status(thm)],[123]) ).
cnf(133,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[123]) ).
cnf(135,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk9_0
| ~ ssList(X3)
| ~ memberP(X3,X1) ),
inference(split_conjunct,[status(thm)],[123]) ).
cnf(136,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk9_0
| ~ ssList(X3)
| ~ memberP(X2,X1) ),
inference(split_conjunct,[status(thm)],[123]) ).
cnf(139,negated_conjecture,
app(app(esk12_0,cons(esk11_0,nil)),esk13_0) = esk9_0,
inference(rw,[status(thm)],[129,133,theory(equality)]) ).
cnf(279,negated_conjecture,
( ~ memberP(esk13_0,esk11_0)
| ~ ssList(esk13_0)
| ~ ssList(esk12_0)
| ~ ssItem(esk11_0) ),
inference(spm,[status(thm)],[135,139,theory(equality)]) ).
cnf(285,negated_conjecture,
( ~ memberP(esk13_0,esk11_0)
| ~ ssList(esk13_0)
| ~ ssList(esk12_0)
| $false ),
inference(rw,[status(thm)],[279,132,theory(equality)]) ).
cnf(286,negated_conjecture,
( ~ memberP(esk13_0,esk11_0)
| ~ ssList(esk13_0)
| ~ ssList(esk12_0) ),
inference(cn,[status(thm)],[285,theory(equality)]) ).
cnf(291,negated_conjecture,
( ~ memberP(esk12_0,esk11_0)
| ~ ssList(esk13_0)
| ~ ssList(esk12_0)
| ~ ssItem(esk11_0) ),
inference(spm,[status(thm)],[136,139,theory(equality)]) ).
cnf(297,negated_conjecture,
( ~ memberP(esk12_0,esk11_0)
| ~ ssList(esk13_0)
| ~ ssList(esk12_0)
| $false ),
inference(rw,[status(thm)],[291,132,theory(equality)]) ).
cnf(298,negated_conjecture,
( ~ memberP(esk12_0,esk11_0)
| ~ ssList(esk13_0)
| ~ ssList(esk12_0) ),
inference(cn,[status(thm)],[297,theory(equality)]) ).
cnf(303,negated_conjecture,
( ~ memberP(esk13_0,esk11_0)
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[286,130,theory(equality)]) ).
cnf(308,negated_conjecture,
~ memberP(esk13_0,esk11_0),
inference(spm,[status(thm)],[303,131,theory(equality)]) ).
cnf(309,negated_conjecture,
memberP(esk12_0,esk11_0),
inference(sr,[status(thm)],[128,308,theory(equality)]) ).
cnf(328,negated_conjecture,
( $false
| ~ ssList(esk13_0)
| ~ ssList(esk12_0) ),
inference(rw,[status(thm)],[298,309,theory(equality)]) ).
cnf(329,negated_conjecture,
( ~ ssList(esk13_0)
| ~ ssList(esk12_0) ),
inference(cn,[status(thm)],[328,theory(equality)]) ).
cnf(334,negated_conjecture,
~ ssList(esk12_0),
inference(spm,[status(thm)],[329,130,theory(equality)]) ).
cnf(335,negated_conjecture,
$false,
inference(sr,[status(thm)],[131,334,theory(equality)]) ).
cnf(336,negated_conjecture,
$false,
335,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC185+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp3arb4F/sel_SWC185+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC185+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC185+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC185+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
%
%------------------------------------------------------------------------------