%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC245+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 : n016.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.04s 1.11s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 7
% Syntax : Number of formulae : 60 ( 10 unt; 0 def)
% Number of atoms : 299 ( 84 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 405 ( 166 ~; 168 |; 58 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 107 ( 83 !; 24 ?)
% 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(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
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(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)
| ~ lt(X4,X7)
| leq(X4,X7) ) ) ) )
| ! [X8] :
( ~ ssList(X8)
| app(X2,X8) != X3
| ~ equalelemsP(X2)
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X8
& ? [X11] :
( ssList(X11)
& app(X11,cons(X9,nil)) = X2 ) ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ),
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
| 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) ) ) ) )
| ! [X8] :
( ~ ssList(X8)
| app(X2,X8) != X3
| ~ equalelemsP(X2)
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X8
& ? [X11] :
( ssList(X11)
& app(X11,cons(X9,nil)) = X2 ) ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,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)
& lt(X4,X7)
& ~ leq(X4,X7) ) ) ) )
& ? [X8] :
( ssList(X8)
& app(X2,X8) = X3
& equalelemsP(X2)
& ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| app(cons(X9,nil),X10) != X8
| ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X9,nil)) != X2 ) ) ) )
& ( nil = X3
| nil != X2 ) )
& 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(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(f117,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f139,plain,
( ssList(sK3)
& sK1 = sK3
& sK0 = sK2
& nil != sK0
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK0
| ( ssItem(sK4(X4,X5,X6))
& memberP(X5,sK4(X4,X5,X6))
& memberP(X6,sK4(X4,X5,X6))
& lt(X4,sK4(X4,X5,X6))
& ~ leq(X4,sK4(X4,X5,X6)) ) ) ) )
& ssList(sK5)
& sK3 = app(sK2,sK5)
& equalelemsP(sK2)
& ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| app(cons(X9,nil),X10) != sK5
| ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X9,nil)) != sK2 ) ) )
& ( nil = sK3
| nil != sK2 )
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X7,sK4(X4,X5,X6)),skolemize(X8,sK5)],[f98]) ).
fof(f141,plain,
! [X0] :
( nil = X0
| ( ssList(sK8(X0))
& ssItem(sK9(X0))
& cons(sK9(X0),sK8(X0)) = X0 )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X1,sK8(X0)),skolemize(X2,sK9(X0))],[f101]) ).
fof(f158,plain,
ssList(sK2),
inference(cnf_transformation,[],[f139]) ).
fof(f167,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,[],[f139]) ).
fof(f168,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,[],[f139]) ).
fof(f169,plain,
nil != sK0,
inference(cnf_transformation,[],[f139]) ).
fof(f170,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f139]) ).
fof(f177,plain,
! [X0] :
( cons(sK9(X0),sK8(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f141]) ).
fof(f178,plain,
! [X0] :
( ssItem(sK9(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f141]) ).
fof(f179,plain,
! [X0] :
( ssList(sK8(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f141]) ).
fof(f183,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f189,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f192,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f195,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f196,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f227,plain,
nil != sK2,
inference(definition_unfolding,[],[f169,f170]) ).
fof(f228,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,[],[f168,f170]) ).
fof(f229,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,[],[f167,f170]) ).
fof(f259,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,[],[f229,f192]) ).
fof(f260,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,[],[f228,f192]) ).
fof(f261,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,[],[f260,f195]) ).
fof(f262,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,[],[f259,f195]) ).
fof(f319,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,[],[f261,f189]) ).
fof(f320,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,[],[f262,f189]) ).
fof(f345,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,[],[f320]) ).
fof(f346,plain,
! [X0,X1] :
( cons(X0,X1) != sK2
| ~ ssList(X1)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(duplicate_literal_removal,[],[f319]) ).
fof(f362,plain,
! [X0] :
( sK2 != X0
| ~ ssList(sK8(X0))
| ~ ssItem(sK9(X0))
| ssItem(sK4(sK9(X0),nil,sK8(X0)))
| ~ ssList(cons(sK9(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f346,f177]) ).
fof(f363,plain,
! [X0] :
( sK2 != X0
| ~ ssItem(sK9(X0))
| ssItem(sK4(sK9(X0),nil,sK8(X0)))
| ~ ssList(cons(sK9(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f362,f179]) ).
fof(f364,plain,
! [X0] :
( sK2 != X0
| ssItem(sK4(sK9(X0),nil,sK8(X0)))
| ~ ssList(cons(sK9(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f363,f178]) ).
fof(f381,plain,
! [X0] :
( sK2 != X0
| ~ ssList(sK8(X0))
| ~ ssItem(sK9(X0))
| memberP(nil,sK4(sK9(X0),nil,sK8(X0)))
| ~ ssList(cons(sK9(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f345,f177]) ).
fof(f382,plain,
! [X0] :
( sK2 != X0
| ~ ssItem(sK9(X0))
| memberP(nil,sK4(sK9(X0),nil,sK8(X0)))
| ~ ssList(cons(sK9(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f381,f179]) ).
fof(f383,plain,
! [X0] :
( sK2 != X0
| memberP(nil,sK4(sK9(X0),nil,sK8(X0)))
| ~ ssList(cons(sK9(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f382,f178]) ).
fof(f393,plain,
( ssItem(sK4(sK9(sK2),nil,sK8(sK2)))
| ~ ssList(cons(sK9(sK2),nil))
| nil = sK2
| ~ ssList(sK2) ),
inference(equality_resolution,[],[f364]) ).
fof(f394,plain,
( ssItem(sK4(sK9(sK2),nil,sK8(sK2)))
| ~ ssList(cons(sK9(sK2),nil))
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f393,f227]) ).
fof(f395,plain,
( ssItem(sK4(sK9(sK2),nil,sK8(sK2)))
| ~ ssList(cons(sK9(sK2),nil)) ),
inference(forward_subsumption_resolution,[],[f394,f158]) ).
fof(f407,plain,
( memberP(nil,sK4(sK9(sK2),nil,sK8(sK2)))
| ~ ssList(cons(sK9(sK2),nil))
| nil = sK2
| ~ ssList(sK2) ),
inference(equality_resolution,[],[f383]) ).
fof(f408,plain,
( memberP(nil,sK4(sK9(sK2),nil,sK8(sK2)))
| ~ ssList(cons(sK9(sK2),nil))
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f407,f227]) ).
fof(f409,plain,
( memberP(nil,sK4(sK9(sK2),nil,sK8(sK2)))
| ~ ssList(cons(sK9(sK2),nil)) ),
inference(forward_subsumption_resolution,[],[f408,f158]) ).
fof(f414,plain,
( ~ ssList(cons(sK9(sK2),nil))
| ~ ssItem(sK4(sK9(sK2),nil,sK8(sK2))) ),
inference(resolution,[],[f409,f196]) ).
fof(f415,plain,
~ ssList(cons(sK9(sK2),nil)),
inference(forward_subsumption_resolution,[],[f414,f395]) ).
fof(f420,plain,
( ~ ssItem(sK9(sK2))
| ~ ssList(nil) ),
inference(resolution,[],[f415,f183]) ).
fof(f421,plain,
~ ssItem(sK9(sK2)),
inference(forward_subsumption_resolution,[],[f420,f195]) ).
fof(f422,plain,
( nil = sK2
| ~ ssList(sK2) ),
inference(resolution,[],[f421,f178]) ).
fof(f423,plain,
~ ssList(sK2),
inference(forward_subsumption_resolution,[],[f422,f227]) ).
fof(f424,plain,
$false,
inference(forward_subsumption_resolution,[],[f423,f158]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC245+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.19 % Computer : n016.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.20 % CPULimit : 300
% 0.07/0.20 % WCLimit : 300
% 0.07/0.20 % DateTime : Mon Sep 28 08:45:53 UTC 2026
% 0.07/0.20 % CPUTime :
% 0.07/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running first-order theorem proving
% 0.07/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
% 3.04/1.11 % (3483456)Detected formulas, will run a generic FOF schedule.
% 3.04/1.11 % (3483464)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4200370981:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.04/1.11 % (3483464)Instruction limit reached!
% 3.04/1.11 % (3483464)------------------------------
% 3.04/1.11 % (3483464)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.04/1.11 % (3483464)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/1.11 % (3483464)CaDiCaL version: 2.1.3
% 3.04/1.11 % (3483464)Termination reason: Instruction limit
% 3.04/1.11 % (3483464)Termination phase: Saturation
% 3.04/1.11 % (3483464)Time elapsed: 0.038 s
% 3.04/1.11 % (3483464)Peak memory usage: 89 MB
% 3.04/1.11 % (3483464)Instructions burned: 111 (million)
% 3.04/1.11 % (3483461)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=1578740886:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.04/1.11 % (3483465)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3610181857:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.04/1.11 % (3483463)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=1822829472:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.04/1.11 % (3483462)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=3885870975:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.04/1.11 % (3483465)First to succeed.
% 3.04/1.11 % (3483467)dis-21_1_sil=8000:lcm=predicate:random_seed=409454948: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.04/1.11 % (3483466)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2175012441:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.04/1.11 % (3483465)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3483456"
% 3.04/1.11 % (3483467)Instruction limit reached!
% 3.04/1.11 % (3483467)------------------------------
% 3.04/1.11 % (3483467)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.04/1.11 % (3483467)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/1.11 % (3483467)CaDiCaL version: 2.1.3
% 3.04/1.11 % (3483467)Termination reason: Instruction limit
% 3.04/1.11 % (3483467)Termination phase: Saturation
% 3.04/1.11 % (3483467)Time elapsed: 0.071 s
% 3.04/1.11 % (3483467)Peak memory usage: 90 MB
% 3.04/1.11 % (3483467)Instructions burned: 130 (million)
% 3.04/1.11 % (3483466)Instruction limit reached!
% 3.04/1.11 % (3483466)------------------------------
% 3.04/1.11 % (3483466)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.04/1.11 % (3483466)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/1.11 % (3483466)CaDiCaL version: 2.1.3
% 3.04/1.11 % (3483466)Termination reason: Instruction limit
% 3.04/1.11 % (3483466)Termination phase: Saturation
% 3.04/1.11 % (3483466)Time elapsed: 0.094 s
% 3.04/1.11 % (3483466)Peak memory usage: 90 MB
% 3.04/1.11 % (3483466)Instructions burned: 139 (million)
% 3.04/1.11 % (3483473)lrs+10_1_sil=8000:sp=occurrence:random_seed=1625451082:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.04/1.11 % (3483473)Instruction limit reached!
% 3.04/1.11 % (3483473)------------------------------
% 3.04/1.11 % (3483473)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.04/1.11 % (3483473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.04/1.11 % (3483473)CaDiCaL version: 2.1.3
% 3.04/1.11 % (3483473)Termination reason: Instruction limit
% 3.04/1.11 % (3483473)Termination phase: Saturation
% 3.04/1.11 % (3483473)Time elapsed: 0.090 s
% 3.04/1.11 % (3483473)Peak memory usage: 92 MB
% 3.04/1.11 % (3483473)Instructions burned: 287 (million)
% 3.04/1.11 % (3483476)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3882657145:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.04/1.11 % (3483465)Refutation found. Thanks to Tanya!
% 3.04/1.11 % SZS status Theorem for theBenchmark
% 3.04/1.11 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/1.30 % (3483465)------------------------------
% 0.19/1.30 % (3483465)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.19/1.30 % (3483465)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/1.30 % (3483465)CaDiCaL version: 2.1.3
% 0.19/1.30 % (3483465)Termination reason: Refutation
% 0.19/1.30 % (3483465)Time elapsed: 0.010 s
% 0.19/1.30 % (3483465)Peak memory usage: 88 MB
% 0.19/1.30 % (3483465)Instructions burned: 13 (million)
% 0.19/1.30 % (3483465)------------------------------
% 0.19/1.30 % (3483465)------------------------------
% 0.19/1.30 % (3483456)Success in time 0.432 s
% 0.19/1.30 % Vampire exiting
%------------------------------------------------------------------------------