TSTP Solution File: RNG123+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG123+1 : TPTP v5.0.0. Released v4.0.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 02:34:54 EST 2010
% Result : Theorem 0.40s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 14 unt; 0 def)
% Number of atoms : 125 ( 3 equ)
% Maximal formula atoms : 29 ( 4 avg)
% Number of connectives : 155 ( 56 ~; 61 |; 34 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 24 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(28,axiom,
( aIdeal0(xI)
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/tmp/tmpjsnESq/sel_RNG123+1.p_1',m__2174) ).
fof(29,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/tmpjsnESq/sel_RNG123+1.p_1',mDefIdeal) ).
fof(44,axiom,
xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
file('/tmp/tmpjsnESq/sel_RNG123+1.p_1',m__2718) ).
fof(48,axiom,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
file('/tmp/tmpjsnESq/sel_RNG123+1.p_1',m__2690) ).
fof(54,conjecture,
aElementOf0(xr,xI),
file('/tmp/tmpjsnESq/sel_RNG123+1.p_1',m__) ).
fof(55,axiom,
aElementOf0(xb,xI),
file('/tmp/tmpjsnESq/sel_RNG123+1.p_1',m__2699) ).
fof(56,negated_conjecture,
~ aElementOf0(xr,xI),
inference(assume_negation,[status(cth)],[54]) ).
fof(60,negated_conjecture,
~ aElementOf0(xr,xI),
inference(fof_simplification,[status(thm)],[56,theory(equality)]) ).
cnf(178,plain,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[28]) ).
fof(179,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)],[29]) ).
fof(180,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)],[179]) ).
fof(181,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(esk11_1(X4),X4)
& ( ( aElementOf0(esk12_1(X4),X4)
& ~ aElementOf0(sdtpldt0(esk11_1(X4),esk12_1(X4)),X4) )
| ( aElement0(esk13_1(X4))
& ~ aElementOf0(sdtasdt0(esk13_1(X4),esk11_1(X4)),X4) ) ) )
| aIdeal0(X4) ) ),
inference(skolemize,[status(esa)],[180]) ).
fof(182,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(esk11_1(X4),X4)
& ( ( aElementOf0(esk12_1(X4),X4)
& ~ aElementOf0(sdtpldt0(esk11_1(X4),esk12_1(X4)),X4) )
| ( aElement0(esk13_1(X4))
& ~ aElementOf0(sdtasdt0(esk13_1(X4),esk11_1(X4)),X4) ) ) )
| aIdeal0(X4) ) ),
inference(shift_quantors,[status(thm)],[181]) ).
fof(183,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(esk11_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( aElement0(esk13_1(X4))
| aElementOf0(esk12_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( ~ aElementOf0(sdtasdt0(esk13_1(X4),esk11_1(X4)),X4)
| aElementOf0(esk12_1(X4),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( aElement0(esk13_1(X4))
| ~ aElementOf0(sdtpldt0(esk11_1(X4),esk12_1(X4)),X4)
| ~ aSet0(X4)
| aIdeal0(X4) )
& ( ~ aElementOf0(sdtasdt0(esk13_1(X4),esk11_1(X4)),X4)
| ~ aElementOf0(sdtpldt0(esk11_1(X4),esk12_1(X4)),X4)
| ~ aSet0(X4)
| aIdeal0(X4) ) ),
inference(distribute,[status(thm)],[182]) ).
cnf(190,plain,
( aElementOf0(sdtpldt0(X2,X3),X1)
| ~ aIdeal0(X1)
| ~ aElementOf0(X2,X1)
| ~ aElementOf0(X3,X1) ),
inference(split_conjunct,[status(thm)],[183]) ).
cnf(258,plain,
xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(split_conjunct,[status(thm)],[44]) ).
cnf(269,plain,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(296,negated_conjecture,
~ aElementOf0(xr,xI),
inference(split_conjunct,[status(thm)],[60]) ).
cnf(297,plain,
aElementOf0(xb,xI),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(522,plain,
( aElementOf0(xr,X1)
| ~ aIdeal0(X1)
| ~ aElementOf0(xb,X1)
| ~ aElementOf0(smndt0(sdtasdt0(xq,xu)),X1) ),
inference(spm,[status(thm)],[190,258,theory(equality)]) ).
cnf(2887,plain,
( aElementOf0(xr,xI)
| ~ aIdeal0(xI)
| ~ aElementOf0(xb,xI) ),
inference(spm,[status(thm)],[522,269,theory(equality)]) ).
cnf(2894,plain,
( aElementOf0(xr,xI)
| $false
| ~ aElementOf0(xb,xI) ),
inference(rw,[status(thm)],[2887,178,theory(equality)]) ).
cnf(2895,plain,
( aElementOf0(xr,xI)
| $false
| $false ),
inference(rw,[status(thm)],[2894,297,theory(equality)]) ).
cnf(2896,plain,
aElementOf0(xr,xI),
inference(cn,[status(thm)],[2895,theory(equality)]) ).
cnf(2897,plain,
$false,
inference(sr,[status(thm)],[2896,296,theory(equality)]) ).
cnf(2898,plain,
$false,
2897,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG123+1.p
% --creating new selector for []
% -running prover on /tmp/tmpjsnESq/sel_RNG123+1.p_1 with time limit 29
% -prover status Theorem
% Problem RNG123+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG123+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG123+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
%
%------------------------------------------------------------------------------