%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC153+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 : 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:41 PM UTC 2026
% Result : Theorem 1.92s 1.13s
% Output : Refutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 1
% Syntax : Number of formulae : 53 ( 15 unt; 0 def)
% Number of atoms : 350 ( 29 equ)
% Maximal formula atoms : 30 ( 6 avg)
% Number of connectives : 510 ( 213 ~; 201 |; 76 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 8 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 103 ( 71 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X3 != X1
| X2 != X0
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) = X2
& leq(X5,X4)
& ( ~ leq(X4,X5)
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& ( ~ leq(X4,X9)
| ~ leq(X9,X5) ) ) ) ) ) ) ) )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ssList(X14)
=> ( app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) != X0
| ~ leq(X11,X10)
| ( ! [X15] :
( ssItem(X15)
=> ( ~ memberP(X13,X15)
| ( leq(X15,X11)
& leq(X10,X15) ) ) )
& leq(X10,X11) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X3 != X1
| X2 != X0
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) = X2
& leq(X5,X4)
& ( ~ leq(X4,X5)
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& ( ~ leq(X4,X9)
| ~ leq(X9,X5) ) ) ) ) ) ) ) )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ssList(X14)
=> ( app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) != X0
| ~ leq(X11,X10)
| ( ! [X15] :
( ssItem(X15)
=> ( ~ memberP(X13,X15)
| ( leq(X15,X11)
& leq(X10,X15) ) ) )
& leq(X10,X11) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ~ ssList(X8)
| app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) != X2
| ~ leq(X5,X4)
| ( leq(X4,X5)
& ! [X9] :
( ~ ssItem(X9)
| ~ memberP(X7,X9)
| ( leq(X4,X9)
& leq(X9,X5) ) ) ) ) ) ) ) )
& ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) = X0
& leq(X11,X10)
& ( ? [X15] :
( memberP(X13,X15)
& ( ~ leq(X15,X11)
| ~ leq(X10,X15) )
& ssItem(X15) )
| ~ leq(X10,X11) )
& ssList(X14) )
& ssList(X13) )
& ssList(X12) )
& ssItem(X11) )
& ssItem(X10) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ~ ssList(X8)
| app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) != X2
| ~ leq(X5,X4)
| ( leq(X4,X5)
& ! [X9] :
( ~ ssItem(X9)
| ~ memberP(X7,X9)
| ( leq(X4,X9)
& leq(X9,X5) ) ) ) ) ) ) ) )
& ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) = X0
& leq(X11,X10)
& ( ? [X15] :
( memberP(X13,X15)
& ( ~ leq(X15,X11)
| ~ leq(X10,X15) )
& ssItem(X15) )
| ~ leq(X10,X11) )
& ssList(X14) )
& ssList(X13) )
& ssList(X12) )
& ssItem(X11) )
& ssItem(X10) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f127,plain,
( sK1 = sK3
& sK0 = sK2
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ~ ssList(X8)
| app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) != sK2
| ~ leq(X5,X4)
| ( leq(X4,X5)
& ! [X9] :
( ~ ssItem(X9)
| ~ memberP(X7,X9)
| ( leq(X4,X9)
& leq(X9,X5) ) ) ) ) ) ) ) )
& sK0 = app(app(app(app(sK6,cons(sK4,nil)),sK7),cons(sK5,nil)),sK8)
& leq(sK5,sK4)
& ( ( memberP(sK7,sK9)
& ( ~ leq(sK9,sK5)
| ~ leq(sK4,sK9) )
& ssItem(sK9) )
| ~ leq(sK4,sK5) )
& ssList(sK8)
& ssList(sK7)
& ssList(sK6)
& ssItem(sK5)
& ssItem(sK4)
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X10,sK4),skolemize(X11,sK5),skolemize(X12,sK6),skolemize(X13,sK7),skolemize(X14,sK8),skolemize(X15,sK9)],[f99]) ).
fof(f143,plain,
ssItem(sK4),
inference(cnf_transformation,[],[f127]) ).
fof(f144,plain,
ssItem(sK5),
inference(cnf_transformation,[],[f127]) ).
fof(f145,plain,
ssList(sK6),
inference(cnf_transformation,[],[f127]) ).
fof(f146,plain,
ssList(sK7),
inference(cnf_transformation,[],[f127]) ).
fof(f147,plain,
ssList(sK8),
inference(cnf_transformation,[],[f127]) ).
fof(f148,plain,
( ~ leq(sK4,sK5)
| ssItem(sK9) ),
inference(cnf_transformation,[],[f127]) ).
fof(f149,plain,
( ~ leq(sK9,sK5)
| ~ leq(sK4,sK9)
| ~ leq(sK4,sK5) ),
inference(cnf_transformation,[],[f127]) ).
fof(f150,plain,
( memberP(sK7,sK9)
| ~ leq(sK4,sK5) ),
inference(cnf_transformation,[],[f127]) ).
fof(f151,plain,
leq(sK5,sK4),
inference(cnf_transformation,[],[f127]) ).
fof(f152,plain,
sK0 = app(app(app(app(sK6,cons(sK4,nil)),sK7),cons(sK5,nil)),sK8),
inference(cnf_transformation,[],[f127]) ).
fof(f153,plain,
! [X8,X6,X9,X7,X4,X5] :
( app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) != sK2
| ~ ssItem(X5)
| ~ ssList(X6)
| ~ ssList(X7)
| ~ ssList(X8)
| ~ ssItem(X4)
| ~ leq(X5,X4)
| ~ ssItem(X9)
| ~ memberP(X7,X9)
| leq(X9,X5) ),
inference(cnf_transformation,[],[f127]) ).
fof(f154,plain,
! [X8,X6,X9,X7,X4,X5] :
( app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) != sK2
| ~ ssItem(X5)
| ~ ssList(X6)
| ~ ssList(X7)
| ~ ssList(X8)
| ~ ssItem(X4)
| ~ leq(X5,X4)
| ~ ssItem(X9)
| ~ memberP(X7,X9)
| leq(X4,X9) ),
inference(cnf_transformation,[],[f127]) ).
fof(f155,plain,
! [X8,X6,X7,X4,X5] :
( app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) != sK2
| ~ ssItem(X5)
| ~ ssList(X6)
| ~ ssList(X7)
| ~ ssList(X8)
| ~ ssItem(X4)
| ~ leq(X5,X4)
| leq(X4,X5) ),
inference(cnf_transformation,[],[f127]) ).
fof(f156,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f127]) ).
fof(f195,plain,
sK2 = app(app(app(app(sK6,cons(sK4,nil)),sK7),cons(sK5,nil)),sK8),
inference(definition_unfolding,[],[f152,f156]) ).
fof(f205,plain,
( sK2 != sK2
| ~ ssItem(sK5)
| ~ ssList(sK6)
| ~ ssList(sK7)
| ~ ssList(sK8)
| ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| leq(sK4,sK5) ),
inference(superposition,[],[f155,f195]) ).
fof(f206,plain,
( ~ ssItem(sK5)
| ~ ssList(sK6)
| ~ ssList(sK7)
| ~ ssList(sK8)
| ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| leq(sK4,sK5) ),
inference(trivial_inequality_removal,[],[f205]) ).
fof(f207,plain,
( ~ ssList(sK6)
| ~ ssList(sK7)
| ~ ssList(sK8)
| ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| leq(sK4,sK5) ),
inference(forward_subsumption_resolution,[],[f206,f144]) ).
fof(f209,plain,
( ~ ssList(sK7)
| ~ ssList(sK8)
| ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| leq(sK4,sK5) ),
inference(forward_subsumption_resolution,[],[f207,f145]) ).
fof(f211,plain,
( ~ ssList(sK8)
| ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| leq(sK4,sK5) ),
inference(forward_subsumption_resolution,[],[f209,f146]) ).
fof(f212,plain,
( ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| leq(sK4,sK5) ),
inference(forward_subsumption_resolution,[],[f211,f147]) ).
fof(f213,plain,
( ~ leq(sK5,sK4)
| leq(sK4,sK5) ),
inference(forward_subsumption_resolution,[],[f212,f143]) ).
fof(f214,plain,
leq(sK4,sK5),
inference(forward_subsumption_resolution,[],[f213,f151]) ).
fof(f215,plain,
ssItem(sK9),
inference(resolution,[],[f214,f148]) ).
fof(f217,plain,
! [X0] :
( sK2 != sK2
| ~ ssItem(sK5)
| ~ ssList(sK6)
| ~ ssList(sK7)
| ~ ssList(sK8)
| ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| ~ ssItem(X0)
| ~ memberP(sK7,X0)
| leq(X0,sK5) ),
inference(superposition,[],[f153,f195]) ).
fof(f218,plain,
! [X0] :
( ~ ssItem(sK5)
| ~ ssList(sK6)
| ~ ssList(sK7)
| ~ ssList(sK8)
| ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| ~ ssItem(X0)
| ~ memberP(sK7,X0)
| leq(X0,sK5) ),
inference(trivial_inequality_removal,[],[f217]) ).
fof(f219,plain,
! [X0] :
( ~ ssList(sK6)
| ~ ssList(sK7)
| ~ ssList(sK8)
| ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| ~ ssItem(X0)
| ~ memberP(sK7,X0)
| leq(X0,sK5) ),
inference(forward_subsumption_resolution,[],[f218,f144]) ).
fof(f221,plain,
! [X0] :
( ~ ssList(sK7)
| ~ ssList(sK8)
| ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| ~ ssItem(X0)
| ~ memberP(sK7,X0)
| leq(X0,sK5) ),
inference(forward_subsumption_resolution,[],[f219,f145]) ).
fof(f223,plain,
! [X0] :
( ~ ssList(sK8)
| ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| ~ ssItem(X0)
| ~ memberP(sK7,X0)
| leq(X0,sK5) ),
inference(forward_subsumption_resolution,[],[f221,f146]) ).
fof(f224,plain,
! [X0] :
( ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| ~ ssItem(X0)
| ~ memberP(sK7,X0)
| leq(X0,sK5) ),
inference(forward_subsumption_resolution,[],[f223,f147]) ).
fof(f225,plain,
! [X0] :
( ~ leq(sK5,sK4)
| ~ ssItem(X0)
| ~ memberP(sK7,X0)
| leq(X0,sK5) ),
inference(forward_subsumption_resolution,[],[f224,f143]) ).
fof(f226,plain,
! [X0] :
( leq(X0,sK5)
| ~ memberP(sK7,X0)
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[],[f225,f151]) ).
fof(f228,plain,
( ~ memberP(sK7,sK9)
| ~ ssItem(sK9)
| ~ leq(sK4,sK9)
| ~ leq(sK4,sK5) ),
inference(resolution,[],[f226,f149]) ).
fof(f229,plain,
( ~ ssItem(sK9)
| ~ leq(sK4,sK9)
| ~ leq(sK4,sK5) ),
inference(forward_subsumption_resolution,[],[f228,f150]) ).
fof(f230,plain,
( ~ leq(sK4,sK9)
| ~ leq(sK4,sK5) ),
inference(forward_subsumption_resolution,[],[f229,f215]) ).
fof(f231,plain,
~ leq(sK4,sK9),
inference(forward_subsumption_resolution,[],[f230,f214]) ).
fof(f233,plain,
! [X0] :
( sK2 != sK2
| ~ ssItem(sK5)
| ~ ssList(sK6)
| ~ ssList(sK7)
| ~ ssList(sK8)
| ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| ~ ssItem(X0)
| ~ memberP(sK7,X0)
| leq(sK4,X0) ),
inference(superposition,[],[f154,f195]) ).
fof(f234,plain,
! [X0] :
( ~ ssItem(sK5)
| ~ ssList(sK6)
| ~ ssList(sK7)
| ~ ssList(sK8)
| ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| ~ ssItem(X0)
| ~ memberP(sK7,X0)
| leq(sK4,X0) ),
inference(trivial_inequality_removal,[],[f233]) ).
fof(f235,plain,
! [X0] :
( ~ ssList(sK6)
| ~ ssList(sK7)
| ~ ssList(sK8)
| ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| ~ ssItem(X0)
| ~ memberP(sK7,X0)
| leq(sK4,X0) ),
inference(forward_subsumption_resolution,[],[f234,f144]) ).
fof(f237,plain,
! [X0] :
( ~ ssList(sK7)
| ~ ssList(sK8)
| ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| ~ ssItem(X0)
| ~ memberP(sK7,X0)
| leq(sK4,X0) ),
inference(forward_subsumption_resolution,[],[f235,f145]) ).
fof(f239,plain,
! [X0] :
( ~ ssList(sK8)
| ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| ~ ssItem(X0)
| ~ memberP(sK7,X0)
| leq(sK4,X0) ),
inference(forward_subsumption_resolution,[],[f237,f146]) ).
fof(f240,plain,
! [X0] :
( ~ ssItem(sK4)
| ~ leq(sK5,sK4)
| ~ ssItem(X0)
| ~ memberP(sK7,X0)
| leq(sK4,X0) ),
inference(forward_subsumption_resolution,[],[f239,f147]) ).
fof(f241,plain,
! [X0] :
( ~ leq(sK5,sK4)
| ~ ssItem(X0)
| ~ memberP(sK7,X0)
| leq(sK4,X0) ),
inference(forward_subsumption_resolution,[],[f240,f143]) ).
fof(f242,plain,
! [X0] :
( leq(sK4,X0)
| ~ memberP(sK7,X0)
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[],[f241,f151]) ).
fof(f244,plain,
( ~ memberP(sK7,sK9)
| ~ ssItem(sK9) ),
inference(resolution,[],[f242,f231]) ).
fof(f245,plain,
~ memberP(sK7,sK9),
inference(forward_subsumption_resolution,[],[f244,f215]) ).
fof(f246,plain,
~ leq(sK4,sK5),
inference(resolution,[],[f245,f150]) ).
fof(f247,plain,
$false,
inference(forward_subsumption_resolution,[],[f246,f214]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC153+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 08:10:46 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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
% 1.92/1.13 % (3241352)Detected formulas, will run a generic FOF schedule.
% 1.92/1.13 % (3241361)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=880502531:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.92/1.13 % (3241361)First to succeed.
% 1.92/1.13 % (3241361)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3241352"
% 1.92/1.13 % (3241357)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=2617535784:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.92/1.13 % (3241360)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1868975552:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.92/1.13 % (3241359)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=1128968234:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.92/1.13 % (3241358)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=3338159988:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.92/1.13 % (3241362)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3933534514:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.92/1.13 % (3241363)dis-21_1_sil=8000:lcm=predicate:random_seed=2564012362: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)
% 1.92/1.13 % (3241362)Also succeeded, but the first one will report.
% 1.92/1.13 % (3241360)Also succeeded, but the first one will report.
% 1.92/1.13 % (3241363)Also succeeded, but the first one will report.
% 1.92/1.13 % (3241361)Refutation found. Thanks to Tanya!
% 1.92/1.13 % SZS status Theorem for theBenchmark
% 1.92/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 2.50/1.22 % (3241361)------------------------------
% 2.50/1.22 % (3241361)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.50/1.22 % (3241361)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.22 % (3241361)CaDiCaL version: 2.1.3
% 2.50/1.22 % (3241361)Termination reason: Refutation
% 2.50/1.22 % (3241361)Time elapsed: 0.003 s
% 2.50/1.22 % (3241361)Peak memory usage: 88 MB
% 2.50/1.22 % (3241361)Instructions burned: 6 (million)
% 2.50/1.22 % (3241361)------------------------------
% 2.50/1.22 % (3241361)------------------------------
% 2.50/1.22 % (3241352)Success in time 0.281 s
% 2.50/1.22 % Vampire exiting
%------------------------------------------------------------------------------