%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC324+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 : n013.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:28 PM UTC 2026
% Result : Theorem 2.97s 1.13s
% Output : Refutation 3.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 8
% Syntax : Number of formulae : 64 ( 9 unt; 0 def)
% Number of atoms : 255 ( 110 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 338 ( 147 ~; 137 |; 38 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 84 ( 66 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',ax20) ).
fof(f27,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,app(X1,X0)) = app(cons(X2,X1),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax27) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
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) = X1
& app(X5,X4) = X0 ) )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) != X2
& app(cons(X6,nil),X7) = X3 ) )
| ( nil != X2
& nil = X3 ) ) ) ) ),
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) = X1
& app(X5,X4) = X0 ) )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) != X2
& app(cons(X6,nil),X7) = X3 ) )
| ( nil != X2
& nil = X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| app(X4,X5) != X1
| app(X5,X4) != X0 ) )
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) = X2
| app(cons(X6,nil),X7) != X3 ) )
& ( nil = X2
| nil != X3 ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f100,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f101,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(flattening,[],[f100]) ).
fof(f105,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f106,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f109,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f114,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f115,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( cons(X2,app(X1,X0)) = app(cons(X2,X1),X0)
| ~ ssItem(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f27]) ).
fof(f117,plain,
( ssList(sK3)
& sK1 = sK3
& sK0 = sK2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| app(X4,X5) != sK1
| app(X5,X4) != sK0 ) )
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) = sK2
| app(cons(X6,nil),X7) != sK3 ) )
& ( nil = sK2
| nil != sK3 )
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f98]) ).
fof(f119,plain,
! [X0] :
( nil = X0
| ( ssList(sK6(X0))
& ssItem(sK7(X0))
& cons(sK7(X0),sK6(X0)) = X0 )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X1,sK6(X0)),skolemize(X2,sK7(X0))],[f101]) ).
fof(f125,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f117]) ).
fof(f126,plain,
! [X6,X7] :
( app(cons(X6,nil),X7) != sK3
| ~ ssList(X7)
| app(X7,cons(X6,nil)) = sK2
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f117]) ).
fof(f127,plain,
! [X4,X5] :
( ~ ssList(X4)
| ~ ssList(X5)
| app(X4,X5) != sK1
| app(X5,X4) != sK0 ),
inference(cnf_transformation,[],[f117]) ).
fof(f128,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f117]) ).
fof(f129,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f117]) ).
fof(f130,plain,
ssList(sK3),
inference(cnf_transformation,[],[f117]) ).
fof(f135,plain,
! [X0] :
( cons(sK7(X0),sK6(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f136,plain,
! [X0] :
( ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f137,plain,
! [X0] :
( ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f141,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f142,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f147,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f150,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f151,plain,
! [X2,X0,X1] :
( cons(X2,app(X1,X0)) = app(cons(X2,X1),X0)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f153,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f154,plain,
! [X4,X5] :
( app(X5,X4) != sK2
| ~ ssList(X5)
| app(X4,X5) != sK3
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f127,f129,f128]) ).
fof(f160,plain,
! [X0] :
( sK2 != X0
| ~ ssList(X0)
| app(nil,X0) != sK3
| ~ ssList(nil)
| ~ ssList(X0) ),
inference(superposition,[],[f154,f142]) ).
fof(f162,plain,
! [X0] :
( sK2 != X0
| ~ ssList(X0)
| app(nil,X0) != sK3
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f160]) ).
fof(f164,plain,
! [X0] :
( app(nil,X0) != sK3
| ~ ssList(X0)
| sK2 != X0 ),
inference(forward_subsumption_resolution,[],[f162,f153]) ).
fof(f165,plain,
( nil != sK3
| ~ ssList(nil)
| nil != sK2
| ~ ssList(nil) ),
inference(superposition,[],[f164,f142]) ).
fof(f166,plain,
( nil != sK3
| ~ ssList(nil)
| nil != sK2 ),
inference(duplicate_literal_removal,[],[f165]) ).
fof(f167,plain,
( nil != sK3
| nil != sK2 ),
inference(forward_subsumption_resolution,[],[f166,f153]) ).
fof(f168,plain,
nil != sK3,
inference(forward_subsumption_resolution,[],[f167,f125]) ).
fof(f193,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(X1)
| sK2 = app(X1,cons(X0,nil))
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f126,f147]) ).
fof(f203,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(X1)
| sK2 = app(X1,cons(X0,nil))
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f193]) ).
fof(f222,plain,
! [X0] :
( sK3 != X0
| ~ ssList(sK6(X0))
| sK2 = app(sK6(X0),cons(sK7(X0),nil))
| ~ ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f203,f135]) ).
fof(f223,plain,
! [X0] :
( sK3 != X0
| sK2 = app(sK6(X0),cons(sK7(X0),nil))
| ~ ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f222,f137]) ).
fof(f224,plain,
! [X0] :
( sK3 != X0
| sK2 = app(sK6(X0),cons(sK7(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f223,f136]) ).
fof(f243,plain,
( sK2 = app(sK6(sK3),cons(sK7(sK3),nil))
| nil = sK3
| ~ ssList(sK3) ),
inference(equality_resolution,[],[f224]) ).
fof(f244,plain,
( sK2 = app(sK6(sK3),cons(sK7(sK3),nil))
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f243,f168]) ).
fof(f245,plain,
sK2 = app(sK6(sK3),cons(sK7(sK3),nil)),
inference(forward_subsumption_resolution,[],[f244,f130]) ).
fof(f253,plain,
( sK2 != sK2
| ~ ssList(sK6(sK3))
| sK3 != app(cons(sK7(sK3),nil),sK6(sK3))
| ~ ssList(cons(sK7(sK3),nil)) ),
inference(superposition,[],[f154,f245]) ).
fof(f254,plain,
( sK3 != app(cons(sK7(sK3),nil),sK6(sK3))
| ~ ssList(sK6(sK3))
| ~ ssList(cons(sK7(sK3),nil)) ),
inference(trivial_inequality_removal,[],[f253]) ).
fof(f439,plain,
( sK3 != cons(sK7(sK3),app(nil,sK6(sK3)))
| ~ ssList(sK6(sK3))
| ~ ssList(cons(sK7(sK3),nil))
| ~ ssItem(sK7(sK3))
| ~ ssList(nil)
| ~ ssList(sK6(sK3)) ),
inference(superposition,[],[f254,f151]) ).
fof(f440,plain,
( sK3 != cons(sK7(sK3),app(nil,sK6(sK3)))
| ~ ssList(sK6(sK3))
| ~ ssList(cons(sK7(sK3),nil))
| ~ ssItem(sK7(sK3))
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f439]) ).
fof(f442,plain,
( sK3 != cons(sK7(sK3),app(nil,sK6(sK3)))
| ~ ssList(sK6(sK3))
| ~ ssItem(sK7(sK3))
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f440,f141]) ).
fof(f443,plain,
( sK3 != cons(sK7(sK3),app(nil,sK6(sK3)))
| ~ ssList(sK6(sK3))
| ~ ssItem(sK7(sK3)) ),
inference(forward_subsumption_resolution,[],[f442,f153]) ).
fof(f470,plain,
( sK3 != cons(sK7(sK3),sK6(sK3))
| ~ ssList(sK6(sK3))
| ~ ssItem(sK7(sK3))
| ~ ssList(sK6(sK3)) ),
inference(superposition,[],[f443,f150]) ).
fof(f471,plain,
( sK3 != cons(sK7(sK3),sK6(sK3))
| ~ ssList(sK6(sK3))
| ~ ssItem(sK7(sK3)) ),
inference(duplicate_literal_removal,[],[f470]) ).
fof(f487,plain,
( sK3 != sK3
| ~ ssList(sK6(sK3))
| ~ ssItem(sK7(sK3))
| nil = sK3
| ~ ssList(sK3) ),
inference(superposition,[],[f471,f135]) ).
fof(f488,plain,
( ~ ssList(sK6(sK3))
| ~ ssItem(sK7(sK3))
| nil = sK3
| ~ ssList(sK3) ),
inference(trivial_inequality_removal,[],[f487]) ).
fof(f489,plain,
( ~ ssItem(sK7(sK3))
| nil = sK3
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f488,f137]) ).
fof(f490,plain,
( nil = sK3
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f489,f136]) ).
fof(f491,plain,
~ ssList(sK3),
inference(forward_subsumption_resolution,[],[f490,f168]) ).
fof(f492,plain,
$false,
inference(forward_subsumption_resolution,[],[f491,f130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC324+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 % Computer : n013.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Mon Sep 28 09:05:06 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 Running first-order theorem proving
% 0.10/0.23 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.97/1.13 % (1039602)Detected formulas, will run a generic FOF schedule.
% 2.97/1.13 % (1039613)dis-21_1_sil=8000:lcm=predicate:random_seed=2134908232: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.97/1.13 % (1039613)Instruction limit reached!
% 2.97/1.13 % (1039613)------------------------------
% 2.97/1.13 % (1039613)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.97/1.13 % (1039613)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.97/1.13 % (1039613)CaDiCaL version: 2.1.3
% 2.97/1.13 % (1039613)Termination reason: Instruction limit
% 2.97/1.13 % (1039613)Termination phase: Saturation
% 2.97/1.13 % (1039613)Time elapsed: 0.041 s
% 2.97/1.13 % (1039613)Peak memory usage: 90 MB
% 2.97/1.13 % (1039613)Instructions burned: 129 (million)
% 2.97/1.13 % (1039608)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=2875086852:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.97/1.13 % (1039607)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=3941774326:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.97/1.13 % (1039611)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=444429293:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.97/1.13 % (1039609)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=1286822129:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.97/1.13 % (1039610)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3827191361:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.97/1.13 % (1039612)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2214477079:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.97/1.13 % (1039611)First to succeed.
% 2.97/1.13 % (1039611)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1039602"
% 2.97/1.13 % (1039612)Also succeeded, but the first one will report.
% 2.97/1.13 % (1039610)Instruction limit reached!
% 2.97/1.13 % (1039610)------------------------------
% 2.97/1.13 % (1039610)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.97/1.13 % (1039610)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.97/1.13 % (1039610)CaDiCaL version: 2.1.3
% 2.97/1.13 % (1039610)Termination reason: Instruction limit
% 2.97/1.13 % (1039610)Termination phase: Saturation
% 2.97/1.13 % (1039610)Time elapsed: 0.067 s
% 2.97/1.13 % (1039610)Peak memory usage: 89 MB
% 2.97/1.13 % (1039610)Instructions burned: 110 (million)
% 2.97/1.13 % (1039621)lrs+10_1_sil=8000:sp=occurrence:random_seed=765902034:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.97/1.13 % (1039621)Instruction limit reached!
% 2.97/1.13 % (1039621)------------------------------
% 2.97/1.13 % (1039621)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.97/1.13 % (1039621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.97/1.13 % (1039621)CaDiCaL version: 2.1.3
% 2.97/1.13 % (1039621)Termination reason: Instruction limit
% 2.97/1.13 % (1039621)Termination phase: Saturation
% 2.97/1.13 % (1039621)Time elapsed: 0.088 s
% 2.97/1.13 % (1039621)Peak memory usage: 92 MB
% 2.97/1.13 % (1039621)Instructions burned: 286 (million)
% 2.97/1.13 % (1039622)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1091394381:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.97/1.13 % (1039611)Refutation found. Thanks to Tanya!
% 2.97/1.13 % SZS status Theorem for theBenchmark
% 2.97/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 3.81/1.34 % (1039611)------------------------------
% 3.81/1.34 % (1039611)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.81/1.34 % (1039611)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.81/1.34 % (1039611)CaDiCaL version: 2.1.3
% 3.81/1.34 % (1039611)Termination reason: Refutation
% 3.81/1.34 % (1039611)Time elapsed: 0.010 s
% 3.81/1.34 % (1039611)Peak memory usage: 88 MB
% 3.81/1.34 % (1039611)Instructions burned: 15 (million)
% 3.81/1.34 % (1039611)------------------------------
% 3.81/1.34 % (1039611)------------------------------
% 3.81/1.34 % (1039602)Success in time 0.447 s
% 3.81/1.34 % Vampire exiting
%------------------------------------------------------------------------------