TSTP Solution File: LAT385+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LAT385+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 07:25:15 EDT 2024
% Result : Theorem 0.59s 0.77s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 42 ( 5 unt; 0 def)
% Number of atoms : 438 ( 17 equ)
% Maximal formula atoms : 37 ( 10 avg)
% Number of connectives : 525 ( 129 ~; 109 |; 246 &)
% ( 0 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 133 ( 96 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f315,plain,
$false,
inference(subsumption_resolution,[],[f314,f235]) ).
fof(f235,plain,
~ sP2(xP),
inference(resolution,[],[f182,f132]) ).
fof(f132,plain,
! [X0] :
( aInfimumOfIn0(sK4(X0),X0,xU)
| ~ sP2(X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f71,plain,
! [X0] :
( ( sP0(X0)
& aInfimumOfIn0(sK4(X0),X0,xU)
& sP1(sK4(X0),X0)
& aLowerBoundOfIn0(sK4(X0),X0,xU)
& ! [X2] :
( sdtlseqdt0(sK4(X0),X2)
| ~ aElementOf0(X2,X0) )
& aElementOf0(sK4(X0),xU)
& aElementOf0(sK4(X0),xU) )
| ~ sP2(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f69,f70]) ).
fof(f70,plain,
! [X0] :
( ? [X1] :
( sP0(X0)
& aInfimumOfIn0(X1,X0,xU)
& sP1(X1,X0)
& aLowerBoundOfIn0(X1,X0,xU)
& ! [X2] :
( sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,X0) )
& aElementOf0(X1,xU)
& aElementOf0(X1,xU) )
=> ( sP0(X0)
& aInfimumOfIn0(sK4(X0),X0,xU)
& sP1(sK4(X0),X0)
& aLowerBoundOfIn0(sK4(X0),X0,xU)
& ! [X2] :
( sdtlseqdt0(sK4(X0),X2)
| ~ aElementOf0(X2,X0) )
& aElementOf0(sK4(X0),xU)
& aElementOf0(sK4(X0),xU) ) ),
introduced(choice_axiom,[]) ).
fof(f69,plain,
! [X0] :
( ? [X1] :
( sP0(X0)
& aInfimumOfIn0(X1,X0,xU)
& sP1(X1,X0)
& aLowerBoundOfIn0(X1,X0,xU)
& ! [X2] :
( sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,X0) )
& aElementOf0(X1,xU)
& aElementOf0(X1,xU) )
| ~ sP2(X0) ),
inference(rectify,[],[f68]) ).
fof(f68,plain,
! [X2] :
( ? [X4] :
( sP0(X2)
& aInfimumOfIn0(X4,X2,xU)
& sP1(X4,X2)
& aLowerBoundOfIn0(X4,X2,xU)
& ! [X11] :
( sdtlseqdt0(X4,X11)
| ~ aElementOf0(X11,X2) )
& aElementOf0(X4,xU)
& aElementOf0(X4,xU) )
| ~ sP2(X2) ),
inference(nnf_transformation,[],[f64]) ).
fof(f64,plain,
! [X2] :
( ? [X4] :
( sP0(X2)
& aInfimumOfIn0(X4,X2,xU)
& sP1(X4,X2)
& aLowerBoundOfIn0(X4,X2,xU)
& ! [X11] :
( sdtlseqdt0(X4,X11)
| ~ aElementOf0(X11,X2) )
& aElementOf0(X4,xU)
& aElementOf0(X4,xU) )
| ~ sP2(X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f182,plain,
! [X0] : ~ aInfimumOfIn0(X0,xP,xU),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
! [X0] :
( ~ aInfimumOfIn0(X0,xP,xU)
& ( sP3(X0)
| ( ~ aLowerBoundOfIn0(X0,xP,xU)
& ( ( ~ sdtlseqdt0(X0,sK11(X0))
& aElementOf0(sK11(X0),xP) )
| ~ aElementOf0(X0,xU) ) )
| ~ aElementOf0(X0,xU) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f88,f89]) ).
fof(f89,plain,
! [X0] :
( ? [X1] :
( ~ sdtlseqdt0(X0,X1)
& aElementOf0(X1,xP) )
=> ( ~ sdtlseqdt0(X0,sK11(X0))
& aElementOf0(sK11(X0),xP) ) ),
introduced(choice_axiom,[]) ).
fof(f88,plain,
! [X0] :
( ~ aInfimumOfIn0(X0,xP,xU)
& ( sP3(X0)
| ( ~ aLowerBoundOfIn0(X0,xP,xU)
& ( ? [X1] :
( ~ sdtlseqdt0(X0,X1)
& aElementOf0(X1,xP) )
| ~ aElementOf0(X0,xU) ) )
| ~ aElementOf0(X0,xU) ) ),
inference(rectify,[],[f67]) ).
fof(f67,plain,
! [X0] :
( ~ aInfimumOfIn0(X0,xP,xU)
& ( sP3(X0)
| ( ~ aLowerBoundOfIn0(X0,xP,xU)
& ( ? [X3] :
( ~ sdtlseqdt0(X0,X3)
& aElementOf0(X3,xP) )
| ~ aElementOf0(X0,xU) ) )
| ~ aElementOf0(X0,xU) ) ),
inference(definition_folding,[],[f43,f66]) ).
fof(f66,plain,
! [X0] :
( ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aLowerBoundOfIn0(X1,xP,xU)
& ! [X2] :
( sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,xP) )
& aElementOf0(X1,xU) )
| ~ sP3(X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f43,plain,
! [X0] :
( ~ aInfimumOfIn0(X0,xP,xU)
& ( ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aLowerBoundOfIn0(X1,xP,xU)
& ! [X2] :
( sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,xP) )
& aElementOf0(X1,xU) )
| ( ~ aLowerBoundOfIn0(X0,xP,xU)
& ( ? [X3] :
( ~ sdtlseqdt0(X0,X3)
& aElementOf0(X3,xP) )
| ~ aElementOf0(X0,xU) ) )
| ~ aElementOf0(X0,xU) ) ),
inference(flattening,[],[f42]) ).
fof(f42,plain,
! [X0] :
( ~ aInfimumOfIn0(X0,xP,xU)
& ( ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aLowerBoundOfIn0(X1,xP,xU)
& ! [X2] :
( sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,xP) )
& aElementOf0(X1,xU) )
| ( ~ aLowerBoundOfIn0(X0,xP,xU)
& ( ? [X3] :
( ~ sdtlseqdt0(X0,X3)
& aElementOf0(X3,xP) )
| ~ aElementOf0(X0,xU) ) )
| ~ aElementOf0(X0,xU) ) ),
inference(ennf_transformation,[],[f32]) ).
fof(f32,plain,
~ ? [X0] :
( aInfimumOfIn0(X0,xP,xU)
| ( ! [X1] :
( ( aLowerBoundOfIn0(X1,xP,xU)
& ! [X2] :
( aElementOf0(X2,xP)
=> sdtlseqdt0(X1,X2) )
& aElementOf0(X1,xU) )
=> sdtlseqdt0(X1,X0) )
& ( aLowerBoundOfIn0(X0,xP,xU)
| ( ! [X3] :
( aElementOf0(X3,xP)
=> sdtlseqdt0(X0,X3) )
& aElementOf0(X0,xU) ) )
& aElementOf0(X0,xU) ) ),
inference(rectify,[],[f29]) ).
fof(f29,negated_conjecture,
~ ? [X0] :
( aInfimumOfIn0(X0,xP,xU)
| ( ! [X1] :
( ( aLowerBoundOfIn0(X1,xP,xU)
& ! [X2] :
( aElementOf0(X2,xP)
=> sdtlseqdt0(X1,X2) )
& aElementOf0(X1,xU) )
=> sdtlseqdt0(X1,X0) )
& ( aLowerBoundOfIn0(X0,xP,xU)
| ( ! [X1] :
( aElementOf0(X1,xP)
=> sdtlseqdt0(X0,X1) )
& aElementOf0(X0,xU) ) )
& aElementOf0(X0,xU) ) ),
inference(negated_conjecture,[],[f28]) ).
fof(f28,conjecture,
? [X0] :
( aInfimumOfIn0(X0,xP,xU)
| ( ! [X1] :
( ( aLowerBoundOfIn0(X1,xP,xU)
& ! [X2] :
( aElementOf0(X2,xP)
=> sdtlseqdt0(X1,X2) )
& aElementOf0(X1,xU) )
=> sdtlseqdt0(X1,X0) )
& ( aLowerBoundOfIn0(X0,xP,xU)
| ( ! [X1] :
( aElementOf0(X1,xP)
=> sdtlseqdt0(X0,X1) )
& aElementOf0(X0,xU) ) )
& aElementOf0(X0,xU) ) ),
file('/export/starexec/sandbox/tmp/tmp.5vc5qPtc8b/Vampire---4.8_27086',m__) ).
fof(f314,plain,
sP2(xP),
inference(subsumption_resolution,[],[f313,f166]) ).
fof(f166,plain,
aSet0(xP),
inference(cnf_transformation,[],[f84]) ).
fof(f84,plain,
( xP = cS1241(xU,xf,xT)
& ! [X0] :
( ( aElementOf0(X0,xP)
| ( ~ aUpperBoundOfIn0(X0,xT,xU)
& ~ sdtlseqdt0(sK9(X0),X0)
& aElementOf0(sK9(X0),xT) )
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
| ~ aElementOf0(X0,xU) )
& ( ( aUpperBoundOfIn0(X0,xT,xU)
& ! [X2] :
( sdtlseqdt0(X2,X0)
| ~ aElementOf0(X2,xT) )
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& aElementOf0(X0,xU) )
| ~ aElementOf0(X0,xP) ) )
& aSet0(xP) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f41,f83]) ).
fof(f83,plain,
! [X0] :
( ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xT) )
=> ( ~ sdtlseqdt0(sK9(X0),X0)
& aElementOf0(sK9(X0),xT) ) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
( xP = cS1241(xU,xf,xT)
& ! [X0] :
( ( aElementOf0(X0,xP)
| ( ~ aUpperBoundOfIn0(X0,xT,xU)
& ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xT) ) )
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
| ~ aElementOf0(X0,xU) )
& ( ( aUpperBoundOfIn0(X0,xT,xU)
& ! [X2] :
( sdtlseqdt0(X2,X0)
| ~ aElementOf0(X2,xT) )
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& aElementOf0(X0,xU) )
| ~ aElementOf0(X0,xP) ) )
& aSet0(xP) ),
inference(flattening,[],[f40]) ).
fof(f40,plain,
( xP = cS1241(xU,xf,xT)
& ! [X0] :
( ( aElementOf0(X0,xP)
| ( ~ aUpperBoundOfIn0(X0,xT,xU)
& ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xT) ) )
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
| ~ aElementOf0(X0,xU) )
& ( ( aUpperBoundOfIn0(X0,xT,xU)
& ! [X2] :
( sdtlseqdt0(X2,X0)
| ~ aElementOf0(X2,xT) )
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& aElementOf0(X0,xU) )
| ~ aElementOf0(X0,xP) ) )
& aSet0(xP) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,plain,
( xP = cS1241(xU,xf,xT)
& ! [X0] :
( ( ( ( aUpperBoundOfIn0(X0,xT,xU)
| ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) ) )
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& aElementOf0(X0,xU) )
=> aElementOf0(X0,xP) )
& ( aElementOf0(X0,xP)
=> ( aUpperBoundOfIn0(X0,xT,xU)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X0) )
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& aElementOf0(X0,xU) ) ) )
& aSet0(xP) ),
inference(rectify,[],[f27]) ).
fof(f27,axiom,
( xP = cS1241(xU,xf,xT)
& ! [X0] :
( ( ( ( aUpperBoundOfIn0(X0,xT,xU)
| ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) ) )
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& aElementOf0(X0,xU) )
=> aElementOf0(X0,xP) )
& ( aElementOf0(X0,xP)
=> ( aUpperBoundOfIn0(X0,xT,xU)
& ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& aElementOf0(X0,xU) ) ) )
& aSet0(xP) ),
file('/export/starexec/sandbox/tmp/tmp.5vc5qPtc8b/Vampire---4.8_27086',m__1244) ).
fof(f313,plain,
( ~ aSet0(xP)
| sP2(xP) ),
inference(duplicate_literal_removal,[],[f312]) ).
fof(f312,plain,
( ~ aSet0(xP)
| sP2(xP)
| sP2(xP)
| ~ aSet0(xP) ),
inference(resolution,[],[f274,f146]) ).
fof(f146,plain,
! [X2] :
( aElementOf0(sK8(X2),X2)
| sP2(X2)
| ~ aSet0(X2) ),
inference(cnf_transformation,[],[f82]) ).
fof(f82,plain,
( isOn0(xf,xU)
& xU = szRzazndt0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& isMonotone0(xf)
& ! [X0,X1] :
( sdtlseqdt0(sdtlpdtrp0(xf,X0),sdtlpdtrp0(xf,X1))
| ~ sdtlseqdt0(X0,X1)
| ~ aElementOf0(X1,szDzozmdt0(xf))
| ~ aElementOf0(X0,szDzozmdt0(xf)) )
& aFunction0(xf)
& aCompleteLattice0(xU)
& ! [X2] :
( sP2(X2)
| ( ~ aSubsetOf0(X2,xU)
& ( ( ~ aElementOf0(sK8(X2),xU)
& aElementOf0(sK8(X2),X2) )
| ~ aSet0(X2) ) ) )
& aSet0(xU) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f65,f81]) ).
fof(f81,plain,
! [X2] :
( ? [X3] :
( ~ aElementOf0(X3,xU)
& aElementOf0(X3,X2) )
=> ( ~ aElementOf0(sK8(X2),xU)
& aElementOf0(sK8(X2),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f65,plain,
( isOn0(xf,xU)
& xU = szRzazndt0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& isMonotone0(xf)
& ! [X0,X1] :
( sdtlseqdt0(sdtlpdtrp0(xf,X0),sdtlpdtrp0(xf,X1))
| ~ sdtlseqdt0(X0,X1)
| ~ aElementOf0(X1,szDzozmdt0(xf))
| ~ aElementOf0(X0,szDzozmdt0(xf)) )
& aFunction0(xf)
& aCompleteLattice0(xU)
& ! [X2] :
( sP2(X2)
| ( ~ aSubsetOf0(X2,xU)
& ( ? [X3] :
( ~ aElementOf0(X3,xU)
& aElementOf0(X3,X2) )
| ~ aSet0(X2) ) ) )
& aSet0(xU) ),
inference(definition_folding,[],[f37,f64,f63,f62]) ).
fof(f62,plain,
! [X2] :
( ? [X5] :
( aSupremumOfIn0(X5,X2,xU)
& ! [X6] :
( sdtlseqdt0(X5,X6)
| ( ~ aUpperBoundOfIn0(X6,X2,xU)
& ( ? [X7] :
( ~ sdtlseqdt0(X7,X6)
& aElementOf0(X7,X2) )
| ~ aElementOf0(X6,xU) ) ) )
& aUpperBoundOfIn0(X5,X2,xU)
& ! [X8] :
( sdtlseqdt0(X8,X5)
| ~ aElementOf0(X8,X2) )
& aElementOf0(X5,xU)
& aElementOf0(X5,xU) )
| ~ sP0(X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f63,plain,
! [X4,X2] :
( ! [X9] :
( sdtlseqdt0(X9,X4)
| ( ~ aLowerBoundOfIn0(X9,X2,xU)
& ( ? [X10] :
( ~ sdtlseqdt0(X9,X10)
& aElementOf0(X10,X2) )
| ~ aElementOf0(X9,xU) ) ) )
| ~ sP1(X4,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f37,plain,
( isOn0(xf,xU)
& xU = szRzazndt0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& isMonotone0(xf)
& ! [X0,X1] :
( sdtlseqdt0(sdtlpdtrp0(xf,X0),sdtlpdtrp0(xf,X1))
| ~ sdtlseqdt0(X0,X1)
| ~ aElementOf0(X1,szDzozmdt0(xf))
| ~ aElementOf0(X0,szDzozmdt0(xf)) )
& aFunction0(xf)
& aCompleteLattice0(xU)
& ! [X2] :
( ? [X4] :
( ? [X5] :
( aSupremumOfIn0(X5,X2,xU)
& ! [X6] :
( sdtlseqdt0(X5,X6)
| ( ~ aUpperBoundOfIn0(X6,X2,xU)
& ( ? [X7] :
( ~ sdtlseqdt0(X7,X6)
& aElementOf0(X7,X2) )
| ~ aElementOf0(X6,xU) ) ) )
& aUpperBoundOfIn0(X5,X2,xU)
& ! [X8] :
( sdtlseqdt0(X8,X5)
| ~ aElementOf0(X8,X2) )
& aElementOf0(X5,xU)
& aElementOf0(X5,xU) )
& aInfimumOfIn0(X4,X2,xU)
& ! [X9] :
( sdtlseqdt0(X9,X4)
| ( ~ aLowerBoundOfIn0(X9,X2,xU)
& ( ? [X10] :
( ~ sdtlseqdt0(X9,X10)
& aElementOf0(X10,X2) )
| ~ aElementOf0(X9,xU) ) ) )
& aLowerBoundOfIn0(X4,X2,xU)
& ! [X11] :
( sdtlseqdt0(X4,X11)
| ~ aElementOf0(X11,X2) )
& aElementOf0(X4,xU)
& aElementOf0(X4,xU) )
| ( ~ aSubsetOf0(X2,xU)
& ( ? [X3] :
( ~ aElementOf0(X3,xU)
& aElementOf0(X3,X2) )
| ~ aSet0(X2) ) ) )
& aSet0(xU) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
( isOn0(xf,xU)
& xU = szRzazndt0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& isMonotone0(xf)
& ! [X0,X1] :
( sdtlseqdt0(sdtlpdtrp0(xf,X0),sdtlpdtrp0(xf,X1))
| ~ sdtlseqdt0(X0,X1)
| ~ aElementOf0(X1,szDzozmdt0(xf))
| ~ aElementOf0(X0,szDzozmdt0(xf)) )
& aFunction0(xf)
& aCompleteLattice0(xU)
& ! [X2] :
( ? [X4] :
( ? [X5] :
( aSupremumOfIn0(X5,X2,xU)
& ! [X6] :
( sdtlseqdt0(X5,X6)
| ( ~ aUpperBoundOfIn0(X6,X2,xU)
& ( ? [X7] :
( ~ sdtlseqdt0(X7,X6)
& aElementOf0(X7,X2) )
| ~ aElementOf0(X6,xU) ) ) )
& aUpperBoundOfIn0(X5,X2,xU)
& ! [X8] :
( sdtlseqdt0(X8,X5)
| ~ aElementOf0(X8,X2) )
& aElementOf0(X5,xU)
& aElementOf0(X5,xU) )
& aInfimumOfIn0(X4,X2,xU)
& ! [X9] :
( sdtlseqdt0(X9,X4)
| ( ~ aLowerBoundOfIn0(X9,X2,xU)
& ( ? [X10] :
( ~ sdtlseqdt0(X9,X10)
& aElementOf0(X10,X2) )
| ~ aElementOf0(X9,xU) ) ) )
& aLowerBoundOfIn0(X4,X2,xU)
& ! [X11] :
( sdtlseqdt0(X4,X11)
| ~ aElementOf0(X11,X2) )
& aElementOf0(X4,xU)
& aElementOf0(X4,xU) )
| ( ~ aSubsetOf0(X2,xU)
& ( ? [X3] :
( ~ aElementOf0(X3,xU)
& aElementOf0(X3,X2) )
| ~ aSet0(X2) ) ) )
& aSet0(xU) ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,plain,
( isOn0(xf,xU)
& xU = szRzazndt0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& isMonotone0(xf)
& ! [X0,X1] :
( ( aElementOf0(X1,szDzozmdt0(xf))
& aElementOf0(X0,szDzozmdt0(xf)) )
=> ( sdtlseqdt0(X0,X1)
=> sdtlseqdt0(sdtlpdtrp0(xf,X0),sdtlpdtrp0(xf,X1)) ) )
& aFunction0(xf)
& aCompleteLattice0(xU)
& ! [X2] :
( ( aSubsetOf0(X2,xU)
| ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,xU) )
& aSet0(X2) ) )
=> ? [X4] :
( ? [X5] :
( aSupremumOfIn0(X5,X2,xU)
& ! [X6] :
( ( aUpperBoundOfIn0(X6,X2,xU)
| ( ! [X7] :
( aElementOf0(X7,X2)
=> sdtlseqdt0(X7,X6) )
& aElementOf0(X6,xU) ) )
=> sdtlseqdt0(X5,X6) )
& aUpperBoundOfIn0(X5,X2,xU)
& ! [X8] :
( aElementOf0(X8,X2)
=> sdtlseqdt0(X8,X5) )
& aElementOf0(X5,xU)
& aElementOf0(X5,xU) )
& aInfimumOfIn0(X4,X2,xU)
& ! [X9] :
( ( aLowerBoundOfIn0(X9,X2,xU)
| ( ! [X10] :
( aElementOf0(X10,X2)
=> sdtlseqdt0(X9,X10) )
& aElementOf0(X9,xU) ) )
=> sdtlseqdt0(X9,X4) )
& aLowerBoundOfIn0(X4,X2,xU)
& ! [X11] :
( aElementOf0(X11,X2)
=> sdtlseqdt0(X4,X11) )
& aElementOf0(X4,xU)
& aElementOf0(X4,xU) ) )
& aSet0(xU) ),
inference(rectify,[],[f24]) ).
fof(f24,axiom,
( isOn0(xf,xU)
& xU = szRzazndt0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& isMonotone0(xf)
& ! [X0,X1] :
( ( aElementOf0(X1,szDzozmdt0(xf))
& aElementOf0(X0,szDzozmdt0(xf)) )
=> ( sdtlseqdt0(X0,X1)
=> sdtlseqdt0(sdtlpdtrp0(xf,X0),sdtlpdtrp0(xf,X1)) ) )
& aFunction0(xf)
& aCompleteLattice0(xU)
& ! [X0] :
( ( aSubsetOf0(X0,xU)
| ( ! [X1] :
( aElementOf0(X1,X0)
=> aElementOf0(X1,xU) )
& aSet0(X0) ) )
=> ? [X1] :
( ? [X2] :
( aSupremumOfIn0(X2,X0,xU)
& ! [X3] :
( ( aUpperBoundOfIn0(X3,X0,xU)
| ( ! [X4] :
( aElementOf0(X4,X0)
=> sdtlseqdt0(X4,X3) )
& aElementOf0(X3,xU) ) )
=> sdtlseqdt0(X2,X3) )
& aUpperBoundOfIn0(X2,X0,xU)
& ! [X3] :
( aElementOf0(X3,X0)
=> sdtlseqdt0(X3,X2) )
& aElementOf0(X2,xU)
& aElementOf0(X2,xU) )
& aInfimumOfIn0(X1,X0,xU)
& ! [X2] :
( ( aLowerBoundOfIn0(X2,X0,xU)
| ( ! [X3] :
( aElementOf0(X3,X0)
=> sdtlseqdt0(X2,X3) )
& aElementOf0(X2,xU) ) )
=> sdtlseqdt0(X2,X1) )
& aLowerBoundOfIn0(X1,X0,xU)
& ! [X2] :
( aElementOf0(X2,X0)
=> sdtlseqdt0(X1,X2) )
& aElementOf0(X1,xU)
& aElementOf0(X1,xU) ) )
& aSet0(xU) ),
file('/export/starexec/sandbox/tmp/tmp.5vc5qPtc8b/Vampire---4.8_27086',m__1123) ).
fof(f274,plain,
! [X0] :
( ~ aElementOf0(sK8(X0),xP)
| ~ aSet0(X0)
| sP2(X0) ),
inference(resolution,[],[f147,f167]) ).
fof(f167,plain,
! [X0] :
( aElementOf0(X0,xU)
| ~ aElementOf0(X0,xP) ),
inference(cnf_transformation,[],[f84]) ).
fof(f147,plain,
! [X2] :
( ~ aElementOf0(sK8(X2),xU)
| sP2(X2)
| ~ aSet0(X2) ),
inference(cnf_transformation,[],[f82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : LAT385+4 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.16 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.37 % Computer : n018.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri May 3 12:34:32 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.38 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.5vc5qPtc8b/Vampire---4.8_27086
% 0.59/0.76 % (27200)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.59/0.77 % (27202)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.59/0.77 % (27195)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.59/0.77 % (27197)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.59/0.77 % (27196)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.59/0.77 % (27200)First to succeed.
% 0.59/0.77 % (27200)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-27194"
% 0.59/0.77 % (27202)Also succeeded, but the first one will report.
% 0.59/0.77 % (27200)Refutation found. Thanks to Tanya!
% 0.59/0.77 % SZS status Theorem for Vampire---4
% 0.59/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.77 % (27200)------------------------------
% 0.59/0.77 % (27200)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (27200)Termination reason: Refutation
% 0.59/0.77
% 0.59/0.77 % (27200)Memory used [KB]: 1152
% 0.59/0.77 % (27200)Time elapsed: 0.005 s
% 0.59/0.77 % (27200)Instructions burned: 12 (million)
% 0.59/0.77 % (27194)Success in time 0.391 s
% 0.59/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------