%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET083+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:40:01 PM UTC 2026
% Result : Theorem 2.90s 1.31s
% Output : Refutation 3.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 16
% Syntax : Number of formulae : 93 ( 24 unt; 4 def)
% Number of atoms : 245 ( 40 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 246 ( 94 ~; 89 |; 48 &)
% ( 10 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 133 ( 0 sgn 123 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subclass_defn) ).
fof(f2,axiom,
! [X0] : subclass(X0,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',class_elements_are_sets) ).
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_defn) ).
fof(f5,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_set_defn) ).
fof(f7,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordered_pair_defn) ).
fof(f8,axiom,
! [X0,X1,X2,X3] :
( member(ordered_pair(X0,X1),cross_product(X2,X3))
<=> ( member(X0,X2)
& member(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cross_product_defn) ).
fof(f11,axiom,
! [X0,X1] :
( member(ordered_pair(X0,X1),element_relation)
<=> ( member(X1,universal_class)
& member(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_relation_defn) ).
fof(f29,axiom,
! [X0] :
( inductive(X0)
<=> ( member(null_class,X0)
& subclass(image(successor_relation,X0),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inductive_defn) ).
fof(f30,axiom,
? [X0] :
( member(X0,universal_class)
& inductive(X0)
& ! [X1] :
( inductive(X1)
=> subclass(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',infinity) ).
fof(f41,axiom,
! [X0] :
( X0 != null_class
=> ? [X1] :
( member(X1,universal_class)
& member(X1,X0)
& disjoint(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',regularity) ).
fof(f44,conjecture,
! [X0,X1] :
( ( singleton(X0) = singleton(X1)
& member(X0,universal_class) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_identified_by_element1) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] :
( ( singleton(X0) = singleton(X1)
& member(X0,universal_class) )
=> X0 = X1 ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f47,plain,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f51,plain,
? [X0] :
( member(X0,universal_class)
& inductive(X0)
& ! [X1] :
( subclass(X0,X1)
| ~ inductive(X1) ) ),
inference(ennf_transformation,[],[f30]) ).
fof(f57,plain,
! [X0] :
( ? [X1] :
( member(X1,universal_class)
& member(X1,X0)
& disjoint(X1,X0) )
| null_class = X0 ),
inference(ennf_transformation,[],[f41]) ).
fof(f60,plain,
? [X0,X1] :
( X0 != X1
& singleton(X0) = singleton(X1)
& member(X0,universal_class) ),
inference(ennf_transformation,[],[f45]) ).
fof(f61,plain,
? [X0,X1] :
( X0 != X1
& singleton(X0) = singleton(X1)
& member(X0,universal_class) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subclass(X0,X1) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f63,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subclass(X0,X1) ) ),
inference(rectify,[],[f62]) ).
fof(f64,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subclass(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f63]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| ( X0 != X1
& X0 != X2 ) )
& ( ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| ( X0 != X1
& X0 != X2 ) )
& ( ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f67]) ).
fof(f69,plain,
! [X0,X1,X2,X3] :
( ( member(ordered_pair(X0,X1),cross_product(X2,X3))
| ~ member(X0,X2)
| ~ member(X1,X3) )
& ( ( member(X0,X2)
& member(X1,X3) )
| ~ member(ordered_pair(X0,X1),cross_product(X2,X3)) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f70,plain,
! [X0,X1,X2,X3] :
( ( member(ordered_pair(X0,X1),cross_product(X2,X3))
| ~ member(X0,X2)
| ~ member(X1,X3) )
& ( ( member(X0,X2)
& member(X1,X3) )
| ~ member(ordered_pair(X0,X1),cross_product(X2,X3)) ) ),
inference(flattening,[],[f69]) ).
fof(f71,plain,
! [X0,X1] :
( ( member(ordered_pair(X0,X1),element_relation)
| ~ member(X1,universal_class)
| ~ member(X0,X1) )
& ( ( member(X1,universal_class)
& member(X0,X1) )
| ~ member(ordered_pair(X0,X1),element_relation) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f72,plain,
! [X0,X1] :
( ( member(ordered_pair(X0,X1),element_relation)
| ~ member(X1,universal_class)
| ~ member(X0,X1) )
& ( ( member(X1,universal_class)
& member(X0,X1) )
| ~ member(ordered_pair(X0,X1),element_relation) ) ),
inference(flattening,[],[f71]) ).
fof(f87,plain,
! [X0] :
( ( inductive(X0)
| ~ member(null_class,X0)
| ~ subclass(image(successor_relation,X0),X0) )
& ( ( member(null_class,X0)
& subclass(image(successor_relation,X0),X0) )
| ~ inductive(X0) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f88,plain,
! [X0] :
( ( inductive(X0)
| ~ member(null_class,X0)
| ~ subclass(image(successor_relation,X0),X0) )
& ( ( member(null_class,X0)
& subclass(image(successor_relation,X0),X0) )
| ~ inductive(X0) ) ),
inference(flattening,[],[f87]) ).
fof(f89,plain,
( member(sK1,universal_class)
& inductive(sK1)
& ! [X1] :
( subclass(sK1,X1)
| ~ inductive(X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f51]) ).
fof(f102,plain,
! [X0] :
( ( member(sK4(X0),universal_class)
& member(sK4(X0),X0)
& disjoint(sK4(X0),X0) )
| null_class = X0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X1,sK4(X0))],[f57]) ).
fof(f104,plain,
( sK6 != sK7
& singleton(sK6) = singleton(sK7)
& member(sK6,universal_class) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f61]) ).
fof(f105,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subclass(X0,X1) ),
inference(cnf_transformation,[],[f64]) ).
fof(f108,plain,
! [X0] : subclass(X0,universal_class),
inference(cnf_transformation,[],[f2]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f68]) ).
fof(f115,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| X0 != X1 ),
inference(cnf_transformation,[],[f68]) ).
fof(f116,plain,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f5]) ).
fof(f117,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f118,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
inference(cnf_transformation,[],[f7]) ).
fof(f119,plain,
! [X2,X3,X0,X1] :
( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| member(X1,X3) ),
inference(cnf_transformation,[],[f70]) ).
fof(f121,plain,
! [X2,X3,X0,X1] :
( member(ordered_pair(X0,X1),cross_product(X2,X3))
| ~ member(X0,X2)
| ~ member(X1,X3) ),
inference(cnf_transformation,[],[f70]) ).
fof(f126,plain,
! [X0,X1] :
( ~ member(ordered_pair(X0,X1),element_relation)
| member(X1,universal_class) ),
inference(cnf_transformation,[],[f72]) ).
fof(f127,plain,
! [X0,X1] :
( member(ordered_pair(X0,X1),element_relation)
| ~ member(X1,universal_class)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f72]) ).
fof(f161,plain,
! [X0] :
( ~ inductive(X0)
| member(null_class,X0) ),
inference(cnf_transformation,[],[f88]) ).
fof(f164,plain,
inductive(sK1),
inference(cnf_transformation,[],[f89]) ).
fof(f187,plain,
! [X0] :
( member(sK4(X0),X0)
| null_class = X0 ),
inference(cnf_transformation,[],[f102]) ).
fof(f192,plain,
member(sK6,universal_class),
inference(cnf_transformation,[],[f104]) ).
fof(f193,plain,
singleton(sK6) = singleton(sK7),
inference(cnf_transformation,[],[f104]) ).
fof(f194,plain,
sK6 != sK7,
inference(cnf_transformation,[],[f104]) ).
fof(f197,plain,
! [X2,X1] :
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(equality_resolution,[],[f115]) ).
fof(f201,plain,
member(null_class,sK1),
inference(resolution,[],[f161,f164]) ).
fof(f214,plain,
! [X0] :
( member(X0,singleton(X0))
| ~ member(X0,universal_class) ),
inference(superposition,[],[f197,f117]) ).
fof(f215,plain,
( member(sK7,singleton(sK6))
| ~ member(sK7,universal_class) ),
inference(superposition,[],[f214,f193]) ).
fof(f217,definition,
( spl8_1
<=> member(sK7,universal_class) ),
introduced(definition,[new_symbols(definition,[spl8_1])],[avatar_definition]) ).
fof(f219,plain,
( ~ member(sK7,universal_class)
| spl8_1 ),
inference(avatar_component_clause,[],[f217]) ).
fof(f221,definition,
( spl8_2
<=> member(sK7,singleton(sK6)) ),
introduced(definition,[new_symbols(definition,[spl8_2])],[avatar_definition]) ).
fof(f223,plain,
( member(sK7,singleton(sK6))
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f221]) ).
fof(f224,plain,
( ~ spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f215,f221,f217]) ).
fof(f239,plain,
( ! [X0] :
( ~ member(sK7,X0)
| ~ subclass(X0,universal_class) )
| spl8_1 ),
inference(resolution,[],[f105,f219]) ).
fof(f241,plain,
( ! [X0] : ~ member(sK7,X0)
| spl8_1 ),
inference(forward_subsumption_resolution,[],[f239,f108]) ).
fof(f392,plain,
! [X0,X1] :
( ~ member(X1,singleton(X0))
| X0 = X1
| X0 = X1 ),
inference(superposition,[],[f112,f117]) ).
fof(f393,plain,
! [X0,X1] :
( ~ member(X1,singleton(X0))
| X0 = X1 ),
inference(duplicate_literal_removal,[],[f392]) ).
fof(f395,plain,
! [X0] : ordered_pair(X0,sK7) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(sK6))),
inference(superposition,[],[f118,f193]) ).
fof(f404,plain,
! [X0] : ordered_pair(X0,sK7) = ordered_pair(X0,sK6),
inference(forward_demodulation,[],[f395,f118]) ).
fof(f405,plain,
! [X2,X0,X1] :
( ~ member(ordered_pair(X0,sK6),cross_product(X1,X2))
| member(sK7,X2) ),
inference(superposition,[],[f119,f404]) ).
fof(f408,plain,
! [X0] :
( ~ member(ordered_pair(X0,sK6),element_relation)
| member(sK7,universal_class) ),
inference(superposition,[],[f126,f404]) ).
fof(f415,plain,
( ! [X0] : ~ member(ordered_pair(X0,sK6),element_relation)
| spl8_1 ),
inference(forward_subsumption_resolution,[],[f408,f219]) ).
fof(f416,plain,
( ! [X2,X0,X1] : ~ member(ordered_pair(X0,sK6),cross_product(X1,X2))
| spl8_1 ),
inference(forward_subsumption_resolution,[],[f405,f241]) ).
fof(f425,plain,
( ! [X0] :
( ~ member(sK6,universal_class)
| ~ member(X0,sK6) )
| spl8_1 ),
inference(resolution,[],[f415,f127]) ).
fof(f427,plain,
( ! [X0] : ~ member(X0,sK6)
| spl8_1 ),
inference(forward_subsumption_resolution,[],[f425,f192]) ).
fof(f429,plain,
( null_class = sK6
| spl8_1 ),
inference(resolution,[],[f427,f187]) ).
fof(f477,plain,
( ! [X2,X0,X1] : ~ member(ordered_pair(X0,null_class),cross_product(X1,X2))
| spl8_1 ),
inference(forward_demodulation,[],[f416,f429]) ).
fof(f488,plain,
( ! [X2,X0,X1] :
( ~ member(X0,X1)
| ~ member(null_class,X2) )
| spl8_1 ),
inference(resolution,[],[f477,f121]) ).
fof(f491,definition,
( spl8_18
<=> ! [X2] : ~ member(null_class,X2) ),
introduced(definition,[new_symbols(definition,[spl8_18])],[avatar_definition]) ).
fof(f492,plain,
( ! [X2] : ~ member(null_class,X2)
| ~ spl8_18 ),
inference(avatar_component_clause,[],[f491]) ).
fof(f494,definition,
( spl8_19
<=> ! [X0,X1] : ~ member(X0,X1) ),
introduced(definition,[new_symbols(definition,[spl8_19])],[avatar_definition]) ).
fof(f495,plain,
( ! [X0,X1] : ~ member(X0,X1)
| ~ spl8_19 ),
inference(avatar_component_clause,[],[f494]) ).
fof(f496,plain,
( spl8_18
| spl8_19
| spl8_1 ),
inference(avatar_split_clause,[],[f488,f217,f494,f491]) ).
fof(f593,plain,
( $false
| ~ spl8_18 ),
inference(resolution,[],[f492,f201]) ).
fof(f595,plain,
~ spl8_18,
inference(avatar_contradiction_clause,[],[f593]) ).
fof(f606,plain,
( $false
| ~ spl8_19 ),
inference(resolution,[],[f495,f116]) ).
fof(f639,plain,
~ spl8_19,
inference(avatar_contradiction_clause,[],[f606]) ).
fof(f724,plain,
( sK6 = sK7
| ~ spl8_2 ),
inference(resolution,[],[f223,f393]) ).
fof(f725,plain,
( $false
| ~ spl8_2 ),
inference(forward_subsumption_resolution,[],[f724,f194]) ).
fof(f726,plain,
~ spl8_2,
inference(avatar_contradiction_clause,[],[f725]) ).
cnf(s1,plain,
( ~ spl8_1
| spl8_2 ),
inference(sat_conversion,[],[f224]) ).
cnf(s14,plain,
( spl8_1
| spl8_18
| spl8_19 ),
inference(sat_conversion,[],[f496]) ).
cnf(s22,plain,
~ spl8_18,
inference(sat_conversion,[],[f595]) ).
cnf(s27,plain,
~ spl8_19,
inference(sat_conversion,[],[f639]) ).
cnf(s31,plain,
~ spl8_2,
inference(sat_conversion,[],[f726]) ).
cnf(s32,plain,
spl8_1,
inference(rat,[],[s14,s27,s22]) ).
cnf(s38,plain,
$false,
inference(rat,[],[s1,s31,s32]) ).
fof(f727,plain,
$false,
inference(avatar_sat_refutation,[],[s38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET083+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n011.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 00:34:45 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.90/1.31 % (2911121)Detected formulas, will run a generic FOF schedule.
% 2.90/1.31 % (2911127)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=3825261363:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.90/1.31 % (2911132)dis-21_1_sil=8000:lcm=predicate:random_seed=2812451419: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.90/1.31 % (2911130)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3267696974:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.90/1.31 % (2911128)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=1137171565:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.90/1.31 % (2911126)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=335244668:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.90/1.31 % (2911129)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2481780734:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.90/1.31 % (2911131)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3325374863:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.90/1.31 % (2911130)Refutation not found, incomplete strategy
% 2.90/1.31 % (2911130)------------------------------
% 2.90/1.31 % (2911130)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.31 % (2911130)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.31 % (2911130)CaDiCaL version: 2.1.3
% 2.90/1.31 % (2911130)Termination reason: Refutation not found, incomplete strategy
% 2.90/1.31 % (2911130)Time elapsed: 0.001 s
% 2.90/1.31 % (2911129)Refutation not found, incomplete strategy
% 2.90/1.31 % (2911129)------------------------------
% 2.90/1.31 % (2911129)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.31 % (2911130)Peak memory usage: 87 MB
% 2.90/1.31 % (2911129)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.31 % (2911129)CaDiCaL version: 2.1.3
% 2.90/1.31 % (2911129)Termination reason: Refutation not found, incomplete strategy
% 2.90/1.31 % (2911129)Time elapsed: 0.001 s
% 2.90/1.31 % (2911129)Peak memory usage: 88 MB
% 2.90/1.31 % (2911131)First to succeed.
% 2.90/1.31 % (2911131)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2911121"
% 2.90/1.31 % (2911132)Instruction limit reached!
% 2.90/1.31 % (2911132)------------------------------
% 2.90/1.31 % (2911132)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.31 % (2911132)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.31 % (2911132)CaDiCaL version: 2.1.3
% 2.90/1.31 % (2911132)Termination reason: Instruction limit
% 2.90/1.31 % (2911132)Termination phase: Saturation
% 2.90/1.31 % (2911132)Time elapsed: 0.077 s
% 2.90/1.31 % (2911132)Peak memory usage: 89 MB
% 2.90/1.31 % (2911132)Instructions burned: 130 (million)
% 2.90/1.31 % (2911129)------------------------------
% 2.90/1.31 % (2911129)------------------------------
% 2.90/1.31 % (2911140)lrs+10_1_sil=8000:sp=occurrence:random_seed=309822959:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.90/1.31 % (2911130)------------------------------
% 2.90/1.31 % (2911130)------------------------------
% 2.90/1.31 % (2911140)Also succeeded, but the first one will report.
% 2.90/1.31 % (2911131)Refutation found. Thanks to Tanya!
% 2.90/1.31 % SZS status Theorem for theBenchmark
% 2.90/1.31 % SZS output start Proof for theBenchmark
% See solution above
% 3.84/1.51 % (2911131)------------------------------
% 3.84/1.51 % (2911131)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.84/1.51 % (2911131)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.84/1.51 % (2911131)CaDiCaL version: 2.1.3
% 3.84/1.51 % (2911131)Termination reason: Refutation
% 3.84/1.51 % (2911131)Time elapsed: 0.020 s
% 3.84/1.51 % (2911131)Peak memory usage: 90 MB
% 3.84/1.51 % (2911131)Instructions burned: 24 (million)
% 3.84/1.51 % (2911131)------------------------------
% 3.84/1.51 % (2911131)------------------------------
% 3.84/1.51 % (2911121)Success in time 0.451 s
% 3.84/1.51 % Vampire exiting
%------------------------------------------------------------------------------