%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL520+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:50 AM UTC 2026
% Result : Theorem 7.55s 2.04s
% Output : Refutation 10.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 32
% Syntax : Number of formulae : 126 ( 44 unt; 16 def)
% Number of atoms : 266 ( 15 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 253 ( 113 ~; 107 |; 2 &)
% ( 21 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 27 ( 25 usr; 25 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn 97 !; 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(f16,axiom,
( kn1
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn1) ).
fof(f17,axiom,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn2) ).
fof(f18,axiom,
( kn3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn3) ).
fof(f24,axiom,
( r3
<=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r3) ).
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(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_or) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_or) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_modus_ponens) ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn1) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f38,axiom,
kn3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn3) ).
fof(f40,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f43,conjecture,
r3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r3) ).
fof(f44,negated_conjecture,
~ r3,
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f45,plain,
~ r3,
inference(flattening,[],[f44]) ).
fof(f46,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
=> r3 ),
inference(unused_predicate_definition_removal,[],[f24]) ).
fof(f47,plain,
( kn3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(unused_predicate_definition_removal,[],[f18]) ).
fof(f48,plain,
( kn2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f49,plain,
( kn1
=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f51,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(f52,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f51]) ).
fof(f53,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f52]) ).
fof(f55,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(ennf_transformation,[],[f49]) ).
fof(f56,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f48]) ).
fof(f57,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(ennf_transformation,[],[f47]) ).
fof(f58,plain,
( r3
| ? [X0,X1] : ~ is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(ennf_transformation,[],[f46]) ).
fof(f59,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f61,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f62,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f64,plain,
( r3
| ~ is_a_theorem(implies(or(sK0,sK1),or(sK1,sK0))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f58]) ).
fof(f65,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f53]) ).
fof(f67,plain,
! [X0] :
( is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(cnf_transformation,[],[f55]) ).
fof(f68,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[],[f56]) ).
fof(f69,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(cnf_transformation,[],[f57]) ).
fof(f70,plain,
( r3
| ~ is_a_theorem(implies(or(sK0,sK1),or(sK1,sK0))) ),
inference(cnf_transformation,[],[f64]) ).
fof(f71,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f59]) ).
fof(f73,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f61]) ).
fof(f74,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f62]) ).
fof(f76,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f77,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f79,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f80,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f81,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f82,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f84,plain,
op_implies_or,
inference(cnf_transformation,[],[f40]) ).
fof(f87,plain,
~ r3,
inference(cnf_transformation,[],[f45]) ).
fof(f97,definition,
( spl2_3
<=> op_implies_or ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f101,definition,
( spl2_4
<=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
fof(f102,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f101]) ).
fof(f103,plain,
( ~ spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f74,f101,f97]) ).
fof(f105,definition,
( spl2_5
<=> op_implies_and ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
fof(f109,definition,
( spl2_6
<=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition]) ).
fof(f110,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ spl2_6 ),
inference(avatar_component_clause,[],[f109]) ).
fof(f111,plain,
( ~ spl2_5
| spl2_6 ),
inference(avatar_split_clause,[],[f73,f109,f105]) ).
fof(f121,definition,
( spl2_9
<=> op_or ),
introduced(definition,[new_symbols(definition,[spl2_9])],[avatar_definition]) ).
fof(f125,definition,
( spl2_10
<=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
introduced(definition,[new_symbols(definition,[spl2_10])],[avatar_definition]) ).
fof(f126,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ spl2_10 ),
inference(avatar_component_clause,[],[f125]) ).
fof(f127,plain,
( ~ spl2_9
| spl2_10 ),
inference(avatar_split_clause,[],[f71,f125,f121]) ).
fof(f129,definition,
( spl2_11
<=> is_a_theorem(implies(or(sK0,sK1),or(sK1,sK0))) ),
introduced(definition,[new_symbols(definition,[spl2_11])],[avatar_definition]) ).
fof(f131,plain,
( ~ is_a_theorem(implies(or(sK0,sK1),or(sK1,sK0)))
| spl2_11 ),
inference(avatar_component_clause,[],[f129]) ).
fof(f133,definition,
( spl2_12
<=> r3 ),
introduced(definition,[new_symbols(definition,[spl2_12])],[avatar_definition]) ).
fof(f136,plain,
( ~ spl2_11
| spl2_12 ),
inference(avatar_split_clause,[],[f70,f133,f129]) ).
fof(f138,definition,
( spl2_13
<=> kn3 ),
introduced(definition,[new_symbols(definition,[spl2_13])],[avatar_definition]) ).
fof(f142,definition,
( spl2_14
<=> ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
introduced(definition,[new_symbols(definition,[spl2_14])],[avatar_definition]) ).
fof(f143,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ spl2_14 ),
inference(avatar_component_clause,[],[f142]) ).
fof(f144,plain,
( ~ spl2_13
| spl2_14 ),
inference(avatar_split_clause,[],[f69,f142,f138]) ).
fof(f146,definition,
( spl2_15
<=> kn2 ),
introduced(definition,[new_symbols(definition,[spl2_15])],[avatar_definition]) ).
fof(f150,definition,
( spl2_16
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
introduced(definition,[new_symbols(definition,[spl2_16])],[avatar_definition]) ).
fof(f151,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ spl2_16 ),
inference(avatar_component_clause,[],[f150]) ).
fof(f152,plain,
( ~ spl2_15
| spl2_16 ),
inference(avatar_split_clause,[],[f68,f150,f146]) ).
fof(f154,definition,
( spl2_17
<=> kn1 ),
introduced(definition,[new_symbols(definition,[spl2_17])],[avatar_definition]) ).
fof(f158,definition,
( spl2_18
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
introduced(definition,[new_symbols(definition,[spl2_18])],[avatar_definition]) ).
fof(f159,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ spl2_18 ),
inference(avatar_component_clause,[],[f158]) ).
fof(f160,plain,
( ~ spl2_17
| spl2_18 ),
inference(avatar_split_clause,[],[f67,f158,f154]) ).
fof(f170,definition,
( spl2_21
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[spl2_21])],[avatar_definition]) ).
fof(f174,definition,
( spl2_22
<=> ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ) ),
introduced(definition,[new_symbols(definition,[spl2_22])],[avatar_definition]) ).
fof(f175,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) )
| ~ spl2_22 ),
inference(avatar_component_clause,[],[f174]) ).
fof(f176,plain,
( ~ spl2_21
| spl2_22 ),
inference(avatar_split_clause,[],[f65,f174,f170]) ).
fof(f177,plain,
~ spl2_12,
inference(avatar_split_clause,[],[f87,f133]) ).
fof(f178,plain,
spl2_9,
inference(avatar_split_clause,[],[f76,f121]) ).
fof(f179,plain,
spl2_5,
inference(avatar_split_clause,[],[f77,f105]) ).
fof(f181,plain,
spl2_21,
inference(avatar_split_clause,[],[f79,f170]) ).
fof(f182,plain,
spl2_17,
inference(avatar_split_clause,[],[f80,f154]) ).
fof(f183,plain,
spl2_15,
inference(avatar_split_clause,[],[f81,f146]) ).
fof(f184,plain,
spl2_13,
inference(avatar_split_clause,[],[f82,f138]) ).
fof(f186,plain,
spl2_3,
inference(avatar_split_clause,[],[f84,f97]) ).
fof(f224,plain,
( ! [X0,X1] : is_a_theorem(implies(not(and(and(X0,X0),X1)),not(and(X1,X0))))
| ~ spl2_14
| ~ spl2_18
| ~ spl2_22 ),
inference(unit_resulting_resolution,[],[f175,f159,f143]) ).
fof(f232,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X2,not(X0)),implies(or(X0,X1),not(and(not(X1),X2)))))
| ~ spl2_10
| ~ spl2_14 ),
inference(superposition,[],[f143,f126]) ).
fof(f319,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(and(X0,X0),X1),not(and(not(X1),X0))))
| ~ spl2_6
| ~ spl2_14
| ~ spl2_18
| ~ spl2_22 ),
inference(superposition,[],[f224,f110]) ).
fof(f1021,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),not(X2)),implies(or(X2,X0),or(X0,X1))))
| ~ spl2_10
| ~ spl2_14 ),
inference(superposition,[],[f232,f126]) ).
fof(f1877,plain,
( ! [X0] : is_a_theorem(not(and(not(X0),X0)))
| ~ spl2_6
| ~ spl2_14
| ~ spl2_16
| ~ spl2_18
| ~ spl2_22 ),
inference(unit_resulting_resolution,[],[f175,f151,f319]) ).
fof(f1981,plain,
( ! [X0] : is_a_theorem(or(not(X0),X0))
| ~ spl2_6
| ~ spl2_10
| ~ spl2_14
| ~ spl2_16
| ~ spl2_18
| ~ spl2_22 ),
inference(superposition,[],[f1877,f126]) ).
fof(f2087,plain,
( ! [X0] : is_a_theorem(implies(X0,X0))
| ~ spl2_4
| ~ spl2_6
| ~ spl2_10
| ~ spl2_14
| ~ spl2_16
| ~ spl2_18
| ~ spl2_22 ),
inference(superposition,[],[f1981,f102]) ).
fof(f5408,plain,
( ~ is_a_theorem(implies(not(sK0),not(sK0)))
| ~ spl2_10
| spl2_11
| ~ spl2_14
| ~ spl2_22 ),
inference(unit_resulting_resolution,[],[f175,f131,f1021]) ).
fof(f5487,plain,
( $false
| ~ spl2_4
| ~ spl2_6
| ~ spl2_10
| spl2_11
| ~ spl2_14
| ~ spl2_16
| ~ spl2_18
| ~ spl2_22 ),
inference(forward_subsumption_resolution,[],[f5408,f2087]) ).
fof(f5488,plain,
( ~ spl2_4
| ~ spl2_6
| ~ spl2_10
| spl2_11
| ~ spl2_14
| ~ spl2_16
| ~ spl2_18
| ~ spl2_22 ),
inference(avatar_contradiction_clause,[],[f5487]) ).
cnf(s2,plain,
( ~ spl2_3
| spl2_4 ),
inference(sat_conversion,[],[f103]) ).
cnf(s3,plain,
( ~ spl2_5
| spl2_6 ),
inference(sat_conversion,[],[f111]) ).
cnf(s5,plain,
( ~ spl2_9
| spl2_10 ),
inference(sat_conversion,[],[f127]) ).
cnf(s6,plain,
( ~ spl2_11
| spl2_12 ),
inference(sat_conversion,[],[f136]) ).
cnf(s7,plain,
( ~ spl2_13
| spl2_14 ),
inference(sat_conversion,[],[f144]) ).
cnf(s8,plain,
( ~ spl2_15
| spl2_16 ),
inference(sat_conversion,[],[f152]) ).
cnf(s9,plain,
( ~ spl2_17
| spl2_18 ),
inference(sat_conversion,[],[f160]) ).
cnf(s11,plain,
( ~ spl2_21
| spl2_22 ),
inference(sat_conversion,[],[f176]) ).
cnf(s12,plain,
~ spl2_12,
inference(sat_conversion,[],[f177]) ).
cnf(s13,plain,
spl2_9,
inference(sat_conversion,[],[f178]) ).
cnf(s14,plain,
spl2_5,
inference(sat_conversion,[],[f179]) ).
cnf(s16,plain,
spl2_21,
inference(sat_conversion,[],[f181]) ).
cnf(s17,plain,
spl2_17,
inference(sat_conversion,[],[f182]) ).
cnf(s18,plain,
spl2_15,
inference(sat_conversion,[],[f183]) ).
cnf(s19,plain,
spl2_13,
inference(sat_conversion,[],[f184]) ).
cnf(s21,plain,
spl2_3,
inference(sat_conversion,[],[f186]) ).
cnf(s25,plain,
( ~ spl2_4
| ~ spl2_6
| ~ spl2_10
| spl2_11
| ~ spl2_14
| ~ spl2_16
| ~ spl2_18
| ~ spl2_22 ),
inference(sat_conversion,[],[f5488]) ).
cnf(s26,plain,
spl2_22,
inference(rat,[],[s11,s16]) ).
cnf(s28,plain,
spl2_18,
inference(rat,[],[s9,s17]) ).
cnf(s29,plain,
spl2_16,
inference(rat,[],[s8,s18]) ).
cnf(s30,plain,
spl2_14,
inference(rat,[],[s7,s19]) ).
cnf(s31,plain,
~ spl2_11,
inference(rat,[],[s6,s12]) ).
cnf(s32,plain,
spl2_10,
inference(rat,[],[s5,s13]) ).
cnf(s34,plain,
spl2_6,
inference(rat,[],[s3,s14]) ).
cnf(s35,plain,
~ spl2_4,
inference(rat,[],[s25,s26,s28,s29,s30,s31,s32,s34]) ).
cnf(s36,plain,
$false,
inference(rat,[],[s2,s35,s21]) ).
fof(f5489,plain,
$false,
inference(avatar_sat_refutation,[],[s36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL520+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.39 % Computer : n009.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8046.5625MB
% 0.14/0.39 % OS : Linux 6.8.0-71-generic
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Sun Sep 27 15:55:45 UTC 2026
% 0.14/0.39 % CPUTime :
% 0.14/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/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
% 7.55/2.04 % (2212162)Detected formulas, will run a generic FOF schedule.
% 7.55/2.04 % (2212182)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2505374117:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 7.55/2.04 % (2212181)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3083688365:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 7.55/2.04 % (2212180)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=3720542281:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 7.55/2.04 % (2212182)Refutation not found, incomplete strategy
% 7.55/2.04 % (2212182)------------------------------
% 7.55/2.04 % (2212182)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.04 % (2212182)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.04 % (2212182)CaDiCaL version: 2.1.3
% 7.55/2.04 % (2212182)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.04 % (2212182)Time elapsed: 0.001 s
% 7.55/2.04 % (2212182)Peak memory usage: 87 MB
% 7.55/2.04 % (2212181)Refutation not found, incomplete strategy
% 7.55/2.04 % (2212181)------------------------------
% 7.55/2.04 % (2212181)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.04 % (2212181)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.04 % (2212181)CaDiCaL version: 2.1.3
% 7.55/2.04 % (2212181)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.04 % (2212181)Time elapsed: 0.001 s
% 7.55/2.04 % (2212181)Peak memory usage: 87 MB
% 7.55/2.04 % (2212184)dis-21_1_sil=8000:lcm=predicate:random_seed=2178917841: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.55/2.04 % (2212178)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=1907463002:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 7.55/2.04 % (2212179)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=3901423341:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 7.55/2.04 % (2212184)Refutation not found, incomplete strategy
% 7.55/2.04 % (2212184)------------------------------
% 7.55/2.04 % (2212184)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.04 % (2212184)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.04 % (2212184)CaDiCaL version: 2.1.3
% 7.55/2.04 % (2212184)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.04 % (2212184)Time elapsed: 0.003 s
% 7.55/2.04 % (2212184)Peak memory usage: 88 MB
% 7.55/2.04 % (2212184)Instructions burned: 1 (million)
% 7.55/2.04 % (2212183)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3763623005:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 7.55/2.04 % (2212183)Instruction limit reached!
% 7.55/2.04 % (2212183)------------------------------
% 7.55/2.04 % (2212183)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.04 % (2212183)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.04 % (2212183)CaDiCaL version: 2.1.3
% 7.55/2.04 % (2212183)Termination reason: Instruction limit
% 7.55/2.04 % (2212183)Termination phase: Saturation
% 7.55/2.04 % (2212183)Time elapsed: 0.077 s
% 7.55/2.04 % (2212183)Peak memory usage: 90 MB
% 7.55/2.04 % (2212183)Instructions burned: 139 (million)
% 7.55/2.04 % (2212182)------------------------------
% 7.55/2.04 % (2212182)------------------------------
% 7.55/2.04 % (2212219)lrs+10_1_sil=8000:sp=occurrence:random_seed=3242151370:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 7.55/2.04 % (2212219)Refutation not found, incomplete strategy
% 7.55/2.04 % (2212219)------------------------------
% 7.55/2.04 % (2212219)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.04 % (2212219)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.04 % (2212219)CaDiCaL version: 2.1.3
% 7.55/2.04 % (2212219)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.04 % (2212219)Time elapsed: 0.0000 s
% 7.55/2.04 % (2212219)Peak memory usage: 87 MB
% 7.55/2.04 % (2212184)------------------------------
% 7.55/2.04 % (2212184)------------------------------
% 7.55/2.04 % (2212181)------------------------------
% 7.55/2.04 % (2212181)------------------------------
% 7.55/2.04 % (2212219)------------------------------
% 7.55/2.04 % (2212219)------------------------------
% 7.55/2.04 % (2212233)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4007350304:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2995 on theBenchmark for (2995ds/157Mi)
% 7.55/2.04 % (2212233)Refutation not found, incomplete strategy
% 7.55/2.04 % (2212233)------------------------------
% 7.55/2.04 % (2212233)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.04 % (2212233)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.04 % (2212233)CaDiCaL version: 2.1.3
% 7.55/2.04 % (2212233)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.04 % (2212233)Time elapsed: 0.002 s
% 7.55/2.04 % (2212233)Peak memory usage: 87 MB
% 7.55/2.04 % (2212234)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2682097569:i=325:sd=1:ss=axioms:sgt=32_2994 on theBenchmark for (2994ds/325Mi)
% 7.55/2.04 % (2212234)Refutation not found, incomplete strategy
% 7.55/2.04 % (2212234)------------------------------
% 7.55/2.04 % (2212234)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.04 % (2212234)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.04 % (2212234)CaDiCaL version: 2.1.3
% 7.55/2.04 % (2212234)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.04 % (2212234)Time elapsed: 0.001 s
% 7.55/2.04 % (2212234)Peak memory usage: 87 MB
% 7.55/2.04 % (2212235)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=1641676963:s2a=on:i=248:s2at=1.23:gtg=position_2994 on theBenchmark for (2994ds/248Mi)
% 7.55/2.04 % (2212236)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1032048704:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2992 on theBenchmark for (2992ds/294Mi)
% 7.55/2.04 % (2212236)Refutation not found, incomplete strategy
% 7.55/2.04 % (2212236)------------------------------
% 7.55/2.04 % (2212236)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.04 % (2212236)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.04 % (2212236)CaDiCaL version: 2.1.3
% 7.55/2.04 % (2212236)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.04 % (2212236)Time elapsed: 0.001 s
% 7.55/2.04 % (2212236)Peak memory usage: 87 MB
% 7.55/2.04 % (2212235)First to succeed.
% 7.55/2.04 % (2212235)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2212162"
% 7.55/2.04 % (2212234)------------------------------
% 7.55/2.04 % (2212234)------------------------------
% 7.55/2.04 % (2212180)Refutation not found, incomplete strategy
% 7.55/2.04 % (2212180)------------------------------
% 7.55/2.04 % (2212180)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.04 % (2212180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.04 % (2212180)CaDiCaL version: 2.1.3
% 7.55/2.04 % (2212180)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.04 % (2212180)Time elapsed: 0.919 s
% 7.55/2.04 % (2212180)Peak memory usage: 126 MB
% 7.55/2.04 % (2212180)Instructions burned: 829 (million)
% 7.55/2.04 % (2212233)------------------------------
% 7.55/2.04 % (2212233)------------------------------
% 7.55/2.04 % (2212247)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3581832596:i=2350_2989 on theBenchmark for (2989ds/2350Mi)
% 7.55/2.04 % (2212236)------------------------------
% 7.55/2.04 % (2212236)------------------------------
% 7.55/2.04 % (2212250)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=3318182726:cts=off:i=113:fsr=off:ss=included:sgt=4_2988 on theBenchmark for (2988ds/113Mi)
% 7.55/2.04 % (2212250)Refutation not found, incomplete strategy
% 7.55/2.04 % (2212250)------------------------------
% 7.55/2.04 % (2212250)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.04 % (2212250)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.04 % (2212250)CaDiCaL version: 2.1.3
% 7.55/2.04 % (2212250)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.04 % (2212250)Time elapsed: 0.001 s
% 7.55/2.04 % (2212250)Peak memory usage: 88 MB
% 7.55/2.04 % (2212235)Refutation found. Thanks to Tanya!
% 7.55/2.04 % SZS status Theorem for theBenchmark
% 7.55/2.04 % SZS output start Proof for theBenchmark
% See solution above
% 10.25/2.29 % (2212235)------------------------------
% 10.25/2.29 % (2212235)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.25/2.29 % (2212235)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.25/2.29 % (2212235)CaDiCaL version: 2.1.3
% 10.25/2.29 % (2212235)Termination reason: Refutation
% 10.25/2.29 % (2212235)Time elapsed: 0.200 s
% 10.25/2.29 % (2212235)Peak memory usage: 93 MB
% 10.25/2.29 % (2212235)Instructions burned: 194 (million)
% 10.25/2.29 % (2212235)------------------------------
% 10.25/2.29 % (2212235)------------------------------
% 10.25/2.29 % (2212162)Success in time 1.408 s
% 10.25/2.29 % Vampire exiting
%------------------------------------------------------------------------------