%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : KRS077+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 : n012.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:36 AM UTC 2026
% Result : Unsatisfiable 0.42s 0.84s
% Output : Refutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 56 ( 7 unt; 3 def)
% Number of atoms : 243 ( 22 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 308 ( 121 ~; 108 |; 65 &)
% ( 9 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 108 ( 0 sgn 83 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( ( rr(X0,X1)
& rr(X0,X2) )
=> X1 = X2 )
& ? [X3] :
( rr(X0,X3)
& ! [X4] :
( rinvS(X3,X4)
=> cp(X4) ) )
& ~ cp(X0)
& ? [X3] :
( rs(X0,X3)
& cp(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f16,axiom,
! [X0,X1] :
( rinvS(X0,X1)
<=> rs(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f17,axiom,
cUnsatisfiable(i2003_11_14_17_19_09372),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f18,axiom,
! [X0,X1] :
( rs(X0,X1)
=> rr(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f19,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( ( rr(X0,X1)
& rr(X0,X2) )
=> X1 = X2 )
& ? [X3] :
( rr(X0,X3)
& ! [X4] :
( rinvS(X3,X4)
=> cp(X4) ) )
& ~ cp(X0)
& ? [X5] :
( rs(X0,X5)
& cp(X5) ) ) ),
inference(rectify,[],[f15]) ).
fof(f44,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X1)
| ~ rr(X0,X2) )
& ? [X3] :
( rr(X0,X3)
& ! [X4] :
( cp(X4)
| ~ rinvS(X3,X4) ) )
& ~ cp(X0)
& ? [X5] :
( rs(X0,X5)
& cp(X5) ) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f45,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X1)
| ~ rr(X0,X2) )
& ? [X3] :
( rr(X0,X3)
& ! [X4] :
( cp(X4)
| ~ rinvS(X3,X4) ) )
& ~ cp(X0)
& ? [X5] :
( rs(X0,X5)
& cp(X5) ) ) ),
inference(flattening,[],[f44]) ).
fof(f46,plain,
! [X0,X1] :
( rr(X0,X1)
| ~ rs(X0,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f47,definition,
! [X0] :
( sP0(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X1)
| ~ rr(X0,X2) )
& ? [X3] :
( rr(X0,X3)
& ! [X4] :
( cp(X4)
| ~ rinvS(X3,X4) ) )
& ~ cp(X0)
& ? [X5] :
( rs(X0,X5)
& cp(X5) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f48,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> sP0(X0) ),
inference(definition_folding,[],[f45,f47]) ).
fof(f50,plain,
! [X0] :
( ( sP0(X0)
| ? [X1,X2] :
( X1 != X2
& rr(X0,X1)
& rr(X0,X2) )
| ! [X3] :
( ~ rr(X0,X3)
| ? [X4] :
( ~ cp(X4)
& rinvS(X3,X4) ) )
| cp(X0)
| ! [X5] :
( ~ rs(X0,X5)
| ~ cp(X5) ) )
& ( ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X1)
| ~ rr(X0,X2) )
& ? [X3] :
( rr(X0,X3)
& ! [X4] :
( cp(X4)
| ~ rinvS(X3,X4) ) )
& ~ cp(X0)
& ? [X5] :
( rs(X0,X5)
& cp(X5) ) )
| ~ sP0(X0) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f51,plain,
! [X0] :
( ( sP0(X0)
| ? [X1,X2] :
( X1 != X2
& rr(X0,X1)
& rr(X0,X2) )
| ! [X3] :
( ~ rr(X0,X3)
| ? [X4] :
( ~ cp(X4)
& rinvS(X3,X4) ) )
| cp(X0)
| ! [X5] :
( ~ rs(X0,X5)
| ~ cp(X5) ) )
& ( ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X1)
| ~ rr(X0,X2) )
& ? [X3] :
( rr(X0,X3)
& ! [X4] :
( cp(X4)
| ~ rinvS(X3,X4) ) )
& ~ cp(X0)
& ? [X5] :
( rs(X0,X5)
& cp(X5) ) )
| ~ sP0(X0) ) ),
inference(flattening,[],[f50]) ).
fof(f52,plain,
! [X0] :
( ( sP0(X0)
| ? [X1,X2] :
( X1 != X2
& rr(X0,X1)
& rr(X0,X2) )
| ! [X3] :
( ~ rr(X0,X3)
| ? [X4] :
( ~ cp(X4)
& rinvS(X3,X4) ) )
| cp(X0)
| ! [X5] :
( ~ rs(X0,X5)
| ~ cp(X5) ) )
& ( ( ! [X6,X7] :
( X6 = X7
| ~ rr(X0,X6)
| ~ rr(X0,X7) )
& ? [X8] :
( rr(X0,X8)
& ! [X9] :
( cp(X9)
| ~ rinvS(X8,X9) ) )
& ~ cp(X0)
& ? [X10] :
( rs(X0,X10)
& cp(X10) ) )
| ~ sP0(X0) ) ),
inference(rectify,[],[f51]) ).
fof(f53,plain,
! [X0] :
( ( sP0(X0)
| ( sK1(X0) != sK2(X0)
& rr(X0,sK1(X0))
& rr(X0,sK2(X0)) )
| ! [X3] :
( ~ rr(X0,X3)
| ( ~ cp(sK3(X3))
& rinvS(X3,sK3(X3)) ) )
| cp(X0)
| ! [X5] :
( ~ rs(X0,X5)
| ~ cp(X5) ) )
& ( ( ! [X6,X7] :
( X6 = X7
| ~ rr(X0,X6)
| ~ rr(X0,X7) )
& rr(X0,sK4(X0))
& ! [X9] :
( cp(X9)
| ~ rinvS(sK4(X0),X9) )
& ~ cp(X0)
& rs(X0,sK5(X0))
& cp(sK5(X0)) )
| ~ sP0(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5]),skolemize(X1,sK1(X0)),skolemize(X2,sK2(X0)),skolemize(X4,sK3(X3)),skolemize(X8,sK4(X0)),skolemize(X10,sK5(X0))],[f52]) ).
fof(f54,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ~ sP0(X0) )
& ( sP0(X0)
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f48]) ).
fof(f55,plain,
! [X0,X1] :
( ( rinvS(X0,X1)
| ~ rs(X1,X0) )
& ( rs(X1,X0)
| ~ rinvS(X0,X1) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f73,plain,
! [X0] :
( rs(X0,sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f74,plain,
! [X0] :
( ~ sP0(X0)
| ~ cp(X0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f75,plain,
! [X0,X9] :
( ~ sP0(X0)
| ~ rinvS(sK4(X0),X9)
| cp(X9) ),
inference(cnf_transformation,[],[f53]) ).
fof(f76,plain,
! [X0] :
( rr(X0,sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f77,plain,
! [X0,X6,X7] :
( ~ sP0(X0)
| ~ rr(X0,X6)
| ~ rr(X0,X7)
| X6 = X7 ),
inference(cnf_transformation,[],[f53]) ).
fof(f84,plain,
! [X0] :
( sP0(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f87,plain,
! [X0,X1] :
( rinvS(X0,X1)
| ~ rs(X1,X0) ),
inference(cnf_transformation,[],[f55]) ).
fof(f88,plain,
cUnsatisfiable(i2003_11_14_17_19_09372),
inference(cnf_transformation,[],[f17]) ).
fof(f89,plain,
! [X0,X1] :
( rr(X0,X1)
| ~ rs(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f102,plain,
! [X0] :
( ~ cp(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f84,f74]) ).
fof(f106,plain,
! [X0,X1] :
( cp(X1)
| ~ rinvS(sK4(X0),X1)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f75,f84]) ).
fof(f107,plain,
! [X0,X1] :
( ~ rinvS(sK4(X0),X1)
| ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X1) ),
inference(resolution,[],[f106,f102]) ).
fof(f108,plain,
! [X2,X0,X1] :
( ~ cUnsatisfiable(X0)
| ~ rr(X0,X2)
| X1 = X2
| ~ rr(X0,X1) ),
inference(resolution,[],[f77,f84]) ).
fof(f109,plain,
! [X0,X1] :
( ~ rs(X1,sK4(X0))
| ~ cUnsatisfiable(X1)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f107,f87]) ).
fof(f111,plain,
! [X0,X1] :
( ~ rr(i2003_11_14_17_19_09372,X0)
| X0 = X1
| ~ rr(i2003_11_14_17_19_09372,X1) ),
inference(resolution,[],[f108,f88]) ).
fof(f117,plain,
! [X0] :
( sK4(i2003_11_14_17_19_09372) = X0
| ~ rr(i2003_11_14_17_19_09372,X0)
| ~ sP0(i2003_11_14_17_19_09372) ),
inference(resolution,[],[f111,f76]) ).
fof(f120,definition,
( spl6_1
<=> sP0(i2003_11_14_17_19_09372) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f121,plain,
( sP0(i2003_11_14_17_19_09372)
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f120]) ).
fof(f122,plain,
( ~ sP0(i2003_11_14_17_19_09372)
| spl6_1 ),
inference(avatar_component_clause,[],[f120]) ).
fof(f124,definition,
( spl6_2
<=> ! [X0] :
( sK4(i2003_11_14_17_19_09372) = X0
| ~ rr(i2003_11_14_17_19_09372,X0) ) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f125,plain,
( ! [X0] :
( ~ rr(i2003_11_14_17_19_09372,X0)
| sK4(i2003_11_14_17_19_09372) = X0 )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f124]) ).
fof(f126,plain,
( ~ spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f117,f124,f120]) ).
fof(f151,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_09372)
| spl6_1 ),
inference(resolution,[],[f122,f84]) ).
fof(f152,plain,
( $false
| spl6_1 ),
inference(forward_subsumption_resolution,[],[f151,f88]) ).
fof(f153,plain,
spl6_1,
inference(avatar_contradiction_clause,[],[f152]) ).
fof(f165,plain,
( ! [X0] :
( ~ rs(i2003_11_14_17_19_09372,X0)
| sK4(i2003_11_14_17_19_09372) = X0 )
| ~ spl6_2 ),
inference(resolution,[],[f125,f89]) ).
fof(f176,plain,
( sK4(i2003_11_14_17_19_09372) = sK5(i2003_11_14_17_19_09372)
| ~ sP0(i2003_11_14_17_19_09372)
| ~ spl6_2 ),
inference(resolution,[],[f165,f73]) ).
fof(f178,plain,
( sK4(i2003_11_14_17_19_09372) = sK5(i2003_11_14_17_19_09372)
| ~ spl6_1
| ~ spl6_2 ),
inference(forward_subsumption_resolution,[],[f176,f121]) ).
fof(f180,plain,
( rs(i2003_11_14_17_19_09372,sK4(i2003_11_14_17_19_09372))
| ~ sP0(i2003_11_14_17_19_09372)
| ~ spl6_1
| ~ spl6_2 ),
inference(superposition,[],[f73,f178]) ).
fof(f185,plain,
( rs(i2003_11_14_17_19_09372,sK4(i2003_11_14_17_19_09372))
| ~ spl6_1
| ~ spl6_2 ),
inference(forward_subsumption_resolution,[],[f180,f121]) ).
fof(f198,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_09372)
| ~ cUnsatisfiable(i2003_11_14_17_19_09372)
| ~ spl6_1
| ~ spl6_2 ),
inference(resolution,[],[f185,f109]) ).
fof(f199,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_09372)
| ~ spl6_1
| ~ spl6_2 ),
inference(duplicate_literal_removal,[],[f198]) ).
fof(f200,plain,
( $false
| ~ spl6_1
| ~ spl6_2 ),
inference(forward_subsumption_resolution,[],[f199,f88]) ).
fof(f201,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_contradiction_clause,[],[f200]) ).
cnf(s1,plain,
( ~ spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f126]) ).
cnf(s6,plain,
spl6_1,
inference(sat_conversion,[],[f153]) ).
cnf(s9,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(sat_conversion,[],[f201]) ).
cnf(s12,plain,
~ spl6_2,
inference(rat,[],[s9,s6]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s1,s12,s6]) ).
fof(f206,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : KRS077+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.31 % Computer : n012.cluster.edu
% 0.04/0.31 % Model : x86_64 x86_64
% 0.04/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31 % Memory : 8046.5625MB
% 0.04/0.31 % OS : Linux 6.8.0-71-generic
% 0.04/0.31 % CPULimit : 300
% 0.04/0.31 % WCLimit : 300
% 0.04/0.31 % DateTime : Sun Sep 27 13:21:34 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.33 Running first-order theorem proving
% 0.08/0.33 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
% 0.42/0.84 % (2387953)Detected formulas, will run a generic FOF schedule.
% 0.42/0.84 % (2387960)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=1670796006:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.42/0.84 % (2387963)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2020696749:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.42/0.84 % (2387958)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=572686309:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.42/0.84 % (2387962)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3296900656:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.42/0.84 % (2387964)dis-21_1_sil=8000:lcm=predicate:random_seed=3157426025: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)
% 0.42/0.84 % (2387959)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=2339527666:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.42/0.84 % (2387961)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2796995025:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.42/0.84 % (2387962)Refutation not found, incomplete strategy
% 0.42/0.84 % (2387962)------------------------------
% 0.42/0.84 % (2387962)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.42/0.84 % (2387962)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.42/0.84 % (2387961)Refutation not found, incomplete strategy
% 0.42/0.84 % (2387961)------------------------------
% 0.42/0.84 % (2387961)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.42/0.84 % (2387962)CaDiCaL version: 2.1.3
% 0.42/0.84 % (2387961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.42/0.84 % (2387962)Termination reason: Refutation not found, incomplete strategy
% 0.42/0.84 % (2387962)Time elapsed: 0.0000 s
% 0.42/0.84 % (2387962)Peak memory usage: 86 MB
% 0.42/0.84 % (2387961)CaDiCaL version: 2.1.3
% 0.42/0.84 % (2387961)Termination reason: Refutation not found, incomplete strategy
% 0.42/0.84 % (2387961)Time elapsed: 0.0000 s
% 0.42/0.84 % (2387961)Peak memory usage: 86 MB
% 0.42/0.84 % (2387963)First to succeed.
% 0.42/0.84 % (2387963)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2387953"
% 0.42/0.84 % (2387964)Instruction limit reached!
% 0.42/0.84 % (2387964)------------------------------
% 0.42/0.84 % (2387964)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.42/0.84 % (2387964)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.42/0.84 % (2387964)CaDiCaL version: 2.1.3
% 0.42/0.84 % (2387964)Termination reason: Instruction limit
% 0.42/0.84 % (2387964)Termination phase: Saturation
% 0.42/0.84 % (2387964)Time elapsed: 0.026 s
% 0.42/0.84 % (2387964)Peak memory usage: 88 MB
% 0.42/0.84 % (2387964)Instructions burned: 132 (million)
% 0.42/0.84 % (2387961)------------------------------
% 0.42/0.84 % (2387961)------------------------------
% 0.42/0.84 % (2387962)------------------------------
% 0.42/0.84 % (2387962)------------------------------
% 0.42/0.84 % (2387972)lrs+10_1_sil=8000:sp=occurrence:random_seed=2175018287:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 0.42/0.84 % (2387972)Refutation not found, incomplete strategy
% 0.42/0.84 % (2387972)------------------------------
% 0.42/0.84 % (2387972)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.42/0.84 % (2387972)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.42/0.84 % (2387972)CaDiCaL version: 2.1.3
% 0.42/0.84 % (2387972)Termination reason: Refutation not found, incomplete strategy
% 0.42/0.84 % (2387972)Time elapsed: 0.0000 s
% 0.42/0.84 % (2387972)Peak memory usage: 86 MB
% 0.42/0.84 % (2387963)Refutation found. Thanks to Tanya!
% 0.42/0.84 % SZS status Unsatisfiable for theBenchmark
% 0.42/0.84 % SZS output start Proof for theBenchmark
% See solution above
% 2.39/0.94 % (2387963)------------------------------
% 2.39/0.94 % (2387963)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.39/0.94 % (2387963)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.39/0.94 % (2387963)CaDiCaL version: 2.1.3
% 2.39/0.94 % (2387963)Termination reason: Refutation
% 2.39/0.94 % (2387963)Time elapsed: 0.003 s
% 2.39/0.94 % (2387963)Peak memory usage: 90 MB
% 2.39/0.94 % (2387963)Instructions burned: 6 (million)
% 2.39/0.94 % (2387963)------------------------------
% 2.39/0.94 % (2387963)------------------------------
% 2.39/0.94 % (2387953)Success in time 0.306 s
% 2.39/0.94 % Vampire exiting
%------------------------------------------------------------------------------