%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL531+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 : n002.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:52 AM UTC 2026
% Result : Theorem 2.87s 1.27s
% Output : Refutation 3.65s
% 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',km5_necessitation) ).
fof(f85,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f88,conjecture,
axiom_m4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m4) ).
fof(f89,negated_conjecture,
~ axiom_m4,
inference(negated_conjecture,[status(cth)],[f88]) ).
fof(f90,plain,
~ axiom_m4,
inference(flattening,[],[f89]) ).
fof(f91,plain,
( ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0)))
=> axiom_m4 ),
inference(unused_predicate_definition_removal,[],[f66]) ).
fof(f95,plain,
( necessitation
=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f102,plain,
( and_3
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f106,plain,
( implies_2
=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f110,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(f115,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f110]) ).
fof(f116,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f115]) ).
fof(f120,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(ennf_transformation,[],[f106]) ).
fof(f124,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(ennf_transformation,[],[f102]) ).
fof(f134,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ necessitation ),
inference(ennf_transformation,[],[f95]) ).
fof(f138,plain,
( axiom_m4
| ? [X0] : ~ is_a_theorem(strict_implies(X0,and(X0,X0))) ),
inference(ennf_transformation,[],[f91]) ).
fof(f140,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f75]) ).
fof(f142,plain,
( axiom_m4
| ~ is_a_theorem(strict_implies(sK0,and(sK0,sK0))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f138]) ).
fof(f143,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f116]) ).
fof(f147,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(cnf_transformation,[],[f120]) ).
fof(f151,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(cnf_transformation,[],[f124]) ).
fof(f164,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f167,plain,
implies_2,
inference(cnf_transformation,[],[f38]) ).
fof(f171,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f179,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0)
| ~ necessitation ),
inference(cnf_transformation,[],[f134]) ).
fof(f183,plain,
( axiom_m4
| ~ is_a_theorem(strict_implies(sK0,and(sK0,sK0))) ),
inference(cnf_transformation,[],[f142]) ).
fof(f185,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f140]) ).
fof(f188,plain,
necessitation,
inference(cnf_transformation,[],[f78]) ).
fof(f194,plain,
op_strict_implies,
inference(cnf_transformation,[],[f85]) ).
fof(f197,plain,
~ axiom_m4,
inference(cnf_transformation,[],[f90]) ).
fof(f207,definition,
( spl1_3
<=> op_strict_implies ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f211,definition,
( spl1_4
<=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f212,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f211]) ).
fof(f213,plain,
( ~ spl1_3
| spl1_4 ),
inference(avatar_split_clause,[],[f185,f211,f207]) ).
fof(f223,definition,
( spl1_7
<=> is_a_theorem(strict_implies(sK0,and(sK0,sK0))) ),
introduced(definition,[new_symbols(definition,[spl1_7])],[avatar_definition]) ).
fof(f225,plain,
( ~ is_a_theorem(strict_implies(sK0,and(sK0,sK0)))
| spl1_7 ),
inference(avatar_component_clause,[],[f223]) ).
fof(f227,definition,
( spl1_8
<=> axiom_m4 ),
introduced(definition,[new_symbols(definition,[spl1_8])],[avatar_definition]) ).
fof(f230,plain,
( ~ spl1_7
| spl1_8 ),
inference(avatar_split_clause,[],[f183,f227,f223]) ).
fof(f256,definition,
( spl1_15
<=> necessitation ),
introduced(definition,[new_symbols(definition,[spl1_15])],[avatar_definition]) ).
fof(f260,definition,
( spl1_16
<=> ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl1_16])],[avatar_definition]) ).
fof(f261,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ spl1_16 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f262,plain,
( ~ spl1_15
| spl1_16 ),
inference(avatar_split_clause,[],[f179,f260,f256]) ).
fof(f336,definition,
( spl1_35
<=> and_3 ),
introduced(definition,[new_symbols(definition,[spl1_35])],[avatar_definition]) ).
fof(f340,definition,
( spl1_36
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
introduced(definition,[new_symbols(definition,[spl1_36])],[avatar_definition]) ).
fof(f341,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ spl1_36 ),
inference(avatar_component_clause,[],[f340]) ).
fof(f342,plain,
( ~ spl1_35
| spl1_36 ),
inference(avatar_split_clause,[],[f151,f340,f336]) ).
fof(f368,definition,
( spl1_43
<=> implies_2 ),
introduced(definition,[new_symbols(definition,[spl1_43])],[avatar_definition]) ).
fof(f372,definition,
( spl1_44
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
introduced(definition,[new_symbols(definition,[spl1_44])],[avatar_definition]) ).
fof(f373,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ spl1_44 ),
inference(avatar_component_clause,[],[f372]) ).
fof(f374,plain,
( ~ spl1_43
| spl1_44 ),
inference(avatar_split_clause,[],[f147,f372,f368]) ).
fof(f400,definition,
( spl1_51
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[spl1_51])],[avatar_definition]) ).
fof(f404,definition,
( spl1_52
<=> ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ) ),
introduced(definition,[new_symbols(definition,[spl1_52])],[avatar_definition]) ).
fof(f405,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl1_52 ),
inference(avatar_component_clause,[],[f404]) ).
fof(f406,plain,
( ~ spl1_51
| spl1_52 ),
inference(avatar_split_clause,[],[f143,f404,f400]) ).
fof(f407,plain,
~ spl1_8,
inference(avatar_split_clause,[],[f197,f227]) ).
fof(f421,plain,
spl1_51,
inference(avatar_split_clause,[],[f164,f400]) ).
fof(f430,plain,
spl1_43,
inference(avatar_split_clause,[],[f167,f368]) ).
fof(f442,plain,
spl1_35,
inference(avatar_split_clause,[],[f171,f336]) ).
fof(f466,plain,
spl1_15,
inference(avatar_split_clause,[],[f188,f256]) ).
fof(f478,plain,
spl1_3,
inference(avatar_split_clause,[],[f194,f207]) ).
fof(f485,plain,
( ! [X0,X1] :
( is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl1_4
| ~ spl1_16 ),
inference(superposition,[],[f261,f212]) ).
fof(f503,plain,
( ~ is_a_theorem(implies(sK0,and(sK0,sK0)))
| ~ spl1_4
| spl1_7
| ~ spl1_16 ),
inference(resolution,[],[f485,f225]) ).
fof(f504,plain,
( ! [X0] :
( ~ is_a_theorem(implies(X0,implies(sK0,and(sK0,sK0))))
| ~ is_a_theorem(X0) )
| ~ spl1_4
| spl1_7
| ~ spl1_16
| ~ spl1_52 ),
inference(resolution,[],[f503,f405]) ).
fof(f1025,plain,
( ~ is_a_theorem(implies(sK0,implies(sK0,and(sK0,sK0))))
| ~ spl1_4
| spl1_7
| ~ spl1_16
| ~ spl1_44
| ~ spl1_52 ),
inference(resolution,[],[f504,f373]) ).
fof(f1038,plain,
( $false
| ~ spl1_4
| spl1_7
| ~ spl1_16
| ~ spl1_36
| ~ spl1_44
| ~ spl1_52 ),
inference(forward_subsumption_resolution,[],[f1025,f341]) ).
fof(f1039,plain,
( ~ spl1_4
| spl1_7
| ~ spl1_16
| ~ spl1_36
| ~ spl1_44
| ~ spl1_52 ),
inference(avatar_contradiction_clause,[],[f1038]) ).
cnf(s2,plain,
( ~ spl1_3
| spl1_4 ),
inference(sat_conversion,[],[f213]) ).
cnf(s4,plain,
( ~ spl1_7
| spl1_8 ),
inference(sat_conversion,[],[f230]) ).
cnf(s8,plain,
( ~ spl1_15
| spl1_16 ),
inference(sat_conversion,[],[f262]) ).
cnf(s18,plain,
( ~ spl1_35
| spl1_36 ),
inference(sat_conversion,[],[f342]) ).
cnf(s22,plain,
( ~ spl1_43
| spl1_44 ),
inference(sat_conversion,[],[f374]) ).
cnf(s26,plain,
( ~ spl1_51
| spl1_52 ),
inference(sat_conversion,[],[f406]) ).
cnf(s27,plain,
~ spl1_8,
inference(sat_conversion,[],[f407]) ).
cnf(s35,plain,
spl1_51,
inference(sat_conversion,[],[f421]) ).
cnf(s41,plain,
spl1_43,
inference(sat_conversion,[],[f430]) ).
cnf(s49,plain,
spl1_35,
inference(sat_conversion,[],[f442]) ).
cnf(s65,plain,
spl1_15,
inference(sat_conversion,[],[f466]) ).
cnf(s73,plain,
spl1_3,
inference(sat_conversion,[],[f478]) ).
cnf(s79,plain,
( ~ spl1_4
| spl1_7
| ~ spl1_16
| ~ spl1_36
| ~ spl1_44
| ~ spl1_52 ),
inference(sat_conversion,[],[f1039]) ).
cnf(s80,plain,
spl1_52,
inference(rat,[],[s26,s35]) ).
cnf(s84,plain,
spl1_44,
inference(rat,[],[s22,s41]) ).
cnf(s88,plain,
spl1_36,
inference(rat,[],[s18,s49]) ).
cnf(s98,plain,
spl1_16,
inference(rat,[],[s8,s65]) ).
cnf(s102,plain,
~ spl1_7,
inference(rat,[],[s4,s27]) ).
cnf(s103,plain,
~ spl1_4,
inference(rat,[],[s79,s80,s84,s88,s98,s102]) ).
cnf(s105,plain,
$false,
inference(rat,[],[s2,s103,s73]) ).
fof(f1040,plain,
$false,
inference(avatar_sat_refutation,[],[s105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL531+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.10/0.37 % Computer : n002.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 15:59:07 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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.87/1.27 % (3706906)Detected formulas, will run a generic FOF schedule.
% 2.87/1.27 % (3706961)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=252757696:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.87/1.27 % (3706961)Refutation not found, incomplete strategy
% 2.87/1.27 % (3706961)------------------------------
% 2.87/1.27 % (3706961)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.27 % (3706961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.27 % (3706961)CaDiCaL version: 2.1.3
% 2.87/1.27 % (3706961)Termination reason: Refutation not found, incomplete strategy
% 2.87/1.27 % (3706961)Time elapsed: 0.0000 s
% 2.87/1.27 % (3706961)Peak memory usage: 87 MB
% 2.87/1.27 % (3706962)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=56180173:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.87/1.27 % (3706959)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=2203900509:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.87/1.27 % (3706958)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=1266016354:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.87/1.27 % (3706960)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=311138868:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.87/1.27 % (3706962)Refutation not found, incomplete strategy
% 2.87/1.27 % (3706962)------------------------------
% 2.87/1.27 % (3706962)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.27 % (3706962)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.27 % (3706962)CaDiCaL version: 2.1.3
% 2.87/1.27 % (3706962)Termination reason: Refutation not found, incomplete strategy
% 2.87/1.27 % (3706962)Time elapsed: 0.001 s
% 2.87/1.27 % (3706962)Peak memory usage: 87 MB
% 2.87/1.27 % (3706964)dis-21_1_sil=8000:lcm=predicate:random_seed=1169855870: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.87/1.27 % (3706963)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3482015071:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.87/1.27 % (3706964)Refutation not found, incomplete strategy
% 2.87/1.27 % (3706964)------------------------------
% 2.87/1.27 % (3706964)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.27 % (3706964)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.27 % (3706964)CaDiCaL version: 2.1.3
% 2.87/1.27 % (3706964)Termination reason: Refutation not found, incomplete strategy
% 2.87/1.27 % (3706964)Time elapsed: 0.002 s
% 2.87/1.27 % (3706964)Peak memory usage: 88 MB
% 2.87/1.27 % (3706964)Instructions burned: 1 (million)
% 2.87/1.27 % (3706963)First to succeed.
% 2.87/1.27 % (3706963)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3706906"
% 2.87/1.27 % (3706961)------------------------------
% 2.87/1.27 % (3706961)------------------------------
% 2.87/1.27 % (3706972)lrs+10_1_sil=8000:sp=occurrence:random_seed=241050158:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.87/1.27 % (3706972)Refutation not found, incomplete strategy
% 2.87/1.27 % (3706972)------------------------------
% 2.87/1.27 % (3706972)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.27 % (3706972)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.27 % (3706972)CaDiCaL version: 2.1.3
% 2.87/1.27 % (3706972)Termination reason: Refutation not found, incomplete strategy
% 2.87/1.27 % (3706972)Time elapsed: 0.0000 s
% 2.87/1.27 % (3706972)Peak memory usage: 87 MB
% 2.87/1.27 % (3706962)------------------------------
% 2.87/1.27 % (3706962)------------------------------
% 2.87/1.27 % (3706964)------------------------------
% 2.87/1.27 % (3706964)------------------------------
% 2.87/1.27 % (3706963)Refutation found. Thanks to Tanya!
% 2.87/1.27 % SZS status Theorem for theBenchmark
% 2.87/1.27 % SZS output start Proof for theBenchmark
% See solution above
% 3.65/1.46 % (3706963)------------------------------
% 3.65/1.46 % (3706963)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.65/1.46 % (3706963)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.65/1.46 % (3706963)CaDiCaL version: 2.1.3
% 3.65/1.46 % (3706963)Termination reason: Refutation
% 3.65/1.46 % (3706963)Time elapsed: 0.021 s
% 3.65/1.46 % (3706963)Peak memory usage: 90 MB
% 3.65/1.46 % (3706963)Instructions burned: 29 (million)
% 3.65/1.46 % (3706963)------------------------------
% 3.65/1.46 % (3706963)------------------------------
% 3.65/1.46 % (3706906)Success in time 0.43 s
% 3.65/1.46 % Vampire exiting
%------------------------------------------------------------------------------