%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL453+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:29 AM UTC 2026
% Result : Theorem 3.43s 1.33s
% Output : Refutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 28
% Syntax : Number of formulae : 113 ( 39 unt; 14 def)
% Number of atoms : 248 ( 11 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 246 ( 111 ~; 105 |; 2 &)
% ( 19 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 24 ( 22 usr; 22 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn 85 !; 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/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
fof(f4,axiom,
( implies_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_1) ).
fof(f5,axiom,
( implies_2
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_2) ).
fof(f12,axiom,
( or_3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X2),implies(implies(X1,X2),implies(or(X0,X1),X2)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',or_3) ).
fof(f21,axiom,
( cn3
<=> ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn3) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_or) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_and) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_modus_ponens) ).
fof(f37,axiom,
implies_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_1) ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_2) ).
fof(f45,axiom,
or_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_or_3) ).
fof(f53,conjecture,
cn3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn3) ).
fof(f54,negated_conjecture,
~ cn3,
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f55,plain,
~ cn3,
inference(flattening,[],[f54]) ).
fof(f56,plain,
( ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0))
=> cn3 ),
inference(unused_predicate_definition_removal,[],[f21]) ).
fof(f60,plain,
( or_3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X2),implies(implies(X1,X2),implies(or(X0,X1),X2)))) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f67,plain,
( implies_2
=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f68,plain,
( implies_1
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f71,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(f75,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f71]) ).
fof(f76,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f75]) ).
fof(f79,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(ennf_transformation,[],[f68]) ).
fof(f80,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(ennf_transformation,[],[f67]) ).
fof(f87,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X2),implies(implies(X1,X2),implies(or(X0,X1),X2))))
| ~ or_3 ),
inference(ennf_transformation,[],[f60]) ).
fof(f91,plain,
( cn3
| ? [X0] : ~ is_a_theorem(implies(implies(not(X0),X0),X0)) ),
inference(ennf_transformation,[],[f56]) ).
fof(f92,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f93,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f95,plain,
( cn3
| ~ is_a_theorem(implies(implies(not(sK0),sK0),sK0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f91]) ).
fof(f96,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f76]) ).
fof(f99,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(cnf_transformation,[],[f79]) ).
fof(f100,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(cnf_transformation,[],[f80]) ).
fof(f107,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X2),implies(implies(X1,X2),implies(or(X0,X1),X2))))
| ~ or_3 ),
inference(cnf_transformation,[],[f87]) ).
fof(f111,plain,
( cn3
| ~ is_a_theorem(implies(implies(not(sK0),sK0),sK0)) ),
inference(cnf_transformation,[],[f95]) ).
fof(f112,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f92]) ).
fof(f113,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f93]) ).
fof(f115,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f116,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f118,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f120,plain,
implies_1,
inference(cnf_transformation,[],[f37]) ).
fof(f121,plain,
implies_2,
inference(cnf_transformation,[],[f38]) ).
fof(f128,plain,
or_3,
inference(cnf_transformation,[],[f45]) ).
fof(f135,plain,
~ cn3,
inference(cnf_transformation,[],[f55]) ).
fof(f145,definition,
( spl1_3
<=> op_implies_and ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f149,definition,
( spl1_4
<=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f150,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f149]) ).
fof(f151,plain,
( ~ spl1_3
| spl1_4 ),
inference(avatar_split_clause,[],[f113,f149,f145]) ).
fof(f153,definition,
( spl1_5
<=> op_or ),
introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition]) ).
fof(f157,definition,
( spl1_6
<=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
introduced(definition,[new_symbols(definition,[spl1_6])],[avatar_definition]) ).
fof(f158,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ spl1_6 ),
inference(avatar_component_clause,[],[f157]) ).
fof(f159,plain,
( ~ spl1_5
| spl1_6 ),
inference(avatar_split_clause,[],[f112,f157,f153]) ).
fof(f161,definition,
( spl1_7
<=> is_a_theorem(implies(implies(not(sK0),sK0),sK0)) ),
introduced(definition,[new_symbols(definition,[spl1_7])],[avatar_definition]) ).
fof(f163,plain,
( ~ is_a_theorem(implies(implies(not(sK0),sK0),sK0))
| spl1_7 ),
inference(avatar_component_clause,[],[f161]) ).
fof(f165,definition,
( spl1_8
<=> cn3 ),
introduced(definition,[new_symbols(definition,[spl1_8])],[avatar_definition]) ).
fof(f168,plain,
( ~ spl1_7
| spl1_8 ),
inference(avatar_split_clause,[],[f111,f165,f161]) ).
fof(f194,definition,
( spl1_15
<=> or_3 ),
introduced(definition,[new_symbols(definition,[spl1_15])],[avatar_definition]) ).
fof(f198,definition,
( spl1_16
<=> ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X2),implies(implies(X1,X2),implies(or(X0,X1),X2)))) ),
introduced(definition,[new_symbols(definition,[spl1_16])],[avatar_definition]) ).
fof(f199,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X2),implies(implies(X1,X2),implies(or(X0,X1),X2))))
| ~ spl1_16 ),
inference(avatar_component_clause,[],[f198]) ).
fof(f200,plain,
( ~ spl1_15
| spl1_16 ),
inference(avatar_split_clause,[],[f107,f198,f194]) ).
fof(f250,definition,
( spl1_29
<=> implies_2 ),
introduced(definition,[new_symbols(definition,[spl1_29])],[avatar_definition]) ).
fof(f254,definition,
( spl1_30
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
introduced(definition,[new_symbols(definition,[spl1_30])],[avatar_definition]) ).
fof(f255,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ spl1_30 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f256,plain,
( ~ spl1_29
| spl1_30 ),
inference(avatar_split_clause,[],[f100,f254,f250]) ).
fof(f258,definition,
( spl1_31
<=> implies_1 ),
introduced(definition,[new_symbols(definition,[spl1_31])],[avatar_definition]) ).
fof(f262,definition,
( spl1_32
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
introduced(definition,[new_symbols(definition,[spl1_32])],[avatar_definition]) ).
fof(f263,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0)))
| ~ spl1_32 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f264,plain,
( ~ spl1_31
| spl1_32 ),
inference(avatar_split_clause,[],[f99,f262,f258]) ).
fof(f282,definition,
( spl1_37
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[spl1_37])],[avatar_definition]) ).
fof(f286,definition,
( spl1_38
<=> ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ) ),
introduced(definition,[new_symbols(definition,[spl1_38])],[avatar_definition]) ).
fof(f287,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl1_38 ),
inference(avatar_component_clause,[],[f286]) ).
fof(f288,plain,
( ~ spl1_37
| spl1_38 ),
inference(avatar_split_clause,[],[f96,f286,f282]) ).
fof(f289,plain,
~ spl1_8,
inference(avatar_split_clause,[],[f135,f165]) ).
fof(f292,plain,
spl1_5,
inference(avatar_split_clause,[],[f115,f153]) ).
fof(f297,plain,
spl1_3,
inference(avatar_split_clause,[],[f116,f145]) ).
fof(f303,plain,
spl1_37,
inference(avatar_split_clause,[],[f118,f282]) ).
fof(f309,plain,
spl1_31,
inference(avatar_split_clause,[],[f120,f258]) ).
fof(f312,plain,
spl1_29,
inference(avatar_split_clause,[],[f121,f250]) ).
fof(f333,plain,
spl1_15,
inference(avatar_split_clause,[],[f128,f194]) ).
fof(f346,plain,
( ! [X0] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,implies(implies(not(sK0),sK0),sK0))) )
| spl1_7
| ~ spl1_38 ),
inference(resolution,[],[f287,f163]) ).
fof(f350,plain,
( ! [X0,X1] : or(X0,X1) = implies(not(X0),X1)
| ~ spl1_4
| ~ spl1_6 ),
inference(superposition,[],[f150,f158]) ).
fof(f397,plain,
( ! [X0] :
( ~ is_a_theorem(implies(X0,implies(or(sK0,sK0),sK0)))
| ~ is_a_theorem(X0) )
| ~ spl1_4
| ~ spl1_6
| spl1_7
| ~ spl1_38 ),
inference(forward_demodulation,[],[f346,f350]) ).
fof(f407,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X1,implies(X0,implies(or(sK0,sK0),sK0))))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) )
| ~ spl1_4
| ~ spl1_6
| spl1_7
| ~ spl1_38 ),
inference(resolution,[],[f397,f287]) ).
fof(f901,plain,
( ~ is_a_theorem(implies(sK0,sK0))
| ~ is_a_theorem(implies(sK0,sK0))
| ~ spl1_4
| ~ spl1_6
| spl1_7
| ~ spl1_16
| ~ spl1_38 ),
inference(resolution,[],[f407,f199]) ).
fof(f911,plain,
( ~ is_a_theorem(implies(sK0,sK0))
| ~ spl1_4
| ~ spl1_6
| spl1_7
| ~ spl1_16
| ~ spl1_38 ),
inference(duplicate_literal_removal,[],[f901]) ).
fof(f912,plain,
( ! [X0] :
( ~ is_a_theorem(implies(X0,implies(sK0,sK0)))
| ~ is_a_theorem(X0) )
| ~ spl1_4
| ~ spl1_6
| spl1_7
| ~ spl1_16
| ~ spl1_38 ),
inference(resolution,[],[f911,f287]) ).
fof(f947,plain,
( ~ is_a_theorem(implies(sK0,implies(sK0,sK0)))
| ~ spl1_4
| ~ spl1_6
| spl1_7
| ~ spl1_16
| ~ spl1_30
| ~ spl1_38 ),
inference(resolution,[],[f912,f255]) ).
fof(f955,plain,
( $false
| ~ spl1_4
| ~ spl1_6
| spl1_7
| ~ spl1_16
| ~ spl1_30
| ~ spl1_32
| ~ spl1_38 ),
inference(forward_subsumption_resolution,[],[f947,f263]) ).
fof(f956,plain,
( ~ spl1_4
| ~ spl1_6
| spl1_7
| ~ spl1_16
| ~ spl1_30
| ~ spl1_32
| ~ spl1_38 ),
inference(avatar_contradiction_clause,[],[f955]) ).
cnf(s2,plain,
( ~ spl1_3
| spl1_4 ),
inference(sat_conversion,[],[f151]) ).
cnf(s3,plain,
( ~ spl1_5
| spl1_6 ),
inference(sat_conversion,[],[f159]) ).
cnf(s4,plain,
( ~ spl1_7
| spl1_8 ),
inference(sat_conversion,[],[f168]) ).
cnf(s8,plain,
( ~ spl1_15
| spl1_16 ),
inference(sat_conversion,[],[f200]) ).
cnf(s15,plain,
( ~ spl1_29
| spl1_30 ),
inference(sat_conversion,[],[f256]) ).
cnf(s16,plain,
( ~ spl1_31
| spl1_32 ),
inference(sat_conversion,[],[f264]) ).
cnf(s19,plain,
( ~ spl1_37
| spl1_38 ),
inference(sat_conversion,[],[f288]) ).
cnf(s20,plain,
~ spl1_8,
inference(sat_conversion,[],[f289]) ).
cnf(s22,plain,
spl1_5,
inference(sat_conversion,[],[f292]) ).
cnf(s24,plain,
spl1_3,
inference(sat_conversion,[],[f297]) ).
cnf(s28,plain,
spl1_37,
inference(sat_conversion,[],[f303]) ).
cnf(s32,plain,
spl1_31,
inference(sat_conversion,[],[f309]) ).
cnf(s34,plain,
spl1_29,
inference(sat_conversion,[],[f312]) ).
cnf(s48,plain,
spl1_15,
inference(sat_conversion,[],[f333]) ).
cnf(s58,plain,
( ~ spl1_4
| ~ spl1_6
| spl1_7
| ~ spl1_16
| ~ spl1_30
| ~ spl1_32
| ~ spl1_38 ),
inference(sat_conversion,[],[f956]) ).
cnf(s59,plain,
spl1_38,
inference(rat,[],[s19,s28]) ).
cnf(s62,plain,
spl1_32,
inference(rat,[],[s16,s32]) ).
cnf(s63,plain,
spl1_30,
inference(rat,[],[s15,s34]) ).
cnf(s70,plain,
spl1_16,
inference(rat,[],[s8,s48]) ).
cnf(s74,plain,
~ spl1_7,
inference(rat,[],[s4,s20]) ).
cnf(s75,plain,
spl1_6,
inference(rat,[],[s3,s22]) ).
cnf(s76,plain,
~ spl1_4,
inference(rat,[],[s58,s59,s62,s63,s70,s74,s75]) ).
cnf(s77,plain,
$false,
inference(rat,[],[s2,s76,s24]) ).
fof(f957,plain,
$false,
inference(avatar_sat_refutation,[],[s77]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL453+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n008.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:45:39 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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
% 3.43/1.33 % (1408033)Detected formulas, will run a generic FOF schedule.
% 3.43/1.33 % (1408140)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=4128223515:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.43/1.33 % (1408143)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1115814665:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.43/1.33 % (1408139)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=3053834467:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.43/1.33 % (1408144)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1712595505:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.43/1.33 % (1408141)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=3136354827:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.43/1.33 % (1408142)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3266710629:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.43/1.33 % (1408143)Refutation not found, incomplete strategy
% 3.43/1.33 % (1408143)------------------------------
% 3.43/1.33 % (1408143)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.43/1.33 % (1408143)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.43/1.33 % (1408143)CaDiCaL version: 2.1.3
% 3.43/1.33 % (1408142)Refutation not found, incomplete strategy
% 3.43/1.33 % (1408142)------------------------------
% 3.43/1.33 % (1408142)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.43/1.33 % (1408143)Termination reason: Refutation not found, incomplete strategy
% 3.43/1.33 % (1408143)Time elapsed: 0.001 s
% 3.43/1.33 % (1408143)Peak memory usage: 86 MB
% 3.43/1.33 % (1408142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.43/1.33 % (1408142)CaDiCaL version: 2.1.3
% 3.43/1.33 % (1408142)Termination reason: Refutation not found, incomplete strategy
% 3.43/1.33 % (1408142)Time elapsed: 0.001 s
% 3.43/1.33 % (1408142)Peak memory usage: 86 MB
% 3.43/1.33 % (1408144)First to succeed.
% 3.43/1.33 % (1408144)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1408033"
% 3.43/1.33 % (1408145)dis-21_1_sil=8000:lcm=predicate:random_seed=212661575: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)
% 3.43/1.33 % (1408145)Refutation not found, incomplete strategy
% 3.43/1.33 % (1408145)------------------------------
% 3.43/1.33 % (1408145)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.43/1.33 % (1408145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.43/1.33 % (1408145)CaDiCaL version: 2.1.3
% 3.43/1.33 % (1408145)Termination reason: Refutation not found, incomplete strategy
% 3.43/1.33 % (1408145)Time elapsed: 0.003 s
% 3.43/1.33 % (1408145)Peak memory usage: 88 MB
% 3.43/1.33 % (1408145)Instructions burned: 1 (million)
% 3.43/1.33 % (1408143)------------------------------
% 3.43/1.33 % (1408143)------------------------------
% 3.43/1.33 % (1408142)------------------------------
% 3.43/1.33 % (1408142)------------------------------
% 3.43/1.33 % (1408144)Refutation found. Thanks to Tanya!
% 3.43/1.33 % SZS status Theorem for theBenchmark
% 3.43/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 3.71/1.43 % (1408144)------------------------------
% 3.71/1.43 % (1408144)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.71/1.43 % (1408144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.71/1.43 % (1408144)CaDiCaL version: 2.1.3
% 3.71/1.43 % (1408144)Termination reason: Refutation
% 3.71/1.43 % (1408144)Time elapsed: 0.023 s
% 3.71/1.43 % (1408144)Peak memory usage: 90 MB
% 3.71/1.43 % (1408144)Instructions burned: 31 (million)
% 3.71/1.43 % (1408144)------------------------------
% 3.71/1.43 % (1408144)------------------------------
% 3.71/1.43 % (1408033)Success in time 0.447 s
% 3.71/1.43 % Vampire exiting
%------------------------------------------------------------------------------