TSTP Solution File: RNG124+4 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG124+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:35:15 EST 2010
% Result : Theorem 0.29s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 112 ( 41 equ)
% Maximal formula atoms : 13 ( 5 avg)
% Number of connectives : 132 ( 42 ~; 30 |; 58 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 11 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 17 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(12,axiom,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,xI) )
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
file('/tmp/tmpkCiNL0/sel_RNG124+4.p_1',m__2273) ).
fof(13,axiom,
( aElement0(xq)
& aElement0(xr)
& xb = sdtpldt0(sdtasdt0(xq,xu),xr)
& ( xr = sz00
| iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ) ),
file('/tmp/tmpkCiNL0/sel_RNG124+4.p_1',m__2666) ).
fof(15,axiom,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xr )
& aElementOf0(xr,xI) ),
file('/tmp/tmpkCiNL0/sel_RNG124+4.p_1',m__2729) ).
fof(36,axiom,
xr != sz00,
file('/tmp/tmpkCiNL0/sel_RNG124+4.p_1',m__2673) ).
fof(58,plain,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,xI) )
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
inference(fof_simplification,[status(thm)],[12,theory(equality)]) ).
fof(169,plain,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ! [X2,X3] :
( ~ aElementOf0(X2,slsdtgt0(xa))
| ~ aElementOf0(X3,slsdtgt0(xb))
| sdtpldt0(X2,X3) != X1 )
& ~ aElementOf0(X1,xI) )
| X1 = sz00
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
inference(fof_nnf,[status(thm)],[58]) ).
fof(170,plain,
( ? [X4,X5] :
( aElementOf0(X4,slsdtgt0(xa))
& aElementOf0(X5,slsdtgt0(xb))
& sdtpldt0(X4,X5) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X6] :
( ( ! [X7,X8] :
( ~ aElementOf0(X7,slsdtgt0(xa))
| ~ aElementOf0(X8,slsdtgt0(xb))
| sdtpldt0(X7,X8) != X6 )
& ~ aElementOf0(X6,xI) )
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) ) ),
inference(variable_rename,[status(thm)],[169]) ).
fof(171,plain,
( aElementOf0(esk9_0,slsdtgt0(xa))
& aElementOf0(esk10_0,slsdtgt0(xb))
& sdtpldt0(esk9_0,esk10_0) = xu
& aElementOf0(xu,xI)
& xu != sz00
& ! [X6] :
( ( ! [X7,X8] :
( ~ aElementOf0(X7,slsdtgt0(xa))
| ~ aElementOf0(X8,slsdtgt0(xb))
| sdtpldt0(X7,X8) != X6 )
& ~ aElementOf0(X6,xI) )
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) ) ),
inference(skolemize,[status(esa)],[170]) ).
fof(172,plain,
! [X6,X7,X8] :
( ( ( ( ~ aElementOf0(X7,slsdtgt0(xa))
| ~ aElementOf0(X8,slsdtgt0(xb))
| sdtpldt0(X7,X8) != X6 )
& ~ aElementOf0(X6,xI) )
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) )
& aElementOf0(esk9_0,slsdtgt0(xa))
& aElementOf0(esk10_0,slsdtgt0(xb))
& sdtpldt0(esk9_0,esk10_0) = xu
& aElementOf0(xu,xI)
& xu != sz00 ),
inference(shift_quantors,[status(thm)],[171]) ).
fof(173,plain,
! [X6,X7,X8] :
( ( ~ aElementOf0(X7,slsdtgt0(xa))
| ~ aElementOf0(X8,slsdtgt0(xb))
| sdtpldt0(X7,X8) != X6
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) )
& ( ~ aElementOf0(X6,xI)
| X6 = sz00
| ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) )
& aElementOf0(esk9_0,slsdtgt0(xa))
& aElementOf0(esk10_0,slsdtgt0(xb))
& sdtpldt0(esk9_0,esk10_0) = xu
& aElementOf0(xu,xI)
& xu != sz00 ),
inference(distribute,[status(thm)],[172]) ).
cnf(179,plain,
( X1 = sz00
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu))
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[173]) ).
cnf(181,plain,
( iLess0(sbrdtbr0(xr),sbrdtbr0(xu))
| xr = sz00 ),
inference(split_conjunct,[status(thm)],[13]) ).
fof(188,plain,
( ? [X3,X4] :
( aElementOf0(X3,slsdtgt0(xa))
& aElementOf0(X4,slsdtgt0(xb))
& sdtpldt0(X3,X4) = xr )
& aElementOf0(xr,xI) ),
inference(variable_rename,[status(thm)],[15]) ).
fof(189,plain,
( aElementOf0(esk11_0,slsdtgt0(xa))
& aElementOf0(esk12_0,slsdtgt0(xb))
& sdtpldt0(esk11_0,esk12_0) = xr
& aElementOf0(xr,xI) ),
inference(skolemize,[status(esa)],[188]) ).
cnf(190,plain,
aElementOf0(xr,xI),
inference(split_conjunct,[status(thm)],[189]) ).
cnf(320,plain,
xr != sz00,
inference(split_conjunct,[status(thm)],[36]) ).
cnf(453,plain,
iLess0(sbrdtbr0(xr),sbrdtbr0(xu)),
inference(sr,[status(thm)],[181,320,theory(equality)]) ).
cnf(810,plain,
( sz00 = xr
| ~ aElementOf0(xr,xI) ),
inference(spm,[status(thm)],[179,453,theory(equality)]) ).
cnf(811,plain,
( sz00 = xr
| $false ),
inference(rw,[status(thm)],[810,190,theory(equality)]) ).
cnf(812,plain,
sz00 = xr,
inference(cn,[status(thm)],[811,theory(equality)]) ).
cnf(813,plain,
$false,
inference(sr,[status(thm)],[812,320,theory(equality)]) ).
cnf(814,plain,
$false,
813,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG124+4.p
% --creating new selector for []
% -running prover on /tmp/tmpkCiNL0/sel_RNG124+4.p_1 with time limit 29
% -prover status Theorem
% Problem RNG124+4.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG124+4.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG124+4.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
%
%------------------------------------------------------------------------------