TSTP Solution File: LAT388+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LAT388+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 : n017.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:16 EDT 2024
% Result : Theorem 0.56s 0.76s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 3 unt; 0 def)
% Number of atoms : 141 ( 4 equ)
% Maximal formula atoms : 12 ( 7 avg)
% Number of connectives : 170 ( 47 ~; 33 |; 73 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 44 ( 31 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f302,plain,
$false,
inference(resolution,[],[f208,f216]) ).
fof(f216,plain,
! [X0] : ~ aSupremumOfIn0(X0,xT,xS),
inference(cnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xT,xS)
& ( sP3(X0)
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ( ~ sdtlseqdt0(sK13(X0),X0)
& aElementOf0(sK13(X0),xT) )
| ~ aElementOf0(X0,xS) ) )
| ~ aElementOf0(X0,xS) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f101,f102]) ).
fof(f102,plain,
! [X0] :
( ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xT) )
=> ( ~ sdtlseqdt0(sK13(X0),X0)
& aElementOf0(sK13(X0),xT) ) ),
introduced(choice_axiom,[]) ).
fof(f101,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xT,xS)
& ( sP3(X0)
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xT) )
| ~ aElementOf0(X0,xS) ) )
| ~ aElementOf0(X0,xS) ) ),
inference(rectify,[],[f76]) ).
fof(f76,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xT,xS)
& ( sP3(X0)
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ? [X3] :
( ~ sdtlseqdt0(X3,X0)
& aElementOf0(X3,xT) )
| ~ aElementOf0(X0,xS) ) )
| ~ aElementOf0(X0,xS) ) ),
inference(definition_folding,[],[f52,f75]) ).
fof(f75,plain,
! [X0] :
( ? [X1] :
( ~ sdtlseqdt0(X0,X1)
& aUpperBoundOfIn0(X1,xT,xS)
& ! [X2] :
( sdtlseqdt0(X2,X1)
| ~ aElementOf0(X2,xT) )
& aElementOf0(X1,xS) )
| ~ sP3(X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f52,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xT,xS)
& ( ? [X1] :
( ~ sdtlseqdt0(X0,X1)
& aUpperBoundOfIn0(X1,xT,xS)
& ! [X2] :
( sdtlseqdt0(X2,X1)
| ~ aElementOf0(X2,xT) )
& aElementOf0(X1,xS) )
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ? [X3] :
( ~ sdtlseqdt0(X3,X0)
& aElementOf0(X3,xT) )
| ~ aElementOf0(X0,xS) ) )
| ~ aElementOf0(X0,xS) ) ),
inference(flattening,[],[f51]) ).
fof(f51,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xT,xS)
& ( ? [X1] :
( ~ sdtlseqdt0(X0,X1)
& aUpperBoundOfIn0(X1,xT,xS)
& ! [X2] :
( sdtlseqdt0(X2,X1)
| ~ aElementOf0(X2,xT) )
& aElementOf0(X1,xS) )
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ? [X3] :
( ~ sdtlseqdt0(X3,X0)
& aElementOf0(X3,xT) )
| ~ aElementOf0(X0,xS) ) )
| ~ aElementOf0(X0,xS) ) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,plain,
~ ? [X0] :
( aSupremumOfIn0(X0,xT,xS)
| ( ! [X1] :
( ( aUpperBoundOfIn0(X1,xT,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
& aElementOf0(X1,xS) )
=> sdtlseqdt0(X0,X1) )
& ( aUpperBoundOfIn0(X0,xT,xS)
| ( ! [X3] :
( aElementOf0(X3,xT)
=> sdtlseqdt0(X3,X0) )
& aElementOf0(X0,xS) ) )
& aElementOf0(X0,xS) ) ),
inference(rectify,[],[f32]) ).
fof(f32,negated_conjecture,
~ ? [X0] :
( aSupremumOfIn0(X0,xT,xS)
| ( ! [X1] :
( ( aUpperBoundOfIn0(X1,xT,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
& aElementOf0(X1,xS) )
=> sdtlseqdt0(X0,X1) )
& ( aUpperBoundOfIn0(X0,xT,xS)
| ( ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xS) ) )
& aElementOf0(X0,xS) ) ),
inference(negated_conjecture,[],[f31]) ).
fof(f31,conjecture,
? [X0] :
( aSupremumOfIn0(X0,xT,xS)
| ( ! [X1] :
( ( aUpperBoundOfIn0(X1,xT,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
& aElementOf0(X1,xS) )
=> sdtlseqdt0(X0,X1) )
& ( aUpperBoundOfIn0(X0,xT,xS)
| ( ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xS) ) )
& aElementOf0(X0,xS) ) ),
file('/export/starexec/sandbox/tmp/tmp.rIfgD8m7pZ/Vampire---4.8_682',m__) ).
fof(f208,plain,
aSupremumOfIn0(xp,xT,xS),
inference(cnf_transformation,[],[f97]) ).
fof(f97,plain,
( aSupremumOfIn0(xp,xT,xS)
& ! [X0] :
( sdtlseqdt0(xp,X0)
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ( ~ sdtlseqdt0(sK11(X0),X0)
& aElementOf0(sK11(X0),xT) )
| ~ aElementOf0(X0,xS) ) ) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X2] :
( sdtlseqdt0(X2,xp)
| ~ aElementOf0(X2,xT) )
& aFixedPointOf0(xp,xf)
& xp = sdtlpdtrp0(xf,xp)
& aElementOf0(xp,szDzozmdt0(xf)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f50,f96]) ).
fof(f96,plain,
! [X0] :
( ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xT) )
=> ( ~ sdtlseqdt0(sK11(X0),X0)
& aElementOf0(sK11(X0),xT) ) ),
introduced(choice_axiom,[]) ).
fof(f50,plain,
( aSupremumOfIn0(xp,xT,xS)
& ! [X0] :
( sdtlseqdt0(xp,X0)
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xT) )
| ~ aElementOf0(X0,xS) ) ) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X2] :
( sdtlseqdt0(X2,xp)
| ~ aElementOf0(X2,xT) )
& aFixedPointOf0(xp,xf)
& xp = sdtlpdtrp0(xf,xp)
& aElementOf0(xp,szDzozmdt0(xf)) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,plain,
( aSupremumOfIn0(xp,xT,xS)
& ! [X0] :
( ( aUpperBoundOfIn0(X0,xT,xS)
| ( ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xS) ) )
=> sdtlseqdt0(xp,X0) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,xp) )
& aFixedPointOf0(xp,xf)
& xp = sdtlpdtrp0(xf,xp)
& aElementOf0(xp,szDzozmdt0(xf)) ),
inference(rectify,[],[f30]) ).
fof(f30,axiom,
( aSupremumOfIn0(xp,xT,xS)
& ! [X0] :
( ( aUpperBoundOfIn0(X0,xT,xS)
| ( ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xS) ) )
=> sdtlseqdt0(xp,X0) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X0] :
( aElementOf0(X0,xT)
=> sdtlseqdt0(X0,xp) )
& aFixedPointOf0(xp,xf)
& xp = sdtlpdtrp0(xf,xp)
& aElementOf0(xp,szDzozmdt0(xf)) ),
file('/export/starexec/sandbox/tmp/tmp.rIfgD8m7pZ/Vampire---4.8_682',m__1330) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : LAT388+4 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.15 % 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.15/0.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 11:49:21 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 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.rIfgD8m7pZ/Vampire---4.8_682
% 0.56/0.75 % (807)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.56/0.76 % (800)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.56/0.76 % (803)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.56/0.76 % (802)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.56/0.76 % (801)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.56/0.76 % (805)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.56/0.76 % (804)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.56/0.76 % (806)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.56/0.76 % (807)First to succeed.
% 0.56/0.76 % (807)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-799"
% 0.56/0.76 % (807)Refutation found. Thanks to Tanya!
% 0.56/0.76 % SZS status Theorem for Vampire---4
% 0.56/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.76 % (807)------------------------------
% 0.56/0.76 % (807)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.76 % (807)Termination reason: Refutation
% 0.56/0.76
% 0.56/0.76 % (807)Memory used [KB]: 1148
% 0.56/0.76 % (807)Time elapsed: 0.004 s
% 0.56/0.76 % (807)Instructions burned: 9 (million)
% 0.56/0.76 % (799)Success in time 0.386 s
% 0.56/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------