TSTP Solution File: SWC408+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC408+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:44:40 EST 2010
% Result : Theorem 0.33s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 2
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 144 ( 22 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 174 ( 60 ~; 60 |; 35 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 30 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(14,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/tmp/tmpSkLt0k/sel_SWC408+1.p_1',ax36) ).
fof(21,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( app(X4,X4) != X3
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X2,X5)
| memberP(X1,X5) ) ) ) ) ) ) ),
file('/tmp/tmpSkLt0k/sel_SWC408+1.p_1',co1) ).
fof(22,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( app(X4,X4) != X3
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X2,X5)
| memberP(X1,X5) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[21]) ).
fof(24,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( app(X4,X4) != X3
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X2,X5)
| memberP(X1,X5) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[22,theory(equality)]) ).
fof(84,plain,
! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| ( ( ~ memberP(app(X2,X3),X1)
| memberP(X2,X1)
| memberP(X3,X1) )
& ( ( ~ memberP(X2,X1)
& ~ memberP(X3,X1) )
| memberP(app(X2,X3),X1) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(85,plain,
! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ memberP(app(X5,X6),X4)
| memberP(X5,X4)
| memberP(X6,X4) )
& ( ( ~ memberP(X5,X4)
& ~ memberP(X6,X4) )
| memberP(app(X5,X6),X4) ) ) ) ) ),
inference(variable_rename,[status(thm)],[84]) ).
fof(86,plain,
! [X4,X5,X6] :
( ~ ssList(X6)
| ( ( ~ memberP(app(X5,X6),X4)
| memberP(X5,X4)
| memberP(X6,X4) )
& ( ( ~ memberP(X5,X4)
& ~ memberP(X6,X4) )
| memberP(app(X5,X6),X4) ) )
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(shift_quantors,[status(thm)],[85]) ).
fof(87,plain,
! [X4,X5,X6] :
( ( ~ memberP(app(X5,X6),X4)
| memberP(X5,X4)
| memberP(X6,X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X5,X4)
| memberP(app(X5,X6),X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X6,X4)
| memberP(app(X5,X6),X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ) ),
inference(distribute,[status(thm)],[86]) ).
cnf(88,plain,
( memberP(app(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(X3,X1) ),
inference(split_conjunct,[status(thm)],[87]) ).
fof(119,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X4,X4) = X3
& X2 = X4
& X1 = X3
& ? [X5] :
( ssItem(X5)
& memberP(X2,X5)
& ~ memberP(X1,X5) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(120,negated_conjecture,
? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& app(X9,X9) = X8
& X7 = X9
& X6 = X8
& ? [X10] :
( ssItem(X10)
& memberP(X7,X10)
& ~ memberP(X6,X10) ) ) ) ) ),
inference(variable_rename,[status(thm)],[119]) ).
fof(121,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& app(esk10_0,esk10_0) = esk9_0
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssItem(esk11_0)
& memberP(esk8_0,esk11_0)
& ~ memberP(esk7_0,esk11_0) ),
inference(skolemize,[status(esa)],[120]) ).
cnf(122,negated_conjecture,
~ memberP(esk7_0,esk11_0),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(123,negated_conjecture,
memberP(esk8_0,esk11_0),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(124,negated_conjecture,
ssItem(esk11_0),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(125,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[121]) ).
cnf(126,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[121]) ).
cnf(127,negated_conjecture,
app(esk10_0,esk10_0) = esk9_0,
inference(split_conjunct,[status(thm)],[121]) ).
cnf(128,negated_conjecture,
ssList(esk10_0),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(135,negated_conjecture,
memberP(esk10_0,esk11_0),
inference(rw,[status(thm)],[123,126,theory(equality)]) ).
cnf(136,negated_conjecture,
app(esk10_0,esk10_0) = esk7_0,
inference(rw,[status(thm)],[127,125,theory(equality)]) ).
cnf(170,negated_conjecture,
( memberP(app(X1,esk10_0),esk11_0)
| ~ ssList(esk10_0)
| ~ ssList(X1)
| ~ ssItem(esk11_0) ),
inference(spm,[status(thm)],[88,135,theory(equality)]) ).
cnf(171,negated_conjecture,
( memberP(app(X1,esk10_0),esk11_0)
| $false
| ~ ssList(X1)
| ~ ssItem(esk11_0) ),
inference(rw,[status(thm)],[170,128,theory(equality)]) ).
cnf(172,negated_conjecture,
( memberP(app(X1,esk10_0),esk11_0)
| $false
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[171,124,theory(equality)]) ).
cnf(173,negated_conjecture,
( memberP(app(X1,esk10_0),esk11_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[172,theory(equality)]) ).
cnf(359,negated_conjecture,
( memberP(esk7_0,esk11_0)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[173,136,theory(equality)]) ).
cnf(370,negated_conjecture,
( memberP(esk7_0,esk11_0)
| $false ),
inference(rw,[status(thm)],[359,128,theory(equality)]) ).
cnf(371,negated_conjecture,
memberP(esk7_0,esk11_0),
inference(cn,[status(thm)],[370,theory(equality)]) ).
cnf(372,negated_conjecture,
$false,
inference(sr,[status(thm)],[371,122,theory(equality)]) ).
cnf(373,negated_conjecture,
$false,
372,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC408+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpSkLt0k/sel_SWC408+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC408+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC408+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC408+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
%
%------------------------------------------------------------------------------