%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : COM007+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 09:39:21 AM UTC 2026
% Result : Theorem 2.88s 1.11s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of formulae : 83 ( 17 unt; 5 def)
% Number of atoms : 202 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 226 ( 107 ~; 99 |; 8 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn 82 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( reflexive_rewrite(a,b)
& reflexive_rewrite(a,c) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption) ).
fof(f2,axiom,
! [X0] :
( ( reflexive_rewrite(b,X0)
& reflexive_rewrite(c,X0) )
=> goal ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_ax) ).
fof(f3,axiom,
! [X0] : equalish(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
fof(f4,axiom,
! [X0,X1] :
( equalish(X0,X1)
=> equalish(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmtery) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( equalish(X0,X1)
& reflexive_rewrite(X1,X2) )
=> reflexive_rewrite(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',substitution) ).
fof(f6,axiom,
! [X0,X1] :
( equalish(X0,X1)
=> reflexive_rewrite(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equalish_in_reflexive_rewrite) ).
fof(f7,axiom,
! [X0,X1] :
( rewrite(X0,X1)
=> reflexive_rewrite(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_in_reflexive_rewrite) ).
fof(f8,axiom,
! [X0,X1] :
( reflexive_rewrite(X0,X1)
=> ( equalish(X0,X1)
| rewrite(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equalish_or_rewrite) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( rewrite(X0,X1)
& rewrite(X0,X2) )
=> ? [X3] :
( rewrite(X1,X3)
& rewrite(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_diamond) ).
fof(f10,conjecture,
goal,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_to_be_proved) ).
fof(f11,negated_conjecture,
~ goal,
inference(negated_conjecture,[status(cth)],[f10]) ).
fof(f12,plain,
~ goal,
inference(flattening,[],[f11]) ).
fof(f13,plain,
! [X0] :
( goal
| ~ reflexive_rewrite(b,X0)
| ~ reflexive_rewrite(c,X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f14,plain,
! [X0] :
( goal
| ~ reflexive_rewrite(b,X0)
| ~ reflexive_rewrite(c,X0) ),
inference(flattening,[],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( equalish(X1,X0)
| ~ equalish(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f16,plain,
! [X0,X1,X2] :
( reflexive_rewrite(X0,X2)
| ~ equalish(X0,X1)
| ~ reflexive_rewrite(X1,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f17,plain,
! [X0,X1,X2] :
( reflexive_rewrite(X0,X2)
| ~ equalish(X0,X1)
| ~ reflexive_rewrite(X1,X2) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0,X1] :
( reflexive_rewrite(X0,X1)
| ~ equalish(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f19,plain,
! [X0,X1] :
( reflexive_rewrite(X0,X1)
| ~ rewrite(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f20,plain,
! [X0,X1] :
( equalish(X0,X1)
| rewrite(X0,X1)
| ~ reflexive_rewrite(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f21,plain,
! [X0,X1] :
( equalish(X0,X1)
| rewrite(X0,X1)
| ~ reflexive_rewrite(X0,X1) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ? [X3] :
( rewrite(X1,X3)
& rewrite(X2,X3) )
| ~ rewrite(X0,X1)
| ~ rewrite(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ? [X3] :
( rewrite(X1,X3)
& rewrite(X2,X3) )
| ~ rewrite(X0,X1)
| ~ rewrite(X0,X2) ),
inference(flattening,[],[f22]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( rewrite(X1,sK0(X1,X2))
& rewrite(X2,sK0(X1,X2)) )
| ~ rewrite(X0,X1)
| ~ rewrite(X0,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X1,X2))],[f23]) ).
fof(f25,plain,
reflexive_rewrite(a,c),
inference(cnf_transformation,[],[f1]) ).
fof(f26,plain,
reflexive_rewrite(a,b),
inference(cnf_transformation,[],[f1]) ).
fof(f27,plain,
! [X0] :
( goal
| ~ reflexive_rewrite(b,X0)
| ~ reflexive_rewrite(c,X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f28,plain,
! [X0] : equalish(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f29,plain,
! [X0,X1] :
( ~ equalish(X0,X1)
| equalish(X1,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ equalish(X0,X1)
| reflexive_rewrite(X0,X2)
| ~ reflexive_rewrite(X1,X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f31,plain,
! [X0,X1] :
( ~ equalish(X0,X1)
| reflexive_rewrite(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
! [X0,X1] :
( ~ rewrite(X0,X1)
| reflexive_rewrite(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f33,plain,
! [X0,X1] :
( rewrite(X0,X1)
| equalish(X0,X1)
| ~ reflexive_rewrite(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f34,plain,
! [X2,X0,X1] :
( rewrite(X2,sK0(X1,X2))
| ~ rewrite(X0,X1)
| ~ rewrite(X0,X2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f35,plain,
! [X2,X0,X1] :
( rewrite(X1,sK0(X1,X2))
| ~ rewrite(X0,X1)
| ~ rewrite(X0,X2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f36,plain,
~ goal,
inference(cnf_transformation,[],[f12]) ).
fof(f38,definition,
( spl1_1
<=> ! [X0] :
( ~ reflexive_rewrite(b,X0)
| ~ reflexive_rewrite(c,X0) ) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f39,plain,
( ! [X0] :
( ~ reflexive_rewrite(c,X0)
| ~ reflexive_rewrite(b,X0) )
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f41,definition,
( spl1_2
<=> goal ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f44,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f27,f41,f38]) ).
fof(f45,plain,
~ spl1_2,
inference(avatar_split_clause,[],[f36,f41]) ).
fof(f46,plain,
! [X0] : reflexive_rewrite(X0,X0),
inference(resolution,[],[f28,f31]) ).
fof(f47,plain,
( ~ reflexive_rewrite(b,c)
| ~ spl1_1 ),
inference(resolution,[],[f46,f39]) ).
fof(f51,plain,
! [X2,X0,X1] :
( reflexive_rewrite(X2,sK0(X1,X2))
| ~ rewrite(X0,X2)
| ~ rewrite(X0,X1) ),
inference(resolution,[],[f34,f32]) ).
fof(f52,plain,
! [X2,X0,X1] :
( reflexive_rewrite(X1,sK0(X1,X2))
| ~ rewrite(X0,X2)
| ~ rewrite(X0,X1) ),
inference(resolution,[],[f35,f32]) ).
fof(f53,plain,
( ! [X0,X1] :
( ~ reflexive_rewrite(b,sK0(X1,c))
| ~ rewrite(X0,X1)
| ~ rewrite(X0,c) )
| ~ spl1_1 ),
inference(resolution,[],[f51,f39]) ).
fof(f55,plain,
( ! [X0,X1] :
( ~ rewrite(X0,b)
| ~ rewrite(X0,c)
| ~ rewrite(X1,c)
| ~ rewrite(X1,b) )
| ~ spl1_1 ),
inference(resolution,[],[f53,f52]) ).
fof(f57,definition,
( spl1_3
<=> ! [X1] :
( ~ rewrite(X1,c)
| ~ rewrite(X1,b) ) ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f58,plain,
( ! [X1] :
( ~ rewrite(X1,c)
| ~ rewrite(X1,b) )
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f57]) ).
fof(f59,plain,
( spl1_3
| spl1_3
| ~ spl1_1 ),
inference(avatar_split_clause,[],[f55,f38,f57,f57]) ).
fof(f60,plain,
( ! [X0] :
( ~ rewrite(X0,b)
| equalish(X0,c)
| ~ reflexive_rewrite(X0,c) )
| ~ spl1_3 ),
inference(resolution,[],[f58,f33]) ).
fof(f62,plain,
( ! [X0] :
( ~ reflexive_rewrite(X0,c)
| equalish(X0,c)
| equalish(X0,b)
| ~ reflexive_rewrite(X0,b) )
| ~ spl1_3 ),
inference(resolution,[],[f60,f33]) ).
fof(f63,plain,
( equalish(a,c)
| equalish(a,b)
| ~ reflexive_rewrite(a,b)
| ~ spl1_3 ),
inference(resolution,[],[f62,f25]) ).
fof(f65,plain,
( equalish(a,c)
| equalish(a,b)
| ~ spl1_3 ),
inference(forward_subsumption_resolution,[],[f63,f26]) ).
fof(f67,definition,
( spl1_4
<=> equalish(a,b) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f69,plain,
( equalish(a,b)
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f67]) ).
fof(f71,definition,
( spl1_5
<=> equalish(a,c) ),
introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition]) ).
fof(f73,plain,
( equalish(a,c)
| ~ spl1_5 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f74,plain,
( spl1_4
| spl1_5
| ~ spl1_3 ),
inference(avatar_split_clause,[],[f65,f57,f71,f67]) ).
fof(f75,plain,
( equalish(c,a)
| ~ spl1_5 ),
inference(resolution,[],[f73,f29]) ).
fof(f79,plain,
( ! [X0] :
( reflexive_rewrite(c,X0)
| ~ reflexive_rewrite(a,X0) )
| ~ spl1_5 ),
inference(resolution,[],[f75,f30]) ).
fof(f83,plain,
( ! [X0] :
( ~ reflexive_rewrite(b,X0)
| ~ reflexive_rewrite(a,X0) )
| ~ spl1_1
| ~ spl1_5 ),
inference(resolution,[],[f79,f39]) ).
fof(f85,plain,
( ~ reflexive_rewrite(a,b)
| ~ spl1_1
| ~ spl1_5 ),
inference(resolution,[],[f83,f46]) ).
fof(f88,plain,
( $false
| ~ spl1_1
| ~ spl1_5 ),
inference(forward_subsumption_resolution,[],[f85,f26]) ).
fof(f89,plain,
( ~ spl1_1
| ~ spl1_5 ),
inference(avatar_contradiction_clause,[],[f88]) ).
fof(f90,plain,
( equalish(b,a)
| ~ spl1_4 ),
inference(resolution,[],[f69,f29]) ).
fof(f94,plain,
( ! [X0] :
( reflexive_rewrite(b,X0)
| ~ reflexive_rewrite(a,X0) )
| ~ spl1_4 ),
inference(resolution,[],[f90,f30]) ).
fof(f97,plain,
( ~ reflexive_rewrite(a,c)
| ~ spl1_1
| ~ spl1_4 ),
inference(resolution,[],[f94,f47]) ).
fof(f101,plain,
( $false
| ~ spl1_1
| ~ spl1_4 ),
inference(forward_subsumption_resolution,[],[f97,f25]) ).
fof(f102,plain,
( ~ spl1_1
| ~ spl1_4 ),
inference(avatar_contradiction_clause,[],[f101]) ).
cnf(s1,plain,
( spl1_1
| spl1_2 ),
inference(sat_conversion,[],[f44]) ).
cnf(s2,plain,
~ spl1_2,
inference(sat_conversion,[],[f45]) ).
cnf(s3,plain,
( spl1_3
| ~ spl1_1
| spl1_3 ),
inference(sat_conversion,[],[f59]) ).
cnf(s4,plain,
( ~ spl1_1
| spl1_3 ),
inference(rat,[],[s3]) ).
cnf(s5,plain,
( ~ spl1_3
| spl1_4
| spl1_5 ),
inference(sat_conversion,[],[f74]) ).
cnf(s6,plain,
( ~ spl1_1
| ~ spl1_5 ),
inference(sat_conversion,[],[f89]) ).
cnf(s7,plain,
( ~ spl1_1
| ~ spl1_4 ),
inference(sat_conversion,[],[f102]) ).
cnf(s8,plain,
spl1_1,
inference(rat,[],[s1,s2]) ).
cnf(s9,plain,
~ spl1_4,
inference(rat,[],[s7,s8]) ).
cnf(s10,plain,
~ spl1_5,
inference(rat,[],[s6,s8]) ).
cnf(s11,plain,
spl1_3,
inference(rat,[],[s4,s8]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s5,s10,s9,s11]) ).
fof(f103,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM007+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 % Computer : n016.cluster.edu
% 0.08/0.21 % Model : x86_64 x86_64
% 0.08/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.21 % Memory : 8046.5625MB
% 0.08/0.21 % OS : Linux 6.8.0-71-generic
% 0.08/0.21 % CPULimit : 300
% 0.08/0.21 % WCLimit : 300
% 0.08/0.21 % DateTime : Mon Sep 28 21:48:49 UTC 2026
% 0.08/0.21 % CPUTime :
% 0.08/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.25 Running first-order theorem proving
% 0.08/0.25 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.88/1.11 % (4062880)Detected formulas, will run a generic FOF schedule.
% 2.88/1.11 % (4063011)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2602938459:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.88/1.11 % (4063011)Refutation not found, incomplete strategy
% 2.88/1.11 % (4063011)------------------------------
% 2.88/1.11 % (4063011)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.88/1.11 % (4063011)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.88/1.11 % (4063011)CaDiCaL version: 2.1.3
% 2.88/1.11 % (4063011)Termination reason: Refutation not found, incomplete strategy
% 2.88/1.11 % (4063011)Time elapsed: 0.0000 s
% 2.88/1.11 % (4063011)Peak memory usage: 86 MB
% 2.88/1.11 % (4063012)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1643063450:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.88/1.11 % (4063008)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=1610408348:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.88/1.11 % (4063013)dis-21_1_sil=8000:lcm=predicate:random_seed=4073794971: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.88/1.11 % (4063007)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=1547938737:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.88/1.11 % (4063009)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=2642370175:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.88/1.11 % (4063010)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3611202363:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.88/1.11 % (4063010)Refutation not found, incomplete strategy
% 2.88/1.11 % (4063010)------------------------------
% 2.88/1.11 % (4063010)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.88/1.11 % (4063010)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.88/1.11 % (4063010)CaDiCaL version: 2.1.3
% 2.88/1.11 % (4063010)Termination reason: Refutation not found, incomplete strategy
% 2.88/1.11 % (4063010)Time elapsed: 0.001 s
% 2.88/1.11 % (4063010)Peak memory usage: 87 MB
% 2.88/1.11 % (4063012)First to succeed.
% 2.88/1.11 % (4063012)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4062880"
% 2.88/1.11 % (4063013)Instruction limit reached!
% 2.88/1.11 % (4063013)------------------------------
% 2.88/1.11 % (4063013)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.88/1.11 % (4063013)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.88/1.11 % (4063013)CaDiCaL version: 2.1.3
% 2.88/1.11 % (4063013)Termination reason: Instruction limit
% 2.88/1.11 % (4063013)Termination phase: Saturation
% 2.88/1.11 % (4063013)Time elapsed: 0.075 s
% 2.88/1.11 % (4063013)Peak memory usage: 89 MB
% 2.88/1.11 % (4063013)Instructions burned: 130 (million)
% 2.88/1.11 % (4063011)------------------------------
% 2.88/1.11 % (4063011)------------------------------
% 2.88/1.11 % (4063096)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2365850749:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.88/1.11 % (4063096)Refutation not found, incomplete strategy
% 2.88/1.11 % (4063096)------------------------------
% 2.88/1.11 % (4063096)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.88/1.11 % (4063096)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.88/1.11 % (4063096)CaDiCaL version: 2.1.3
% 2.88/1.11 % (4063096)Termination reason: Refutation not found, incomplete strategy
% 2.88/1.11 % (4063096)Time elapsed: 0.0000 s
% 2.88/1.11 % (4063096)Peak memory usage: 87 MB
% 2.88/1.11 % (4063088)lrs+10_1_sil=8000:sp=occurrence:random_seed=580139157:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.88/1.11 % (4063088)Also succeeded, but the first one will report.
% 2.88/1.11 % (4063010)------------------------------
% 2.88/1.11 % (4063010)------------------------------
% 2.88/1.11 % (4063012)Refutation found. Thanks to Tanya!
% 2.88/1.11 % SZS status Theorem for theBenchmark
% 2.88/1.11 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/1.30 % (4063012)------------------------------
% 0.21/1.30 % (4063012)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.21/1.30 % (4063012)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/1.30 % (4063012)CaDiCaL version: 2.1.3
% 0.21/1.30 % (4063012)Termination reason: Refutation
% 0.21/1.30 % (4063012)Time elapsed: 0.004 s
% 0.21/1.30 % (4063012)Peak memory usage: 89 MB
% 0.21/1.30 % (4063012)Instructions burned: 3 (million)
% 0.21/1.30 % (4063012)------------------------------
% 0.21/1.31 % (4063012)------------------------------
% 0.21/1.31 % (4062880)Success in time 0.412 s
% 0.21/1.31 % Vampire exiting
%------------------------------------------------------------------------------