%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET802+4 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:41:57 PM UTC 2026
% Result : Theorem 0.36s 1.01s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 4
% Syntax : Number of formulae : 56 ( 5 unt; 0 def)
% Number of atoms : 257 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 318 ( 117 ~; 120 |; 64 &)
% ( 9 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 175 ( 155 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0,X1,X2] :
( lower_bound(X2,X0,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X0,X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lower_bound) ).
fof(f17,axiom,
! [X0,X1,X2] :
( least(X2,X0,X1)
<=> ( member(X2,X1)
& ! [X3] :
( member(X3,X1)
=> apply(X0,X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',least) ).
fof(f21,axiom,
! [X0,X1,X2,X3] :
( greatest_lower_bound(X0,X1,X2,X3)
<=> ( member(X0,X1)
& lower_bound(X0,X2,X1)
& ! [X4] :
( ( member(X4,X3)
& lower_bound(X4,X2,X1) )
=> apply(X2,X4,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greatest_lower_bound) ).
fof(f22,conjecture,
! [X0,X1] :
( order(X0,X1)
=> ! [X2] :
( subset(X2,X1)
=> ! [X3] :
( least(X3,X0,X2)
<=> ( member(X3,X2)
& greatest_lower_bound(X3,X2,X0,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV14) ).
fof(f23,negated_conjecture,
~ ! [X0,X1] :
( order(X0,X1)
=> ! [X2] :
( subset(X2,X1)
=> ! [X3] :
( least(X3,X0,X2)
<=> ( member(X3,X2)
& greatest_lower_bound(X3,X2,X0,X1) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f22]) ).
fof(f27,plain,
? [X0,X1] :
( ? [X2] :
( ? [X3] :
( least(X3,X0,X2)
<~> ( member(X3,X2)
& greatest_lower_bound(X3,X2,X0,X1) ) )
& subset(X2,X1) )
& order(X0,X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f31,plain,
! [X0,X1,X2] :
( least(X2,X0,X1)
<=> ( member(X2,X1)
& ! [X3] :
( apply(X0,X2,X3)
| ~ member(X3,X1) ) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f32,plain,
! [X0,X1,X2,X3] :
( greatest_lower_bound(X0,X1,X2,X3)
<=> ( member(X0,X1)
& lower_bound(X0,X2,X1)
& ! [X4] :
( apply(X2,X4,X0)
| ~ member(X4,X3)
| ~ lower_bound(X4,X2,X1) ) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f33,plain,
! [X0,X1,X2,X3] :
( greatest_lower_bound(X0,X1,X2,X3)
<=> ( member(X0,X1)
& lower_bound(X0,X2,X1)
& ! [X4] :
( apply(X2,X4,X0)
| ~ member(X4,X3)
| ~ lower_bound(X4,X2,X1) ) ) ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
! [X0,X1,X2] :
( lower_bound(X2,X0,X1)
<=> ! [X3] :
( apply(X0,X2,X3)
| ~ member(X3,X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f35,plain,
? [X0,X1] :
( ? [X2] :
( ? [X3] :
( ( ~ member(X3,X2)
| ~ greatest_lower_bound(X3,X2,X0,X1)
| ~ least(X3,X0,X2) )
& ( ( member(X3,X2)
& greatest_lower_bound(X3,X2,X0,X1) )
| least(X3,X0,X2) ) )
& subset(X2,X1) )
& order(X0,X1) ),
inference(nnf_transformation,[],[f27]) ).
fof(f36,plain,
? [X0,X1] :
( ? [X2] :
( ? [X3] :
( ( ~ member(X3,X2)
| ~ greatest_lower_bound(X3,X2,X0,X1)
| ~ least(X3,X0,X2) )
& ( ( member(X3,X2)
& greatest_lower_bound(X3,X2,X0,X1) )
| least(X3,X0,X2) ) )
& subset(X2,X1) )
& order(X0,X1) ),
inference(flattening,[],[f35]) ).
fof(f37,plain,
( ( ~ member(sK3,sK2)
| ~ greatest_lower_bound(sK3,sK2,sK0,sK1)
| ~ least(sK3,sK0,sK2) )
& ( ( member(sK3,sK2)
& greatest_lower_bound(sK3,sK2,sK0,sK1) )
| least(sK3,sK0,sK2) )
& subset(sK2,sK1)
& order(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f36]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( least(X2,X0,X1)
| ~ member(X2,X1)
| ? [X3] :
( ~ apply(X0,X2,X3)
& member(X3,X1) ) )
& ( ( member(X2,X1)
& ! [X3] :
( apply(X0,X2,X3)
| ~ member(X3,X1) ) )
| ~ least(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( least(X2,X0,X1)
| ~ member(X2,X1)
| ? [X3] :
( ~ apply(X0,X2,X3)
& member(X3,X1) ) )
& ( ( member(X2,X1)
& ! [X3] :
( apply(X0,X2,X3)
| ~ member(X3,X1) ) )
| ~ least(X2,X0,X1) ) ),
inference(flattening,[],[f38]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( least(X2,X0,X1)
| ~ member(X2,X1)
| ? [X3] :
( ~ apply(X0,X2,X3)
& member(X3,X1) ) )
& ( ( member(X2,X1)
& ! [X4] :
( apply(X0,X2,X4)
| ~ member(X4,X1) ) )
| ~ least(X2,X0,X1) ) ),
inference(rectify,[],[f39]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ( least(X2,X0,X1)
| ~ member(X2,X1)
| ( ~ apply(X0,X2,sK4(X0,X1,X2))
& member(sK4(X0,X1,X2),X1) ) )
& ( ( member(X2,X1)
& ! [X4] :
( apply(X0,X2,X4)
| ~ member(X4,X1) ) )
| ~ least(X2,X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X3,sK4(X0,X1,X2))],[f40]) ).
fof(f42,plain,
! [X0,X1,X2,X3] :
( ( greatest_lower_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ lower_bound(X0,X2,X1)
| ? [X4] :
( ~ apply(X2,X4,X0)
& member(X4,X3)
& lower_bound(X4,X2,X1) ) )
& ( ( member(X0,X1)
& lower_bound(X0,X2,X1)
& ! [X4] :
( apply(X2,X4,X0)
| ~ member(X4,X3)
| ~ lower_bound(X4,X2,X1) ) )
| ~ greatest_lower_bound(X0,X1,X2,X3) ) ),
inference(nnf_transformation,[],[f33]) ).
fof(f43,plain,
! [X0,X1,X2,X3] :
( ( greatest_lower_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ lower_bound(X0,X2,X1)
| ? [X4] :
( ~ apply(X2,X4,X0)
& member(X4,X3)
& lower_bound(X4,X2,X1) ) )
& ( ( member(X0,X1)
& lower_bound(X0,X2,X1)
& ! [X4] :
( apply(X2,X4,X0)
| ~ member(X4,X3)
| ~ lower_bound(X4,X2,X1) ) )
| ~ greatest_lower_bound(X0,X1,X2,X3) ) ),
inference(flattening,[],[f42]) ).
fof(f44,plain,
! [X0,X1,X2,X3] :
( ( greatest_lower_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ lower_bound(X0,X2,X1)
| ? [X4] :
( ~ apply(X2,X4,X0)
& member(X4,X3)
& lower_bound(X4,X2,X1) ) )
& ( ( member(X0,X1)
& lower_bound(X0,X2,X1)
& ! [X5] :
( apply(X2,X5,X0)
| ~ member(X5,X3)
| ~ lower_bound(X5,X2,X1) ) )
| ~ greatest_lower_bound(X0,X1,X2,X3) ) ),
inference(rectify,[],[f43]) ).
fof(f45,plain,
! [X0,X1,X2,X3] :
( ( greatest_lower_bound(X0,X1,X2,X3)
| ~ member(X0,X1)
| ~ lower_bound(X0,X2,X1)
| ( ~ apply(X2,sK5(X0,X1,X2,X3),X0)
& member(sK5(X0,X1,X2,X3),X3)
& lower_bound(sK5(X0,X1,X2,X3),X2,X1) ) )
& ( ( member(X0,X1)
& lower_bound(X0,X2,X1)
& ! [X5] :
( apply(X2,X5,X0)
| ~ member(X5,X3)
| ~ lower_bound(X5,X2,X1) ) )
| ~ greatest_lower_bound(X0,X1,X2,X3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X4,sK5(X0,X1,X2,X3))],[f44]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ( lower_bound(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X2,X3)
& member(X3,X1) ) )
& ( ! [X3] :
( apply(X0,X2,X3)
| ~ member(X3,X1) )
| ~ lower_bound(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f34]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ( lower_bound(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X2,X3)
& member(X3,X1) ) )
& ( ! [X4] :
( apply(X0,X2,X4)
| ~ member(X4,X1) )
| ~ lower_bound(X2,X0,X1) ) ),
inference(rectify,[],[f46]) ).
fof(f48,plain,
! [X0,X1,X2] :
( ( lower_bound(X2,X0,X1)
| ( ~ apply(X0,X2,sK6(X0,X1,X2))
& member(sK6(X0,X1,X2),X1) ) )
& ( ! [X4] :
( apply(X0,X2,X4)
| ~ member(X4,X1) )
| ~ lower_bound(X2,X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X3,sK6(X0,X1,X2))],[f47]) ).
fof(f51,plain,
( greatest_lower_bound(sK3,sK2,sK0,sK1)
| least(sK3,sK0,sK2) ),
inference(cnf_transformation,[],[f37]) ).
fof(f52,plain,
( least(sK3,sK0,sK2)
| member(sK3,sK2) ),
inference(cnf_transformation,[],[f37]) ).
fof(f53,plain,
( ~ greatest_lower_bound(sK3,sK2,sK0,sK1)
| ~ member(sK3,sK2)
| ~ least(sK3,sK0,sK2) ),
inference(cnf_transformation,[],[f37]) ).
fof(f58,plain,
! [X2,X0,X1,X4] :
( apply(X0,X2,X4)
| ~ member(X4,X1)
| ~ least(X2,X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f59,plain,
! [X2,X0,X1] :
( ~ least(X2,X0,X1)
| member(X2,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f60,plain,
! [X2,X0,X1] :
( member(sK4(X0,X1,X2),X1)
| ~ member(X2,X1)
| least(X2,X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f61,plain,
! [X2,X0,X1] :
( ~ apply(X0,X2,sK4(X0,X1,X2))
| ~ member(X2,X1)
| least(X2,X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f63,plain,
! [X2,X3,X0,X1] :
( ~ greatest_lower_bound(X0,X1,X2,X3)
| lower_bound(X0,X2,X1) ),
inference(cnf_transformation,[],[f45]) ).
fof(f65,plain,
! [X2,X3,X0,X1] :
( lower_bound(sK5(X0,X1,X2,X3),X2,X1)
| ~ member(X0,X1)
| ~ lower_bound(X0,X2,X1)
| greatest_lower_bound(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f45]) ).
fof(f67,plain,
! [X2,X3,X0,X1] :
( ~ apply(X2,sK5(X0,X1,X2,X3),X0)
| ~ member(X0,X1)
| ~ lower_bound(X0,X2,X1)
| greatest_lower_bound(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f45]) ).
fof(f68,plain,
! [X2,X0,X1,X4] :
( apply(X0,X2,X4)
| ~ member(X4,X1)
| ~ lower_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
fof(f69,plain,
! [X2,X0,X1] :
( member(sK6(X0,X1,X2),X1)
| lower_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
fof(f70,plain,
! [X2,X0,X1] :
( ~ apply(X0,X2,sK6(X0,X1,X2))
| lower_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
fof(f72,plain,
( member(sK3,sK2)
| member(sK3,sK2) ),
inference(resolution,[],[f59,f52]) ).
fof(f73,plain,
member(sK3,sK2),
inference(duplicate_literal_removal,[],[f72]) ).
fof(f75,plain,
( least(sK3,sK0,sK2)
| lower_bound(sK3,sK0,sK2) ),
inference(resolution,[],[f63,f51]) ).
fof(f78,plain,
! [X2,X3,X0,X1] :
( ~ member(sK6(X1,X2,X0),X3)
| lower_bound(X0,X1,X2)
| ~ least(X0,X1,X3) ),
inference(resolution,[],[f70,f58]) ).
fof(f79,plain,
! [X2,X3,X0,X1] :
( ~ member(sK4(X2,X1,X0),X3)
| least(X0,X2,X1)
| ~ member(X0,X1)
| ~ lower_bound(X0,X2,X3) ),
inference(resolution,[],[f61,f68]) ).
fof(f86,plain,
! [X2,X0,X1] :
( lower_bound(X0,X1,X2)
| ~ least(X0,X1,X2)
| lower_bound(X0,X1,X2) ),
inference(resolution,[],[f78,f69]) ).
fof(f88,plain,
! [X2,X0,X1] :
( lower_bound(X0,X1,X2)
| ~ least(X0,X1,X2) ),
inference(duplicate_literal_removal,[],[f86]) ).
fof(f95,plain,
! [X2,X0,X1] :
( least(X0,X1,X2)
| ~ member(X0,X2)
| ~ lower_bound(X0,X1,X2)
| ~ member(X0,X2)
| least(X0,X1,X2) ),
inference(resolution,[],[f79,f60]) ).
fof(f97,plain,
! [X2,X0,X1] :
( least(X0,X1,X2)
| ~ member(X0,X2)
| ~ lower_bound(X0,X1,X2) ),
inference(duplicate_literal_removal,[],[f95]) ).
fof(f99,plain,
! [X2,X3,X0,X1,X4] :
( ~ lower_bound(sK5(X0,X1,X2,X3),X2,X4)
| ~ lower_bound(X0,X2,X1)
| greatest_lower_bound(X0,X1,X2,X3)
| ~ member(X0,X4)
| ~ member(X0,X1) ),
inference(resolution,[],[f67,f68]) ).
fof(f128,plain,
! [X2,X3,X0,X1] :
( ~ lower_bound(X0,X1,X2)
| greatest_lower_bound(X0,X2,X1,X3)
| ~ member(X0,X2)
| ~ member(X0,X2)
| ~ member(X0,X2)
| ~ lower_bound(X0,X1,X2)
| greatest_lower_bound(X0,X2,X1,X3) ),
inference(resolution,[],[f99,f65]) ).
fof(f132,plain,
! [X2,X3,X0,X1] :
( greatest_lower_bound(X0,X2,X1,X3)
| ~ lower_bound(X0,X1,X2)
| ~ member(X0,X2) ),
inference(duplicate_literal_removal,[],[f128]) ).
fof(f191,plain,
( ~ lower_bound(sK3,sK0,sK2)
| ~ member(sK3,sK2)
| ~ member(sK3,sK2)
| ~ least(sK3,sK0,sK2) ),
inference(resolution,[],[f132,f53]) ).
fof(f195,plain,
( ~ lower_bound(sK3,sK0,sK2)
| ~ member(sK3,sK2)
| ~ least(sK3,sK0,sK2) ),
inference(duplicate_literal_removal,[],[f191]) ).
fof(f196,plain,
( ~ lower_bound(sK3,sK0,sK2)
| ~ member(sK3,sK2) ),
inference(forward_subsumption_resolution,[],[f195,f97]) ).
fof(f197,plain,
~ lower_bound(sK3,sK0,sK2),
inference(forward_subsumption_resolution,[],[f196,f73]) ).
fof(f200,plain,
~ least(sK3,sK0,sK2),
inference(resolution,[],[f197,f88]) ).
fof(f202,plain,
lower_bound(sK3,sK0,sK2),
inference(resolution,[],[f200,f75]) ).
fof(f205,plain,
$false,
inference(forward_subsumption_resolution,[],[f202,f197]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET802+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n018.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 : Mon Sep 28 02:52:55 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.36/1.01 % (2946717)Detected formulas, will run a generic FOF schedule.
% 0.36/1.01 % (2946728)dis-21_1_sil=8000:lcm=predicate:random_seed=2649625049: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.36/1.01 % (2946727)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2055367890:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.36/1.01 % (2946726)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=679037148:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.36/1.01 % (2946725)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3670911782:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.36/1.01 % (2946723)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=1286145928:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.36/1.01 % (2946722)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=54304567:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.36/1.01 % (2946724)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=3027795540:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.36/1.01 % (2946725)Refutation not found, incomplete strategy
% 0.36/1.01 % (2946725)------------------------------
% 0.36/1.01 % (2946725)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.36/1.01 % (2946725)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/1.01 % (2946725)CaDiCaL version: 2.1.3
% 0.36/1.01 % (2946725)Termination reason: Refutation not found, incomplete strategy
% 0.36/1.01 % (2946725)Time elapsed: 0.003 s
% 0.36/1.01 % (2946725)Peak memory usage: 88 MB
% 0.36/1.01 % (2946725)Instructions burned: 2 (million)
% 0.36/1.01 % (2946726)First to succeed.
% 0.36/1.01 % (2946726)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2946717"
% 0.36/1.01 % (2946727)Also succeeded, but the first one will report.
% 0.36/1.01 % (2946728)Also succeeded, but the first one will report.
% 0.36/1.01 % (2946725)------------------------------
% 0.36/1.01 % (2946725)------------------------------
% 0.36/1.01 % (2946726)Refutation found. Thanks to Tanya!
% 0.36/1.01 % SZS status Theorem for theBenchmark
% 0.36/1.01 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/1.20 % (2946726)------------------------------
% 0.16/1.20 % (2946726)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.20 % (2946726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.20 % (2946726)CaDiCaL version: 2.1.3
% 0.16/1.20 % (2946726)Termination reason: Refutation
% 0.16/1.20 % (2946726)Time elapsed: 0.007 s
% 0.16/1.20 % (2946726)Peak memory usage: 88 MB
% 0.16/1.20 % (2946726)Instructions burned: 10 (million)
% 0.16/1.20 % (2946726)------------------------------
% 0.16/1.20 % (2946726)------------------------------
% 0.16/1.20 % (2946717)Success in time 0.39 s
% 0.16/1.20 % Vampire exiting
%------------------------------------------------------------------------------