%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC222+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 : n010.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:00 PM UTC 2026
% Result : Theorem 2.91s 1.21s
% Output : Refutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 10
% Syntax : Number of formulae : 64 ( 10 unt; 1 def)
% Number of atoms : 293 ( 79 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 382 ( 153 ~; 149 |; 58 &)
% ( 1 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 2 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-3 aty)
% Number of variables : 113 ( 0 sgn 91 !; 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(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax22) ).
fof(f23,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> hd(cons(X1,X0)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax23) ).
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
| 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)
| ~ leq(X4,X7)
| leq(X7,X4) ) ) ) )
| ( nil != X2
& ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ~ ssList(X10)
| app(app(X9,cons(X8,nil)),X10) != X2
| ? [X11] :
( ssItem(X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& memberP(X10,X11)
& lt(X8,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)
| X1 != X3
| X0 != 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)
| ~ leq(X4,X7)
| leq(X7,X4) ) ) ) )
| ( nil != X2
& ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ~ ssList(X10)
| app(app(X9,cons(X8,nil)),X10) != X2
| ? [X11] :
( ssItem(X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& memberP(X10,X11)
& lt(X8,X11) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f123,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f124,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(flattening,[],[f123]) ).
fof(f126,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f127,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f126]) ).
fof(f128,plain,
! [X0] :
( ! [X1] :
( hd(cons(X1,X0)) = X1
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f148,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f198,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = 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)
& leq(X4,X7)
& ~ leq(X7,X4) ) ) ) )
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ssList(X10)
& app(app(X9,cons(X8,nil)),X10) = X2
& ! [X11] :
( ~ ssItem(X11)
| leq(X8,X11)
| ~ memberP(X9,X11)
| ~ memberP(X10,X11)
| ~ lt(X8,X11) ) )
& ssList(X9) )
& ssItem(X8) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f273,plain,
! [X0] :
( nil = X0
| ( ssList(sK49(X0))
& ssItem(sK50(X0))
& cons(sK50(X0),sK49(X0)) = X0 )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK49,sK50]),skolemize(X1,sK49(X0)),skolemize(X2,sK50(X0))],[f124]) ).
fof(f295,plain,
( ssList(sK56)
& sK54 = sK56
& sK53 = sK55
& nil != sK53
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK53
| ( ssItem(sK57(X4,X5,X6))
& memberP(X5,sK57(X4,X5,X6))
& memberP(X6,sK57(X4,X5,X6))
& leq(X4,sK57(X4,X5,X6))
& ~ leq(sK57(X4,X5,X6),X4) ) ) ) )
& ( nil = sK55
| ( ssList(sK60)
& sK55 = app(app(sK59,cons(sK58,nil)),sK60)
& ! [X11] :
( ~ ssItem(X11)
| leq(sK58,X11)
| ~ memberP(sK59,X11)
| ~ memberP(sK60,X11)
| ~ lt(sK58,X11) )
& ssList(sK59)
& ssItem(sK58) ) )
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59,sK60]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X7,sK57(X4,X5,X6)),skolemize(X8,sK58),skolemize(X9,sK59),skolemize(X10,sK60)],[f221]) ).
fof(f387,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f388,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f392,plain,
! [X0] :
( cons(sK50(X0),sK49(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f393,plain,
! [X0] :
( ssItem(sK50(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f394,plain,
! [X0] :
( ssList(sK49(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f396,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f397,plain,
! [X0,X1] :
( hd(cons(X1,X0)) = X1
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f128]) ).
fof(f402,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f418,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f476,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f198]) ).
fof(f495,plain,
ssList(sK53),
inference(cnf_transformation,[],[f295]) ).
fof(f506,plain,
! [X6,X4,X5] :
( memberP(X5,sK57(X4,X5,X6))
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK53
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f295]) ).
fof(f507,plain,
! [X6,X4,X5] :
( ssItem(sK57(X4,X5,X6))
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK53
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f295]) ).
fof(f508,plain,
nil != sK53,
inference(cnf_transformation,[],[f295]) ).
fof(f575,definition,
( spl61_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl61_7])],[avatar_definition]) ).
fof(f576,plain,
( ssList(nil)
| ~ spl61_7 ),
inference(avatar_component_clause,[],[f575]) ).
fof(f608,plain,
spl61_7,
inference(avatar_split_clause,[],[f388,f575]) ).
fof(f622,plain,
! [X0,X1] :
( ~ ssItem(sK57(X0,nil,X1))
| ~ ssList(nil)
| ~ ssList(X1)
| sK53 != app(app(nil,cons(X0,nil)),X1)
| ~ ssItem(X0) ),
inference(resolution,[],[f418,f506]) ).
fof(f623,plain,
! [X0,X1] :
( ~ ssList(nil)
| ~ ssList(X1)
| sK53 != app(app(nil,cons(X0,nil)),X1)
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[],[f622,f507]) ).
fof(f625,plain,
( ! [X0,X1] :
( sK53 != app(app(nil,cons(X0,nil)),X1)
| ~ ssList(X1)
| ~ ssItem(X0) )
| ~ spl61_7 ),
inference(forward_subsumption_resolution,[],[f623,f576]) ).
fof(f627,plain,
( ! [X0,X1] :
( ~ ssList(cons(X0,nil))
| ~ ssList(X1)
| ~ ssItem(X0)
| sK53 != app(cons(X0,nil),X1) )
| ~ spl61_7 ),
inference(superposition,[],[f625,f402]) ).
fof(f637,plain,
( ! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| app(cons(X1,nil),X0) != sK53
| ~ ssItem(X1)
| ~ ssList(nil) )
| ~ spl61_7 ),
inference(resolution,[],[f627,f387]) ).
fof(f639,plain,
( ! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| app(cons(X1,nil),X0) != sK53
| ~ ssList(nil) )
| ~ spl61_7 ),
inference(duplicate_literal_removal,[],[f637]) ).
fof(f640,plain,
( ! [X0,X1] :
( app(cons(X1,nil),X0) != sK53
| ~ ssItem(X1)
| ~ ssList(X0) )
| ~ spl61_7 ),
inference(forward_subsumption_resolution,[],[f639,f576]) ).
fof(f696,plain,
! [X0] :
( hd(X0) = sK50(X0)
| ~ ssItem(sK50(X0))
| ~ ssList(sK49(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f397,f392]) ).
fof(f703,plain,
! [X0] :
( hd(X0) = sK50(X0)
| ~ ssList(sK49(X0))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f696,f393]) ).
fof(f707,plain,
! [X0] :
( hd(X0) = sK50(X0)
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f703,f394]) ).
fof(f764,plain,
! [X0] :
( cons(hd(X0),sK49(X0)) = X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f392,f707]) ).
fof(f767,plain,
! [X0] :
( cons(hd(X0),sK49(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f764]) ).
fof(f804,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK53
| ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl61_7 ),
inference(superposition,[],[f640,f476]) ).
fof(f813,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK53
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl61_7 ),
inference(duplicate_literal_removal,[],[f804]) ).
fof(f819,plain,
( ! [X0] :
( sK53 != X0
| ~ ssItem(hd(X0))
| ~ ssList(sK49(X0))
| nil = X0
| ~ ssList(X0) )
| ~ spl61_7 ),
inference(superposition,[],[f813,f767]) ).
fof(f820,plain,
( ! [X0] :
( sK53 != X0
| ~ ssList(sK49(X0))
| nil = X0
| ~ ssList(X0) )
| ~ spl61_7 ),
inference(forward_subsumption_resolution,[],[f819,f396]) ).
fof(f824,plain,
( ! [X0] :
( sK53 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl61_7 ),
inference(forward_subsumption_resolution,[],[f820,f394]) ).
fof(f834,plain,
( nil = sK53
| ~ ssList(sK53)
| ~ spl61_7 ),
inference(equality_resolution,[],[f824]) ).
fof(f835,plain,
( ~ ssList(sK53)
| ~ spl61_7 ),
inference(forward_subsumption_resolution,[],[f834,f508]) ).
fof(f836,plain,
( $false
| ~ spl61_7 ),
inference(forward_subsumption_resolution,[],[f835,f495]) ).
fof(f837,plain,
~ spl61_7,
inference(avatar_contradiction_clause,[],[f836]) ).
cnf(s14,plain,
spl61_7,
inference(sat_conversion,[],[f608]) ).
cnf(s18,plain,
~ spl61_7,
inference(sat_conversion,[],[f837]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s14,s18]) ).
fof(f838,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC222+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.12/0.25 % Computer : n010.cluster.edu
% 0.12/0.25 % Model : x86_64 x86_64
% 0.12/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.25 % Memory : 8046.5625MB
% 0.12/0.25 % OS : Linux 6.8.0-71-generic
% 0.12/0.25 % CPULimit : 300
% 0.12/0.25 % WCLimit : 300
% 0.12/0.25 % DateTime : Mon Sep 28 08:33:02 UTC 2026
% 0.12/0.26 % CPUTime :
% 0.12/0.26 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.31 Running first-order theorem proving
% 0.24/0.31 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
% 2.91/1.21 % (1771088)Detected formulas, will run a generic FOF schedule.
% 2.91/1.21 % (1771101)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=1798135404:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.91/1.21 % (1771106)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2374039992:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.91/1.21 % (1771106)First to succeed.
% 2.91/1.21 % (1771106)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1771088"
% 2.91/1.21 % (1771103)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=3279618777:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.91/1.21 % (1771102)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=4243577880:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.91/1.21 % (1771104)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3294233055:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.91/1.21 % (1771105)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=787611403:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.91/1.21 % (1771107)dis-21_1_sil=8000:lcm=predicate:random_seed=3913010028: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.91/1.21 % (1771105)Instruction limit reached!
% 2.91/1.21 % (1771105)------------------------------
% 2.91/1.21 % (1771105)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.91/1.21 % (1771105)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/1.21 % (1771105)CaDiCaL version: 2.1.3
% 2.91/1.21 % (1771105)Termination reason: Instruction limit
% 2.91/1.21 % (1771105)Termination phase: Saturation
% 2.91/1.21 % (1771105)Time elapsed: 0.117 s
% 2.91/1.21 % (1771105)Peak memory usage: 88 MB
% 2.91/1.21 % (1771105)Instructions burned: 120 (million)
% 2.91/1.21 % (1771104)Instruction limit reached!
% 2.91/1.21 % (1771104)------------------------------
% 2.91/1.21 % (1771104)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.91/1.21 % (1771104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/1.21 % (1771104)CaDiCaL version: 2.1.3
% 2.91/1.21 % (1771104)Termination reason: Instruction limit
% 2.91/1.21 % (1771104)Termination phase: Saturation
% 2.91/1.21 % (1771104)Time elapsed: 0.122 s
% 2.91/1.21 % (1771104)Peak memory usage: 90 MB
% 2.91/1.21 % (1771104)Instructions burned: 110 (million)
% 2.91/1.21 % (1771107)Instruction limit reached!
% 2.91/1.21 % (1771107)------------------------------
% 2.91/1.21 % (1771107)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.91/1.21 % (1771107)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/1.21 % (1771107)CaDiCaL version: 2.1.3
% 2.91/1.21 % (1771107)Termination reason: Instruction limit
% 2.91/1.21 % (1771107)Termination phase: Saturation
% 2.91/1.21 % (1771107)Time elapsed: 0.127 s
% 2.91/1.21 % (1771107)Peak memory usage: 91 MB
% 2.91/1.21 % (1771107)Instructions burned: 130 (million)
% 2.91/1.21 % (1771106)Refutation found. Thanks to Tanya!
% 2.91/1.21 % SZS status Theorem for theBenchmark
% 2.91/1.21 % SZS output start Proof for theBenchmark
% See solution above
% 3.73/1.42 % (1771106)------------------------------
% 3.73/1.42 % (1771106)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.73/1.42 % (1771106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.73/1.42 % (1771106)CaDiCaL version: 2.1.3
% 3.73/1.42 % (1771106)Termination reason: Refutation
% 3.73/1.42 % (1771106)Time elapsed: 0.016 s
% 3.73/1.42 % (1771106)Peak memory usage: 90 MB
% 3.73/1.42 % (1771106)Instructions burned: 26 (million)
% 3.73/1.42 % (1771106)------------------------------
% 3.73/1.42 % (1771106)------------------------------
% 3.73/1.42 % (1771088)Success in time 0.417 s
% 3.73/1.42 % Vampire exiting
%------------------------------------------------------------------------------