%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC270+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:05:20 PM UTC 2026
% Result : Theorem 2.96s 0.70s
% Output : Refutation 2.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 87 ( 20 unt; 4 def)
% Number of atoms : 297 ( 20 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 356 ( 146 ~; 166 |; 10 &)
% ( 12 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn 82 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [X0] :
( ssList(X0)
=> ( totalorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> leq(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax11) ).
fof(f12,axiom,
! [X0] :
( ssList(X0)
=> ( strictorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> lt(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(f93,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( lt(X0,X1)
<=> ( X0 != X1
& leq(X0,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ~ segmentP(X3,X2)
| ~ strictorderedP(X2)
| totalorderedP(X0) ) ) ) ),
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
| ~ segmentP(X3,X2)
| ~ strictorderedP(X2)
| totalorderedP(X0) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f110,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f111,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f110]) ).
fof(f112,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f113,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f112]) ).
fof(f216,plain,
! [X0] :
( ! [X1] :
( ( lt(X0,X1)
<=> ( X0 != X1
& leq(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f93]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& segmentP(X3,X2)
& strictorderedP(X2)
& ~ totalorderedP(X0) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f272,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK28(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f273,plain,
! [X0] :
( ~ ssList(X0)
| app(app(sK26(X0),cons(sK24(X0),sK27(X0))),cons(sK25(X0),sK28(X0))) = X0
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f274,plain,
! [X0] :
( ~ ssList(X0)
| ~ leq(sK24(X0),sK25(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f275,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK27(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f276,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK26(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f277,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(sK25(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f278,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(sK24(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f279,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ ssList(X0)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| lt(X1,X2)
| ~ strictorderedP(X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f405,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| leq(X0,X1)
| ~ lt(X0,X1) ),
inference(cnf_transformation,[],[f216]) ).
fof(f410,plain,
~ totalorderedP(sK47),
inference(cnf_transformation,[],[f221]) ).
fof(f411,plain,
strictorderedP(sK49),
inference(cnf_transformation,[],[f221]) ).
fof(f413,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f221]) ).
fof(f416,plain,
ssList(sK49),
inference(cnf_transformation,[],[f221]) ).
fof(f421,plain,
~ totalorderedP(sK49),
inference(definition_unfolding,[],[f410,f413]) ).
fof(f432,plain,
! [X2,X3,X1,X4,X5] :
( ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| lt(X1,X2)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(equality_resolution,[],[f279]) ).
fof(f491,plain,
! [X0] :
( ~ ssItem(sK24(X0))
| ~ ssList(X0)
| ~ totalorderedP(X0) ),
inference(consistent_polarity_flipping,[],[f278]) ).
fof(f492,plain,
! [X0] :
( ~ ssItem(sK25(X0))
| ~ ssList(X0)
| ~ totalorderedP(X0) ),
inference(consistent_polarity_flipping,[],[f277]) ).
fof(f493,plain,
! [X0] :
( ~ totalorderedP(X0)
| ssList(sK26(X0))
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f276]) ).
fof(f494,plain,
! [X0] :
( ~ totalorderedP(X0)
| ssList(sK27(X0))
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f275]) ).
fof(f495,plain,
! [X0] :
( leq(sK24(X0),sK25(X0))
| ~ ssList(X0)
| ~ totalorderedP(X0) ),
inference(consistent_polarity_flipping,[],[f274]) ).
fof(f496,plain,
! [X0] :
( ~ totalorderedP(X0)
| app(app(sK26(X0),cons(sK24(X0),sK27(X0))),cons(sK25(X0),sK28(X0))) = X0
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f273]) ).
fof(f497,plain,
! [X0] :
( ~ totalorderedP(X0)
| ssList(sK28(X0))
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f272]) ).
fof(f506,plain,
! [X2,X3,X1,X4,X5] :
( ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ssItem(X1)
| ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| lt(X1,X2)
| strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(consistent_polarity_flipping,[],[f432]) ).
fof(f600,plain,
! [X0,X1] :
( ~ lt(X0,X1)
| ssItem(X1)
| ~ leq(X0,X1)
| ssItem(X0) ),
inference(consistent_polarity_flipping,[],[f405]) ).
fof(f603,plain,
~ strictorderedP(sK49),
inference(consistent_polarity_flipping,[],[f411]) ).
fof(f604,plain,
totalorderedP(sK49),
inference(consistent_polarity_flipping,[],[f421]) ).
fof(f653,plain,
( ssList(sK26(sK49))
| ~ ssList(sK49) ),
inference(resolution,[],[f493,f604]) ).
fof(f654,plain,
ssList(sK26(sK49)),
inference(forward_subsumption_resolution,[],[f653,f416]) ).
fof(f655,plain,
( ssList(sK27(sK49))
| ~ ssList(sK49) ),
inference(resolution,[],[f494,f604]) ).
fof(f656,plain,
ssList(sK27(sK49)),
inference(forward_subsumption_resolution,[],[f655,f416]) ).
fof(f659,plain,
( ssList(sK28(sK49))
| ~ ssList(sK49) ),
inference(resolution,[],[f497,f604]) ).
fof(f660,plain,
ssList(sK28(sK49)),
inference(forward_subsumption_resolution,[],[f659,f416]) ).
fof(f2081,plain,
( sK49 = app(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),cons(sK25(sK49),sK28(sK49)))
| ~ ssList(sK49) ),
inference(resolution,[],[f496,f604]) ).
fof(f2083,plain,
sK49 = app(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),cons(sK25(sK49),sK28(sK49))),
inference(forward_subsumption_resolution,[],[f2081,f416]) ).
fof(f4248,definition,
( spl51_243
<=> ssItem(sK25(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_243])],[avatar_definition]) ).
fof(f4249,plain,
( ~ ssItem(sK25(sK49))
| spl51_243 ),
inference(avatar_component_clause,[],[f4248]) ).
fof(f4250,plain,
( ssItem(sK25(sK49))
| ~ spl51_243 ),
inference(avatar_component_clause,[],[f4248]) ).
fof(f4301,definition,
( spl51_254
<=> leq(sK24(sK49),sK25(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_254])],[avatar_definition]) ).
fof(f4302,plain,
( ~ leq(sK24(sK49),sK25(sK49))
| spl51_254 ),
inference(avatar_component_clause,[],[f4301]) ).
fof(f4309,definition,
( spl51_256
<=> ssItem(sK24(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_256])],[avatar_definition]) ).
fof(f4310,plain,
( ~ ssItem(sK24(sK49))
| spl51_256 ),
inference(avatar_component_clause,[],[f4309]) ).
fof(f4311,plain,
( ssItem(sK24(sK49))
| ~ spl51_256 ),
inference(avatar_component_clause,[],[f4309]) ).
fof(f4323,definition,
( spl51_259
<=> lt(sK24(sK49),sK25(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_259])],[avatar_definition]) ).
fof(f4325,plain,
( lt(sK24(sK49),sK25(sK49))
| ~ spl51_259 ),
inference(avatar_component_clause,[],[f4323]) ).
fof(f6952,plain,
( ~ ssList(sK49)
| ~ totalorderedP(sK49)
| ~ spl51_256 ),
inference(resolution,[],[f4311,f491]) ).
fof(f6953,plain,
( ~ totalorderedP(sK49)
| ~ spl51_256 ),
inference(forward_subsumption_resolution,[],[f6952,f416]) ).
fof(f6954,plain,
( $false
| ~ spl51_256 ),
inference(forward_subsumption_resolution,[],[f6953,f604]) ).
fof(f6955,plain,
~ spl51_256,
inference(avatar_contradiction_clause,[],[f6954]) ).
fof(f7591,plain,
( ~ ssList(sK49)
| ~ totalorderedP(sK49)
| ~ spl51_243 ),
inference(resolution,[],[f4250,f492]) ).
fof(f7592,plain,
( ~ totalorderedP(sK49)
| ~ spl51_243 ),
inference(forward_subsumption_resolution,[],[f7591,f416]) ).
fof(f7593,plain,
( $false
| ~ spl51_243 ),
inference(forward_subsumption_resolution,[],[f7592,f604]) ).
fof(f7594,plain,
~ spl51_243,
inference(avatar_contradiction_clause,[],[f7593]) ).
fof(f7829,plain,
( ~ ssList(sK49)
| ssItem(sK24(sK49))
| ssItem(sK25(sK49))
| ~ ssList(sK26(sK49))
| ~ ssList(sK27(sK49))
| ~ ssList(sK28(sK49))
| lt(sK24(sK49),sK25(sK49))
| strictorderedP(sK49) ),
inference(superposition,[],[f506,f2083]) ).
fof(f7885,plain,
( ssItem(sK24(sK49))
| ssItem(sK25(sK49))
| ~ ssList(sK26(sK49))
| ~ ssList(sK27(sK49))
| ~ ssList(sK28(sK49))
| lt(sK24(sK49),sK25(sK49))
| strictorderedP(sK49) ),
inference(forward_subsumption_resolution,[],[f7829,f416]) ).
fof(f7898,plain,
( ssItem(sK24(sK49))
| ssItem(sK25(sK49))
| ~ ssList(sK27(sK49))
| ~ ssList(sK28(sK49))
| lt(sK24(sK49),sK25(sK49))
| strictorderedP(sK49) ),
inference(forward_subsumption_resolution,[],[f7885,f654]) ).
fof(f7903,plain,
( ssItem(sK24(sK49))
| ssItem(sK25(sK49))
| ~ ssList(sK28(sK49))
| lt(sK24(sK49),sK25(sK49))
| strictorderedP(sK49) ),
inference(forward_subsumption_resolution,[],[f7898,f656]) ).
fof(f7906,plain,
( ssItem(sK24(sK49))
| ssItem(sK25(sK49))
| lt(sK24(sK49),sK25(sK49))
| strictorderedP(sK49) ),
inference(forward_subsumption_resolution,[],[f7903,f660]) ).
fof(f7909,plain,
( ssItem(sK24(sK49))
| ssItem(sK25(sK49))
| lt(sK24(sK49),sK25(sK49)) ),
inference(forward_subsumption_resolution,[],[f7906,f603]) ).
fof(f7912,plain,
( spl51_259
| spl51_243
| spl51_256 ),
inference(avatar_split_clause,[],[f7909,f4309,f4248,f4323]) ).
fof(f22344,plain,
( ssItem(sK25(sK49))
| ~ leq(sK24(sK49),sK25(sK49))
| ssItem(sK24(sK49))
| ~ spl51_259 ),
inference(resolution,[],[f4325,f600]) ).
fof(f22349,plain,
( ~ leq(sK24(sK49),sK25(sK49))
| ssItem(sK24(sK49))
| spl51_243
| ~ spl51_259 ),
inference(forward_subsumption_resolution,[],[f22344,f4249]) ).
fof(f22365,plain,
( ~ leq(sK24(sK49),sK25(sK49))
| spl51_243
| spl51_256
| ~ spl51_259 ),
inference(forward_subsumption_resolution,[],[f22349,f4310]) ).
fof(f22367,plain,
( ~ spl51_254
| spl51_243
| spl51_256
| ~ spl51_259 ),
inference(avatar_split_clause,[],[f22365,f4323,f4309,f4248,f4301]) ).
fof(f22704,plain,
( ~ ssList(sK49)
| ~ totalorderedP(sK49)
| spl51_254 ),
inference(resolution,[],[f4302,f495]) ).
fof(f22715,plain,
( ~ totalorderedP(sK49)
| spl51_254 ),
inference(forward_subsumption_resolution,[],[f22704,f416]) ).
fof(f22721,plain,
( $false
| spl51_254 ),
inference(forward_subsumption_resolution,[],[f22715,f604]) ).
fof(f22722,plain,
spl51_254,
inference(avatar_contradiction_clause,[],[f22721]) ).
cnf(s513,plain,
~ spl51_256,
inference(sat_conversion,[],[f6955]) ).
cnf(s690,plain,
~ spl51_243,
inference(sat_conversion,[],[f7594]) ).
cnf(s769,plain,
( spl51_243
| spl51_256
| spl51_259 ),
inference(sat_conversion,[],[f7912]) ).
cnf(s1972,plain,
( spl51_243
| ~ spl51_254
| spl51_256
| ~ spl51_259 ),
inference(sat_conversion,[],[f22367]) ).
cnf(s1974,plain,
spl51_254,
inference(sat_conversion,[],[f22722]) ).
cnf(s1977,plain,
( spl51_243
| spl51_256
| ~ spl51_259 ),
inference(rat,[],[s1972,s1974]) ).
cnf(s2029,plain,
~ spl51_259,
inference(rat,[],[s1977,s690,s513]) ).
cnf(s2030,plain,
$false,
inference(rat,[],[s769,s690,s2029,s513]) ).
fof(f22731,plain,
$false,
inference(avatar_sat_refutation,[],[s2030]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC270+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n009.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 08:48:00 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.96/0.70 % (2895176)Will run a generic schedule for satisfiability detection.
% 2.96/0.70 % (2895183)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1318868354:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.96/0.70 % (2895182)% WARNING: option uhcvi not known.
% 2.96/0.70 % (2895181)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=439224584_2999 on theBenchmark for (2999ds/0Mi)
% 2.96/0.70 % (2895182)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1860964840:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.96/0.70 % (2895184)dis+10_1_sil=32000:sp=arity:random_seed=47703:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.96/0.70 % (2895185)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1286719443:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.96/0.70 % (2895187)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2062128395:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.96/0.70 % (2895186)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=243869850:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.96/0.70 % TRYING [1]
% 2.96/0.70 % TRYING [2]
% 2.96/0.70 % TRYING [3]
% 2.96/0.70 % TRYING [4]
% 2.96/0.70 % (2895184)Instruction limit reached!
% 2.96/0.70 % (2895184)------------------------------
% 2.96/0.70 % (2895184)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.96/0.70 % (2895184)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/0.70 % (2895184)CaDiCaL version: 2.1.3
% 2.96/0.70 % (2895184)Termination reason: Instruction limit
% 2.96/0.70 % (2895184)Termination phase: Saturation
% 2.96/0.70 % (2895184)Time elapsed: 0.060 s
% 2.96/0.70 % (2895184)Peak memory usage: 13 MB
% 2.96/0.70 % (2895184)Instructions burned: 103 (million)
% 2.96/0.70 % (2895185)Instruction limit reached!
% 2.96/0.70 % (2895185)------------------------------
% 2.96/0.70 % (2895185)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.96/0.70 % (2895185)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/0.70 % (2895185)CaDiCaL version: 2.1.3
% 2.96/0.70 % (2895185)Termination reason: Instruction limit
% 2.96/0.70 % (2895185)Termination phase: Saturation
% 2.96/0.70 % (2895185)Time elapsed: 0.068 s
% 2.96/0.70 % (2895185)Peak memory usage: 13 MB
% 2.96/0.70 % (2895185)Instructions burned: 116 (million)
% 2.96/0.70 % (2895186)Instruction limit reached!
% 2.96/0.70 % (2895186)------------------------------
% 2.96/0.70 % (2895186)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.96/0.70 % (2895186)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/0.70 % (2895186)CaDiCaL version: 2.1.3
% 2.96/0.70 % (2895186)Termination reason: Instruction limit
% 2.96/0.70 % (2895186)Termination phase: Saturation
% 2.96/0.70 % (2895186)Time elapsed: 0.077 s
% 2.96/0.70 % (2895186)Peak memory usage: 14 MB
% 2.96/0.70 % (2895186)Instructions burned: 136 (million)
% 2.96/0.70 % (2895195)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=646668118:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.96/0.70 % TRYING [5]
% 2.96/0.70 % (2895196)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=611655700:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.96/0.70 % TRYING [1]
% 2.96/0.70 % TRYING [2]
% 2.96/0.70 % (2895197)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3851658136:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.96/0.70 % TRYING [3]
% 2.96/0.70 % (2895187)Instruction limit reached!
% 2.96/0.70 % (2895187)------------------------------
% 2.96/0.70 % (2895187)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.96/0.70 % (2895187)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/0.70 % (2895187)CaDiCaL version: 2.1.3
% 2.96/0.70 % (2895187)Termination reason: Instruction limit
% 2.96/0.70 % (2895187)Termination phase: Saturation
% 2.96/0.70 % (2895187)Time elapsed: 0.100 s
% 2.96/0.70 % (2895187)Peak memory usage: 15 MB
% 2.96/0.70 % (2895187)Instructions burned: 160 (million)
% 2.96/0.70 % TRYING [4]
% 2.96/0.70 % (2895201)ott-21_1_sil=16000:fs=off:random_seed=2873338557:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.96/0.70 % (2895196)Instruction limit reached!
% 2.96/0.70 % (2895196)------------------------------
% 2.96/0.70 % (2895196)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.96/0.70 % (2895196)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/0.70 % (2895196)CaDiCaL version: 2.1.3
% 2.96/0.70 % (2895196)Termination reason: Instruction limit
% 2.96/0.70 % (2895196)Termination phase: Saturation
% 2.96/0.70 % (2895196)Time elapsed: 0.070 s
% 2.96/0.70 % (2895196)Peak memory usage: 13 MB
% 2.96/0.70 % (2895196)Instructions burned: 131 (million)
% 2.96/0.70 % TRYING [5]
% 2.96/0.70 % (2895203)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=309797700:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.96/0.70 % TRYING [6]
% 2.96/0.70 % (2895201)Instruction limit reached!
% 2.96/0.70 % (2895201)------------------------------
% 2.96/0.70 % (2895201)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.96/0.70 % (2895201)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/0.70 % (2895201)CaDiCaL version: 2.1.3
% 2.96/0.70 % (2895201)Termination reason: Instruction limit
% 2.96/0.70 % (2895201)Termination phase: Saturation
% 2.96/0.70 % (2895201)Time elapsed: 0.092 s
% 2.96/0.70 % (2895201)Peak memory usage: 13 MB
% 2.96/0.70 % (2895201)Instructions burned: 180 (million)
% 2.96/0.70 % (2895205)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=936324864:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.96/0.70 % TRYING [1]
% 2.96/0.70 % TRYING [2]
% 2.96/0.70 % TRYING [3]
% 2.96/0.70 % TRYING [4]
% 2.96/0.70 % TRYING [6]
% 2.96/0.70 % (2895195)Instruction limit reached!
% 2.96/0.70 % (2895195)------------------------------
% 2.96/0.70 % (2895195)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.96/0.70 % (2895195)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/0.70 % (2895195)CaDiCaL version: 2.1.3
% 2.96/0.70 % (2895195)Termination reason: Instruction limit
% 2.96/0.70 % (2895195)Termination phase: Finite model building constraint generation
% 2.96/0.70 % (2895195)Time elapsed: 0.289 s
% 2.96/0.70 % (2895195)Peak memory usage: 28 MB
% 2.96/0.70 % (2895195)Instructions burned: 714 (million)
% 2.96/0.70 % (2895207)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2186855335:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 2.96/0.70 % TRYING [5]
% 2.96/0.70 % (2895182) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2895176-2895182"...
% 2.96/0.70 % (2895182)...printing done.
% 2.96/0.70 % (2895182)Refutation found. Thanks to Tanya!
% 2.96/0.70 % SZS status Theorem for theBenchmark
% 2.96/0.70 % SZS output start Proof for theBenchmark
% See solution above
% 2.96/0.70 % (2895182)------------------------------
% 2.96/0.70 % (2895182)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.96/0.70 % (2895182)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/0.70 % (2895182)CaDiCaL version: 2.1.3
% 2.96/0.70 % (2895182)Termination reason: Refutation
% 2.96/0.70 % (2895182)Time elapsed: 0.433 s
% 2.96/0.70 % (2895182)Peak memory usage: 23 MB
% 2.96/0.70 % (2895182)Instructions burned: 823 (million)
% 2.96/0.70 % (2895176)Success in time 0.479 s
% 2.96/0.70 % Vampire exiting
%------------------------------------------------------------------------------