%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : KRS076+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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 11:41:35 AM UTC 2026
% Result : Unsatisfiable 3.82s 1.51s
% Output : Refutation 3.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 65 ( 9 unt; 3 def)
% Number of atoms : 218 ( 21 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 258 ( 105 ~; 94 |; 46 &)
% ( 7 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 109 ( 0 sgn 88 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rf(X0,X1)
& cp(X1) )
& ? [X1] :
( rf1(X0,X1)
& ~ cp(X1)
& ! [X2] :
( rinvF1(X1,X2)
=> ? [X3] :
( rs(X2,X3)
& cowlThing(X3) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f22,axiom,
! [X0,X1,X2] :
( ( rf(X0,X1)
& rf(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f23,axiom,
! [X0,X1,X2] :
( ( rf1(X0,X1)
& rf1(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f25,axiom,
! [X0,X1] :
( rinvF1(X0,X1)
<=> rf1(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f28,axiom,
cUnsatisfiable(i2003_11_14_17_19_06193),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(f29,axiom,
! [X0,X1] :
( rs(X0,X1)
=> rf1(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).
fof(f30,axiom,
! [X0,X1] :
( rs(X0,X1)
=> rf(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(f31,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rf(X0,X1)
& cp(X1) )
& ? [X2] :
( rf1(X0,X2)
& ~ cp(X2)
& ! [X3] :
( rinvF1(X2,X3)
=> ? [X4] :
( rs(X3,X4)
& cowlThing(X4) ) ) ) ) ),
inference(rectify,[],[f21]) ).
fof(f68,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rf(X0,X1)
& cp(X1) )
& ? [X2] :
( rf1(X0,X2)
& ~ cp(X2)
& ! [X3] :
( ? [X4] :
( rs(X3,X4)
& cowlThing(X4) )
| ~ rinvF1(X2,X3) ) ) ) ),
inference(ennf_transformation,[],[f31]) ).
fof(f69,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X1)
| ~ rf(X0,X2) ),
inference(ennf_transformation,[],[f22]) ).
fof(f70,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X1)
| ~ rf(X0,X2) ),
inference(flattening,[],[f69]) ).
fof(f71,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf1(X0,X1)
| ~ rf1(X0,X2) ),
inference(ennf_transformation,[],[f23]) ).
fof(f72,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf1(X0,X1)
| ~ rf1(X0,X2) ),
inference(flattening,[],[f71]) ).
fof(f75,plain,
! [X0,X1] :
( rf1(X0,X1)
| ~ rs(X0,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f76,plain,
! [X0,X1] :
( rf(X0,X1)
| ~ rs(X0,X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f78,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rf(X0,X1)
| ~ cp(X1) )
| ! [X2] :
( ~ rf1(X0,X2)
| cp(X2)
| ? [X3] :
( ! [X4] :
( ~ rs(X3,X4)
| ~ cowlThing(X4) )
& rinvF1(X2,X3) ) ) )
& ( ( ? [X1] :
( rf(X0,X1)
& cp(X1) )
& ? [X2] :
( rf1(X0,X2)
& ~ cp(X2)
& ! [X3] :
( ? [X4] :
( rs(X3,X4)
& cowlThing(X4) )
| ~ rinvF1(X2,X3) ) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f68]) ).
fof(f79,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rf(X0,X1)
| ~ cp(X1) )
| ! [X2] :
( ~ rf1(X0,X2)
| cp(X2)
| ? [X3] :
( ! [X4] :
( ~ rs(X3,X4)
| ~ cowlThing(X4) )
& rinvF1(X2,X3) ) ) )
& ( ( ? [X1] :
( rf(X0,X1)
& cp(X1) )
& ? [X2] :
( rf1(X0,X2)
& ~ cp(X2)
& ! [X3] :
( ? [X4] :
( rs(X3,X4)
& cowlThing(X4) )
| ~ rinvF1(X2,X3) ) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f78]) ).
fof(f80,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rf(X0,X1)
| ~ cp(X1) )
| ! [X2] :
( ~ rf1(X0,X2)
| cp(X2)
| ? [X3] :
( ! [X4] :
( ~ rs(X3,X4)
| ~ cowlThing(X4) )
& rinvF1(X2,X3) ) ) )
& ( ( ? [X5] :
( rf(X0,X5)
& cp(X5) )
& ? [X6] :
( rf1(X0,X6)
& ~ cp(X6)
& ! [X7] :
( ? [X8] :
( rs(X7,X8)
& cowlThing(X8) )
| ~ rinvF1(X6,X7) ) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f79]) ).
fof(f81,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rf(X0,X1)
| ~ cp(X1) )
| ! [X2] :
( ~ rf1(X0,X2)
| cp(X2)
| ( ! [X4] :
( ~ rs(sK0(X2),X4)
| ~ cowlThing(X4) )
& rinvF1(X2,sK0(X2)) ) ) )
& ( ( rf(X0,sK1(X0))
& cp(sK1(X0))
& rf1(X0,sK2(X0))
& ~ cp(sK2(X0))
& ! [X7] :
( ( rs(X7,sK3(X7))
& cowlThing(sK3(X7)) )
| ~ rinvF1(sK2(X0),X7) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X3,sK0(X2)),skolemize(X5,sK1(X0)),skolemize(X6,sK2(X0)),skolemize(X8,sK3(X7))],[f80]) ).
fof(f83,plain,
! [X0,X1] :
( ( rinvF1(X0,X1)
| ~ rf1(X1,X0) )
& ( rf1(X1,X0)
| ~ rinvF1(X0,X1) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f108,plain,
! [X0,X7] :
( rs(X7,sK3(X7))
| ~ rinvF1(sK2(X0),X7)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f109,plain,
! [X0] :
( ~ cp(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f110,plain,
! [X0] :
( rf1(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f111,plain,
! [X0] :
( cp(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f112,plain,
! [X0] :
( rf(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f115,plain,
! [X2,X0,X1] :
( ~ rf(X0,X1)
| X1 = X2
| ~ rf(X0,X2) ),
inference(cnf_transformation,[],[f70]) ).
fof(f116,plain,
! [X2,X0,X1] :
( ~ rf1(X0,X1)
| X1 = X2
| ~ rf1(X0,X2) ),
inference(cnf_transformation,[],[f72]) ).
fof(f120,plain,
! [X0,X1] :
( rinvF1(X0,X1)
| ~ rf1(X1,X0) ),
inference(cnf_transformation,[],[f83]) ).
fof(f124,plain,
cUnsatisfiable(i2003_11_14_17_19_06193),
inference(cnf_transformation,[],[f28]) ).
fof(f125,plain,
! [X0,X1] :
( rf1(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f75]) ).
fof(f126,plain,
! [X0,X1] :
( rf(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f76]) ).
fof(f147,plain,
! [X0,X1] :
( ~ cUnsatisfiable(X0)
| ~ rf(X0,X1)
| sK1(X0) = X1 ),
inference(resolution,[],[f115,f112]) ).
fof(f150,plain,
! [X0,X1] :
( ~ cUnsatisfiable(X0)
| ~ rf1(X0,X1)
| sK2(X0) = X1 ),
inference(resolution,[],[f116,f110]) ).
fof(f156,plain,
! [X0] :
( ~ rf(i2003_11_14_17_19_06193,X0)
| sK1(i2003_11_14_17_19_06193) = X0 ),
inference(resolution,[],[f147,f124]) ).
fof(f159,plain,
! [X0] :
( ~ rs(i2003_11_14_17_19_06193,X0)
| sK1(i2003_11_14_17_19_06193) = X0 ),
inference(resolution,[],[f156,f126]) ).
fof(f162,plain,
! [X0] :
( sK1(i2003_11_14_17_19_06193) = sK3(i2003_11_14_17_19_06193)
| ~ rinvF1(sK2(X0),i2003_11_14_17_19_06193)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f159,f108]) ).
fof(f164,definition,
( spl4_1
<=> ! [X0] :
( ~ rinvF1(sK2(X0),i2003_11_14_17_19_06193)
| ~ cUnsatisfiable(X0) ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f165,plain,
( ! [X0] :
( ~ rinvF1(sK2(X0),i2003_11_14_17_19_06193)
| ~ cUnsatisfiable(X0) )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f164]) ).
fof(f167,definition,
( spl4_2
<=> sK1(i2003_11_14_17_19_06193) = sK3(i2003_11_14_17_19_06193) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f169,plain,
( sK1(i2003_11_14_17_19_06193) = sK3(i2003_11_14_17_19_06193)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f167]) ).
fof(f170,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f162,f167,f164]) ).
fof(f180,plain,
( ! [X0] :
( ~ cUnsatisfiable(X0)
| ~ rf1(i2003_11_14_17_19_06193,sK2(X0)) )
| ~ spl4_1 ),
inference(resolution,[],[f165,f120]) ).
fof(f181,plain,
! [X0] :
( ~ rf1(i2003_11_14_17_19_06193,X0)
| sK2(i2003_11_14_17_19_06193) = X0 ),
inference(resolution,[],[f150,f124]) ).
fof(f182,plain,
( ~ rf1(i2003_11_14_17_19_06193,sK2(i2003_11_14_17_19_06193))
| ~ spl4_1 ),
inference(resolution,[],[f180,f124]) ).
fof(f185,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_06193)
| ~ spl4_1 ),
inference(resolution,[],[f182,f110]) ).
fof(f187,plain,
( $false
| ~ spl4_1 ),
inference(forward_subsumption_resolution,[],[f185,f124]) ).
fof(f188,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f187]) ).
fof(f196,plain,
! [X0] :
( ~ rs(i2003_11_14_17_19_06193,X0)
| sK2(i2003_11_14_17_19_06193) = X0 ),
inference(resolution,[],[f181,f125]) ).
fof(f200,plain,
! [X0] :
( sK3(i2003_11_14_17_19_06193) = sK2(i2003_11_14_17_19_06193)
| ~ rinvF1(sK2(X0),i2003_11_14_17_19_06193)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f196,f108]) ).
fof(f201,plain,
( ! [X0] :
( sK1(i2003_11_14_17_19_06193) = sK2(i2003_11_14_17_19_06193)
| ~ rinvF1(sK2(X0),i2003_11_14_17_19_06193)
| ~ cUnsatisfiable(X0) )
| ~ spl4_2 ),
inference(forward_demodulation,[],[f200,f169]) ).
fof(f203,definition,
( spl4_4
<=> sK1(i2003_11_14_17_19_06193) = sK2(i2003_11_14_17_19_06193) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
fof(f205,plain,
( sK1(i2003_11_14_17_19_06193) = sK2(i2003_11_14_17_19_06193)
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f203]) ).
fof(f206,plain,
( spl4_1
| spl4_4
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f201,f167,f203,f164]) ).
fof(f217,plain,
( cp(sK2(i2003_11_14_17_19_06193))
| ~ cUnsatisfiable(i2003_11_14_17_19_06193)
| ~ spl4_4 ),
inference(superposition,[],[f111,f205]) ).
fof(f218,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_06193)
| ~ spl4_4 ),
inference(forward_subsumption_resolution,[],[f217,f109]) ).
fof(f220,plain,
( $false
| ~ spl4_4 ),
inference(forward_subsumption_resolution,[],[f218,f124]) ).
fof(f221,plain,
~ spl4_4,
inference(avatar_contradiction_clause,[],[f220]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f170]) ).
cnf(s3,plain,
~ spl4_1,
inference(sat_conversion,[],[f188]) ).
cnf(s4,plain,
( spl4_1
| ~ spl4_2
| spl4_4 ),
inference(sat_conversion,[],[f206]) ).
cnf(s6,plain,
~ spl4_4,
inference(sat_conversion,[],[f221]) ).
cnf(s7,plain,
( spl4_1
| ~ spl4_2 ),
inference(rat,[],[s4,s6]) ).
cnf(s8,plain,
~ spl4_2,
inference(rat,[],[s7,s3]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s1,s8,s3]) ).
fof(f222,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS076+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n005.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 13:21:47 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.16/1.32 % (3986778)Detected formulas, will run a generic FOF schedule.
% 3.16/1.32 % (3986888)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3888967144:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.16/1.32 % (3986888)Refutation not found, incomplete strategy
% 3.16/1.32 % (3986888)------------------------------
% 3.16/1.32 % (3986888)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.16/1.32 % (3986888)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.16/1.32 % (3986888)CaDiCaL version: 2.1.3
% 3.16/1.32 % (3986888)Termination reason: Refutation not found, incomplete strategy
% 3.16/1.32 % (3986888)Time elapsed: 0.0000 s
% 3.16/1.32 % (3986888)Peak memory usage: 86 MB
% 3.16/1.32 % (3986885)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2528991740:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.16/1.32 % (3986887)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3197269824:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.16/1.32 % (3986884)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3545901989:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.16/1.32 % (3986886)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2215402938:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.16/1.32 % (3986890)dis-21_1_sil=8000:lcm=predicate:random_seed=947146405:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.16/1.32 % (3986887)Refutation not found, incomplete strategy
% 3.16/1.32 % (3986887)------------------------------
% 3.16/1.32 % (3986887)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.16/1.32 % (3986887)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.16/1.32 % (3986887)CaDiCaL version: 2.1.3
% 3.16/1.32 % (3986887)Termination reason: Refutation not found, incomplete strategy
% 3.16/1.32 % (3986887)Time elapsed: 0.0000 s
% 3.16/1.32 % (3986887)Peak memory usage: 86 MB
% 3.16/1.32 % (3986889)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2146128199:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.16/1.32 % (3986889)First to succeed.
% 3.16/1.32 % (3986889)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3986778"
% 3.16/1.32 % (3986890)Instruction limit reached!
% 3.16/1.32 % (3986890)------------------------------
% 3.16/1.32 % (3986890)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.16/1.32 % (3986890)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.16/1.32 % (3986890)CaDiCaL version: 2.1.3
% 3.16/1.32 % (3986890)Termination reason: Instruction limit
% 3.16/1.32 % (3986890)Termination phase: Saturation
% 3.16/1.32 % (3986890)Time elapsed: 0.068 s
% 3.16/1.32 % (3986890)Peak memory usage: 88 MB
% 3.16/1.32 % (3986890)Instructions burned: 131 (million)
% 3.16/1.32 % (3986888)------------------------------
% 3.16/1.32 % (3986888)------------------------------
% 3.16/1.32 % (3986920)lrs+10_1_sil=8000:sp=occurrence:random_seed=3290317725:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.16/1.32 % (3986920)Refutation not found, incomplete strategy
% 3.16/1.32 % (3986920)------------------------------
% 3.16/1.32 % (3986920)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.16/1.32 % (3986920)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.16/1.32 % (3986920)CaDiCaL version: 2.1.3
% 3.16/1.32 % (3986920)Termination reason: Refutation not found, incomplete strategy
% 3.16/1.32 % (3986920)Time elapsed: 0.001 s
% 3.16/1.32 % (3986920)Peak memory usage: 86 MB
% 3.16/1.32 % (3986921)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4062343626:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.16/1.32 % (3986921)Refutation not found, incomplete strategy
% 3.16/1.32 % (3986921)------------------------------
% 3.16/1.32 % (3986921)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.16/1.32 % (3986921)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.16/1.32 % (3986921)CaDiCaL version: 2.1.3
% 3.82/1.51 % (3986921)Termination reason: Refutation not found, incomplete strategy
% 3.82/1.51 % (3986921)Time elapsed: 0.0000 s
% 3.82/1.51 % (3986921)Peak memory usage: 87 MB
% 3.82/1.51 % (3986887)------------------------------
% 3.82/1.51 % (3986887)------------------------------
% 3.82/1.51 % (3986889)Refutation found. Thanks to Tanya!
% 3.82/1.51 % SZS status Unsatisfiable for theBenchmark
% 3.82/1.51 % SZS output start Proof for theBenchmark
% See solution above
% 3.82/1.51 % (3986889)------------------------------
% 3.82/1.51 % (3986889)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.82/1.51 % (3986889)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.82/1.51 % (3986889)CaDiCaL version: 2.1.3
% 3.82/1.51 % (3986889)Termination reason: Refutation
% 3.82/1.51 % (3986889)Time elapsed: 0.008 s
% 3.82/1.51 % (3986889)Peak memory usage: 90 MB
% 3.82/1.51 % (3986889)Instructions burned: 6 (million)
% 3.82/1.51 % (3986889)------------------------------
% 3.82/1.51 % (3986889)------------------------------
% 3.82/1.51 % (3986778)Success in time 0.452 s
% 3.82/1.51 % Vampire exiting
%------------------------------------------------------------------------------