%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : RNG090+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 : 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:35:28 PM UTC 2026
% Result : Theorem 3.85s 1.63s
% Output : Refutation 5.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 9
% Syntax : Number of formulae : 63 ( 15 unt; 0 def)
% Number of atoms : 206 ( 30 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 274 ( 131 ~; 109 |; 17 &)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 60 ( 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( ( aElement0(X0)
& aElement0(X1) )
=> aElement0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(f7,axiom,
! [X0,X1] :
( ( aElement0(X0)
& aElement0(X1) )
=> sdtpldt0(X0,X1) = sdtpldt0(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddComm) ).
fof(f8,axiom,
! [X0,X1,X2] :
( ( aElement0(X0)
& aElement0(X1)
& aElement0(X2) )
=> sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddAsso) ).
fof(f20,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(f24,axiom,
! [X0] :
( aIdeal0(X0)
<=> ( aSet0(X0)
& ! [X1] :
( aElementOf0(X1,X0)
=> ( ! [X2] :
( aElementOf0(X2,X0)
=> aElementOf0(sdtpldt0(X1,X2),X0) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefIdeal) ).
fof(f25,axiom,
( aIdeal0(xI)
& aIdeal0(xJ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__870) ).
fof(f27,axiom,
( aElementOf0(xk,xI)
& aElementOf0(xl,xJ)
& xx = sdtpldt0(xk,xl) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__934) ).
fof(f28,axiom,
( aElementOf0(xm,xI)
& aElementOf0(xn,xJ)
& xy = sdtpldt0(xm,xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__967) ).
fof(f31,conjecture,
sdtpldt0(xx,xy) = sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f32,negated_conjecture,
sdtpldt0(xx,xy) != sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
inference(negated_conjecture,[status(cth)],[f31]) ).
fof(f33,plain,
sdtpldt0(xx,xy) != sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
inference(flattening,[],[f32]) ).
fof(f34,plain,
! [X0] :
( aIdeal0(X0)
<=> ( aSet0(X0)
& ! [X1] :
( aElementOf0(X1,X0)
=> ( ! [X2] :
( aElementOf0(X2,X0)
=> aElementOf0(sdtpldt0(X1,X2),X0) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X1),X0) ) ) ) ) ),
inference(rectify,[],[f24]) ).
fof(f38,plain,
! [X0] :
( aIdeal0(X0)
=> ( aSet0(X0)
& ! [X1] :
( aElementOf0(X1,X0)
=> ( ! [X2] :
( aElementOf0(X2,X0)
=> aElementOf0(sdtpldt0(X1,X2),X0) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X1),X0) ) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f34]) ).
fof(f39,plain,
! [X0] :
( ( aSet0(X0)
& ! [X1] :
( ( ! [X2] :
( aElementOf0(sdtpldt0(X1,X2),X0)
| ~ aElementOf0(X2,X0) )
& ! [X3] :
( aElementOf0(sdtasdt0(X3,X1),X0)
| ~ aElement0(X3) ) )
| ~ aElementOf0(X1,X0) ) )
| ~ aIdeal0(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f42,plain,
! [X0,X1,X2] :
( sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2))
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f43,plain,
! [X0,X1,X2] :
( sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2))
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(flattening,[],[f42]) ).
fof(f44,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) = sdtpldt0(X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f45,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) = sdtpldt0(X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(flattening,[],[f44]) ).
fof(f46,plain,
! [X0,X1] :
( aElement0(sdtpldt0(X0,X1))
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f47,plain,
! [X0,X1] :
( aElement0(sdtpldt0(X0,X1))
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(flattening,[],[f46]) ).
fof(f58,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f69,plain,
aIdeal0(xJ),
inference(cnf_transformation,[],[f25]) ).
fof(f70,plain,
aIdeal0(xI),
inference(cnf_transformation,[],[f25]) ).
fof(f74,plain,
xx = sdtpldt0(xk,xl),
inference(cnf_transformation,[],[f27]) ).
fof(f75,plain,
aElementOf0(xl,xJ),
inference(cnf_transformation,[],[f27]) ).
fof(f76,plain,
aElementOf0(xk,xI),
inference(cnf_transformation,[],[f27]) ).
fof(f77,plain,
xy = sdtpldt0(xm,xn),
inference(cnf_transformation,[],[f28]) ).
fof(f78,plain,
aElementOf0(xn,xJ),
inference(cnf_transformation,[],[f28]) ).
fof(f79,plain,
aElementOf0(xm,xI),
inference(cnf_transformation,[],[f28]) ).
fof(f84,plain,
sdtpldt0(xx,xy) != sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
inference(cnf_transformation,[],[f33]) ).
fof(f87,plain,
! [X0] :
( aSet0(X0)
| ~ aIdeal0(X0) ),
inference(cnf_transformation,[],[f39]) ).
fof(f100,plain,
! [X2,X0,X1] :
( sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2))
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(cnf_transformation,[],[f43]) ).
fof(f101,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) = sdtpldt0(X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(cnf_transformation,[],[f45]) ).
fof(f102,plain,
! [X0,X1] :
( aElement0(sdtpldt0(X0,X1))
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f112,plain,
! [X0,X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f121,plain,
( aElement0(xk)
| ~ aSet0(xI) ),
inference(resolution,[],[f112,f76]) ).
fof(f122,plain,
( aElement0(xl)
| ~ aSet0(xJ) ),
inference(resolution,[],[f112,f75]) ).
fof(f123,plain,
( aElement0(xm)
| ~ aSet0(xI) ),
inference(resolution,[],[f112,f79]) ).
fof(f124,plain,
( aElement0(xn)
| ~ aSet0(xJ) ),
inference(resolution,[],[f112,f78]) ).
fof(f125,plain,
( aElement0(xx)
| ~ aElement0(xk)
| ~ aElement0(xl) ),
inference(superposition,[],[f102,f74]) ).
fof(f130,plain,
( sdtpldt0(xx,xy) != sdtpldt0(sdtpldt0(xm,xk),sdtpldt0(xl,xn))
| ~ aElement0(xk)
| ~ aElement0(xm) ),
inference(superposition,[],[f84,f101]) ).
fof(f195,plain,
( sdtpldt0(xx,xy) != sdtpldt0(xm,sdtpldt0(xk,sdtpldt0(xl,xn)))
| ~ aElement0(xk)
| ~ aElement0(xm)
| ~ aElement0(xm)
| ~ aElement0(xk)
| ~ aElement0(sdtpldt0(xl,xn)) ),
inference(superposition,[],[f130,f100]) ).
fof(f202,plain,
! [X2,X0,X1] :
( sdtpldt0(X0,sdtpldt0(X1,X2)) = sdtpldt0(X2,sdtpldt0(X0,X1))
| ~ aElement0(sdtpldt0(X0,X1))
| ~ aElement0(X2)
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(superposition,[],[f101,f100]) ).
fof(f205,plain,
! [X2,X0,X1] :
( sdtpldt0(X0,sdtpldt0(X1,X2)) = sdtpldt0(X2,sdtpldt0(X0,X1))
| ~ aElement0(sdtpldt0(X0,X1))
| ~ aElement0(X2)
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(duplicate_literal_removal,[],[f202]) ).
fof(f209,plain,
( sdtpldt0(xx,xy) != sdtpldt0(xm,sdtpldt0(xk,sdtpldt0(xl,xn)))
| ~ aElement0(xk)
| ~ aElement0(xm)
| ~ aElement0(sdtpldt0(xl,xn)) ),
inference(duplicate_literal_removal,[],[f195]) ).
fof(f217,plain,
! [X2,X0,X1] :
( sdtpldt0(X0,sdtpldt0(X1,X2)) = sdtpldt0(X2,sdtpldt0(X0,X1))
| ~ aElement0(X2)
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(forward_subsumption_resolution,[],[f205,f102]) ).
fof(f916,plain,
( sdtpldt0(xx,xy) != sdtpldt0(xm,sdtpldt0(xn,sdtpldt0(xk,xl)))
| ~ aElement0(xk)
| ~ aElement0(xm)
| ~ aElement0(sdtpldt0(xl,xn))
| ~ aElement0(xn)
| ~ aElement0(xk)
| ~ aElement0(xl) ),
inference(superposition,[],[f209,f217]) ).
fof(f999,plain,
( sdtpldt0(xx,xy) != sdtpldt0(xm,sdtpldt0(xn,sdtpldt0(xk,xl)))
| ~ aElement0(xk)
| ~ aElement0(xm)
| ~ aElement0(sdtpldt0(xl,xn))
| ~ aElement0(xn)
| ~ aElement0(xl) ),
inference(duplicate_literal_removal,[],[f916]) ).
fof(f1068,plain,
( sdtpldt0(xx,xy) != sdtpldt0(xm,sdtpldt0(xn,sdtpldt0(xk,xl)))
| ~ aElement0(xk)
| ~ aElement0(xm)
| ~ aElement0(xn)
| ~ aElement0(xl) ),
inference(forward_subsumption_resolution,[],[f999,f102]) ).
fof(f1115,plain,
( sdtpldt0(xx,xy) != sdtpldt0(xm,sdtpldt0(xn,xx))
| ~ aElement0(xk)
| ~ aElement0(xm)
| ~ aElement0(xn)
| ~ aElement0(xl) ),
inference(forward_demodulation,[],[f1068,f74]) ).
fof(f1130,plain,
( sdtpldt0(xx,xy) != sdtpldt0(xx,sdtpldt0(xm,xn))
| ~ aElement0(xk)
| ~ aElement0(xm)
| ~ aElement0(xn)
| ~ aElement0(xl)
| ~ aElement0(xx)
| ~ aElement0(xm)
| ~ aElement0(xn) ),
inference(superposition,[],[f1115,f217]) ).
fof(f1131,plain,
( sdtpldt0(xx,xy) != sdtpldt0(xx,sdtpldt0(xm,xn))
| ~ aElement0(xk)
| ~ aElement0(xm)
| ~ aElement0(xn)
| ~ aElement0(xl)
| ~ aElement0(xx) ),
inference(duplicate_literal_removal,[],[f1130]) ).
fof(f1135,plain,
( sdtpldt0(xx,xy) != sdtpldt0(xx,sdtpldt0(xm,xn))
| ~ aElement0(xk)
| ~ aElement0(xm)
| ~ aElement0(xn)
| ~ aElement0(xl) ),
inference(forward_subsumption_resolution,[],[f1131,f125]) ).
fof(f1137,plain,
( sdtpldt0(xx,xy) != sdtpldt0(xx,xy)
| ~ aElement0(xk)
| ~ aElement0(xm)
| ~ aElement0(xn)
| ~ aElement0(xl) ),
inference(forward_demodulation,[],[f1135,f77]) ).
fof(f1138,plain,
( ~ aElement0(xn)
| ~ aElement0(xm)
| ~ aElement0(xk)
| ~ aElement0(xl) ),
inference(trivial_inequality_removal,[],[f1137]) ).
fof(f1139,plain,
( ~ aElement0(xm)
| ~ aElement0(xk)
| ~ aElement0(xl)
| ~ aSet0(xJ) ),
inference(resolution,[],[f1138,f124]) ).
fof(f1140,plain,
( ~ aSet0(xJ)
| ~ aElement0(xk)
| ~ aElement0(xm) ),
inference(forward_subsumption_resolution,[],[f1139,f122]) ).
fof(f1141,plain,
( ~ aElement0(xk)
| ~ aElement0(xm)
| ~ aIdeal0(xJ) ),
inference(resolution,[],[f1140,f87]) ).
fof(f1142,plain,
( ~ aElement0(xm)
| ~ aElement0(xk) ),
inference(forward_subsumption_resolution,[],[f1141,f69]) ).
fof(f1143,plain,
( ~ aElement0(xk)
| ~ aSet0(xI) ),
inference(resolution,[],[f1142,f123]) ).
fof(f1144,plain,
~ aSet0(xI),
inference(forward_subsumption_resolution,[],[f1143,f121]) ).
fof(f1145,plain,
~ aIdeal0(xI),
inference(resolution,[],[f1144,f87]) ).
fof(f1146,plain,
$false,
inference(forward_subsumption_resolution,[],[f1145,f70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG090+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.17/0.43 % Computer : n010.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Sun Sep 27 23:13:17 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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
% 3.85/1.63 % (1412358)Detected formulas, will run a generic FOF schedule.
% 3.85/1.63 % (1412374)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=57079816:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.85/1.63 % (1412378)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2751451041:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.85/1.63 % (1412375)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=3388036439:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.85/1.63 % (1412373)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=3281392778:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.85/1.63 % (1412377)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4223005593:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.85/1.63 % (1412376)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3624853125:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.85/1.63 % (1412379)dis-21_1_sil=8000:lcm=predicate:random_seed=231986038: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)
% 3.85/1.63 % (1412376)Refutation not found, incomplete strategy
% 3.85/1.63 % (1412376)------------------------------
% 3.85/1.63 % (1412376)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.85/1.63 % (1412376)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.85/1.63 % (1412376)CaDiCaL version: 2.1.3
% 3.85/1.63 % (1412376)Termination reason: Refutation not found, incomplete strategy
% 3.85/1.63 % (1412376)Time elapsed: 0.006 s
% 3.85/1.63 % (1412376)Peak memory usage: 89 MB
% 3.85/1.63 % (1412376)Instructions burned: 4 (million)
% 3.85/1.63 % (1412377)First to succeed.
% 3.85/1.63 % (1412377)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1412358"
% 3.85/1.63 % (1412379)Instruction limit reached!
% 3.85/1.63 % (1412379)------------------------------
% 3.85/1.63 % (1412379)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.85/1.63 % (1412379)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.85/1.63 % (1412379)CaDiCaL version: 2.1.3
% 3.85/1.63 % (1412379)Termination reason: Instruction limit
% 3.85/1.63 % (1412379)Termination phase: Saturation
% 3.85/1.63 % (1412379)Time elapsed: 0.103 s
% 3.85/1.63 % (1412379)Peak memory usage: 89 MB
% 3.85/1.63 % (1412379)Instructions burned: 129 (million)
% 3.85/1.63 % (1412378)Instruction limit reached!
% 3.85/1.63 % (1412378)------------------------------
% 3.85/1.63 % (1412378)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.85/1.63 % (1412378)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.85/1.63 % (1412378)CaDiCaL version: 2.1.3
% 3.85/1.63 % (1412378)Termination reason: Instruction limit
% 3.85/1.63 % (1412378)Termination phase: Saturation
% 3.85/1.63 % (1412378)Time elapsed: 0.139 s
% 3.85/1.63 % (1412378)Peak memory usage: 90 MB
% 3.85/1.63 % (1412378)Instructions burned: 139 (million)
% 3.85/1.63 % (1412390)lrs+10_1_sil=8000:sp=occurrence:random_seed=2164131478:i=285:sd=3:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/285Mi)
% 3.85/1.63 % (1412392)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1717934793:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 3.85/1.63 % (1412376)------------------------------
% 3.85/1.63 % (1412376)------------------------------
% 3.85/1.63 % (1412392)Instruction limit reached!
% 3.85/1.63 % (1412392)------------------------------
% 3.85/1.63 % (1412392)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.85/1.63 % (1412392)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.85/1.63 % (1412392)CaDiCaL version: 2.1.3
% 3.85/1.63 % (1412392)Termination reason: Instruction limit
% 3.85/1.63 % (1412392)Termination phase: Saturation
% 3.85/1.63 % (1412392)Time elapsed: 0.121 s
% 3.85/1.63 % (1412392)Peak memory usage: 89 MB
% 3.85/1.63 % (1412392)Instructions burned: 158 (million)
% 3.85/1.63 % (1412377)Refutation found. Thanks to Tanya!
% 3.85/1.63 % SZS status Theorem for theBenchmark
% 3.85/1.63 % SZS output start Proof for theBenchmark
% See solution above
% 5.58/1.92 % (1412377)------------------------------
% 5.58/1.92 % (1412377)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.58/1.92 % (1412377)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.58/1.92 % (1412377)CaDiCaL version: 2.1.3
% 5.58/1.92 % (1412377)Termination reason: Refutation
% 5.58/1.92 % (1412377)Time elapsed: 0.042 s
% 5.58/1.92 % (1412377)Peak memory usage: 89 MB
% 5.58/1.92 % (1412377)Instructions burned: 40 (million)
% 5.58/1.92 % (1412377)------------------------------
% 5.58/1.92 % (1412377)------------------------------
% 5.58/1.92 % (1412358)Success in time 0.666 s
% 5.58/1.92 % Vampire exiting
%------------------------------------------------------------------------------