TSTP Solution File: RNG112+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG112+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:27:00 EST 2010
% Result : Theorem 0.29s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 40 ( 7 unt; 0 def)
% Number of atoms : 163 ( 76 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 203 ( 80 ~; 77 |; 39 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 21 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ? [X2] :
( aElementOf0(X2,xI)
& X2 != sz00
& ! [X3] :
( ( aElementOf0(X3,xI)
& X3 != sz00 )
=> ~ iLess0(sbrdtbr0(X3),sbrdtbr0(X2)) ) ) ),
file('/tmp/tmpa-l3tI/sel_RNG112+1.p_1',m__2351) ).
fof(24,axiom,
( aIdeal0(xI)
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/tmp/tmpa-l3tI/sel_RNG112+1.p_1',m__2174) ).
fof(28,axiom,
? [X1] :
( aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& X1 != sz00 ),
file('/tmp/tmpa-l3tI/sel_RNG112+1.p_1',m__2228) ).
fof(46,conjecture,
? [X1] :
( aElementOf0(X1,xI)
& X1 != sz00
& ! [X2] :
( ( aElementOf0(X2,xI)
& X2 != sz00 )
=> ~ iLess0(sbrdtbr0(X2),sbrdtbr0(X1)) ) ),
file('/tmp/tmpa-l3tI/sel_RNG112+1.p_1',m__) ).
fof(47,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,xI)
& X1 != sz00
& ! [X2] :
( ( aElementOf0(X2,xI)
& X2 != sz00 )
=> ~ iLess0(sbrdtbr0(X2),sbrdtbr0(X1)) ) ),
inference(assume_negation,[status(cth)],[46]) ).
fof(48,plain,
! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ? [X2] :
( aElementOf0(X2,xI)
& X2 != sz00
& ! [X3] :
( ( aElementOf0(X3,xI)
& X3 != sz00 )
=> ~ iLess0(sbrdtbr0(X3),sbrdtbr0(X2)) ) ) ),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
fof(49,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,xI)
& X1 != sz00
& ! [X2] :
( ( aElementOf0(X2,xI)
& X2 != sz00 )
=> ~ iLess0(sbrdtbr0(X2),sbrdtbr0(X1)) ) ),
inference(fof_simplification,[status(thm)],[47,theory(equality)]) ).
fof(76,plain,
! [X1] :
( ~ aElementOf0(X1,xI)
| X1 = sz00
| ? [X2] :
( aElementOf0(X2,xI)
& X2 != sz00
& ! [X3] :
( ~ aElementOf0(X3,xI)
| X3 = sz00
| ~ iLess0(sbrdtbr0(X3),sbrdtbr0(X2)) ) ) ),
inference(fof_nnf,[status(thm)],[48]) ).
fof(77,plain,
! [X4] :
( ~ aElementOf0(X4,xI)
| X4 = sz00
| ? [X5] :
( aElementOf0(X5,xI)
& X5 != sz00
& ! [X6] :
( ~ aElementOf0(X6,xI)
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(X5)) ) ) ),
inference(variable_rename,[status(thm)],[76]) ).
fof(78,plain,
! [X4] :
( ~ aElementOf0(X4,xI)
| X4 = sz00
| ( aElementOf0(esk3_1(X4),xI)
& esk3_1(X4) != sz00
& ! [X6] :
( ~ aElementOf0(X6,xI)
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(esk3_1(X4))) ) ) ),
inference(skolemize,[status(esa)],[77]) ).
fof(79,plain,
! [X4,X6] :
( ( ( ~ aElementOf0(X6,xI)
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(esk3_1(X4))) )
& aElementOf0(esk3_1(X4),xI)
& esk3_1(X4) != sz00 )
| ~ aElementOf0(X4,xI)
| X4 = sz00 ),
inference(shift_quantors,[status(thm)],[78]) ).
fof(80,plain,
! [X4,X6] :
( ( ~ aElementOf0(X6,xI)
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(esk3_1(X4)))
| ~ aElementOf0(X4,xI)
| X4 = sz00 )
& ( aElementOf0(esk3_1(X4),xI)
| ~ aElementOf0(X4,xI)
| X4 = sz00 )
& ( esk3_1(X4) != sz00
| ~ aElementOf0(X4,xI)
| X4 = sz00 ) ),
inference(distribute,[status(thm)],[79]) ).
cnf(81,plain,
( X1 = sz00
| ~ aElementOf0(X1,xI)
| esk3_1(X1) != sz00 ),
inference(split_conjunct,[status(thm)],[80]) ).
cnf(82,plain,
( X1 = sz00
| aElementOf0(esk3_1(X1),xI)
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[80]) ).
cnf(83,plain,
( X1 = sz00
| X2 = sz00
| ~ aElementOf0(X1,xI)
| ~ iLess0(sbrdtbr0(X2),sbrdtbr0(esk3_1(X1)))
| ~ aElementOf0(X2,xI) ),
inference(split_conjunct,[status(thm)],[80]) ).
cnf(156,plain,
xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[24]) ).
fof(188,plain,
? [X2] :
( aElementOf0(X2,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& X2 != sz00 ),
inference(variable_rename,[status(thm)],[28]) ).
fof(189,plain,
( aElementOf0(esk18_0,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& esk18_0 != sz00 ),
inference(skolemize,[status(esa)],[188]) ).
cnf(190,plain,
esk18_0 != sz00,
inference(split_conjunct,[status(thm)],[189]) ).
cnf(191,plain,
aElementOf0(esk18_0,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(split_conjunct,[status(thm)],[189]) ).
fof(271,negated_conjecture,
! [X1] :
( ~ aElementOf0(X1,xI)
| X1 = sz00
| ? [X2] :
( aElementOf0(X2,xI)
& X2 != sz00
& iLess0(sbrdtbr0(X2),sbrdtbr0(X1)) ) ),
inference(fof_nnf,[status(thm)],[49]) ).
fof(272,negated_conjecture,
! [X3] :
( ~ aElementOf0(X3,xI)
| X3 = sz00
| ? [X4] :
( aElementOf0(X4,xI)
& X4 != sz00
& iLess0(sbrdtbr0(X4),sbrdtbr0(X3)) ) ),
inference(variable_rename,[status(thm)],[271]) ).
fof(273,negated_conjecture,
! [X3] :
( ~ aElementOf0(X3,xI)
| X3 = sz00
| ( aElementOf0(esk23_1(X3),xI)
& esk23_1(X3) != sz00
& iLess0(sbrdtbr0(esk23_1(X3)),sbrdtbr0(X3)) ) ),
inference(skolemize,[status(esa)],[272]) ).
fof(274,negated_conjecture,
! [X3] :
( ( aElementOf0(esk23_1(X3),xI)
| ~ aElementOf0(X3,xI)
| X3 = sz00 )
& ( esk23_1(X3) != sz00
| ~ aElementOf0(X3,xI)
| X3 = sz00 )
& ( iLess0(sbrdtbr0(esk23_1(X3)),sbrdtbr0(X3))
| ~ aElementOf0(X3,xI)
| X3 = sz00 ) ),
inference(distribute,[status(thm)],[273]) ).
cnf(275,negated_conjecture,
( X1 = sz00
| iLess0(sbrdtbr0(esk23_1(X1)),sbrdtbr0(X1))
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[274]) ).
cnf(276,negated_conjecture,
( X1 = sz00
| ~ aElementOf0(X1,xI)
| esk23_1(X1) != sz00 ),
inference(split_conjunct,[status(thm)],[274]) ).
cnf(277,negated_conjecture,
( X1 = sz00
| aElementOf0(esk23_1(X1),xI)
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[274]) ).
cnf(283,plain,
aElementOf0(esk18_0,xI),
inference(rw,[status(thm)],[191,156,theory(equality)]) ).
cnf(449,negated_conjecture,
( sz00 = X1
| sz00 = esk23_1(esk3_1(X1))
| sz00 = esk3_1(X1)
| ~ aElementOf0(esk23_1(esk3_1(X1)),xI)
| ~ aElementOf0(X1,xI)
| ~ aElementOf0(esk3_1(X1),xI) ),
inference(spm,[status(thm)],[83,275,theory(equality)]) ).
cnf(2406,negated_conjecture,
( esk23_1(esk3_1(X1)) = sz00
| esk3_1(X1) = sz00
| sz00 = X1
| ~ aElementOf0(esk23_1(esk3_1(X1)),xI)
| ~ aElementOf0(X1,xI) ),
inference(csr,[status(thm)],[449,82]) ).
cnf(2407,negated_conjecture,
( esk23_1(esk3_1(X1)) = sz00
| sz00 = X1
| ~ aElementOf0(esk23_1(esk3_1(X1)),xI)
| ~ aElementOf0(X1,xI) ),
inference(csr,[status(thm)],[2406,81]) ).
cnf(2408,negated_conjecture,
( esk23_1(esk3_1(X1)) = sz00
| sz00 = X1
| sz00 = esk3_1(X1)
| ~ aElementOf0(X1,xI)
| ~ aElementOf0(esk3_1(X1),xI) ),
inference(spm,[status(thm)],[2407,277,theory(equality)]) ).
cnf(2413,negated_conjecture,
( esk23_1(esk3_1(X1)) = sz00
| esk3_1(X1) = sz00
| sz00 = X1
| ~ aElementOf0(X1,xI) ),
inference(csr,[status(thm)],[2408,82]) ).
cnf(2414,negated_conjecture,
( esk23_1(esk3_1(X1)) = sz00
| sz00 = X1
| ~ aElementOf0(X1,xI) ),
inference(csr,[status(thm)],[2413,81]) ).
cnf(2415,negated_conjecture,
( sz00 = esk3_1(X1)
| sz00 = X1
| ~ aElementOf0(esk3_1(X1),xI)
| ~ aElementOf0(X1,xI) ),
inference(spm,[status(thm)],[276,2414,theory(equality)]) ).
cnf(2422,negated_conjecture,
( esk3_1(X1) = sz00
| sz00 = X1
| ~ aElementOf0(X1,xI) ),
inference(csr,[status(thm)],[2415,82]) ).
cnf(2423,negated_conjecture,
( sz00 = X1
| ~ aElementOf0(X1,xI) ),
inference(csr,[status(thm)],[2422,81]) ).
cnf(2424,plain,
sz00 = esk18_0,
inference(spm,[status(thm)],[2423,283,theory(equality)]) ).
cnf(2437,plain,
$false,
inference(sr,[status(thm)],[2424,190,theory(equality)]) ).
cnf(2438,plain,
$false,
2437,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG112+1.p
% --creating new selector for []
% -running prover on /tmp/tmpa-l3tI/sel_RNG112+1.p_1 with time limit 29
% -prover status Theorem
% Problem RNG112+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG112+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG112+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
%
%------------------------------------------------------------------------------