%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET887+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 : n009.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:14 PM UTC 2026
% Result : Theorem 2.77s 1.27s
% Output : Refutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of formulae : 81 ( 17 unt; 5 def)
% Number of atoms : 248 ( 138 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 286 ( 119 ~; 114 |; 42 &)
% ( 10 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 101 ( 0 sgn 92 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f4,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X0
| X3 = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f6,axiom,
! [X0,X1,X2] :
( subset(X0,unordered_pair(X1,X2))
<=> ~ ( X0 != empty_set
& X0 != singleton(X1)
& X0 != singleton(X2)
& X0 != unordered_pair(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l46_zfmisc_1) ).
fof(f11,conjecture,
! [X0,X1,X2,X3] :
~ ( subset(unordered_pair(X0,X1),unordered_pair(X2,X3))
& X0 != X2
& X0 != X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_zfmisc_1) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X2,X3] :
~ ( subset(unordered_pair(X0,X1),unordered_pair(X2,X3))
& X0 != X2
& X0 != X3 ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f16,plain,
! [X0,X1,X2] :
( subset(X0,unordered_pair(X1,X2))
<=> ( empty_set = X0
| singleton(X1) = X0
| singleton(X2) = X0
| unordered_pair(X1,X2) = X0 ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f18,plain,
? [X0,X1,X2,X3] :
( subset(unordered_pair(X0,X1),unordered_pair(X2,X3))
& X0 != X2
& X0 != X3 ),
inference(ennf_transformation,[],[f12]) ).
fof(f19,plain,
! [X0,X1,X2] :
( X0 = X1
| unordered_pair(X1,X2) != singleton(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f20,plain,
! [X0] :
( ( X0 = empty_set
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f21,plain,
! [X0] :
( ( X0 = empty_set
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f20]) ).
fof(f22,plain,
! [X0] :
( ( X0 = empty_set
| in(sK0(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f21]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f24]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ( ( ( sK1(X0,X1,X2) != X0
& sK1(X0,X1,X2) != X1 )
| ~ in(sK1(X0,X1,X2),X2) )
& ( sK1(X0,X1,X2) = X0
| sK1(X0,X1,X2) = X1
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f25]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( subset(X0,unordered_pair(X1,X2))
| ( empty_set != X0
& singleton(X1) != X0
& singleton(X2) != X0
& unordered_pair(X1,X2) != X0 ) )
& ( empty_set = X0
| singleton(X1) = X0
| singleton(X2) = X0
| unordered_pair(X1,X2) = X0
| ~ subset(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ( subset(X0,unordered_pair(X1,X2))
| ( empty_set != X0
& singleton(X1) != X0
& singleton(X2) != X0
& unordered_pair(X1,X2) != X0 ) )
& ( empty_set = X0
| singleton(X1) = X0
| singleton(X2) = X0
| unordered_pair(X1,X2) = X0
| ~ subset(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f27]) ).
fof(f31,plain,
( subset(unordered_pair(sK4,sK5),unordered_pair(sK6,sK7))
& sK4 != sK6
& sK4 != sK7 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6),skolemize(X3,sK7)],[f18]) ).
fof(f34,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f22]) ).
fof(f36,plain,
! [X2,X0,X1,X4] :
( X0 = X4
| X1 = X4
| ~ in(X4,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f26]) ).
fof(f37,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f26]) ).
fof(f38,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f26]) ).
fof(f43,plain,
! [X2,X0,X1] :
( ~ subset(X0,unordered_pair(X1,X2))
| singleton(X1) = X0
| singleton(X2) = X0
| unordered_pair(X1,X2) = X0
| empty_set = X0 ),
inference(cnf_transformation,[],[f28]) ).
fof(f52,plain,
sK4 != sK7,
inference(cnf_transformation,[],[f31]) ).
fof(f53,plain,
sK4 != sK6,
inference(cnf_transformation,[],[f31]) ).
fof(f54,plain,
subset(unordered_pair(sK4,sK5),unordered_pair(sK6,sK7)),
inference(cnf_transformation,[],[f31]) ).
fof(f55,plain,
! [X2,X0,X1] :
( unordered_pair(X1,X2) != singleton(X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f19]) ).
fof(f56,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f34]) ).
fof(f57,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f38]) ).
fof(f58,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f57]) ).
fof(f59,plain,
! [X2,X0,X4] :
( in(X4,X2)
| unordered_pair(X0,X4) != X2 ),
inference(equality_resolution,[],[f37]) ).
fof(f60,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f59]) ).
fof(f61,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X1 = X4
| X0 = X4 ),
inference(equality_resolution,[],[f36]) ).
fof(f100,plain,
( unordered_pair(sK4,sK5) = singleton(sK6)
| unordered_pair(sK4,sK5) = singleton(sK7)
| unordered_pair(sK4,sK5) = unordered_pair(sK6,sK7)
| empty_set = unordered_pair(sK4,sK5) ),
inference(resolution,[],[f43,f54]) ).
fof(f107,definition,
( spl8_1
<=> empty_set = unordered_pair(sK4,sK5) ),
introduced(definition,[new_symbols(definition,[spl8_1])],[avatar_definition]) ).
fof(f109,plain,
( empty_set = unordered_pair(sK4,sK5)
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f107]) ).
fof(f111,definition,
( spl8_2
<=> unordered_pair(sK4,sK5) = unordered_pair(sK6,sK7) ),
introduced(definition,[new_symbols(definition,[spl8_2])],[avatar_definition]) ).
fof(f113,plain,
( unordered_pair(sK4,sK5) = unordered_pair(sK6,sK7)
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f111]) ).
fof(f115,definition,
( spl8_3
<=> unordered_pair(sK4,sK5) = singleton(sK7) ),
introduced(definition,[new_symbols(definition,[spl8_3])],[avatar_definition]) ).
fof(f117,plain,
( unordered_pair(sK4,sK5) = singleton(sK7)
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f115]) ).
fof(f119,definition,
( spl8_4
<=> unordered_pair(sK4,sK5) = singleton(sK6) ),
introduced(definition,[new_symbols(definition,[spl8_4])],[avatar_definition]) ).
fof(f121,plain,
( unordered_pair(sK4,sK5) = singleton(sK6)
| ~ spl8_4 ),
inference(avatar_component_clause,[],[f119]) ).
fof(f122,plain,
( spl8_1
| spl8_2
| spl8_3
| spl8_4 ),
inference(avatar_split_clause,[],[f100,f119,f115,f111,f107]) ).
fof(f128,plain,
( in(sK6,unordered_pair(sK4,sK5))
| ~ spl8_2 ),
inference(superposition,[],[f58,f113]) ).
fof(f129,plain,
( in(sK7,unordered_pair(sK4,sK5))
| ~ spl8_2 ),
inference(superposition,[],[f60,f113]) ).
fof(f143,plain,
( sK5 = sK6
| sK4 = sK6
| ~ spl8_2 ),
inference(resolution,[],[f128,f61]) ).
fof(f145,plain,
( sK5 = sK6
| ~ spl8_2 ),
inference(forward_subsumption_resolution,[],[f143,f53]) ).
fof(f159,plain,
( in(sK7,unordered_pair(sK4,sK6))
| ~ spl8_2 ),
inference(forward_demodulation,[],[f129,f145]) ).
fof(f160,plain,
( sK6 = sK7
| sK4 = sK7
| ~ spl8_2 ),
inference(resolution,[],[f159,f61]) ).
fof(f162,plain,
( sK6 = sK7
| ~ spl8_2 ),
inference(forward_subsumption_resolution,[],[f160,f52]) ).
fof(f188,plain,
( unordered_pair(sK4,sK5) = unordered_pair(sK6,sK6)
| ~ spl8_2 ),
inference(superposition,[],[f113,f162]) ).
fof(f192,plain,
( unordered_pair(sK4,sK6) = unordered_pair(sK6,sK6)
| ~ spl8_2 ),
inference(forward_demodulation,[],[f188,f145]) ).
fof(f216,definition,
( spl8_8
<=> unordered_pair(sK4,sK6) = unordered_pair(sK6,sK6) ),
introduced(definition,[new_symbols(definition,[spl8_8])],[avatar_definition]) ).
fof(f218,plain,
( unordered_pair(sK4,sK6) = unordered_pair(sK6,sK6)
| ~ spl8_8 ),
inference(avatar_component_clause,[],[f216]) ).
fof(f253,plain,
( ! [X0] :
( singleton(X0) != singleton(sK7)
| sK4 = X0 )
| ~ spl8_3 ),
inference(superposition,[],[f55,f117]) ).
fof(f293,plain,
( sK4 = sK7
| ~ spl8_3 ),
inference(equality_resolution,[],[f253]) ).
fof(f294,plain,
( $false
| ~ spl8_3 ),
inference(forward_subsumption_resolution,[],[f293,f52]) ).
fof(f295,plain,
~ spl8_3,
inference(avatar_contradiction_clause,[],[f294]) ).
fof(f330,plain,
( spl8_8
| ~ spl8_2 ),
inference(avatar_split_clause,[],[f192,f111,f216]) ).
fof(f424,plain,
( in(sK4,empty_set)
| ~ spl8_1 ),
inference(superposition,[],[f58,f109]) ).
fof(f438,plain,
( $false
| ~ spl8_1 ),
inference(forward_subsumption_resolution,[],[f424,f56]) ).
fof(f439,plain,
~ spl8_1,
inference(avatar_contradiction_clause,[],[f438]) ).
fof(f527,plain,
( ! [X0] :
( ~ in(X0,unordered_pair(sK4,sK6))
| sK6 = X0
| sK6 = X0 )
| ~ spl8_8 ),
inference(superposition,[],[f61,f218]) ).
fof(f542,plain,
( ! [X0] :
( ~ in(X0,unordered_pair(sK4,sK6))
| sK6 = X0 )
| ~ spl8_8 ),
inference(duplicate_literal_removal,[],[f527]) ).
fof(f566,plain,
( sK4 = sK6
| ~ spl8_8 ),
inference(resolution,[],[f542,f58]) ).
fof(f580,plain,
( $false
| ~ spl8_8 ),
inference(forward_subsumption_resolution,[],[f566,f53]) ).
fof(f581,plain,
~ spl8_8,
inference(avatar_contradiction_clause,[],[f580]) ).
fof(f607,plain,
( ! [X0] :
( singleton(X0) != singleton(sK6)
| sK4 = X0 )
| ~ spl8_4 ),
inference(superposition,[],[f55,f121]) ).
fof(f669,plain,
( sK4 = sK6
| ~ spl8_4 ),
inference(equality_resolution,[],[f607]) ).
fof(f670,plain,
( $false
| ~ spl8_4 ),
inference(forward_subsumption_resolution,[],[f669,f53]) ).
fof(f671,plain,
~ spl8_4,
inference(avatar_contradiction_clause,[],[f670]) ).
cnf(s1,plain,
( spl8_1
| spl8_2
| spl8_3
| spl8_4 ),
inference(sat_conversion,[],[f122]) ).
cnf(s10,plain,
~ spl8_3,
inference(sat_conversion,[],[f295]) ).
cnf(s12,plain,
( ~ spl8_2
| spl8_8 ),
inference(sat_conversion,[],[f330]) ).
cnf(s22,plain,
~ spl8_1,
inference(sat_conversion,[],[f439]) ).
cnf(s34,plain,
~ spl8_8,
inference(sat_conversion,[],[f581]) ).
cnf(s48,plain,
~ spl8_4,
inference(sat_conversion,[],[f671]) ).
cnf(s51,plain,
~ spl8_2,
inference(rat,[],[s12,s34]) ).
cnf(s52,plain,
$false,
inference(rat,[],[s1,s48,s10,s51,s22]) ).
fof(f672,plain,
$false,
inference(avatar_sat_refutation,[],[s52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET887+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.10/0.36 % Computer : n009.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 03:06:45 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.77/1.27 % (2624556)Detected formulas, will run a generic FOF schedule.
% 2.77/1.27 % (2624564)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=344979002:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.77/1.27 % (2624564)Refutation not found, incomplete strategy
% 2.77/1.27 % (2624564)------------------------------
% 2.77/1.27 % (2624564)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.77/1.27 % (2624564)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.77/1.27 % (2624564)CaDiCaL version: 2.1.3
% 2.77/1.27 % (2624564)Termination reason: Refutation not found, incomplete strategy
% 2.77/1.27 % (2624564)Time elapsed: 0.001 s
% 2.77/1.27 % (2624564)Peak memory usage: 88 MB
% 2.77/1.27 % (2624566)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3950555236:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.77/1.27 % (2624565)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1534230625:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.77/1.27 % (2624567)dis-21_1_sil=8000:lcm=predicate:random_seed=2398575473: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.77/1.27 % (2624561)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=3940530110:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.77/1.27 % (2624563)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=308021216:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.77/1.27 % (2624562)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=4108439128:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.77/1.27 % (2624565)Refutation not found, incomplete strategy
% 2.77/1.27 % (2624565)------------------------------
% 2.77/1.27 % (2624565)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.77/1.27 % (2624565)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.77/1.27 % (2624565)CaDiCaL version: 2.1.3
% 2.77/1.27 % (2624565)Termination reason: Refutation not found, incomplete strategy
% 2.77/1.27 % (2624565)Time elapsed: 0.001 s
% 2.77/1.27 % (2624565)Peak memory usage: 88 MB
% 2.77/1.27 % (2624566)First to succeed.
% 2.77/1.27 % (2624566)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2624556"
% 2.77/1.27 % (2624567)Instruction limit reached!
% 2.77/1.27 % (2624567)------------------------------
% 2.77/1.27 % (2624567)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.77/1.27 % (2624567)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.77/1.27 % (2624567)CaDiCaL version: 2.1.3
% 2.77/1.27 % (2624567)Termination reason: Instruction limit
% 2.77/1.27 % (2624567)Termination phase: Saturation
% 2.77/1.27 % (2624567)Time elapsed: 0.080 s
% 2.77/1.27 % (2624567)Peak memory usage: 89 MB
% 2.77/1.27 % (2624567)Instructions burned: 130 (million)
% 2.77/1.27 % (2624564)------------------------------
% 2.77/1.27 % (2624564)------------------------------
% 2.77/1.27 % (2624576)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3920875866:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.77/1.27 % (2624576)Also succeeded, but the first one will report.
% 2.77/1.27 % (2624575)lrs+10_1_sil=8000:sp=occurrence:random_seed=359525485:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.77/1.27 % (2624575)Also succeeded, but the first one will report.
% 2.77/1.27 % (2624565)------------------------------
% 2.77/1.27 % (2624565)------------------------------
% 2.77/1.27 % (2624566)Refutation found. Thanks to Tanya!
% 2.77/1.27 % SZS status Theorem for theBenchmark
% 2.77/1.27 % SZS output start Proof for theBenchmark
% See solution above
% 3.61/1.46 % (2624566)------------------------------
% 3.61/1.46 % (2624566)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.46 % (2624566)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.46 % (2624566)CaDiCaL version: 2.1.3
% 3.61/1.46 % (2624566)Termination reason: Refutation
% 3.61/1.46 % (2624566)Time elapsed: 0.020 s
% 3.61/1.46 % (2624566)Peak memory usage: 90 MB
% 3.61/1.46 % (2624566)Instructions burned: 23 (million)
% 3.61/1.46 % (2624566)------------------------------
% 3.61/1.46 % (2624566)------------------------------
% 3.61/1.46 % (2624556)Success in time 0.427 s
% 3.61/1.46 % Vampire exiting
%------------------------------------------------------------------------------