%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL496+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 11:52:37 AM UTC 2026
% Result : Theorem 2.84s 1.28s
% Output : Refutation 3.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 20
% Syntax : Number of formulae : 86 ( 29 unt; 10 def)
% Number of atoms : 178 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 167 ( 75 ~; 69 |; 2 &)
% ( 14 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 18 ( 16 usr; 16 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 88 ( 0 sgn 85 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_ponens) ).
fof(f19,axiom,
( cn1
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn1) ).
fof(f25,axiom,
( r4
<=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r4) ).
fof(f26,axiom,
( r5
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r5) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_or) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_modus_ponens) ).
fof(f39,axiom,
r4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r4) ).
fof(f40,axiom,
r5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r5) ).
fof(f45,conjecture,
cn1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn1) ).
fof(f46,negated_conjecture,
~ cn1,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ cn1,
inference(flattening,[],[f46]) ).
fof(f48,plain,
( r5
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f26]) ).
fof(f49,plain,
( r4
=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f25]) ).
fof(f53,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
=> cn1 ),
inference(unused_predicate_definition_removal,[],[f19]) ).
fof(f55,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f58,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f55]) ).
fof(f59,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f58]) ).
fof(f61,plain,
( cn1
| ? [X0,X1,X2] : ~ is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(ennf_transformation,[],[f53]) ).
fof(f65,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(ennf_transformation,[],[f49]) ).
fof(f66,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(ennf_transformation,[],[f48]) ).
fof(f69,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f71,plain,
( cn1
| ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f61]) ).
fof(f72,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f59]) ).
fof(f74,plain,
( cn1
| ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))) ),
inference(cnf_transformation,[],[f71]) ).
fof(f78,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(cnf_transformation,[],[f65]) ).
fof(f79,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(cnf_transformation,[],[f66]) ).
fof(f82,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f69]) ).
fof(f84,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f87,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f91,plain,
r4,
inference(cnf_transformation,[],[f39]) ).
fof(f92,plain,
r5,
inference(cnf_transformation,[],[f40]) ).
fof(f96,plain,
~ cn1,
inference(cnf_transformation,[],[f47]) ).
fof(f106,definition,
( spl3_3
<=> op_implies_or ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
fof(f110,definition,
( spl3_4
<=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).
fof(f111,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f112,plain,
( ~ spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f82,f110,f106]) ).
fof(f130,definition,
( spl3_9
<=> r5 ),
introduced(definition,[new_symbols(definition,[spl3_9])],[avatar_definition]) ).
fof(f134,definition,
( spl3_10
<=> ! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
introduced(definition,[new_symbols(definition,[spl3_10])],[avatar_definition]) ).
fof(f135,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ spl3_10 ),
inference(avatar_component_clause,[],[f134]) ).
fof(f136,plain,
( ~ spl3_9
| spl3_10 ),
inference(avatar_split_clause,[],[f79,f134,f130]) ).
fof(f138,definition,
( spl3_11
<=> r4 ),
introduced(definition,[new_symbols(definition,[spl3_11])],[avatar_definition]) ).
fof(f142,definition,
( spl3_12
<=> ! [X2,X0,X1] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
introduced(definition,[new_symbols(definition,[spl3_12])],[avatar_definition]) ).
fof(f143,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ spl3_12 ),
inference(avatar_component_clause,[],[f142]) ).
fof(f144,plain,
( ~ spl3_11
| spl3_12 ),
inference(avatar_split_clause,[],[f78,f142,f138]) ).
fof(f170,definition,
( spl3_19
<=> is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))) ),
introduced(definition,[new_symbols(definition,[spl3_19])],[avatar_definition]) ).
fof(f172,plain,
( ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2))))
| spl3_19 ),
inference(avatar_component_clause,[],[f170]) ).
fof(f174,definition,
( spl3_20
<=> cn1 ),
introduced(definition,[new_symbols(definition,[spl3_20])],[avatar_definition]) ).
fof(f177,plain,
( ~ spl3_19
| spl3_20 ),
inference(avatar_split_clause,[],[f74,f174,f170]) ).
fof(f187,definition,
( spl3_23
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[spl3_23])],[avatar_definition]) ).
fof(f191,definition,
( spl3_24
<=> ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ) ),
introduced(definition,[new_symbols(definition,[spl3_24])],[avatar_definition]) ).
fof(f192,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl3_24 ),
inference(avatar_component_clause,[],[f191]) ).
fof(f193,plain,
( ~ spl3_23
| spl3_24 ),
inference(avatar_split_clause,[],[f72,f191,f187]) ).
fof(f194,plain,
~ spl3_20,
inference(avatar_split_clause,[],[f96,f174]) ).
fof(f197,plain,
spl3_3,
inference(avatar_split_clause,[],[f84,f106]) ).
fof(f203,plain,
spl3_23,
inference(avatar_split_clause,[],[f87,f187]) ).
fof(f215,plain,
spl3_11,
inference(avatar_split_clause,[],[f91,f138]) ).
fof(f218,plain,
spl3_9,
inference(avatar_split_clause,[],[f92,f130]) ).
fof(f232,plain,
( ! [X0] :
( ~ is_a_theorem(implies(X0,implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))))
| ~ is_a_theorem(X0) )
| spl3_19
| ~ spl3_24 ),
inference(resolution,[],[f192,f172]) ).
fof(f235,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X2,X1),implies(or(not(X0),X2),implies(X0,X1))))
| ~ spl3_4
| ~ spl3_10 ),
inference(superposition,[],[f135,f111]) ).
fof(f236,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X2,X1),implies(implies(X0,X2),implies(X0,X1))))
| ~ spl3_4
| ~ spl3_10 ),
inference(forward_demodulation,[],[f235,f111]) ).
fof(f241,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(or(X1,or(not(X0),X2)),implies(X0,or(X1,X2))))
| ~ spl3_4
| ~ spl3_12 ),
inference(superposition,[],[f143,f111]) ).
fof(f242,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(or(X1,implies(X0,X2)),implies(X0,or(X1,X2))))
| ~ spl3_4
| ~ spl3_12 ),
inference(forward_demodulation,[],[f241,f111]) ).
fof(f271,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(or(not(X0),implies(X2,X1)),implies(X2,implies(X0,X1))))
| ~ spl3_4
| ~ spl3_12 ),
inference(superposition,[],[f242,f111]) ).
fof(f272,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X2,X1)),implies(X2,implies(X0,X1))))
| ~ spl3_4
| ~ spl3_12 ),
inference(forward_demodulation,[],[f271,f111]) ).
fof(f328,plain,
( ~ is_a_theorem(implies(implies(sK1,sK2),implies(implies(sK0,sK1),implies(sK0,sK2))))
| ~ spl3_4
| ~ spl3_12
| spl3_19
| ~ spl3_24 ),
inference(resolution,[],[f272,f232]) ).
fof(f337,plain,
( $false
| ~ spl3_4
| ~ spl3_10
| ~ spl3_12
| spl3_19
| ~ spl3_24 ),
inference(forward_subsumption_resolution,[],[f328,f236]) ).
fof(f338,plain,
( ~ spl3_4
| ~ spl3_10
| ~ spl3_12
| spl3_19
| ~ spl3_24 ),
inference(avatar_contradiction_clause,[],[f337]) ).
cnf(s2,plain,
( ~ spl3_3
| spl3_4 ),
inference(sat_conversion,[],[f112]) ).
cnf(s5,plain,
( ~ spl3_9
| spl3_10 ),
inference(sat_conversion,[],[f136]) ).
cnf(s6,plain,
( ~ spl3_11
| spl3_12 ),
inference(sat_conversion,[],[f144]) ).
cnf(s10,plain,
( ~ spl3_19
| spl3_20 ),
inference(sat_conversion,[],[f177]) ).
cnf(s12,plain,
( ~ spl3_23
| spl3_24 ),
inference(sat_conversion,[],[f193]) ).
cnf(s13,plain,
~ spl3_20,
inference(sat_conversion,[],[f194]) ).
cnf(s15,plain,
spl3_3,
inference(sat_conversion,[],[f197]) ).
cnf(s19,plain,
spl3_23,
inference(sat_conversion,[],[f203]) ).
cnf(s27,plain,
spl3_11,
inference(sat_conversion,[],[f215]) ).
cnf(s29,plain,
spl3_9,
inference(sat_conversion,[],[f218]) ).
cnf(s36,plain,
( ~ spl3_4
| ~ spl3_10
| ~ spl3_12
| spl3_19
| ~ spl3_24 ),
inference(sat_conversion,[],[f338]) ).
cnf(s37,plain,
spl3_24,
inference(rat,[],[s12,s19]) ).
cnf(s39,plain,
~ spl3_19,
inference(rat,[],[s10,s13]) ).
cnf(s43,plain,
spl3_12,
inference(rat,[],[s6,s27]) ).
cnf(s44,plain,
spl3_10,
inference(rat,[],[s5,s29]) ).
cnf(s45,plain,
~ spl3_4,
inference(rat,[],[s36,s37,s39,s43,s44]) ).
cnf(s48,plain,
$false,
inference(rat,[],[s2,s45,s15]) ).
fof(f339,plain,
$false,
inference(avatar_sat_refutation,[],[s48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL496+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n014.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 15:51:16 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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.84/1.28 % (966166)Detected formulas, will run a generic FOF schedule.
% 2.84/1.28 % (966177)dis-21_1_sil=8000:lcm=predicate:random_seed=2532830605: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.84/1.28 % (966177)Refutation not found, incomplete strategy
% 2.84/1.28 % (966177)------------------------------
% 2.84/1.28 % (966177)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.84/1.28 % (966177)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/1.28 % (966177)CaDiCaL version: 2.1.3
% 2.84/1.28 % (966177)Termination reason: Refutation not found, incomplete strategy
% 2.84/1.28 % (966177)Time elapsed: 0.001 s
% 2.84/1.28 % (966177)Peak memory usage: 88 MB
% 2.84/1.28 % (966172)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=2045942461:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.84/1.28 % (966176)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4163770693:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.84/1.28 % (966174)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=899073385:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.84/1.28 % (966175)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1620992496:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.84/1.28 % (966171)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=257973787:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.84/1.28 % (966173)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=273684377:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.84/1.28 % (966175)Refutation not found, incomplete strategy
% 2.84/1.28 % (966175)------------------------------
% 2.84/1.28 % (966175)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.84/1.28 % (966175)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/1.28 % (966174)Refutation not found, incomplete strategy
% 2.84/1.28 % (966174)------------------------------
% 2.84/1.28 % (966174)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.84/1.28 % (966175)CaDiCaL version: 2.1.3
% 2.84/1.28 % (966175)Termination reason: Refutation not found, incomplete strategy
% 2.84/1.28 % (966175)Time elapsed: 0.001 s
% 2.84/1.28 % (966174)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/1.28 % (966175)Peak memory usage: 86 MB
% 2.84/1.28 % (966174)CaDiCaL version: 2.1.3
% 2.84/1.28 % (966174)Termination reason: Refutation not found, incomplete strategy
% 2.84/1.28 % (966174)Time elapsed: 0.001 s
% 2.84/1.28 % (966174)Peak memory usage: 86 MB
% 2.84/1.28 % (966176)First to succeed.
% 2.84/1.28 % (966176)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-966166"
% 2.84/1.28 % (966177)------------------------------
% 2.84/1.28 % (966177)------------------------------
% 2.84/1.28 % (966185)lrs+10_1_sil=8000:sp=occurrence:random_seed=3690710873:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.84/1.28 % (966185)Refutation not found, incomplete strategy
% 2.84/1.28 % (966185)------------------------------
% 2.84/1.28 % (966185)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.84/1.28 % (966185)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/1.28 % (966185)CaDiCaL version: 2.1.3
% 2.84/1.28 % (966185)Termination reason: Refutation not found, incomplete strategy
% 2.84/1.28 % (966185)Time elapsed: 0.0000 s
% 2.84/1.28 % (966185)Peak memory usage: 87 MB
% 2.84/1.28 % (966175)------------------------------
% 2.84/1.28 % (966175)------------------------------
% 2.84/1.28 % (966174)------------------------------
% 2.84/1.28 % (966174)------------------------------
% 2.84/1.28 % (966176)Refutation found. Thanks to Tanya!
% 2.84/1.28 % SZS status Theorem for theBenchmark
% 2.84/1.28 % SZS output start Proof for theBenchmark
% See solution above
% 3.65/1.48 % (966176)------------------------------
% 3.65/1.48 % (966176)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.65/1.48 % (966176)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.65/1.48 % (966176)CaDiCaL version: 2.1.3
% 3.65/1.48 % (966176)Termination reason: Refutation
% 3.65/1.48 % (966176)Time elapsed: 0.008 s
% 3.65/1.48 % (966176)Peak memory usage: 89 MB
% 3.65/1.48 % (966176)Instructions burned: 9 (million)
% 3.65/1.48 % (966176)------------------------------
% 3.65/1.48 % (966176)------------------------------
% 3.65/1.48 % (966166)Success in time 0.433 s
% 3.65/1.48 % Vampire exiting
%------------------------------------------------------------------------------