%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL546+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 : 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 5.57s 1.72s
% Output : Refutation 6.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 28
% Syntax : Number of formulae : 110 ( 39 unt; 14 def)
% Number of atoms : 228 ( 5 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 209 ( 91 ~; 85 |; 2 &)
% ( 20 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 67 ( 0 sgn 66 !; 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(f6,axiom,
( implies_3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_3) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_modus_ponens) ).
fof(f39,axiom,
implies_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_3) ).
fof(f50,axiom,
( necessitation
<=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',necessitation) ).
fof(f55,axiom,
( axiom_M
<=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_M) ).
fof(f57,axiom,
( axiom_B
<=> ! [X0] : is_a_theorem(implies(X0,necessarily(possibly(X0)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_B) ).
fof(f68,axiom,
( axiom_m6
<=> ! [X0] : is_a_theorem(strict_implies(X0,possibly(X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m6) ).
fof(f75,axiom,
( op_strict_implies
=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f78,axiom,
necessitation,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km4b_necessitation) ).
fof(f80,axiom,
axiom_M,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km4b_axiom_M) ).
fof(f82,axiom,
axiom_B,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km4b_axiom_B) ).
fof(f86,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f89,conjecture,
axiom_m6,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_m6s3m9b_axiom_m6) ).
fof(f90,negated_conjecture,
~ axiom_m6,
inference(negated_conjecture,[status(cth)],[f89]) ).
fof(f91,plain,
~ axiom_m6,
inference(flattening,[],[f90]) ).
fof(f92,plain,
( ! [X0] : is_a_theorem(strict_implies(X0,possibly(X0)))
=> axiom_m6 ),
inference(unused_predicate_definition_removal,[],[f68]) ).
fof(f93,plain,
( axiom_B
=> ! [X0] : is_a_theorem(implies(X0,necessarily(possibly(X0)))) ),
inference(unused_predicate_definition_removal,[],[f57]) ).
fof(f95,plain,
( axiom_M
=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f97,plain,
( necessitation
=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f107,plain,
( implies_3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f6]) ).
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(f123,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(ennf_transformation,[],[f107]) ).
fof(f136,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ necessitation ),
inference(ennf_transformation,[],[f97]) ).
fof(f138,plain,
( ! [X0] : is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(ennf_transformation,[],[f95]) ).
fof(f140,plain,
( ! [X0] : is_a_theorem(implies(X0,necessarily(possibly(X0))))
| ~ axiom_B ),
inference(ennf_transformation,[],[f93]) ).
fof(f141,plain,
( axiom_m6
| ? [X0] : ~ is_a_theorem(strict_implies(X0,possibly(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_m6
| ~ is_a_theorem(strict_implies(sK0,possibly(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(f151,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(cnf_transformation,[],[f123]) ).
fof(f167,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f171,plain,
implies_3,
inference(cnf_transformation,[],[f39]) ).
fof(f182,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0)
| ~ necessitation ),
inference(cnf_transformation,[],[f136]) ).
fof(f184,plain,
! [X0] :
( is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(cnf_transformation,[],[f138]) ).
fof(f186,plain,
! [X0] :
( is_a_theorem(implies(X0,necessarily(possibly(X0))))
| ~ axiom_B ),
inference(cnf_transformation,[],[f140]) ).
fof(f187,plain,
( axiom_m6
| ~ is_a_theorem(strict_implies(sK0,possibly(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(f194,plain,
axiom_M,
inference(cnf_transformation,[],[f80]) ).
fof(f196,plain,
axiom_B,
inference(cnf_transformation,[],[f82]) ).
fof(f199,plain,
op_strict_implies,
inference(cnf_transformation,[],[f86]) ).
fof(f202,plain,
~ axiom_m6,
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,possibly(sK0))) ),
introduced(definition,[new_symbols(definition,[spl1_7])],[avatar_definition]) ).
fof(f230,plain,
( ~ is_a_theorem(strict_implies(sK0,possibly(sK0)))
| spl1_7 ),
inference(avatar_component_clause,[],[f228]) ).
fof(f232,definition,
( spl1_8
<=> axiom_m6 ),
introduced(definition,[new_symbols(definition,[spl1_8])],[avatar_definition]) ).
fof(f235,plain,
( ~ spl1_7
| spl1_8 ),
inference(avatar_split_clause,[],[f187,f232,f228]) ).
fof(f237,definition,
( spl1_9
<=> axiom_B ),
introduced(definition,[new_symbols(definition,[spl1_9])],[avatar_definition]) ).
fof(f241,definition,
( spl1_10
<=> ! [X0] : is_a_theorem(implies(X0,necessarily(possibly(X0)))) ),
introduced(definition,[new_symbols(definition,[spl1_10])],[avatar_definition]) ).
fof(f242,plain,
( ! [X0] : is_a_theorem(implies(X0,necessarily(possibly(X0))))
| ~ spl1_10 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f243,plain,
( ~ spl1_9
| spl1_10 ),
inference(avatar_split_clause,[],[f186,f241,f237]) ).
fof(f253,definition,
( spl1_13
<=> axiom_M ),
introduced(definition,[new_symbols(definition,[spl1_13])],[avatar_definition]) ).
fof(f257,definition,
( spl1_14
<=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
introduced(definition,[new_symbols(definition,[spl1_14])],[avatar_definition]) ).
fof(f258,plain,
( ! [X0] : is_a_theorem(implies(necessarily(X0),X0))
| ~ spl1_14 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f259,plain,
( ~ spl1_13
| spl1_14 ),
inference(avatar_split_clause,[],[f184,f257,f253]) ).
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(f373,definition,
( spl1_43
<=> implies_3 ),
introduced(definition,[new_symbols(definition,[spl1_43])],[avatar_definition]) ).
fof(f377,definition,
( spl1_44
<=> ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
introduced(definition,[new_symbols(definition,[spl1_44])],[avatar_definition]) ).
fof(f378,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ spl1_44 ),
inference(avatar_component_clause,[],[f377]) ).
fof(f379,plain,
( ~ spl1_43
| spl1_44 ),
inference(avatar_split_clause,[],[f151,f377,f373]) ).
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(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(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(f424,plain,
spl1_53,
inference(avatar_split_clause,[],[f167,f413]) ).
fof(f428,plain,
spl1_43,
inference(avatar_split_clause,[],[f171,f373]) ).
fof(f440,plain,
spl1_17,
inference(avatar_split_clause,[],[f192,f269]) ).
fof(f442,plain,
spl1_13,
inference(avatar_split_clause,[],[f194,f253]) ).
fof(f444,plain,
spl1_9,
inference(avatar_split_clause,[],[f196,f237]) ).
fof(f445,plain,
spl1_3,
inference(avatar_split_clause,[],[f199,f212]) ).
fof(f460,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(strict_implies(X0,X1)) )
| ~ spl1_4
| ~ spl1_18 ),
inference(superposition,[],[f274,f217]) ).
fof(f661,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(necessarily(possibly(X0)),X1),implies(X0,X1)))
| ~ spl1_10
| ~ spl1_44
| ~ spl1_54 ),
inference(unit_resulting_resolution,[],[f418,f242,f378]) ).
fof(f1121,plain,
( ~ is_a_theorem(implies(sK0,possibly(sK0)))
| ~ spl1_4
| spl1_7
| ~ spl1_18 ),
inference(unit_resulting_resolution,[],[f460,f230]) ).
fof(f5455,plain,
( ~ is_a_theorem(implies(necessarily(possibly(sK0)),possibly(sK0)))
| ~ spl1_4
| spl1_7
| ~ spl1_10
| ~ spl1_18
| ~ spl1_44
| ~ spl1_54 ),
inference(unit_resulting_resolution,[],[f418,f1121,f661]) ).
fof(f5536,plain,
( $false
| ~ spl1_4
| spl1_7
| ~ spl1_10
| ~ spl1_14
| ~ spl1_18
| ~ spl1_44
| ~ spl1_54 ),
inference(forward_subsumption_resolution,[],[f5455,f258]) ).
fof(f5537,plain,
( ~ spl1_4
| spl1_7
| ~ spl1_10
| ~ spl1_14
| ~ spl1_18
| ~ spl1_44
| ~ spl1_54 ),
inference(avatar_contradiction_clause,[],[f5536]) ).
cnf(s2,plain,
( ~ spl1_3
| spl1_4 ),
inference(sat_conversion,[],[f218]) ).
cnf(s4,plain,
( ~ spl1_7
| spl1_8 ),
inference(sat_conversion,[],[f235]) ).
cnf(s5,plain,
( ~ spl1_9
| spl1_10 ),
inference(sat_conversion,[],[f243]) ).
cnf(s7,plain,
( ~ spl1_13
| spl1_14 ),
inference(sat_conversion,[],[f259]) ).
cnf(s9,plain,
( ~ spl1_17
| spl1_18 ),
inference(sat_conversion,[],[f275]) ).
cnf(s22,plain,
( ~ spl1_43
| spl1_44 ),
inference(sat_conversion,[],[f379]) ).
cnf(s27,plain,
( ~ spl1_53
| spl1_54 ),
inference(sat_conversion,[],[f419]) ).
cnf(s28,plain,
~ spl1_8,
inference(sat_conversion,[],[f420]) ).
cnf(s32,plain,
spl1_53,
inference(sat_conversion,[],[f424]) ).
cnf(s36,plain,
spl1_43,
inference(sat_conversion,[],[f428]) ).
cnf(s48,plain,
spl1_17,
inference(sat_conversion,[],[f440]) ).
cnf(s50,plain,
spl1_13,
inference(sat_conversion,[],[f442]) ).
cnf(s52,plain,
spl1_9,
inference(sat_conversion,[],[f444]) ).
cnf(s55,plain,
spl1_3,
inference(sat_conversion,[],[f445]) ).
cnf(s60,plain,
( ~ spl1_4
| spl1_7
| ~ spl1_10
| ~ spl1_14
| ~ spl1_18
| ~ spl1_44
| ~ spl1_54 ),
inference(sat_conversion,[],[f5537]) ).
cnf(s61,plain,
spl1_54,
inference(rat,[],[s27,s32]) ).
cnf(s66,plain,
spl1_44,
inference(rat,[],[s22,s36]) ).
cnf(s79,plain,
spl1_18,
inference(rat,[],[s9,s48]) ).
cnf(s81,plain,
spl1_14,
inference(rat,[],[s7,s50]) ).
cnf(s83,plain,
spl1_10,
inference(rat,[],[s5,s52]) ).
cnf(s84,plain,
~ spl1_7,
inference(rat,[],[s4,s28]) ).
cnf(s85,plain,
~ spl1_4,
inference(rat,[],[s60,s61,s66,s79,s81,s83,s84]) ).
cnf(s87,plain,
$false,
inference(rat,[],[s2,s85,s55]) ).
fof(f5538,plain,
$false,
inference(avatar_sat_refutation,[],[s87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL546+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n014.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 15:59:17 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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
% 5.57/1.72 % (971169)Detected formulas, will run a generic FOF schedule.
% 5.57/1.72 % (971178)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1209415778:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.57/1.72 % (971178)Refutation not found, incomplete strategy
% 5.57/1.72 % (971178)------------------------------
% 5.57/1.72 % (971178)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.57/1.72 % (971178)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.57/1.72 % (971178)CaDiCaL version: 2.1.3
% 5.57/1.72 % (971178)Termination reason: Refutation not found, incomplete strategy
% 5.57/1.72 % (971178)Time elapsed: 0.0000 s
% 5.57/1.72 % (971178)Peak memory usage: 87 MB
% 5.57/1.72 % (971179)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2566520397:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.57/1.72 % (971180)dis-21_1_sil=8000:lcm=predicate:random_seed=2303970798: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)
% 5.57/1.72 % (971177)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2643859420:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.57/1.72 % (971175)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=3004080563:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.57/1.72 % (971174)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=2677079204:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.57/1.72 % (971176)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=880015059:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.57/1.72 % (971177)Refutation not found, incomplete strategy
% 5.57/1.72 % (971177)------------------------------
% 5.57/1.72 % (971177)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.57/1.72 % (971177)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.57/1.72 % (971177)CaDiCaL version: 2.1.3
% 5.57/1.72 % (971177)Termination reason: Refutation not found, incomplete strategy
% 5.57/1.72 % (971177)Time elapsed: 0.001 s
% 5.57/1.72 % (971177)Peak memory usage: 87 MB
% 5.57/1.72 % (971180)Refutation not found, incomplete strategy
% 5.57/1.72 % (971180)------------------------------
% 5.57/1.72 % (971180)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.57/1.72 % (971180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.57/1.72 % (971180)CaDiCaL version: 2.1.3
% 5.57/1.72 % (971180)Termination reason: Refutation not found, incomplete strategy
% 5.57/1.72 % (971180)Time elapsed: 0.002 s
% 5.57/1.72 % (971180)Peak memory usage: 88 MB
% 5.57/1.72 % (971180)Instructions burned: 1 (million)
% 5.57/1.72 % (971179)Instruction limit reached!
% 5.57/1.72 % (971179)------------------------------
% 5.57/1.72 % (971179)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.57/1.72 % (971179)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.57/1.72 % (971179)CaDiCaL version: 2.1.3
% 5.57/1.72 % (971179)Termination reason: Instruction limit
% 5.57/1.72 % (971179)Termination phase: Saturation
% 5.57/1.72 % (971179)Time elapsed: 0.097 s
% 5.57/1.72 % (971179)Peak memory usage: 90 MB
% 5.57/1.72 % (971179)Instructions burned: 140 (million)
% 5.57/1.72 % (971178)------------------------------
% 5.57/1.72 % (971178)------------------------------
% 5.57/1.72 % (971189)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3860632892:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 5.57/1.72 % (971189)Refutation not found, incomplete strategy
% 5.57/1.72 % (971189)------------------------------
% 5.57/1.72 % (971189)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.57/1.72 % (971189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.57/1.72 % (971189)CaDiCaL version: 2.1.3
% 5.57/1.72 % (971189)Termination reason: Refutation not found, incomplete strategy
% 5.57/1.72 % (971189)Time elapsed: 0.0000 s
% 5.57/1.72 % (971189)Peak memory usage: 87 MB
% 5.57/1.72 % (971188)lrs+10_1_sil=8000:sp=occurrence:random_seed=3594950351:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 5.57/1.72 % (971188)Refutation not found, incomplete strategy
% 5.57/1.72 % (971188)------------------------------
% 5.57/1.72 % (971188)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.57/1.72 % (971188)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.57/1.72 % (971188)CaDiCaL version: 2.1.3
% 5.57/1.72 % (971188)Termination reason: Refutation not found, incomplete strategy
% 5.57/1.72 % (971188)Time elapsed: 0.001 s
% 5.57/1.72 % (971188)Peak memory usage: 87 MB
% 5.57/1.72 % (971177)------------------------------
% 5.57/1.72 % (971177)------------------------------
% 5.57/1.72 % (971180)------------------------------
% 5.57/1.72 % (971180)------------------------------
% 5.57/1.72 % (971189)------------------------------
% 5.57/1.72 % (971189)------------------------------
% 5.57/1.72 % (971193)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=540071330:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 5.57/1.72 % (971192)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3763804693:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 5.57/1.72 % (971192)Refutation not found, incomplete strategy
% 5.57/1.72 % (971192)------------------------------
% 5.57/1.72 % (971192)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.57/1.72 % (971192)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.57/1.72 % (971192)CaDiCaL version: 2.1.3
% 5.57/1.72 % (971192)Termination reason: Refutation not found, incomplete strategy
% 5.57/1.72 % (971192)Time elapsed: 0.001 s
% 5.57/1.72 % (971192)Peak memory usage: 87 MB
% 5.57/1.72 % (971194)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3380511928:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 5.57/1.72 % (971194)Refutation not found, incomplete strategy
% 5.57/1.72 % (971194)------------------------------
% 5.57/1.72 % (971194)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.57/1.72 % (971194)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.57/1.72 % (971194)CaDiCaL version: 2.1.3
% 5.57/1.72 % (971194)Termination reason: Refutation not found, incomplete strategy
% 5.57/1.72 % (971194)Time elapsed: 0.0000 s
% 5.57/1.72 % (971194)Peak memory usage: 87 MB
% 5.57/1.72 % (971193)First to succeed.
% 5.57/1.72 % (971193)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-971169"
% 5.57/1.72 % (971188)------------------------------
% 5.57/1.72 % (971188)------------------------------
% 5.57/1.72 % (971176)Refutation not found, incomplete strategy
% 5.57/1.72 % (971176)------------------------------
% 5.57/1.72 % (971176)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.57/1.72 % (971176)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.57/1.72 % (971176)CaDiCaL version: 2.1.3
% 5.57/1.72 % (971176)Termination reason: Refutation not found, incomplete strategy
% 5.57/1.72 % (971176)Time elapsed: 0.565 s
% 5.57/1.72 % (971176)Peak memory usage: 126 MB
% 5.57/1.72 % (971176)Instructions burned: 830 (million)
% 5.57/1.72 % (971194)------------------------------
% 5.57/1.72 % (971194)------------------------------
% 5.57/1.72 % (971192)------------------------------
% 5.57/1.72 % (971192)------------------------------
% 5.57/1.72 % (971198)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2805187305:i=2350_2993 on theBenchmark for (2993ds/2350Mi)
% 5.57/1.72 % (971199)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=2585591181:cts=off:i=113:fsr=off:ss=included:sgt=4_2992 on theBenchmark for (2992ds/113Mi)
% 5.57/1.72 % (971199)Refutation not found, incomplete strategy
% 5.57/1.72 % (971199)------------------------------
% 5.57/1.72 % (971199)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.57/1.72 % (971199)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.57/1.72 % (971199)CaDiCaL version: 2.1.3
% 5.57/1.72 % (971199)Termination reason: Refutation not found, incomplete strategy
% 5.57/1.72 % (971199)Time elapsed: 0.001 s
% 5.57/1.72 % (971199)Peak memory usage: 88 MB
% 5.57/1.72 % (971193)Refutation found. Thanks to Tanya!
% 5.57/1.72 % SZS status Theorem for theBenchmark
% 5.57/1.72 % SZS output start Proof for theBenchmark
% See solution above
% 6.71/1.92 % (971193)------------------------------
% 6.71/1.92 % (971193)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.71/1.92 % (971193)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.71/1.92 % (971193)CaDiCaL version: 2.1.3
% 6.71/1.92 % (971193)Termination reason: Refutation
% 6.71/1.92 % (971193)Time elapsed: 0.077 s
% 6.71/1.92 % (971193)Peak memory usage: 92 MB
% 6.71/1.92 % (971193)Instructions burned: 124 (million)
% 6.71/1.92 % (971193)------------------------------
% 6.71/1.92 % (971193)------------------------------
% 6.71/1.92 % (971169)Success in time 0.869 s
% 6.71/1.92 % Vampire exiting
%------------------------------------------------------------------------------