%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM845+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:17:14 PM UTC 2026
% Result : Theorem 2.55s 1.29s
% Output : Refutation 3.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 56 ( 36 unt; 1 def)
% Number of atoms : 76 ( 68 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 39 ( 19 ~; 12 |; 2 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 28 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
( vmul(vsucc(vd411),X0) = vplus(vmul(vd411,X0),X0)
=> vmul(vsucc(vd411),vsucc(X0)) = vplus(vmul(vd411,vsucc(X0)),vsucc(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(ind(267), imp(267))') ).
fof(f2,negated_conjecture,
~ ! [X0] :
( vmul(vsucc(vd411),X0) = vplus(vmul(vd411,X0),X0)
=> vmul(vsucc(vd411),vsucc(X0)) = vplus(vmul(vd411,vsucc(X0)),vsucc(X0)) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,axiom,
! [X0] :
( vmul(vsucc(vd411),X0) = vplus(vmul(vd411,X0),X0)
=> vplus(vplus(vmul(vd411,X0),vd411),vsucc(X0)) = vplus(vmul(vd411,vsucc(X0)),vsucc(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(conseq(263), 1), 0)') ).
fof(f5,axiom,
! [X0] :
( vmul(vsucc(vd411),X0) = vplus(vmul(vd411,X0),X0)
=> vplus(vmul(vd411,X0),vsucc(vplus(vd411,X0))) = vplus(vmul(vd411,X0),vplus(vd411,vsucc(X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(conseq(263), 1), 2)') ).
fof(f7,axiom,
! [X0] :
( vmul(vsucc(vd411),X0) = vplus(vmul(vd411,X0),X0)
=> vplus(vmul(vd411,X0),vplus(X0,vsucc(vd411))) = vplus(vmul(vd411,X0),vplus(vsucc(vd411),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(conseq(263), 1), 4)') ).
fof(f10,axiom,
! [X0] :
( vmul(vsucc(vd411),X0) = vplus(vmul(vd411,X0),X0)
=> vmul(vsucc(vd411),vsucc(X0)) = vplus(vmul(vsucc(vd411),X0),vsucc(vd411)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(conseq(263), 1), 7)') ).
fof(f50,axiom,
! [X0,X1] : vplus(X1,X0) = vplus(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof(f51,axiom,
! [X0,X1] : vplus(vsucc(X0),X1) = vsucc(vplus(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(52, 0), 0)') ).
fof(f53,axiom,
! [X0,X1,X2] : vplus(vplus(X0,X1),X2) = vplus(X0,vplus(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).
fof(f60,plain,
? [X0] :
( vmul(vsucc(vd411),vsucc(X0)) != vplus(vmul(vd411,vsucc(X0)),vsucc(X0))
& vmul(vsucc(vd411),X0) = vplus(vmul(vd411,X0),X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f61,plain,
! [X0] :
( vmul(vsucc(vd411),vsucc(X0)) = vplus(vmul(vsucc(vd411),X0),vsucc(vd411))
| vmul(vsucc(vd411),X0) != vplus(vmul(vd411,X0),X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f64,plain,
! [X0] :
( vplus(vmul(vd411,X0),vplus(X0,vsucc(vd411))) = vplus(vmul(vd411,X0),vplus(vsucc(vd411),X0))
| vmul(vsucc(vd411),X0) != vplus(vmul(vd411,X0),X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f66,plain,
! [X0] :
( vplus(vmul(vd411,X0),vsucc(vplus(vd411,X0))) = vplus(vmul(vd411,X0),vplus(vd411,vsucc(X0)))
| vmul(vsucc(vd411),X0) != vplus(vmul(vd411,X0),X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f68,plain,
! [X0] :
( vplus(vplus(vmul(vd411,X0),vd411),vsucc(X0)) = vplus(vmul(vd411,vsucc(X0)),vsucc(X0))
| vmul(vsucc(vd411),X0) != vplus(vmul(vd411,X0),X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f77,plain,
( vmul(vsucc(vd411),vsucc(sK0)) != vplus(vmul(vd411,vsucc(sK0)),vsucc(sK0))
& vmul(vsucc(vd411),sK0) = vplus(vmul(vd411,sK0),sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f60]) ).
fof(f79,plain,
vmul(vsucc(vd411),sK0) = vplus(vmul(vd411,sK0),sK0),
inference(cnf_transformation,[],[f77]) ).
fof(f80,plain,
vmul(vsucc(vd411),vsucc(sK0)) != vplus(vmul(vd411,vsucc(sK0)),vsucc(sK0)),
inference(cnf_transformation,[],[f77]) ).
fof(f84,plain,
! [X0] :
( vmul(vsucc(vd411),X0) != vplus(vmul(vd411,X0),X0)
| vmul(vsucc(vd411),vsucc(X0)) = vplus(vmul(vsucc(vd411),X0),vsucc(vd411)) ),
inference(cnf_transformation,[],[f61]) ).
fof(f87,plain,
! [X0] :
( vmul(vsucc(vd411),X0) != vplus(vmul(vd411,X0),X0)
| vplus(vmul(vd411,X0),vplus(vsucc(vd411),X0)) = vplus(vmul(vd411,X0),vplus(X0,vsucc(vd411))) ),
inference(cnf_transformation,[],[f64]) ).
fof(f89,plain,
! [X0] :
( vmul(vsucc(vd411),X0) != vplus(vmul(vd411,X0),X0)
| vplus(vmul(vd411,X0),vplus(vd411,vsucc(X0))) = vplus(vmul(vd411,X0),vsucc(vplus(vd411,X0))) ),
inference(cnf_transformation,[],[f66]) ).
fof(f91,plain,
! [X0] :
( vmul(vsucc(vd411),X0) != vplus(vmul(vd411,X0),X0)
| vplus(vmul(vd411,vsucc(X0)),vsucc(X0)) = vplus(vplus(vmul(vd411,X0),vd411),vsucc(X0)) ),
inference(cnf_transformation,[],[f68]) ).
fof(f95,plain,
! [X0,X1] : vplus(vsucc(X0),X1) = vsucc(vplus(X0,X1)),
inference(cnf_transformation,[],[f51]) ).
fof(f96,plain,
! [X2,X0,X1] : vplus(vplus(X0,X1),X2) = vplus(X0,vplus(X1,X2)),
inference(cnf_transformation,[],[f53]) ).
fof(f97,plain,
! [X0,X1] : vplus(X0,X1) = vplus(X1,X0),
inference(cnf_transformation,[],[f50]) ).
fof(f106,definition,
~ sP3(vmul(vsucc(vd411),vsucc(sK0))),
introduced(definition,[new_symbols(definition,[sP3])],[inequality_splitting_name_introduction]) ).
fof(f107,plain,
sP3(vplus(vmul(vd411,vsucc(sK0)),vsucc(sK0))),
inference(inequality_splitting,[],[f80,f106]) ).
fof(f112,plain,
vmul(vsucc(vd411),sK0) = vplus(sK0,vmul(vd411,sK0)),
inference(forward_demodulation,[],[f79,f97]) ).
fof(f113,plain,
sP3(vplus(vsucc(sK0),vmul(vd411,vsucc(sK0)))),
inference(forward_demodulation,[],[f107,f97]) ).
fof(f114,plain,
( vplus(vmul(vd411,sK0),sK0) != vplus(sK0,vmul(vd411,sK0))
| vmul(vsucc(vd411),vsucc(sK0)) = vplus(vplus(sK0,vmul(vd411,sK0)),vsucc(vd411)) ),
inference(superposition,[],[f84,f112]) ).
fof(f117,plain,
( vplus(vmul(vd411,sK0),sK0) != vplus(sK0,vmul(vd411,sK0))
| vplus(vmul(vd411,sK0),vplus(sK0,vsucc(vd411))) = vplus(vmul(vd411,sK0),vplus(vsucc(vd411),sK0)) ),
inference(superposition,[],[f87,f112]) ).
fof(f119,plain,
( vplus(vmul(vd411,sK0),sK0) != vplus(sK0,vmul(vd411,sK0))
| vplus(vmul(vd411,sK0),vsucc(vplus(vd411,sK0))) = vplus(vmul(vd411,sK0),vplus(vd411,vsucc(sK0))) ),
inference(superposition,[],[f89,f112]) ).
fof(f121,plain,
( vplus(vmul(vd411,sK0),sK0) != vplus(sK0,vmul(vd411,sK0))
| vplus(vmul(vd411,vsucc(sK0)),vsucc(sK0)) = vplus(vplus(vmul(vd411,sK0),vd411),vsucc(sK0)) ),
inference(superposition,[],[f91,f112]) ).
fof(f122,plain,
vplus(vmul(vd411,vsucc(sK0)),vsucc(sK0)) = vplus(vplus(vmul(vd411,sK0),vd411),vsucc(sK0)),
inference(forward_subsumption_resolution,[],[f121,f97]) ).
fof(f123,plain,
vplus(vmul(vd411,sK0),vsucc(vplus(vd411,sK0))) = vplus(vmul(vd411,sK0),vplus(vd411,vsucc(sK0))),
inference(forward_subsumption_resolution,[],[f119,f97]) ).
fof(f125,plain,
vplus(vmul(vd411,sK0),vplus(sK0,vsucc(vd411))) = vplus(vmul(vd411,sK0),vplus(vsucc(vd411),sK0)),
inference(forward_subsumption_resolution,[],[f117,f97]) ).
fof(f127,plain,
vmul(vsucc(vd411),vsucc(sK0)) = vplus(vplus(sK0,vmul(vd411,sK0)),vsucc(vd411)),
inference(forward_subsumption_resolution,[],[f114,f97]) ).
fof(f128,plain,
vplus(vmul(vd411,vsucc(sK0)),vsucc(sK0)) = vplus(vmul(vd411,sK0),vplus(vd411,vsucc(sK0))),
inference(forward_demodulation,[],[f122,f96]) ).
fof(f129,plain,
vplus(vmul(vd411,sK0),vsucc(vplus(vd411,sK0))) = vplus(vplus(vd411,vsucc(sK0)),vmul(vd411,sK0)),
inference(forward_demodulation,[],[f123,f97]) ).
fof(f131,plain,
vplus(vmul(vd411,sK0),vplus(sK0,vsucc(vd411))) = vplus(vplus(vsucc(vd411),sK0),vmul(vd411,sK0)),
inference(forward_demodulation,[],[f125,f97]) ).
fof(f133,plain,
vmul(vsucc(vd411),vsucc(sK0)) = vplus(sK0,vplus(vmul(vd411,sK0),vsucc(vd411))),
inference(forward_demodulation,[],[f127,f96]) ).
fof(f134,plain,
vplus(vmul(vd411,vsucc(sK0)),vsucc(sK0)) = vplus(vplus(vd411,vsucc(sK0)),vmul(vd411,sK0)),
inference(forward_demodulation,[],[f128,f97]) ).
fof(f135,plain,
vplus(vmul(vd411,sK0),vsucc(vplus(vd411,sK0))) = vplus(vd411,vplus(vsucc(sK0),vmul(vd411,sK0))),
inference(forward_demodulation,[],[f129,f96]) ).
fof(f137,plain,
vplus(vmul(vd411,sK0),vplus(sK0,vsucc(vd411))) = vplus(vsucc(vd411),vplus(sK0,vmul(vd411,sK0))),
inference(forward_demodulation,[],[f131,f96]) ).
fof(f139,plain,
vmul(vsucc(vd411),vsucc(sK0)) = vplus(sK0,vplus(vsucc(vd411),vmul(vd411,sK0))),
inference(forward_demodulation,[],[f133,f97]) ).
fof(f140,plain,
vplus(vmul(vd411,vsucc(sK0)),vsucc(sK0)) = vplus(vd411,vplus(vsucc(sK0),vmul(vd411,sK0))),
inference(forward_demodulation,[],[f134,f96]) ).
fof(f141,plain,
vplus(vsucc(vplus(vd411,sK0)),vmul(vd411,sK0)) = vplus(vd411,vplus(vsucc(sK0),vmul(vd411,sK0))),
inference(forward_demodulation,[],[f135,f97]) ).
fof(f142,plain,
vplus(vsucc(vd411),vplus(sK0,vmul(vd411,sK0))) = vplus(vplus(sK0,vsucc(vd411)),vmul(vd411,sK0)),
inference(forward_demodulation,[],[f137,f97]) ).
fof(f144,plain,
vplus(vsucc(sK0),vmul(vd411,vsucc(sK0))) = vplus(vd411,vplus(vsucc(sK0),vmul(vd411,sK0))),
inference(forward_demodulation,[],[f140,f97]) ).
fof(f145,plain,
vplus(vplus(vsucc(vd411),sK0),vmul(vd411,sK0)) = vplus(vd411,vplus(vsucc(sK0),vmul(vd411,sK0))),
inference(forward_demodulation,[],[f141,f95]) ).
fof(f146,plain,
vplus(vsucc(vd411),vplus(sK0,vmul(vd411,sK0))) = vplus(sK0,vplus(vsucc(vd411),vmul(vd411,sK0))),
inference(forward_demodulation,[],[f142,f96]) ).
fof(f148,plain,
vplus(vd411,vplus(vsucc(sK0),vmul(vd411,sK0))) = vplus(vsucc(vd411),vplus(sK0,vmul(vd411,sK0))),
inference(forward_demodulation,[],[f145,f96]) ).
fof(f151,plain,
~ sP3(vplus(sK0,vplus(vsucc(vd411),vmul(vd411,sK0)))),
inference(superposition,[],[f106,f139]) ).
fof(f166,plain,
~ sP3(vplus(vsucc(vd411),vplus(sK0,vmul(vd411,sK0)))),
inference(forward_demodulation,[],[f151,f146]) ).
fof(f214,plain,
sP3(vplus(vd411,vplus(vsucc(sK0),vmul(vd411,sK0)))),
inference(superposition,[],[f113,f144]) ).
fof(f235,plain,
sP3(vplus(vsucc(vd411),vplus(sK0,vmul(vd411,sK0)))),
inference(forward_demodulation,[],[f214,f148]) ).
fof(f238,plain,
$false,
inference(forward_subsumption_resolution,[],[f235,f166]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM845+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n010.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 21:30:17 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.55/1.29 % (1326169)Detected formulas, will run a generic FOF schedule.
% 2.55/1.29 % (1326244)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=80241957:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.55/1.29 % (1326243)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1628164815:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.55/1.29 % (1326249)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=9437885:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.55/1.29 % (1326251)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3049015709:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.55/1.29 % (1326252)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3098543777:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.55/1.29 % (1326249)First to succeed.
% 2.55/1.29 % (1326249)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1326169"
% 2.55/1.29 % (1326253)dis-21_1_sil=8000:lcm=predicate:random_seed=3991560637:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.55/1.29 % (1326245)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=487495179:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.55/1.29 % (1326251)Instruction limit reached!
% 2.55/1.29 % (1326251)------------------------------
% 2.55/1.29 % (1326251)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.55/1.29 % (1326251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.55/1.29 % (1326251)CaDiCaL version: 2.1.3
% 2.55/1.29 % (1326251)Termination reason: Instruction limit
% 2.55/1.29 % (1326251)Termination phase: Saturation
% 2.55/1.29 % (1326251)Time elapsed: 0.067 s
% 2.55/1.29 % (1326251)Peak memory usage: 88 MB
% 2.55/1.29 % (1326251)Instructions burned: 121 (million)
% 2.55/1.29 % (1326252)Instruction limit reached!
% 2.55/1.29 % (1326252)------------------------------
% 2.55/1.29 % (1326252)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.55/1.29 % (1326252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.55/1.29 % (1326252)CaDiCaL version: 2.1.3
% 2.55/1.29 % (1326252)Termination reason: Instruction limit
% 2.55/1.29 % (1326252)Termination phase: Saturation
% 2.55/1.29 % (1326252)Time elapsed: 0.086 s
% 2.55/1.29 % (1326252)Peak memory usage: 90 MB
% 2.55/1.29 % (1326252)Instructions burned: 139 (million)
% 2.55/1.29 % (1326253)Instruction limit reached!
% 2.55/1.29 % (1326253)------------------------------
% 2.55/1.29 % (1326253)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.55/1.29 % (1326253)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.55/1.29 % (1326253)CaDiCaL version: 2.1.3
% 2.55/1.29 % (1326253)Termination reason: Instruction limit
% 2.55/1.29 % (1326253)Termination phase: Saturation
% 2.55/1.29 % (1326253)Time elapsed: 0.078 s
% 2.55/1.29 % (1326253)Peak memory usage: 89 MB
% 2.55/1.29 % (1326253)Instructions burned: 130 (million)
% 2.55/1.29 % (1326311)lrs+10_1_sil=8000:sp=occurrence:random_seed=3351153458:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.55/1.29 % (1326315)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1143224975:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.55/1.29 % (1326318)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2606352932:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.55/1.29 % (1326318)Also succeeded, but the first one will report.
% 2.55/1.29 % (1326249)Refutation found. Thanks to Tanya!
% 2.55/1.29 % SZS status Theorem for theBenchmark
% 2.55/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 3.48/1.39 % (1326249)------------------------------
% 3.48/1.39 % (1326249)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.39 % (1326249)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.39 % (1326249)CaDiCaL version: 2.1.3
% 3.48/1.39 % (1326249)Termination reason: Refutation
% 3.48/1.39 % (1326249)Time elapsed: 0.006 s
% 3.48/1.39 % (1326249)Peak memory usage: 88 MB
% 3.48/1.39 % (1326249)Instructions burned: 9 (million)
% 3.48/1.39 % (1326249)------------------------------
% 3.48/1.39 % (1326249)------------------------------
% 3.48/1.39 % (1326169)Success in time 0.431 s
% 3.48/1.39 % Vampire exiting
%------------------------------------------------------------------------------