%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW530_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:40:24 PM UTC 2026
% Result : Theorem 0.32s 0.41s
% Output : Refutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 53 ( 22 unt; 0 typ; 3 def)
% Number of atoms : 95 ( 19 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 78 ( 36 ~; 32 |; 0 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 6 ( 5 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 5 prp; 0-4 aty)
% Number of functors : 51 ( 51 usr; 5 con; 0-5 aty)
% Number of variables : 43 ( 0 sgn 43 !; 0 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
a: $tType ).
tff(type_def_6,type,
b: $tType ).
tff(type_def_7,type,
bool: $tType ).
tff(type_def_8,type,
huffma1450048681e_tree: $tType > $tType ).
tff(type_def_9,type,
int: $tType ).
tff(type_def_10,type,
list: $tType > $tType ).
tff(type_def_11,type,
nat: $tType ).
tff(type_def_12,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
huffma410068972_depth:
!>[X0: $tType] : ( ( huffma1450048681e_tree(X0) * X0 ) > nat ) ).
tff(func_def_2,type,
huffma945805758height:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > nat ) ).
tff(func_def_3,type,
huffma632063779ight_F:
!>[X0: $tType] : ( list(huffma1450048681e_tree(X0)) > nat ) ).
tff(func_def_4,type,
if:
!>[X0: $tType] : ( ( bool * X0 * X0 ) > X0 ) ).
tff(func_def_5,type,
nat1: int > nat ).
tff(func_def_6,type,
ring_1_of_int:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_7,type,
linorder_insort_key:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 * list(X0) ) > list(X0) ) ).
tff(func_def_8,type,
linorder_sort_key:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X0) ) ).
tff(func_def_9,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_10,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_11,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_12,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_13,type,
semiring_1_of_nat:
!>[X0: $tType] : ( nat > X0 ) ).
tff(func_def_14,type,
ord_max:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_15,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_16,type,
fFalse: bool ).
tff(func_def_17,type,
fTrue: bool ).
tff(func_def_18,type,
a1: a ).
tff(func_def_19,type,
t_1: huffma1450048681e_tree(b) ).
tff(func_def_20,type,
t_2: huffma1450048681e_tree(a) ).
tff(func_def_21,type,
sK0:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_22,type,
sK1:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_23,type,
sK2:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_24,type,
sK3:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_25,type,
sK4:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_26,type,
sK5:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_27,type,
sK6:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_28,type,
sK7:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_29,type,
sK8:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_30,type,
sK9:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_31,type,
sK10:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_32,type,
sK11:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_33,type,
sK12:
!>[X0: $tType] : ( fun(X0,fun(X0,X0)) > X0 ) ).
tff(func_def_34,type,
sK13:
!>[X0: $tType] : ( fun(X0,fun(X0,X0)) > X0 ) ).
tff(func_def_35,type,
sK14:
!>[X0: $tType] : ( fun(X0,fun(X0,X0)) > X0 ) ).
tff(func_def_36,type,
sK15:
!>[X0: $tType] : ( fun(X0,fun(X0,X0)) > X0 ) ).
tff(func_def_37,type,
sK16:
!>[X0: $tType] : ( fun(X0,fun(X0,X0)) > X0 ) ).
tff(func_def_38,type,
sK17:
!>[X0: $tType] : ( fun(X0,fun(X0,X0)) > X0 ) ).
tff(func_def_39,type,
sK18:
!>[X0: $tType] : ( fun(X0,fun(X0,X0)) > X0 ) ).
tff(func_def_40,type,
sK19: fun(int,bool) > int ).
tff(func_def_41,type,
sK20: fun(int,bool) > nat ).
tff(func_def_42,type,
sK21: fun(int,bool) > nat ).
tff(func_def_43,type,
sK22: fun(int,bool) > int ).
tff(func_def_44,type,
sK23: fun(nat,bool) > nat ).
tff(func_def_45,type,
sK24: fun(nat,bool) > int ).
tff(func_def_46,type,
sK25: fun(nat,bool) > int ).
tff(func_def_47,type,
sK26: fun(nat,bool) > nat ).
tff(pred_def_1,type,
ring_1:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
ord:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
order:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
linorder:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
preorder:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
semiring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
null:
!>[X0: $tType] : ( list(X0) > $o ) ).
tff(pred_def_12,type,
nat_tr1645093318rphism:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * fun(X0,bool) ) > $o ) ).
tff(pred_def_13,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_14,type,
order_strict_mono:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > $o ) ).
tff(pred_def_15,type,
pp: bool > $o ).
tff(f2,axiom,
! [X0: $tType,X1: X0,X2: huffma1450048681e_tree(X0)] : ord_less_eq(nat,huffma410068972_depth(X0,X2,X1),huffma945805758height(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_depth__le__height) ).
tff(f7,axiom,
! [X0: $tType] :
( linorder(X0)
=> ! [X1: X0,X2: X0] : ord_less_eq(X0,X2,ord_max(X0,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_6_le__maxI1) ).
tff(f8,axiom,
! [X0: $tType] :
( linorder(X0)
=> ! [X1: X0,X2: X0] : ord_less_eq(X0,X2,ord_max(X0,X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_7_le__maxI2) ).
tff(f31,axiom,
! [X0: $tType] :
( linorder(X0)
=> ! [X1: X0,X2: X0] : ( ord_max(X0,X2,X1) = ord_max(X0,X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_30_min__max_Osup__commute) ).
tff(f46,axiom,
! [X0: nat,X1: nat] :
( ord_less_eq(nat,X1,X0)
=> ( ord_less_eq(nat,X0,X1)
=> ( X1 = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_45_le__antisym) ).
tff(f117,axiom,
linorder(nat),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Nat_Onat___Orderings_Olinorder) ).
tff(f130,axiom,
huffma410068972_depth(a,t_2,a1) = ord_max(nat,huffma945805758height(b,t_1),huffma945805758height(a,t_2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f131,axiom,
( ( huffma410068972_depth(a,t_2,a1) = huffma945805758height(a,t_2) )
=> ( ord_less_eq(nat,huffma945805758height(b,t_1),huffma945805758height(a,t_2))
=> p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
tff(f132,conjecture,
p,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_2) ).
tff(f133,negated_conjecture,
~ p,
inference(negated_conjecture,[status(cth)],[f132]) ).
tff(f138,plain,
~ p,
inference(flattening,[],[f133]) ).
tff(f149,plain,
! [X0: $tType] :
( ! [X1: X0,X2: X0] : ord_less_eq(X0,X2,ord_max(X0,X2,X1))
| ~ linorder(X0) ),
inference(ennf_transformation,[],[f7]) ).
tff(f150,plain,
! [X0: $tType] :
( ! [X1: X0,X2: X0] : ord_less_eq(X0,X2,ord_max(X0,X1,X2))
| ~ linorder(X0) ),
inference(ennf_transformation,[],[f8]) ).
tff(f177,plain,
! [X0: $tType] :
( ! [X1: X0,X2: X0] : ( ord_max(X0,X2,X1) = ord_max(X0,X1,X2) )
| ~ linorder(X0) ),
inference(ennf_transformation,[],[f31]) ).
tff(f199,plain,
! [X0: nat,X1: nat] :
( ( X1 = X0 )
| ~ ord_less_eq(nat,X0,X1)
| ~ ord_less_eq(nat,X1,X0) ),
inference(ennf_transformation,[],[f46]) ).
tff(f200,plain,
! [X0: nat,X1: nat] :
( ( X1 = X0 )
| ~ ord_less_eq(nat,X0,X1)
| ~ ord_less_eq(nat,X1,X0) ),
inference(flattening,[],[f199]) ).
tff(f236,plain,
( p
| ~ ord_less_eq(nat,huffma945805758height(b,t_1),huffma945805758height(a,t_2))
| ( huffma410068972_depth(a,t_2,a1) != huffma945805758height(a,t_2) ) ),
inference(ennf_transformation,[],[f131]) ).
tff(f237,plain,
( p
| ~ ord_less_eq(nat,huffma945805758height(b,t_1),huffma945805758height(a,t_2))
| ( huffma410068972_depth(a,t_2,a1) != huffma945805758height(a,t_2) ) ),
inference(flattening,[],[f236]) ).
tff(f289,plain,
! [X0: $tType,X2: huffma1450048681e_tree(X0),X1: X0] : ord_less_eq(nat,huffma410068972_depth(X0,X2,X1),huffma945805758height(X0,X2)),
inference(cnf_transformation,[],[f2]) ).
tff(f296,plain,
! [X0: $tType,X2: X0,X1: X0] :
( ord_less_eq(X0,X2,ord_max(X0,X2,X1))
| ~ linorder(X0) ),
inference(cnf_transformation,[],[f149]) ).
tff(f297,plain,
! [X0: $tType,X2: X0,X1: X0] :
( ord_less_eq(X0,X2,ord_max(X0,X1,X2))
| ~ linorder(X0) ),
inference(cnf_transformation,[],[f150]) ).
tff(f327,plain,
! [X0: $tType,X2: X0,X1: X0] :
( ~ linorder(X0)
| ( ord_max(X0,X2,X1) = ord_max(X0,X1,X2) ) ),
inference(cnf_transformation,[],[f177]) ).
tff(f347,plain,
! [X0: nat,X1: nat] :
( ~ ord_less_eq(nat,X1,X0)
| ~ ord_less_eq(nat,X0,X1)
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f200]) ).
tff(f444,plain,
linorder(nat),
inference(cnf_transformation,[],[f117]) ).
tff(f457,plain,
huffma410068972_depth(a,t_2,a1) = ord_max(nat,huffma945805758height(b,t_1),huffma945805758height(a,t_2)),
inference(cnf_transformation,[],[f130]) ).
tff(f458,plain,
( p
| ~ ord_less_eq(nat,huffma945805758height(b,t_1),huffma945805758height(a,t_2))
| ( huffma410068972_depth(a,t_2,a1) != huffma945805758height(a,t_2) ) ),
inference(cnf_transformation,[],[f237]) ).
tff(f459,plain,
~ p,
inference(cnf_transformation,[],[f138]) ).
tff(f484,definition,
( spl27_1
<=> ( huffma410068972_depth(a,t_2,a1) = huffma945805758height(a,t_2) ) ),
introduced(definition,[new_symbols(definition,[spl27_1])],[avatar_definition]) ).
tff(f485,plain,
( ( huffma410068972_depth(a,t_2,a1) = huffma945805758height(a,t_2) )
| ~ spl27_1 ),
inference(avatar_component_clause,[],[f484]) ).
tff(f488,definition,
( spl27_2
<=> ord_less_eq(nat,huffma945805758height(b,t_1),huffma945805758height(a,t_2)) ),
introduced(definition,[new_symbols(definition,[spl27_2])],[avatar_definition]) ).
tff(f490,plain,
( ~ ord_less_eq(nat,huffma945805758height(b,t_1),huffma945805758height(a,t_2))
| spl27_2 ),
inference(avatar_component_clause,[],[f488]) ).
tff(f492,definition,
( spl27_3
<=> p ),
introduced(definition,[new_symbols(definition,[spl27_3])],[avatar_definition]) ).
tff(f495,plain,
( ~ spl27_1
| ~ spl27_2
| spl27_3 ),
inference(avatar_split_clause,[],[f458,f492,f488,f484]) ).
tff(f496,plain,
~ spl27_3,
inference(avatar_split_clause,[],[f459,f492]) ).
tff(f666,plain,
! [X0: nat,X1: nat] : ( ord_max(nat,X0,X1) = ord_max(nat,X1,X0) ),
inference(resolution,[],[f327,f444]) ).
tff(f1126,plain,
huffma410068972_depth(a,t_2,a1) = ord_max(nat,huffma945805758height(a,t_2),huffma945805758height(b,t_1)),
inference(forward_demodulation,[],[f457,f666]) ).
tff(f1128,plain,
( ord_less_eq(nat,huffma945805758height(b,t_1),huffma410068972_depth(a,t_2,a1))
| ~ linorder(nat) ),
inference(superposition,[],[f297,f1126]) ).
tff(f1129,plain,
( ord_less_eq(nat,huffma945805758height(a,t_2),huffma410068972_depth(a,t_2,a1))
| ~ linorder(nat) ),
inference(superposition,[],[f296,f1126]) ).
tff(f1130,plain,
ord_less_eq(nat,huffma945805758height(a,t_2),huffma410068972_depth(a,t_2,a1)),
inference(forward_subsumption_resolution,[],[f1129,f444]) ).
tff(f1131,plain,
ord_less_eq(nat,huffma945805758height(b,t_1),huffma410068972_depth(a,t_2,a1)),
inference(forward_subsumption_resolution,[],[f1128,f444]) ).
tff(f1201,plain,
( ~ ord_less_eq(nat,huffma410068972_depth(a,t_2,a1),huffma945805758height(a,t_2))
| ( huffma410068972_depth(a,t_2,a1) = huffma945805758height(a,t_2) ) ),
inference(resolution,[],[f1130,f347]) ).
tff(f1206,plain,
huffma410068972_depth(a,t_2,a1) = huffma945805758height(a,t_2),
inference(forward_subsumption_resolution,[],[f1201,f289]) ).
tff(f1210,plain,
spl27_1,
inference(avatar_split_clause,[],[f1206,f484]) ).
tff(f1284,plain,
( ord_less_eq(nat,huffma945805758height(b,t_1),huffma945805758height(a,t_2))
| ~ spl27_1 ),
inference(forward_demodulation,[],[f1131,f485]) ).
tff(f1285,plain,
( $false
| ~ spl27_1
| spl27_2 ),
inference(forward_subsumption_resolution,[],[f1284,f490]) ).
tff(f1286,plain,
( ~ spl27_1
| spl27_2 ),
inference(avatar_contradiction_clause,[],[f1285]) ).
cnf(s1,plain,
( ~ spl27_1
| ~ spl27_2
| spl27_3 ),
inference(sat_conversion,[],[f495]) ).
cnf(s2,plain,
~ spl27_3,
inference(sat_conversion,[],[f496]) ).
cnf(s32,plain,
spl27_1,
inference(sat_conversion,[],[f1210]) ).
cnf(s37,plain,
( ~ spl27_1
| spl27_2 ),
inference(sat_conversion,[],[f1286]) ).
cnf(s38,plain,
spl27_2,
inference(rat,[],[s37,s32]) ).
cnf(s41,plain,
$false,
inference(rat,[],[s1,s2,s38,s32]) ).
tff(f1287,plain,
$false,
inference(avatar_sat_refutation,[],[s41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWW530_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.27 % Computer : n014.cluster.edu
% 0.12/0.27 % Model : x86_64 x86_64
% 0.12/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.27 % Memory : 8046.5625MB
% 0.12/0.27 % OS : Linux 6.8.0-71-generic
% 0.12/0.27 % CPULimit : 300
% 0.12/0.27 % WCLimit : 300
% 0.12/0.27 % DateTime : Mon Sep 28 14:17:16 UTC 2026
% 0.13/0.27 % CPUTime :
% 0.13/0.27 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.32 Running first-order model finding
% 0.13/0.32 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.32/0.41 % (1799069)Will run a generic schedule for satisfiability detection.
% 0.32/0.41 % (1799080)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2806171561:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.32/0.41 % (1799075)% WARNING: option uhcvi not known.
% 0.32/0.41 % (1799077)dis+10_1_sil=32000:sp=arity:random_seed=1758587450:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.32/0.41 % (1799074)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3139875054_2999 on theBenchmark for (2999ds/0Mi)
% 0.32/0.41 % (1799076)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1345324312:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.32/0.41 % (1799078)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2589533211:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.32/0.41 % (1799075)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=554425788:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.32/0.41 % (1799079)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3736054067:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.32/0.41 % Exception at run slice level
% 0.32/0.41 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.32/0.41 % (1799088)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=778381919:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.32/0.41 % (1799079) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1799069-1799079"...
% 0.32/0.41 % (1799077) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1799069-1799077"...
% 0.32/0.41 % Exception at run slice level
% 0.32/0.41 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.32/0.41 % (1799079)...printing done.
% 0.32/0.41 % (1799077)...printing done.
% 0.32/0.41 % (1799077)Refutation found. Thanks to Tanya!
% 0.32/0.41 % SZS status Theorem for theBenchmark
% 0.32/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.32/0.41 % (1799077)------------------------------
% 0.32/0.41 % (1799077)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.32/0.41 % (1799077)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.32/0.41 % (1799077)CaDiCaL version: 2.1.3
% 0.32/0.41 % (1799077)Termination reason: Refutation
% 0.32/0.41 % (1799077)Time elapsed: 0.038 s
% 0.32/0.41 % (1799077)Peak memory usage: 13 MB
% 0.32/0.41 % (1799077)Instructions burned: 37 (million)
% 0.32/0.41 % (1799069)Success in time 0.081 s
% 0.32/0.41 % Vampire exiting
%------------------------------------------------------------------------------