TSTP Solution File: RNG088+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG088+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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 02:14:08 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 114 ( 2 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 133 ( 45 ~; 41 |; 41 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
( aElementOf0(xk,xI)
& aElementOf0(xl,xJ)
& xx = sdtpldt0(xk,xl) ),
file('/tmp/tmp4OO5Sy/sel_RNG088+2.p_1',m__934) ).
fof(8,axiom,
( aSet0(xI)
& ! [X1] :
( aElementOf0(X1,xI)
=> ( ! [X2] :
( aElementOf0(X2,xI)
=> aElementOf0(sdtpldt0(X1,X2),xI) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xI) ) ) )
& aIdeal0(xI)
& aSet0(xJ)
& ! [X1] :
( aElementOf0(X1,xJ)
=> ( ! [X2] :
( aElementOf0(X2,xJ)
=> aElementOf0(sdtpldt0(X1,X2),xJ) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xJ) ) ) )
& aIdeal0(xJ) ),
file('/tmp/tmp4OO5Sy/sel_RNG088+2.p_1',m__870) ).
fof(26,axiom,
( aElementOf0(xm,xI)
& aElementOf0(xn,xJ)
& xy = sdtpldt0(xm,xn) ),
file('/tmp/tmp4OO5Sy/sel_RNG088+2.p_1',m__967) ).
fof(28,conjecture,
( aElementOf0(sdtpldt0(xk,xm),xI)
& aElementOf0(sdtpldt0(xl,xn),xJ) ),
file('/tmp/tmp4OO5Sy/sel_RNG088+2.p_1',m__) ).
fof(30,negated_conjecture,
~ ( aElementOf0(sdtpldt0(xk,xm),xI)
& aElementOf0(sdtpldt0(xl,xn),xJ) ),
inference(assume_negation,[status(cth)],[28]) ).
cnf(57,plain,
aElementOf0(xl,xJ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(58,plain,
aElementOf0(xk,xI),
inference(split_conjunct,[status(thm)],[6]) ).
fof(62,plain,
( aSet0(xI)
& ! [X1] :
( ~ aElementOf0(X1,xI)
| ( ! [X2] :
( ~ aElementOf0(X2,xI)
| aElementOf0(sdtpldt0(X1,X2),xI) )
& ! [X2] :
( ~ aElement0(X2)
| aElementOf0(sdtasdt0(X2,X1),xI) ) ) )
& aIdeal0(xI)
& aSet0(xJ)
& ! [X1] :
( ~ aElementOf0(X1,xJ)
| ( ! [X2] :
( ~ aElementOf0(X2,xJ)
| aElementOf0(sdtpldt0(X1,X2),xJ) )
& ! [X2] :
( ~ aElement0(X2)
| aElementOf0(sdtasdt0(X2,X1),xJ) ) ) )
& aIdeal0(xJ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(63,plain,
( aSet0(xI)
& ! [X3] :
( ~ aElementOf0(X3,xI)
| ( ! [X4] :
( ~ aElementOf0(X4,xI)
| aElementOf0(sdtpldt0(X3,X4),xI) )
& ! [X5] :
( ~ aElement0(X5)
| aElementOf0(sdtasdt0(X5,X3),xI) ) ) )
& aIdeal0(xI)
& aSet0(xJ)
& ! [X6] :
( ~ aElementOf0(X6,xJ)
| ( ! [X7] :
( ~ aElementOf0(X7,xJ)
| aElementOf0(sdtpldt0(X6,X7),xJ) )
& ! [X8] :
( ~ aElement0(X8)
| aElementOf0(sdtasdt0(X8,X6),xJ) ) ) )
& aIdeal0(xJ) ),
inference(variable_rename,[status(thm)],[62]) ).
fof(64,plain,
! [X3,X4,X5,X6,X7,X8] :
( ( ( ( ~ aElement0(X8)
| aElementOf0(sdtasdt0(X8,X6),xJ) )
& ( ~ aElementOf0(X7,xJ)
| aElementOf0(sdtpldt0(X6,X7),xJ) ) )
| ~ aElementOf0(X6,xJ) )
& ( ( ( ~ aElement0(X5)
| aElementOf0(sdtasdt0(X5,X3),xI) )
& ( ~ aElementOf0(X4,xI)
| aElementOf0(sdtpldt0(X3,X4),xI) ) )
| ~ aElementOf0(X3,xI) )
& aSet0(xI)
& aIdeal0(xI)
& aSet0(xJ)
& aIdeal0(xJ) ),
inference(shift_quantors,[status(thm)],[63]) ).
fof(65,plain,
! [X3,X4,X5,X6,X7,X8] :
( ( ~ aElement0(X8)
| aElementOf0(sdtasdt0(X8,X6),xJ)
| ~ aElementOf0(X6,xJ) )
& ( ~ aElementOf0(X7,xJ)
| aElementOf0(sdtpldt0(X6,X7),xJ)
| ~ aElementOf0(X6,xJ) )
& ( ~ aElement0(X5)
| aElementOf0(sdtasdt0(X5,X3),xI)
| ~ aElementOf0(X3,xI) )
& ( ~ aElementOf0(X4,xI)
| aElementOf0(sdtpldt0(X3,X4),xI)
| ~ aElementOf0(X3,xI) )
& aSet0(xI)
& aIdeal0(xI)
& aSet0(xJ)
& aIdeal0(xJ) ),
inference(distribute,[status(thm)],[64]) ).
cnf(70,plain,
( aElementOf0(sdtpldt0(X1,X2),xI)
| ~ aElementOf0(X1,xI)
| ~ aElementOf0(X2,xI) ),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(72,plain,
( aElementOf0(sdtpldt0(X1,X2),xJ)
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X2,xJ) ),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(149,plain,
aElementOf0(xn,xJ),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(150,plain,
aElementOf0(xm,xI),
inference(split_conjunct,[status(thm)],[26]) ).
fof(163,negated_conjecture,
( ~ aElementOf0(sdtpldt0(xk,xm),xI)
| ~ aElementOf0(sdtpldt0(xl,xn),xJ) ),
inference(fof_nnf,[status(thm)],[30]) ).
cnf(164,negated_conjecture,
( ~ aElementOf0(sdtpldt0(xl,xn),xJ)
| ~ aElementOf0(sdtpldt0(xk,xm),xI) ),
inference(split_conjunct,[status(thm)],[163]) ).
cnf(379,plain,
( ~ aElementOf0(sdtpldt0(xk,xm),xI)
| ~ aElementOf0(xn,xJ)
| ~ aElementOf0(xl,xJ) ),
inference(spm,[status(thm)],[164,72,theory(equality)]) ).
cnf(380,plain,
( ~ aElementOf0(sdtpldt0(xk,xm),xI)
| $false
| ~ aElementOf0(xl,xJ) ),
inference(rw,[status(thm)],[379,149,theory(equality)]) ).
cnf(381,plain,
( ~ aElementOf0(sdtpldt0(xk,xm),xI)
| $false
| $false ),
inference(rw,[status(thm)],[380,57,theory(equality)]) ).
cnf(382,plain,
~ aElementOf0(sdtpldt0(xk,xm),xI),
inference(cn,[status(thm)],[381,theory(equality)]) ).
cnf(599,plain,
( ~ aElementOf0(xm,xI)
| ~ aElementOf0(xk,xI) ),
inference(spm,[status(thm)],[382,70,theory(equality)]) ).
cnf(600,plain,
( $false
| ~ aElementOf0(xk,xI) ),
inference(rw,[status(thm)],[599,150,theory(equality)]) ).
cnf(601,plain,
( $false
| $false ),
inference(rw,[status(thm)],[600,58,theory(equality)]) ).
cnf(602,plain,
$false,
inference(cn,[status(thm)],[601,theory(equality)]) ).
cnf(603,plain,
$false,
602,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG088+2.p
% --creating new selector for []
% -running prover on /tmp/tmp4OO5Sy/sel_RNG088+2.p_1 with time limit 29
% -prover status Theorem
% Problem RNG088+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG088+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG088+2.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
%
%------------------------------------------------------------------------------