%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC248+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 : n002.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:07 PM UTC 2026
% Result : Theorem 0.65s 0.98s
% Output : Refutation 2.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 7
% Syntax : Number of formulae : 60 ( 10 unt; 0 def)
% Number of atoms : 339 ( 92 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 463 ( 184 ~; 186 |; 78 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 130 ( 95 !; 35 ?)
% 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
| 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)
=> ! [X9] :
( ~ ssList(X9)
| app(app(X8,X2),X9) != X3
| ~ totalorderedP(X2)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(X11,cons(X10,nil)) = X8
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(cons(X12,nil),X13) = X2
& leq(X10,X12) ) ) ) )
| ? [X14] :
( ssItem(X14)
& ? [X15] :
( ssList(X15)
& app(cons(X14,nil),X15) = X9
& ? [X16] :
( ssItem(X16)
& ? [X17] :
( ssList(X17)
& app(X17,cons(X16,nil)) = X2
& leq(X16,X14) ) ) ) ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ),
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)
| ~ lt(X4,X7)
| leq(X4,X7) ) ) ) )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ~ ssList(X9)
| app(app(X8,X2),X9) != X3
| ~ totalorderedP(X2)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(X11,cons(X10,nil)) = X8
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(cons(X12,nil),X13) = X2
& leq(X10,X12) ) ) ) )
| ? [X14] :
( ssItem(X14)
& ? [X15] :
( ssList(X15)
& app(cons(X14,nil),X15) = X9
& ? [X16] :
( ssItem(X16)
& ? [X17] :
( ssList(X17)
& app(X17,cons(X16,nil)) = X2
& leq(X16,X14) ) ) ) ) ) )
| ( 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] :
( ? [X9] :
( ssList(X9)
& app(app(X8,X2),X9) = X3
& totalorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != X8
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(cons(X12,nil),X13) != X2
| ~ leq(X10,X12) ) ) ) )
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ~ ssList(X15)
| app(cons(X14,nil),X15) != X9
| ! [X16] :
( ~ ssItem(X16)
| ! [X17] :
( ~ ssList(X17)
| app(X17,cons(X16,nil)) != X2
| ~ leq(X16,X14) ) ) ) ) )
& ssList(X8) )
& ( 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(f147,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(sK6)
& sK3 = app(app(sK5,sK2),sK6)
& totalorderedP(sK2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != sK5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(cons(X12,nil),X13) != sK2
| ~ leq(X10,X12) ) ) ) )
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ~ ssList(X15)
| app(cons(X14,nil),X15) != sK6
| ! [X16] :
( ~ ssItem(X16)
| ! [X17] :
( ~ ssList(X17)
| app(X17,cons(X16,nil)) != sK2
| ~ leq(X16,X14) ) ) ) )
& ssList(sK5)
& ( nil = sK3
| nil != sK2 )
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X7,sK4(X4,X5,X6)),skolemize(X8,sK5),skolemize(X9,sK6)],[f98]) ).
fof(f149,plain,
! [X0] :
( nil = X0
| ( ssList(sK9(X0))
& ssItem(sK10(X0))
& cons(sK10(X0),sK9(X0)) = X0 )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10]),skolemize(X1,sK9(X0)),skolemize(X2,sK10(X0))],[f101]) ).
fof(f169,plain,
ssList(sK2),
inference(cnf_transformation,[],[f147]) ).
fof(f180,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,[],[f147]) ).
fof(f181,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,[],[f147]) ).
fof(f182,plain,
nil != sK0,
inference(cnf_transformation,[],[f147]) ).
fof(f183,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f147]) ).
fof(f190,plain,
! [X0] :
( cons(sK10(X0),sK9(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f191,plain,
! [X0] :
( ssItem(sK10(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f192,plain,
! [X0] :
( ssList(sK9(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f196,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f202,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f205,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f208,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f209,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f251,plain,
nil != sK2,
inference(definition_unfolding,[],[f182,f183]) ).
fof(f252,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,[],[f181,f183]) ).
fof(f253,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,[],[f180,f183]) ).
fof(f287,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,[],[f253,f205]) ).
fof(f288,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,[],[f252,f205]) ).
fof(f289,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,[],[f288,f208]) ).
fof(f290,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,[],[f287,f208]) ).
fof(f379,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,[],[f289,f202]) ).
fof(f380,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,[],[f290,f202]) ).
fof(f405,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,[],[f380]) ).
fof(f406,plain,
! [X0,X1] :
( cons(X0,X1) != sK2
| ~ ssList(X1)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(duplicate_literal_removal,[],[f379]) ).
fof(f414,plain,
! [X0] :
( sK2 != X0
| ~ ssList(sK9(X0))
| ~ ssItem(sK10(X0))
| ssItem(sK4(sK10(X0),nil,sK9(X0)))
| ~ ssList(cons(sK10(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f406,f190]) ).
fof(f415,plain,
! [X0] :
( sK2 != X0
| ~ ssItem(sK10(X0))
| ssItem(sK4(sK10(X0),nil,sK9(X0)))
| ~ ssList(cons(sK10(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f414,f192]) ).
fof(f416,plain,
! [X0] :
( sK2 != X0
| ssItem(sK4(sK10(X0),nil,sK9(X0)))
| ~ ssList(cons(sK10(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f415,f191]) ).
fof(f437,plain,
! [X0] :
( sK2 != X0
| ~ ssList(sK9(X0))
| ~ ssItem(sK10(X0))
| memberP(nil,sK4(sK10(X0),nil,sK9(X0)))
| ~ ssList(cons(sK10(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f405,f190]) ).
fof(f438,plain,
! [X0] :
( sK2 != X0
| ~ ssItem(sK10(X0))
| memberP(nil,sK4(sK10(X0),nil,sK9(X0)))
| ~ ssList(cons(sK10(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f437,f192]) ).
fof(f439,plain,
! [X0] :
( sK2 != X0
| memberP(nil,sK4(sK10(X0),nil,sK9(X0)))
| ~ ssList(cons(sK10(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f438,f191]) ).
fof(f440,plain,
( ssItem(sK4(sK10(sK2),nil,sK9(sK2)))
| ~ ssList(cons(sK10(sK2),nil))
| nil = sK2
| ~ ssList(sK2) ),
inference(equality_resolution,[],[f416]) ).
fof(f441,plain,
( ssItem(sK4(sK10(sK2),nil,sK9(sK2)))
| ~ ssList(cons(sK10(sK2),nil))
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f440,f251]) ).
fof(f442,plain,
( ssItem(sK4(sK10(sK2),nil,sK9(sK2)))
| ~ ssList(cons(sK10(sK2),nil)) ),
inference(forward_subsumption_resolution,[],[f441,f169]) ).
fof(f451,plain,
( memberP(nil,sK4(sK10(sK2),nil,sK9(sK2)))
| ~ ssList(cons(sK10(sK2),nil))
| nil = sK2
| ~ ssList(sK2) ),
inference(equality_resolution,[],[f439]) ).
fof(f452,plain,
( memberP(nil,sK4(sK10(sK2),nil,sK9(sK2)))
| ~ ssList(cons(sK10(sK2),nil))
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f451,f251]) ).
fof(f453,plain,
( memberP(nil,sK4(sK10(sK2),nil,sK9(sK2)))
| ~ ssList(cons(sK10(sK2),nil)) ),
inference(forward_subsumption_resolution,[],[f452,f169]) ).
fof(f454,plain,
( ~ ssList(cons(sK10(sK2),nil))
| ~ ssItem(sK4(sK10(sK2),nil,sK9(sK2))) ),
inference(resolution,[],[f453,f209]) ).
fof(f455,plain,
~ ssList(cons(sK10(sK2),nil)),
inference(forward_subsumption_resolution,[],[f454,f442]) ).
fof(f464,plain,
( ~ ssItem(sK10(sK2))
| ~ ssList(nil) ),
inference(resolution,[],[f455,f196]) ).
fof(f465,plain,
~ ssItem(sK10(sK2)),
inference(forward_subsumption_resolution,[],[f464,f208]) ).
fof(f474,plain,
( nil = sK2
| ~ ssList(sK2) ),
inference(resolution,[],[f465,f191]) ).
fof(f475,plain,
~ ssList(sK2),
inference(forward_subsumption_resolution,[],[f474,f251]) ).
fof(f476,plain,
$false,
inference(forward_subsumption_resolution,[],[f475,f169]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC248+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.07/0.19 % Computer : n002.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:43:52 UTC 2026
% 0.07/0.20 % CPUTime :
% 0.07/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running first-order theorem proving
% 0.07/0.23 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
% 0.65/0.98 % (215101)Detected formulas, will run a generic FOF schedule.
% 0.65/0.98 % (215110)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1301878414:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.65/0.98 % (215110)First to succeed.
% 0.65/0.98 % (215110)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-215101"
% 0.65/0.98 % (215109)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3992918106:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.65/0.98 % (215106)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=2617229656:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.65/0.98 % (215111)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2530628265:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.65/0.98 % (215108)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=2138719092:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.65/0.98 % (215112)dis-21_1_sil=8000:lcm=predicate:random_seed=4119157939: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)
% 0.65/0.98 % (215107)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=2463577194:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.65/0.98 % (215109)Instruction limit reached!
% 0.65/0.98 % (215109)------------------------------
% 0.65/0.98 % (215109)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.65/0.98 % (215109)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.65/0.98 % (215109)CaDiCaL version: 2.1.3
% 0.65/0.98 % (215109)Termination reason: Instruction limit
% 0.65/0.98 % (215109)Termination phase: Saturation
% 0.65/0.98 % (215109)Time elapsed: 0.068 s
% 0.65/0.98 % (215109)Peak memory usage: 89 MB
% 0.65/0.98 % (215109)Instructions burned: 110 (million)
% 0.65/0.98 % (215112)Instruction limit reached!
% 0.65/0.98 % (215112)------------------------------
% 0.65/0.98 % (215112)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.65/0.98 % (215112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.65/0.98 % (215112)CaDiCaL version: 2.1.3
% 0.65/0.98 % (215112)Termination reason: Instruction limit
% 0.65/0.98 % (215112)Termination phase: Saturation
% 0.65/0.98 % (215112)Time elapsed: 0.070 s
% 0.65/0.98 % (215112)Peak memory usage: 90 MB
% 0.65/0.98 % (215112)Instructions burned: 130 (million)
% 0.65/0.98 % (215111)Instruction limit reached!
% 0.65/0.98 % (215111)------------------------------
% 0.65/0.98 % (215111)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.65/0.98 % (215111)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.65/0.98 % (215111)CaDiCaL version: 2.1.3
% 0.65/0.98 % (215111)Termination reason: Instruction limit
% 0.65/0.98 % (215111)Termination phase: Saturation
% 0.65/0.98 % (215111)Time elapsed: 0.093 s
% 0.65/0.98 % (215111)Peak memory usage: 90 MB
% 0.65/0.98 % (215111)Instructions burned: 139 (million)
% 0.65/0.98 % (215110)Refutation found. Thanks to Tanya!
% 0.65/0.98 % SZS status Theorem for theBenchmark
% 0.65/0.98 % SZS output start Proof for theBenchmark
% See solution above
% 2.81/1.17 % (215110)------------------------------
% 2.81/1.17 % (215110)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.81/1.17 % (215110)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.81/1.17 % (215110)CaDiCaL version: 2.1.3
% 2.81/1.17 % (215110)Termination reason: Refutation
% 2.81/1.17 % (215110)Time elapsed: 0.006 s
% 2.81/1.17 % (215110)Peak memory usage: 88 MB
% 2.81/1.17 % (215110)Instructions burned: 16 (million)
% 2.81/1.17 % (215110)------------------------------
% 2.81/1.17 % (215110)------------------------------
% 2.81/1.17 % (215101)Success in time 0.306 s
% 2.81/1.17 % Vampire exiting
%------------------------------------------------------------------------------