%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU146+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:47:24 PM UTC 2026
% Result : Theorem 0.83s 0.95s
% Output : Refutation 2.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of formulae : 83 ( 10 unt; 3 def)
% Number of atoms : 287 ( 83 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 330 ( 126 ~; 145 |; 45 &)
% ( 12 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 97 ( 1 sgn 84 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f7,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f8,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f12,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f29,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f32,conjecture,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( X0 = empty_set
| X0 = singleton(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(f33,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( X0 = empty_set
| X0 = singleton(X1) ) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
fof(f36,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f44,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f47,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(f72,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f36]) ).
fof(f85,plain,
? [X0,X1] :
( subset(X0,singleton(X1))
<~> ( X0 = empty_set
| X0 = singleton(X1) ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f93,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f44]) ).
fof(f108,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f109,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f108]) ).
fof(f110,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X2 = X0
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X2 = X0
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f111,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X2 = X0
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f110]) ).
fof(f112,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f111]) ).
fof(f113,plain,
! [X0] :
( ( X0 = empty_set
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f114,plain,
! [X0] :
( ( X0 = empty_set
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f113]) ).
fof(f115,plain,
! [X0] :
( ( X0 = empty_set
| in(sK1(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f114]) ).
fof(f127,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(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_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f128,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(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_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f127]) ).
fof(f129,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(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_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f128]) ).
fof(f130,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ( ( ~ in(sK5(X0,X1,X2),X0)
| ~ in(sK5(X0,X1,X2),X1)
| ~ in(sK5(X0,X1,X2),X2) )
& ( ( in(sK5(X0,X1,X2),X0)
& in(sK5(X0,X1,X2),X1) )
| in(sK5(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X3,sK5(X0,X1,X2))],[f129]) ).
fof(f136,plain,
! [X0,X1] :
( ( subset(singleton(X0),X1)
| ~ in(X0,X1) )
& ( in(X0,X1)
| ~ subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f138,plain,
? [X0,X1] :
( ( ( empty_set != X0
& singleton(X1) != X0 )
| ~ subset(X0,singleton(X1)) )
& ( X0 = empty_set
| X0 = singleton(X1)
| subset(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f85]) ).
fof(f139,plain,
? [X0,X1] :
( ( ( empty_set != X0
& singleton(X1) != X0 )
| ~ subset(X0,singleton(X1)) )
& ( X0 = empty_set
| X0 = singleton(X1)
| subset(X0,singleton(X1)) ) ),
inference(flattening,[],[f138]) ).
fof(f140,plain,
( ( ( empty_set != sK7
& sK7 != singleton(sK8) )
| ~ subset(sK7,singleton(sK8)) )
& ( empty_set = sK7
| sK7 = singleton(sK8)
| subset(sK7,singleton(sK8)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X0,sK7),skolemize(X1,sK8)],[f139]) ).
fof(f156,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| X0 = X1
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f157,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f112]) ).
fof(f162,plain,
! [X0] :
( in(sK1(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f115]) ).
fof(f178,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f130]) ).
fof(f201,plain,
! [X0,X1] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
fof(f205,plain,
( empty_set = sK7
| sK7 = singleton(sK8)
| subset(sK7,singleton(sK8)) ),
inference(cnf_transformation,[],[f140]) ).
fof(f206,plain,
( sK7 != singleton(sK8)
| ~ subset(sK7,singleton(sK8)) ),
inference(cnf_transformation,[],[f140]) ).
fof(f207,plain,
( empty_set != sK7
| ~ subset(sK7,singleton(sK8)) ),
inference(cnf_transformation,[],[f140]) ).
fof(f210,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f72]) ).
fof(f218,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(cnf_transformation,[],[f93]) ).
fof(f222,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f47]) ).
fof(f253,plain,
! [X3,X0] :
( ~ in(X3,singleton(X0))
| X0 = X3 ),
inference(equality_resolution,[],[f157]) ).
fof(f265,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f178]) ).
fof(f270,definition,
( spl14_1
<=> subset(sK7,singleton(sK8)) ),
introduced(definition,[new_symbols(definition,[spl14_1])],[avatar_definition]) ).
fof(f271,plain,
( ~ subset(sK7,singleton(sK8))
| spl14_1 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f272,plain,
( subset(sK7,singleton(sK8))
| ~ spl14_1 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f274,definition,
( spl14_2
<=> sK7 = singleton(sK8) ),
introduced(definition,[new_symbols(definition,[spl14_2])],[avatar_definition]) ).
fof(f275,plain,
( sK7 != singleton(sK8)
| spl14_2 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f276,plain,
( sK7 = singleton(sK8)
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f278,definition,
( spl14_3
<=> empty_set = sK7 ),
introduced(definition,[new_symbols(definition,[spl14_3])],[avatar_definition]) ).
fof(f279,plain,
( empty_set != sK7
| spl14_3 ),
inference(avatar_component_clause,[],[f278]) ).
fof(f280,plain,
( empty_set = sK7
| ~ spl14_3 ),
inference(avatar_component_clause,[],[f278]) ).
fof(f281,plain,
( spl14_1
| spl14_2
| spl14_3 ),
inference(avatar_split_clause,[],[f205,f278,f274,f270]) ).
fof(f282,plain,
( ~ spl14_1
| ~ spl14_2 ),
inference(avatar_split_clause,[],[f206,f274,f270]) ).
fof(f283,plain,
( ~ spl14_1
| ~ spl14_3 ),
inference(avatar_split_clause,[],[f207,f278,f270]) ).
fof(f284,plain,
( ~ subset(sK7,sK7)
| spl14_1
| ~ spl14_2 ),
inference(superposition,[],[f271,f276]) ).
fof(f285,plain,
( $false
| spl14_1
| ~ spl14_2 ),
inference(resolution,[],[f210,f284]) ).
fof(f286,plain,
( spl14_1
| ~ spl14_2 ),
inference(avatar_contradiction_clause,[],[f285]) ).
fof(f287,plain,
( ~ subset(empty_set,singleton(sK8))
| spl14_1
| ~ spl14_3 ),
inference(superposition,[],[f271,f280]) ).
fof(f288,plain,
( $false
| spl14_1
| ~ spl14_3 ),
inference(forward_subsumption_resolution,[],[f287,f222]) ).
fof(f289,plain,
( spl14_1
| ~ spl14_3 ),
inference(avatar_contradiction_clause,[],[f288]) ).
fof(f396,plain,
( sK7 = set_intersection2(sK7,singleton(sK8))
| ~ spl14_1 ),
inference(resolution,[],[f218,f272]) ).
fof(f462,plain,
( ! [X0] :
( ~ in(X0,sK7)
| in(X0,singleton(sK8)) )
| ~ spl14_1 ),
inference(superposition,[],[f265,f396]) ).
fof(f463,plain,
( in(sK1(sK7),singleton(sK8))
| empty_set = sK7
| ~ spl14_1 ),
inference(resolution,[],[f462,f162]) ).
fof(f465,plain,
( in(sK1(sK7),singleton(sK8))
| ~ spl14_1
| spl14_3 ),
inference(forward_subsumption_resolution,[],[f463,f279]) ).
fof(f471,plain,
( sK8 = sK1(sK7)
| ~ spl14_1
| spl14_3 ),
inference(resolution,[],[f465,f253]) ).
fof(f481,plain,
( in(sK8,sK7)
| empty_set = sK7
| ~ spl14_1
| spl14_3 ),
inference(superposition,[],[f162,f471]) ).
fof(f482,plain,
( in(sK8,sK7)
| ~ spl14_1
| spl14_3 ),
inference(forward_subsumption_resolution,[],[f481,f279]) ).
fof(f566,plain,
( sK7 = singleton(sK8)
| ~ subset(singleton(sK8),sK7)
| ~ spl14_1 ),
inference(resolution,[],[f156,f272]) ).
fof(f568,plain,
( ~ subset(singleton(sK8),sK7)
| ~ spl14_1
| spl14_2 ),
inference(forward_subsumption_resolution,[],[f566,f275]) ).
fof(f569,plain,
( ~ in(sK8,sK7)
| ~ spl14_1
| spl14_2 ),
inference(resolution,[],[f568,f201]) ).
fof(f571,plain,
( $false
| ~ spl14_1
| spl14_2
| spl14_3 ),
inference(forward_subsumption_resolution,[],[f569,f482]) ).
fof(f572,plain,
( ~ spl14_1
| spl14_2
| spl14_3 ),
inference(avatar_contradiction_clause,[],[f571]) ).
cnf(s1,plain,
( spl14_1
| spl14_2
| spl14_3 ),
inference(sat_conversion,[],[f281]) ).
cnf(s2,plain,
( ~ spl14_1
| ~ spl14_2 ),
inference(sat_conversion,[],[f282]) ).
cnf(s3,plain,
( ~ spl14_1
| ~ spl14_3 ),
inference(sat_conversion,[],[f283]) ).
cnf(s4,plain,
( spl14_1
| ~ spl14_2 ),
inference(sat_conversion,[],[f286]) ).
cnf(s5,plain,
( spl14_1
| ~ spl14_3 ),
inference(sat_conversion,[],[f289]) ).
cnf(s6,plain,
( ~ spl14_1
| spl14_2
| spl14_3 ),
inference(sat_conversion,[],[f572]) ).
cnf(s7,plain,
spl14_1,
inference(rat,[],[s1,s4,s5]) ).
cnf(s8,plain,
~ spl14_3,
inference(rat,[],[s3,s7]) ).
cnf(s9,plain,
~ spl14_2,
inference(rat,[],[s2,s7]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s6,s8,s7,s9]) ).
fof(f573,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU146+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 % Computer : n018.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 28 03:46:24 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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.83/0.95 % (2974703)Detected formulas, will run a generic FOF schedule.
% 0.83/0.95 % (2974713)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3789437583:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.83/0.95 % (2974709)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=2913069267:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.83/0.95 % (2974712)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1376475240:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.83/0.95 % (2974711)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1814178401:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.83/0.95 % (2974708)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=1003694961:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.83/0.95 % (2974714)dis-21_1_sil=8000:lcm=predicate:random_seed=1151989379: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.83/0.95 % (2974710)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=2744411986:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.83/0.95 % (2974713)First to succeed.
% 0.83/0.95 % (2974713)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2974703"
% 0.83/0.95 % (2974711)Also succeeded, but the first one will report.
% 0.83/0.95 % (2974712)Instruction limit reached!
% 0.83/0.95 % (2974712)------------------------------
% 0.83/0.95 % (2974712)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.83/0.95 % (2974712)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.95 % (2974712)CaDiCaL version: 2.1.3
% 0.83/0.95 % (2974712)Termination reason: Instruction limit
% 0.83/0.95 % (2974712)Termination phase: Saturation
% 0.83/0.95 % (2974712)Time elapsed: 0.074 s
% 0.83/0.95 % (2974712)Peak memory usage: 89 MB
% 0.83/0.95 % (2974712)Instructions burned: 120 (million)
% 0.83/0.95 % (2974714)Instruction limit reached!
% 0.83/0.95 % (2974714)------------------------------
% 0.83/0.95 % (2974714)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.83/0.95 % (2974714)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.83/0.95 % (2974714)CaDiCaL version: 2.1.3
% 0.83/0.95 % (2974714)Termination reason: Instruction limit
% 0.83/0.95 % (2974714)Termination phase: Saturation
% 0.83/0.95 % (2974714)Time elapsed: 0.084 s
% 0.83/0.95 % (2974714)Peak memory usage: 89 MB
% 0.83/0.95 % (2974714)Instructions burned: 130 (million)
% 0.83/0.95 % (2974713)Refutation found. Thanks to Tanya!
% 0.83/0.95 % SZS status Theorem for theBenchmark
% 0.83/0.95 % SZS output start Proof for theBenchmark
% See solution above
% 2.72/1.15 % (2974713)------------------------------
% 2.72/1.15 % (2974713)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.72/1.15 % (2974713)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.72/1.15 % (2974713)CaDiCaL version: 2.1.3
% 2.72/1.15 % (2974713)Termination reason: Refutation
% 2.72/1.15 % (2974713)Time elapsed: 0.008 s
% 2.72/1.15 % (2974713)Peak memory usage: 90 MB
% 2.72/1.15 % (2974713)Instructions burned: 16 (million)
% 2.72/1.15 % (2974713)------------------------------
% 2.72/1.15 % (2974713)------------------------------
% 2.72/1.15 % (2974703)Success in time 0.32 s
% 2.72/1.15 % Vampire exiting
%------------------------------------------------------------------------------