%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC273+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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:21 PM UTC 2026
% Result : Theorem 1.00s 0.40s
% Output : Refutation 1.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 83 ( 21 unt; 7 def)
% Number of atoms : 286 ( 19 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 337 ( 134 ~; 147 |; 19 &)
% ( 15 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 8 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn 69 !; 6 ?)
% 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/sandbox2/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/sandbox2/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/sandbox2/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)
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& segmentP(X3,X4)
& segmentP(X4,X2)
& strictorderedP(X4) )
| totalorderedP(X0) ) ) ) ),
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
| ~ segmentP(X3,X2)
| ~ strictorderedP(X2)
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& segmentP(X3,X4)
& segmentP(X4,X2)
& strictorderedP(X4) )
| 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)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X2,X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ strictorderedP(X4) )
& ~ totalorderedP(X0) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f272,plain,
! [X0] :
( ssList(sK28(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f273,plain,
! [X0] :
( totalorderedP(X0)
| app(app(sK26(X0),cons(sK24(X0),sK27(X0))),cons(sK25(X0),sK28(X0))) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f274,plain,
! [X0] :
( ~ leq(sK24(X0),sK25(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f275,plain,
! [X0] :
( ssList(sK27(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f276,plain,
! [X0] :
( ssList(sK26(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f277,plain,
! [X0] :
( ssItem(sK25(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f278,plain,
! [X0] :
( ssItem(sK24(X0))
| ~ ssList(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] :
( ~ lt(X0,X1)
| ~ ssItem(X1)
| leq(X0,X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f216]) ).
fof(f411,plain,
~ totalorderedP(sK47),
inference(cnf_transformation,[],[f221]) ).
fof(f412,plain,
strictorderedP(sK49),
inference(cnf_transformation,[],[f221]) ).
fof(f414,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f221]) ).
fof(f417,plain,
ssList(sK49),
inference(cnf_transformation,[],[f221]) ).
fof(f422,plain,
~ totalorderedP(sK49),
inference(definition_unfolding,[],[f411,f414]) ).
fof(f433,plain,
! [X2,X3,X1,X4,X5] :
( ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| lt(X1,X2)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(equality_resolution,[],[f279]) ).
fof(f843,plain,
( sK49 = app(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),cons(sK25(sK49),sK28(sK49)))
| ~ ssList(sK49) ),
inference(resolution,[],[f273,f422]) ).
fof(f846,plain,
sK49 = app(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),cons(sK25(sK49),sK28(sK49))),
inference(forward_subsumption_resolution,[],[f843,f417]) ).
fof(f1466,plain,
( ~ strictorderedP(sK49)
| ~ ssItem(sK24(sK49))
| ~ ssItem(sK25(sK49))
| ~ ssList(sK26(sK49))
| ~ ssList(sK27(sK49))
| ~ ssList(sK28(sK49))
| lt(sK24(sK49),sK25(sK49))
| ~ ssList(sK49) ),
inference(superposition,[],[f433,f846]) ).
fof(f1486,definition,
( spl51_91
<=> ssList(sK28(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_91])],[avatar_definition]) ).
fof(f1488,plain,
( ~ ssList(sK28(sK49))
| spl51_91 ),
inference(avatar_component_clause,[],[f1486]) ).
fof(f1490,definition,
( spl51_92
<=> ssItem(sK25(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_92])],[avatar_definition]) ).
fof(f1492,plain,
( ~ ssItem(sK25(sK49))
| spl51_92 ),
inference(avatar_component_clause,[],[f1490]) ).
fof(f1502,plain,
( ~ ssItem(sK24(sK49))
| ~ ssItem(sK25(sK49))
| ~ ssList(sK26(sK49))
| ~ ssList(sK27(sK49))
| ~ ssList(sK28(sK49))
| lt(sK24(sK49),sK25(sK49))
| ~ ssList(sK49) ),
inference(forward_subsumption_resolution,[],[f1466,f412]) ).
fof(f1508,definition,
( spl51_96
<=> ssList(sK26(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_96])],[avatar_definition]) ).
fof(f1510,plain,
( ~ ssList(sK26(sK49))
| spl51_96 ),
inference(avatar_component_clause,[],[f1508]) ).
fof(f1516,plain,
( ~ ssItem(sK24(sK49))
| ~ ssItem(sK25(sK49))
| ~ ssList(sK26(sK49))
| ~ ssList(sK27(sK49))
| ~ ssList(sK28(sK49))
| lt(sK24(sK49),sK25(sK49)) ),
inference(forward_subsumption_resolution,[],[f1502,f417]) ).
fof(f1518,definition,
( spl51_98
<=> lt(sK24(sK49),sK25(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_98])],[avatar_definition]) ).
fof(f1520,plain,
( lt(sK24(sK49),sK25(sK49))
| ~ spl51_98 ),
inference(avatar_component_clause,[],[f1518]) ).
fof(f1522,definition,
( spl51_99
<=> ssList(sK27(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_99])],[avatar_definition]) ).
fof(f1524,plain,
( ~ ssList(sK27(sK49))
| spl51_99 ),
inference(avatar_component_clause,[],[f1522]) ).
fof(f1526,definition,
( spl51_100
<=> ssItem(sK24(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_100])],[avatar_definition]) ).
fof(f1528,plain,
( ~ ssItem(sK24(sK49))
| spl51_100 ),
inference(avatar_component_clause,[],[f1526]) ).
fof(f1529,plain,
( spl51_98
| ~ spl51_91
| ~ spl51_99
| ~ spl51_96
| ~ spl51_92
| ~ spl51_100 ),
inference(avatar_split_clause,[],[f1516,f1526,f1490,f1508,f1522,f1486,f1518]) ).
fof(f2211,plain,
( ~ ssItem(sK25(sK49))
| leq(sK24(sK49),sK25(sK49))
| ~ ssItem(sK24(sK49))
| ~ spl51_98 ),
inference(resolution,[],[f405,f1520]) ).
fof(f2213,definition,
( spl51_145
<=> leq(sK24(sK49),sK25(sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_145])],[avatar_definition]) ).
fof(f2215,plain,
( leq(sK24(sK49),sK25(sK49))
| ~ spl51_145 ),
inference(avatar_component_clause,[],[f2213]) ).
fof(f2216,plain,
( ~ spl51_100
| spl51_145
| ~ spl51_92
| ~ spl51_98 ),
inference(avatar_split_clause,[],[f2211,f1518,f1490,f2213,f1526]) ).
fof(f2217,plain,
( ~ ssList(sK49)
| totalorderedP(sK49)
| ~ spl51_145 ),
inference(resolution,[],[f2215,f274]) ).
fof(f2218,plain,
( totalorderedP(sK49)
| ~ spl51_145 ),
inference(forward_subsumption_resolution,[],[f2217,f417]) ).
fof(f2219,plain,
( $false
| ~ spl51_145 ),
inference(forward_subsumption_resolution,[],[f2218,f422]) ).
fof(f2220,plain,
~ spl51_145,
inference(avatar_contradiction_clause,[],[f2219]) ).
fof(f2227,plain,
( ~ ssList(sK49)
| totalorderedP(sK49)
| spl51_100 ),
inference(resolution,[],[f1528,f278]) ).
fof(f2228,plain,
( totalorderedP(sK49)
| spl51_100 ),
inference(forward_subsumption_resolution,[],[f2227,f417]) ).
fof(f2229,plain,
( $false
| spl51_100 ),
inference(forward_subsumption_resolution,[],[f2228,f422]) ).
fof(f2230,plain,
spl51_100,
inference(avatar_contradiction_clause,[],[f2229]) ).
fof(f2231,plain,
( ~ ssList(sK49)
| totalorderedP(sK49)
| spl51_99 ),
inference(resolution,[],[f1524,f275]) ).
fof(f2232,plain,
( totalorderedP(sK49)
| spl51_99 ),
inference(forward_subsumption_resolution,[],[f2231,f417]) ).
fof(f2233,plain,
( $false
| spl51_99 ),
inference(forward_subsumption_resolution,[],[f2232,f422]) ).
fof(f2234,plain,
spl51_99,
inference(avatar_contradiction_clause,[],[f2233]) ).
fof(f2235,plain,
( ~ ssList(sK49)
| totalorderedP(sK49)
| spl51_96 ),
inference(resolution,[],[f1510,f276]) ).
fof(f2236,plain,
( totalorderedP(sK49)
| spl51_96 ),
inference(forward_subsumption_resolution,[],[f2235,f417]) ).
fof(f2237,plain,
( $false
| spl51_96 ),
inference(forward_subsumption_resolution,[],[f2236,f422]) ).
fof(f2238,plain,
spl51_96,
inference(avatar_contradiction_clause,[],[f2237]) ).
fof(f2255,plain,
( ~ ssList(sK49)
| totalorderedP(sK49)
| spl51_92 ),
inference(resolution,[],[f1492,f277]) ).
fof(f2256,plain,
( totalorderedP(sK49)
| spl51_92 ),
inference(forward_subsumption_resolution,[],[f2255,f417]) ).
fof(f2257,plain,
( $false
| spl51_92 ),
inference(forward_subsumption_resolution,[],[f2256,f422]) ).
fof(f2258,plain,
spl51_92,
inference(avatar_contradiction_clause,[],[f2257]) ).
fof(f2289,plain,
( ~ ssList(sK49)
| totalorderedP(sK49)
| spl51_91 ),
inference(resolution,[],[f1488,f272]) ).
fof(f2290,plain,
( totalorderedP(sK49)
| spl51_91 ),
inference(forward_subsumption_resolution,[],[f2289,f417]) ).
fof(f2291,plain,
( $false
| spl51_91 ),
inference(forward_subsumption_resolution,[],[f2290,f422]) ).
fof(f2292,plain,
spl51_91,
inference(avatar_contradiction_clause,[],[f2291]) ).
cnf(s68,plain,
( ~ spl51_91
| ~ spl51_92
| ~ spl51_96
| spl51_98
| ~ spl51_99
| ~ spl51_100 ),
inference(sat_conversion,[],[f1529]) ).
cnf(s112,plain,
( ~ spl51_92
| ~ spl51_98
| ~ spl51_100
| spl51_145 ),
inference(sat_conversion,[],[f2216]) ).
cnf(s113,plain,
~ spl51_145,
inference(sat_conversion,[],[f2220]) ).
cnf(s114,plain,
spl51_100,
inference(sat_conversion,[],[f2230]) ).
cnf(s115,plain,
spl51_99,
inference(sat_conversion,[],[f2234]) ).
cnf(s116,plain,
spl51_96,
inference(sat_conversion,[],[f2238]) ).
cnf(s117,plain,
spl51_92,
inference(sat_conversion,[],[f2258]) ).
cnf(s118,plain,
spl51_91,
inference(sat_conversion,[],[f2292]) ).
cnf(s119,plain,
~ spl51_98,
inference(rat,[],[s112,s113,s114,s117]) ).
cnf(s131,plain,
$false,
inference(rat,[],[s68,s114,s115,s119,s116,s117,s118]) ).
fof(f2293,plain,
$false,
inference(avatar_sat_refutation,[],[s131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC273+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n018.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 08:50:55 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.00/0.40 % (3235949)Will run a generic schedule for satisfiability detection.
% 1.00/0.40 % (3235955)% WARNING: option uhcvi not known.
% 1.00/0.40 % (3235955)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2160737362:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.00/0.40 % (3235954)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3905727564_2999 on theBenchmark for (2999ds/0Mi)
% 1.00/0.40 % (3235956)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3314004655:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.00/0.40 % (3235957)dis+10_1_sil=32000:sp=arity:random_seed=3988744683:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.00/0.40 % (3235958)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2281260181:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.00/0.40 % (3235959)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2667602117:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.00/0.40 % (3235960)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3877978003:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.00/0.40 % TRYING [1]
% 1.00/0.40 % TRYING [2]
% 1.00/0.40 % TRYING [3]
% 1.00/0.40 % TRYING [4]
% 1.00/0.40 % (3235957)Instruction limit reached!
% 1.00/0.40 % (3235957)------------------------------
% 1.00/0.40 % (3235957)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.00/0.40 % (3235957)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.00/0.40 % (3235957)CaDiCaL version: 2.1.3
% 1.00/0.40 % (3235957)Termination reason: Instruction limit
% 1.00/0.40 % (3235957)Termination phase: Saturation
% 1.00/0.40 % (3235957)Time elapsed: 0.061 s
% 1.00/0.40 % (3235957)Peak memory usage: 13 MB
% 1.00/0.40 % (3235957)Instructions burned: 104 (million)
% 1.00/0.40 % (3235958)Instruction limit reached!
% 1.00/0.40 % (3235958)------------------------------
% 1.00/0.40 % (3235958)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.00/0.40 % (3235958)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.00/0.40 % (3235958)CaDiCaL version: 2.1.3
% 1.00/0.40 % (3235958)Termination reason: Instruction limit
% 1.00/0.40 % (3235958)Termination phase: Saturation
% 1.00/0.40 % (3235958)Time elapsed: 0.068 s
% 1.00/0.40 % (3235958)Peak memory usage: 13 MB
% 1.00/0.40 % (3235958)Instructions burned: 116 (million)
% 1.00/0.40 % (3235959)Instruction limit reached!
% 1.00/0.40 % (3235959)------------------------------
% 1.00/0.40 % (3235959)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.00/0.40 % (3235959)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.00/0.40 % (3235959)CaDiCaL version: 2.1.3
% 1.00/0.40 % (3235959)Termination reason: Instruction limit
% 1.00/0.40 % (3235959)Termination phase: Saturation
% 1.00/0.40 % (3235959)Time elapsed: 0.075 s
% 1.00/0.40 % (3235959)Peak memory usage: 14 MB
% 1.00/0.40 % (3235959)Instructions burned: 131 (million)
% 1.00/0.40 % (3235968)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1425689451:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.00/0.40 % TRYING [5]
% 1.00/0.40 % (3235969)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1090269341:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.00/0.40 % TRYING [1]
% 1.00/0.40 % TRYING [2]
% 1.00/0.40 % (3235970)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=4216294424:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.00/0.40 % (3235960)Instruction limit reached!
% 1.00/0.40 % (3235960)------------------------------
% 1.00/0.40 % (3235960)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.00/0.40 % (3235960)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.00/0.40 % (3235960)CaDiCaL version: 2.1.3
% 1.00/0.40 % (3235960)Termination reason: Instruction limit
% 1.00/0.40 % (3235960)Termination phase: Saturation
% 1.00/0.40 % (3235960)Time elapsed: 0.099 s
% 1.00/0.40 % (3235960)Peak memory usage: 15 MB
% 1.00/0.40 % (3235960)Instructions burned: 159 (million)
% 1.00/0.40 % TRYING [3]
% 1.00/0.40 % TRYING [4]
% 1.00/0.40 % (3235974)ott-21_1_sil=16000:fs=off:random_seed=3681016109:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.00/0.40 % (3235970) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3235949-3235970"...
% 1.00/0.40 % (3235970)...printing done.
% 1.00/0.40 % (3235970)Refutation found. Thanks to Tanya!
% 1.00/0.40 % SZS status Theorem for theBenchmark
% 1.00/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 1.00/0.41 % (3235970)------------------------------
% 1.00/0.41 % (3235970)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.00/0.41 % (3235970)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.00/0.41 % (3235970)CaDiCaL version: 2.1.3
% 1.00/0.41 % (3235970)Termination reason: Refutation
% 1.00/0.41 % (3235970)Time elapsed: 0.047 s
% 1.00/0.41 % (3235970)Peak memory usage: 14 MB
% 1.00/0.41 % (3235970)Instructions burned: 65 (million)
% 1.00/0.41 % (3235949)Success in time 0.181 s
% 1.00/0.41 % Vampire exiting
%------------------------------------------------------------------------------