TSTP Solution File: LAT381+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LAT381+1 : TPTP v8.2.0. 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 : n009.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 : Mon May 20 23:36:41 EDT 2024
% Result : Theorem 0.55s 0.73s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 20 unt; 0 def)
% Number of atoms : 78 ( 8 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 79 ( 34 ~; 29 |; 7 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 32 ( 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f121,plain,
$false,
inference(subsumption_resolution,[],[f119,f83]) ).
fof(f83,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(unit_resulting_resolution,[],[f33,f34,f36,f47]) ).
fof(f47,plain,
! [X2,X0,X1] :
( ~ aSupremumOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| aUpperBoundOfIn0(X2,X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( aSupremumOfIn0(X2,X1,X0)
<=> ( ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aUpperBoundOfIn0(X3,X1,X0) )
& aUpperBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
=> ! [X2] :
( aSupremumOfIn0(X2,X1,X0)
<=> ( ! [X3] :
( aUpperBoundOfIn0(X3,X1,X0)
=> sdtlseqdt0(X2,X3) )
& aUpperBoundOfIn0(X2,X1,X0)
& aElementOf0(X2,X0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSup) ).
fof(f36,plain,
aSupremumOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f16]) ).
fof(f16,axiom,
( aSupremumOfIn0(xv,xS,xT)
& aSupremumOfIn0(xu,xS,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__744) ).
fof(f34,plain,
aSubsetOf0(xS,xT),
inference(cnf_transformation,[],[f15]) ).
fof(f15,axiom,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__725_01) ).
fof(f33,plain,
aSet0(xT),
inference(cnf_transformation,[],[f14]) ).
fof(f14,axiom,
aSet0(xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__725) ).
fof(f119,plain,
~ aUpperBoundOfIn0(xv,xS,xT),
inference(unit_resulting_resolution,[],[f33,f34,f35,f112,f45]) ).
fof(f45,plain,
! [X2,X3,X0,X1] :
( ~ aSupremumOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aUpperBoundOfIn0(X3,X1,X0)
| sdtlseqdt0(X2,X3)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f112,plain,
~ sdtlseqdt0(xu,xv),
inference(unit_resulting_resolution,[],[f89,f68,f37,f105,f48]) ).
fof(f48,plain,
! [X0,X1] :
( ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X1)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( ( aElement0(X1)
& aElement0(X0) )
=> ( ( sdtlseqdt0(X1,X0)
& sdtlseqdt0(X0,X1) )
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mASymm) ).
fof(f105,plain,
sdtlseqdt0(xv,xu),
inference(unit_resulting_resolution,[],[f33,f36,f34,f62,f45]) ).
fof(f62,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(unit_resulting_resolution,[],[f33,f34,f35,f47]) ).
fof(f37,plain,
xu != xv,
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
xu != xv,
inference(flattening,[],[f18]) ).
fof(f18,negated_conjecture,
xu != xv,
inference(negated_conjecture,[],[f17]) ).
fof(f17,conjecture,
xu = xv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f68,plain,
aElement0(xu),
inference(unit_resulting_resolution,[],[f33,f61,f42]) ).
fof(f42,plain,
! [X0,X1] :
( ~ aElementOf0(X1,X0)
| ~ aSet0(X0)
| aElement0(X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(f61,plain,
aElementOf0(xu,xT),
inference(unit_resulting_resolution,[],[f33,f34,f35,f46]) ).
fof(f46,plain,
! [X2,X0,X1] :
( ~ aSupremumOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| aElementOf0(X2,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f89,plain,
aElement0(xv),
inference(unit_resulting_resolution,[],[f33,f82,f42]) ).
fof(f82,plain,
aElementOf0(xv,xT),
inference(unit_resulting_resolution,[],[f33,f34,f36,f46]) ).
fof(f35,plain,
aSupremumOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LAT381+1 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13 % 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.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 20:28:22 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 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/benchmark/theBenchmark.p
% 0.55/0.72 % (15372)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 theBenchmark for (2996ds/83Mi)
% 0.55/0.73 % (15366)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 theBenchmark for (2996ds/34Mi)
% 0.55/0.73 % (15369)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.55/0.73 % (15368)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.73 % (15371)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.55/0.73 % (15373)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.55/0.73 % (15372)First to succeed.
% 0.55/0.73 % (15372)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-15365"
% 0.55/0.73 % (15369)Refutation not found, incomplete strategy% (15369)------------------------------
% 0.55/0.73 % (15369)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (15369)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (15369)Memory used [KB]: 1040
% 0.55/0.73 % (15369)Time elapsed: 0.003 s
% 0.55/0.73 % (15369)Instructions burned: 3 (million)
% 0.55/0.73 % (15367)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 theBenchmark for (2996ds/51Mi)
% 0.55/0.73 % (15369)------------------------------
% 0.55/0.73 % (15369)------------------------------
% 0.55/0.73 % (15371)Also succeeded, but the first one will report.
% 0.55/0.73 % (15373)Also succeeded, but the first one will report.
% 0.55/0.73 % (15372)Refutation found. Thanks to Tanya!
% 0.55/0.73 % SZS status Theorem for theBenchmark
% 0.55/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.73 % (15372)------------------------------
% 0.55/0.73 % (15372)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (15372)Termination reason: Refutation
% 0.55/0.73
% 0.55/0.73 % (15372)Memory used [KB]: 1055
% 0.55/0.73 % (15372)Time elapsed: 0.004 s
% 0.55/0.73 % (15372)Instructions burned: 6 (million)
% 0.55/0.73 % (15365)Success in time 0.372 s
% 0.55/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------