%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC181+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 : n020.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:04:59 PM UTC 2026
% Result : Theorem 0.89s 0.62s
% Output : Refutation 0.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 5
% Syntax : Number of formulae : 66 ( 20 unt; 1 def)
% Number of atoms : 307 ( 56 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 390 ( 149 ~; 155 |; 52 &)
% ( 7 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 124 ( 0 sgn 96 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
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(f13,axiom,
! [X0] :
( ssList(X0)
=> ( duplicatefreeP(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
=> X1 != X2 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax13) ).
fof(f90,axiom,
! [X0] :
( ssItem(X0)
=> ~ lt(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax90) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X4,X2),X5) != X3
| ~ strictorderedP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X2
& lt(X6,X8) ) ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X5
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(X13,cons(X12,nil)) = X2
& lt(X12,X10) ) ) ) ) ) ) )
| duplicatefreeP(X0)
| ( 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
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X4,X2),X5) != X3
| ~ strictorderedP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X2
& lt(X6,X8) ) ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X5
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(X13,cons(X12,nil)) = X2
& lt(X12,X10) ) ) ) ) ) ) )
| duplicatefreeP(X0)
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
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(f114,plain,
! [X0] :
( ( duplicatefreeP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( 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,[],[f13]) ).
fof(f115,plain,
! [X0] :
( ( duplicatefreeP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( 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,[],[f114]) ).
fof(f211,plain,
! [X0] :
( ~ lt(X0,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f90]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(app(X4,X2),X5) = X3
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ lt(X6,X8) ) ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ lt(X12,X10) ) ) ) )
& ssList(X5) )
& ssList(X4) )
& ~ duplicatefreeP(X0)
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(app(X4,X2),X5) = X3
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ lt(X6,X8) ) ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ lt(X12,X10) ) ) ) )
& ssList(X5) )
& ssList(X4) )
& ~ duplicatefreeP(X0)
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f280,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(f289,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK38(X0))
| duplicatefreeP(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f290,plain,
! [X0] :
( ~ ssList(X0)
| app(app(sK36(X0),cons(sK34(X0),sK37(X0))),cons(sK35(X0),sK38(X0))) = X0
| duplicatefreeP(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f291,plain,
! [X0] :
( ~ ssList(X0)
| sK34(X0) = sK35(X0)
| duplicatefreeP(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f292,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK37(X0))
| duplicatefreeP(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f293,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK36(X0))
| duplicatefreeP(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f295,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(sK34(X0))
| duplicatefreeP(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f403,plain,
! [X0] :
( ~ ssItem(X0)
| ~ lt(X0,X0) ),
inference(cnf_transformation,[],[f211]) ).
fof(f414,plain,
strictorderedP(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
~ duplicatefreeP(sK47),
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f427,plain,
~ duplicatefreeP(sK49),
inference(definition_unfolding,[],[f419,f420]) ).
fof(f438,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,[],[f280]) ).
fof(f504,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,[],[f438]) ).
fof(f505,plain,
! [X0] :
( ~ ssItem(sK34(X0))
| ~ ssList(X0)
| ~ duplicatefreeP(X0) ),
inference(consistent_polarity_flipping,[],[f295]) ).
fof(f507,plain,
! [X0] :
( ~ duplicatefreeP(X0)
| ssList(sK36(X0))
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f293]) ).
fof(f508,plain,
! [X0] :
( ~ duplicatefreeP(X0)
| ssList(sK37(X0))
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f292]) ).
fof(f509,plain,
! [X0] :
( ~ duplicatefreeP(X0)
| sK34(X0) = sK35(X0)
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f291]) ).
fof(f510,plain,
! [X0] :
( ~ duplicatefreeP(X0)
| app(app(sK36(X0),cons(sK34(X0),sK37(X0))),cons(sK35(X0),sK38(X0))) = X0
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f290]) ).
fof(f511,plain,
! [X0] :
( ~ duplicatefreeP(X0)
| ssList(sK38(X0))
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f289]) ).
fof(f583,plain,
! [X0] :
( ~ lt(X0,X0)
| ssItem(X0) ),
inference(consistent_polarity_flipping,[],[f403]) ).
fof(f591,plain,
duplicatefreeP(sK49),
inference(consistent_polarity_flipping,[],[f427]) ).
fof(f592,plain,
~ strictorderedP(sK49),
inference(consistent_polarity_flipping,[],[f414]) ).
fof(f662,plain,
( ssList(sK36(sK49))
| ~ ssList(sK49) ),
inference(resolution,[],[f507,f591]) ).
fof(f663,plain,
ssList(sK36(sK49)),
inference(forward_subsumption_resolution,[],[f662,f422]) ).
fof(f664,plain,
( ssList(sK37(sK49))
| ~ ssList(sK49) ),
inference(resolution,[],[f508,f591]) ).
fof(f665,plain,
ssList(sK37(sK49)),
inference(forward_subsumption_resolution,[],[f664,f422]) ).
fof(f666,plain,
( ssList(sK38(sK49))
| ~ ssList(sK49) ),
inference(resolution,[],[f511,f591]) ).
fof(f667,plain,
ssList(sK38(sK49)),
inference(forward_subsumption_resolution,[],[f666,f422]) ).
fof(f716,plain,
( sK34(sK49) = sK35(sK49)
| ~ ssList(sK49) ),
inference(resolution,[],[f509,f591]) ).
fof(f717,plain,
sK34(sK49) = sK35(sK49),
inference(forward_subsumption_resolution,[],[f716,f422]) ).
fof(f2046,plain,
( sK49 = app(app(sK36(sK49),cons(sK34(sK49),sK37(sK49))),cons(sK35(sK49),sK38(sK49)))
| ~ ssList(sK49) ),
inference(resolution,[],[f510,f591]) ).
fof(f2047,plain,
sK49 = app(app(sK36(sK49),cons(sK34(sK49),sK37(sK49))),cons(sK35(sK49),sK38(sK49))),
inference(forward_subsumption_resolution,[],[f2046,f422]) ).
fof(f4463,definition,
( spl53_394
<=> ssItem(sK34(sK49)) ),
introduced(definition,[new_symbols(definition,[spl53_394])],[avatar_definition]) ).
fof(f4465,plain,
( ssItem(sK34(sK49))
| ~ spl53_394 ),
inference(avatar_component_clause,[],[f4463]) ).
fof(f4578,plain,
sK49 = app(app(sK36(sK49),cons(sK34(sK49),sK37(sK49))),cons(sK34(sK49),sK38(sK49))),
inference(forward_demodulation,[],[f2047,f717]) ).
fof(f6000,plain,
( ~ ssList(sK49)
| ~ duplicatefreeP(sK49)
| ~ spl53_394 ),
inference(resolution,[],[f4465,f505]) ).
fof(f6001,plain,
( ~ duplicatefreeP(sK49)
| ~ spl53_394 ),
inference(forward_subsumption_resolution,[],[f6000,f422]) ).
fof(f6002,plain,
( $false
| ~ spl53_394 ),
inference(forward_subsumption_resolution,[],[f6001,f591]) ).
fof(f6003,plain,
~ spl53_394,
inference(avatar_contradiction_clause,[],[f6002]) ).
fof(f8297,plain,
( ~ ssList(sK49)
| ssItem(sK34(sK49))
| ssItem(sK34(sK49))
| ~ ssList(sK36(sK49))
| ~ ssList(sK37(sK49))
| ~ ssList(sK38(sK49))
| lt(sK34(sK49),sK34(sK49))
| strictorderedP(sK49) ),
inference(superposition,[],[f504,f4578]) ).
fof(f8321,plain,
( ~ ssList(sK49)
| ssItem(sK34(sK49))
| ~ ssList(sK36(sK49))
| ~ ssList(sK37(sK49))
| ~ ssList(sK38(sK49))
| lt(sK34(sK49),sK34(sK49))
| strictorderedP(sK49) ),
inference(duplicate_literal_removal,[],[f8297]) ).
fof(f8347,plain,
( ssItem(sK34(sK49))
| ~ ssList(sK36(sK49))
| ~ ssList(sK37(sK49))
| ~ ssList(sK38(sK49))
| lt(sK34(sK49),sK34(sK49))
| strictorderedP(sK49) ),
inference(forward_subsumption_resolution,[],[f8321,f422]) ).
fof(f8359,plain,
( ssItem(sK34(sK49))
| ~ ssList(sK37(sK49))
| ~ ssList(sK38(sK49))
| lt(sK34(sK49),sK34(sK49))
| strictorderedP(sK49) ),
inference(forward_subsumption_resolution,[],[f8347,f663]) ).
fof(f8365,plain,
( ssItem(sK34(sK49))
| ~ ssList(sK38(sK49))
| lt(sK34(sK49),sK34(sK49))
| strictorderedP(sK49) ),
inference(forward_subsumption_resolution,[],[f8359,f665]) ).
fof(f8368,plain,
( ssItem(sK34(sK49))
| lt(sK34(sK49),sK34(sK49))
| strictorderedP(sK49) ),
inference(forward_subsumption_resolution,[],[f8365,f667]) ).
fof(f8371,plain,
( ssItem(sK34(sK49))
| strictorderedP(sK49) ),
inference(forward_subsumption_resolution,[],[f8368,f583]) ).
fof(f8374,plain,
ssItem(sK34(sK49)),
inference(forward_subsumption_resolution,[],[f8371,f592]) ).
fof(f8377,plain,
spl53_394,
inference(avatar_split_clause,[],[f8374,f4463]) ).
cnf(s649,plain,
~ spl53_394,
inference(sat_conversion,[],[f6003]) ).
cnf(s1134,plain,
spl53_394,
inference(sat_conversion,[],[f8377]) ).
cnf(s1135,plain,
$false,
inference(rat,[],[s649,s1134]) ).
fof(f8378,plain,
$false,
inference(avatar_sat_refutation,[],[s1135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC181+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n020.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 08:21:06 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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
% 0.89/0.62 % (30717)Will run a generic schedule for satisfiability detection.
% 0.89/0.62 % (30722)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=115423485_2999 on theBenchmark for (2999ds/0Mi)
% 0.89/0.62 % (30723)% WARNING: option uhcvi not known.
% 0.89/0.62 % (30724)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3718474972:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.89/0.62 % (30723)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1046190512:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.89/0.62 % (30725)dis+10_1_sil=32000:sp=arity:random_seed=3156572251:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.89/0.62 % (30726)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1210034407:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.89/0.62 % TRYING [1]
% 0.89/0.62 % (30728)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=421065308:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.89/0.62 % (30727)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3331805341:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.89/0.62 % TRYING [2]
% 0.89/0.62 % TRYING [3]
% 0.89/0.62 % TRYING [4]
% 0.89/0.62 % TRYING [5]
% 0.89/0.62 % (30725)Instruction limit reached!
% 0.89/0.62 % (30725)------------------------------
% 0.89/0.62 % (30725)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.62 % (30725)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.62 % (30725)CaDiCaL version: 2.1.3
% 0.89/0.62 % (30725)Termination reason: Instruction limit
% 0.89/0.62 % (30725)Termination phase: Saturation
% 0.89/0.62 % (30725)Time elapsed: 0.060 s
% 0.89/0.62 % (30725)Peak memory usage: 13 MB
% 0.89/0.62 % (30725)Instructions burned: 103 (million)
% 0.89/0.62 % (30726)Instruction limit reached!
% 0.89/0.62 % (30726)------------------------------
% 0.89/0.62 % (30726)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.62 % (30726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.62 % (30726)CaDiCaL version: 2.1.3
% 0.89/0.62 % (30726)Termination reason: Instruction limit
% 0.89/0.62 % (30726)Termination phase: Saturation
% 0.89/0.62 % (30726)Time elapsed: 0.072 s
% 0.89/0.62 % (30726)Peak memory usage: 13 MB
% 0.89/0.62 % (30726)Instructions burned: 122 (million)
% 0.89/0.62 % (30727)Instruction limit reached!
% 0.89/0.62 % (30727)------------------------------
% 0.89/0.62 % (30727)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.62 % (30727)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.62 % (30727)CaDiCaL version: 2.1.3
% 0.89/0.62 % (30727)Termination reason: Instruction limit
% 0.89/0.62 % (30727)Termination phase: Saturation
% 0.89/0.62 % (30727)Time elapsed: 0.075 s
% 0.89/0.62 % (30727)Peak memory usage: 14 MB
% 0.89/0.62 % (30727)Instructions burned: 133 (million)
% 0.89/0.62 % (30736)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3038933493:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.89/0.62 % (30737)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3529780310:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.89/0.62 % TRYING [1]
% 0.89/0.62 % TRYING [2]
% 0.89/0.62 % (30738)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=75253086:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.89/0.62 % (30728)Instruction limit reached!
% 0.89/0.62 % (30728)------------------------------
% 0.89/0.62 % (30728)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.62 % (30728)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.62 % (30728)CaDiCaL version: 2.1.3
% 0.89/0.62 % (30728)Termination reason: Instruction limit
% 0.89/0.62 % (30728)Termination phase: Saturation
% 0.89/0.62 % (30728)Time elapsed: 0.098 s
% 0.89/0.62 % (30728)Peak memory usage: 15 MB
% 0.89/0.62 % (30728)Instructions burned: 159 (million)
% 0.89/0.62 % TRYING [3]
% 0.89/0.62 % TRYING [6]
% 0.89/0.62 % TRYING [4]
% 0.89/0.62 % (30742)ott-21_1_sil=16000:fs=off:random_seed=3277923276:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.89/0.62 % (30723) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-30717-30723"...
% 0.89/0.62 % (30723)...printing done.
% 0.89/0.62 % (30723)Refutation found. Thanks to Tanya!
% 0.89/0.62 % SZS status Theorem for theBenchmark
% 0.89/0.62 % SZS output start Proof for theBenchmark
% See solution above
% 0.89/0.62 % (30723)------------------------------
% 0.89/0.62 % (30723)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.62 % (30723)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.62 % (30723)CaDiCaL version: 2.1.3
% 0.89/0.62 % (30723)Termination reason: Refutation
% 0.89/0.62 % (30723)Time elapsed: 0.153 s
% 0.89/0.62 % (30723)Peak memory usage: 16 MB
% 0.89/0.62 % (30723)Instructions burned: 264 (million)
% 0.89/0.62 % (30717)Success in time 0.196 s
% 0.89/0.62 % Vampire exiting
%------------------------------------------------------------------------------