%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL544+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:54 AM UTC 2026
% Result : Theorem 2.94s 1.31s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 24
% Syntax : Number of formulae : 96 ( 34 unt; 12 def)
% Number of atoms : 203 ( 5 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 191 ( 84 ~; 78 |; 2 &)
% ( 17 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 21 ( 19 usr; 19 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn 59 !; 1 ?)
% 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(f5,axiom,
( implies_2
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_2) ).
fof(f9,axiom,
( and_3
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_3) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_modus_ponens) ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_implies_2) ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_3) ).
fof(f50,axiom,
( necessitation
<=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',necessitation) ).
fof(f66,axiom,
( axiom_m4
<=> ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_m4) ).
fof(f75,axiom,
( op_strict_implies
=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f78,axiom,
necessitation,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',km4b_necessitation) ).
fof(f86,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f89,conjecture,
axiom_m4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m4) ).
fof(f90,negated_conjecture,
~ axiom_m4,
inference(negated_conjecture,[status(cth)],[f89]) ).
fof(f91,plain,
~ axiom_m4,
inference(flattening,[],[f90]) ).
fof(f92,plain,
( ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0)))
=> axiom_m4 ),
inference(unused_predicate_definition_removal,[],[f66]) ).
fof(f97,plain,
( necessitation
=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f104,plain,
( and_3
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f108,plain,
( implies_2
=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f112,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(f117,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f112]) ).
fof(f118,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f117]) ).
fof(f122,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(ennf_transformation,[],[f108]) ).
fof(f126,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(ennf_transformation,[],[f104]) ).
fof(f136,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ necessitation ),
inference(ennf_transformation,[],[f97]) ).
fof(f141,plain,
( axiom_m4
| ? [X0] : ~ is_a_theorem(strict_implies(X0,and(X0,X0))) ),
inference(ennf_transformation,[],[f92]) ).
fof(f143,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f75]) ).
fof(f145,plain,
( axiom_m4
| ~ is_a_theorem(strict_implies(sK0,and(sK0,sK0))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f141]) ).
fof(f146,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f118]) ).
fof(f150,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(cnf_transformation,[],[f122]) ).
fof(f154,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(cnf_transformation,[],[f126]) ).
fof(f167,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f170,plain,
implies_2,
inference(cnf_transformation,[],[f38]) ).
fof(f174,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f182,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0)
| ~ necessitation ),
inference(cnf_transformation,[],[f136]) ).
fof(f187,plain,
( axiom_m4
| ~ is_a_theorem(strict_implies(sK0,and(sK0,sK0))) ),
inference(cnf_transformation,[],[f145]) ).
fof(f189,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f143]) ).
fof(f192,plain,
necessitation,
inference(cnf_transformation,[],[f78]) ).
fof(f199,plain,
op_strict_implies,
inference(cnf_transformation,[],[f86]) ).
fof(f202,plain,
~ axiom_m4,
inference(cnf_transformation,[],[f91]) ).
fof(f212,definition,
( spl1_3
<=> op_strict_implies ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f216,definition,
( spl1_4
<=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f217,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f216]) ).
fof(f218,plain,
( ~ spl1_3
| spl1_4 ),
inference(avatar_split_clause,[],[f189,f216,f212]) ).
fof(f228,definition,
( spl1_7
<=> is_a_theorem(strict_implies(sK0,and(sK0,sK0))) ),
introduced(definition,[new_symbols(definition,[spl1_7])],[avatar_definition]) ).
fof(f230,plain,
( ~ is_a_theorem(strict_implies(sK0,and(sK0,sK0)))
| spl1_7 ),
inference(avatar_component_clause,[],[f228]) ).
fof(f232,definition,
( spl1_8
<=> axiom_m4 ),
introduced(definition,[new_symbols(definition,[spl1_8])],[avatar_definition]) ).
fof(f235,plain,
( ~ spl1_7
| spl1_8 ),
inference(avatar_split_clause,[],[f187,f232,f228]) ).
fof(f269,definition,
( spl1_17
<=> necessitation ),
introduced(definition,[new_symbols(definition,[spl1_17])],[avatar_definition]) ).
fof(f273,definition,
( spl1_18
<=> ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl1_18])],[avatar_definition]) ).
fof(f274,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ spl1_18 ),
inference(avatar_component_clause,[],[f273]) ).
fof(f275,plain,
( ~ spl1_17
| spl1_18 ),
inference(avatar_split_clause,[],[f182,f273,f269]) ).
fof(f349,definition,
( spl1_37
<=> and_3 ),
introduced(definition,[new_symbols(definition,[spl1_37])],[avatar_definition]) ).
fof(f353,definition,
( spl1_38
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
introduced(definition,[new_symbols(definition,[spl1_38])],[avatar_definition]) ).
fof(f354,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ spl1_38 ),
inference(avatar_component_clause,[],[f353]) ).
fof(f355,plain,
( ~ spl1_37
| spl1_38 ),
inference(avatar_split_clause,[],[f154,f353,f349]) ).
fof(f381,definition,
( spl1_45
<=> implies_2 ),
introduced(definition,[new_symbols(definition,[spl1_45])],[avatar_definition]) ).
fof(f385,definition,
( spl1_46
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
introduced(definition,[new_symbols(definition,[spl1_46])],[avatar_definition]) ).
fof(f386,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ spl1_46 ),
inference(avatar_component_clause,[],[f385]) ).
fof(f387,plain,
( ~ spl1_45
| spl1_46 ),
inference(avatar_split_clause,[],[f150,f385,f381]) ).
fof(f413,definition,
( spl1_53
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[spl1_53])],[avatar_definition]) ).
fof(f417,definition,
( spl1_54
<=> ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ) ),
introduced(definition,[new_symbols(definition,[spl1_54])],[avatar_definition]) ).
fof(f418,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl1_54 ),
inference(avatar_component_clause,[],[f417]) ).
fof(f419,plain,
( ~ spl1_53
| spl1_54 ),
inference(avatar_split_clause,[],[f146,f417,f413]) ).
fof(f420,plain,
~ spl1_8,
inference(avatar_split_clause,[],[f202,f232]) ).
fof(f432,plain,
spl1_53,
inference(avatar_split_clause,[],[f167,f413]) ).
fof(f441,plain,
spl1_45,
inference(avatar_split_clause,[],[f170,f381]) ).
fof(f453,plain,
spl1_37,
inference(avatar_split_clause,[],[f174,f349]) ).
fof(f477,plain,
spl1_17,
inference(avatar_split_clause,[],[f192,f269]) ).
fof(f492,plain,
spl1_3,
inference(avatar_split_clause,[],[f199,f212]) ).
fof(f501,plain,
( ! [X0,X1] :
( is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl1_4
| ~ spl1_18 ),
inference(superposition,[],[f274,f217]) ).
fof(f505,plain,
( ~ is_a_theorem(implies(sK0,and(sK0,sK0)))
| ~ spl1_4
| spl1_7
| ~ spl1_18 ),
inference(resolution,[],[f501,f230]) ).
fof(f510,plain,
( ! [X0] :
( ~ is_a_theorem(implies(X0,implies(sK0,and(sK0,sK0))))
| ~ is_a_theorem(X0) )
| ~ spl1_4
| spl1_7
| ~ spl1_18
| ~ spl1_54 ),
inference(resolution,[],[f505,f418]) ).
fof(f975,plain,
( ~ is_a_theorem(implies(sK0,implies(sK0,and(sK0,sK0))))
| ~ spl1_4
| spl1_7
| ~ spl1_18
| ~ spl1_46
| ~ spl1_54 ),
inference(resolution,[],[f510,f386]) ).
fof(f986,plain,
( $false
| ~ spl1_4
| spl1_7
| ~ spl1_18
| ~ spl1_38
| ~ spl1_46
| ~ spl1_54 ),
inference(forward_subsumption_resolution,[],[f975,f354]) ).
fof(f987,plain,
( ~ spl1_4
| spl1_7
| ~ spl1_18
| ~ spl1_38
| ~ spl1_46
| ~ spl1_54 ),
inference(avatar_contradiction_clause,[],[f986]) ).
cnf(s2,plain,
( ~ spl1_3
| spl1_4 ),
inference(sat_conversion,[],[f218]) ).
cnf(s4,plain,
( ~ spl1_7
| spl1_8 ),
inference(sat_conversion,[],[f235]) ).
cnf(s9,plain,
( ~ spl1_17
| spl1_18 ),
inference(sat_conversion,[],[f275]) ).
cnf(s19,plain,
( ~ spl1_37
| spl1_38 ),
inference(sat_conversion,[],[f355]) ).
cnf(s23,plain,
( ~ spl1_45
| spl1_46 ),
inference(sat_conversion,[],[f387]) ).
cnf(s27,plain,
( ~ spl1_53
| spl1_54 ),
inference(sat_conversion,[],[f419]) ).
cnf(s28,plain,
~ spl1_8,
inference(sat_conversion,[],[f420]) ).
cnf(s36,plain,
spl1_53,
inference(sat_conversion,[],[f432]) ).
cnf(s42,plain,
spl1_45,
inference(sat_conversion,[],[f441]) ).
cnf(s50,plain,
spl1_37,
inference(sat_conversion,[],[f453]) ).
cnf(s66,plain,
spl1_17,
inference(sat_conversion,[],[f477]) ).
cnf(s76,plain,
spl1_3,
inference(sat_conversion,[],[f492]) ).
cnf(s82,plain,
( ~ spl1_4
| spl1_7
| ~ spl1_18
| ~ spl1_38
| ~ spl1_46
| ~ spl1_54 ),
inference(sat_conversion,[],[f987]) ).
cnf(s83,plain,
spl1_54,
inference(rat,[],[s27,s36]) ).
cnf(s87,plain,
spl1_46,
inference(rat,[],[s23,s42]) ).
cnf(s91,plain,
spl1_38,
inference(rat,[],[s19,s50]) ).
cnf(s101,plain,
spl1_18,
inference(rat,[],[s9,s66]) ).
cnf(s106,plain,
~ spl1_7,
inference(rat,[],[s4,s28]) ).
cnf(s107,plain,
~ spl1_4,
inference(rat,[],[s82,s83,s87,s91,s101,s106]) ).
cnf(s109,plain,
$false,
inference(rat,[],[s2,s107,s76]) ).
fof(f988,plain,
$false,
inference(avatar_sat_refutation,[],[s109]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL544+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n014.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 15:58:31 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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.94/1.31 % (969718)Detected formulas, will run a generic FOF schedule.
% 2.94/1.31 % (969729)dis-21_1_sil=8000:lcm=predicate:random_seed=1992524313: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.94/1.31 % (969729)Refutation not found, incomplete strategy
% 2.94/1.31 % (969729)------------------------------
% 2.94/1.31 % (969729)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.94/1.31 % (969729)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/1.31 % (969729)CaDiCaL version: 2.1.3
% 2.94/1.31 % (969729)Termination reason: Refutation not found, incomplete strategy
% 2.94/1.31 % (969729)Time elapsed: 0.001 s
% 2.94/1.31 % (969729)Peak memory usage: 88 MB
% 2.94/1.31 % (969729)Instructions burned: 1 (million)
% 2.94/1.31 % (969723)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=919388468:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.94/1.31 % (969725)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=3884418475:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.94/1.31 % (969728)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3173799155:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.94/1.31 % (969726)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2541384870:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.94/1.31 % (969724)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=695471325:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.94/1.31 % (969727)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1604420906:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.94/1.31 % (969727)Refutation not found, incomplete strategy
% 2.94/1.31 % (969727)------------------------------
% 2.94/1.31 % (969727)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.94/1.31 % (969727)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/1.31 % (969727)CaDiCaL version: 2.1.3
% 2.94/1.31 % (969726)Refutation not found, incomplete strategy
% 2.94/1.31 % (969726)------------------------------
% 2.94/1.31 % (969726)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.94/1.31 % (969727)Termination reason: Refutation not found, incomplete strategy
% 2.94/1.31 % (969727)Time elapsed: 0.001 s
% 2.94/1.31 % (969727)Peak memory usage: 86 MB
% 2.94/1.31 % (969726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/1.31 % (969726)CaDiCaL version: 2.1.3
% 2.94/1.31 % (969726)Termination reason: Refutation not found, incomplete strategy
% 2.94/1.31 % (969726)Time elapsed: 0.001 s
% 2.94/1.31 % (969726)Peak memory usage: 87 MB
% 2.94/1.31 % (969728)First to succeed.
% 2.94/1.31 % (969728)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-969718"
% 2.94/1.31 % (969729)------------------------------
% 2.94/1.31 % (969729)------------------------------
% 2.94/1.31 % (969727)------------------------------
% 2.94/1.31 % (969727)------------------------------
% 2.94/1.31 % (969726)------------------------------
% 2.94/1.31 % (969726)------------------------------
% 2.94/1.31 % (969737)lrs+10_1_sil=8000:sp=occurrence:random_seed=10982673:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.94/1.31 % (969737)Refutation not found, incomplete strategy
% 2.94/1.31 % (969737)------------------------------
% 2.94/1.31 % (969737)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.94/1.31 % (969737)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/1.31 % (969737)CaDiCaL version: 2.1.3
% 2.94/1.31 % (969737)Termination reason: Refutation not found, incomplete strategy
% 2.94/1.31 % (969737)Time elapsed: 0.0000 s
% 2.94/1.31 % (969737)Peak memory usage: 87 MB
% 2.94/1.31 % (969728)Refutation found. Thanks to Tanya!
% 2.94/1.31 % SZS status Theorem for theBenchmark
% 2.94/1.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/1.50 % (969728)------------------------------
% 0.18/1.50 % (969728)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.18/1.50 % (969728)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/1.50 % (969728)CaDiCaL version: 2.1.3
% 0.18/1.50 % (969728)Termination reason: Refutation
% 0.18/1.50 % (969728)Time elapsed: 0.019 s
% 0.18/1.50 % (969728)Peak memory usage: 90 MB
% 0.18/1.50 % (969728)Instructions burned: 26 (million)
% 0.18/1.50 % (969728)------------------------------
% 0.18/1.50 % (969728)------------------------------
% 0.18/1.50 % (969718)Success in time 0.447 s
% 0.18/1.50 % Vampire exiting
%------------------------------------------------------------------------------