%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC380+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 : n007.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:47 PM UTC 2026
% Result : Theorem 0.45s 0.37s
% Output : Refutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 83 ( 10 unt; 6 def)
% Number of atoms : 281 ( 50 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 335 ( 137 ~; 143 |; 30 &)
% ( 8 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 7 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 41 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f37,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X0
& memberP(X1,X4) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X5,nil) != X2
| app(cons(X5,nil),X6) != X3 ) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
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
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X0
& memberP(X1,X4) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X5,nil) != X2
| app(cons(X5,nil),X6) != X3 ) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f198,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| cons(X4,nil) != X0
| ~ memberP(X1,X4) )
& ? [X5] :
( ? [X6] :
( cons(X5,nil) = X2
& app(cons(X5,nil),X6) = X3
& ssList(X6) )
& ssItem(X5) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| cons(X4,nil) != X0
| ~ memberP(X1,X4) )
& ? [X5] :
( ? [X6] :
( cons(X5,nil) = X2
& app(cons(X5,nil),X6) = X3
& ssList(X6) )
& ssItem(X5) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f335,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ ssList(X2)
| X0 != X1
| memberP(cons(X1,X2),X0) ),
inference(cnf_transformation,[],[f147]) ).
fof(f392,plain,
! [X0,X1] :
( ~ ssItem(X1)
| ~ ssList(X0)
| cons(X1,X0) = app(cons(X1,nil),X0) ),
inference(cnf_transformation,[],[f198]) ).
fof(f411,plain,
( neq(sK48,nil)
| ssList(sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( neq(sK48,nil)
| sK50 = app(cons(sK51,nil),sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( neq(sK48,nil)
| sK49 = cons(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( ~ neq(sK50,nil)
| ssList(sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( ~ neq(sK50,nil)
| sK50 = app(cons(sK51,nil),sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( ~ neq(sK50,nil)
| sK49 = cons(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
! [X4] :
( ~ neq(sK50,nil)
| ~ memberP(sK48,X4)
| cons(X4,nil) != sK47
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
! [X4] :
( neq(sK48,nil)
| ~ memberP(sK48,X4)
| cons(X4,nil) != sK47
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
( neq(sK48,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f433,plain,
( neq(sK50,nil)
| ssItem(sK51) ),
inference(definition_unfolding,[],[f420,f425]) ).
fof(f434,plain,
! [X4] :
( neq(sK50,nil)
| ~ memberP(sK50,X4)
| cons(X4,nil) != sK49
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f418,f425,f425,f424]) ).
fof(f435,plain,
! [X4] :
( ~ neq(sK50,nil)
| ~ memberP(sK50,X4)
| cons(X4,nil) != sK49
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f417,f425,f424]) ).
fof(f436,plain,
( neq(sK50,nil)
| sK49 = cons(sK51,nil) ),
inference(definition_unfolding,[],[f413,f425]) ).
fof(f437,plain,
( neq(sK50,nil)
| sK50 = app(cons(sK51,nil),sK52) ),
inference(definition_unfolding,[],[f412,f425]) ).
fof(f438,plain,
( neq(sK50,nil)
| ssList(sK52) ),
inference(definition_unfolding,[],[f411,f425]) ).
fof(f454,plain,
! [X2,X1] :
( ~ ssItem(X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| memberP(cons(X1,X2),X1) ),
inference(equality_resolution,[],[f335]) ).
fof(f467,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f454]) ).
fof(f472,definition,
( spl53_1
<=> ssList(sK52) ),
introduced(definition,[new_symbols(definition,[spl53_1])],[avatar_definition]) ).
fof(f474,plain,
( ssList(sK52)
| ~ spl53_1 ),
inference(avatar_component_clause,[],[f472]) ).
fof(f476,definition,
( spl53_2
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl53_2])],[avatar_definition]) ).
fof(f479,plain,
( spl53_1
| spl53_2 ),
inference(avatar_split_clause,[],[f438,f476,f472]) ).
fof(f481,definition,
( spl53_3
<=> sK50 = app(cons(sK51,nil),sK52) ),
introduced(definition,[new_symbols(definition,[spl53_3])],[avatar_definition]) ).
fof(f483,plain,
( sK50 = app(cons(sK51,nil),sK52)
| ~ spl53_3 ),
inference(avatar_component_clause,[],[f481]) ).
fof(f484,plain,
( spl53_3
| spl53_2 ),
inference(avatar_split_clause,[],[f437,f476,f481]) ).
fof(f486,definition,
( spl53_4
<=> sK49 = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl53_4])],[avatar_definition]) ).
fof(f488,plain,
( sK49 = cons(sK51,nil)
| ~ spl53_4 ),
inference(avatar_component_clause,[],[f486]) ).
fof(f489,plain,
( spl53_4
| spl53_2 ),
inference(avatar_split_clause,[],[f436,f476,f486]) ).
fof(f490,plain,
( spl53_1
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f414,f476,f472]) ).
fof(f491,plain,
( spl53_3
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f415,f476,f481]) ).
fof(f492,plain,
( spl53_4
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f416,f476,f486]) ).
fof(f494,definition,
( spl53_5
<=> ! [X4] :
( ~ memberP(sK50,X4)
| ~ ssItem(X4)
| cons(X4,nil) != sK49 ) ),
introduced(definition,[new_symbols(definition,[spl53_5])],[avatar_definition]) ).
fof(f495,plain,
( ! [X4] :
( cons(X4,nil) != sK49
| ~ ssItem(X4)
| ~ memberP(sK50,X4) )
| ~ spl53_5 ),
inference(avatar_component_clause,[],[f494]) ).
fof(f496,plain,
( spl53_5
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f435,f476,f494]) ).
fof(f497,plain,
( spl53_5
| spl53_2 ),
inference(avatar_split_clause,[],[f434,f476,f494]) ).
fof(f499,definition,
( spl53_6
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl53_6])],[avatar_definition]) ).
fof(f501,plain,
( ssItem(sK51)
| ~ spl53_6 ),
inference(avatar_component_clause,[],[f499]) ).
fof(f502,plain,
( spl53_6
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f419,f476,f499]) ).
fof(f503,plain,
( spl53_6
| spl53_2 ),
inference(avatar_split_clause,[],[f433,f476,f499]) ).
fof(f536,plain,
( sK50 = app(sK49,sK52)
| ~ spl53_3
| ~ spl53_4 ),
inference(forward_demodulation,[],[f483,f488]) ).
fof(f537,plain,
( sK49 != sK49
| ~ ssItem(sK51)
| ~ memberP(sK50,sK51)
| ~ spl53_4
| ~ spl53_5 ),
inference(superposition,[],[f495,f488]) ).
fof(f538,plain,
( ~ ssItem(sK51)
| ~ memberP(sK50,sK51)
| ~ spl53_4
| ~ spl53_5 ),
inference(trivial_inequality_removal,[],[f537]) ).
fof(f539,plain,
( ~ memberP(sK50,sK51)
| ~ spl53_4
| ~ spl53_5
| ~ spl53_6 ),
inference(forward_subsumption_resolution,[],[f538,f501]) ).
fof(f1060,plain,
( ! [X0] :
( ~ ssList(X0)
| cons(sK51,X0) = app(cons(sK51,nil),X0) )
| ~ spl53_6 ),
inference(resolution,[],[f392,f501]) ).
fof(f1061,plain,
( ! [X0] :
( ~ ssList(X0)
| cons(sK51,X0) = app(sK49,X0) )
| ~ spl53_4
| ~ spl53_6 ),
inference(forward_demodulation,[],[f1060,f488]) ).
fof(f1098,plain,
( app(sK49,sK52) = cons(sK51,sK52)
| ~ spl53_1
| ~ spl53_4
| ~ spl53_6 ),
inference(resolution,[],[f1061,f474]) ).
fof(f1099,plain,
( sK50 = cons(sK51,sK52)
| ~ spl53_1
| ~ spl53_3
| ~ spl53_4
| ~ spl53_6 ),
inference(forward_demodulation,[],[f1098,f536]) ).
fof(f1294,plain,
( memberP(sK50,sK51)
| ~ ssList(sK52)
| ~ ssItem(sK51)
| ~ spl53_1
| ~ spl53_3
| ~ spl53_4
| ~ spl53_6 ),
inference(superposition,[],[f467,f1099]) ).
fof(f1299,plain,
( ~ ssList(sK52)
| ~ ssItem(sK51)
| ~ spl53_1
| ~ spl53_3
| ~ spl53_4
| ~ spl53_5
| ~ spl53_6 ),
inference(forward_subsumption_resolution,[],[f1294,f539]) ).
fof(f1301,plain,
( ~ ssItem(sK51)
| ~ spl53_1
| ~ spl53_3
| ~ spl53_4
| ~ spl53_5
| ~ spl53_6 ),
inference(forward_subsumption_resolution,[],[f1299,f474]) ).
fof(f1302,plain,
( $false
| ~ spl53_1
| ~ spl53_3
| ~ spl53_4
| ~ spl53_5
| ~ spl53_6 ),
inference(forward_subsumption_resolution,[],[f1301,f501]) ).
fof(f1303,plain,
( ~ spl53_1
| ~ spl53_3
| ~ spl53_4
| ~ spl53_5
| ~ spl53_6 ),
inference(avatar_contradiction_clause,[],[f1302]) ).
cnf(s1,plain,
( spl53_1
| spl53_2 ),
inference(sat_conversion,[],[f479]) ).
cnf(s2,plain,
( spl53_2
| spl53_3 ),
inference(sat_conversion,[],[f484]) ).
cnf(s3,plain,
( spl53_2
| spl53_4 ),
inference(sat_conversion,[],[f489]) ).
cnf(s4,plain,
( spl53_1
| ~ spl53_2 ),
inference(sat_conversion,[],[f490]) ).
cnf(s5,plain,
( ~ spl53_2
| spl53_3 ),
inference(sat_conversion,[],[f491]) ).
cnf(s6,plain,
( ~ spl53_2
| spl53_4 ),
inference(sat_conversion,[],[f492]) ).
cnf(s7,plain,
( ~ spl53_2
| spl53_5 ),
inference(sat_conversion,[],[f496]) ).
cnf(s8,plain,
( spl53_2
| spl53_5 ),
inference(sat_conversion,[],[f497]) ).
cnf(s9,plain,
( ~ spl53_2
| spl53_6 ),
inference(sat_conversion,[],[f502]) ).
cnf(s10,plain,
( spl53_2
| spl53_6 ),
inference(sat_conversion,[],[f503]) ).
cnf(s51,plain,
( ~ spl53_1
| ~ spl53_3
| ~ spl53_4
| ~ spl53_5
| ~ spl53_6 ),
inference(sat_conversion,[],[f1303]) ).
cnf(s57,plain,
spl53_1,
inference(rat,[],[s1,s4]) ).
cnf(s58,plain,
spl53_2,
inference(rat,[],[s51,s2,s3,s8,s10,s57]) ).
cnf(s59,plain,
spl53_6,
inference(rat,[],[s9,s58]) ).
cnf(s60,plain,
spl53_5,
inference(rat,[],[s7,s58]) ).
cnf(s61,plain,
spl53_4,
inference(rat,[],[s6,s58]) ).
cnf(s62,plain,
spl53_3,
inference(rat,[],[s5,s58]) ).
cnf(s71,plain,
$false,
inference(rat,[],[s51,s59,s60,s57,s61,s62]) ).
fof(f1304,plain,
$false,
inference(avatar_sat_refutation,[],[s71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC380+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n007.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 09:20:10 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 Running first-order model finding
% 0.08/0.20 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.45/0.37 % (2261870)Will run a generic schedule for satisfiability detection.
% 0.45/0.37 % (2261875)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=208304726_2999 on theBenchmark for (2999ds/0Mi)
% 0.45/0.37 % (2261877)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2686798026:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.45/0.37 % (2261880)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3153698551:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.45/0.37 % (2261878)dis+10_1_sil=32000:sp=arity:random_seed=2068002230:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.45/0.37 % (2261879)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2458760581:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.45/0.37 % (2261881)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3435529825:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.45/0.37 % TRYING [1]
% 0.45/0.37 % TRYING [2]
% 0.45/0.37 % (2261876)% WARNING: option uhcvi not known.
% 0.45/0.37 % TRYING [3]
% 0.45/0.37 % (2261876)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2855670989:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.45/0.37 % TRYING [4]
% 0.45/0.37 % TRYING [5]
% 0.45/0.37 % (2261878)Instruction limit reached!
% 0.45/0.37 % (2261878)------------------------------
% 0.45/0.37 % (2261878)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.45/0.37 % (2261878)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.45/0.37 % (2261878)CaDiCaL version: 2.1.3
% 0.45/0.37 % (2261878)Termination reason: Instruction limit
% 0.45/0.37 % (2261878)Termination phase: Saturation
% 0.45/0.37 % (2261878)Time elapsed: 0.062 s
% 0.45/0.37 % (2261878)Peak memory usage: 13 MB
% 0.45/0.37 % (2261878)Instructions burned: 104 (million)
% 0.45/0.37 % (2261879)Instruction limit reached!
% 0.45/0.37 % (2261879)------------------------------
% 0.45/0.37 % (2261879)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.45/0.37 % (2261879)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.45/0.37 % (2261879)CaDiCaL version: 2.1.3
% 0.45/0.37 % (2261879)Termination reason: Instruction limit
% 0.45/0.37 % (2261879)Termination phase: Saturation
% 0.45/0.37 % (2261879)Time elapsed: 0.069 s
% 0.45/0.37 % (2261879)Peak memory usage: 13 MB
% 0.45/0.37 % (2261879)Instructions burned: 116 (million)
% 0.45/0.37 % (2261880)Instruction limit reached!
% 0.45/0.37 % (2261880)------------------------------
% 0.45/0.37 % (2261880)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.45/0.37 % (2261880)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.45/0.37 % (2261880)CaDiCaL version: 2.1.3
% 0.45/0.37 % (2261880)Termination reason: Instruction limit
% 0.45/0.37 % (2261880)Termination phase: Saturation
% 0.45/0.37 % (2261880)Time elapsed: 0.076 s
% 0.45/0.37 % (2261880)Peak memory usage: 14 MB
% 0.45/0.37 % (2261880)Instructions burned: 132 (million)
% 0.45/0.37 % (2261889)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1177114127:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.45/0.37 % (2261890)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1726865181:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.45/0.37 % (2261891)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=844930315:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.45/0.37 % TRYING [1]
% 0.45/0.37 % TRYING [2]
% 0.45/0.37 % (2261881)Instruction limit reached!
% 0.45/0.37 % (2261881)------------------------------
% 0.45/0.37 % (2261881)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.45/0.37 % (2261881)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.45/0.37 % (2261881)CaDiCaL version: 2.1.3
% 0.45/0.37 % (2261881)Termination reason: Instruction limit
% 0.45/0.37 % (2261881)Termination phase: Saturation
% 0.45/0.37 % (2261881)Time elapsed: 0.103 s
% 0.45/0.37 % (2261881)Peak memory usage: 15 MB
% 0.45/0.37 % (2261881)Instructions burned: 159 (million)
% 0.45/0.37 % TRYING [3]
% 0.45/0.37 % TRYING [6]
% 0.45/0.37 % (2261891) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2261870-2261891"...
% 0.45/0.37 % TRYING [4]
% 0.45/0.37 % (2261891)...printing done.
% 0.45/0.37 % (2261895)ott-21_1_sil=16000:fs=off:random_seed=3213840969:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.45/0.37 % (2261891)Refutation found. Thanks to Tanya!
% 0.45/0.37 % SZS status Theorem for theBenchmark
% 0.45/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 1.20/0.37 % (2261891)------------------------------
% 1.20/0.37 % (2261891)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.20/0.37 % (2261891)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.20/0.37 % (2261891)CaDiCaL version: 2.1.3
% 1.20/0.37 % (2261891)Termination reason: Refutation
% 1.20/0.37 % (2261891)Time elapsed: 0.026 s
% 1.20/0.37 % (2261891)Peak memory usage: 13 MB
% 1.20/0.37 % (2261891)Instructions burned: 39 (million)
% 1.20/0.37 % (2261870)Success in time 0.159 s
% 1.20/0.37 % Vampire exiting
%------------------------------------------------------------------------------