%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL526+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 : n009.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:51 AM UTC 2026
% Result : Theorem 7.18s 2.04s
% Output : Refutation 8.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 21
% Syntax : Number of formulae : 103 ( 44 unt; 1 def)
% Number of atoms : 183 ( 23 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 135 ( 55 ~; 51 |; 4 &)
% ( 9 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 12 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 110 ( 0 sgn 108 !; 2 ?)
% 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(f2,axiom,
( substitution_of_equivalents
<=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution_of_equivalents) ).
fof(f7,axiom,
( and_1
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_1) ).
fof(f8,axiom,
( and_2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_2) ).
fof(f14,axiom,
( equivalence_2
<=> ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X1,X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalence_2) ).
fof(f15,axiom,
( equivalence_3
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalence_3) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_modus_ponens) ).
fof(f40,axiom,
and_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_1) ).
fof(f41,axiom,
and_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_2) ).
fof(f47,axiom,
equivalence_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_equivalence_2) ).
fof(f48,axiom,
equivalence_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_equivalence_3) ).
fof(f49,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',use_substitution_of_equivalents) ).
fof(f53,axiom,
( substitution_strict_equiv
<=> ! [X0,X1] :
( is_a_theorem(strict_equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution_strict_equiv) ).
fof(f55,axiom,
( axiom_M
<=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_M) ).
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(f76,axiom,
( op_strict_equiv
=> ! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_strict_equiv) ).
fof(f80,axiom,
axiom_M,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km5_axiom_M) ).
fof(f85,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f87,axiom,
op_strict_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_equiv) ).
fof(f88,conjecture,
substitution_strict_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_substitution_strict_equiv) ).
fof(f89,negated_conjecture,
~ substitution_strict_equiv,
inference(negated_conjecture,[status(cth)],[f88]) ).
fof(f90,plain,
~ substitution_strict_equiv,
inference(flattening,[],[f89]) ).
fof(f92,plain,
( axiom_M
=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f94,plain,
( ! [X0,X1] :
( is_a_theorem(strict_equiv(X0,X1))
=> X0 = X1 )
=> substitution_strict_equiv ),
inference(unused_predicate_definition_removal,[],[f53]) ).
fof(f96,plain,
( equivalence_3
=> ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f97,plain,
( equivalence_2
=> ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f14]) ).
fof(f103,plain,
( and_2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f104,plain,
( and_1
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f109,plain,
( substitution_of_equivalents
=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
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(f117,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f109]) ).
fof(f122,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(ennf_transformation,[],[f104]) ).
fof(f123,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(ennf_transformation,[],[f103]) ).
fof(f129,plain,
( ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X1,X0)))
| ~ equivalence_2 ),
inference(ennf_transformation,[],[f97]) ).
fof(f130,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
| ~ equivalence_3 ),
inference(ennf_transformation,[],[f96]) ).
fof(f135,plain,
( substitution_strict_equiv
| ? [X0,X1] :
( X0 != X1
& is_a_theorem(strict_equiv(X0,X1)) ) ),
inference(ennf_transformation,[],[f94]) ).
fof(f137,plain,
( ! [X0] : is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(ennf_transformation,[],[f92]) ).
fof(f140,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f75]) ).
fof(f141,plain,
( ! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0))
| ~ op_strict_equiv ),
inference(ennf_transformation,[],[f76]) ).
fof(f142,plain,
( substitution_strict_equiv
| ( sK0 != sK1
& is_a_theorem(strict_equiv(sK0,sK1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f135]) ).
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(f144,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f117]) ).
fof(f149,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(cnf_transformation,[],[f122]) ).
fof(f150,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(cnf_transformation,[],[f123]) ).
fof(f156,plain,
! [X0,X1] :
( is_a_theorem(implies(equiv(X0,X1),implies(X1,X0)))
| ~ equivalence_2 ),
inference(cnf_transformation,[],[f129]) ).
fof(f157,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
| ~ equivalence_3 ),
inference(cnf_transformation,[],[f130]) ).
fof(f164,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f169,plain,
and_1,
inference(cnf_transformation,[],[f40]) ).
fof(f170,plain,
and_2,
inference(cnf_transformation,[],[f41]) ).
fof(f176,plain,
equivalence_2,
inference(cnf_transformation,[],[f47]) ).
fof(f177,plain,
equivalence_3,
inference(cnf_transformation,[],[f48]) ).
fof(f178,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f49]) ).
fof(f180,plain,
( substitution_strict_equiv
| is_a_theorem(strict_equiv(sK0,sK1)) ),
inference(cnf_transformation,[],[f142]) ).
fof(f181,plain,
( substitution_strict_equiv
| sK0 != sK1 ),
inference(cnf_transformation,[],[f142]) ).
fof(f183,plain,
! [X0] :
( is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(cnf_transformation,[],[f137]) ).
fof(f186,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f140]) ).
fof(f187,plain,
! [X0,X1] :
( strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0))
| ~ op_strict_equiv ),
inference(cnf_transformation,[],[f141]) ).
fof(f191,plain,
axiom_M,
inference(cnf_transformation,[],[f80]) ).
fof(f195,plain,
op_strict_implies,
inference(cnf_transformation,[],[f85]) ).
fof(f197,plain,
op_strict_equiv,
inference(cnf_transformation,[],[f87]) ).
fof(f198,plain,
~ substitution_strict_equiv,
inference(cnf_transformation,[],[f90]) ).
fof(f199,plain,
! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0)),
inference(forward_subsumption_resolution,[],[f187,f197]) ).
fof(f200,plain,
! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(forward_subsumption_resolution,[],[f186,f195]) ).
fof(f203,plain,
! [X0] : is_a_theorem(implies(necessarily(X0),X0)),
inference(forward_subsumption_resolution,[],[f183,f191]) ).
fof(f205,plain,
is_a_theorem(strict_equiv(sK0,sK1)),
inference(forward_subsumption_resolution,[],[f180,f198]) ).
fof(f206,plain,
sK0 != sK1,
inference(forward_subsumption_resolution,[],[f181,f198]) ).
fof(f211,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))),
inference(forward_subsumption_resolution,[],[f157,f177]) ).
fof(f212,plain,
! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X1,X0))),
inference(forward_subsumption_resolution,[],[f156,f176]) ).
fof(f218,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)),
inference(forward_subsumption_resolution,[],[f150,f170]) ).
fof(f219,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(forward_subsumption_resolution,[],[f149,f169]) ).
fof(f224,plain,
! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f144,f178]) ).
fof(f225,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f143,f164]) ).
fof(f232,plain,
! [X0] :
( ~ is_a_theorem(necessarily(X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f203,f225]) ).
fof(f281,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X1,X0),equiv(X0,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f211,f225]) ).
fof(f286,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(equiv(X0,X1)) ),
inference(resolution,[],[f281,f225]) ).
fof(f292,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(equiv(X0,X1),implies(X1,X0)))
| is_a_theorem(equiv(equiv(X0,X1),implies(X1,X0)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f286,f281]) ).
fof(f298,plain,
! [X0,X1] :
( is_a_theorem(equiv(equiv(X0,X1),implies(X1,X0)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_subsumption_resolution,[],[f292,f212]) ).
fof(f301,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| equiv(X0,X1) = implies(X1,X0) ),
inference(resolution,[],[f298,f224]) ).
fof(f332,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(implies(X0,X1)) ),
inference(superposition,[],[f232,f200]) ).
fof(f402,plain,
! [X0,X1] : is_a_theorem(implies(strict_equiv(X0,X1),strict_implies(X0,X1))),
inference(superposition,[],[f219,f199]) ).
fof(f408,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_equiv(X0,X1))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(resolution,[],[f402,f225]) ).
fof(f410,plain,
is_a_theorem(strict_implies(sK0,sK1)),
inference(resolution,[],[f408,f205]) ).
fof(f412,plain,
is_a_theorem(implies(sK0,sK1)),
inference(resolution,[],[f410,f332]) ).
fof(f413,plain,
equiv(sK0,sK1) = implies(sK1,sK0),
inference(resolution,[],[f412,f301]) ).
fof(f432,definition,
( spl2_4
<=> is_a_theorem(implies(sK1,sK0)) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
fof(f433,plain,
( is_a_theorem(implies(sK1,sK0))
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f432]) ).
fof(f434,plain,
( ~ is_a_theorem(implies(sK1,sK0))
| spl2_4 ),
inference(avatar_component_clause,[],[f432]) ).
fof(f439,plain,
( ~ is_a_theorem(implies(sK1,sK0))
| sK0 = sK1 ),
inference(superposition,[],[f224,f413]) ).
fof(f446,plain,
! [X0,X1] : is_a_theorem(implies(strict_equiv(X0,X1),strict_implies(X1,X0))),
inference(superposition,[],[f218,f199]) ).
fof(f452,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_equiv(X0,X1))
| is_a_theorem(strict_implies(X1,X0)) ),
inference(resolution,[],[f446,f225]) ).
fof(f454,plain,
is_a_theorem(strict_implies(sK1,sK0)),
inference(resolution,[],[f452,f205]) ).
fof(f456,plain,
is_a_theorem(implies(sK1,sK0)),
inference(resolution,[],[f454,f332]) ).
fof(f457,plain,
( $false
| spl2_4 ),
inference(forward_subsumption_resolution,[],[f456,f434]) ).
fof(f458,plain,
spl2_4,
inference(avatar_contradiction_clause,[],[f457]) ).
fof(f459,plain,
( sK0 = sK1
| ~ spl2_4 ),
inference(forward_subsumption_resolution,[],[f439,f433]) ).
fof(f460,plain,
( $false
| ~ spl2_4 ),
inference(forward_subsumption_resolution,[],[f459,f206]) ).
fof(f461,plain,
~ spl2_4,
inference(avatar_contradiction_clause,[],[f460]) ).
cnf(s3,plain,
spl2_4,
inference(sat_conversion,[],[f458]) ).
cnf(s4,plain,
~ spl2_4,
inference(sat_conversion,[],[f461]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s3,s4]) ).
fof(f462,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL526+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.14/0.42 % Computer : n009.cluster.edu
% 0.14/0.42 % Model : x86_64 x86_64
% 0.14/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.42 % Memory : 8046.5625MB
% 0.14/0.42 % OS : Linux 6.8.0-71-generic
% 0.14/0.42 % CPULimit : 300
% 0.14/0.42 % WCLimit : 300
% 0.14/0.42 % DateTime : Sun Sep 27 15:56:00 UTC 2026
% 0.14/0.42 % CPUTime :
% 0.14/0.42 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.47 Running first-order theorem proving
% 0.22/0.47 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
% 7.18/2.04 % (2212701)Detected formulas, will run a generic FOF schedule.
% 7.18/2.04 % (2212706)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=613322697:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 7.18/2.04 % (2212710)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4294115035:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 7.18/2.04 % (2212707)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=3185274523:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 7.18/2.04 % (2212708)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=1486768291:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 7.18/2.04 % (2212711)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3301461385:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 7.18/2.04 % (2212709)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=214961149:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 7.18/2.04 % (2212712)dis-21_1_sil=8000:lcm=predicate:random_seed=3018788698: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)
% 7.18/2.04 % (2212709)Refutation not found, incomplete strategy
% 7.18/2.04 % (2212709)------------------------------
% 7.18/2.04 % (2212709)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.18/2.04 % (2212709)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.18/2.04 % (2212710)Refutation not found, incomplete strategy
% 7.18/2.04 % (2212710)------------------------------
% 7.18/2.04 % (2212710)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.18/2.04 % (2212709)CaDiCaL version: 2.1.3
% 7.18/2.04 % (2212709)Termination reason: Refutation not found, incomplete strategy
% 7.18/2.04 % (2212709)Time elapsed: 0.002 s
% 7.18/2.04 % (2212709)Peak memory usage: 88 MB
% 7.18/2.04 % (2212710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.18/2.04 % (2212710)CaDiCaL version: 2.1.3
% 7.18/2.04 % (2212710)Termination reason: Refutation not found, incomplete strategy
% 7.18/2.04 % (2212710)Time elapsed: 0.002 s
% 7.18/2.04 % (2212710)Peak memory usage: 88 MB
% 7.18/2.04 % (2212712)Refutation not found, incomplete strategy
% 7.18/2.04 % (2212712)------------------------------
% 7.18/2.04 % (2212712)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.18/2.04 % (2212712)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.18/2.04 % (2212712)CaDiCaL version: 2.1.3
% 7.18/2.04 % (2212712)Termination reason: Refutation not found, incomplete strategy
% 7.18/2.04 % (2212712)Time elapsed: 0.004 s
% 7.18/2.04 % (2212712)Peak memory usage: 88 MB
% 7.18/2.04 % (2212712)Instructions burned: 1 (million)
% 7.18/2.04 % (2212711)Instruction limit reached!
% 7.18/2.04 % (2212711)------------------------------
% 7.18/2.04 % (2212711)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.18/2.04 % (2212711)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.18/2.04 % (2212711)CaDiCaL version: 2.1.3
% 7.18/2.04 % (2212711)Termination reason: Instruction limit
% 7.18/2.04 % (2212711)Termination phase: Saturation
% 7.18/2.04 % (2212711)Time elapsed: 0.147 s
% 7.18/2.04 % (2212711)Peak memory usage: 90 MB
% 7.18/2.04 % (2212711)Instructions burned: 139 (million)
% 7.18/2.04 % (2212710)------------------------------
% 7.18/2.04 % (2212710)------------------------------
% 7.18/2.04 % (2212709)------------------------------
% 7.18/2.04 % (2212709)------------------------------
% 7.18/2.04 % (2212712)------------------------------
% 7.18/2.04 % (2212712)------------------------------
% 7.18/2.04 % (2212720)lrs+10_1_sil=8000:sp=occurrence:random_seed=3009854953:i=285:sd=3:ss=axioms:sgt=8_2995 on theBenchmark for (2995ds/285Mi)
% 7.18/2.04 % (2212720)Refutation not found, incomplete strategy
% 7.18/2.04 % (2212720)------------------------------
% 7.18/2.04 % (2212720)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.18/2.04 % (2212720)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.18/2.04 % (2212720)CaDiCaL version: 2.1.3
% 7.18/2.04 % (2212720)Termination reason: Refutation not found, incomplete strategy
% 7.18/2.04 % (2212720)Time elapsed: 0.003 s
% 7.18/2.04 % (2212720)Peak memory usage: 88 MB
% 7.18/2.04 % (2212706)First to succeed.
% 7.18/2.04 % (2212706)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2212701"
% 7.18/2.04 % (2212721)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2483059906:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2993 on theBenchmark for (2993ds/157Mi)
% 7.18/2.04 % (2212721)Refutation not found, incomplete strategy
% 7.18/2.04 % (2212721)------------------------------
% 7.18/2.04 % (2212721)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.18/2.04 % (2212721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.18/2.04 % (2212721)CaDiCaL version: 2.1.3
% 7.18/2.04 % (2212721)Termination reason: Refutation not found, incomplete strategy
% 7.18/2.04 % (2212721)Time elapsed: 0.003 s
% 7.18/2.04 % (2212721)Peak memory usage: 88 MB
% 7.18/2.04 % (2212721)Instructions burned: 1 (million)
% 7.18/2.04 % (2212722)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2404645654:i=325:sd=1:ss=axioms:sgt=32_2993 on theBenchmark for (2993ds/325Mi)
% 7.18/2.04 % (2212723)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=3108227680:s2a=on:i=248:s2at=1.23:gtg=position_2993 on theBenchmark for (2993ds/248Mi)
% 7.18/2.04 % (2212722)Refutation not found, incomplete strategy
% 7.18/2.04 % (2212722)------------------------------
% 7.18/2.04 % (2212722)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.18/2.04 % (2212722)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.18/2.04 % (2212722)CaDiCaL version: 2.1.3
% 7.18/2.04 % (2212722)Termination reason: Refutation not found, incomplete strategy
% 7.18/2.04 % (2212722)Time elapsed: 0.002 s
% 7.18/2.04 % (2212722)Peak memory usage: 88 MB
% 7.18/2.04 % (2212706)Refutation found. Thanks to Tanya!
% 7.18/2.04 % SZS status Theorem for theBenchmark
% 7.18/2.04 % SZS output start Proof for theBenchmark
% See solution above
% 8.38/2.29 % (2212706)------------------------------
% 8.38/2.29 % (2212706)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.29 % (2212706)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.29 % (2212706)CaDiCaL version: 2.1.3
% 8.38/2.29 % (2212706)Termination reason: Refutation
% 8.38/2.29 % (2212706)Time elapsed: 0.602 s
% 8.38/2.29 % (2212706)Peak memory usage: 130 MB
% 8.38/2.29 % (2212706)Instructions burned: 991 (million)
% 8.38/2.29 % (2212706)------------------------------
% 8.38/2.29 % (2212706)------------------------------
% 8.38/2.29 % (2212701)Success in time 1.085 s
% 8.38/2.29 % Vampire exiting
%------------------------------------------------------------------------------