%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC422+1 : TPTP v9.3.1. Released v2.4.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 01:03:55 PM UTC 2026
% Result : Theorem 3.47s 1.29s
% Output : Refutation 4.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 4
% Syntax : Number of formulae : 47 ( 7 unt; 3 def)
% Number of atoms : 224 ( 53 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 277 ( 100 ~; 87 |; 74 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 129 ( 0 sgn 96 !; 33 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X1
& app(app(X6,cons(X4,nil)),X5) = X0 ) ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(X8,cons(X7,nil)),X9) != X3
| app(app(X9,cons(X7,nil)),X8) != X2 ) ) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X1
& app(app(X6,cons(X4,nil)),X5) = X0 ) ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(X8,cons(X7,nil)),X9) != X3
| app(app(X9,cons(X7,nil)),X8) != X2 ) ) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X1
| app(app(X6,cons(X4,nil)),X5) != X0 ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(X8,cons(X7,nil)),X9) = X3
& app(app(X9,cons(X7,nil)),X8) = X2
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X1
| app(app(X6,cons(X4,nil)),X5) != X0 ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(X8,cons(X7,nil)),X9) = X3
& app(app(X9,cons(X7,nil)),X8) = X2
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f120,definition,
! [X1,X0,X3,X2] :
( ( neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X1
| app(app(X6,cons(X4,nil)),X5) != X0 ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(X8,cons(X7,nil)),X9) = X3
& app(app(X9,cons(X7,nil)),X8) = X2
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) ) )
| ~ sP0(X1,X0,X3,X2) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f121,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( sP0(X1,X0,X3,X2)
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f120]) ).
fof(f122,plain,
! [X1,X0,X3,X2] :
( ( neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X1
| app(app(X6,cons(X4,nil)),X5) != X0 ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(X8,cons(X7,nil)),X9) = X3
& app(app(X9,cons(X7,nil)),X8) = X2
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) ) )
| ~ sP0(X1,X0,X3,X2) ),
inference(nnf_transformation,[],[f120]) ).
fof(f123,plain,
! [X0,X1,X2,X3] :
( ( neq(X0,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| app(app(X6,cons(X4,nil)),X5) != X1 ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(X8,cons(X7,nil)),X9) = X2
& app(app(X9,cons(X7,nil)),X8) = X3
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) ) )
| ~ sP0(X0,X1,X2,X3) ),
inference(rectify,[],[f122]) ).
fof(f124,plain,
! [X0,X1,X2,X3] :
( ( neq(X0,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| app(app(X6,cons(X4,nil)),X5) != X1 ) ) )
& app(app(sK2(X2,X3),cons(sK1(X2,X3),nil)),sK3(X2,X3)) = X2
& app(app(sK3(X2,X3),cons(sK1(X2,X3),nil)),sK2(X2,X3)) = X3
& ssList(sK3(X2,X3))
& ssList(sK2(X2,X3))
& ssItem(sK1(X2,X3)) )
| ~ sP0(X0,X1,X2,X3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X7,sK1(X2,X3)),skolemize(X8,sK2(X2,X3)),skolemize(X9,sK3(X2,X3))],[f123]) ).
fof(f125,plain,
( sK5 = sK7
& sK4 = sK6
& ( sP0(sK5,sK4,sK7,sK6)
| ( neq(sK5,nil)
& ~ neq(sK7,nil) ) )
& ssList(sK7)
& ssList(sK6)
& ssList(sK5)
& ssList(sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6),skolemize(X3,sK7)],[f121]) ).
fof(f132,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ssItem(sK1(X2,X3)) ),
inference(cnf_transformation,[],[f124]) ).
fof(f133,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ssList(sK2(X2,X3)) ),
inference(cnf_transformation,[],[f124]) ).
fof(f134,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ssList(sK3(X2,X3)) ),
inference(cnf_transformation,[],[f124]) ).
fof(f135,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| app(app(sK3(X2,X3),cons(sK1(X2,X3),nil)),sK2(X2,X3)) = X3 ),
inference(cnf_transformation,[],[f124]) ).
fof(f136,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| app(app(sK2(X2,X3),cons(sK1(X2,X3),nil)),sK3(X2,X3)) = X2 ),
inference(cnf_transformation,[],[f124]) ).
fof(f137,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| app(app(X6,cons(X4,nil)),X5) != X1
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f124]) ).
fof(f143,plain,
( sP0(sK5,sK4,sK7,sK6)
| ~ neq(sK7,nil) ),
inference(cnf_transformation,[],[f125]) ).
fof(f144,plain,
( sP0(sK5,sK4,sK7,sK6)
| neq(sK5,nil) ),
inference(cnf_transformation,[],[f125]) ).
fof(f145,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f125]) ).
fof(f146,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f125]) ).
fof(f174,plain,
( sP0(sK7,sK6,sK7,sK6)
| neq(sK7,nil) ),
inference(definition_unfolding,[],[f144,f146,f145,f146]) ).
fof(f175,plain,
( sP0(sK7,sK6,sK7,sK6)
| ~ neq(sK7,nil) ),
inference(definition_unfolding,[],[f143,f146,f145]) ).
fof(f178,plain,
! [X2,X3,X1,X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X6,cons(X4,nil)),X5) != X1
| ~ sP0(app(app(X5,cons(X4,nil)),X6),X1,X2,X3) ),
inference(equality_resolution,[],[f137]) ).
fof(f179,plain,
! [X2,X3,X6,X4,X5] :
( ~ sP0(app(app(X5,cons(X4,nil)),X6),app(app(X6,cons(X4,nil)),X5),X2,X3)
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4) ),
inference(equality_resolution,[],[f178]) ).
fof(f188,definition,
( spl12_1
<=> neq(sK7,nil) ),
introduced(definition,[new_symbols(definition,[spl12_1])],[avatar_definition]) ).
fof(f192,definition,
( spl12_2
<=> sP0(sK7,sK6,sK7,sK6) ),
introduced(definition,[new_symbols(definition,[spl12_2])],[avatar_definition]) ).
fof(f194,plain,
( sP0(sK7,sK6,sK7,sK6)
| ~ spl12_2 ),
inference(avatar_component_clause,[],[f192]) ).
fof(f195,plain,
( ~ spl12_1
| spl12_2 ),
inference(avatar_split_clause,[],[f175,f192,f188]) ).
fof(f196,plain,
( spl12_1
| spl12_2 ),
inference(avatar_split_clause,[],[f174,f192,f188]) ).
fof(f217,plain,
( ssItem(sK1(sK7,sK6))
| ~ spl12_2 ),
inference(resolution,[],[f132,f194]) ).
fof(f218,plain,
( ssList(sK2(sK7,sK6))
| ~ spl12_2 ),
inference(resolution,[],[f133,f194]) ).
fof(f219,plain,
( ssList(sK3(sK7,sK6))
| ~ spl12_2 ),
inference(resolution,[],[f134,f194]) ).
fof(f567,plain,
( sK6 = app(app(sK3(sK7,sK6),cons(sK1(sK7,sK6),nil)),sK2(sK7,sK6))
| ~ spl12_2 ),
inference(resolution,[],[f135,f194]) ).
fof(f589,plain,
( sK7 = app(app(sK2(sK7,sK6),cons(sK1(sK7,sK6),nil)),sK3(sK7,sK6))
| ~ spl12_2 ),
inference(resolution,[],[f136,f194]) ).
fof(f2469,plain,
( ! [X0,X1] :
( ~ sP0(app(app(sK2(sK7,sK6),cons(sK1(sK7,sK6),nil)),sK3(sK7,sK6)),sK6,X0,X1)
| ~ ssList(sK2(sK7,sK6))
| ~ ssList(sK3(sK7,sK6))
| ~ ssItem(sK1(sK7,sK6)) )
| ~ spl12_2 ),
inference(superposition,[],[f179,f567]) ).
fof(f2472,plain,
( ! [X0,X1] :
( ~ sP0(app(app(sK2(sK7,sK6),cons(sK1(sK7,sK6),nil)),sK3(sK7,sK6)),sK6,X0,X1)
| ~ ssList(sK3(sK7,sK6))
| ~ ssItem(sK1(sK7,sK6)) )
| ~ spl12_2 ),
inference(forward_subsumption_resolution,[],[f2469,f218]) ).
fof(f2478,plain,
( ! [X0,X1] :
( ~ sP0(app(app(sK2(sK7,sK6),cons(sK1(sK7,sK6),nil)),sK3(sK7,sK6)),sK6,X0,X1)
| ~ ssItem(sK1(sK7,sK6)) )
| ~ spl12_2 ),
inference(forward_subsumption_resolution,[],[f2472,f219]) ).
fof(f2484,plain,
( ! [X0,X1] : ~ sP0(app(app(sK2(sK7,sK6),cons(sK1(sK7,sK6),nil)),sK3(sK7,sK6)),sK6,X0,X1)
| ~ spl12_2 ),
inference(forward_subsumption_resolution,[],[f2478,f217]) ).
fof(f2490,plain,
( ! [X0,X1] : ~ sP0(sK7,sK6,X0,X1)
| ~ spl12_2 ),
inference(forward_demodulation,[],[f2484,f589]) ).
fof(f2752,plain,
( $false
| ~ spl12_2 ),
inference(resolution,[],[f2490,f194]) ).
fof(f2754,plain,
~ spl12_2,
inference(avatar_contradiction_clause,[],[f2752]) ).
cnf(s1,plain,
( ~ spl12_1
| spl12_2 ),
inference(sat_conversion,[],[f195]) ).
cnf(s2,plain,
( spl12_1
| spl12_2 ),
inference(sat_conversion,[],[f196]) ).
cnf(s116,plain,
~ spl12_2,
inference(sat_conversion,[],[f2754]) ).
cnf(s146,plain,
spl12_1,
inference(rat,[],[s2,s116]) ).
cnf(s159,plain,
$false,
inference(rat,[],[s1,s116,s146]) ).
fof(f2755,plain,
$false,
inference(avatar_sat_refutation,[],[s159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC422+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.27 % Computer : n006.cluster.edu
% 0.11/0.27 % Model : x86_64 x86_64
% 0.11/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.27 % Memory : 8046.5625MB
% 0.11/0.27 % OS : Linux 6.8.0-71-generic
% 0.11/0.27 % CPULimit : 300
% 0.11/0.27 % WCLimit : 300
% 0.11/0.27 % DateTime : Mon Sep 28 09:35:55 UTC 2026
% 0.11/0.27 % CPUTime :
% 0.11/0.27 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.32 Running first-order theorem proving
% 0.27/0.32 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.47/1.29 % (3839713)Detected formulas, will run a generic FOF schedule.
% 3.47/1.29 % (3839732)dis-21_1_sil=8000:lcm=predicate:random_seed=833937183: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.47/1.29 % (3839732)Instruction limit reached!
% 3.47/1.29 % (3839732)------------------------------
% 3.47/1.29 % (3839732)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.29 % (3839732)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.29 % (3839732)CaDiCaL version: 2.1.3
% 3.47/1.29 % (3839732)Termination reason: Instruction limit
% 3.47/1.29 % (3839732)Termination phase: Saturation
% 3.47/1.29 % (3839732)Time elapsed: 0.044 s
% 3.47/1.29 % (3839732)Peak memory usage: 90 MB
% 3.47/1.29 % (3839732)Instructions burned: 130 (million)
% 3.47/1.29 % (3839726)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=4139157827:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.47/1.29 % (3839730)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4226003783:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.47/1.29 % (3839728)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=656959485:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.47/1.29 % (3839727)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=3254421431:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.47/1.29 % (3839729)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2184498057:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.47/1.29 % (3839731)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2960791294:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.47/1.29 % (3839737)lrs+10_1_sil=8000:sp=occurrence:random_seed=532643244:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.47/1.29 % (3839737)First to succeed.
% 3.47/1.29 % (3839737)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3839713"
% 3.47/1.29 % (3839730)Instruction limit reached!
% 3.47/1.29 % (3839730)------------------------------
% 3.47/1.29 % (3839730)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.29 % (3839730)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.29 % (3839730)CaDiCaL version: 2.1.3
% 3.47/1.29 % (3839730)Termination reason: Instruction limit
% 3.47/1.29 % (3839730)Termination phase: Saturation
% 3.47/1.29 % (3839730)Time elapsed: 0.107 s
% 3.47/1.29 % (3839730)Peak memory usage: 88 MB
% 3.47/1.29 % (3839730)Instructions burned: 119 (million)
% 3.47/1.29 % (3839729)Instruction limit reached!
% 3.47/1.29 % (3839729)------------------------------
% 3.47/1.29 % (3839729)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.29 % (3839729)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.29 % (3839729)CaDiCaL version: 2.1.3
% 3.47/1.29 % (3839729)Termination reason: Instruction limit
% 3.47/1.29 % (3839729)Termination phase: Saturation
% 3.47/1.29 % (3839729)Time elapsed: 0.107 s
% 3.47/1.29 % (3839729)Peak memory usage: 89 MB
% 3.47/1.29 % (3839729)Instructions burned: 109 (million)
% 3.47/1.29 % (3839731)Instruction limit reached!
% 3.47/1.29 % (3839731)------------------------------
% 3.47/1.29 % (3839731)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.29 % (3839731)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.29 % (3839731)CaDiCaL version: 2.1.3
% 3.47/1.29 % (3839731)Termination reason: Instruction limit
% 3.47/1.29 % (3839731)Termination phase: Saturation
% 3.47/1.29 % (3839731)Time elapsed: 0.138 s
% 3.47/1.29 % (3839731)Peak memory usage: 90 MB
% 3.47/1.29 % (3839731)Instructions burned: 140 (million)
% 3.47/1.29 % (3839748)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3450723239:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 3.47/1.29 % (3839749)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2502171314:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 3.47/1.29 % (3839737)Refutation found. Thanks to Tanya!
% 3.47/1.29 % SZS status Theorem for theBenchmark
% 3.47/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 4.67/1.55 % (3839737)------------------------------
% 4.67/1.55 % (3839737)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.67/1.55 % (3839737)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.67/1.55 % (3839737)CaDiCaL version: 2.1.3
% 4.67/1.55 % (3839737)Termination reason: Refutation
% 4.67/1.55 % (3839737)Time elapsed: 0.050 s
% 4.67/1.55 % (3839737)Peak memory usage: 91 MB
% 4.67/1.55 % (3839737)Instructions burned: 95 (million)
% 4.67/1.55 % (3839737)------------------------------
% 4.67/1.55 % (3839737)------------------------------
% 4.67/1.55 % (3839713)Success in time 0.551 s
% 4.67/1.55 % Vampire exiting
%------------------------------------------------------------------------------