%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM539+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:15:39 PM UTC 2026
% Result : Theorem 4.06s 6.54s
% Output : Refutation 4.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 64 ( 17 unt; 2 def)
% Number of atoms : 256 ( 56 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 332 ( 140 ~; 142 |; 37 &)
% ( 7 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 83 ( 0 sgn 77 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,X0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(f23,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
fof(f35,axiom,
! [X0,X1] :
( ( aElementOf0(X0,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( ( sdtlseqdt0(X0,X1)
& sdtlseqdt0(X1,X0) )
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessASymm) ).
fof(f47,axiom,
! [X0] :
( ( aSubsetOf0(X0,szNzAzT0)
& X0 != slcrc0 )
=> ! [X1] :
( X1 = szmzizndt0(X0)
<=> ( aElementOf0(X1,X0)
& ! [X2] :
( aElementOf0(X2,X0)
=> sdtlseqdt0(X1,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefMin) ).
fof(f49,axiom,
( aSubsetOf0(xS,szNzAzT0)
& aSubsetOf0(xT,szNzAzT0)
& xS != slcrc0
& xT != slcrc0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1779) ).
fof(f50,axiom,
( aElementOf0(szmzizndt0(xS),xT)
& aElementOf0(szmzizndt0(xT),xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1802) ).
fof(f51,conjecture,
szmzizndt0(xS) = szmzizndt0(xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f52,negated_conjecture,
szmzizndt0(xS) != szmzizndt0(xT),
inference(negated_conjecture,[status(cth)],[f51]) ).
fof(f59,plain,
szmzizndt0(xS) != szmzizndt0(xT),
inference(flattening,[],[f52]) ).
fof(f67,plain,
! [X0] :
( ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) ) ) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f102,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(ennf_transformation,[],[f35]) ).
fof(f103,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(flattening,[],[f102]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( X1 = szmzizndt0(X0)
<=> ( aElementOf0(X1,X0)
& ! [X2] :
( sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,X0) ) ) )
| ~ aSubsetOf0(X0,szNzAzT0)
| slcrc0 = X0 ),
inference(ennf_transformation,[],[f47]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( X1 = szmzizndt0(X0)
<=> ( aElementOf0(X1,X0)
& ! [X2] :
( sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,X0) ) ) )
| ~ aSubsetOf0(X0,szNzAzT0)
| slcrc0 = X0 ),
inference(flattening,[],[f119]) ).
fof(f133,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ~ aSet0(X1)
| ? [X2] :
( ~ aElementOf0(X2,X0)
& aElementOf0(X2,X1) ) )
& ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) ) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f67]) ).
fof(f134,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ~ aSet0(X1)
| ? [X2] :
( ~ aElementOf0(X2,X0)
& aElementOf0(X2,X1) ) )
& ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) ) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(flattening,[],[f133]) ).
fof(f135,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ~ aSet0(X1)
| ? [X2] :
( ~ aElementOf0(X2,X0)
& aElementOf0(X2,X1) ) )
& ( ( aSet0(X1)
& ! [X3] :
( aElementOf0(X3,X0)
| ~ aElementOf0(X3,X1) ) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(rectify,[],[f134]) ).
fof(f136,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ~ aSet0(X1)
| ( ~ aElementOf0(sK5(X0,X1),X0)
& aElementOf0(sK5(X0,X1),X1) ) )
& ( ( aSet0(X1)
& ! [X3] :
( aElementOf0(X3,X0)
| ~ aElementOf0(X3,X1) ) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X2,sK5(X0,X1))],[f135]) ).
fof(f154,plain,
! [X0] :
( ! [X1] :
( ( X1 = szmzizndt0(X0)
| ~ aElementOf0(X1,X0)
| ? [X2] :
( ~ sdtlseqdt0(X1,X2)
& aElementOf0(X2,X0) ) )
& ( ( aElementOf0(X1,X0)
& ! [X2] :
( sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,X0) ) )
| szmzizndt0(X0) != X1 ) )
| ~ aSubsetOf0(X0,szNzAzT0)
| slcrc0 = X0 ),
inference(nnf_transformation,[],[f120]) ).
fof(f155,plain,
! [X0] :
( ! [X1] :
( ( X1 = szmzizndt0(X0)
| ~ aElementOf0(X1,X0)
| ? [X2] :
( ~ sdtlseqdt0(X1,X2)
& aElementOf0(X2,X0) ) )
& ( ( aElementOf0(X1,X0)
& ! [X2] :
( sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,X0) ) )
| szmzizndt0(X0) != X1 ) )
| ~ aSubsetOf0(X0,szNzAzT0)
| slcrc0 = X0 ),
inference(flattening,[],[f154]) ).
fof(f156,plain,
! [X0] :
( ! [X1] :
( ( X1 = szmzizndt0(X0)
| ~ aElementOf0(X1,X0)
| ? [X2] :
( ~ sdtlseqdt0(X1,X2)
& aElementOf0(X2,X0) ) )
& ( ( aElementOf0(X1,X0)
& ! [X3] :
( sdtlseqdt0(X1,X3)
| ~ aElementOf0(X3,X0) ) )
| szmzizndt0(X0) != X1 ) )
| ~ aSubsetOf0(X0,szNzAzT0)
| slcrc0 = X0 ),
inference(rectify,[],[f155]) ).
fof(f157,plain,
! [X0] :
( ! [X1] :
( ( X1 = szmzizndt0(X0)
| ~ aElementOf0(X1,X0)
| ( ~ sdtlseqdt0(X1,sK10(X0,X1))
& aElementOf0(sK10(X0,X1),X0) ) )
& ( ( aElementOf0(X1,X0)
& ! [X3] :
( sdtlseqdt0(X1,X3)
| ~ aElementOf0(X3,X0) ) )
| szmzizndt0(X0) != X1 ) )
| ~ aSubsetOf0(X0,szNzAzT0)
| slcrc0 = X0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X2,sK10(X0,X1))],[f156]) ).
fof(f169,plain,
! [X3,X0,X1] :
( aElementOf0(X3,X0)
| ~ aElementOf0(X3,X1)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f208,plain,
aSet0(szNzAzT0),
inference(cnf_transformation,[],[f23]) ).
fof(f222,plain,
! [X0,X1] :
( ~ sdtlseqdt0(X0,X1)
| X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f235,plain,
! [X3,X0,X1] :
( sdtlseqdt0(X1,X3)
| ~ aElementOf0(X3,X0)
| szmzizndt0(X0) != X1
| ~ aSubsetOf0(X0,szNzAzT0)
| slcrc0 = X0 ),
inference(cnf_transformation,[],[f157]) ).
fof(f236,plain,
! [X0,X1] :
( aElementOf0(X1,X0)
| szmzizndt0(X0) != X1
| ~ aSubsetOf0(X0,szNzAzT0)
| slcrc0 = X0 ),
inference(cnf_transformation,[],[f157]) ).
fof(f243,plain,
slcrc0 != xT,
inference(cnf_transformation,[],[f49]) ).
fof(f244,plain,
slcrc0 != xS,
inference(cnf_transformation,[],[f49]) ).
fof(f245,plain,
aSubsetOf0(xT,szNzAzT0),
inference(cnf_transformation,[],[f49]) ).
fof(f246,plain,
aSubsetOf0(xS,szNzAzT0),
inference(cnf_transformation,[],[f49]) ).
fof(f247,plain,
aElementOf0(szmzizndt0(xT),xS),
inference(cnf_transformation,[],[f50]) ).
fof(f248,plain,
aElementOf0(szmzizndt0(xS),xT),
inference(cnf_transformation,[],[f50]) ).
fof(f249,plain,
szmzizndt0(xS) != szmzizndt0(xT),
inference(cnf_transformation,[],[f59]) ).
fof(f258,plain,
! [X0] :
( aElementOf0(szmzizndt0(X0),X0)
| ~ aSubsetOf0(X0,szNzAzT0)
| slcrc0 = X0 ),
inference(equality_resolution,[],[f236]) ).
fof(f259,plain,
! [X3,X0] :
( sdtlseqdt0(szmzizndt0(X0),X3)
| ~ aElementOf0(X3,X0)
| ~ aSubsetOf0(X0,szNzAzT0)
| slcrc0 = X0 ),
inference(equality_resolution,[],[f235]) ).
fof(f311,plain,
! [X0,X1] :
( ~ aElementOf0(szmzizndt0(X0),szNzAzT0)
| ~ sdtlseqdt0(X1,szmzizndt0(X0))
| szmzizndt0(X0) = X1
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,X0)
| ~ aSubsetOf0(X0,szNzAzT0)
| slcrc0 = X0 ),
inference(resolution,[],[f222,f259]) ).
fof(f717,plain,
! [X2,X0,X1] :
( ~ sdtlseqdt0(X0,szmzizndt0(X1))
| szmzizndt0(X1) = X0
| ~ aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X0,X1)
| ~ aSubsetOf0(X1,szNzAzT0)
| slcrc0 = X1
| ~ aElementOf0(szmzizndt0(X1),X2)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ aSet0(szNzAzT0) ),
inference(resolution,[],[f311,f169]) ).
fof(f724,plain,
! [X2,X0,X1] :
( ~ sdtlseqdt0(X0,szmzizndt0(X1))
| szmzizndt0(X1) = X0
| ~ aElementOf0(X0,X1)
| ~ aSubsetOf0(X1,szNzAzT0)
| slcrc0 = X1
| ~ aElementOf0(szmzizndt0(X1),X2)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ aSet0(szNzAzT0) ),
inference(forward_subsumption_resolution,[],[f717,f169]) ).
fof(f738,plain,
! [X2,X0,X1] :
( ~ aSubsetOf0(X1,szNzAzT0)
| szmzizndt0(X1) = X0
| ~ aElementOf0(X0,X1)
| ~ sdtlseqdt0(X0,szmzizndt0(X1))
| slcrc0 = X1
| ~ aElementOf0(szmzizndt0(X1),X2)
| ~ aSubsetOf0(X2,szNzAzT0) ),
inference(forward_subsumption_resolution,[],[f724,f208]) ).
fof(f1476,plain,
! [X0,X1] :
( szmzizndt0(xT) = X0
| ~ aElementOf0(X0,xT)
| ~ sdtlseqdt0(X0,szmzizndt0(xT))
| slcrc0 = xT
| ~ aElementOf0(szmzizndt0(xT),X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
inference(resolution,[],[f738,f245]) ).
fof(f1482,plain,
! [X0,X1] :
( szmzizndt0(xT) = X0
| ~ aElementOf0(X0,xT)
| ~ sdtlseqdt0(X0,szmzizndt0(xT))
| ~ aElementOf0(szmzizndt0(xT),X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
inference(forward_subsumption_resolution,[],[f1476,f243]) ).
fof(f1485,definition,
( spl12_113
<=> ! [X1] :
( ~ aElementOf0(szmzizndt0(xT),X1)
| ~ aSubsetOf0(X1,szNzAzT0) ) ),
introduced(definition,[new_symbols(definition,[spl12_113])],[avatar_definition]) ).
fof(f1486,plain,
( ! [X1] :
( ~ aElementOf0(szmzizndt0(xT),X1)
| ~ aSubsetOf0(X1,szNzAzT0) )
| ~ spl12_113 ),
inference(avatar_component_clause,[],[f1485]) ).
fof(f1488,definition,
( spl12_114
<=> ! [X0] :
( szmzizndt0(xT) = X0
| ~ sdtlseqdt0(X0,szmzizndt0(xT))
| ~ aElementOf0(X0,xT) ) ),
introduced(definition,[new_symbols(definition,[spl12_114])],[avatar_definition]) ).
fof(f1489,plain,
( ! [X0] :
( ~ aElementOf0(X0,xT)
| ~ sdtlseqdt0(X0,szmzizndt0(xT))
| szmzizndt0(xT) = X0 )
| ~ spl12_114 ),
inference(avatar_component_clause,[],[f1488]) ).
fof(f1490,plain,
( spl12_113
| spl12_114 ),
inference(avatar_split_clause,[],[f1482,f1488,f1485]) ).
fof(f1712,plain,
( ~ aSubsetOf0(xT,szNzAzT0)
| ~ aSubsetOf0(xT,szNzAzT0)
| slcrc0 = xT
| ~ spl12_113 ),
inference(resolution,[],[f1486,f258]) ).
fof(f1716,plain,
( ~ aSubsetOf0(xT,szNzAzT0)
| slcrc0 = xT
| ~ spl12_113 ),
inference(duplicate_literal_removal,[],[f1712]) ).
fof(f1727,plain,
( slcrc0 = xT
| ~ spl12_113 ),
inference(forward_subsumption_resolution,[],[f1716,f245]) ).
fof(f1728,plain,
( $false
| ~ spl12_113 ),
inference(forward_subsumption_resolution,[],[f1727,f243]) ).
fof(f1729,plain,
~ spl12_113,
inference(avatar_contradiction_clause,[],[f1728]) ).
fof(f2400,plain,
( ~ sdtlseqdt0(szmzizndt0(xS),szmzizndt0(xT))
| szmzizndt0(xS) = szmzizndt0(xT)
| ~ spl12_114 ),
inference(resolution,[],[f1489,f248]) ).
fof(f2408,plain,
( ~ sdtlseqdt0(szmzizndt0(xS),szmzizndt0(xT))
| ~ spl12_114 ),
inference(forward_subsumption_resolution,[],[f2400,f249]) ).
fof(f2422,plain,
( ~ aElementOf0(szmzizndt0(xT),xS)
| ~ aSubsetOf0(xS,szNzAzT0)
| slcrc0 = xS
| ~ spl12_114 ),
inference(resolution,[],[f2408,f259]) ).
fof(f2452,plain,
( ~ aSubsetOf0(xS,szNzAzT0)
| slcrc0 = xS
| ~ spl12_114 ),
inference(forward_subsumption_resolution,[],[f2422,f247]) ).
fof(f2453,plain,
( slcrc0 = xS
| ~ spl12_114 ),
inference(forward_subsumption_resolution,[],[f2452,f246]) ).
fof(f2454,plain,
( $false
| ~ spl12_114 ),
inference(forward_subsumption_resolution,[],[f2453,f244]) ).
fof(f2455,plain,
~ spl12_114,
inference(avatar_contradiction_clause,[],[f2454]) ).
cnf(s97,plain,
( spl12_113
| spl12_114 ),
inference(sat_conversion,[],[f1490]) ).
cnf(s121,plain,
~ spl12_113,
inference(sat_conversion,[],[f1729]) ).
cnf(s211,plain,
~ spl12_114,
inference(sat_conversion,[],[f2455]) ).
cnf(s218,plain,
$false,
inference(rat,[],[s97,s211,s121]) ).
fof(f2456,plain,
$false,
inference(avatar_sat_refutation,[],[s218]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM539+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.37 % Computer : n001.cluster.edu
% 0.11/5.37 % Model : x86_64 x86_64
% 0.11/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.37 % Memory : 8046.5625MB
% 0.11/5.37 % OS : Linux 6.8.0-71-generic
% 0.11/5.37 % CPULimit : 300
% 0.11/5.37 % WCLimit : 300
% 0.11/5.37 % DateTime : Sun Sep 27 20:29:22 UTC 2026
% 0.11/5.37 % CPUTime :
% 0.11/5.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/5.41 Running first-order theorem proving
% 0.13/5.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.96/6.35 % (3929416)Detected formulas, will run a generic FOF schedule.
% 2.96/6.35 % (3929424)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1965484060:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.96/6.35 % (3929424)Refutation not found, incomplete strategy
% 2.96/6.35 % (3929424)------------------------------
% 2.96/6.35 % (3929424)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.96/6.35 % (3929424)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/6.35 % (3929424)CaDiCaL version: 2.1.3
% 2.96/6.35 % (3929424)Termination reason: Refutation not found, incomplete strategy
% 2.96/6.35 % (3929424)Time elapsed: 0.002 s
% 2.96/6.35 % (3929424)Peak memory usage: 88 MB
% 2.96/6.35 % (3929424)Instructions burned: 2 (million)
% 2.96/6.35 % (3929422)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=589288337:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.96/6.35 % (3929421)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=3243201379:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.96/6.35 % (3929423)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=1403728167:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.96/6.35 % (3929427)dis-21_1_sil=8000:lcm=predicate:random_seed=2775197832: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.96/6.35 % (3929425)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=89458533:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.96/6.35 % (3929426)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=21354729:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.96/6.35 % (3929426)First to succeed.
% 2.96/6.35 % (3929426)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3929416"
% 2.96/6.35 % (3929427)Instruction limit reached!
% 2.96/6.35 % (3929427)------------------------------
% 2.96/6.35 % (3929427)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.96/6.35 % (3929427)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/6.35 % (3929427)CaDiCaL version: 2.1.3
% 2.96/6.35 % (3929427)Termination reason: Instruction limit
% 2.96/6.35 % (3929427)Termination phase: Saturation
% 2.96/6.35 % (3929427)Time elapsed: 0.052 s
% 2.96/6.35 % (3929427)Peak memory usage: 88 MB
% 2.96/6.35 % (3929427)Instructions burned: 132 (million)
% 2.96/6.35 % (3929425)Instruction limit reached!
% 2.96/6.35 % (3929425)------------------------------
% 2.96/6.35 % (3929425)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.96/6.35 % (3929425)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/6.35 % (3929425)CaDiCaL version: 2.1.3
% 2.96/6.35 % (3929425)Termination reason: Instruction limit
% 2.96/6.35 % (3929425)Termination phase: Saturation
% 2.96/6.35 % (3929425)Time elapsed: 0.060 s
% 2.96/6.35 % (3929425)Peak memory usage: 87 MB
% 2.96/6.35 % (3929425)Instructions burned: 121 (million)
% 2.96/6.35 % (3929424)------------------------------
% 2.96/6.35 % (3929424)------------------------------
% 2.96/6.35 % (3929436)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4172240861:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.96/6.35 % (3929435)lrs+10_1_sil=8000:sp=occurrence:random_seed=2434098634:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.96/6.35 % (3929437)lrs+1011_1_sil=32000:sp=occurrence:random_seed=249930147:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.96/6.35 % (3929436)Refutation not found, incomplete strategy
% 2.96/6.35 % (3929436)------------------------------
% 2.96/6.35 % (3929436)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.96/6.35 % (3929436)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.96/6.35 % (3929436)CaDiCaL version: 2.1.3
% 2.96/6.35 % (3929436)Termination reason: Refutation not found, incomplete strategy
% 2.96/6.35 % (3929436)Time elapsed: 0.003 s
% 2.96/6.35 % (3929436)Peak memory usage: 88 MB
% 2.96/6.35 % (3929436)Instructions burned: 2 (million)
% 2.96/6.35 % (3929426)Refutation found. Thanks to Tanya!
% 4.06/6.54 % SZS status Theorem for theBenchmark
% 4.06/6.54 % SZS output start Proof for theBenchmark
% See solution above
% 4.06/6.54 % (3929426)------------------------------
% 4.06/6.54 % (3929426)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.06/6.54 % (3929426)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/6.54 % (3929426)CaDiCaL version: 2.1.3
% 4.06/6.54 % (3929426)Termination reason: Refutation
% 4.06/6.54 % (3929426)Time elapsed: 0.049 s
% 4.06/6.54 % (3929426)Peak memory usage: 91 MB
% 4.06/6.54 % (3929426)Instructions burned: 67 (million)
% 4.06/6.54 % (3929426)------------------------------
% 4.06/6.54 % (3929426)------------------------------
% 4.06/6.54 % (3929416)Success in time 0.488 s
% 4.06/6.54 % Vampire exiting
%------------------------------------------------------------------------------