%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV381+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:21:07 PM UTC 2026
% Result : Theorem 0.19s 0.28s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 16
% Syntax : Number of formulae : 87 ( 20 unt; 4 def)
% Number of atoms : 176 ( 22 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 152 ( 63 ~; 63 |; 9 &)
% ( 8 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 5 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 119 ( 1 sgn 114 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( less_than(X0,X1)
& ~ less_than(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(f8,axiom,
! [X0] : ~ contains_pq(create_pq,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+1.ax',ax8) ).
fof(f10,axiom,
! [X0,X1] :
( issmallestelement_pq(X0,X1)
<=> ! [X2] :
( contains_pq(X0,X2)
=> less_than(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+1.ax',ax10) ).
fof(f39,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax39) ).
fof(f50,axiom,
! [X0,X1] : findmin_cpq_res(triple(X0,create_slb,X1)) = bottom,
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax50) ).
fof(f51,axiom,
! [X0,X1,X2,X3] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax51) ).
fof(f53,axiom,
! [X0] : removemin_cpq_res(X0) = findmin_cpq_res(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax53) ).
fof(f54,axiom,
! [X0,X1] : i(triple(X0,create_slb,X1)) = create_pq,
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax',ax54) ).
fof(f63,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_pq(i(triple(X0,X1,X2)),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l17_li56) ).
fof(f64,axiom,
! [X0,X1,X2] :
( ? [X3] :
( contains_cpq(triple(X0,X1,X2),X3)
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) )
=> ~ phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l17_l18) ).
fof(f65,conjecture,
! [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> issmallestelement_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l17_co) ).
fof(f66,negated_conjecture,
~ ! [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> issmallestelement_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(negated_conjecture,[status(cth)],[f65]) ).
fof(f74,plain,
! [X0,X1,X2] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
inference(rectify,[],[f51]) ).
fof(f75,plain,
! [X0,X1] :
( ! [X2] :
( contains_pq(X0,X2)
=> less_than(X1,X2) )
=> issmallestelement_pq(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f76,plain,
! [X0,X1] :
( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f79,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(ennf_transformation,[],[f76]) ).
fof(f80,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(flattening,[],[f79]) ).
fof(f81,plain,
! [X0,X1] :
( issmallestelement_pq(X0,X1)
| ? [X2] :
( ~ less_than(X1,X2)
& contains_pq(X0,X2) ) ),
inference(ennf_transformation,[],[f75]) ).
fof(f116,plain,
! [X0,X1,X2] :
( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0)
| create_slb = X1 ),
inference(ennf_transformation,[],[f74]) ).
fof(f117,plain,
! [X0,X1,X2] :
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| ! [X3] :
( ~ contains_cpq(triple(X0,X1,X2),X3)
| ~ strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) ) ),
inference(ennf_transformation,[],[f64]) ).
fof(f118,plain,
? [X0,X1,X2] :
( ~ issmallestelement_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
& phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f66]) ).
fof(f121,plain,
! [X0,X1] :
( issmallestelement_pq(X0,X1)
| ( ~ less_than(X1,sK0(X0,X1))
& contains_pq(X0,sK0(X0,X1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f81]) ).
fof(f127,plain,
! [X0,X1,X2,X3] :
( ( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_slb(X1,X3) )
& ( contains_slb(X1,X3)
| ~ contains_cpq(triple(X0,X1,X2),X3) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f131,plain,
! [X0,X1,X2,X3] :
( ( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_pq(i(triple(X0,X1,X2)),X3) )
& ( contains_pq(i(triple(X0,X1,X2)),X3)
| ~ contains_cpq(triple(X0,X1,X2),X3) ) ),
inference(nnf_transformation,[],[f63]) ).
fof(f132,plain,
( ~ issmallestelement_pq(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4)))
& phi(findmin_cpq_eff(triple(sK2,sK3,sK4))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f118]) ).
fof(f134,plain,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f2]) ).
fof(f136,plain,
! [X0,X1] :
( ~ less_than(X0,X1)
| strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f80]) ).
fof(f140,plain,
! [X0] : ~ contains_pq(create_pq,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f144,plain,
! [X0,X1] :
( issmallestelement_pq(X0,X1)
| contains_pq(X0,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f121]) ).
fof(f145,plain,
! [X0,X1] :
( ~ less_than(X1,sK0(X0,X1))
| issmallestelement_pq(X0,X1) ),
inference(cnf_transformation,[],[f121]) ).
fof(f180,plain,
! [X2,X3,X0,X1] :
( ~ contains_cpq(triple(X0,X1,X2),X3)
| contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f127]) ).
fof(f181,plain,
! [X2,X3,X0,X1] :
( ~ contains_slb(X1,X3)
| contains_cpq(triple(X0,X1,X2),X3) ),
inference(cnf_transformation,[],[f127]) ).
fof(f192,plain,
! [X0,X1] : bottom = findmin_cpq_res(triple(X0,create_slb,X1)),
inference(cnf_transformation,[],[f50]) ).
fof(f193,plain,
! [X2,X0,X1] :
( findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(cnf_transformation,[],[f116]) ).
fof(f195,plain,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
inference(cnf_transformation,[],[f53]) ).
fof(f196,plain,
! [X0,X1] : create_pq = i(triple(X0,create_slb,X1)),
inference(cnf_transformation,[],[f54]) ).
fof(f203,plain,
! [X2,X3,X0,X1] :
( ~ contains_pq(i(triple(X0,X1,X2)),X3)
| contains_cpq(triple(X0,X1,X2),X3) ),
inference(cnf_transformation,[],[f131]) ).
fof(f204,plain,
! [X2,X3,X0,X1] :
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| ~ contains_cpq(triple(X0,X1,X2),X3)
| ~ strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f117]) ).
fof(f205,plain,
phi(findmin_cpq_eff(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f132]) ).
fof(f206,plain,
~ issmallestelement_pq(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f132]) ).
fof(f209,plain,
! [X0,X1] : bottom = removemin_cpq_res(triple(X0,create_slb,X1)),
inference(definition_unfolding,[],[f192,f195]) ).
fof(f210,plain,
! [X2,X0,X1] :
( findmin_pqp_res(X0) = removemin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(definition_unfolding,[],[f193,f195]) ).
fof(f211,plain,
! [X2,X3,X0,X1] :
( ~ phi(findmin_cpq_eff(triple(X0,X1,X2)))
| ~ contains_cpq(triple(X0,X1,X2),X3)
| ~ strictly_less_than(X3,removemin_cpq_res(triple(X0,X1,X2))) ),
inference(definition_unfolding,[],[f204,f195]) ).
fof(f212,plain,
~ issmallestelement_pq(i(triple(sK2,sK3,sK4)),removemin_cpq_res(triple(sK2,sK3,sK4))),
inference(definition_unfolding,[],[f206,f195]) ).
fof(f225,plain,
contains_pq(i(triple(sK2,sK3,sK4)),sK0(i(triple(sK2,sK3,sK4)),removemin_cpq_res(triple(sK2,sK3,sK4)))),
inference(resolution,[],[f144,f212]) ).
fof(f265,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| less_than(X1,X0) ),
inference(resolution,[],[f136,f134]) ).
fof(f266,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(duplicate_literal_removal,[],[f265]) ).
fof(f343,plain,
( contains_pq(i(triple(sK2,sK3,sK4)),sK0(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2)))
| create_slb = sK3 ),
inference(superposition,[],[f225,f210]) ).
fof(f344,plain,
( ~ issmallestelement_pq(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2))
| create_slb = sK3 ),
inference(superposition,[],[f212,f210]) ).
fof(f354,definition,
( spl5_1
<=> create_slb = sK3 ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
fof(f356,plain,
( create_slb = sK3
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f354]) ).
fof(f358,definition,
( spl5_2
<=> issmallestelement_pq(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2)) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
fof(f360,plain,
( ~ issmallestelement_pq(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2))
| spl5_2 ),
inference(avatar_component_clause,[],[f358]) ).
fof(f361,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f344,f358,f354]) ).
fof(f363,definition,
( spl5_3
<=> contains_pq(i(triple(sK2,sK3,sK4)),sK0(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2))) ),
introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).
fof(f365,plain,
( contains_pq(i(triple(sK2,sK3,sK4)),sK0(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2)))
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f363]) ).
fof(f366,plain,
( spl5_1
| spl5_3 ),
inference(avatar_split_clause,[],[f343,f363,f354]) ).
fof(f384,plain,
( contains_cpq(triple(sK2,sK3,sK4),sK0(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2)))
| ~ spl5_3 ),
inference(resolution,[],[f365,f203]) ).
fof(f391,plain,
( contains_slb(sK3,sK0(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2)))
| ~ spl5_3 ),
inference(resolution,[],[f384,f180]) ).
fof(f393,plain,
( ! [X0,X1] : contains_cpq(triple(X0,sK3,X1),sK0(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2)))
| ~ spl5_3 ),
inference(resolution,[],[f391,f181]) ).
fof(f443,plain,
! [X0] :
( ~ contains_cpq(triple(sK2,sK3,sK4),X0)
| ~ strictly_less_than(X0,removemin_cpq_res(triple(sK2,sK3,sK4))) ),
inference(resolution,[],[f211,f205]) ).
fof(f449,plain,
( ~ strictly_less_than(sK0(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2)),removemin_cpq_res(triple(sK2,sK3,sK4)))
| ~ spl5_3 ),
inference(resolution,[],[f443,f393]) ).
fof(f455,plain,
( ~ strictly_less_than(sK0(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2)),findmin_pqp_res(sK2))
| create_slb = sK3
| ~ spl5_3 ),
inference(superposition,[],[f449,f210]) ).
fof(f457,definition,
( spl5_4
<=> strictly_less_than(sK0(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2)),findmin_pqp_res(sK2)) ),
introduced(definition,[new_symbols(definition,[spl5_4])],[avatar_definition]) ).
fof(f459,plain,
( ~ strictly_less_than(sK0(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2)),findmin_pqp_res(sK2))
| spl5_4 ),
inference(avatar_component_clause,[],[f457]) ).
fof(f460,plain,
( spl5_1
| ~ spl5_4
| ~ spl5_3 ),
inference(avatar_split_clause,[],[f455,f363,f457,f354]) ).
fof(f565,plain,
( less_than(findmin_pqp_res(sK2),sK0(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2)))
| spl5_4 ),
inference(resolution,[],[f266,f459]) ).
fof(f566,plain,
( issmallestelement_pq(i(triple(sK2,sK3,sK4)),findmin_pqp_res(sK2))
| spl5_4 ),
inference(resolution,[],[f565,f145]) ).
fof(f570,plain,
( $false
| spl5_2
| spl5_4 ),
inference(forward_subsumption_resolution,[],[f566,f360]) ).
fof(f571,plain,
( spl5_2
| spl5_4 ),
inference(avatar_contradiction_clause,[],[f570]) ).
fof(f585,plain,
( contains_pq(i(triple(sK2,create_slb,sK4)),sK0(i(triple(sK2,create_slb,sK4)),removemin_cpq_res(triple(sK2,create_slb,sK4))))
| ~ spl5_1 ),
inference(superposition,[],[f225,f356]) ).
fof(f686,plain,
( contains_pq(i(triple(sK2,create_slb,sK4)),sK0(i(triple(sK2,create_slb,sK4)),bottom))
| ~ spl5_1 ),
inference(forward_demodulation,[],[f585,f209]) ).
fof(f703,plain,
( contains_pq(create_pq,sK0(create_pq,bottom))
| ~ spl5_1 ),
inference(forward_demodulation,[],[f686,f196]) ).
fof(f708,plain,
( $false
| ~ spl5_1 ),
inference(forward_subsumption_resolution,[],[f703,f140]) ).
fof(f709,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f708]) ).
cnf(s1,plain,
( spl5_1
| ~ spl5_2 ),
inference(sat_conversion,[],[f361]) ).
cnf(s2,plain,
( spl5_1
| spl5_3 ),
inference(sat_conversion,[],[f366]) ).
cnf(s3,plain,
( spl5_1
| ~ spl5_3
| ~ spl5_4 ),
inference(sat_conversion,[],[f460]) ).
cnf(s8,plain,
( spl5_2
| spl5_4 ),
inference(sat_conversion,[],[f571]) ).
cnf(s14,plain,
~ spl5_1,
inference(sat_conversion,[],[f709]) ).
cnf(s15,plain,
( ~ spl5_3
| ~ spl5_4 ),
inference(rat,[],[s3,s14]) ).
cnf(s16,plain,
spl5_3,
inference(rat,[],[s2,s14]) ).
cnf(s17,plain,
~ spl5_4,
inference(rat,[],[s15,s16]) ).
cnf(s18,plain,
spl5_2,
inference(rat,[],[s8,s17]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s1,s18,s14]) ).
fof(f710,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV381+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n026.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 10:48:57 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.28 % (3774311)Will run a generic schedule for satisfiability detection.
% 0.19/0.28 % (3774322)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1603304979:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.28 % (3774317)% WARNING: option uhcvi not known.
% 0.19/0.28 % (3774318)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1185223460:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.28 % (3774316)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1480836432_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.28 % (3774317)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4021942947:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.28 % (3774319)dis+10_1_sil=32000:sp=arity:random_seed=2078849752:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.28 % (3774321)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3268665170:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.28 % (3774320)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2885711682:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.28 % TRYING [1]
% 0.19/0.28 % TRYING [2]
% 0.19/0.28 % TRYING [3]
% 0.19/0.28 % (3774321) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3774311-3774321"...
% 0.19/0.28 % (3774321)...printing done.
% 0.19/0.28 % (3774321)Refutation found. Thanks to Tanya!
% 0.19/0.28 % SZS status Theorem for theBenchmark
% 0.19/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.28 % (3774321)------------------------------
% 0.19/0.28 % (3774321)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28 % (3774321)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28 % (3774321)CaDiCaL version: 2.1.3
% 0.19/0.28 % (3774321)Termination reason: Refutation
% 0.19/0.28 % (3774321)Time elapsed: 0.021 s
% 0.19/0.28 % (3774321)Peak memory usage: 13 MB
% 0.19/0.28 % (3774321)Instructions burned: 31 (million)
% 0.19/0.28 % (3774311)Success in time 0.055 s
% 0.19/0.28 % Vampire exiting
%------------------------------------------------------------------------------