TSTP Solution File: RNG089+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG089+1 : 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:15 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 8 unt; 0 def)
% Number of atoms : 141 ( 1 equ)
% Maximal formula atoms : 29 ( 4 avg)
% Number of connectives : 177 ( 66 ~; 67 |; 40 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 24 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
( aElementOf0(xk,xI)
& aElementOf0(xl,xJ)
& xx = sdtpldt0(xk,xl) ),
file('/tmp/tmp8FCMYN/sel_RNG089+1.p_1',m__934) ).
fof(9,axiom,
( aIdeal0(xI)
& aIdeal0(xJ) ),
file('/tmp/tmp8FCMYN/sel_RNG089+1.p_1',m__870) ).
fof(15,axiom,
! [X1] :
( aIdeal0(X1)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> ( ! [X3] :
( aElementOf0(X3,X1)
=> aElementOf0(sdtpldt0(X2,X3),X1) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X2),X1) ) ) ) ) ),
file('/tmp/tmp8FCMYN/sel_RNG089+1.p_1',mDefIdeal) ).
fof(29,conjecture,
( aElementOf0(sdtasdt0(xz,xk),xI)
& aElementOf0(sdtasdt0(xz,xl),xJ) ),
file('/tmp/tmp8FCMYN/sel_RNG089+1.p_1',m__) ).
fof(30,axiom,
( aElementOf0(xx,sdtpldt1(xI,xJ))
& aElementOf0(xy,sdtpldt1(xI,xJ))
& aElement0(xz) ),
file('/tmp/tmp8FCMYN/sel_RNG089+1.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]) ).
cnf(65,plain,
aIdeal0(xJ),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(66,plain,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[9]) ).
fof(80,plain,
! [X1] :
( ( ~ aIdeal0(X1)
| ( aSet0(X1)
& ! [X2] :
( ~ aElementOf0(X2,X1)
| ( ! [X3] :
( ~ aElementOf0(X3,X1)
| aElementOf0(sdtpldt0(X2,X3),X1) )
& ! [X3] :
( ~ aElement0(X3)
| aElementOf0(sdtasdt0(X3,X2),X1) ) ) ) ) )
& ( ~ aSet0(X1)
| ? [X2] :
( aElementOf0(X2,X1)
& ( ? [X3] :
( aElementOf0(X3,X1)
& ~ aElementOf0(sdtpldt0(X2,X3),X1) )
| ? [X3] :
( aElement0(X3)
& ~ aElementOf0(sdtasdt0(X3,X2),X1) ) ) )
| aIdeal0(X1) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(81,plain,
! [X4] :
( ( ~ aIdeal0(X4)
| ( aSet0(X4)
& ! [X5] :
( ~ aElementOf0(X5,X4)
| ( ! [X6] :
( ~ aElementOf0(X6,X4)
| aElementOf0(sdtpldt0(X5,X6),X4) )
& ! [X7] :
( ~ aElement0(X7)
| aElementOf0(sdtasdt0(X7,X5),X4) ) ) ) ) )
& ( ~ aSet0(X4)
| ? [X8] :
( aElementOf0(X8,X4)
& ( ? [X9] :
( aElementOf0(X9,X4)
& ~ aElementOf0(sdtpldt0(X8,X9),X4) )
| ? [X10] :
( aElement0(X10)
& ~ aElementOf0(sdtasdt0(X10,X8),X4) ) ) )
| aIdeal0(X4) ) ),
inference(variable_rename,[status(thm)],[80]) ).
fof(82,plain,
! [X4] :
( ( ~ aIdeal0(X4)
| ( aSet0(X4)
& ! [X5] :
( ~ aElementOf0(X5,X4)
| ( ! [X6] :
( ~ aElementOf0(X6,X4)
| aElementOf0(sdtpldt0(X5,X6),X4) )
& ! [X7] :
( ~ aElement0(X7)
| aElementOf0(sdtasdt0(X7,X5),X4) ) ) ) ) )
& ( ~ aSet0(X4)
| ( aElementOf0(esk3_1(X4),X4)
& ( ( aElementOf0(esk4_1(X4),X4)
& ~ aElementOf0(sdtpldt0(esk3_1(X4),esk4_1(X4)),X4) )
| ( aElement0(esk5_1(X4))
& ~ aElementOf0(sdtasdt0(esk5_1(X4),esk3_1(X4)),X4) ) ) )
| aIdeal0(X4) ) ),
inference(skolemize,[status(esa)],[81]) ).
fof(83,plain,
! [X4,X5,X6,X7] :
( ( ( ( ( ( ~ aElement0(X7)
| aElementOf0(sdtasdt0(X7,X5),X4) )
& ( ~ aElementOf0(X6,X4)
| aElementOf0(sdtpldt0(X5,X6),X4) ) )
| ~ aElementOf0(X5,X4) )
& aSet0(X4) )
| ~ aIdeal0(X4) )
& ( ~ aSet0(X4)
| ( aElementOf0(esk3_1(X4),X4)
& ( ( aElementOf0(esk4_1(X4),X4)
& ~ aElementOf0(sdtpldt0(esk3_1(X4),esk4_1(X4)),X4) )
| ( aElement0(esk5_1(X4))
& ~ aElementOf0(sdtasdt0(esk5_1(X4),esk3_1(X4)),X4) ) ) )
| aIdeal0(X4) ) ),
inference(shift_quantors,[status(thm)],[82]) ).
fof(84,plain,
! [X4,X5,X6,X7] :
( ( ~ aElement0(X7)
| aElementOf0(sdtasdt0(X7,X5),X4)
| ~ aElementOf0(X5,X4)
| ~ aIdeal0(X4) )
& ( ~ aElementOf0(X6,X4)
| aElementOf0(sdtpldt0(X5,X6),X4)
| ~ aElementOf0(X5,X4)
| ~ aIdeal0(X4) )
& ( aSet0(X4)
| ~ aIdeal0(X4) )
& ( aElementOf0(esk3_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( aElement0(esk5_1(X4))
| aElementOf0(esk4_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( ~ aElementOf0(sdtasdt0(esk5_1(X4),esk3_1(X4)),X4)
| aElementOf0(esk4_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( aElement0(esk5_1(X4))
| ~ aElementOf0(sdtpldt0(esk3_1(X4),esk4_1(X4)),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( ~ aElementOf0(sdtasdt0(esk5_1(X4),esk3_1(X4)),X4)
| ~ aElementOf0(sdtpldt0(esk3_1(X4),esk4_1(X4)),X4)
| ~ aSet0(X4)
| aIdeal0(X4) ) ),
inference(distribute,[status(thm)],[83]) ).
cnf(92,plain,
( aElementOf0(sdtasdt0(X3,X2),X1)
| ~ aIdeal0(X1)
| ~ aElementOf0(X2,X1)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[84]) ).
fof(156,negated_conjecture,
( ~ aElementOf0(sdtasdt0(xz,xk),xI)
| ~ aElementOf0(sdtasdt0(xz,xl),xJ) ),
inference(fof_nnf,[status(thm)],[31]) ).
cnf(157,negated_conjecture,
( ~ aElementOf0(sdtasdt0(xz,xl),xJ)
| ~ aElementOf0(sdtasdt0(xz,xk),xI) ),
inference(split_conjunct,[status(thm)],[156]) ).
cnf(158,plain,
aElement0(xz),
inference(split_conjunct,[status(thm)],[30]) ).
cnf(270,plain,
( aElementOf0(sdtasdt0(X1,X2),xI)
| ~ aElement0(X1)
| ~ aElementOf0(X2,xI) ),
inference(spm,[status(thm)],[92,66,theory(equality)]) ).
cnf(271,plain,
( aElementOf0(sdtasdt0(X1,X2),xJ)
| ~ aElement0(X1)
| ~ aElementOf0(X2,xJ) ),
inference(spm,[status(thm)],[92,65,theory(equality)]) ).
cnf(647,plain,
( ~ aElementOf0(sdtasdt0(xz,xk),xI)
| ~ aElement0(xz)
| ~ aElementOf0(xl,xJ) ),
inference(spm,[status(thm)],[157,271,theory(equality)]) ).
cnf(660,plain,
( ~ aElementOf0(sdtasdt0(xz,xk),xI)
| $false
| ~ aElementOf0(xl,xJ) ),
inference(rw,[status(thm)],[647,158,theory(equality)]) ).
cnf(661,plain,
( ~ aElementOf0(sdtasdt0(xz,xk),xI)
| $false
| $false ),
inference(rw,[status(thm)],[660,60,theory(equality)]) ).
cnf(662,plain,
~ aElementOf0(sdtasdt0(xz,xk),xI),
inference(cn,[status(thm)],[661,theory(equality)]) ).
cnf(703,plain,
( ~ aElement0(xz)
| ~ aElementOf0(xk,xI) ),
inference(spm,[status(thm)],[662,270,theory(equality)]) ).
cnf(710,plain,
( $false
| ~ aElementOf0(xk,xI) ),
inference(rw,[status(thm)],[703,158,theory(equality)]) ).
cnf(711,plain,
( $false
| $false ),
inference(rw,[status(thm)],[710,61,theory(equality)]) ).
cnf(712,plain,
$false,
inference(cn,[status(thm)],[711,theory(equality)]) ).
cnf(713,plain,
$false,
712,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG089+1.p
% --creating new selector for []
% -running prover on /tmp/tmp8FCMYN/sel_RNG089+1.p_1 with time limit 29
% -prover status Theorem
% Problem RNG089+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG089+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG089+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
%
%------------------------------------------------------------------------------