TSTP Solution File: COM021+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : COM021+1 : TPTP v5.0.0. Released v4.0.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 : Sat Dec 25 05:48:58 EST 2010
% Result : Theorem 2.36s
% Output : CNFRefutation 2.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 16 unt; 0 def)
% Number of atoms : 289 ( 17 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 414 ( 174 ~; 180 |; 54 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 101 ( 1 sgn 58 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
aNormalFormOfIn0(xd,xw,xR),
file('/tmp/tmpD-IB2R/sel_COM021+1.p_1',m__818) ).
fof(5,axiom,
( aElement0(xx)
& sdtmndtasgtdt0(xb,xR,xx)
& sdtmndtasgtdt0(xd,xR,xx) ),
file('/tmp/tmpD-IB2R/sel_COM021+1.p_1',m__850) ).
fof(6,axiom,
( aElement0(xw)
& sdtmndtasgtdt0(xu,xR,xw)
& sdtmndtasgtdt0(xv,xR,xw) ),
file('/tmp/tmpD-IB2R/sel_COM021+1.p_1',m__799) ).
fof(7,axiom,
aRewritingSystem0(xR),
file('/tmp/tmpD-IB2R/sel_COM021+1.p_1',m__656) ).
fof(10,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3) )
=> ( sdtmndtasgtdt0(X1,X2,X3)
<=> ( X1 = X3
| sdtmndtplgtdt0(X1,X2,X3) ) ) ),
file('/tmp/tmpD-IB2R/sel_COM021+1.p_1',mTCRDef) ).
fof(14,conjecture,
sdtmndtasgtdt0(xb,xR,xd),
file('/tmp/tmpD-IB2R/sel_COM021+1.p_1',m__) ).
fof(19,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aRewritingSystem0(X2) )
=> ! [X3] :
( aNormalFormOfIn0(X3,X1,X2)
<=> ( aElement0(X3)
& sdtmndtasgtdt0(X1,X2,X3)
& ~ ? [X4] : aReductOfIn0(X4,X3,X2) ) ) ),
file('/tmp/tmpD-IB2R/sel_COM021+1.p_1',mNFRDef) ).
fof(20,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3) )
=> ( sdtmndtplgtdt0(X1,X2,X3)
<=> ( aReductOfIn0(X3,X1,X2)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,X2)
& sdtmndtplgtdt0(X4,X2,X3) ) ) ) ),
file('/tmp/tmpD-IB2R/sel_COM021+1.p_1',mTCDef) ).
fof(26,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(assume_negation,[status(cth)],[14]) ).
fof(27,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(fof_simplification,[status(thm)],[26,theory(equality)]) ).
cnf(52,plain,
aNormalFormOfIn0(xd,xw,xR),
inference(split_conjunct,[status(thm)],[4]) ).
cnf(53,plain,
sdtmndtasgtdt0(xd,xR,xx),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(54,plain,
sdtmndtasgtdt0(xb,xR,xx),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(55,plain,
aElement0(xx),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(58,plain,
aElement0(xw),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(59,plain,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[7]) ).
fof(69,plain,
! [X1,X2,X3] :
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ( ( ~ sdtmndtasgtdt0(X1,X2,X3)
| X1 = X3
| sdtmndtplgtdt0(X1,X2,X3) )
& ( ( X1 != X3
& ~ sdtmndtplgtdt0(X1,X2,X3) )
| sdtmndtasgtdt0(X1,X2,X3) ) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(70,plain,
! [X4,X5,X6] :
( ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aElement0(X6)
| ( ( ~ sdtmndtasgtdt0(X4,X5,X6)
| X4 = X6
| sdtmndtplgtdt0(X4,X5,X6) )
& ( ( X4 != X6
& ~ sdtmndtplgtdt0(X4,X5,X6) )
| sdtmndtasgtdt0(X4,X5,X6) ) ) ),
inference(variable_rename,[status(thm)],[69]) ).
fof(71,plain,
! [X4,X5,X6] :
( ( ~ sdtmndtasgtdt0(X4,X5,X6)
| X4 = X6
| sdtmndtplgtdt0(X4,X5,X6)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aElement0(X6) )
& ( X4 != X6
| sdtmndtasgtdt0(X4,X5,X6)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aElement0(X6) )
& ( ~ sdtmndtplgtdt0(X4,X5,X6)
| sdtmndtasgtdt0(X4,X5,X6)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aElement0(X6) ) ),
inference(distribute,[status(thm)],[70]) ).
cnf(74,plain,
( sdtmndtplgtdt0(X3,X2,X1)
| X3 = X1
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtasgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[71]) ).
cnf(94,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(split_conjunct,[status(thm)],[27]) ).
fof(107,plain,
! [X1,X2] :
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ! [X3] :
( ( ~ aNormalFormOfIn0(X3,X1,X2)
| ( aElement0(X3)
& sdtmndtasgtdt0(X1,X2,X3)
& ! [X4] : ~ aReductOfIn0(X4,X3,X2) ) )
& ( ~ aElement0(X3)
| ~ sdtmndtasgtdt0(X1,X2,X3)
| ? [X4] : aReductOfIn0(X4,X3,X2)
| aNormalFormOfIn0(X3,X1,X2) ) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(108,plain,
! [X5,X6] :
( ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ! [X7] :
( ( ~ aNormalFormOfIn0(X7,X5,X6)
| ( aElement0(X7)
& sdtmndtasgtdt0(X5,X6,X7)
& ! [X8] : ~ aReductOfIn0(X8,X7,X6) ) )
& ( ~ aElement0(X7)
| ~ sdtmndtasgtdt0(X5,X6,X7)
| ? [X9] : aReductOfIn0(X9,X7,X6)
| aNormalFormOfIn0(X7,X5,X6) ) ) ),
inference(variable_rename,[status(thm)],[107]) ).
fof(109,plain,
! [X5,X6] :
( ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ! [X7] :
( ( ~ aNormalFormOfIn0(X7,X5,X6)
| ( aElement0(X7)
& sdtmndtasgtdt0(X5,X6,X7)
& ! [X8] : ~ aReductOfIn0(X8,X7,X6) ) )
& ( ~ aElement0(X7)
| ~ sdtmndtasgtdt0(X5,X6,X7)
| aReductOfIn0(esk11_3(X5,X6,X7),X7,X6)
| aNormalFormOfIn0(X7,X5,X6) ) ) ),
inference(skolemize,[status(esa)],[108]) ).
fof(110,plain,
! [X5,X6,X7,X8] :
( ( ( ( ~ aReductOfIn0(X8,X7,X6)
& aElement0(X7)
& sdtmndtasgtdt0(X5,X6,X7) )
| ~ aNormalFormOfIn0(X7,X5,X6) )
& ( ~ aElement0(X7)
| ~ sdtmndtasgtdt0(X5,X6,X7)
| aReductOfIn0(esk11_3(X5,X6,X7),X7,X6)
| aNormalFormOfIn0(X7,X5,X6) ) )
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6) ),
inference(shift_quantors,[status(thm)],[109]) ).
fof(111,plain,
! [X5,X6,X7,X8] :
( ( ~ aReductOfIn0(X8,X7,X6)
| ~ aNormalFormOfIn0(X7,X5,X6)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6) )
& ( aElement0(X7)
| ~ aNormalFormOfIn0(X7,X5,X6)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6) )
& ( sdtmndtasgtdt0(X5,X6,X7)
| ~ aNormalFormOfIn0(X7,X5,X6)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6) )
& ( ~ aElement0(X7)
| ~ sdtmndtasgtdt0(X5,X6,X7)
| aReductOfIn0(esk11_3(X5,X6,X7),X7,X6)
| aNormalFormOfIn0(X7,X5,X6)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6) ) ),
inference(distribute,[status(thm)],[110]) ).
cnf(114,plain,
( aElement0(X3)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[111]) ).
cnf(115,plain,
( ~ aRewritingSystem0(X1)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X3,X2,X1)
| ~ aReductOfIn0(X4,X3,X1) ),
inference(split_conjunct,[status(thm)],[111]) ).
fof(116,plain,
! [X1,X2,X3] :
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ( ( ~ sdtmndtplgtdt0(X1,X2,X3)
| aReductOfIn0(X3,X1,X2)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,X2)
& sdtmndtplgtdt0(X4,X2,X3) ) )
& ( ( ~ aReductOfIn0(X3,X1,X2)
& ! [X4] :
( ~ aElement0(X4)
| ~ aReductOfIn0(X4,X1,X2)
| ~ sdtmndtplgtdt0(X4,X2,X3) ) )
| sdtmndtplgtdt0(X1,X2,X3) ) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(117,plain,
! [X5,X6,X7] :
( ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7)
| ( ( ~ sdtmndtplgtdt0(X5,X6,X7)
| aReductOfIn0(X7,X5,X6)
| ? [X8] :
( aElement0(X8)
& aReductOfIn0(X8,X5,X6)
& sdtmndtplgtdt0(X8,X6,X7) ) )
& ( ( ~ aReductOfIn0(X7,X5,X6)
& ! [X9] :
( ~ aElement0(X9)
| ~ aReductOfIn0(X9,X5,X6)
| ~ sdtmndtplgtdt0(X9,X6,X7) ) )
| sdtmndtplgtdt0(X5,X6,X7) ) ) ),
inference(variable_rename,[status(thm)],[116]) ).
fof(118,plain,
! [X5,X6,X7] :
( ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7)
| ( ( ~ sdtmndtplgtdt0(X5,X6,X7)
| aReductOfIn0(X7,X5,X6)
| ( aElement0(esk12_3(X5,X6,X7))
& aReductOfIn0(esk12_3(X5,X6,X7),X5,X6)
& sdtmndtplgtdt0(esk12_3(X5,X6,X7),X6,X7) ) )
& ( ( ~ aReductOfIn0(X7,X5,X6)
& ! [X9] :
( ~ aElement0(X9)
| ~ aReductOfIn0(X9,X5,X6)
| ~ sdtmndtplgtdt0(X9,X6,X7) ) )
| sdtmndtplgtdt0(X5,X6,X7) ) ) ),
inference(skolemize,[status(esa)],[117]) ).
fof(119,plain,
! [X5,X6,X7,X9] :
( ( ( ( ( ~ aElement0(X9)
| ~ aReductOfIn0(X9,X5,X6)
| ~ sdtmndtplgtdt0(X9,X6,X7) )
& ~ aReductOfIn0(X7,X5,X6) )
| sdtmndtplgtdt0(X5,X6,X7) )
& ( ~ sdtmndtplgtdt0(X5,X6,X7)
| aReductOfIn0(X7,X5,X6)
| ( aElement0(esk12_3(X5,X6,X7))
& aReductOfIn0(esk12_3(X5,X6,X7),X5,X6)
& sdtmndtplgtdt0(esk12_3(X5,X6,X7),X6,X7) ) ) )
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) ),
inference(shift_quantors,[status(thm)],[118]) ).
fof(120,plain,
! [X5,X6,X7,X9] :
( ( ~ aElement0(X9)
| ~ aReductOfIn0(X9,X5,X6)
| ~ sdtmndtplgtdt0(X9,X6,X7)
| sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( ~ aReductOfIn0(X7,X5,X6)
| sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( aElement0(esk12_3(X5,X6,X7))
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( aReductOfIn0(esk12_3(X5,X6,X7),X5,X6)
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( sdtmndtplgtdt0(esk12_3(X5,X6,X7),X6,X7)
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) ) ),
inference(distribute,[status(thm)],[119]) ).
cnf(122,plain,
( aReductOfIn0(X1,X3,X2)
| aReductOfIn0(esk12_3(X3,X2,X1),X3,X2)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[120]) ).
cnf(286,plain,
( aReductOfIn0(X3,X1,X2)
| ~ aNormalFormOfIn0(X1,X4,X2)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X2)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| ~ aElement0(X1)
| ~ aElement0(X3) ),
inference(spm,[status(thm)],[115,122,theory(equality)]) ).
cnf(3167,plain,
( aReductOfIn0(X3,X1,X2)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| ~ aNormalFormOfIn0(X1,X4,X2)
| ~ aElement0(X3)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X2) ),
inference(csr,[status(thm)],[286,114]) ).
cnf(3168,plain,
( ~ sdtmndtplgtdt0(X1,X2,X3)
| ~ aNormalFormOfIn0(X1,X4,X2)
| ~ aElement0(X4)
| ~ aElement0(X3)
| ~ aRewritingSystem0(X2) ),
inference(csr,[status(thm)],[3167,115]) ).
cnf(3173,plain,
( X3 = X1
| ~ aNormalFormOfIn0(X1,X4,X2)
| ~ aElement0(X4)
| ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[3168,74,theory(equality)]) ).
cnf(44680,plain,
( X3 = X1
| ~ aNormalFormOfIn0(X1,X4,X2)
| ~ sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X4)
| ~ aElement0(X3)
| ~ aRewritingSystem0(X2) ),
inference(csr,[status(thm)],[3173,114]) ).
cnf(44681,plain,
( X1 = xd
| ~ sdtmndtasgtdt0(xd,xR,X1)
| ~ aElement0(xw)
| ~ aElement0(X1)
| ~ aRewritingSystem0(xR) ),
inference(spm,[status(thm)],[44680,52,theory(equality)]) ).
cnf(44689,plain,
( X1 = xd
| ~ sdtmndtasgtdt0(xd,xR,X1)
| $false
| ~ aElement0(X1)
| ~ aRewritingSystem0(xR) ),
inference(rw,[status(thm)],[44681,58,theory(equality)]) ).
cnf(44690,plain,
( X1 = xd
| ~ sdtmndtasgtdt0(xd,xR,X1)
| $false
| ~ aElement0(X1)
| $false ),
inference(rw,[status(thm)],[44689,59,theory(equality)]) ).
cnf(44691,plain,
( X1 = xd
| ~ sdtmndtasgtdt0(xd,xR,X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[44690,theory(equality)]) ).
cnf(44704,plain,
( xx = xd
| ~ aElement0(xx) ),
inference(spm,[status(thm)],[44691,53,theory(equality)]) ).
cnf(44744,plain,
( xx = xd
| $false ),
inference(rw,[status(thm)],[44704,55,theory(equality)]) ).
cnf(44745,plain,
xx = xd,
inference(cn,[status(thm)],[44744,theory(equality)]) ).
cnf(44864,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[94,44745,theory(equality)]),54,theory(equality)]) ).
cnf(44865,negated_conjecture,
$false,
inference(cn,[status(thm)],[44864,theory(equality)]) ).
cnf(44866,negated_conjecture,
$false,
44865,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/COM/COM021+1.p
% --creating new selector for []
% -running prover on /tmp/tmpD-IB2R/sel_COM021+1.p_1 with time limit 29
% -prover status Theorem
% Problem COM021+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/COM/COM021+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/COM/COM021+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
%
%------------------------------------------------------------------------------