TSTP Solution File: LAT388+4 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : LAT388+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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 : Sat Dec 25 17:23:07 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 193 ( 6 equ)
% Maximal formula atoms : 48 ( 11 avg)
% Number of connectives : 262 ( 86 ~; 74 |; 93 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 1 sgn 29 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
( aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,xp) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X1] :
( ( ( aElementOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xT,xS) )
=> sdtlseqdt0(xp,X1) )
& aSupremumOfIn0(xp,xT,xS) ),
file('/tmp/tmpuzka8N/sel_LAT388+4.p_1',m__1330) ).
fof(30,conjecture,
? [X1] :
( ( aElementOf0(X1,xS)
& ( ( aElementOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xT,xS) )
& ! [X2] :
( ( aElementOf0(X2,xS)
& ! [X3] :
( aElementOf0(X3,xT)
=> sdtlseqdt0(X3,X2) )
& aUpperBoundOfIn0(X2,xT,xS) )
=> sdtlseqdt0(X1,X2) ) )
| aSupremumOfIn0(X1,xT,xS) ),
file('/tmp/tmpuzka8N/sel_LAT388+4.p_1',m__) ).
fof(32,negated_conjecture,
~ ? [X1] :
( ( aElementOf0(X1,xS)
& ( ( aElementOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xT,xS) )
& ! [X2] :
( ( aElementOf0(X2,xS)
& ! [X3] :
( aElementOf0(X3,xT)
=> sdtlseqdt0(X3,X2) )
& aUpperBoundOfIn0(X2,xT,xS) )
=> sdtlseqdt0(X1,X2) ) )
| aSupremumOfIn0(X1,xT,xS) ),
inference(assume_negation,[status(cth)],[30]) ).
fof(61,plain,
( aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& ! [X1] :
( ~ aElementOf0(X1,xT)
| sdtlseqdt0(X1,xp) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X1] :
( ( ( ~ aElementOf0(X1,xS)
| ? [X2] :
( aElementOf0(X2,xT)
& ~ sdtlseqdt0(X2,X1) ) )
& ~ aUpperBoundOfIn0(X1,xT,xS) )
| sdtlseqdt0(xp,X1) )
& aSupremumOfIn0(xp,xT,xS) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(62,plain,
( aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& ! [X3] :
( ~ aElementOf0(X3,xT)
| sdtlseqdt0(X3,xp) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X4] :
( ( ( ~ aElementOf0(X4,xS)
| ? [X5] :
( aElementOf0(X5,xT)
& ~ sdtlseqdt0(X5,X4) ) )
& ~ aUpperBoundOfIn0(X4,xT,xS) )
| sdtlseqdt0(xp,X4) )
& aSupremumOfIn0(xp,xT,xS) ),
inference(variable_rename,[status(thm)],[61]) ).
fof(63,plain,
( aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& ! [X3] :
( ~ aElementOf0(X3,xT)
| sdtlseqdt0(X3,xp) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X4] :
( ( ( ~ aElementOf0(X4,xS)
| ( aElementOf0(esk2_1(X4),xT)
& ~ sdtlseqdt0(esk2_1(X4),X4) ) )
& ~ aUpperBoundOfIn0(X4,xT,xS) )
| sdtlseqdt0(xp,X4) )
& aSupremumOfIn0(xp,xT,xS) ),
inference(skolemize,[status(esa)],[62]) ).
fof(64,plain,
! [X3,X4] :
( ( ( ( ~ aElementOf0(X4,xS)
| ( aElementOf0(esk2_1(X4),xT)
& ~ sdtlseqdt0(esk2_1(X4),X4) ) )
& ~ aUpperBoundOfIn0(X4,xT,xS) )
| sdtlseqdt0(xp,X4) )
& ( ~ aElementOf0(X3,xT)
| sdtlseqdt0(X3,xp) )
& aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& aUpperBoundOfIn0(xp,xT,xS)
& aSupremumOfIn0(xp,xT,xS) ),
inference(shift_quantors,[status(thm)],[63]) ).
fof(65,plain,
! [X3,X4] :
( ( aElementOf0(esk2_1(X4),xT)
| ~ aElementOf0(X4,xS)
| sdtlseqdt0(xp,X4) )
& ( ~ sdtlseqdt0(esk2_1(X4),X4)
| ~ aElementOf0(X4,xS)
| sdtlseqdt0(xp,X4) )
& ( ~ aUpperBoundOfIn0(X4,xT,xS)
| sdtlseqdt0(xp,X4) )
& ( ~ aElementOf0(X3,xT)
| sdtlseqdt0(X3,xp) )
& aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& aUpperBoundOfIn0(xp,xT,xS)
& aSupremumOfIn0(xp,xT,xS) ),
inference(distribute,[status(thm)],[64]) ).
cnf(66,plain,
aSupremumOfIn0(xp,xT,xS),
inference(split_conjunct,[status(thm)],[65]) ).
fof(244,negated_conjecture,
! [X1] :
( ( ~ aElementOf0(X1,xS)
| ( ( ~ aElementOf0(X1,xS)
| ? [X2] :
( aElementOf0(X2,xT)
& ~ sdtlseqdt0(X2,X1) ) )
& ~ aUpperBoundOfIn0(X1,xT,xS) )
| ? [X2] :
( aElementOf0(X2,xS)
& ! [X3] :
( ~ aElementOf0(X3,xT)
| sdtlseqdt0(X3,X2) )
& aUpperBoundOfIn0(X2,xT,xS)
& ~ sdtlseqdt0(X1,X2) ) )
& ~ aSupremumOfIn0(X1,xT,xS) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(245,negated_conjecture,
! [X4] :
( ( ~ aElementOf0(X4,xS)
| ( ( ~ aElementOf0(X4,xS)
| ? [X5] :
( aElementOf0(X5,xT)
& ~ sdtlseqdt0(X5,X4) ) )
& ~ aUpperBoundOfIn0(X4,xT,xS) )
| ? [X6] :
( aElementOf0(X6,xS)
& ! [X7] :
( ~ aElementOf0(X7,xT)
| sdtlseqdt0(X7,X6) )
& aUpperBoundOfIn0(X6,xT,xS)
& ~ sdtlseqdt0(X4,X6) ) )
& ~ aSupremumOfIn0(X4,xT,xS) ),
inference(variable_rename,[status(thm)],[244]) ).
fof(246,negated_conjecture,
! [X4] :
( ( ~ aElementOf0(X4,xS)
| ( ( ~ aElementOf0(X4,xS)
| ( aElementOf0(esk16_1(X4),xT)
& ~ sdtlseqdt0(esk16_1(X4),X4) ) )
& ~ aUpperBoundOfIn0(X4,xT,xS) )
| ( aElementOf0(esk17_1(X4),xS)
& ! [X7] :
( ~ aElementOf0(X7,xT)
| sdtlseqdt0(X7,esk17_1(X4)) )
& aUpperBoundOfIn0(esk17_1(X4),xT,xS)
& ~ sdtlseqdt0(X4,esk17_1(X4)) ) )
& ~ aSupremumOfIn0(X4,xT,xS) ),
inference(skolemize,[status(esa)],[245]) ).
fof(247,negated_conjecture,
! [X4,X7] :
( ( ( ( ~ aElementOf0(X7,xT)
| sdtlseqdt0(X7,esk17_1(X4)) )
& aElementOf0(esk17_1(X4),xS)
& aUpperBoundOfIn0(esk17_1(X4),xT,xS)
& ~ sdtlseqdt0(X4,esk17_1(X4)) )
| ~ aElementOf0(X4,xS)
| ( ( ~ aElementOf0(X4,xS)
| ( aElementOf0(esk16_1(X4),xT)
& ~ sdtlseqdt0(esk16_1(X4),X4) ) )
& ~ aUpperBoundOfIn0(X4,xT,xS) ) )
& ~ aSupremumOfIn0(X4,xT,xS) ),
inference(shift_quantors,[status(thm)],[246]) ).
fof(248,negated_conjecture,
! [X4,X7] :
( ( aElementOf0(esk16_1(X4),xT)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X7,xT)
| sdtlseqdt0(X7,esk17_1(X4)) )
& ( ~ sdtlseqdt0(esk16_1(X4),X4)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X7,xT)
| sdtlseqdt0(X7,esk17_1(X4)) )
& ( ~ aUpperBoundOfIn0(X4,xT,xS)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X7,xT)
| sdtlseqdt0(X7,esk17_1(X4)) )
& ( aElementOf0(esk16_1(X4),xT)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS)
| aElementOf0(esk17_1(X4),xS) )
& ( ~ sdtlseqdt0(esk16_1(X4),X4)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS)
| aElementOf0(esk17_1(X4),xS) )
& ( ~ aUpperBoundOfIn0(X4,xT,xS)
| ~ aElementOf0(X4,xS)
| aElementOf0(esk17_1(X4),xS) )
& ( aElementOf0(esk16_1(X4),xT)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS)
| aUpperBoundOfIn0(esk17_1(X4),xT,xS) )
& ( ~ sdtlseqdt0(esk16_1(X4),X4)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS)
| aUpperBoundOfIn0(esk17_1(X4),xT,xS) )
& ( ~ aUpperBoundOfIn0(X4,xT,xS)
| ~ aElementOf0(X4,xS)
| aUpperBoundOfIn0(esk17_1(X4),xT,xS) )
& ( aElementOf0(esk16_1(X4),xT)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS)
| ~ sdtlseqdt0(X4,esk17_1(X4)) )
& ( ~ sdtlseqdt0(esk16_1(X4),X4)
| ~ aElementOf0(X4,xS)
| ~ aElementOf0(X4,xS)
| ~ sdtlseqdt0(X4,esk17_1(X4)) )
& ( ~ aUpperBoundOfIn0(X4,xT,xS)
| ~ aElementOf0(X4,xS)
| ~ sdtlseqdt0(X4,esk17_1(X4)) )
& ~ aSupremumOfIn0(X4,xT,xS) ),
inference(distribute,[status(thm)],[247]) ).
cnf(249,negated_conjecture,
~ aSupremumOfIn0(X1,xT,xS),
inference(split_conjunct,[status(thm)],[248]) ).
cnf(284,plain,
$false,
inference(sr,[status(thm)],[66,249,theory(equality)]) ).
cnf(285,plain,
$false,
284,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/LAT/LAT388+4.p
% --creating new selector for []
% -running prover on /tmp/tmpuzka8N/sel_LAT388+4.p_1 with time limit 29
% -prover status Theorem
% Problem LAT388+4.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LAT/LAT388+4.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LAT/LAT388+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
%
%------------------------------------------------------------------------------