%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL488+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 : n006.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:35 AM UTC 2026
% Result : Theorem 3.40s 1.35s
% Output : Refutation 4.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 32
% Syntax : Number of formulae : 125 ( 44 unt; 16 def)
% Number of atoms : 260 ( 23 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 244 ( 109 ~; 103 |; 2 &)
% ( 20 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 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(f8,axiom,
( and_2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_2) ).
fof(f23,axiom,
( r2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r2) ).
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(f28,axiom,
( op_and
=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_and) ).
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_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f33,axiom,
op_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_modus_ponens) ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r2) ).
fof(f38,axiom,
r3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r3) ).
fof(f42,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f43,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f45,conjecture,
and_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_2) ).
fof(f46,negated_conjecture,
~ and_2,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ and_2,
inference(flattening,[],[f46]) ).
fof(f50,plain,
( r3
=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f24]) ).
fof(f51,plain,
( r2
=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f23]) ).
fof(f53,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1))
=> and_2 ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f55,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(f56,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f55]) ).
fof(f57,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f56]) ).
fof(f59,plain,
( and_2
| ? [X0,X1] : ~ is_a_theorem(implies(and(X0,X1),X1)) ),
inference(ennf_transformation,[],[f53]) ).
fof(f61,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(ennf_transformation,[],[f51]) ).
fof(f62,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(ennf_transformation,[],[f50]) ).
fof(f65,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f66,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(ennf_transformation,[],[f28]) ).
fof(f67,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f68,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f70,plain,
( and_2
| ~ is_a_theorem(implies(and(sK0,sK1),sK1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f59]) ).
fof(f71,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f57]) ).
fof(f73,plain,
( and_2
| ~ is_a_theorem(implies(and(sK0,sK1),sK1)) ),
inference(cnf_transformation,[],[f70]) ).
fof(f75,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(cnf_transformation,[],[f61]) ).
fof(f76,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(cnf_transformation,[],[f62]) ).
fof(f79,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f65]) ).
fof(f80,plain,
! [X0,X1] :
( and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(cnf_transformation,[],[f66]) ).
fof(f81,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f67]) ).
fof(f82,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f68]) ).
fof(f84,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f85,plain,
op_and,
inference(cnf_transformation,[],[f33]) ).
fof(f87,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f89,plain,
r2,
inference(cnf_transformation,[],[f37]) ).
fof(f90,plain,
r3,
inference(cnf_transformation,[],[f38]) ).
fof(f94,plain,
op_or,
inference(cnf_transformation,[],[f42]) ).
fof(f95,plain,
op_implies_and,
inference(cnf_transformation,[],[f43]) ).
fof(f97,plain,
~ and_2,
inference(cnf_transformation,[],[f47]) ).
fof(f107,definition,
( spl2_3
<=> op_implies_or ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f111,definition,
( spl2_4
<=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
fof(f112,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f111]) ).
fof(f113,plain,
( ~ spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f82,f111,f107]) ).
fof(f115,definition,
( spl2_5
<=> op_implies_and ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
fof(f119,definition,
( spl2_6
<=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition]) ).
fof(f120,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ spl2_6 ),
inference(avatar_component_clause,[],[f119]) ).
fof(f121,plain,
( ~ spl2_5
| spl2_6 ),
inference(avatar_split_clause,[],[f81,f119,f115]) ).
fof(f123,definition,
( spl2_7
<=> op_and ),
introduced(definition,[new_symbols(definition,[spl2_7])],[avatar_definition]) ).
fof(f127,definition,
( spl2_8
<=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
introduced(definition,[new_symbols(definition,[spl2_8])],[avatar_definition]) ).
fof(f128,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ spl2_8 ),
inference(avatar_component_clause,[],[f127]) ).
fof(f129,plain,
( ~ spl2_7
| spl2_8 ),
inference(avatar_split_clause,[],[f80,f127,f123]) ).
fof(f131,definition,
( spl2_9
<=> op_or ),
introduced(definition,[new_symbols(definition,[spl2_9])],[avatar_definition]) ).
fof(f135,definition,
( spl2_10
<=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
introduced(definition,[new_symbols(definition,[spl2_10])],[avatar_definition]) ).
fof(f136,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ spl2_10 ),
inference(avatar_component_clause,[],[f135]) ).
fof(f137,plain,
( ~ spl2_9
| spl2_10 ),
inference(avatar_split_clause,[],[f79,f135,f131]) ).
fof(f155,definition,
( spl2_15
<=> r3 ),
introduced(definition,[new_symbols(definition,[spl2_15])],[avatar_definition]) ).
fof(f159,definition,
( spl2_16
<=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
introduced(definition,[new_symbols(definition,[spl2_16])],[avatar_definition]) ).
fof(f160,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ spl2_16 ),
inference(avatar_component_clause,[],[f159]) ).
fof(f161,plain,
( ~ spl2_15
| spl2_16 ),
inference(avatar_split_clause,[],[f76,f159,f155]) ).
fof(f163,definition,
( spl2_17
<=> r2 ),
introduced(definition,[new_symbols(definition,[spl2_17])],[avatar_definition]) ).
fof(f167,definition,
( spl2_18
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
introduced(definition,[new_symbols(definition,[spl2_18])],[avatar_definition]) ).
fof(f168,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ spl2_18 ),
inference(avatar_component_clause,[],[f167]) ).
fof(f169,plain,
( ~ spl2_17
| spl2_18 ),
inference(avatar_split_clause,[],[f75,f167,f163]) ).
fof(f179,definition,
( spl2_21
<=> is_a_theorem(implies(and(sK0,sK1),sK1)) ),
introduced(definition,[new_symbols(definition,[spl2_21])],[avatar_definition]) ).
fof(f181,plain,
( ~ is_a_theorem(implies(and(sK0,sK1),sK1))
| spl2_21 ),
inference(avatar_component_clause,[],[f179]) ).
fof(f183,definition,
( spl2_22
<=> and_2 ),
introduced(definition,[new_symbols(definition,[spl2_22])],[avatar_definition]) ).
fof(f186,plain,
( ~ spl2_21
| spl2_22 ),
inference(avatar_split_clause,[],[f73,f183,f179]) ).
fof(f196,definition,
( spl2_25
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[spl2_25])],[avatar_definition]) ).
fof(f200,definition,
( spl2_26
<=> ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ) ),
introduced(definition,[new_symbols(definition,[spl2_26])],[avatar_definition]) ).
fof(f201,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl2_26 ),
inference(avatar_component_clause,[],[f200]) ).
fof(f202,plain,
( ~ spl2_25
| spl2_26 ),
inference(avatar_split_clause,[],[f71,f200,f196]) ).
fof(f203,plain,
~ spl2_22,
inference(avatar_split_clause,[],[f97,f183]) ).
fof(f206,plain,
spl2_3,
inference(avatar_split_clause,[],[f84,f107]) ).
fof(f209,plain,
( ! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1)))
| ~ spl2_4
| ~ spl2_8 ),
inference(forward_demodulation,[],[f128,f112]) ).
fof(f210,plain,
spl2_7,
inference(avatar_split_clause,[],[f85,f123]) ).
fof(f216,plain,
spl2_25,
inference(avatar_split_clause,[],[f87,f196]) ).
fof(f222,plain,
spl2_17,
inference(avatar_split_clause,[],[f89,f163]) ).
fof(f225,plain,
spl2_15,
inference(avatar_split_clause,[],[f90,f155]) ).
fof(f237,plain,
spl2_9,
inference(avatar_split_clause,[],[f94,f131]) ).
fof(f240,plain,
spl2_5,
inference(avatar_split_clause,[],[f95,f115]) ).
fof(f241,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,implies(X0,X1)))
| ~ spl2_4
| ~ spl2_18 ),
inference(superposition,[],[f168,f112]) ).
fof(f245,plain,
( ! [X0] :
( ~ is_a_theorem(implies(X0,implies(and(sK0,sK1),sK1)))
| ~ is_a_theorem(X0) )
| spl2_21
| ~ spl2_26 ),
inference(resolution,[],[f201,f181]) ).
fof(f258,plain,
( ! [X0,X1] : or(X0,X1) = implies(not(X0),X1)
| ~ spl2_6
| ~ spl2_10 ),
inference(forward_demodulation,[],[f136,f120]) ).
fof(f260,plain,
( ! [X2,X0,X1] : or(implies(X0,not(X1)),X2) = implies(and(X0,X1),X2)
| ~ spl2_4
| ~ spl2_6
| ~ spl2_8
| ~ spl2_10 ),
inference(superposition,[],[f258,f209]) ).
fof(f263,plain,
( ! [X0,X1] : is_a_theorem(or(X0,implies(X1,not(X0))))
| ~ spl2_4
| ~ spl2_6
| ~ spl2_10
| ~ spl2_18 ),
inference(superposition,[],[f241,f258]) ).
fof(f432,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(or(X2,implies(X0,not(X1))),implies(and(X0,X1),X2)))
| ~ spl2_4
| ~ spl2_6
| ~ spl2_8
| ~ spl2_10
| ~ spl2_16 ),
inference(superposition,[],[f160,f260]) ).
fof(f1961,plain,
( ~ is_a_theorem(or(sK1,implies(sK0,not(sK1))))
| ~ spl2_4
| ~ spl2_6
| ~ spl2_8
| ~ spl2_10
| ~ spl2_16
| spl2_21
| ~ spl2_26 ),
inference(resolution,[],[f432,f245]) ).
fof(f1994,plain,
( $false
| ~ spl2_4
| ~ spl2_6
| ~ spl2_8
| ~ spl2_10
| ~ spl2_16
| ~ spl2_18
| spl2_21
| ~ spl2_26 ),
inference(forward_subsumption_resolution,[],[f1961,f263]) ).
fof(f1995,plain,
( ~ spl2_4
| ~ spl2_6
| ~ spl2_8
| ~ spl2_10
| ~ spl2_16
| ~ spl2_18
| spl2_21
| ~ spl2_26 ),
inference(avatar_contradiction_clause,[],[f1994]) ).
cnf(s2,plain,
( ~ spl2_3
| spl2_4 ),
inference(sat_conversion,[],[f113]) ).
cnf(s3,plain,
( ~ spl2_5
| spl2_6 ),
inference(sat_conversion,[],[f121]) ).
cnf(s4,plain,
( ~ spl2_7
| spl2_8 ),
inference(sat_conversion,[],[f129]) ).
cnf(s5,plain,
( ~ spl2_9
| spl2_10 ),
inference(sat_conversion,[],[f137]) ).
cnf(s8,plain,
( ~ spl2_15
| spl2_16 ),
inference(sat_conversion,[],[f161]) ).
cnf(s9,plain,
( ~ spl2_17
| spl2_18 ),
inference(sat_conversion,[],[f169]) ).
cnf(s11,plain,
( ~ spl2_21
| spl2_22 ),
inference(sat_conversion,[],[f186]) ).
cnf(s13,plain,
( ~ spl2_25
| spl2_26 ),
inference(sat_conversion,[],[f202]) ).
cnf(s14,plain,
~ spl2_22,
inference(sat_conversion,[],[f203]) ).
cnf(s16,plain,
spl2_3,
inference(sat_conversion,[],[f206]) ).
cnf(s18,plain,
spl2_7,
inference(sat_conversion,[],[f210]) ).
cnf(s22,plain,
spl2_25,
inference(sat_conversion,[],[f216]) ).
cnf(s26,plain,
spl2_17,
inference(sat_conversion,[],[f222]) ).
cnf(s28,plain,
spl2_15,
inference(sat_conversion,[],[f225]) ).
cnf(s36,plain,
spl2_9,
inference(sat_conversion,[],[f237]) ).
cnf(s38,plain,
spl2_5,
inference(sat_conversion,[],[f240]) ).
cnf(s39,plain,
( ~ spl2_4
| ~ spl2_6
| ~ spl2_8
| ~ spl2_10
| ~ spl2_16
| ~ spl2_18
| spl2_21
| ~ spl2_26 ),
inference(sat_conversion,[],[f1995]) ).
cnf(s40,plain,
spl2_26,
inference(rat,[],[s13,s22]) ).
cnf(s42,plain,
~ spl2_21,
inference(rat,[],[s11,s14]) ).
cnf(s44,plain,
spl2_18,
inference(rat,[],[s9,s26]) ).
cnf(s45,plain,
spl2_16,
inference(rat,[],[s8,s28]) ).
cnf(s48,plain,
spl2_10,
inference(rat,[],[s5,s36]) ).
cnf(s49,plain,
spl2_8,
inference(rat,[],[s4,s18]) ).
cnf(s50,plain,
spl2_6,
inference(rat,[],[s3,s38]) ).
cnf(s51,plain,
~ spl2_4,
inference(rat,[],[s39,s40,s42,s44,s45,s48,s49,s50]) ).
cnf(s52,plain,
$false,
inference(rat,[],[s2,s51,s16]) ).
fof(f2001,plain,
$false,
inference(avatar_sat_refutation,[],[s52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL488+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.10/0.37 % Computer : n006.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 15:50:25 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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
% 3.40/1.35 % (3129710)Detected formulas, will run a generic FOF schedule.
% 3.40/1.35 % (3129719)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1194431183:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.40/1.35 % (3129719)Refutation not found, incomplete strategy
% 3.40/1.35 % (3129719)------------------------------
% 3.40/1.35 % (3129719)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.35 % (3129719)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.35 % (3129719)CaDiCaL version: 2.1.3
% 3.40/1.35 % (3129719)Termination reason: Refutation not found, incomplete strategy
% 3.40/1.35 % (3129719)Time elapsed: 0.0000 s
% 3.40/1.35 % (3129719)Peak memory usage: 87 MB
% 3.40/1.35 % (3129721)dis-21_1_sil=8000:lcm=predicate:random_seed=4254246183: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.40/1.35 % (3129717)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=258950719:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.40/1.35 % (3129718)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=836846478:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.40/1.35 % (3129716)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=2923328370:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.40/1.35 % (3129715)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=3164392095:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.40/1.35 % (3129718)Refutation not found, incomplete strategy
% 3.40/1.35 % (3129718)------------------------------
% 3.40/1.35 % (3129718)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.35 % (3129718)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.35 % (3129718)CaDiCaL version: 2.1.3
% 3.40/1.35 % (3129718)Termination reason: Refutation not found, incomplete strategy
% 3.40/1.35 % (3129718)Time elapsed: 0.001 s
% 3.40/1.35 % (3129718)Peak memory usage: 87 MB
% 3.40/1.35 % (3129721)Refutation not found, incomplete strategy
% 3.40/1.35 % (3129721)------------------------------
% 3.40/1.35 % (3129721)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.35 % (3129721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.35 % (3129721)CaDiCaL version: 2.1.3
% 3.40/1.35 % (3129721)Termination reason: Refutation not found, incomplete strategy
% 3.40/1.35 % (3129721)Time elapsed: 0.002 s
% 3.40/1.35 % (3129721)Peak memory usage: 88 MB
% 3.40/1.35 % (3129721)Instructions burned: 1 (million)
% 3.40/1.35 % (3129720)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3091196149:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.40/1.35 % (3129720)First to succeed.
% 3.40/1.35 % (3129720)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3129710"
% 3.40/1.35 % (3129719)------------------------------
% 3.40/1.35 % (3129719)------------------------------
% 3.40/1.35 % (3129721)------------------------------
% 3.40/1.35 % (3129721)------------------------------
% 3.40/1.35 % (3129718)------------------------------
% 3.40/1.35 % (3129718)------------------------------
% 3.40/1.35 % (3129729)lrs+10_1_sil=8000:sp=occurrence:random_seed=2190970119:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.40/1.35 % (3129729)Refutation not found, incomplete strategy
% 3.40/1.35 % (3129729)------------------------------
% 3.40/1.35 % (3129729)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.35 % (3129729)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.35 % (3129729)CaDiCaL version: 2.1.3
% 3.40/1.35 % (3129729)Termination reason: Refutation not found, incomplete strategy
% 3.40/1.35 % (3129729)Time elapsed: 0.0000 s
% 3.40/1.35 % (3129729)Peak memory usage: 87 MB
% 3.40/1.35 % (3129720)Refutation found. Thanks to Tanya!
% 3.40/1.35 % SZS status Theorem for theBenchmark
% 3.40/1.35 % SZS output start Proof for theBenchmark
% See solution above
% 4.16/1.54 % (3129720)------------------------------
% 4.16/1.54 % (3129720)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.16/1.54 % (3129720)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.54 % (3129720)CaDiCaL version: 2.1.3
% 4.16/1.54 % (3129720)Termination reason: Refutation
% 4.16/1.54 % (3129720)Time elapsed: 0.047 s
% 4.16/1.54 % (3129720)Peak memory usage: 90 MB
% 4.16/1.54 % (3129720)Instructions burned: 68 (million)
% 4.16/1.54 % (3129720)------------------------------
% 4.16/1.54 % (3129720)------------------------------
% 4.16/1.54 % (3129710)Success in time 0.498 s
% 4.16/1.54 % Vampire exiting
%------------------------------------------------------------------------------