%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC008+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 : n017.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:15 PM UTC 2026
% Result : Theorem 0.36s 0.53s
% Output : Refutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 78 ( 27 unt; 8 def)
% Number of atoms : 268 ( 52 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 320 ( 130 ~; 118 |; 51 &)
% ( 10 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 9 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn 50 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ frontsegP(X3,X2)
| ~ equalelemsP(X2)
| ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X4,X5),X6) = X1
& app(X4,X6) = X0 ) ) )
| ? [X7] :
( ssList(X7)
& neq(X2,X7)
& frontsegP(X3,X7)
& segmentP(X7,X2)
& equalelemsP(X7) ) ) ) ) ) ),
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
| ~ frontsegP(X3,X2)
| ~ equalelemsP(X2)
| ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X4,X5),X6) = X1
& app(X4,X6) = X0 ) ) )
| ? [X7] :
( ssList(X7)
& neq(X2,X7)
& frontsegP(X3,X7)
& segmentP(X7,X2)
& equalelemsP(X7) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& frontsegP(X3,X2)
& equalelemsP(X2)
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) != X1
| app(X4,X6) != X0 ) ) )
& ! [X7] :
( ~ ssList(X7)
| ~ neq(X2,X7)
| ~ frontsegP(X3,X7)
| ~ segmentP(X7,X2)
| ~ equalelemsP(X7) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& frontsegP(X3,X2)
& equalelemsP(X2)
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) != X1
| app(X4,X6) != X0 ) ) )
& ! [X7] :
( ~ ssList(X7)
| ~ neq(X2,X7)
| ~ frontsegP(X3,X7)
| ~ segmentP(X7,X2)
| ~ equalelemsP(X7) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f240,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f101]) ).
fof(f241,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X3] :
( ssList(X3)
& app(X1,X3) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f240]) ).
fof(f242,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ( ssList(sK11(X0,X1))
& app(X1,sK11(X0,X1)) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X3,sK11(X0,X1))],[f241]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& frontsegP(sK56,sK55)
& equalelemsP(sK55)
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) != sK54
| app(X4,X6) != sK53 ) ) )
& ! [X7] :
( ~ ssList(X7)
| ~ neq(sK55,X7)
| ~ frontsegP(sK56,X7)
| ~ segmentP(X7,sK55)
| ~ equalelemsP(X7) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f309,plain,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| app(X1,sK11(X0,X1)) = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f242]) ).
fof(f310,plain,
! [X0,X1] :
( ssList(sK11(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f242]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f482,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f497,plain,
ssList(sK54),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
! [X6,X4,X5] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,X5),X6) != sK54
| app(X4,X6) != sK53 ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
frontsegP(sK56,sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
! [X6,X4,X5] :
( app(X4,X6) != sK55
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,X5),X6) != sK56
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f501,f505,f504]) ).
fof(f507,plain,
ssList(sK56),
inference(definition_unfolding,[],[f497,f505]) ).
fof(f508,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f504]) ).
fof(f684,definition,
( spl57_1
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f712,plain,
spl57_1,
inference(avatar_split_clause,[],[f389,f684]) ).
fof(f764,definition,
( spl57_7
<=> ssList(sK55) ),
introduced(definition,[new_symbols(definition,[spl57_7])],[avatar_definition]) ).
fof(f766,plain,
( ~ ssList(sK55)
| spl57_7 ),
inference(avatar_component_clause,[],[f764]) ).
fof(f789,plain,
sK55 = app(sK55,nil),
inference(resolution,[],[f482,f508]) ).
fof(f790,plain,
sK56 = app(sK56,nil),
inference(resolution,[],[f482,f507]) ).
fof(f791,plain,
( $false
| spl57_7 ),
inference(resolution,[],[f766,f508]) ).
fof(f792,plain,
spl57_7,
inference(avatar_contradiction_clause,[],[f791]) ).
fof(f795,definition,
( spl57_9
<=> ssList(sK56) ),
introduced(definition,[new_symbols(definition,[spl57_9])],[avatar_definition]) ).
fof(f797,plain,
( ~ ssList(sK56)
| spl57_9 ),
inference(avatar_component_clause,[],[f795]) ).
fof(f806,plain,
( $false
| spl57_9 ),
inference(resolution,[],[f797,f507]) ).
fof(f807,plain,
spl57_9,
inference(avatar_contradiction_clause,[],[f806]) ).
fof(f808,plain,
! [X0] :
( sK55 != sK55
| ~ ssList(X0)
| ~ ssList(nil)
| sK56 != app(app(sK55,X0),nil)
| ~ ssList(sK55) ),
inference(superposition,[],[f506,f789]) ).
fof(f809,plain,
! [X0] :
( ~ ssList(X0)
| ~ ssList(nil)
| sK56 != app(app(sK55,X0),nil)
| ~ ssList(sK55) ),
inference(trivial_inequality_removal,[],[f808]) ).
fof(f811,definition,
( spl57_12
<=> ! [X0] :
( ~ ssList(X0)
| sK56 != app(app(sK55,X0),nil) ) ),
introduced(definition,[new_symbols(definition,[spl57_12])],[avatar_definition]) ).
fof(f812,plain,
( ! [X0] :
( sK56 != app(app(sK55,X0),nil)
| ~ ssList(X0) )
| ~ spl57_12 ),
inference(avatar_component_clause,[],[f811]) ).
fof(f813,plain,
( ~ spl57_7
| ~ spl57_1
| spl57_12 ),
inference(avatar_split_clause,[],[f809,f811,f684,f764]) ).
fof(f1384,definition,
( spl57_35
<=> sK56 = app(sK56,nil) ),
introduced(definition,[new_symbols(definition,[spl57_35])],[avatar_definition]) ).
fof(f1386,plain,
( sK56 != app(sK56,nil)
| spl57_35 ),
inference(avatar_component_clause,[],[f1384]) ).
fof(f1389,plain,
( sK56 != sK56
| spl57_35 ),
inference(superposition,[],[f1386,f790]) ).
fof(f1390,plain,
( $false
| spl57_35 ),
inference(trivial_inequality_removal,[],[f1389]) ).
fof(f1391,plain,
spl57_35,
inference(avatar_contradiction_clause,[],[f1390]) ).
fof(f3979,plain,
( sK56 = app(sK55,sK11(sK56,sK55))
| ~ ssList(sK55)
| ~ ssList(sK56) ),
inference(resolution,[],[f309,f503]) ).
fof(f3985,definition,
( spl57_185
<=> sK56 = app(sK55,sK11(sK56,sK55)) ),
introduced(definition,[new_symbols(definition,[spl57_185])],[avatar_definition]) ).
fof(f3987,plain,
( sK56 = app(sK55,sK11(sK56,sK55))
| ~ spl57_185 ),
inference(avatar_component_clause,[],[f3985]) ).
fof(f3988,plain,
( ~ spl57_9
| ~ spl57_7
| spl57_185 ),
inference(avatar_split_clause,[],[f3979,f3985,f764,f795]) ).
fof(f4004,plain,
( sK56 != app(sK56,nil)
| ~ ssList(sK11(sK56,sK55))
| ~ spl57_12
| ~ spl57_185 ),
inference(superposition,[],[f812,f3987]) ).
fof(f4012,definition,
( spl57_188
<=> ssList(sK11(sK56,sK55)) ),
introduced(definition,[new_symbols(definition,[spl57_188])],[avatar_definition]) ).
fof(f4014,plain,
( ~ ssList(sK11(sK56,sK55))
| spl57_188 ),
inference(avatar_component_clause,[],[f4012]) ).
fof(f4020,plain,
( ~ spl57_188
| ~ spl57_35
| ~ spl57_12
| ~ spl57_185 ),
inference(avatar_split_clause,[],[f4004,f3985,f811,f1384,f4012]) ).
fof(f4021,plain,
( ~ frontsegP(sK56,sK55)
| ~ ssList(sK55)
| ~ ssList(sK56)
| spl57_188 ),
inference(resolution,[],[f4014,f310]) ).
fof(f4023,definition,
( spl57_190
<=> frontsegP(sK56,sK55) ),
introduced(definition,[new_symbols(definition,[spl57_190])],[avatar_definition]) ).
fof(f4025,plain,
( ~ frontsegP(sK56,sK55)
| spl57_190 ),
inference(avatar_component_clause,[],[f4023]) ).
fof(f4026,plain,
( ~ spl57_9
| ~ spl57_7
| ~ spl57_190
| spl57_188 ),
inference(avatar_split_clause,[],[f4021,f4012,f4023,f764,f795]) ).
fof(f4072,plain,
( $false
| spl57_190 ),
inference(resolution,[],[f4025,f503]) ).
fof(f4073,plain,
spl57_190,
inference(avatar_contradiction_clause,[],[f4072]) ).
cnf(s8,plain,
spl57_1,
inference(sat_conversion,[],[f712]) ).
cnf(s10,plain,
spl57_7,
inference(sat_conversion,[],[f792]) ).
cnf(s12,plain,
spl57_9,
inference(sat_conversion,[],[f807]) ).
cnf(s13,plain,
( ~ spl57_1
| ~ spl57_7
| spl57_12 ),
inference(sat_conversion,[],[f813]) ).
cnf(s45,plain,
spl57_35,
inference(sat_conversion,[],[f1391]) ).
cnf(s230,plain,
( ~ spl57_7
| ~ spl57_9
| spl57_185 ),
inference(sat_conversion,[],[f3988]) ).
cnf(s234,plain,
( ~ spl57_12
| ~ spl57_35
| ~ spl57_185
| ~ spl57_188 ),
inference(sat_conversion,[],[f4020]) ).
cnf(s235,plain,
( ~ spl57_7
| ~ spl57_9
| spl57_188
| ~ spl57_190 ),
inference(sat_conversion,[],[f4026]) ).
cnf(s246,plain,
spl57_190,
inference(sat_conversion,[],[f4073]) ).
cnf(s247,plain,
( ~ spl57_7
| ~ spl57_9
| spl57_188 ),
inference(rat,[],[s235,s246]) ).
cnf(s261,plain,
spl57_188,
inference(rat,[],[s247,s12,s10]) ).
cnf(s262,plain,
spl57_185,
inference(rat,[],[s230,s12,s10]) ).
cnf(s263,plain,
~ spl57_12,
inference(rat,[],[s234,s261,s45,s262]) ).
cnf(s265,plain,
~ spl57_1,
inference(rat,[],[s13,s10,s263]) ).
cnf(s266,plain,
$false,
inference(rat,[],[s8,s265]) ).
fof(f4074,plain,
$false,
inference(avatar_sat_refutation,[],[s266]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC008+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.36 % Computer : n017.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 28 07:20:51 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.39 Running first-order model finding
% 0.09/0.39 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.36/0.53 % (3372612)Will run a generic schedule for satisfiability detection.
% 0.36/0.53 % (3372620)dis+10_1_sil=32000:sp=arity:random_seed=1017768613:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.36/0.53 % (3372618)% WARNING: option uhcvi not known.
% 0.36/0.53 % (3372617)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3508918794_2999 on theBenchmark for (2999ds/0Mi)
% 0.36/0.53 % (3372619)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1701424473:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.36/0.53 % (3372621)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=827906656:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.36/0.53 % (3372622)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2504219721:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.36/0.53 % (3372623)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3958647267:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.36/0.53 % (3372618)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1482783169:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.36/0.53 % TRYING [1]
% 0.36/0.53 % TRYING [2]
% 0.36/0.53 % TRYING [3]
% 0.36/0.53 % (3372620)Instruction limit reached!
% 0.36/0.53 % (3372620)------------------------------
% 0.36/0.53 % (3372620)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.53 % (3372620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.53 % (3372620)CaDiCaL version: 2.1.3
% 0.36/0.53 % (3372620)Termination reason: Instruction limit
% 0.36/0.53 % (3372620)Termination phase: Saturation
% 0.36/0.53 % (3372620)Time elapsed: 0.034 s
% 0.36/0.53 % (3372620)Peak memory usage: 13 MB
% 0.36/0.53 % (3372620)Instructions burned: 106 (million)
% 0.36/0.53 % TRYING [4]
% 0.36/0.53 % (3372631)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1795719808:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.36/0.53 % TRYING [1]
% 0.36/0.53 % TRYING [2]
% 0.36/0.53 % TRYING [3]
% 0.36/0.53 % TRYING [4]
% 0.36/0.53 % (3372621)Instruction limit reached!
% 0.36/0.53 % (3372621)------------------------------
% 0.36/0.53 % (3372621)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.53 % (3372621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.53 % (3372621)CaDiCaL version: 2.1.3
% 0.36/0.53 % (3372621)Termination reason: Instruction limit
% 0.36/0.53 % (3372621)Termination phase: Saturation
% 0.36/0.53 % (3372621)Time elapsed: 0.066 s
% 0.36/0.53 % (3372621)Peak memory usage: 13 MB
% 0.36/0.53 % (3372621)Instructions burned: 117 (million)
% 0.36/0.53 % (3372622)Instruction limit reached!
% 0.36/0.53 % (3372622)------------------------------
% 0.36/0.53 % (3372622)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.53 % (3372622)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.53 % (3372622)CaDiCaL version: 2.1.3
% 0.36/0.53 % (3372622)Termination reason: Instruction limit
% 0.36/0.53 % (3372622)Termination phase: Saturation
% 0.36/0.53 % (3372622)Time elapsed: 0.077 s
% 0.36/0.53 % (3372622)Peak memory usage: 14 MB
% 0.36/0.53 % (3372622)Instructions burned: 131 (million)
% 0.36/0.53 % (3372623) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3372612-3372623"...
% 0.36/0.53 % TRYING [5]
% 0.36/0.53 % (3372623)...printing done.
% 0.36/0.53 % (3372633)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1892714712:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.36/0.53 % (3372623)Refutation found. Thanks to Tanya!
% 0.36/0.53 % SZS status Theorem for theBenchmark
% 0.36/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.36/0.53 % (3372623)------------------------------
% 0.36/0.53 % (3372623)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.53 % (3372623)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.53 % (3372623)CaDiCaL version: 2.1.3
% 0.36/0.53 % (3372623)Termination reason: Refutation
% 0.36/0.53 % (3372623)Time elapsed: 0.084 s
% 0.36/0.53 % (3372623)Peak memory usage: 15 MB
% 0.36/0.53 % (3372623)Instructions burned: 129 (million)
% 0.36/0.53 % (3372612)Success in time 0.125 s
% 0.36/0.53 % Vampire exiting
%------------------------------------------------------------------------------