%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET103+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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 12:43:08 PM UTC 2026
% Result : Theorem 1.63s 0.75s
% Output : Refutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 59 ( 26 unt; 8 def)
% Number of atoms : 115 ( 56 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 94 ( 38 ~; 37 |; 15 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 31 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(f7,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',ordered_pair_defn) ).
fof(f41,axiom,
! [X0] :
( X0 != null_class
=> ? [X1] :
( member(X1,universal_class)
& member(X1,X0)
& disjoint(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',regularity) ).
fof(f44,conjecture,
! [X0,X1] :
( unordered_pair(singleton(X0),unordered_pair(X0,null_class)) = ordered_pair(X0,X1)
| member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_1_of_ordered_pair) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] :
( unordered_pair(singleton(X0),unordered_pair(X0,null_class)) = ordered_pair(X0,X1)
| member(X1,universal_class) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f57,plain,
! [X0] :
( ? [X1] :
( member(X1,universal_class)
& member(X1,X0)
& disjoint(X1,X0) )
| null_class = X0 ),
inference(ennf_transformation,[],[f41]) ).
fof(f60,plain,
? [X0,X1] :
( ordered_pair(X0,X1) != unordered_pair(singleton(X0),unordered_pair(X0,null_class))
& ~ member(X1,universal_class) ),
inference(ennf_transformation,[],[f45]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| ( X0 != X1
& X0 != X2 ) )
& ( ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| ( X0 != X1
& X0 != X2 ) )
& ( ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f66]) ).
fof(f101,plain,
! [X0] :
( ( member(sK4(X0),universal_class)
& member(sK4(X0),X0)
& disjoint(sK4(X0),X0) )
| null_class = X0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X1,sK4(X0))],[f57]) ).
fof(f103,plain,
( ordered_pair(sK6,sK7) != unordered_pair(singleton(sK6),unordered_pair(sK6,null_class))
& ~ member(sK7,universal_class) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f60]) ).
fof(f111,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f67]) ).
fof(f116,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f117,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
inference(cnf_transformation,[],[f7]) ).
fof(f186,plain,
! [X0] :
( member(sK4(X0),X0)
| null_class = X0 ),
inference(cnf_transformation,[],[f101]) ).
fof(f187,plain,
! [X0] :
( member(sK4(X0),universal_class)
| null_class = X0 ),
inference(cnf_transformation,[],[f101]) ).
fof(f191,plain,
~ member(sK7,universal_class),
inference(cnf_transformation,[],[f103]) ).
fof(f192,plain,
ordered_pair(sK6,sK7) != unordered_pair(singleton(sK6),unordered_pair(sK6,null_class)),
inference(cnf_transformation,[],[f103]) ).
fof(f193,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f117,f116,f116]) ).
fof(f230,plain,
unordered_pair(unordered_pair(sK6,sK6),unordered_pair(sK6,unordered_pair(sK7,sK7))) != unordered_pair(unordered_pair(sK6,sK6),unordered_pair(sK6,null_class)),
inference(definition_unfolding,[],[f192,f193,f116]) ).
fof(f237,definition,
sF8 = unordered_pair(sK6,sK6),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f238,plain,
unordered_pair(sK6,sK6) = sF8,
inference(reorient_equations,[],[f237]) ).
fof(f239,definition,
sF9 = unordered_pair(sK7,sK7),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f240,plain,
unordered_pair(sK7,sK7) = sF9,
inference(reorient_equations,[],[f239]) ).
fof(f241,definition,
sF10 = unordered_pair(sK6,sF9),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f242,plain,
unordered_pair(sK6,sF9) = sF10,
inference(reorient_equations,[],[f241]) ).
fof(f243,definition,
sF11 = unordered_pair(sF8,sF10),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f244,plain,
unordered_pair(sF8,sF10) = sF11,
inference(reorient_equations,[],[f243]) ).
fof(f245,definition,
sF12 = unordered_pair(sK6,null_class),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
fof(f246,plain,
unordered_pair(sK6,null_class) = sF12,
inference(reorient_equations,[],[f245]) ).
fof(f247,definition,
sF13 = unordered_pair(sF8,sF12),
introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).
fof(f248,plain,
unordered_pair(sF8,sF12) = sF13,
inference(reorient_equations,[],[f247]) ).
fof(f249,plain,
sF11 != sF13,
inference(definition_folding,[],[f230,f248,f246,f238,f244,f242,f240,f238]) ).
fof(f535,plain,
! [X0] :
( ~ member(X0,sF9)
| sK7 = X0
| sK7 = X0 ),
inference(superposition,[],[f111,f240]) ).
fof(f538,plain,
! [X0] :
( ~ member(X0,sF9)
| sK7 = X0 ),
inference(duplicate_literal_removal,[],[f535]) ).
fof(f897,definition,
( spl14_34
<=> null_class = sF9 ),
introduced(definition,[new_symbols(definition,[spl14_34])],[avatar_definition]) ).
fof(f898,plain,
( null_class != sF9
| spl14_34 ),
inference(avatar_component_clause,[],[f897]) ).
fof(f899,plain,
( null_class = sF9
| ~ spl14_34 ),
inference(avatar_component_clause,[],[f897]) ).
fof(f1042,plain,
( sK7 = sK4(sF9)
| null_class = sF9 ),
inference(resolution,[],[f538,f186]) ).
fof(f1045,definition,
( spl14_47
<=> sK7 = sK4(sF9) ),
introduced(definition,[new_symbols(definition,[spl14_47])],[avatar_definition]) ).
fof(f1047,plain,
( sK7 = sK4(sF9)
| ~ spl14_47 ),
inference(avatar_component_clause,[],[f1045]) ).
fof(f1048,plain,
( spl14_34
| spl14_47 ),
inference(avatar_split_clause,[],[f1042,f1045,f897]) ).
fof(f1057,plain,
( unordered_pair(sK6,sF9) = sF12
| ~ spl14_34 ),
inference(superposition,[],[f246,f899]) ).
fof(f1070,plain,
( sF10 = sF12
| ~ spl14_34 ),
inference(forward_demodulation,[],[f1057,f242]) ).
fof(f1113,plain,
( ~ member(sK4(sF9),universal_class)
| ~ spl14_47 ),
inference(superposition,[],[f191,f1047]) ).
fof(f1126,plain,
( null_class = sF9
| ~ spl14_47 ),
inference(resolution,[],[f1113,f187]) ).
fof(f1127,plain,
( $false
| spl14_34
| ~ spl14_47 ),
inference(forward_subsumption_resolution,[],[f1126,f898]) ).
fof(f1128,plain,
( spl14_34
| ~ spl14_47 ),
inference(avatar_contradiction_clause,[],[f1127]) ).
fof(f2163,plain,
( unordered_pair(sF8,sF10) = sF13
| ~ spl14_34 ),
inference(superposition,[],[f248,f1070]) ).
fof(f2171,plain,
( sF11 = sF13
| ~ spl14_34 ),
inference(forward_demodulation,[],[f2163,f244]) ).
fof(f2172,plain,
( $false
| ~ spl14_34 ),
inference(forward_subsumption_resolution,[],[f2171,f249]) ).
fof(f2173,plain,
~ spl14_34,
inference(avatar_contradiction_clause,[],[f2172]) ).
cnf(s36,plain,
( spl14_34
| spl14_47 ),
inference(sat_conversion,[],[f1048]) ).
cnf(s42,plain,
( spl14_34
| ~ spl14_47 ),
inference(sat_conversion,[],[f1128]) ).
cnf(s90,plain,
~ spl14_34,
inference(sat_conversion,[],[f2173]) ).
cnf(s91,plain,
~ spl14_47,
inference(rat,[],[s42,s90]) ).
cnf(s93,plain,
$false,
inference(rat,[],[s36,s91,s90]) ).
fof(f2174,plain,
$false,
inference(avatar_sat_refutation,[],[s93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET103+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n006.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 00:43:41 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 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
% 1.63/0.75 % (3486549)Will run a generic schedule for satisfiability detection.
% 1.63/0.75 % (3486557)dis+10_1_sil=32000:sp=arity:random_seed=3621153851:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.63/0.75 % (3486555)% WARNING: option uhcvi not known.
% 1.63/0.75 % (3486554)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3246100665_2999 on theBenchmark for (2999ds/0Mi)
% 1.63/0.75 % (3486558)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=828968045:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.63/0.75 % (3486555)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2956592928:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.63/0.75 % (3486556)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1943791687:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.63/0.75 % (3486559)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=401489471:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.63/0.75 % (3486560)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3236630307:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.63/0.75 % (3486557)Instruction limit reached!
% 1.63/0.75 % (3486557)------------------------------
% 1.63/0.75 % (3486557)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.63/0.75 % (3486557)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.63/0.75 % (3486557)CaDiCaL version: 2.1.3
% 1.63/0.75 % (3486557)Termination reason: Instruction limit
% 1.63/0.75 % (3486557)Termination phase: Saturation
% 1.63/0.75 % (3486557)Time elapsed: 0.036 s
% 1.63/0.75 % (3486557)Peak memory usage: 13 MB
% 1.63/0.75 % (3486557)Instructions burned: 105 (million)
% 1.63/0.75 % TRYING [1]
% 1.63/0.75 % TRYING [2]
% 1.63/0.75 % (3486568)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=459156193:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.63/0.75 % TRYING [3]
% 1.63/0.75 % TRYING [1]
% 1.63/0.75 % TRYING [2]
% 1.63/0.75 % TRYING [3]
% 1.63/0.75 % (3486558)Instruction limit reached!
% 1.63/0.75 % (3486558)------------------------------
% 1.63/0.75 % (3486558)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.63/0.75 % (3486558)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.63/0.75 % (3486558)CaDiCaL version: 2.1.3
% 1.63/0.75 % (3486558)Termination reason: Instruction limit
% 1.63/0.75 % (3486558)Termination phase: Saturation
% 1.63/0.75 % (3486558)Time elapsed: 0.069 s
% 1.63/0.75 % (3486558)Peak memory usage: 13 MB
% 1.63/0.75 % (3486558)Instructions burned: 116 (million)
% 1.63/0.75 % (3486559)Instruction limit reached!
% 1.63/0.75 % (3486559)------------------------------
% 1.63/0.75 % (3486559)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.63/0.75 % (3486559)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.63/0.75 % (3486559)CaDiCaL version: 2.1.3
% 1.63/0.75 % (3486559)Termination reason: Instruction limit
% 1.63/0.75 % (3486559)Termination phase: Saturation
% 1.63/0.75 % (3486559)Time elapsed: 0.074 s
% 1.63/0.75 % (3486559)Peak memory usage: 13 MB
% 1.63/0.75 % (3486559)Instructions burned: 131 (million)
% 1.63/0.75 % TRYING [4]
% 1.63/0.75 % (3486570)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=265745327:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.63/0.75 % TRYING [4]
% 1.63/0.75 % (3486571)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=1846911158:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.63/0.75 % (3486560)Instruction limit reached!
% 1.63/0.75 % (3486560)------------------------------
% 1.63/0.75 % (3486560)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.63/0.75 % (3486560)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.63/0.75 % (3486560)CaDiCaL version: 2.1.3
% 1.63/0.75 % (3486560)Termination reason: Instruction limit
% 1.63/0.75 % (3486560)Termination phase: Saturation
% 1.63/0.75 % (3486560)Time elapsed: 0.100 s
% 1.63/0.75 % (3486560)Peak memory usage: 13 MB
% 1.63/0.75 % (3486560)Instructions burned: 160 (million)
% 1.63/0.75 % (3486574)ott-21_1_sil=16000:fs=off:random_seed=4062593970:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.63/0.75 % (3486570)Instruction limit reached!
% 1.63/0.75 % (3486570)------------------------------
% 1.63/0.75 % (3486570)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.63/0.75 % (3486570)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.63/0.75 % (3486570)CaDiCaL version: 2.1.3
% 1.63/0.75 % (3486570)Termination reason: Instruction limit
% 1.63/0.75 % (3486570)Termination phase: Saturation
% 1.63/0.75 % (3486570)Time elapsed: 0.076 s
% 1.63/0.75 % (3486570)Peak memory usage: 13 MB
% 1.63/0.75 % (3486570)Instructions burned: 132 (million)
% 1.63/0.75 % TRYING [5]
% 1.63/0.75 % (3486576)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3386133975:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.63/0.75 % (3486568)Instruction limit reached!
% 1.63/0.75 % (3486568)------------------------------
% 1.63/0.75 % (3486568)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.63/0.75 % (3486568)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.63/0.75 % (3486568)CaDiCaL version: 2.1.3
% 1.63/0.75 % (3486568)Termination reason: Instruction limit
% 1.63/0.75 % (3486568)Termination phase: Finite model building constraint generation
% 1.63/0.75 % (3486568)Time elapsed: 0.156 s
% 1.63/0.75 % (3486568)Peak memory usage: 39 MB
% 1.63/0.75 % (3486568)Instructions burned: 720 (million)
% 1.63/0.75 % (3486578)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=338152709:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.63/0.75 % (3486574)Instruction limit reached!
% 1.63/0.75 % (3486574)------------------------------
% 1.63/0.75 % (3486574)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.63/0.75 % (3486574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.63/0.75 % (3486574)CaDiCaL version: 2.1.3
% 1.63/0.75 % (3486574)Termination reason: Instruction limit
% 1.63/0.75 % (3486574)Termination phase: Saturation
% 1.63/0.75 % (3486574)Time elapsed: 0.095 s
% 1.63/0.75 % (3486574)Peak memory usage: 13 MB
% 1.63/0.75 % (3486574)Instructions burned: 182 (million)
% 1.63/0.75 % TRYING [1]
% 1.63/0.75 % TRYING [2]
% 1.63/0.75 % (3486580)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1954715814:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.63/0.75 % TRYING [3]
% 1.63/0.75 % TRYING [5]
% 1.63/0.75 % (3486580) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3486549-3486580"...
% 1.63/0.75 % (3486580)...printing done.
% 1.63/0.75 % (3486580)Refutation found. Thanks to Tanya!
% 1.63/0.75 % SZS status Theorem for theBenchmark
% 1.63/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 1.63/0.75 % (3486580)------------------------------
% 1.63/0.75 % (3486580)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.63/0.75 % (3486580)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.63/0.75 % (3486580)CaDiCaL version: 2.1.3
% 1.63/0.75 % (3486580)Termination reason: Refutation
% 1.63/0.75 % (3486580)Time elapsed: 0.048 s
% 1.63/0.75 % (3486580)Peak memory usage: 13 MB
% 1.63/0.75 % (3486580)Instructions burned: 75 (million)
% 1.63/0.75 % (3486549)Success in time 0.326 s
% 1.63/0.75 % Vampire exiting
%------------------------------------------------------------------------------