%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET980+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:28 PM UTC 2026
% Result : Theorem 0.76s 0.80s
% Output : Refutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 5
% Syntax : Number of formulae : 72 ( 10 unt; 0 def)
% Number of atoms : 218 ( 114 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 249 ( 103 ~; 113 |; 25 &)
% ( 4 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 121 ( 109 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f7,axiom,
! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X0,X2)
& in(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l55_zfmisc_1) ).
fof(f10,axiom,
! [X0,X1] :
( cartesian_product2(X0,X1) = empty_set
<=> ( X0 = empty_set
| X1 = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t113_zfmisc_1) ).
fof(f11,conjecture,
! [X0,X1,X2,X3] :
( cartesian_product2(X0,X1) = cartesian_product2(X2,X3)
=> ( X0 = empty_set
| X1 = empty_set
| ( X0 = X2
& X1 = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t134_zfmisc_1) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( cartesian_product2(X0,X1) = cartesian_product2(X2,X3)
=> ( X0 = empty_set
| X1 = empty_set
| ( X0 = X2
& X1 = X3 ) ) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tarski) ).
fof(f14,plain,
? [X0,X1,X2,X3] :
( empty_set != X0
& empty_set != X1
& ( X0 != X2
| X1 != X3 )
& cartesian_product2(X0,X1) = cartesian_product2(X2,X3) ),
inference(ennf_transformation,[],[f12]) ).
fof(f15,plain,
? [X0,X1,X2,X3] :
( empty_set != X0
& empty_set != X1
& ( X0 != X2
| X1 != X3 )
& cartesian_product2(X0,X1) = cartesian_product2(X2,X3) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( in(X2,X0)
<~> in(X2,X1) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f18,plain,
( empty_set != sK0
& empty_set != sK1
& ( sK0 != sK2
| sK1 != sK3 )
& cartesian_product2(sK2,sK3) = cartesian_product2(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f15]) ).
fof(f19,plain,
! [X0] :
( ( X0 = empty_set
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f20,plain,
! [X0] :
( ( X0 = empty_set
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f19]) ).
fof(f21,plain,
! [X0] :
( ( X0 = empty_set
| in(sK4(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X1,sK4(X0))],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( ( cartesian_product2(X0,X1) = empty_set
| ( empty_set != X0
& empty_set != X1 ) )
& ( X0 = empty_set
| X1 = empty_set
| empty_set != cartesian_product2(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f23,plain,
! [X0,X1] :
( ( cartesian_product2(X0,X1) = empty_set
| ( empty_set != X0
& empty_set != X1 ) )
& ( X0 = empty_set
| X1 = empty_set
| empty_set != cartesian_product2(X0,X1) ) ),
inference(flattening,[],[f22]) ).
fof(f24,plain,
! [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X0,X2)
| ~ in(X1,X3) )
& ( ( in(X0,X2)
& in(X1,X3) )
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f25,plain,
! [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X0,X2)
| ~ in(X1,X3) )
& ( ( in(X0,X2)
& in(X1,X3) )
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(flattening,[],[f24]) ).
fof(f28,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f29,plain,
! [X0,X1] :
( X0 = X1
| ( ( ~ in(sK7(X0,X1),X1)
| ~ in(sK7(X0,X1),X0) )
& ( in(sK7(X0,X1),X1)
| in(sK7(X0,X1),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X2,sK7(X0,X1))],[f28]) ).
fof(f30,plain,
cartesian_product2(sK2,sK3) = cartesian_product2(sK0,sK1),
inference(cnf_transformation,[],[f18]) ).
fof(f31,plain,
( sK1 != sK3
| sK0 != sK2 ),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
empty_set != sK1,
inference(cnf_transformation,[],[f18]) ).
fof(f33,plain,
empty_set != sK0,
inference(cnf_transformation,[],[f18]) ).
fof(f35,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f21]) ).
fof(f36,plain,
! [X0] :
( in(sK4(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f21]) ).
fof(f37,plain,
! [X0,X1] :
( empty_set != cartesian_product2(X0,X1)
| empty_set = X1
| empty_set = X0 ),
inference(cnf_transformation,[],[f23]) ).
fof(f39,plain,
! [X0,X1] :
( empty_set = cartesian_product2(X0,X1)
| empty_set != X0 ),
inference(cnf_transformation,[],[f23]) ).
fof(f40,plain,
! [X2,X3,X0,X1] :
( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| in(X1,X3) ),
inference(cnf_transformation,[],[f25]) ).
fof(f41,plain,
! [X2,X3,X0,X1] :
( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| in(X0,X2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f42,plain,
! [X2,X3,X0,X1] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X0,X2)
| ~ in(X1,X3) ),
inference(cnf_transformation,[],[f25]) ).
fof(f45,plain,
! [X0,X1] :
( in(sK7(X0,X1),X1)
| X0 = X1
| in(sK7(X0,X1),X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f46,plain,
! [X0,X1] :
( ~ in(sK7(X0,X1),X1)
| X0 = X1
| ~ in(sK7(X0,X1),X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f49,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f35]) ).
fof(f50,plain,
! [X1] : empty_set = cartesian_product2(empty_set,X1),
inference(equality_resolution,[],[f39]) ).
fof(f55,plain,
! [X0,X1] :
( ~ in(ordered_pair(X0,X1),cartesian_product2(sK2,sK3))
| in(X1,sK1) ),
inference(superposition,[],[f40,f30]) ).
fof(f58,plain,
! [X0,X1] :
( ~ in(ordered_pair(X0,X1),cartesian_product2(sK2,sK3))
| in(X0,sK0) ),
inference(superposition,[],[f41,f30]) ).
fof(f61,plain,
( empty_set != cartesian_product2(sK2,sK3)
| empty_set = sK1
| empty_set = sK0 ),
inference(superposition,[],[f37,f30]) ).
fof(f62,plain,
( empty_set != cartesian_product2(sK2,sK3)
| empty_set = sK0 ),
inference(forward_subsumption_resolution,[],[f61,f32]) ).
fof(f63,plain,
empty_set != cartesian_product2(sK2,sK3),
inference(forward_subsumption_resolution,[],[f62,f33]) ).
fof(f66,plain,
! [X0,X1] :
( in(X0,sK0)
| ~ in(X1,sK3)
| ~ in(X0,sK2) ),
inference(resolution,[],[f42,f58]) ).
fof(f67,plain,
! [X0,X1] :
( in(X1,sK1)
| ~ in(X1,sK3)
| ~ in(X0,sK2) ),
inference(resolution,[],[f42,f55]) ).
fof(f69,plain,
! [X0,X1] :
( in(ordered_pair(X0,X1),cartesian_product2(sK2,sK3))
| ~ in(X0,sK0)
| ~ in(X1,sK1) ),
inference(superposition,[],[f42,f30]) ).
fof(f75,plain,
! [X0] :
( in(sK7(X0,empty_set),X0)
| empty_set = X0 ),
inference(resolution,[],[f45,f49]) ).
fof(f79,plain,
! [X0,X1] :
( ~ in(sK7(X0,sK0),sK2)
| ~ in(sK7(X0,sK0),X0)
| ~ in(X1,sK3)
| sK0 = X0 ),
inference(resolution,[],[f46,f66]) ).
fof(f80,plain,
! [X0,X1] :
( ~ in(sK7(X0,sK1),sK3)
| ~ in(sK7(X0,sK1),X0)
| sK1 = X0
| ~ in(X1,sK2) ),
inference(resolution,[],[f46,f67]) ).
fof(f85,plain,
! [X0,X1] :
( in(X0,sK2)
| ~ in(X1,sK1)
| ~ in(X0,sK0) ),
inference(resolution,[],[f69,f41]) ).
fof(f86,plain,
! [X0,X1] :
( in(X1,sK3)
| ~ in(X1,sK1)
| ~ in(X0,sK0) ),
inference(resolution,[],[f69,f40]) ).
fof(f142,plain,
! [X0] :
( ~ in(sK7(sK2,sK0),sK2)
| ~ in(X0,sK3)
| sK0 = sK2 ),
inference(factoring,[],[f79]) ).
fof(f146,plain,
! [X0,X1] :
( ~ in(sK7(sK2,sK0),sK0)
| sK0 = sK2
| ~ in(X1,sK1)
| ~ in(X0,sK3) ),
inference(resolution,[],[f142,f85]) ).
fof(f150,plain,
! [X0] :
( ~ in(sK7(sK3,sK1),sK3)
| sK1 = sK3
| ~ in(X0,sK2) ),
inference(factoring,[],[f80]) ).
fof(f153,plain,
! [X0,X1] :
( ~ in(sK7(sK3,sK1),sK1)
| ~ in(X0,sK2)
| sK1 = sK3
| ~ in(X1,sK0) ),
inference(resolution,[],[f150,f86]) ).
fof(f177,plain,
! [X0,X1] :
( sK0 = sK2
| ~ in(X0,sK1)
| ~ in(X1,sK3)
| sK0 = sK2
| in(sK7(sK2,sK0),sK2) ),
inference(resolution,[],[f146,f45]) ).
fof(f179,plain,
! [X0,X1] :
( sK0 = sK2
| ~ in(X0,sK1)
| ~ in(X1,sK3)
| in(sK7(sK2,sK0),sK2) ),
inference(duplicate_literal_removal,[],[f177]) ).
fof(f180,plain,
! [X0,X1] :
( ~ in(X1,sK3)
| ~ in(X0,sK1)
| sK0 = sK2 ),
inference(forward_subsumption_resolution,[],[f179,f142]) ).
fof(f182,plain,
! [X0] :
( ~ in(X0,sK1)
| sK0 = sK2
| empty_set = sK3 ),
inference(resolution,[],[f180,f36]) ).
fof(f186,plain,
! [X0,X1] :
( ~ in(X0,sK2)
| sK1 = sK3
| ~ in(X1,sK0)
| sK1 = sK3
| in(sK7(sK3,sK1),sK3) ),
inference(resolution,[],[f153,f45]) ).
fof(f188,plain,
! [X0,X1] :
( ~ in(X0,sK2)
| sK1 = sK3
| ~ in(X1,sK0)
| in(sK7(sK3,sK1),sK3) ),
inference(duplicate_literal_removal,[],[f186]) ).
fof(f189,plain,
! [X0,X1] :
( ~ in(X1,sK0)
| sK1 = sK3
| ~ in(X0,sK2) ),
inference(forward_subsumption_resolution,[],[f188,f150]) ).
fof(f193,plain,
! [X0] :
( sK1 = sK3
| ~ in(X0,sK2)
| empty_set = sK0 ),
inference(resolution,[],[f189,f75]) ).
fof(f195,plain,
! [X0] :
( ~ in(X0,sK2)
| sK1 = sK3 ),
inference(forward_subsumption_resolution,[],[f193,f33]) ).
fof(f198,plain,
( sK1 = sK3
| empty_set = sK2 ),
inference(resolution,[],[f195,f36]) ).
fof(f203,plain,
( sK3 != sK3
| sK0 != sK2
| empty_set = sK2 ),
inference(superposition,[],[f31,f198]) ).
fof(f213,plain,
( sK0 != sK2
| empty_set = sK2 ),
inference(trivial_inequality_removal,[],[f203]) ).
fof(f220,plain,
( sK0 = sK2
| empty_set = sK3
| empty_set = sK1 ),
inference(resolution,[],[f182,f75]) ).
fof(f224,plain,
( sK0 = sK2
| empty_set = sK3 ),
inference(forward_subsumption_resolution,[],[f220,f32]) ).
fof(f238,plain,
( sK2 != sK2
| empty_set = sK2
| empty_set = sK3 ),
inference(superposition,[],[f213,f224]) ).
fof(f239,plain,
( empty_set = sK3
| empty_set = sK2 ),
inference(trivial_inequality_removal,[],[f238]) ).
fof(f247,plain,
( sK1 != sK3
| empty_set = sK2 ),
inference(superposition,[],[f32,f239]) ).
fof(f257,plain,
empty_set = sK2,
inference(forward_subsumption_resolution,[],[f247,f198]) ).
fof(f263,plain,
! [X0] : sK2 = cartesian_product2(sK2,X0),
inference(superposition,[],[f50,f257]) ).
fof(f333,plain,
empty_set != sK2,
inference(superposition,[],[f63,f263]) ).
fof(f341,plain,
$false,
inference(forward_subsumption_resolution,[],[f333,f257]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET980+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.31 % Computer : n012.cluster.edu
% 0.03/0.31 % Model : x86_64 x86_64
% 0.03/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.31 % Memory : 8046.5625MB
% 0.03/0.31 % OS : Linux 6.8.0-71-generic
% 0.03/0.31 % CPULimit : 300
% 0.03/0.31 % WCLimit : 300
% 0.03/0.31 % DateTime : Mon Sep 28 03:18:04 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.33 Running first-order theorem proving
% 0.06/0.33 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
% 0.76/0.80 % (2984929)Detected formulas, will run a generic FOF schedule.
% 0.76/0.80 % (2984937)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1711917047:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.76/0.80 % (2984934)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=711489281:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.76/0.80 % (2984937)Refutation not found, incomplete strategy
% 0.76/0.80 % (2984937)------------------------------
% 0.76/0.80 % (2984937)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.76/0.80 % (2984937)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.76/0.80 % (2984937)CaDiCaL version: 2.1.3
% 0.76/0.80 % (2984937)Termination reason: Refutation not found, incomplete strategy
% 0.76/0.80 % (2984937)Time elapsed: 0.003 s
% 0.76/0.80 % (2984937)Peak memory usage: 88 MB
% 0.76/0.80 % (2984937)Instructions burned: 5 (million)
% 0.76/0.80 % (2984936)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=594117414:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.76/0.80 % (2984935)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=1413985358:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.76/0.80 % (2984939)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1560570804:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.76/0.80 % (2984938)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2662651031:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.76/0.80 % (2984940)dis-21_1_sil=8000:lcm=predicate:random_seed=3240341127: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)
% 0.76/0.80 % (2984938)First to succeed.
% 0.76/0.80 % (2984938)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2984929"
% 0.76/0.80 % (2984940)Instruction limit reached!
% 0.76/0.80 % (2984940)------------------------------
% 0.76/0.80 % (2984940)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.76/0.80 % (2984940)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.76/0.80 % (2984940)CaDiCaL version: 2.1.3
% 0.76/0.80 % (2984940)Termination reason: Instruction limit
% 0.76/0.80 % (2984940)Termination phase: Saturation
% 0.76/0.80 % (2984940)Time elapsed: 0.038 s
% 0.76/0.80 % (2984940)Peak memory usage: 90 MB
% 0.76/0.80 % (2984940)Instructions burned: 129 (million)
% 0.76/0.80 % (2984939)Instruction limit reached!
% 0.76/0.80 % (2984939)------------------------------
% 0.76/0.80 % (2984939)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.76/0.80 % (2984939)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.76/0.80 % (2984939)CaDiCaL version: 2.1.3
% 0.76/0.80 % (2984939)Termination reason: Instruction limit
% 0.76/0.80 % (2984939)Termination phase: Saturation
% 0.76/0.80 % (2984939)Time elapsed: 0.046 s
% 0.76/0.80 % (2984939)Peak memory usage: 89 MB
% 0.76/0.80 % (2984939)Instructions burned: 140 (million)
% 0.76/0.80 % (2984948)lrs+10_1_sil=8000:sp=occurrence:random_seed=1922984682:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 0.76/0.80 % (2984949)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3100540836:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 0.76/0.80 % (2984937)------------------------------
% 0.76/0.80 % (2984937)------------------------------
% 0.76/0.80 % (2984948)Also succeeded, but the first one will report.
% 0.76/0.80 % (2984938)Refutation found. Thanks to Tanya!
% 0.76/0.80 % SZS status Theorem for theBenchmark
% 0.76/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 0.06/0.90 % (2984938)------------------------------
% 0.06/0.90 % (2984938)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.06/0.90 % (2984938)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.90 % (2984938)CaDiCaL version: 2.1.3
% 0.06/0.90 % (2984938)Termination reason: Refutation
% 0.06/0.90 % (2984938)Time elapsed: 0.005 s
% 0.06/0.90 % (2984938)Peak memory usage: 88 MB
% 0.06/0.90 % (2984938)Instructions burned: 15 (million)
% 0.06/0.90 % (2984938)------------------------------
% 0.06/0.90 % (2984938)------------------------------
% 0.06/0.90 % (2984929)Success in time 0.274 s
% 0.06/0.90 % Vampire exiting
%------------------------------------------------------------------------------