%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC226+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 : n003.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:01 PM UTC 2026
% Result : Theorem 4.59s 1.34s
% Output : Refutation 5.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 8
% Syntax : Number of formulae : 64 ( 13 unt; 1 def)
% Number of atoms : 328 ( 104 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 447 ( 183 ~; 166 |; 78 &)
% ( 1 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 135 ( 0 sgn 103 !; 32 ?)
% 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)
| ~ leq(X4,X7)
| leq(X7,X4) ) ) ) ) )
| ! [X8] :
( ssList(X8)
=> ( app(X2,X8) != X3
| ~ totalorderedP(X2)
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X8
& ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(X12,cons(X11,nil)) = X2
& leq(X11,X9) ) ) ) ) ) )
| ( 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)
| ~ leq(X4,X7)
| leq(X7,X4) ) ) ) ) )
| ! [X8] :
( ssList(X8)
=> ( app(X2,X8) != X3
| ~ totalorderedP(X2)
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X8
& ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(X12,cons(X11,nil)) = X2
& leq(X11,X9) ) ) ) ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [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] :
( memberP(X5,X7)
& memberP(X6,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) ) ) ) )
& ? [X8] :
( app(X2,X8) = X3
& totalorderedP(X2)
& ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| app(cons(X9,nil),X10) != X8
| ! [X11] :
( ~ ssItem(X11)
| ! [X12] :
( ~ ssList(X12)
| app(X12,cons(X11,nil)) != X2
| ~ leq(X11,X9) ) ) ) )
& ssList(X8) )
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [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] :
( memberP(X5,X7)
& memberP(X6,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) ) ) ) )
& ? [X8] :
( app(X2,X8) = X3
& totalorderedP(X2)
& ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| app(cons(X9,nil),X10) != X8
| ! [X11] :
( ~ ssItem(X11)
| ! [X12] :
( ~ ssList(X12)
| app(X12,cons(X11,nil)) != X2
| ~ leq(X11,X9) ) ) ) )
& ssList(X8) )
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f118,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f119,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(flattening,[],[f118]) ).
fof(f123,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f158,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f163,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f184,plain,
( sK7 = sK9
& sK6 = sK8
& nil != sK6
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK6
| ( memberP(X5,sK10(X4,X5,X6))
& memberP(X6,sK10(X4,X5,X6))
& leq(X4,sK10(X4,X5,X6))
& ~ leq(sK10(X4,X5,X6),X4)
& ssItem(sK10(X4,X5,X6)) ) ) ) )
& sK9 = app(sK8,sK11)
& totalorderedP(sK8)
& ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| app(cons(X9,nil),X10) != sK11
| ! [X11] :
( ~ ssItem(X11)
| ! [X12] :
( ~ ssList(X12)
| app(X12,cons(X11,nil)) != sK8
| ~ leq(X11,X9) ) ) ) )
& ssList(sK11)
& ( nil = sK9
| nil != sK8 )
& ssList(sK9)
& ssList(sK8)
& ssList(sK7)
& ssList(sK6) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8),skolemize(X3,sK9),skolemize(X7,sK10(X4,X5,X6)),skolemize(X8,sK11)],[f99]) ).
fof(f194,plain,
! [X0] :
( nil = X0
| ( ssList(sK14(X0))
& ssItem(sK15(X0))
& cons(sK15(X0),sK14(X0)) = X0 )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15]),skolemize(X1,sK14(X0)),skolemize(X2,sK15(X0))],[f119]) ).
fof(f241,plain,
ssList(sK6),
inference(cnf_transformation,[],[f184]) ).
fof(f250,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK6
| ssItem(sK10(X4,X5,X6)) ),
inference(cnf_transformation,[],[f184]) ).
fof(f254,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK6
| memberP(X5,sK10(X4,X5,X6)) ),
inference(cnf_transformation,[],[f184]) ).
fof(f255,plain,
nil != sK6,
inference(cnf_transformation,[],[f184]) ).
fof(f256,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f184]) ).
fof(f261,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f290,plain,
! [X0] :
( cons(sK15(X0),sK14(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f194]) ).
fof(f291,plain,
! [X0] :
( ssItem(sK15(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f194]) ).
fof(f292,plain,
! [X0] :
( ssList(sK14(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f194]) ).
fof(f296,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f386,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f398,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f399,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f163]) ).
fof(f411,plain,
nil != sK8,
inference(definition_unfolding,[],[f255,f256]) ).
fof(f412,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK8
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| memberP(X5,sK10(X4,X5,X6)) ),
inference(definition_unfolding,[],[f254,f256]) ).
fof(f416,plain,
! [X6,X4,X5] :
( ssItem(sK10(X4,X5,X6))
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK8
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f250,f256]) ).
fof(f418,plain,
ssList(sK8),
inference(definition_unfolding,[],[f241,f256]) ).
fof(f447,definition,
( spl57_1
<=> nil = sK8 ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f449,plain,
( nil != sK8
| spl57_1 ),
inference(avatar_component_clause,[],[f447]) ).
fof(f455,plain,
~ spl57_1,
inference(avatar_split_clause,[],[f411,f447]) ).
fof(f470,plain,
! [X0,X1] :
( sK8 != app(cons(X0,nil),X1)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK10(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f412,f386]) ).
fof(f471,plain,
! [X0,X1] :
( sK8 != app(cons(X0,nil),X1)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK10(X0,nil,X1)) ),
inference(forward_subsumption_resolution,[],[f470,f296]) ).
fof(f475,plain,
! [X0,X1] :
( memberP(nil,sK10(X0,nil,X1))
| ~ ssList(X1)
| ~ ssItem(X0)
| sK8 != app(cons(X0,nil),X1) ),
inference(forward_subsumption_resolution,[],[f471,f398]) ).
fof(f479,plain,
! [X0,X1] :
( ~ ssItem(sK10(X1,nil,X0))
| ~ ssItem(X1)
| app(cons(X1,nil),X0) != sK8
| ~ ssList(X0) ),
inference(resolution,[],[f475,f399]) ).
fof(f480,plain,
! [X0,X1] :
( ~ ssItem(X0)
| sK8 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X1)
| sK8 != app(app(nil,cons(X0,nil)),X1)
| ~ ssItem(X0) ),
inference(resolution,[],[f479,f416]) ).
fof(f481,plain,
! [X0,X1] :
( ~ ssItem(X0)
| sK8 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssList(nil)
| sK8 != app(app(nil,cons(X0,nil)),X1) ),
inference(duplicate_literal_removal,[],[f480]) ).
fof(f482,plain,
! [X0,X1] :
( sK8 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| sK8 != app(app(nil,cons(X0,nil)),X1) ),
inference(forward_subsumption_resolution,[],[f481,f398]) ).
fof(f543,plain,
! [X0,X1] :
( cons(X0,X1) != sK8
| ~ ssItem(X0)
| ~ ssList(X1)
| sK8 != app(app(nil,cons(X0,nil)),X1)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f482,f261]) ).
fof(f560,plain,
! [X0,X1] :
( sK8 != app(app(nil,cons(X0,nil)),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| cons(X0,X1) != sK8 ),
inference(duplicate_literal_removal,[],[f543]) ).
fof(f565,plain,
! [X0,X1] :
( ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1)
| cons(X0,X1) != sK8
| sK8 != app(cons(X0,nil),X1) ),
inference(superposition,[],[f560,f386]) ).
fof(f581,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| cons(X0,X1) != sK8
| sK8 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(nil) ),
inference(resolution,[],[f565,f296]) ).
fof(f582,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| cons(X0,X1) != sK8
| sK8 != app(cons(X0,nil),X1)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f581]) ).
fof(f583,plain,
! [X0,X1] :
( sK8 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| cons(X0,X1) != sK8
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[],[f582,f398]) ).
fof(f598,plain,
! [X0,X1] :
( cons(X0,X1) != sK8
| ~ ssList(X1)
| cons(X0,X1) != sK8
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f583,f261]) ).
fof(f601,plain,
! [X0,X1] :
( cons(X0,X1) != sK8
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f598]) ).
fof(f634,plain,
! [X0] :
( sK8 != X0
| ~ ssList(sK14(X0))
| ~ ssItem(sK15(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f601,f290]) ).
fof(f635,plain,
! [X0] :
( sK8 != X0
| ~ ssItem(sK15(X0))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f634,f292]) ).
fof(f636,plain,
! [X0] :
( sK8 != X0
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f635,f291]) ).
fof(f1363,plain,
( nil = sK8
| ~ ssList(sK8) ),
inference(equality_resolution,[],[f636]) ).
fof(f1364,plain,
( ~ ssList(sK8)
| spl57_1 ),
inference(forward_subsumption_resolution,[],[f1363,f449]) ).
fof(f1365,plain,
( $false
| spl57_1 ),
inference(forward_subsumption_resolution,[],[f1364,f418]) ).
fof(f1366,plain,
spl57_1,
inference(avatar_contradiction_clause,[],[f1365]) ).
cnf(s2,plain,
~ spl57_1,
inference(sat_conversion,[],[f455]) ).
cnf(s42,plain,
spl57_1,
inference(sat_conversion,[],[f1366]) ).
cnf(s57,plain,
$false,
inference(rat,[],[s2,s42]) ).
fof(f1367,plain,
$false,
inference(avatar_sat_refutation,[],[s57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC226+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.06/0.18 % Computer : n003.cluster.edu
% 0.06/0.18 % Model : x86_64 x86_64
% 0.06/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18 % Memory : 8046.5625MB
% 0.06/0.18 % OS : Linux 6.8.0-71-generic
% 0.06/0.18 % CPULimit : 300
% 0.06/0.18 % WCLimit : 300
% 0.06/0.18 % DateTime : Mon Sep 28 08:34:57 UTC 2026
% 0.06/0.18 % CPUTime :
% 0.06/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.22 Running first-order theorem proving
% 0.06/0.22 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
% 4.59/1.34 % (1434008)Detected formulas, will run a generic FOF schedule.
% 4.59/1.34 % (1434014)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=887757451:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.59/1.34 % (1434013)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=3731043379:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.59/1.34 % (1434017)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3419576813:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.59/1.34 % (1434018)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2547736626:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.59/1.34 % (1434015)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=1762407469:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.59/1.34 % (1434019)dis-21_1_sil=8000:lcm=predicate:random_seed=3547375661: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)
% 4.59/1.34 % (1434016)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1162698001:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.59/1.34 % (1434016)Instruction limit reached!
% 4.59/1.34 % (1434016)------------------------------
% 4.59/1.34 % (1434016)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.59/1.34 % (1434016)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.59/1.34 % (1434016)CaDiCaL version: 2.1.3
% 4.59/1.34 % (1434016)Termination reason: Instruction limit
% 4.59/1.34 % (1434016)Termination phase: Saturation
% 4.59/1.34 % (1434016)Time elapsed: 0.066 s
% 4.59/1.34 % (1434016)Peak memory usage: 89 MB
% 4.59/1.34 % (1434016)Instructions burned: 110 (million)
% 4.59/1.34 % (1434017)Instruction limit reached!
% 4.59/1.34 % (1434017)------------------------------
% 4.59/1.34 % (1434017)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.59/1.34 % (1434017)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.59/1.34 % (1434017)CaDiCaL version: 2.1.3
% 4.59/1.34 % (1434017)Termination reason: Instruction limit
% 4.59/1.34 % (1434017)Termination phase: Saturation
% 4.59/1.34 % (1434017)Time elapsed: 0.071 s
% 4.59/1.34 % (1434017)Peak memory usage: 88 MB
% 4.59/1.34 % (1434017)Instructions burned: 120 (million)
% 4.59/1.34 % (1434019)Instruction limit reached!
% 4.59/1.34 % (1434019)------------------------------
% 4.59/1.34 % (1434019)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.59/1.34 % (1434019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.59/1.34 % (1434019)CaDiCaL version: 2.1.3
% 4.59/1.34 % (1434019)Termination reason: Instruction limit
% 4.59/1.34 % (1434019)Termination phase: Saturation
% 4.59/1.34 % (1434019)Time elapsed: 0.071 s
% 4.59/1.34 % (1434019)Peak memory usage: 91 MB
% 4.59/1.34 % (1434019)Instructions burned: 130 (million)
% 4.59/1.34 % (1434018)Instruction limit reached!
% 4.59/1.34 % (1434018)------------------------------
% 4.59/1.34 % (1434018)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.59/1.34 % (1434018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.59/1.34 % (1434018)CaDiCaL version: 2.1.3
% 4.59/1.34 % (1434018)Termination reason: Instruction limit
% 4.59/1.34 % (1434018)Termination phase: Saturation
% 4.59/1.34 % (1434018)Time elapsed: 0.092 s
% 4.59/1.34 % (1434018)Peak memory usage: 90 MB
% 4.59/1.34 % (1434018)Instructions burned: 140 (million)
% 4.59/1.34 % (1434027)lrs+10_1_sil=8000:sp=occurrence:random_seed=529085278:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.59/1.34 % (1434029)lrs+1011_1_sil=32000:sp=occurrence:random_seed=987357670:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.59/1.34 % (1434028)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1372242510:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.59/1.34 % (1434030)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=3381173191:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 4.59/1.34 % (1434029)First to succeed.
% 4.59/1.34 % (1434029)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1434008"
% 4.59/1.34 % (1434028)Instruction limit reached!
% 4.59/1.34 % (1434028)------------------------------
% 4.59/1.34 % (1434028)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.59/1.34 % (1434028)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.59/1.34 % (1434028)CaDiCaL version: 2.1.3
% 4.59/1.34 % (1434028)Termination reason: Instruction limit
% 4.59/1.34 % (1434028)Termination phase: Saturation
% 4.59/1.34 % (1434028)Time elapsed: 0.080 s
% 4.59/1.34 % (1434028)Peak memory usage: 93 MB
% 4.59/1.34 % (1434028)Instructions burned: 158 (million)
% 4.59/1.34 % (1434014)Also succeeded, but the first one will report.
% 4.59/1.34 % (1434030)Instruction limit reached!
% 4.59/1.34 % (1434030)------------------------------
% 4.59/1.34 % (1434030)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.59/1.34 % (1434030)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.59/1.34 % (1434030)CaDiCaL version: 2.1.3
% 4.59/1.34 % (1434030)Termination reason: Instruction limit
% 4.59/1.34 % (1434030)Termination phase: Saturation
% 4.59/1.34 % (1434030)Time elapsed: 0.119 s
% 4.59/1.34 % (1434030)Peak memory usage: 95 MB
% 4.59/1.34 % (1434030)Instructions burned: 249 (million)
% 4.59/1.34 % (1434027)Instruction limit reached!
% 4.59/1.34 % (1434027)------------------------------
% 4.59/1.34 % (1434027)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.59/1.34 % (1434027)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.59/1.34 % (1434027)CaDiCaL version: 2.1.3
% 4.59/1.34 % (1434027)Termination reason: Instruction limit
% 4.59/1.34 % (1434027)Termination phase: Saturation
% 4.59/1.34 % (1434027)Time elapsed: 0.161 s
% 4.59/1.34 % (1434027)Peak memory usage: 92 MB
% 4.59/1.34 % (1434027)Instructions burned: 285 (million)
% 4.59/1.34 % (1434035)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1351007368:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.59/1.34 % (1434029)Refutation found. Thanks to Tanya!
% 4.59/1.34 % SZS status Theorem for theBenchmark
% 4.59/1.34 % SZS output start Proof for theBenchmark
% See solution above
% 5.39/1.53 % (1434029)------------------------------
% 5.39/1.53 % (1434029)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.39/1.53 % (1434029)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.39/1.53 % (1434029)CaDiCaL version: 2.1.3
% 5.39/1.53 % (1434029)Termination reason: Refutation
% 5.39/1.53 % (1434029)Time elapsed: 0.035 s
% 5.39/1.53 % (1434029)Peak memory usage: 90 MB
% 5.39/1.53 % (1434029)Instructions burned: 53 (million)
% 5.39/1.53 % (1434029)------------------------------
% 5.39/1.53 % (1434029)------------------------------
% 5.39/1.53 % (1434008)Success in time 0.676 s
% 5.39/1.53 % Vampire exiting
%------------------------------------------------------------------------------