TSTP Solution File: RNG089+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG089+2 : TPTP v5.0.0. Released v4.0.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 02:14:19 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 137 ( 7 equ)
% Maximal formula atoms : 16 ( 5 avg)
% Number of connectives : 155 ( 45 ~; 41 |; 63 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 30 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
( aElementOf0(xk,xI)
& aElementOf0(xl,xJ)
& xx = sdtpldt0(xk,xl) ),
file('/tmp/tmpK_Myjv/sel_RNG089+2.p_1',m__934) ).
fof(9,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/tmpK_Myjv/sel_RNG089+2.p_1',m__870) ).
fof(29,conjecture,
( aElementOf0(sdtasdt0(xz,xk),xI)
& aElementOf0(sdtasdt0(xz,xl),xJ) ),
file('/tmp/tmpK_Myjv/sel_RNG089+2.p_1',m__) ).
fof(30,axiom,
( ? [X1,X2] :
( aElementOf0(X1,xI)
& aElementOf0(X2,xJ)
& sdtpldt0(X1,X2) = xx )
& aElementOf0(xx,sdtpldt1(xI,xJ))
& ? [X1,X2] :
( aElementOf0(X1,xI)
& aElementOf0(X2,xJ)
& sdtpldt0(X1,X2) = xy )
& aElementOf0(xy,sdtpldt1(xI,xJ))
& aElement0(xz) ),
file('/tmp/tmpK_Myjv/sel_RNG089+2.p_1',m__901) ).
fof(31,negated_conjecture,
~ ( aElementOf0(sdtasdt0(xz,xk),xI)
& aElementOf0(sdtasdt0(xz,xl),xJ) ),
inference(assume_negation,[status(cth)],[29]) ).
cnf(60,plain,
aElementOf0(xl,xJ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(61,plain,
aElementOf0(xk,xI),
inference(split_conjunct,[status(thm)],[7]) ).
fof(65,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)],[9]) ).
fof(66,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)],[65]) ).
fof(67,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)],[66]) ).
fof(68,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)],[67]) ).
cnf(74,plain,
( aElementOf0(sdtasdt0(X2,X1),xI)
| ~ aElementOf0(X1,xI)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[68]) ).
cnf(76,plain,
( aElementOf0(sdtasdt0(X2,X1),xJ)
| ~ aElementOf0(X1,xJ)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[68]) ).
fof(166,negated_conjecture,
( ~ aElementOf0(sdtasdt0(xz,xk),xI)
| ~ aElementOf0(sdtasdt0(xz,xl),xJ) ),
inference(fof_nnf,[status(thm)],[31]) ).
cnf(167,negated_conjecture,
( ~ aElementOf0(sdtasdt0(xz,xl),xJ)
| ~ aElementOf0(sdtasdt0(xz,xk),xI) ),
inference(split_conjunct,[status(thm)],[166]) ).
fof(168,plain,
( ? [X3,X4] :
( aElementOf0(X3,xI)
& aElementOf0(X4,xJ)
& sdtpldt0(X3,X4) = xx )
& aElementOf0(xx,sdtpldt1(xI,xJ))
& ? [X5,X6] :
( aElementOf0(X5,xI)
& aElementOf0(X6,xJ)
& sdtpldt0(X5,X6) = xy )
& aElementOf0(xy,sdtpldt1(xI,xJ))
& aElement0(xz) ),
inference(variable_rename,[status(thm)],[30]) ).
fof(169,plain,
( aElementOf0(esk12_0,xI)
& aElementOf0(esk13_0,xJ)
& sdtpldt0(esk12_0,esk13_0) = xx
& aElementOf0(xx,sdtpldt1(xI,xJ))
& aElementOf0(esk14_0,xI)
& aElementOf0(esk15_0,xJ)
& sdtpldt0(esk14_0,esk15_0) = xy
& aElementOf0(xy,sdtpldt1(xI,xJ))
& aElement0(xz) ),
inference(skolemize,[status(esa)],[168]) ).
cnf(170,plain,
aElement0(xz),
inference(split_conjunct,[status(thm)],[169]) ).
cnf(397,plain,
( ~ aElementOf0(sdtasdt0(xz,xk),xI)
| ~ aElement0(xz)
| ~ aElementOf0(xl,xJ) ),
inference(spm,[status(thm)],[167,76,theory(equality)]) ).
cnf(400,plain,
( ~ aElementOf0(sdtasdt0(xz,xk),xI)
| $false
| ~ aElementOf0(xl,xJ) ),
inference(rw,[status(thm)],[397,170,theory(equality)]) ).
cnf(401,plain,
( ~ aElementOf0(sdtasdt0(xz,xk),xI)
| $false
| $false ),
inference(rw,[status(thm)],[400,60,theory(equality)]) ).
cnf(402,plain,
~ aElementOf0(sdtasdt0(xz,xk),xI),
inference(cn,[status(thm)],[401,theory(equality)]) ).
cnf(614,plain,
( ~ aElement0(xz)
| ~ aElementOf0(xk,xI) ),
inference(spm,[status(thm)],[402,74,theory(equality)]) ).
cnf(617,plain,
( $false
| ~ aElementOf0(xk,xI) ),
inference(rw,[status(thm)],[614,170,theory(equality)]) ).
cnf(618,plain,
( $false
| $false ),
inference(rw,[status(thm)],[617,61,theory(equality)]) ).
cnf(619,plain,
$false,
inference(cn,[status(thm)],[618,theory(equality)]) ).
cnf(620,plain,
$false,
619,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG089+2.p
% --creating new selector for []
% -running prover on /tmp/tmpK_Myjv/sel_RNG089+2.p_1 with time limit 29
% -prover status Theorem
% Problem RNG089+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG089+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG089+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
%
%------------------------------------------------------------------------------