%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC243+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 : n005.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:06 PM UTC 2026
% Result : Theorem 3.09s 1.08s
% Output : Refutation 3.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 7
% Syntax : Number of formulae : 61 ( 10 unt; 0 def)
% Number of atoms : 280 ( 68 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 369 ( 150 ~; 150 |; 52 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 100 ( 78 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ totalorderedP(X2)
| nil = X0
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0
& ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X5,X7)
| ~ memberP(X6,X7)
| ~ lt(X4,X7)
| leq(X4,X7) ) ) ) ) ) ) ) ) ) ),
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
| ~ totalorderedP(X2)
| nil = X0
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0
& ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X5,X7)
| ~ memberP(X6,X7)
| ~ lt(X4,X7)
| leq(X4,X7) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& totalorderedP(X2)
& nil != X0
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( memberP(X5,X7)
& memberP(X6,X7)
& lt(X4,X7)
& ~ leq(X4,X7)
& ssItem(X7) ) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& totalorderedP(X2)
& nil != X0
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( memberP(X5,X7)
& memberP(X6,X7)
& lt(X4,X7)
& ~ leq(X4,X7)
& ssItem(X7) ) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f101,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f102,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(flattening,[],[f101]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f110,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f115,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f118,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f148,plain,
( sK1 = sK3
& sK0 = sK2
& totalorderedP(sK2)
& nil != sK0
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK0
| ( memberP(X5,sK4(X4,X5,X6))
& memberP(X6,sK4(X4,X5,X6))
& lt(X4,sK4(X4,X5,X6))
& ~ leq(X4,sK4(X4,X5,X6))
& ssItem(sK4(X4,X5,X6)) ) ) ) )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X7,sK4(X4,X5,X6))],[f99]) ).
fof(f150,plain,
! [X0] :
( nil = X0
| ( ssList(sK7(X0))
& ssItem(sK8(X0))
& cons(sK8(X0),sK7(X0)) = X0 )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X1,sK7(X0)),skolemize(X2,sK8(X0))],[f102]) ).
fof(f170,plain,
ssList(sK2),
inference(cnf_transformation,[],[f148]) ).
fof(f172,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK0
| ssItem(sK4(X4,X5,X6)) ),
inference(cnf_transformation,[],[f148]) ).
fof(f176,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK0
| memberP(X5,sK4(X4,X5,X6)) ),
inference(cnf_transformation,[],[f148]) ).
fof(f177,plain,
nil != sK0,
inference(cnf_transformation,[],[f148]) ).
fof(f179,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f148]) ).
fof(f185,plain,
! [X0] :
( cons(sK8(X0),sK7(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f186,plain,
! [X0] :
( ssItem(sK8(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f187,plain,
! [X0] :
( ssList(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f191,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f197,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f200,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f203,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f204,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f246,plain,
nil != sK2,
inference(definition_unfolding,[],[f177,f179]) ).
fof(f247,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK2
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| memberP(X5,sK4(X4,X5,X6)) ),
inference(definition_unfolding,[],[f176,f179]) ).
fof(f251,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK2
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| ssItem(sK4(X4,X5,X6)) ),
inference(definition_unfolding,[],[f172,f179]) ).
fof(f279,plain,
! [X0,X1] :
( sK2 != app(cons(X0,nil),X1)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f247,f200]) ).
fof(f280,plain,
! [X0,X1] :
( sK2 != app(cons(X0,nil),X1)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f251,f200]) ).
fof(f282,plain,
! [X0,X1] :
( sK2 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(forward_subsumption_resolution,[],[f280,f203]) ).
fof(f283,plain,
! [X0,X1] :
( sK2 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(forward_subsumption_resolution,[],[f279,f203]) ).
fof(f370,plain,
! [X0,X1] :
( cons(X0,X1) != sK2
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f283,f197]) ).
fof(f371,plain,
! [X0,X1] :
( cons(X0,X1) != sK2
| ~ ssList(X1)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f282,f197]) ).
fof(f388,plain,
! [X0,X1] :
( cons(X0,X1) != sK2
| ~ ssList(X1)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(duplicate_literal_removal,[],[f371]) ).
fof(f389,plain,
! [X0,X1] :
( cons(X0,X1) != sK2
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(duplicate_literal_removal,[],[f370]) ).
fof(f398,plain,
! [X0] :
( sK2 != X0
| ~ ssList(sK7(X0))
| ~ ssItem(sK8(X0))
| ssItem(sK4(sK8(X0),nil,sK7(X0)))
| ~ ssList(cons(sK8(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f388,f185]) ).
fof(f399,plain,
! [X0] :
( sK2 != X0
| ~ ssItem(sK8(X0))
| ssItem(sK4(sK8(X0),nil,sK7(X0)))
| ~ ssList(cons(sK8(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f398,f187]) ).
fof(f400,plain,
! [X0] :
( sK2 != X0
| ssItem(sK4(sK8(X0),nil,sK7(X0)))
| ~ ssList(cons(sK8(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f399,f186]) ).
fof(f407,plain,
! [X0] :
( sK2 != X0
| ~ ssList(sK7(X0))
| ~ ssItem(sK8(X0))
| memberP(nil,sK4(sK8(X0),nil,sK7(X0)))
| ~ ssList(cons(sK8(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f389,f185]) ).
fof(f408,plain,
! [X0] :
( sK2 != X0
| ~ ssItem(sK8(X0))
| memberP(nil,sK4(sK8(X0),nil,sK7(X0)))
| ~ ssList(cons(sK8(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f407,f187]) ).
fof(f409,plain,
! [X0] :
( sK2 != X0
| memberP(nil,sK4(sK8(X0),nil,sK7(X0)))
| ~ ssList(cons(sK8(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f408,f186]) ).
fof(f424,plain,
( ssItem(sK4(sK8(sK2),nil,sK7(sK2)))
| ~ ssList(cons(sK8(sK2),nil))
| nil = sK2
| ~ ssList(sK2) ),
inference(equality_resolution,[],[f400]) ).
fof(f425,plain,
( ssItem(sK4(sK8(sK2),nil,sK7(sK2)))
| ~ ssList(cons(sK8(sK2),nil))
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f424,f246]) ).
fof(f426,plain,
( ssItem(sK4(sK8(sK2),nil,sK7(sK2)))
| ~ ssList(cons(sK8(sK2),nil)) ),
inference(forward_subsumption_resolution,[],[f425,f170]) ).
fof(f435,plain,
( memberP(nil,sK4(sK8(sK2),nil,sK7(sK2)))
| ~ ssList(cons(sK8(sK2),nil))
| nil = sK2
| ~ ssList(sK2) ),
inference(equality_resolution,[],[f409]) ).
fof(f436,plain,
( memberP(nil,sK4(sK8(sK2),nil,sK7(sK2)))
| ~ ssList(cons(sK8(sK2),nil))
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f435,f246]) ).
fof(f437,plain,
( memberP(nil,sK4(sK8(sK2),nil,sK7(sK2)))
| ~ ssList(cons(sK8(sK2),nil)) ),
inference(forward_subsumption_resolution,[],[f436,f170]) ).
fof(f438,plain,
( ~ ssList(cons(sK8(sK2),nil))
| ~ ssItem(sK4(sK8(sK2),nil,sK7(sK2))) ),
inference(resolution,[],[f437,f204]) ).
fof(f439,plain,
~ ssList(cons(sK8(sK2),nil)),
inference(forward_subsumption_resolution,[],[f438,f426]) ).
fof(f446,plain,
( ~ ssItem(sK8(sK2))
| ~ ssList(nil) ),
inference(resolution,[],[f439,f191]) ).
fof(f447,plain,
~ ssItem(sK8(sK2)),
inference(forward_subsumption_resolution,[],[f446,f203]) ).
fof(f454,plain,
( nil = sK2
| ~ ssList(sK2) ),
inference(resolution,[],[f447,f186]) ).
fof(f455,plain,
~ ssList(sK2),
inference(forward_subsumption_resolution,[],[f454,f246]) ).
fof(f456,plain,
$false,
inference(forward_subsumption_resolution,[],[f455,f170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC243+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n005.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 08:39:11 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running first-order theorem proving
% 0.08/0.21 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.09/1.08 % (644855)Detected formulas, will run a generic FOF schedule.
% 3.09/1.08 % (644861)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=212454905:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.09/1.08 % (644864)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1369467981:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.09/1.08 % (644865)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2302027147:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.09/1.08 % (644863)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2831983062:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.09/1.08 % (644860)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=2112042776:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.09/1.08 % (644862)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=3329348867:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.09/1.08 % (644864)First to succeed.
% 3.09/1.08 % (644864)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-644855"
% 3.09/1.08 % (644865)Also succeeded, but the first one will report.
% 3.09/1.08 % (644866)dis-21_1_sil=8000:lcm=predicate:random_seed=4197616365: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.09/1.08 % (644863)Instruction limit reached!
% 3.09/1.08 % (644863)------------------------------
% 3.09/1.08 % (644863)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.08 % (644863)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.08 % (644863)CaDiCaL version: 2.1.3
% 3.09/1.08 % (644863)Termination reason: Instruction limit
% 3.09/1.08 % (644863)Termination phase: Saturation
% 3.09/1.08 % (644863)Time elapsed: 0.068 s
% 3.09/1.08 % (644863)Peak memory usage: 89 MB
% 3.09/1.08 % (644863)Instructions burned: 110 (million)
% 3.09/1.08 % (644866)Instruction limit reached!
% 3.09/1.08 % (644866)------------------------------
% 3.09/1.08 % (644866)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.08 % (644866)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.08 % (644866)CaDiCaL version: 2.1.3
% 3.09/1.08 % (644866)Termination reason: Instruction limit
% 3.09/1.08 % (644866)Termination phase: Saturation
% 3.09/1.08 % (644866)Time elapsed: 0.071 s
% 3.09/1.08 % (644866)Peak memory usage: 91 MB
% 3.09/1.08 % (644866)Instructions burned: 129 (million)
% 3.09/1.08 % (644874)lrs+10_1_sil=8000:sp=occurrence:random_seed=2826070575:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.09/1.08 % (644864)Refutation found. Thanks to Tanya!
% 3.09/1.08 % SZS status Theorem for theBenchmark
% 3.09/1.08 % SZS output start Proof for theBenchmark
% See solution above
% 3.65/1.29 % (644864)------------------------------
% 3.65/1.29 % (644864)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.65/1.29 % (644864)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.65/1.29 % (644864)CaDiCaL version: 2.1.3
% 3.65/1.29 % (644864)Termination reason: Refutation
% 3.65/1.29 % (644864)Time elapsed: 0.010 s
% 3.65/1.29 % (644864)Peak memory usage: 88 MB
% 3.65/1.29 % (644864)Instructions burned: 13 (million)
% 3.65/1.29 % (644864)------------------------------
% 3.65/1.29 % (644864)------------------------------
% 3.65/1.29 % (644855)Success in time 0.433 s
% 3.65/1.29 % Vampire exiting
%------------------------------------------------------------------------------