%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM433+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:10 PM UTC 2026
% Result : Theorem 2.96s 1.36s
% Output : Refutation 4.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 6
% Syntax : Number of formulae : 57 ( 10 unt; 1 def)
% Number of atoms : 237 ( 64 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 316 ( 136 ~; 99 |; 75 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 66 ( 53 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1] :
( ( aInteger0(X0)
& aInteger0(X1) )
=> aInteger0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntMult) ).
fof(f11,axiom,
! [X0,X1,X2] :
( ( aInteger0(X0)
& aInteger0(X1)
& aInteger0(X2) )
=> sdtasdt0(X0,sdtasdt0(X1,X2)) = sdtasdt0(sdtasdt0(X0,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulAsso) ).
fof(f12,axiom,
! [X0,X1] :
( ( aInteger0(X0)
& aInteger0(X1) )
=> sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
fof(f23,axiom,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xp)
& xp != sz00
& aInteger0(xq)
& xq != sz00 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__979) ).
fof(f24,conjecture,
( ( sdtasdt0(xp,xq) != sz00
& ? [X0] :
( aInteger0(X0)
& sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb)) )
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) )
=> ( ( ? [X0] :
( aInteger0(X0)
& sdtasdt0(xp,X0) = sdtpldt0(xa,smndt0(xb)) )
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ? [X0] :
( aInteger0(X0)
& sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb)) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f25,negated_conjecture,
~ ( ( sdtasdt0(xp,xq) != sz00
& ? [X0] :
( aInteger0(X0)
& sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb)) )
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) )
=> ( ( ? [X0] :
( aInteger0(X0)
& sdtasdt0(xp,X0) = sdtpldt0(xa,smndt0(xb)) )
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ? [X0] :
( aInteger0(X0)
& sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xb)) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ) ),
inference(negated_conjecture,[status(cth)],[f24]) ).
fof(f26,plain,
~ ( ( sdtasdt0(xp,xq) != sz00
& ? [X0] :
( aInteger0(X0)
& sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb)) )
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) )
=> ( ( ? [X1] :
( aInteger0(X1)
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,X1) )
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ? [X2] :
( aInteger0(X2)
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X2) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ) ),
inference(rectify,[],[f25]) ).
fof(f28,plain,
( ( ( ! [X1] :
( ~ aInteger0(X1)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X1) )
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
| ( ! [X2] :
( ~ aInteger0(X2)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X2) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) ) )
& sdtasdt0(xp,xq) != sz00
& ? [X0] :
( aInteger0(X0)
& sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb)) )
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) ),
inference(ennf_transformation,[],[f26]) ).
fof(f29,plain,
( ( ( ! [X1] :
( ~ aInteger0(X1)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X1) )
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
| ( ! [X2] :
( ~ aInteger0(X2)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X2) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) ) )
& sdtasdt0(xp,xq) != sz00
& ? [X0] :
( aInteger0(X0)
& sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb)) )
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) ),
inference(flattening,[],[f28]) ).
fof(f53,plain,
! [X0,X1] :
( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f54,plain,
! [X0,X1] :
( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(flattening,[],[f53]) ).
fof(f55,plain,
! [X0,X1,X2] :
( sdtasdt0(X0,sdtasdt0(X1,X2)) = sdtasdt0(sdtasdt0(X0,X1),X2)
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(ennf_transformation,[],[f11]) ).
fof(f56,plain,
! [X0,X1,X2] :
( sdtasdt0(X0,sdtasdt0(X1,X2)) = sdtasdt0(sdtasdt0(X0,X1),X2)
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(flattening,[],[f55]) ).
fof(f57,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f58,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(flattening,[],[f57]) ).
fof(f59,definition,
( ( ! [X2] :
( ~ aInteger0(X2)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X2) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
| ~ sP0 ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f60,plain,
( ( ( ! [X1] :
( ~ aInteger0(X1)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X1) )
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
| sP0 )
& sdtasdt0(xp,xq) != sz00
& ? [X0] :
( aInteger0(X0)
& sdtasdt0(sdtasdt0(xp,xq),X0) = sdtpldt0(xa,smndt0(xb)) )
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) ),
inference(definition_folding,[],[f29,f59]) ).
fof(f61,plain,
( ( ! [X2] :
( ~ aInteger0(X2)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X2) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
| ~ sP0 ),
inference(nnf_transformation,[],[f59]) ).
fof(f62,plain,
( ( ! [X0] :
( ~ aInteger0(X0)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
| ~ sP0 ),
inference(rectify,[],[f61]) ).
fof(f63,plain,
( ( ( ! [X0] :
( ~ aInteger0(X0)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X0) )
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
| sP0 )
& sdtasdt0(xp,xq) != sz00
& ? [X1] :
( aInteger0(X1)
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),X1) )
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) ),
inference(rectify,[],[f60]) ).
fof(f64,plain,
( ( ( ! [X0] :
( ~ aInteger0(X0)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X0) )
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
| sP0 )
& sdtasdt0(xp,xq) != sz00
& aInteger0(sK1)
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),sK1)
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1)],[f63]) ).
fof(f71,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f23]) ).
fof(f73,plain,
aInteger0(xp),
inference(cnf_transformation,[],[f23]) ).
fof(f78,plain,
! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0)
| ~ sP0 ),
inference(cnf_transformation,[],[f62]) ).
fof(f81,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),sK1),
inference(cnf_transformation,[],[f64]) ).
fof(f82,plain,
aInteger0(sK1),
inference(cnf_transformation,[],[f64]) ).
fof(f86,plain,
! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X0)
| ~ aInteger0(X0)
| sP0 ),
inference(cnf_transformation,[],[f64]) ).
fof(f111,plain,
! [X0,X1] :
( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(cnf_transformation,[],[f54]) ).
fof(f112,plain,
! [X2,X0,X1] :
( sdtasdt0(X0,sdtasdt0(X1,X2)) = sdtasdt0(sdtasdt0(X0,X1),X2)
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(cnf_transformation,[],[f56]) ).
fof(f113,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(cnf_transformation,[],[f58]) ).
fof(f192,plain,
! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(X0,xq)
| ~ aInteger0(X0)
| ~ sP0
| ~ aInteger0(X0)
| ~ aInteger0(xq) ),
inference(superposition,[],[f78,f111]) ).
fof(f193,plain,
! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(X0,xq)
| ~ aInteger0(X0)
| ~ sP0
| ~ aInteger0(xq) ),
inference(duplicate_literal_removal,[],[f192]) ).
fof(f207,plain,
! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(X0,xq)
| ~ aInteger0(X0)
| ~ sP0 ),
inference(forward_subsumption_resolution,[],[f193,f71]) ).
fof(f315,plain,
! [X2,X0,X1] :
( sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X1,sdtasdt0(X0,X2))
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(superposition,[],[f112,f111]) ).
fof(f326,plain,
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,sK1))
| ~ aInteger0(xp)
| ~ aInteger0(xq)
| ~ aInteger0(sK1) ),
inference(superposition,[],[f81,f112]) ).
fof(f345,plain,
! [X2,X0,X1] :
( sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X1,sdtasdt0(X0,X2))
| ~ aInteger0(X1)
| ~ aInteger0(X0)
| ~ aInteger0(X2) ),
inference(duplicate_literal_removal,[],[f315]) ).
fof(f356,plain,
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,sK1))
| ~ aInteger0(xq)
| ~ aInteger0(sK1) ),
inference(forward_subsumption_resolution,[],[f326,f73]) ).
fof(f370,plain,
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,sK1))
| ~ aInteger0(sK1) ),
inference(forward_subsumption_resolution,[],[f356,f71]) ).
fof(f374,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,sK1)),
inference(forward_subsumption_resolution,[],[f370,f82]) ).
fof(f378,plain,
( sdtpldt0(xa,smndt0(xb)) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(sdtasdt0(xq,sK1))
| sP0 ),
inference(superposition,[],[f86,f374]) ).
fof(f383,plain,
( ~ aInteger0(sdtasdt0(xq,sK1))
| sP0 ),
inference(trivial_inequality_removal,[],[f378]) ).
fof(f418,plain,
( sP0
| ~ aInteger0(xq)
| ~ aInteger0(sK1) ),
inference(resolution,[],[f383,f113]) ).
fof(f423,plain,
( sP0
| ~ aInteger0(sK1) ),
inference(forward_subsumption_resolution,[],[f418,f71]) ).
fof(f426,plain,
sP0,
inference(forward_subsumption_resolution,[],[f423,f82]) ).
fof(f868,plain,
! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(X0,xq)
| ~ aInteger0(X0) ),
inference(forward_subsumption_resolution,[],[f207,f426]) ).
fof(f870,plain,
! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0)
| ~ aInteger0(X0)
| ~ aInteger0(xq) ),
inference(superposition,[],[f868,f111]) ).
fof(f872,plain,
! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0)
| ~ aInteger0(xq) ),
inference(duplicate_literal_removal,[],[f870]) ).
fof(f875,plain,
! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0) ),
inference(forward_subsumption_resolution,[],[f872,f71]) ).
fof(f3868,plain,
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,sK1))
| ~ aInteger0(xq)
| ~ aInteger0(xp)
| ~ aInteger0(sK1) ),
inference(superposition,[],[f81,f345]) ).
fof(f3967,plain,
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,sK1))
| ~ aInteger0(xp)
| ~ aInteger0(sK1) ),
inference(forward_subsumption_resolution,[],[f3868,f71]) ).
fof(f4004,plain,
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,sK1))
| ~ aInteger0(sK1) ),
inference(forward_subsumption_resolution,[],[f3967,f73]) ).
fof(f4021,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,sK1)),
inference(forward_subsumption_resolution,[],[f4004,f82]) ).
fof(f4030,plain,
( sdtpldt0(xa,smndt0(xb)) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(sdtasdt0(xp,sK1)) ),
inference(superposition,[],[f875,f4021]) ).
fof(f4046,plain,
~ aInteger0(sdtasdt0(xp,sK1)),
inference(trivial_inequality_removal,[],[f4030]) ).
fof(f4066,plain,
( ~ aInteger0(xp)
| ~ aInteger0(sK1) ),
inference(resolution,[],[f4046,f113]) ).
fof(f4071,plain,
~ aInteger0(sK1),
inference(forward_subsumption_resolution,[],[f4066,f73]) ).
fof(f4074,plain,
$false,
inference(forward_subsumption_resolution,[],[f4071,f82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM433+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.38 % Computer : n020.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.39 % CPULimit : 300
% 0.09/0.39 % WCLimit : 300
% 0.09/0.39 % DateTime : Sun Sep 27 19:54:50 UTC 2026
% 0.09/0.39 % CPUTime :
% 0.09/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/0.42 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.96/1.36 % (3705999)Detected formulas, will run a generic FOF schedule.
% 2.96/1.36 % (3706005)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=3449772870:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.96/1.36 % (3706009)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2917411979:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.96/1.36 % (3706008)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2641674131:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.96/1.36 % (3706007)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=682720386:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.96/1.36 % (3706006)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=1696632289:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.96/1.36 % (3706004)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=2607925758:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.96/1.36 % (3706010)dis-21_1_sil=8000:lcm=predicate:random_seed=1205734979: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.96/1.36 % (3706008)First to succeed.
% 2.96/1.36 % (3706008)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3705999"
% 2.96/1.36 % (3706007)Instruction limit reached!
% 2.96/1.36 % (3706007)------------------------------
% 2.96/1.36 % (3706007)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.96/1.36 % (3706007)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/1.36 % (3706007)CaDiCaL version: 2.1.3
% 2.96/1.36 % (3706007)Termination reason: Instruction limit
% 2.96/1.36 % (3706007)Termination phase: Saturation
% 2.96/1.36 % (3706007)Time elapsed: 0.067 s
% 2.96/1.36 % (3706007)Peak memory usage: 89 MB
% 2.96/1.36 % (3706007)Instructions burned: 109 (million)
% 2.96/1.36 % (3706010)Instruction limit reached!
% 2.96/1.36 % (3706010)------------------------------
% 2.96/1.36 % (3706010)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.96/1.36 % (3706010)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/1.36 % (3706010)CaDiCaL version: 2.1.3
% 2.96/1.36 % (3706010)Termination reason: Instruction limit
% 2.96/1.36 % (3706010)Termination phase: Saturation
% 2.96/1.36 % (3706010)Time elapsed: 0.071 s
% 2.96/1.36 % (3706010)Peak memory usage: 90 MB
% 2.96/1.36 % (3706010)Instructions burned: 130 (million)
% 2.96/1.36 % (3706009)Instruction limit reached!
% 2.96/1.36 % (3706009)------------------------------
% 2.96/1.36 % (3706009)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.96/1.36 % (3706009)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/1.36 % (3706009)CaDiCaL version: 2.1.3
% 2.96/1.36 % (3706009)Termination reason: Instruction limit
% 2.96/1.36 % (3706009)Termination phase: Saturation
% 2.96/1.36 % (3706009)Time elapsed: 0.084 s
% 2.96/1.36 % (3706009)Peak memory usage: 90 MB
% 2.96/1.36 % (3706009)Instructions burned: 139 (million)
% 2.96/1.36 % (3706018)lrs+10_1_sil=8000:sp=occurrence:random_seed=152420252:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.96/1.36 % (3706019)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3016866185:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.96/1.36 % (3706020)lrs+1011_1_sil=32000:sp=occurrence:random_seed=241882210:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.96/1.36 % (3706019)Instruction limit reached!
% 2.96/1.36 % (3706019)------------------------------
% 2.96/1.36 % (3706019)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.96/1.36 % (3706019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/1.36 % (3706019)CaDiCaL version: 2.1.3
% 2.96/1.36 % (3706019)Termination reason: Instruction limit
% 2.96/1.36 % (3706019)Termination phase: Saturation
% 2.96/1.36 % (3706019)Time elapsed: 0.077 s
% 2.96/1.36 % (3706019)Peak memory usage: 93 MB
% 2.96/1.36 % (3706019)Instructions burned: 157 (million)
% 2.96/1.36 % (3706008)Refutation found. Thanks to Tanya!
% 2.96/1.36 % SZS status Theorem for theBenchmark
% 2.96/1.36 % SZS output start Proof for theBenchmark
% See solution above
% 4.10/1.55 % (3706008)------------------------------
% 4.10/1.55 % (3706008)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.10/1.55 % (3706008)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.10/1.55 % (3706008)CaDiCaL version: 2.1.3
% 4.10/1.55 % (3706008)Termination reason: Refutation
% 4.10/1.55 % (3706008)Time elapsed: 0.065 s
% 4.10/1.55 % (3706008)Peak memory usage: 89 MB
% 4.10/1.55 % (3706008)Instructions burned: 111 (million)
% 4.10/1.55 % (3706008)------------------------------
% 4.10/1.55 % (3706008)------------------------------
% 4.10/1.55 % (3705999)Success in time 0.497 s
% 4.10/1.55 % Vampire exiting
%------------------------------------------------------------------------------