%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM508+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:15:30 PM UTC 2026
% Result : Theorem 3.93s 1.54s
% Output : Refutation 3.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 65 ( 18 unt; 3 def)
% Number of atoms : 184 ( 7 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 218 ( 99 ~; 97 |; 13 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(f29,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1) )
=> ( ( X0 != X1
& sdtlseqdt0(X0,X1) )
=> iLess0(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIH_03) ).
fof(f39,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
fof(f40,axiom,
! [X0,X1,X2] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( isPrime0(X2)
& doDivides0(X2,sdtasdt0(X0,X1)) )
=> ( iLess0(sdtpldt0(sdtpldt0(X0,X1),X2),sdtpldt0(sdtpldt0(xn,xm),xp))
=> ( doDivides0(X2,X0)
| doDivides0(X2,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1799) ).
fof(f48,axiom,
( aNaturalNumber0(xr)
& doDivides0(xr,xk)
& isPrime0(xr) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2342) ).
fof(f49,axiom,
( sdtlseqdt0(xr,xk)
& doDivides0(xr,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2362) ).
fof(f51,axiom,
( sdtpldt0(sdtpldt0(xn,xm),xr) != sdtpldt0(sdtpldt0(xn,xm),xp)
& sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2478) ).
fof(f52,conjecture,
( doDivides0(xr,xn)
| doDivides0(xr,xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f53,negated_conjecture,
~ ( doDivides0(xr,xn)
| doDivides0(xr,xm) ),
inference(negated_conjecture,[status(cth)],[f52]) ).
fof(f56,plain,
! [X0,X1,X2] :
( doDivides0(X2,X0)
| doDivides0(X2,X1)
| ~ iLess0(sdtpldt0(sdtpldt0(X0,X1),X2),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ isPrime0(X2)
| ~ doDivides0(X2,sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(ennf_transformation,[],[f40]) ).
fof(f57,plain,
! [X0,X1,X2] :
( doDivides0(X2,X0)
| doDivides0(X2,X1)
| ~ iLess0(sdtpldt0(sdtpldt0(X0,X1),X2),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ isPrime0(X2)
| ~ doDivides0(X2,sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(flattening,[],[f56]) ).
fof(f59,plain,
( ~ doDivides0(xr,xn)
& ~ doDivides0(xr,xm) ),
inference(ennf_transformation,[],[f53]) ).
fof(f79,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f80,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(flattening,[],[f79]) ).
fof(f81,plain,
! [X0,X1] :
( iLess0(X0,X1)
| X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f82,plain,
! [X0,X1] :
( iLess0(X0,X1)
| X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(flattening,[],[f81]) ).
fof(f135,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f39]) ).
fof(f136,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f39]) ).
fof(f137,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f39]) ).
fof(f138,plain,
! [X2,X0,X1] :
( ~ iLess0(sdtpldt0(sdtpldt0(X0,X1),X2),sdtpldt0(sdtpldt0(xn,xm),xp))
| doDivides0(X2,X1)
| doDivides0(X2,X0)
| ~ isPrime0(X2)
| ~ doDivides0(X2,sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(cnf_transformation,[],[f57]) ).
fof(f152,plain,
isPrime0(xr),
inference(cnf_transformation,[],[f48]) ).
fof(f154,plain,
aNaturalNumber0(xr),
inference(cnf_transformation,[],[f48]) ).
fof(f155,plain,
doDivides0(xr,sdtasdt0(xn,xm)),
inference(cnf_transformation,[],[f49]) ).
fof(f159,plain,
sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)),
inference(cnf_transformation,[],[f51]) ).
fof(f160,plain,
sdtpldt0(sdtpldt0(xn,xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xr),
inference(cnf_transformation,[],[f51]) ).
fof(f161,plain,
~ doDivides0(xr,xm),
inference(cnf_transformation,[],[f59]) ).
fof(f162,plain,
~ doDivides0(xr,xn),
inference(cnf_transformation,[],[f59]) ).
fof(f182,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(cnf_transformation,[],[f80]) ).
fof(f183,plain,
! [X0,X1] :
( ~ sdtlseqdt0(X0,X1)
| X0 = X1
| iLess0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(cnf_transformation,[],[f82]) ).
fof(f410,plain,
( sdtpldt0(sdtpldt0(xn,xm),xp) = sdtpldt0(sdtpldt0(xn,xm),xr)
| iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp)) ),
inference(resolution,[],[f183,f159]) ).
fof(f436,plain,
( iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp)) ),
inference(forward_subsumption_resolution,[],[f410,f160]) ).
fof(f565,definition,
( spl4_19
<=> aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp)) ),
introduced(definition,[new_symbols(definition,[spl4_19])],[avatar_definition]) ).
fof(f567,plain,
( ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| spl4_19 ),
inference(avatar_component_clause,[],[f565]) ).
fof(f569,definition,
( spl4_20
<=> aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr)) ),
introduced(definition,[new_symbols(definition,[spl4_20])],[avatar_definition]) ).
fof(f571,plain,
( ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))
| spl4_20 ),
inference(avatar_component_clause,[],[f569]) ).
fof(f573,definition,
( spl4_21
<=> iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
introduced(definition,[new_symbols(definition,[spl4_21])],[avatar_definition]) ).
fof(f575,plain,
( iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ spl4_21 ),
inference(avatar_component_clause,[],[f573]) ).
fof(f576,plain,
( ~ spl4_19
| ~ spl4_20
| spl4_21 ),
inference(avatar_split_clause,[],[f436,f573,f569,f565]) ).
fof(f2788,plain,
( ~ aNaturalNumber0(sdtpldt0(xn,xm))
| ~ aNaturalNumber0(xp)
| spl4_19 ),
inference(resolution,[],[f567,f182]) ).
fof(f2789,plain,
( ~ aNaturalNumber0(sdtpldt0(xn,xm))
| spl4_19 ),
inference(forward_subsumption_resolution,[],[f2788,f135]) ).
fof(f2790,plain,
( ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xm)
| spl4_19 ),
inference(resolution,[],[f2789,f182]) ).
fof(f2791,plain,
( ~ aNaturalNumber0(xm)
| spl4_19 ),
inference(forward_subsumption_resolution,[],[f2790,f137]) ).
fof(f2792,plain,
( $false
| spl4_19 ),
inference(forward_subsumption_resolution,[],[f2791,f136]) ).
fof(f2793,plain,
spl4_19,
inference(avatar_contradiction_clause,[],[f2792]) ).
fof(f4176,plain,
( doDivides0(xr,xm)
| doDivides0(xr,xn)
| ~ isPrime0(xr)
| ~ doDivides0(xr,sdtasdt0(xn,xm))
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xr)
| ~ spl4_21 ),
inference(resolution,[],[f575,f138]) ).
fof(f4177,plain,
( doDivides0(xr,xn)
| ~ isPrime0(xr)
| ~ doDivides0(xr,sdtasdt0(xn,xm))
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xr)
| ~ spl4_21 ),
inference(forward_subsumption_resolution,[],[f4176,f161]) ).
fof(f4178,plain,
( ~ isPrime0(xr)
| ~ doDivides0(xr,sdtasdt0(xn,xm))
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xr)
| ~ spl4_21 ),
inference(forward_subsumption_resolution,[],[f4177,f162]) ).
fof(f4179,plain,
( ~ doDivides0(xr,sdtasdt0(xn,xm))
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xr)
| ~ spl4_21 ),
inference(forward_subsumption_resolution,[],[f4178,f152]) ).
fof(f4180,plain,
( ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xr)
| ~ spl4_21 ),
inference(forward_subsumption_resolution,[],[f4179,f155]) ).
fof(f4181,plain,
( ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xr)
| ~ spl4_21 ),
inference(forward_subsumption_resolution,[],[f4180,f137]) ).
fof(f4182,plain,
( ~ aNaturalNumber0(xr)
| ~ spl4_21 ),
inference(forward_subsumption_resolution,[],[f4181,f136]) ).
fof(f4183,plain,
( $false
| ~ spl4_21 ),
inference(forward_subsumption_resolution,[],[f4182,f154]) ).
fof(f4184,plain,
~ spl4_21,
inference(avatar_contradiction_clause,[],[f4183]) ).
fof(f4228,plain,
( ~ aNaturalNumber0(sdtpldt0(xn,xm))
| ~ aNaturalNumber0(xr)
| spl4_20 ),
inference(resolution,[],[f571,f182]) ).
fof(f4229,plain,
( ~ aNaturalNumber0(sdtpldt0(xn,xm))
| spl4_20 ),
inference(forward_subsumption_resolution,[],[f4228,f154]) ).
fof(f4390,plain,
( ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xm)
| spl4_20 ),
inference(resolution,[],[f4229,f182]) ).
fof(f4391,plain,
( ~ aNaturalNumber0(xm)
| spl4_20 ),
inference(forward_subsumption_resolution,[],[f4390,f137]) ).
fof(f4392,plain,
( $false
| spl4_20 ),
inference(forward_subsumption_resolution,[],[f4391,f136]) ).
fof(f4393,plain,
spl4_20,
inference(avatar_contradiction_clause,[],[f4392]) ).
cnf(s12,plain,
( ~ spl4_19
| ~ spl4_20
| spl4_21 ),
inference(sat_conversion,[],[f576]) ).
cnf(s53,plain,
spl4_19,
inference(sat_conversion,[],[f2793]) ).
cnf(s141,plain,
~ spl4_21,
inference(sat_conversion,[],[f4184]) ).
cnf(s157,plain,
spl4_20,
inference(sat_conversion,[],[f4393]) ).
cnf(s230,plain,
$false,
inference(rat,[],[s12,s141,s157,s53]) ).
fof(f4394,plain,
$false,
inference(avatar_sat_refutation,[],[s230]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM508+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 % Computer : n005.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 20:15:47 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.64/1.34 % (134318)Detected formulas, will run a generic FOF schedule.
% 2.64/1.34 % (134327)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1429760504:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.64/1.34 % (134328)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2515593504:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.64/1.34 % (134325)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=620391990:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.64/1.34 % (134326)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1539845437:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.64/1.34 % (134323)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=3164966026:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.64/1.34 % (134324)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=1814539796:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.64/1.34 % (134329)dis-21_1_sil=8000:lcm=predicate:random_seed=1375383591: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.64/1.34 % (134327)Instruction limit reached!
% 2.64/1.34 % (134327)------------------------------
% 2.64/1.34 % (134327)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/1.34 % (134327)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/1.34 % (134327)CaDiCaL version: 2.1.3
% 2.64/1.34 % (134327)Termination reason: Instruction limit
% 2.64/1.34 % (134327)Termination phase: Saturation
% 2.64/1.34 % (134327)Time elapsed: 0.039 s
% 2.64/1.34 % (134327)Peak memory usage: 89 MB
% 2.64/1.34 % (134327)Instructions burned: 121 (million)
% 2.64/1.34 % (134326)Instruction limit reached!
% 2.64/1.34 % (134326)------------------------------
% 2.64/1.34 % (134326)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/1.34 % (134326)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/1.34 % (134326)CaDiCaL version: 2.1.3
% 2.64/1.34 % (134326)Termination reason: Instruction limit
% 2.64/1.34 % (134326)Termination phase: Saturation
% 2.64/1.34 % (134326)Time elapsed: 0.066 s
% 2.64/1.34 % (134326)Peak memory usage: 89 MB
% 2.64/1.34 % (134326)Instructions burned: 109 (million)
% 2.64/1.34 % (134329)Instruction limit reached!
% 2.64/1.34 % (134329)------------------------------
% 2.64/1.34 % (134329)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/1.34 % (134329)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/1.34 % (134329)CaDiCaL version: 2.1.3
% 2.64/1.34 % (134329)Termination reason: Instruction limit
% 2.64/1.34 % (134329)Termination phase: Saturation
% 2.64/1.34 % (134329)Time elapsed: 0.080 s
% 2.64/1.34 % (134329)Peak memory usage: 90 MB
% 2.64/1.34 % (134329)Instructions burned: 130 (million)
% 2.64/1.34 % (134328)Instruction limit reached!
% 2.64/1.34 % (134328)------------------------------
% 2.64/1.34 % (134328)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/1.34 % (134328)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/1.34 % (134328)CaDiCaL version: 2.1.3
% 2.64/1.34 % (134328)Termination reason: Instruction limit
% 2.64/1.34 % (134328)Termination phase: Saturation
% 2.64/1.34 % (134328)Time elapsed: 0.096 s
% 2.64/1.34 % (134328)Peak memory usage: 90 MB
% 2.64/1.34 % (134328)Instructions burned: 140 (million)
% 2.64/1.34 % (134337)lrs+10_1_sil=8000:sp=occurrence:random_seed=3291855389:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.64/1.34 % (134337)First to succeed.
% 2.64/1.34 % (134337)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-134318"
% 2.64/1.34 % (134338)lrs+10_1_sil=32000:urr=on:br=off:random_seed=246462381:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.64/1.34 % (134339)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2292295256:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.64/1.34 % (134338)Refutation not found, incomplete strategy
% 2.64/1.34 % (134338)------------------------------
% 2.64/1.34 % (134338)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.93/1.54 % (134338)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.93/1.54 % (134338)CaDiCaL version: 2.1.3
% 3.93/1.54 % (134338)Termination reason: Refutation not found, incomplete strategy
% 3.93/1.54 % (134338)Time elapsed: 0.002 s
% 3.93/1.54 % (134338)Peak memory usage: 88 MB
% 3.93/1.54 % (134338)Instructions burned: 2 (million)
% 3.93/1.54 % (134340)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=1815236810:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 3.93/1.54 % (134337)Refutation found. Thanks to Tanya!
% 3.93/1.54 % SZS status Theorem for theBenchmark
% 3.93/1.54 % SZS output start Proof for theBenchmark
% See solution above
% 3.93/1.54 % (134337)------------------------------
% 3.93/1.54 % (134337)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.93/1.54 % (134337)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.93/1.54 % (134337)CaDiCaL version: 2.1.3
% 3.93/1.54 % (134337)Termination reason: Refutation
% 3.93/1.54 % (134337)Time elapsed: 0.047 s
% 3.93/1.54 % (134337)Peak memory usage: 91 MB
% 3.93/1.54 % (134337)Instructions burned: 139 (million)
% 3.93/1.54 % (134337)------------------------------
% 3.93/1.54 % (134337)------------------------------
% 3.93/1.54 % (134318)Success in time 0.466 s
% 3.93/1.54 % Vampire exiting
%------------------------------------------------------------------------------