%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC030+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 01:02:07 PM UTC 2026
% Result : Theorem 2.82s 1.27s
% Output : Refutation 3.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 16
% Syntax : Number of formulae : 114 ( 18 unt; 14 def)
% Number of atoms : 347 ( 117 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 371 ( 138 ~; 165 |; 44 &)
% ( 10 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 9 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 32 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X4,X5) != X3
| app(X5,X4) != X2 ) ) )
| ( ( nil != X1
| nil = X0 )
& ( nil != X0
| nil = X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X4,X5) != X3
| app(X5,X4) != X2 ) ) )
| ( ( nil != X1
| nil = X0 )
& ( nil != X0
| nil = X1 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(X4,X5) = X3
& app(X5,X4) = X2
& ssList(X5) )
& ssList(X4) )
& ( ( nil = X1
& nil != X0 )
| ( nil = X0
& nil != X1 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f101,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(X4,X5) = X3
& app(X5,X4) = X2
& ssList(X5) )
& ssList(X4) )
& ( ( nil = X1
& nil != X0 )
| ( nil = X0
& nil != X1 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f100]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f111,plain,
( sK1 = sK3
& sK0 = sK2
& sK3 = app(sK4,sK5)
& sK2 = app(sK5,sK4)
& ssList(sK5)
& ssList(sK4)
& ( ( nil = sK1
& nil != sK0 )
| ( nil = sK0
& nil != sK1 ) )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f101]) ).
fof(f112,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f113,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f112]) ).
fof(f118,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f111]) ).
fof(f121,plain,
( nil = sK1
| nil = sK0 ),
inference(cnf_transformation,[],[f111]) ).
fof(f122,plain,
ssList(sK4),
inference(cnf_transformation,[],[f111]) ).
fof(f123,plain,
ssList(sK5),
inference(cnf_transformation,[],[f111]) ).
fof(f124,plain,
sK2 = app(sK5,sK4),
inference(cnf_transformation,[],[f111]) ).
fof(f125,plain,
sK3 = app(sK4,sK5),
inference(cnf_transformation,[],[f111]) ).
fof(f126,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f111]) ).
fof(f127,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f111]) ).
fof(f129,plain,
! [X0,X1] :
( nil = X0
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f130,plain,
! [X0,X1] :
( nil = X1
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f131,plain,
! [X0,X1] :
( nil = app(X0,X1)
| nil != X1
| nil != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f138,plain,
( nil = sK3
| nil = sK2 ),
inference(definition_unfolding,[],[f121,f127,f126]) ).
fof(f141,plain,
( nil != sK2
| nil != sK3 ),
inference(definition_unfolding,[],[f118,f126,f127]) ).
fof(f148,definition,
~ sP8(nil),
introduced(definition,[new_symbols(definition,[sP8])],[inequality_splitting_name_introduction]) ).
fof(f149,definition,
~ sP9(nil),
introduced(definition,[new_symbols(definition,[sP9])],[inequality_splitting_name_introduction]) ).
fof(f150,plain,
( sP8(sK2)
| sP9(sK3) ),
inference(inequality_splitting,[],[f141,f149,f148]) ).
fof(f151,definition,
~ sP10(nil),
introduced(definition,[new_symbols(definition,[sP10])],[inequality_splitting_name_introduction]) ).
fof(f152,definition,
~ sP11(nil),
introduced(definition,[new_symbols(definition,[sP11])],[inequality_splitting_name_introduction]) ).
fof(f153,plain,
! [X0,X1] :
( nil = app(X0,X1)
| sP10(X1)
| sP11(X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(inequality_splitting,[],[f131,f152,f151]) ).
fof(f154,definition,
~ sP12(nil),
introduced(definition,[new_symbols(definition,[sP12])],[inequality_splitting_name_introduction]) ).
fof(f155,plain,
! [X0,X1] :
( sP12(app(X0,X1))
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(inequality_splitting,[],[f130,f154]) ).
fof(f156,definition,
~ sP13(nil),
introduced(definition,[new_symbols(definition,[sP13])],[inequality_splitting_name_introduction]) ).
fof(f157,plain,
! [X0,X1] :
( sP13(app(X0,X1))
| nil = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(inequality_splitting,[],[f129,f156]) ).
fof(f159,definition,
( spl14_1
<=> sP9(sK3) ),
introduced(definition,[new_symbols(definition,[spl14_1])],[avatar_definition]) ).
fof(f161,plain,
( sP9(sK3)
| ~ spl14_1 ),
inference(avatar_component_clause,[],[f159]) ).
fof(f163,definition,
( spl14_2
<=> sP8(sK2) ),
introduced(definition,[new_symbols(definition,[spl14_2])],[avatar_definition]) ).
fof(f165,plain,
( sP8(sK2)
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f163]) ).
fof(f166,plain,
( spl14_1
| spl14_2 ),
inference(avatar_split_clause,[],[f150,f163,f159]) ).
fof(f168,definition,
( spl14_3
<=> nil = sK2 ),
introduced(definition,[new_symbols(definition,[spl14_3])],[avatar_definition]) ).
fof(f169,plain,
( nil != sK2
| spl14_3 ),
inference(avatar_component_clause,[],[f168]) ).
fof(f170,plain,
( nil = sK2
| ~ spl14_3 ),
inference(avatar_component_clause,[],[f168]) ).
fof(f181,definition,
( spl14_6
<=> nil = sK3 ),
introduced(definition,[new_symbols(definition,[spl14_6])],[avatar_definition]) ).
fof(f183,plain,
( nil = sK3
| ~ spl14_6 ),
inference(avatar_component_clause,[],[f181]) ).
fof(f185,plain,
( spl14_3
| spl14_6 ),
inference(avatar_split_clause,[],[f138,f181,f168]) ).
fof(f186,plain,
( sP8(nil)
| ~ spl14_2
| ~ spl14_3 ),
inference(superposition,[],[f165,f170]) ).
fof(f188,plain,
( $false
| ~ spl14_2
| ~ spl14_3 ),
inference(forward_subsumption_resolution,[],[f186,f148]) ).
fof(f189,plain,
( ~ spl14_2
| ~ spl14_3 ),
inference(avatar_contradiction_clause,[],[f188]) ).
fof(f191,plain,
( nil = sK2
| sP10(sK4)
| sP11(sK5)
| ~ ssList(sK4)
| ~ ssList(sK5) ),
inference(superposition,[],[f124,f153]) ).
fof(f199,plain,
( sP12(sK2)
| nil = sK4
| ~ ssList(sK4)
| ~ ssList(sK5) ),
inference(superposition,[],[f155,f124]) ).
fof(f200,plain,
( sP13(sK2)
| nil = sK5
| ~ ssList(sK4)
| ~ ssList(sK5) ),
inference(superposition,[],[f157,f124]) ).
fof(f201,plain,
( sP13(sK2)
| nil = sK5
| ~ ssList(sK5) ),
inference(forward_subsumption_resolution,[],[f200,f122]) ).
fof(f202,plain,
( sP12(sK2)
| nil = sK4
| ~ ssList(sK5) ),
inference(forward_subsumption_resolution,[],[f199,f122]) ).
fof(f208,plain,
( sP13(sK2)
| nil = sK5 ),
inference(forward_subsumption_resolution,[],[f201,f123]) ).
fof(f209,plain,
( sP12(sK2)
| nil = sK4 ),
inference(forward_subsumption_resolution,[],[f202,f123]) ).
fof(f215,plain,
( sP13(nil)
| nil = sK5
| ~ spl14_3 ),
inference(forward_demodulation,[],[f208,f170]) ).
fof(f216,plain,
( sP12(nil)
| nil = sK4
| ~ spl14_3 ),
inference(forward_demodulation,[],[f209,f170]) ).
fof(f222,plain,
( nil = sK5
| ~ spl14_3 ),
inference(forward_subsumption_resolution,[],[f215,f156]) ).
fof(f223,plain,
( nil = sK4
| ~ spl14_3 ),
inference(forward_subsumption_resolution,[],[f216,f154]) ).
fof(f231,plain,
( nil = sK3
| sP10(sK5)
| sP11(sK4)
| ~ ssList(sK5)
| ~ ssList(sK4) ),
inference(superposition,[],[f153,f125]) ).
fof(f232,plain,
( sP12(sK3)
| nil = sK5
| ~ ssList(sK5)
| ~ ssList(sK4) ),
inference(superposition,[],[f155,f125]) ).
fof(f233,plain,
( sP13(sK3)
| nil = sK4
| ~ ssList(sK5)
| ~ ssList(sK4) ),
inference(superposition,[],[f157,f125]) ).
fof(f234,plain,
( nil = sK3
| sP10(sK5)
| sP11(sK4)
| ~ ssList(sK4) ),
inference(forward_subsumption_resolution,[],[f231,f123]) ).
fof(f241,plain,
( nil = sK3
| sP10(sK5)
| sP11(sK4) ),
inference(forward_subsumption_resolution,[],[f234,f122]) ).
fof(f248,plain,
( sP10(nil)
| nil = sK3
| sP11(sK4)
| ~ spl14_3 ),
inference(forward_demodulation,[],[f241,f222]) ).
fof(f255,plain,
( nil = sK3
| sP11(sK4)
| ~ spl14_3 ),
inference(forward_subsumption_resolution,[],[f248,f151]) ).
fof(f262,plain,
( sP11(nil)
| nil = sK3
| ~ spl14_3 ),
inference(forward_demodulation,[],[f255,f223]) ).
fof(f264,plain,
( nil = sK3
| ~ spl14_3 ),
inference(forward_subsumption_resolution,[],[f262,f152]) ).
fof(f266,plain,
( spl14_6
| ~ spl14_3 ),
inference(avatar_split_clause,[],[f264,f168,f181]) ).
fof(f267,plain,
( sP9(nil)
| ~ spl14_1
| ~ spl14_6 ),
inference(superposition,[],[f161,f183]) ).
fof(f272,plain,
( $false
| ~ spl14_1
| ~ spl14_6 ),
inference(forward_subsumption_resolution,[],[f267,f149]) ).
fof(f273,plain,
( ~ spl14_1
| ~ spl14_6 ),
inference(avatar_contradiction_clause,[],[f272]) ).
fof(f277,plain,
( sP10(sK4)
| sP11(sK5)
| ~ ssList(sK4)
| ~ ssList(sK5)
| spl14_3 ),
inference(forward_subsumption_resolution,[],[f191,f169]) ).
fof(f279,definition,
( spl14_7
<=> nil = sK5 ),
introduced(definition,[new_symbols(definition,[spl14_7])],[avatar_definition]) ).
fof(f281,plain,
( nil = sK5
| ~ spl14_7 ),
inference(avatar_component_clause,[],[f279]) ).
fof(f288,definition,
( spl14_9
<=> nil = sK4 ),
introduced(definition,[new_symbols(definition,[spl14_9])],[avatar_definition]) ).
fof(f290,plain,
( nil = sK4
| ~ spl14_9 ),
inference(avatar_component_clause,[],[f288]) ).
fof(f296,plain,
( sP13(sK3)
| nil = sK4
| ~ ssList(sK4) ),
inference(forward_subsumption_resolution,[],[f233,f123]) ).
fof(f297,plain,
( sP12(sK3)
| nil = sK5
| ~ ssList(sK4) ),
inference(forward_subsumption_resolution,[],[f232,f123]) ).
fof(f304,plain,
( sP10(sK4)
| sP11(sK5)
| ~ ssList(sK5)
| spl14_3 ),
inference(forward_subsumption_resolution,[],[f277,f122]) ).
fof(f305,plain,
( sP13(sK3)
| nil = sK4 ),
inference(forward_subsumption_resolution,[],[f296,f122]) ).
fof(f306,plain,
( sP12(sK3)
| nil = sK5 ),
inference(forward_subsumption_resolution,[],[f297,f122]) ).
fof(f308,plain,
( sP10(sK4)
| sP11(sK5)
| spl14_3 ),
inference(forward_subsumption_resolution,[],[f304,f123]) ).
fof(f309,plain,
( sP13(nil)
| nil = sK4
| ~ spl14_6 ),
inference(forward_demodulation,[],[f305,f183]) ).
fof(f310,plain,
( sP12(nil)
| nil = sK5
| ~ spl14_6 ),
inference(forward_demodulation,[],[f306,f183]) ).
fof(f312,definition,
( spl14_11
<=> sP11(sK5) ),
introduced(definition,[new_symbols(definition,[spl14_11])],[avatar_definition]) ).
fof(f314,plain,
( sP11(sK5)
| ~ spl14_11 ),
inference(avatar_component_clause,[],[f312]) ).
fof(f316,definition,
( spl14_12
<=> sP10(sK4) ),
introduced(definition,[new_symbols(definition,[spl14_12])],[avatar_definition]) ).
fof(f318,plain,
( sP10(sK4)
| ~ spl14_12 ),
inference(avatar_component_clause,[],[f316]) ).
fof(f320,plain,
( spl14_11
| spl14_12
| spl14_3 ),
inference(avatar_split_clause,[],[f308,f168,f316,f312]) ).
fof(f321,plain,
( nil = sK4
| ~ spl14_6 ),
inference(forward_subsumption_resolution,[],[f309,f156]) ).
fof(f322,plain,
( nil = sK5
| ~ spl14_6 ),
inference(forward_subsumption_resolution,[],[f310,f154]) ).
fof(f323,plain,
( spl14_9
| ~ spl14_6 ),
inference(avatar_split_clause,[],[f321,f181,f288]) ).
fof(f324,plain,
( spl14_7
| ~ spl14_6 ),
inference(avatar_split_clause,[],[f322,f181,f279]) ).
fof(f325,plain,
( sP11(nil)
| ~ spl14_7
| ~ spl14_11 ),
inference(forward_demodulation,[],[f314,f281]) ).
fof(f326,plain,
( $false
| ~ spl14_7
| ~ spl14_11 ),
inference(forward_subsumption_resolution,[],[f325,f152]) ).
fof(f327,plain,
( ~ spl14_7
| ~ spl14_11 ),
inference(avatar_contradiction_clause,[],[f326]) ).
fof(f329,plain,
( sP10(nil)
| ~ spl14_9
| ~ spl14_12 ),
inference(forward_demodulation,[],[f318,f290]) ).
fof(f330,plain,
( $false
| ~ spl14_9
| ~ spl14_12 ),
inference(forward_subsumption_resolution,[],[f329,f151]) ).
fof(f331,plain,
( ~ spl14_9
| ~ spl14_12 ),
inference(avatar_contradiction_clause,[],[f330]) ).
cnf(s1,plain,
( spl14_1
| spl14_2 ),
inference(sat_conversion,[],[f166]) ).
cnf(s4,plain,
( spl14_3
| spl14_6 ),
inference(sat_conversion,[],[f185]) ).
cnf(s5,plain,
( ~ spl14_2
| ~ spl14_3 ),
inference(sat_conversion,[],[f189]) ).
cnf(s6,plain,
( ~ spl14_3
| spl14_6 ),
inference(sat_conversion,[],[f266]) ).
cnf(s9,plain,
( ~ spl14_1
| ~ spl14_6 ),
inference(sat_conversion,[],[f273]) ).
cnf(s13,plain,
( spl14_3
| spl14_11
| spl14_12 ),
inference(sat_conversion,[],[f320]) ).
cnf(s14,plain,
( ~ spl14_6
| spl14_9 ),
inference(sat_conversion,[],[f323]) ).
cnf(s15,plain,
( ~ spl14_6
| spl14_7 ),
inference(sat_conversion,[],[f324]) ).
cnf(s16,plain,
( ~ spl14_7
| ~ spl14_11 ),
inference(sat_conversion,[],[f327]) ).
cnf(s17,plain,
( ~ spl14_9
| ~ spl14_12 ),
inference(sat_conversion,[],[f331]) ).
cnf(s18,plain,
spl14_3,
inference(rat,[],[s13,s17,s16,s14,s15,s4]) ).
cnf(s19,plain,
spl14_6,
inference(rat,[],[s6,s18]) ).
cnf(s20,plain,
~ spl14_2,
inference(rat,[],[s5,s18]) ).
cnf(s23,plain,
~ spl14_1,
inference(rat,[],[s9,s19]) ).
cnf(s25,plain,
$false,
inference(rat,[],[s1,s20,s23]) ).
fof(f332,plain,
$false,
inference(avatar_sat_refutation,[],[s25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC030+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n011.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 28 07:31:15 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.39 Running first-order theorem proving
% 0.08/0.39 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.82/1.27 % (3226035)Detected formulas, will run a generic FOF schedule.
% 2.82/1.27 % (3226046)dis-21_1_sil=8000:lcm=predicate:random_seed=2029697516: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)
% 2.82/1.27 % (3226046)Instruction limit reached!
% 2.82/1.27 % (3226046)------------------------------
% 2.82/1.27 % (3226046)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.82/1.27 % (3226046)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.82/1.27 % (3226046)CaDiCaL version: 2.1.3
% 2.82/1.27 % (3226046)Termination reason: Instruction limit
% 2.82/1.27 % (3226046)Termination phase: Saturation
% 2.82/1.27 % (3226046)Time elapsed: 0.041 s
% 2.82/1.27 % (3226046)Peak memory usage: 90 MB
% 2.82/1.27 % (3226046)Instructions burned: 132 (million)
% 2.82/1.27 % (3226044)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3771320346:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.82/1.27 % (3226045)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2570203231:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.82/1.27 % (3226040)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=3630263867:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.82/1.27 % (3226041)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=1195534999:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.82/1.27 % (3226042)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=3542424762:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.82/1.27 % (3226043)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3540173528:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.82/1.27 % (3226043)First to succeed.
% 2.82/1.27 % (3226043)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3226035"
% 2.82/1.27 % (3226044)Also succeeded, but the first one will report.
% 2.82/1.27 % (3226045)Also succeeded, but the first one will report.
% 2.82/1.27 % (3226054)lrs+10_1_sil=8000:sp=occurrence:random_seed=1743941228:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.82/1.27 % (3226054)Also succeeded, but the first one will report.
% 2.82/1.27 % (3226043)Refutation found. Thanks to Tanya!
% 2.82/1.27 % SZS status Theorem for theBenchmark
% 2.82/1.27 % SZS output start Proof for theBenchmark
% See solution above
% 3.59/1.37 % (3226043)------------------------------
% 3.59/1.37 % (3226043)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.59/1.37 % (3226043)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.59/1.37 % (3226043)CaDiCaL version: 2.1.3
% 3.59/1.37 % (3226043)Termination reason: Refutation
% 3.59/1.37 % (3226043)Time elapsed: 0.006 s
% 3.59/1.37 % (3226043)Peak memory usage: 89 MB
% 3.59/1.37 % (3226043)Instructions burned: 7 (million)
% 3.59/1.37 % (3226043)------------------------------
% 3.59/1.37 % (3226043)------------------------------
% 3.59/1.37 % (3226035)Success in time 0.446 s
% 3.59/1.37 % Vampire exiting
%------------------------------------------------------------------------------