%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM494+3 : 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 : n012.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:26 PM UTC 2026
% Result : Theorem 0.67s 0.82s
% Output : Refutation 2.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 9 unt; 0 def)
% Number of atoms : 171 ( 50 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 223 ( 99 ~; 84 |; 33 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 45 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(f7,axiom,
! [X0,X1,X2] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddAsso) ).
fof(f14,axiom,
! [X0,X1,X2] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( sdtpldt0(X0,X1) = sdtpldt0(X0,X2)
| sdtpldt0(X1,X0) = sdtpldt0(X2,X0) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddCanc) ).
fof(f24,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1) )
=> ( ( X0 != X1
& sdtlseqdt0(X0,X1) )
=> ! [X2] :
( aNaturalNumber0(X2)
=> ( sdtpldt0(X2,X0) != sdtpldt0(X2,X1)
& sdtlseqdt0(sdtpldt0(X2,X0),sdtpldt0(X2,X1))
& sdtpldt0(X0,X2) != sdtpldt0(X1,X2)
& sdtlseqdt0(sdtpldt0(X0,X2),sdtpldt0(X1,X2)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMonAdd) ).
fof(f39,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
fof(f43,axiom,
( aNaturalNumber0(xr)
& sdtpldt0(xp,xr) = xn
& xr = sdtmndt0(xn,xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1883) ).
fof(f44,axiom,
( xr != xn
& ? [X0] :
( aNaturalNumber0(X0)
& sdtpldt0(xr,X0) = xn )
& sdtlseqdt0(xr,xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1894) ).
fof(f46,conjecture,
( sdtpldt0(sdtpldt0(xr,xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp)
& ( ? [X0] :
( aNaturalNumber0(X0)
& sdtpldt0(sdtpldt0(sdtpldt0(xr,xm),xp),X0) = sdtpldt0(sdtpldt0(xn,xm),xp) )
| sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f47,negated_conjecture,
~ ( sdtpldt0(sdtpldt0(xr,xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp)
& ( ? [X0] :
( aNaturalNumber0(X0)
& sdtpldt0(sdtpldt0(sdtpldt0(xr,xm),xp),X0) = sdtpldt0(sdtpldt0(xn,xm),xp) )
| sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f56,plain,
( sdtpldt0(sdtpldt0(xn,xm),xp) = sdtpldt0(sdtpldt0(xr,xm),xp)
| ( ! [X0] :
( ~ aNaturalNumber0(X0)
| sdtpldt0(sdtpldt0(xn,xm),xp) != sdtpldt0(sdtpldt0(sdtpldt0(xr,xm),xp),X0) )
& ~ sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)) ) ),
inference(ennf_transformation,[],[f47]) ).
fof(f63,plain,
! [X0,X1,X2] :
( X1 = X2
| ( sdtpldt0(X0,X1) != sdtpldt0(X0,X2)
& sdtpldt0(X1,X0) != sdtpldt0(X2,X0) )
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f64,plain,
! [X0,X1,X2] :
( X1 = X2
| ( sdtpldt0(X0,X1) != sdtpldt0(X0,X2)
& sdtpldt0(X1,X0) != sdtpldt0(X2,X0) )
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(flattening,[],[f63]) ).
fof(f65,plain,
! [X0,X1,X2] :
( sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f66,plain,
! [X0,X1,X2] :
( sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(flattening,[],[f65]) ).
fof(f69,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f70,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(flattening,[],[f69]) ).
fof(f104,plain,
! [X0,X1] :
( ! [X2] :
( ( sdtpldt0(X2,X0) != sdtpldt0(X2,X1)
& sdtlseqdt0(sdtpldt0(X2,X0),sdtpldt0(X2,X1))
& sdtpldt0(X0,X2) != sdtpldt0(X1,X2)
& sdtlseqdt0(sdtpldt0(X0,X2),sdtpldt0(X1,X2)) )
| ~ aNaturalNumber0(X2) )
| X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f105,plain,
! [X0,X1] :
( ! [X2] :
( ( sdtpldt0(X2,X0) != sdtpldt0(X2,X1)
& sdtlseqdt0(sdtpldt0(X2,X0),sdtpldt0(X2,X1))
& sdtpldt0(X0,X2) != sdtpldt0(X1,X2)
& sdtlseqdt0(sdtpldt0(X0,X2),sdtpldt0(X1,X2)) )
| ~ aNaturalNumber0(X2) )
| X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(flattening,[],[f104]) ).
fof(f130,plain,
( xr != xn
& aNaturalNumber0(sK8)
& xn = sdtpldt0(xr,sK8)
& sdtlseqdt0(xr,xn) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X0,sK8)],[f44]) ).
fof(f145,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f39]) ).
fof(f146,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f39]) ).
fof(f147,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f39]) ).
fof(f177,plain,
aNaturalNumber0(xr),
inference(cnf_transformation,[],[f43]) ).
fof(f178,plain,
sdtlseqdt0(xr,xn),
inference(cnf_transformation,[],[f130]) ).
fof(f181,plain,
xn != xr,
inference(cnf_transformation,[],[f130]) ).
fof(f185,plain,
( ~ sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp))
| sdtpldt0(sdtpldt0(xn,xm),xp) = sdtpldt0(sdtpldt0(xr,xm),xp) ),
inference(cnf_transformation,[],[f56]) ).
fof(f198,plain,
! [X2,X0,X1] :
( sdtpldt0(X1,X0) != sdtpldt0(X2,X0)
| X1 = X2
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(cnf_transformation,[],[f64]) ).
fof(f200,plain,
! [X2,X0,X1] :
( sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(cnf_transformation,[],[f66]) ).
fof(f202,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(cnf_transformation,[],[f70]) ).
fof(f236,plain,
! [X2,X0,X1] :
( sdtlseqdt0(sdtpldt0(X0,X2),sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(cnf_transformation,[],[f105]) ).
fof(f1032,plain,
( ~ sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(xn,sdtpldt0(xm,xp)))
| sdtpldt0(sdtpldt0(xr,xm),xp) = sdtpldt0(xn,sdtpldt0(xm,xp))
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xp) ),
inference(superposition,[],[f185,f200]) ).
fof(f1099,plain,
( ~ sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(xn,sdtpldt0(xm,xp)))
| sdtpldt0(sdtpldt0(xr,xm),xp) = sdtpldt0(xn,sdtpldt0(xm,xp))
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xp) ),
inference(forward_subsumption_resolution,[],[f1032,f147]) ).
fof(f1133,plain,
( ~ sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(xn,sdtpldt0(xm,xp)))
| sdtpldt0(sdtpldt0(xr,xm),xp) = sdtpldt0(xn,sdtpldt0(xm,xp))
| ~ aNaturalNumber0(xp) ),
inference(forward_subsumption_resolution,[],[f1099,f146]) ).
fof(f1159,plain,
( ~ sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(xn,sdtpldt0(xm,xp)))
| sdtpldt0(sdtpldt0(xr,xm),xp) = sdtpldt0(xn,sdtpldt0(xm,xp)) ),
inference(forward_subsumption_resolution,[],[f1133,f145]) ).
fof(f1177,plain,
( ~ sdtlseqdt0(sdtpldt0(xr,sdtpldt0(xm,xp)),sdtpldt0(xn,sdtpldt0(xm,xp)))
| sdtpldt0(xr,sdtpldt0(xm,xp)) = sdtpldt0(xn,sdtpldt0(xm,xp))
| ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xp) ),
inference(superposition,[],[f1159,f200]) ).
fof(f1182,plain,
( ~ sdtlseqdt0(sdtpldt0(xr,sdtpldt0(xm,xp)),sdtpldt0(xn,sdtpldt0(xm,xp)))
| sdtpldt0(xr,sdtpldt0(xm,xp)) = sdtpldt0(xn,sdtpldt0(xm,xp))
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xp) ),
inference(forward_subsumption_resolution,[],[f1177,f177]) ).
fof(f1183,plain,
( ~ sdtlseqdt0(sdtpldt0(xr,sdtpldt0(xm,xp)),sdtpldt0(xn,sdtpldt0(xm,xp)))
| sdtpldt0(xr,sdtpldt0(xm,xp)) = sdtpldt0(xn,sdtpldt0(xm,xp))
| ~ aNaturalNumber0(xp) ),
inference(forward_subsumption_resolution,[],[f1182,f146]) ).
fof(f1184,plain,
( ~ sdtlseqdt0(sdtpldt0(xr,sdtpldt0(xm,xp)),sdtpldt0(xn,sdtpldt0(xm,xp)))
| sdtpldt0(xr,sdtpldt0(xm,xp)) = sdtpldt0(xn,sdtpldt0(xm,xp)) ),
inference(forward_subsumption_resolution,[],[f1183,f145]) ).
fof(f1781,plain,
( ~ aNaturalNumber0(sdtpldt0(xm,xp))
| xn = xr
| ~ sdtlseqdt0(xr,xn)
| ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(xn)
| sdtpldt0(xr,sdtpldt0(xm,xp)) = sdtpldt0(xn,sdtpldt0(xm,xp)) ),
inference(resolution,[],[f236,f1184]) ).
fof(f1842,plain,
( ~ aNaturalNumber0(sdtpldt0(xm,xp))
| xn = xr
| ~ sdtlseqdt0(xr,xn)
| ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(xn) ),
inference(forward_subsumption_resolution,[],[f1781,f198]) ).
fof(f1856,plain,
( ~ aNaturalNumber0(sdtpldt0(xm,xp))
| ~ sdtlseqdt0(xr,xn)
| ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(xn) ),
inference(forward_subsumption_resolution,[],[f1842,f181]) ).
fof(f1860,plain,
( ~ aNaturalNumber0(sdtpldt0(xm,xp))
| ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(xn) ),
inference(forward_subsumption_resolution,[],[f1856,f178]) ).
fof(f1861,plain,
( ~ aNaturalNumber0(sdtpldt0(xm,xp))
| ~ aNaturalNumber0(xn) ),
inference(forward_subsumption_resolution,[],[f1860,f177]) ).
fof(f1862,plain,
~ aNaturalNumber0(sdtpldt0(xm,xp)),
inference(forward_subsumption_resolution,[],[f1861,f147]) ).
fof(f1863,plain,
( ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xp) ),
inference(resolution,[],[f1862,f202]) ).
fof(f1864,plain,
~ aNaturalNumber0(xp),
inference(forward_subsumption_resolution,[],[f1863,f146]) ).
fof(f1865,plain,
$false,
inference(forward_subsumption_resolution,[],[f1864,f145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM494+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.32 % Computer : n012.cluster.edu
% 0.04/0.32 % Model : x86_64 x86_64
% 0.04/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.32 % Memory : 8046.5625MB
% 0.04/0.32 % OS : Linux 6.8.0-71-generic
% 0.04/0.32 % CPULimit : 300
% 0.04/0.32 % WCLimit : 300
% 0.04/0.32 % DateTime : Sun Sep 27 20:10:34 UTC 2026
% 0.07/0.32 % CPUTime :
% 0.07/0.32 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.34 Running first-order theorem proving
% 0.07/0.34 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
% 0.67/0.82 % (2702055)Detected formulas, will run a generic FOF schedule.
% 0.67/0.82 % (2702064)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3049554623:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.67/0.82 % (2702063)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=935285343:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.67/0.82 % (2702060)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=1216697142:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.67/0.82 % (2702061)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=1295657523:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.67/0.82 % (2702066)dis-21_1_sil=8000:lcm=predicate:random_seed=1830150065: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)
% 0.67/0.82 % (2702062)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=3645808578:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.67/0.82 % (2702065)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2180318639:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.67/0.82 % (2702064)First to succeed.
% 0.67/0.82 % (2702064)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2702055"
% 0.67/0.82 % (2702063)Instruction limit reached!
% 0.67/0.82 % (2702063)------------------------------
% 0.67/0.82 % (2702063)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.67/0.82 % (2702063)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.67/0.82 % (2702063)CaDiCaL version: 2.1.3
% 0.67/0.82 % (2702063)Termination reason: Instruction limit
% 0.67/0.82 % (2702063)Termination phase: Saturation
% 0.67/0.82 % (2702063)Time elapsed: 0.034 s
% 0.67/0.82 % (2702063)Peak memory usage: 89 MB
% 0.67/0.82 % (2702063)Instructions burned: 112 (million)
% 0.67/0.82 % (2702066)Instruction limit reached!
% 0.67/0.82 % (2702066)------------------------------
% 0.67/0.82 % (2702066)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.67/0.82 % (2702066)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.67/0.82 % (2702066)CaDiCaL version: 2.1.3
% 0.67/0.82 % (2702066)Termination reason: Instruction limit
% 0.67/0.82 % (2702066)Termination phase: Saturation
% 0.67/0.82 % (2702066)Time elapsed: 0.044 s
% 0.67/0.82 % (2702066)Peak memory usage: 91 MB
% 0.67/0.82 % (2702066)Instructions burned: 130 (million)
% 0.67/0.82 % (2702065)Instruction limit reached!
% 0.67/0.82 % (2702065)------------------------------
% 0.67/0.82 % (2702065)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.67/0.82 % (2702065)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.67/0.82 % (2702065)CaDiCaL version: 2.1.3
% 0.67/0.82 % (2702065)Termination reason: Instruction limit
% 0.67/0.82 % (2702065)Termination phase: Saturation
% 0.67/0.82 % (2702065)Time elapsed: 0.050 s
% 0.67/0.82 % (2702065)Peak memory usage: 90 MB
% 0.67/0.82 % (2702065)Instructions burned: 141 (million)
% 0.67/0.82 % (2702074)lrs+10_1_sil=8000:sp=occurrence:random_seed=281830452:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 0.67/0.82 % (2702075)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1486307350:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 0.67/0.82 % (2702076)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1481624482:i=325:sd=1:ss=axioms:sgt=32_2998 on theBenchmark for (2998ds/325Mi)
% 0.67/0.82 % (2702064)Refutation found. Thanks to Tanya!
% 0.67/0.82 % SZS status Theorem for theBenchmark
% 0.67/0.82 % SZS output start Proof for theBenchmark
% See solution above
% 2.23/0.91 % (2702064)------------------------------
% 2.23/0.91 % (2702064)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.23/0.91 % (2702064)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.23/0.91 % (2702064)CaDiCaL version: 2.1.3
% 2.23/0.91 % (2702064)Termination reason: Refutation
% 2.23/0.91 % (2702064)Time elapsed: 0.019 s
% 2.23/0.91 % (2702064)Peak memory usage: 89 MB
% 2.23/0.91 % (2702064)Instructions burned: 60 (million)
% 2.23/0.91 % (2702064)------------------------------
% 2.23/0.91 % (2702064)------------------------------
% 2.23/0.91 % (2702055)Success in time 0.281 s
% 2.23/0.91 % Vampire exiting
%------------------------------------------------------------------------------