%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET935+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:42:22 PM UTC 2026
% Result : Theorem 2.26s 1.15s
% Output : Refutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 76 ( 20 unt; 3 def)
% Number of atoms : 235 ( 41 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 261 ( 102 ~; 108 |; 40 &)
% ( 9 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 113 ( 1 sgn 106 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( X1 = powerset(X0)
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f5,axiom,
! [X0,X1,X2] :
( X2 = set_union2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
| in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f6,axiom,
! [X0,X1] :
( inclusion_comparable(X0,X1)
<=> ( subset(X0,X1)
| subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_xboole_0) ).
fof(f9,axiom,
! [X0,X1] : set_union2(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k2_xboole_0) ).
fof(f15,axiom,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(f16,conjecture,
! [X0,X1] :
( set_union2(powerset(X0),powerset(X1)) = powerset(set_union2(X0,X1))
=> inclusion_comparable(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t82_zfmisc_1) ).
fof(f17,negated_conjecture,
~ ! [X0,X1] :
( set_union2(powerset(X0),powerset(X1)) = powerset(set_union2(X0,X1))
=> inclusion_comparable(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f16]) ).
fof(f18,plain,
! [X0] : set_union2(X0,X0) = X0,
inference(rectify,[],[f9]) ).
fof(f25,plain,
? [X0,X1] :
( ~ inclusion_comparable(X0,X1)
& set_union2(powerset(X0),powerset(X1)) = powerset(set_union2(X0,X1)) ),
inference(ennf_transformation,[],[f17]) ).
fof(f26,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f27,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f29,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f28]) ).
fof(f30,plain,
! [X0,X1] :
( ( X1 = powerset(X0)
| ( ( ~ subset(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( subset(sK0(X0,X1),X0)
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f29]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X0)
& ~ in(X3,X1) ) )
& ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X0)
& ~ in(X3,X1) ) )
& ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(flattening,[],[f31]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X0)
& ~ in(X4,X1) ) )
& ( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(rectify,[],[f32]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( X2 = set_union2(X0,X1)
| ( ( ( ~ in(sK1(X0,X1,X2),X0)
& ~ in(sK1(X0,X1,X2),X1) )
| ~ in(sK1(X0,X1,X2),X2) )
& ( in(sK1(X0,X1,X2),X0)
| in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X0)
& ~ in(X4,X1) ) )
& ( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f33]) ).
fof(f35,plain,
! [X0,X1] :
( ( inclusion_comparable(X0,X1)
| ( ~ subset(X0,X1)
& ~ subset(X1,X0) ) )
& ( subset(X0,X1)
| subset(X1,X0)
| ~ inclusion_comparable(X0,X1) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f36,plain,
! [X0,X1] :
( ( inclusion_comparable(X0,X1)
| ( ~ subset(X0,X1)
& ~ subset(X1,X0) ) )
& ( subset(X0,X1)
| subset(X1,X0)
| ~ inclusion_comparable(X0,X1) ) ),
inference(flattening,[],[f35]) ).
fof(f39,plain,
( ~ inclusion_comparable(sK4,sK5)
& set_union2(powerset(sK4),powerset(sK5)) = powerset(set_union2(sK4,sK5)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X0,sK4),skolemize(X1,sK5)],[f25]) ).
fof(f41,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f43,plain,
! [X0,X1] :
( subset(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f27]) ).
fof(f44,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| X0 = X1
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f45,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f30]) ).
fof(f46,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f30]) ).
fof(f49,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f34]) ).
fof(f50,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f34]) ).
fof(f56,plain,
! [X0,X1] :
( inclusion_comparable(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f36]) ).
fof(f57,plain,
! [X0,X1] :
( inclusion_comparable(X0,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f60,plain,
! [X0] : set_union2(X0,X0) = X0,
inference(cnf_transformation,[],[f18]) ).
fof(f66,plain,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f15]) ).
fof(f67,plain,
set_union2(powerset(sK4),powerset(sK5)) = powerset(set_union2(sK4,sK5)),
inference(cnf_transformation,[],[f39]) ).
fof(f68,plain,
~ inclusion_comparable(sK4,sK5),
inference(cnf_transformation,[],[f39]) ).
fof(f69,plain,
! [X1] : subset(X1,X1),
inference(equality_resolution,[],[f43]) ).
fof(f71,plain,
! [X3,X0] :
( in(X3,powerset(X0))
| ~ subset(X3,X0) ),
inference(equality_resolution,[],[f46]) ).
fof(f72,plain,
! [X3,X0] :
( ~ in(X3,powerset(X0))
| subset(X3,X0) ),
inference(equality_resolution,[],[f45]) ).
fof(f74,plain,
! [X0,X1,X4] :
( ~ in(X4,X1)
| in(X4,set_union2(X0,X1)) ),
inference(equality_resolution,[],[f50]) ).
fof(f75,plain,
! [X0,X1,X4] :
( ~ in(X4,set_union2(X0,X1))
| in(X4,X1)
| in(X4,X0) ),
inference(equality_resolution,[],[f49]) ).
fof(f78,plain,
~ subset(sK5,sK4),
inference(resolution,[],[f56,f68]) ).
fof(f79,plain,
~ subset(sK4,sK5),
inference(resolution,[],[f57,f68]) ).
fof(f92,plain,
! [X0,X1] : subset(X1,set_union2(X0,X1)),
inference(superposition,[],[f66,f41]) ).
fof(f109,plain,
! [X0,X1] :
( ~ subset(set_union2(X0,X1),X0)
| set_union2(X0,X1) = X0 ),
inference(resolution,[],[f44,f66]) ).
fof(f110,plain,
! [X0,X1] :
( ~ subset(set_union2(X1,X0),X0)
| set_union2(X1,X0) = X0 ),
inference(resolution,[],[f44,f92]) ).
fof(f137,plain,
! [X0] :
( ~ in(X0,powerset(set_union2(sK4,sK5)))
| in(X0,powerset(sK5))
| in(X0,powerset(sK4)) ),
inference(superposition,[],[f75,f67]) ).
fof(f142,plain,
! [X0] :
( in(X0,powerset(sK5))
| in(X0,powerset(sK4))
| ~ subset(X0,set_union2(sK4,sK5)) ),
inference(resolution,[],[f137,f71]) ).
fof(f146,plain,
! [X0,X1] :
( ~ subset(X0,set_union2(sK4,sK5))
| in(X0,powerset(sK4))
| in(X0,set_union2(X1,powerset(sK5))) ),
inference(resolution,[],[f142,f74]) ).
fof(f775,definition,
( spl6_14
<=> in(set_union2(sK4,sK5),powerset(sK4)) ),
introduced(definition,[new_symbols(definition,[spl6_14])],[avatar_definition]) ).
fof(f777,plain,
( in(set_union2(sK4,sK5),powerset(sK4))
| ~ spl6_14 ),
inference(avatar_component_clause,[],[f775]) ).
fof(f781,plain,
! [X0] :
( in(set_union2(sK4,sK5),powerset(sK4))
| in(set_union2(sK4,sK5),set_union2(X0,powerset(sK5))) ),
inference(resolution,[],[f146,f69]) ).
fof(f786,definition,
( spl6_15
<=> ! [X0] : in(set_union2(sK4,sK5),set_union2(X0,powerset(sK5))) ),
introduced(definition,[new_symbols(definition,[spl6_15])],[avatar_definition]) ).
fof(f787,plain,
( ! [X0] : in(set_union2(sK4,sK5),set_union2(X0,powerset(sK5)))
| ~ spl6_15 ),
inference(avatar_component_clause,[],[f786]) ).
fof(f788,plain,
( spl6_15
| spl6_14 ),
inference(avatar_split_clause,[],[f781,f775,f786]) ).
fof(f789,plain,
( subset(set_union2(sK4,sK5),sK4)
| ~ spl6_14 ),
inference(resolution,[],[f777,f72]) ).
fof(f799,plain,
( sK4 = set_union2(sK4,sK5)
| ~ spl6_14 ),
inference(resolution,[],[f789,f109]) ).
fof(f849,plain,
( subset(sK5,sK4)
| ~ spl6_14 ),
inference(superposition,[],[f92,f799]) ).
fof(f864,plain,
( $false
| ~ spl6_14 ),
inference(forward_subsumption_resolution,[],[f849,f78]) ).
fof(f865,plain,
~ spl6_14,
inference(avatar_contradiction_clause,[],[f864]) ).
fof(f906,plain,
( in(set_union2(sK4,sK5),powerset(sK5))
| ~ spl6_15 ),
inference(superposition,[],[f787,f60]) ).
fof(f914,definition,
( spl6_20
<=> in(set_union2(sK4,sK5),powerset(sK5)) ),
introduced(definition,[new_symbols(definition,[spl6_20])],[avatar_definition]) ).
fof(f916,plain,
( in(set_union2(sK4,sK5),powerset(sK5))
| ~ spl6_20 ),
inference(avatar_component_clause,[],[f914]) ).
fof(f959,plain,
( spl6_20
| ~ spl6_15 ),
inference(avatar_split_clause,[],[f906,f786,f914]) ).
fof(f966,plain,
( subset(set_union2(sK4,sK5),sK5)
| ~ spl6_20 ),
inference(resolution,[],[f916,f72]) ).
fof(f973,plain,
( sK5 = set_union2(sK4,sK5)
| ~ spl6_20 ),
inference(resolution,[],[f966,f110]) ).
fof(f1034,plain,
( subset(sK4,sK5)
| ~ spl6_20 ),
inference(superposition,[],[f66,f973]) ).
fof(f1051,plain,
( $false
| ~ spl6_20 ),
inference(forward_subsumption_resolution,[],[f1034,f79]) ).
fof(f1052,plain,
~ spl6_20,
inference(avatar_contradiction_clause,[],[f1051]) ).
cnf(s15,plain,
( spl6_14
| spl6_15 ),
inference(sat_conversion,[],[f788]) ).
cnf(s16,plain,
~ spl6_14,
inference(sat_conversion,[],[f865]) ).
cnf(s30,plain,
( ~ spl6_15
| spl6_20 ),
inference(sat_conversion,[],[f959]) ).
cnf(s33,plain,
~ spl6_20,
inference(sat_conversion,[],[f1052]) ).
cnf(s35,plain,
~ spl6_15,
inference(rat,[],[s30,s33]) ).
cnf(s37,plain,
$false,
inference(rat,[],[s15,s35,s16]) ).
fof(f1055,plain,
$false,
inference(avatar_sat_refutation,[],[s37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET935+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 % Computer : n019.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Mon Sep 28 03:15:49 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.44 Running first-order theorem proving
% 0.13/0.44 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
% 2.26/1.15 % (3627211)Detected formulas, will run a generic FOF schedule.
% 2.26/1.15 % (3627306)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1498828168:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.26/1.15 % (3627306)First to succeed.
% 2.26/1.15 % (3627306)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3627211"
% 2.26/1.15 % (3627307)dis-21_1_sil=8000:lcm=predicate:random_seed=1899995372: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)
% 2.26/1.15 % (3627303)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=1843761170:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.26/1.15 % (3627304)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1427296002:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.26/1.15 % (3627301)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=2085719190:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.26/1.15 % (3627302)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=3221219255:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.26/1.15 % (3627305)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2539565479:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.26/1.15 % (3627304)Refutation not found, incomplete strategy
% 2.26/1.15 % (3627304)------------------------------
% 2.26/1.15 % (3627304)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.26/1.15 % (3627304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.26/1.15 % (3627304)CaDiCaL version: 2.1.3
% 2.26/1.15 % (3627304)Termination reason: Refutation not found, incomplete strategy
% 2.26/1.15 % (3627304)Time elapsed: 0.001 s
% 2.26/1.15 % (3627304)Peak memory usage: 88 MB
% 2.26/1.15 % (3627305)Also succeeded, but the first one will report.
% 2.26/1.15 % (3627307)Instruction limit reached!
% 2.26/1.15 % (3627307)------------------------------
% 2.26/1.15 % (3627307)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.26/1.15 % (3627307)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.26/1.15 % (3627307)CaDiCaL version: 2.1.3
% 2.26/1.15 % (3627307)Termination reason: Instruction limit
% 2.26/1.15 % (3627307)Termination phase: Saturation
% 2.26/1.15 % (3627307)Time elapsed: 0.074 s
% 2.26/1.15 % (3627307)Peak memory usage: 89 MB
% 2.26/1.15 % (3627307)Instructions burned: 130 (million)
% 2.26/1.15 % (3627306)Refutation found. Thanks to Tanya!
% 2.26/1.15 % SZS status Theorem for theBenchmark
% 2.26/1.15 % SZS output start Proof for theBenchmark
% See solution above
% 2.64/1.35 % (3627306)------------------------------
% 2.64/1.35 % (3627306)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/1.35 % (3627306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/1.35 % (3627306)CaDiCaL version: 2.1.3
% 2.64/1.35 % (3627306)Termination reason: Refutation
% 2.64/1.35 % (3627306)Time elapsed: 0.019 s
% 2.64/1.35 % (3627306)Peak memory usage: 90 MB
% 2.64/1.35 % (3627306)Instructions burned: 47 (million)
% 2.64/1.35 % (3627306)------------------------------
% 2.64/1.35 % (3627306)------------------------------
% 2.64/1.35 % (3627211)Success in time 0.278 s
% 2.64/1.35 % Vampire exiting
%------------------------------------------------------------------------------