%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC067+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 : n005.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:31 PM UTC 2026
% Result : Theorem 0.16s 0.53s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 11
% Syntax : Number of formulae : 83 ( 17 unt; 5 def)
% Number of atoms : 353 ( 73 equ)
% Maximal formula atoms : 33 ( 4 avg)
% Number of connectives : 452 ( 182 ~; 173 |; 68 &)
% ( 11 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 6 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 98 ( 0 sgn 64 !; 34 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
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) ) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X14] :
( ssList(X14)
& neq(X14,nil)
& segmentP(X1,X14)
& segmentP(X0,X14) ) ) ) ) ) ) ) ),
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
| ! [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) ) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X14] :
( ssList(X14)
& neq(X14,nil)
& segmentP(X1,X14)
& segmentP(X0,X14) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f172,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f176,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
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) )
& ( nil = X3
| nil != X2 )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X14] :
( ~ ssList(X14)
| ~ neq(X14,nil)
| ~ segmentP(X1,X14)
| ~ segmentP(X0,X14) ) ) )
& 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) )
& ( nil = X3
| nil != X2 )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X14] :
( ~ ssList(X14)
| ~ neq(X14,nil)
| ~ segmentP(X1,X14)
| ~ segmentP(X0,X14) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f241,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
fof(f303,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f304,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f357,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f361,plain,
! [X0] :
( ~ segmentP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f176]) ).
fof(f413,plain,
ssList(sK52),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
sK50 = app(app(sK51,sK49),sK52),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
! [X14] :
( ~ segmentP(sK47,X14)
| ~ segmentP(sK48,X14)
| ~ neq(X14,nil)
| ~ ssList(X14)
| nil = sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
ssList(sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
( neq(sK48,nil)
| nil != sK47 ),
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
( nil != sK49
| nil = sK50 ),
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f423,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f431,plain,
( neq(sK50,nil)
| nil != sK49 ),
inference(definition_unfolding,[],[f419,f424,f423]) ).
fof(f433,plain,
! [X14] :
( ~ segmentP(sK49,X14)
| ~ segmentP(sK50,X14)
| ~ neq(X14,nil)
| ~ ssList(X14)
| nil = sK50 ),
inference(definition_unfolding,[],[f416,f423,f424,f424]) ).
fof(f439,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f241]) ).
fof(f448,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f304]) ).
fof(f463,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f448]) ).
fof(f467,definition,
( spl53_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl53_1])],[avatar_definition]) ).
fof(f469,plain,
( nil = sK50
| ~ spl53_1 ),
inference(avatar_component_clause,[],[f467]) ).
fof(f471,definition,
( spl53_2
<=> ! [X14] :
( ~ segmentP(sK49,X14)
| ~ ssList(X14)
| ~ neq(X14,nil)
| ~ segmentP(sK50,X14) ) ),
introduced(definition,[new_symbols(definition,[spl53_2])],[avatar_definition]) ).
fof(f472,plain,
( ! [X14] :
( ~ neq(X14,nil)
| ~ ssList(X14)
| ~ segmentP(sK49,X14)
| ~ segmentP(sK50,X14) )
| ~ spl53_2 ),
inference(avatar_component_clause,[],[f471]) ).
fof(f473,plain,
( spl53_1
| spl53_2 ),
inference(avatar_split_clause,[],[f433,f471,f467]) ).
fof(f475,definition,
( spl53_3
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl53_3])],[avatar_definition]) ).
fof(f477,plain,
( nil != sK49
| spl53_3 ),
inference(avatar_component_clause,[],[f475]) ).
fof(f480,definition,
( spl53_4
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl53_4])],[avatar_definition]) ).
fof(f482,plain,
( neq(sK50,nil)
| ~ spl53_4 ),
inference(avatar_component_clause,[],[f480]) ).
fof(f483,plain,
( ~ spl53_3
| spl53_4 ),
inference(avatar_split_clause,[],[f431,f480,f475]) ).
fof(f485,plain,
( spl53_1
| ~ spl53_3 ),
inference(avatar_split_clause,[],[f421,f475,f467]) ).
fof(f487,definition,
( spl53_5
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl53_5])],[avatar_definition]) ).
fof(f488,plain,
( ssList(nil)
| ~ spl53_5 ),
inference(avatar_component_clause,[],[f487]) ).
fof(f515,plain,
spl53_5,
inference(avatar_split_clause,[],[f306,f487]) ).
fof(f660,plain,
( ! [X0] :
( ~ ssList(nil)
| nil = X0
| ~ ssList(X0)
| ~ ssList(X0)
| ~ segmentP(sK49,X0)
| ~ segmentP(sK50,X0) )
| ~ spl53_2 ),
inference(resolution,[],[f303,f472]) ).
fof(f665,plain,
( ! [X0] :
( ~ ssList(nil)
| nil = X0
| ~ ssList(X0)
| ~ segmentP(sK49,X0)
| ~ segmentP(sK50,X0) )
| ~ spl53_2 ),
inference(duplicate_literal_removal,[],[f660]) ).
fof(f666,plain,
( ! [X0] :
( ~ segmentP(sK50,X0)
| ~ ssList(X0)
| ~ segmentP(sK49,X0)
| nil = X0 )
| ~ spl53_2
| ~ spl53_5 ),
inference(forward_subsumption_resolution,[],[f665,f488]) ).
fof(f741,plain,
( neq(nil,nil)
| ~ spl53_1
| ~ spl53_4 ),
inference(superposition,[],[f482,f469]) ).
fof(f1703,plain,
( ~ ssList(nil)
| ~ spl53_1
| ~ spl53_4 ),
inference(resolution,[],[f741,f463]) ).
fof(f1704,plain,
( $false
| ~ spl53_1
| ~ spl53_4
| ~ spl53_5 ),
inference(forward_subsumption_resolution,[],[f1703,f488]) ).
fof(f1705,plain,
( ~ spl53_1
| ~ spl53_4
| ~ spl53_5 ),
inference(avatar_contradiction_clause,[],[f1704]) ).
fof(f2984,plain,
( segmentP(sK50,sK49)
| ~ ssList(sK49)
| ~ ssList(sK52)
| ~ ssList(sK51)
| ~ ssList(sK50) ),
inference(superposition,[],[f439,f415]) ).
fof(f2995,plain,
( segmentP(sK50,sK49)
| ~ ssList(sK52)
| ~ ssList(sK51)
| ~ ssList(sK50) ),
inference(forward_subsumption_resolution,[],[f2984,f425]) ).
fof(f3003,plain,
( segmentP(sK50,sK49)
| ~ ssList(sK51)
| ~ ssList(sK50) ),
inference(forward_subsumption_resolution,[],[f2995,f413]) ).
fof(f3011,plain,
( segmentP(sK50,sK49)
| ~ ssList(sK50) ),
inference(forward_subsumption_resolution,[],[f3003,f418]) ).
fof(f3017,plain,
segmentP(sK50,sK49),
inference(forward_subsumption_resolution,[],[f3011,f422]) ).
fof(f3020,plain,
( segmentP(nil,sK49)
| ~ spl53_1 ),
inference(forward_demodulation,[],[f3017,f469]) ).
fof(f3021,plain,
( nil = sK49
| ~ ssList(sK49)
| ~ spl53_1 ),
inference(resolution,[],[f3020,f361]) ).
fof(f3030,plain,
( ~ ssList(sK49)
| ~ spl53_1
| spl53_3 ),
inference(forward_subsumption_resolution,[],[f3021,f477]) ).
fof(f3035,plain,
( $false
| ~ spl53_1
| spl53_3 ),
inference(forward_subsumption_resolution,[],[f3030,f425]) ).
fof(f3036,plain,
( ~ spl53_1
| spl53_3 ),
inference(avatar_contradiction_clause,[],[f3035]) ).
fof(f3067,plain,
( ~ ssList(sK49)
| ~ segmentP(sK49,sK49)
| nil = sK49
| ~ spl53_2
| ~ spl53_5 ),
inference(resolution,[],[f3017,f666]) ).
fof(f3079,plain,
( ~ segmentP(sK49,sK49)
| nil = sK49
| ~ spl53_2
| ~ spl53_5 ),
inference(forward_subsumption_resolution,[],[f3067,f425]) ).
fof(f3084,plain,
( ~ segmentP(sK49,sK49)
| ~ spl53_2
| spl53_3
| ~ spl53_5 ),
inference(forward_subsumption_resolution,[],[f3079,f477]) ).
fof(f3085,plain,
( ~ ssList(sK49)
| ~ spl53_2
| spl53_3
| ~ spl53_5 ),
inference(resolution,[],[f3084,f357]) ).
fof(f3089,plain,
( $false
| ~ spl53_2
| spl53_3
| ~ spl53_5 ),
inference(forward_subsumption_resolution,[],[f3085,f425]) ).
fof(f3090,plain,
( ~ spl53_2
| spl53_3
| ~ spl53_5 ),
inference(avatar_contradiction_clause,[],[f3089]) ).
cnf(s1,plain,
( spl53_1
| spl53_2 ),
inference(sat_conversion,[],[f473]) ).
cnf(s3,plain,
( ~ spl53_3
| spl53_4 ),
inference(sat_conversion,[],[f483]) ).
cnf(s5,plain,
( spl53_1
| ~ spl53_3 ),
inference(sat_conversion,[],[f485]) ).
cnf(s13,plain,
spl53_5,
inference(sat_conversion,[],[f515]) ).
cnf(s57,plain,
( ~ spl53_1
| ~ spl53_4
| ~ spl53_5 ),
inference(sat_conversion,[],[f1705]) ).
cnf(s112,plain,
( ~ spl53_1
| spl53_3 ),
inference(sat_conversion,[],[f3036]) ).
cnf(s115,plain,
( ~ spl53_2
| spl53_3
| ~ spl53_5 ),
inference(sat_conversion,[],[f3090]) ).
cnf(s121,plain,
spl53_1,
inference(rat,[],[s115,s1,s5,s13]) ).
cnf(s122,plain,
spl53_3,
inference(rat,[],[s112,s121]) ).
cnf(s126,plain,
~ spl53_4,
inference(rat,[],[s57,s13,s121]) ).
cnf(s128,plain,
$false,
inference(rat,[],[s3,s126,s122]) ).
fof(f3091,plain,
$false,
inference(avatar_sat_refutation,[],[s128]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC067+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n005.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 07:41:47 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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
% 0.16/0.53 % (625640)Will run a generic schedule for satisfiability detection.
% 0.16/0.53 % (625650)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1267781227:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.53 % (625646)% WARNING: option uhcvi not known.
% 0.16/0.53 % (625647)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1931001900:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.53 % (625645)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3380969996_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.53 % (625646)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2869599689:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.53 % (625648)dis+10_1_sil=32000:sp=arity:random_seed=2279996008:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.53 % (625649)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3713251729:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.53 % (625651)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1007735369:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.53 % TRYING [1]
% 0.16/0.53 % TRYING [2]
% 0.16/0.53 % TRYING [3]
% 0.16/0.53 % (625650)Instruction limit reached!
% 0.16/0.53 % (625650)------------------------------
% 0.16/0.53 % (625650)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.53 % (625650)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.53 % (625650)CaDiCaL version: 2.1.3
% 0.16/0.53 % (625650)Termination reason: Instruction limit
% 0.16/0.53 % (625650)Termination phase: Saturation
% 0.16/0.53 % (625650)Time elapsed: 0.042 s
% 0.16/0.53 % (625650)Peak memory usage: 14 MB
% 0.16/0.53 % (625650)Instructions burned: 131 (million)
% 0.16/0.53 % TRYING [4]
% 0.16/0.53 % (625659)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2926683303:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.16/0.53 % (625648)Instruction limit reached!
% 0.16/0.53 % (625648)------------------------------
% 0.16/0.53 % (625648)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.53 % (625648)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.53 % (625648)CaDiCaL version: 2.1.3
% 0.16/0.53 % (625648)Termination reason: Instruction limit
% 0.16/0.53 % (625648)Termination phase: Saturation
% 0.16/0.53 % (625648)Time elapsed: 0.060 s
% 0.16/0.53 % (625648)Peak memory usage: 13 MB
% 0.16/0.53 % (625648)Instructions burned: 103 (million)
% 0.16/0.53 % (625649) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-625640-625649"...
% 0.16/0.53 % (625649)...printing done.
% 0.16/0.53 % TRYING [1]
% 0.16/0.53 % (625649)Refutation found. Thanks to Tanya!
% 0.16/0.53 % SZS status Theorem for theBenchmark
% 0.16/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.53 % (625649)------------------------------
% 0.16/0.53 % (625649)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.53 % (625649)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.53 % (625649)CaDiCaL version: 2.1.3
% 0.16/0.53 % (625649)Termination reason: Refutation
% 0.16/0.53 % (625649)Time elapsed: 0.068 s
% 0.16/0.53 % (625649)Peak memory usage: 14 MB
% 0.16/0.53 % (625649)Instructions burned: 112 (million)
% 0.16/0.53 % (625640)Success in time 0.108 s
% 0.16/0.53 % Vampire exiting
%------------------------------------------------------------------------------