%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC029+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 : n003.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:21 PM UTC 2026
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of formulae : 106 ( 22 unt; 9 def)
% Number of atoms : 321 ( 85 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 332 ( 117 ~; 145 |; 36 &)
% ( 15 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 10 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn 42 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
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(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax39) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) != X2 ) ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( nil != X0
| nil = X1 ) ) ) ) ) ) ),
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
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) != X2 ) ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( nil != X0
| nil = X1 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f100,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = X3
& app(X5,cons(X4,nil)) = X2
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( nil = X0
& nil != X1 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = X3
& app(X5,cons(X4,nil)) = X2
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( nil = X0
& nil != X1 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f234,plain,
! [X0,X1] :
( ~ ssList(X0)
| cons(X1,nil) != X0
| ~ ssItem(X1)
| singletonP(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f303,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f305,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f337,plain,
~ singletonP(nil),
inference(cnf_transformation,[],[f39]) ).
fof(f395,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| nil = X1
| nil != app(X0,X1) ),
inference(cnf_transformation,[],[f200]) ).
fof(f411,plain,
( ~ neq(sK50,nil)
| ssList(sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( ~ neq(sK50,nil)
| sK49 = app(sK52,cons(sK51,nil)) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( nil = sK47
| nil = sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( nil != sK48
| nil != sK47 ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
( nil != sK50
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
ssList(sK48),
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
ssList(sK50),
inference(definition_unfolding,[],[f422,f420]) ).
fof(f426,plain,
( nil != sK50
| nil != sK49 ),
inference(definition_unfolding,[],[f416,f420,f419]) ).
fof(f427,plain,
( nil = sK49
| nil = sK50 ),
inference(definition_unfolding,[],[f415,f419,f420]) ).
fof(f430,plain,
! [X1] :
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(equality_resolution,[],[f234]) ).
fof(f461,plain,
! [X1] :
( singletonP(cons(X1,nil))
| ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(consistent_polarity_flipping,[],[f430]) ).
fof(f533,plain,
! [X0,X1] :
( neq(X0,X1)
| ssList(X1)
| X0 = X1
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f303]) ).
fof(f534,plain,
! [X0,X1] :
( ~ ssList(cons(X1,X0))
| ssItem(X1)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f305]) ).
fof(f535,plain,
~ ssList(nil),
inference(consistent_polarity_flipping,[],[f306]) ).
fof(f619,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ssList(X1)
| nil = X1
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f395]) ).
fof(f636,plain,
~ ssList(sK50),
inference(consistent_polarity_flipping,[],[f425]) ).
fof(f639,plain,
( ~ neq(sK50,nil)
| ~ ssItem(sK51) ),
inference(consistent_polarity_flipping,[],[f414]) ).
fof(f640,plain,
( ~ neq(sK50,nil)
| ~ ssList(sK52) ),
inference(consistent_polarity_flipping,[],[f411]) ).
fof(f649,definition,
( spl53_1
<=> ssList(sK52) ),
introduced(definition,[new_symbols(definition,[spl53_1])],[avatar_definition]) ).
fof(f651,plain,
( ~ ssList(sK52)
| spl53_1 ),
inference(avatar_component_clause,[],[f649]) ).
fof(f653,definition,
( spl53_2
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl53_2])],[avatar_definition]) ).
fof(f655,plain,
( ~ neq(sK50,nil)
| spl53_2 ),
inference(avatar_component_clause,[],[f653]) ).
fof(f656,plain,
( ~ spl53_1
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f640,f653,f649]) ).
fof(f658,definition,
( spl53_3
<=> sK49 = app(sK52,cons(sK51,nil)) ),
introduced(definition,[new_symbols(definition,[spl53_3])],[avatar_definition]) ).
fof(f660,plain,
( sK49 = app(sK52,cons(sK51,nil))
| ~ spl53_3 ),
inference(avatar_component_clause,[],[f658]) ).
fof(f661,plain,
( spl53_3
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f412,f653,f658]) ).
fof(f668,definition,
( spl53_5
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl53_5])],[avatar_definition]) ).
fof(f670,plain,
( ~ ssItem(sK51)
| spl53_5 ),
inference(avatar_component_clause,[],[f668]) ).
fof(f671,plain,
( ~ spl53_5
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f639,f653,f668]) ).
fof(f673,definition,
( spl53_6
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl53_6])],[avatar_definition]) ).
fof(f674,plain,
( nil != sK50
| spl53_6 ),
inference(avatar_component_clause,[],[f673]) ).
fof(f677,definition,
( spl53_7
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl53_7])],[avatar_definition]) ).
fof(f679,plain,
( nil = sK49
| ~ spl53_7 ),
inference(avatar_component_clause,[],[f677]) ).
fof(f680,plain,
( spl53_6
| spl53_7 ),
inference(avatar_split_clause,[],[f427,f677,f673]) ).
fof(f681,plain,
( ~ spl53_7
| ~ spl53_6 ),
inference(avatar_split_clause,[],[f426,f673,f677]) ).
fof(f682,plain,
( spl53_7
| ~ spl53_6 ),
inference(avatar_split_clause,[],[f417,f673,f677]) ).
fof(f688,definition,
( spl53_9
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl53_9])],[avatar_definition]) ).
fof(f689,plain,
( ~ ssList(nil)
| spl53_9 ),
inference(avatar_component_clause,[],[f688]) ).
fof(f717,plain,
~ spl53_9,
inference(avatar_split_clause,[],[f535,f688]) ).
fof(f812,plain,
( nil = app(sK52,cons(sK51,nil))
| ~ spl53_3
| ~ spl53_7 ),
inference(forward_demodulation,[],[f660,f679]) ).
fof(f968,plain,
( ssList(nil)
| nil = sK50
| ssList(sK50)
| spl53_2 ),
inference(resolution,[],[f655,f533]) ).
fof(f971,plain,
( nil = sK50
| ssList(sK50)
| spl53_2
| spl53_9 ),
inference(forward_subsumption_resolution,[],[f968,f689]) ).
fof(f973,plain,
( ssList(sK50)
| spl53_2
| spl53_6
| spl53_9 ),
inference(forward_subsumption_resolution,[],[f971,f674]) ).
fof(f974,plain,
( $false
| spl53_2
| spl53_6
| spl53_9 ),
inference(forward_subsumption_resolution,[],[f973,f636]) ).
fof(f975,plain,
( spl53_2
| spl53_6
| spl53_9 ),
inference(avatar_contradiction_clause,[],[f974]) ).
fof(f1137,plain,
( nil != nil
| ssList(cons(sK51,nil))
| nil = cons(sK51,nil)
| ssList(sK52)
| ~ spl53_3
| ~ spl53_7 ),
inference(superposition,[],[f619,f812]) ).
fof(f1138,plain,
( ssList(cons(sK51,nil))
| nil = cons(sK51,nil)
| ssList(sK52)
| ~ spl53_3
| ~ spl53_7 ),
inference(trivial_inequality_removal,[],[f1137]) ).
fof(f1139,plain,
( ssList(cons(sK51,nil))
| nil = cons(sK51,nil)
| spl53_1
| ~ spl53_3
| ~ spl53_7 ),
inference(forward_subsumption_resolution,[],[f1138,f651]) ).
fof(f1141,definition,
( spl53_22
<=> nil = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl53_22])],[avatar_definition]) ).
fof(f1143,plain,
( nil = cons(sK51,nil)
| ~ spl53_22 ),
inference(avatar_component_clause,[],[f1141]) ).
fof(f1145,definition,
( spl53_23
<=> ssList(cons(sK51,nil)) ),
introduced(definition,[new_symbols(definition,[spl53_23])],[avatar_definition]) ).
fof(f1147,plain,
( ssList(cons(sK51,nil))
| ~ spl53_23 ),
inference(avatar_component_clause,[],[f1145]) ).
fof(f1148,plain,
( spl53_22
| spl53_23
| spl53_1
| ~ spl53_3
| ~ spl53_7 ),
inference(avatar_split_clause,[],[f1139,f677,f658,f649,f1145,f1141]) ).
fof(f1165,plain,
( singletonP(nil)
| ssItem(sK51)
| ssList(nil)
| ~ spl53_22 ),
inference(superposition,[],[f461,f1143]) ).
fof(f1182,plain,
( ssItem(sK51)
| ssList(nil)
| ~ spl53_22 ),
inference(forward_subsumption_resolution,[],[f1165,f337]) ).
fof(f1190,plain,
( ssList(nil)
| spl53_5
| ~ spl53_22 ),
inference(forward_subsumption_resolution,[],[f1182,f670]) ).
fof(f1194,plain,
( $false
| spl53_5
| spl53_9
| ~ spl53_22 ),
inference(forward_subsumption_resolution,[],[f1190,f689]) ).
fof(f1195,plain,
( spl53_5
| spl53_9
| ~ spl53_22 ),
inference(avatar_contradiction_clause,[],[f1194]) ).
fof(f1198,plain,
( ssItem(sK51)
| ssList(nil)
| ~ spl53_23 ),
inference(resolution,[],[f1147,f534]) ).
fof(f1199,plain,
( ssList(nil)
| spl53_5
| ~ spl53_23 ),
inference(forward_subsumption_resolution,[],[f1198,f670]) ).
fof(f1200,plain,
( $false
| spl53_5
| spl53_9
| ~ spl53_23 ),
inference(forward_subsumption_resolution,[],[f1199,f689]) ).
fof(f1201,plain,
( spl53_5
| spl53_9
| ~ spl53_23 ),
inference(avatar_contradiction_clause,[],[f1200]) ).
cnf(s1,plain,
( ~ spl53_1
| ~ spl53_2 ),
inference(sat_conversion,[],[f656]) ).
cnf(s2,plain,
( ~ spl53_2
| spl53_3 ),
inference(sat_conversion,[],[f661]) ).
cnf(s4,plain,
( ~ spl53_2
| ~ spl53_5 ),
inference(sat_conversion,[],[f671]) ).
cnf(s5,plain,
( spl53_6
| spl53_7 ),
inference(sat_conversion,[],[f680]) ).
cnf(s6,plain,
( ~ spl53_6
| ~ spl53_7 ),
inference(sat_conversion,[],[f681]) ).
cnf(s7,plain,
( ~ spl53_6
| spl53_7 ),
inference(sat_conversion,[],[f682]) ).
cnf(s16,plain,
~ spl53_9,
inference(sat_conversion,[],[f717]) ).
cnf(s23,plain,
( spl53_2
| spl53_6
| spl53_9 ),
inference(sat_conversion,[],[f975]) ).
cnf(s29,plain,
( spl53_1
| ~ spl53_3
| ~ spl53_7
| spl53_22
| spl53_23 ),
inference(sat_conversion,[],[f1148]) ).
cnf(s33,plain,
( spl53_5
| spl53_9
| ~ spl53_22 ),
inference(sat_conversion,[],[f1195]) ).
cnf(s35,plain,
( spl53_5
| spl53_9
| ~ spl53_23 ),
inference(sat_conversion,[],[f1201]) ).
cnf(s40,plain,
~ spl53_6,
inference(rat,[],[s6,s7]) ).
cnf(s41,plain,
spl53_2,
inference(rat,[],[s23,s16,s40]) ).
cnf(s42,plain,
spl53_7,
inference(rat,[],[s5,s40]) ).
cnf(s43,plain,
~ spl53_5,
inference(rat,[],[s4,s41]) ).
cnf(s45,plain,
spl53_3,
inference(rat,[],[s2,s41]) ).
cnf(s46,plain,
~ spl53_23,
inference(rat,[],[s35,s16,s43]) ).
cnf(s47,plain,
~ spl53_22,
inference(rat,[],[s33,s16,s43]) ).
cnf(s48,plain,
spl53_1,
inference(rat,[],[s29,s46,s42,s45,s47]) ).
cnf(s49,plain,
$false,
inference(rat,[],[s1,s41,s48]) ).
fof(f1202,plain,
$false,
inference(avatar_sat_refutation,[],[s49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC029+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.14/0.40 % Computer : n003.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Mon Sep 28 07:32:57 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.43 Running first-order model finding
% 0.14/0.43 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.19/0.50 % (1409026)Will run a generic schedule for satisfiability detection.
% 0.19/0.50 % (1409041)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2859384791:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.50 % (1409036)% WARNING: option uhcvi not known.
% 0.19/0.50 % (1409035)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2054994341_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.50 % (1409038)dis+10_1_sil=32000:sp=arity:random_seed=4280855399:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.50 % (1409036)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=715294087:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.50 % (1409039)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1886627820:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.50 % (1409037)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4227416781:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.50 % (1409040)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=66663894:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.50 % TRYING [1]
% 0.19/0.50 % TRYING [2]
% 0.19/0.50 % (1409036) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1409026-1409036"...
% 0.19/0.50 % TRYING [3]
% 0.19/0.50 % (1409039) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1409026-1409039"...
% 0.19/0.50 % (1409036)...printing done.
% 0.19/0.50 % (1409036)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (1409036)------------------------------
% 0.19/0.50 % (1409036)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.50 % (1409036)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.50 % (1409036)CaDiCaL version: 2.1.3
% 0.19/0.50 % (1409036)Termination reason: Refutation
% 0.19/0.50 % (1409036)Time elapsed: 0.021 s
% 0.19/0.50 % (1409036)Peak memory usage: 13 MB
% 0.19/0.50 % (1409036)Instructions burned: 33 (million)
% 0.19/0.50 % (1409026)Success in time 0.066 s
% 0.19/0.50 % Vampire exiting
%------------------------------------------------------------------------------