%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO314^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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 : Wed Sep 30 08:47:25 AM UTC 2026
% Result : Theorem 0.20s 0.29s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 57 ( 7 unt; 0 typ; 5 def)
% Number of atoms : 383 ( 119 equ; 0 cnn)
% Maximal formula atoms : 16 ( 6 avg)
% Number of connectives : 398 ( 107 ~; 89 |; 57 &; 134 @)
% ( 10 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 53 ( 53 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 19 usr; 12 con; 0-4 aty)
% Number of variables : 119 ( 0 sgn 55 !; 64 ?; 119 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_4,type,
sK0: $i > $o ).
thf(func_def_7,type,
sK3: $i > $o ).
thf(func_def_8,type,
sK4: $i > $o ).
thf(func_def_9,type,
sK5: $i > $o ).
thf(func_def_12,type,
vNOT: $o > $o ).
thf(func_def_14,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_15,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_16,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(f1,conjecture,
( ? [X0: $i > $o,X2: $i,X1: $i > $o,X3: $i] :
( ~ ( X1 @ z )
& ~ ( X0 @ X3 )
& ( X1 @ X3 )
& ( X0 @ X2 ) )
<=> ? [X2: $i,X0: $i > $o,X1: $i > $o,X3: $i] :
( ( X1 @ X3 )
& ( X0 @ X2 )
& ~ ( X0 @ X3 )
& ~ ( X1 @ z ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cSILLYWFF2) ).
thf(f2,negated_conjecture,
~ ( ? [X0: $i > $o,X2: $i,X1: $i > $o,X3: $i] :
( ~ ( X1 @ z )
& ~ ( X0 @ X3 )
& ( X1 @ X3 )
& ( X0 @ X2 ) )
<=> ? [X2: $i,X0: $i > $o,X1: $i > $o,X3: $i] :
( ( X1 @ X3 )
& ( X0 @ X2 )
& ~ ( X0 @ X3 )
& ~ ( X1 @ z ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ? [X0: $i > $o,X1: $i,X2: $i > $o,X3: $i] :
( ~ ( X2 @ z )
& ~ ( X0 @ X3 )
& ( X2 @ X3 )
& ( X0 @ X1 ) )
<=> ? [X4: $i,X5: $i > $o,X6: $i > $o,X7: $i] :
( ( X6 @ X7 )
& ( X5 @ X4 )
& ~ ( X5 @ X7 )
& ~ ( X6 @ z ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ? [X0: $i > $o,X1: $i,X2: $i > $o,X3: $i] :
( ( $true
!= ( X2 @ z ) )
& ( ( X0 @ X3 )
!= $true )
& ( ( X2 @ X3 )
= $true )
& ( $true
= ( X0 @ X1 ) ) )
<=> ? [X4: $i,X5: $i > $o,X6: $i > $o,X7: $i] :
( ( $true
= ( X6 @ X7 ) )
& ( $true
= ( X5 @ X4 ) )
& ( $true
!= ( X5 @ X7 ) )
& ( $true
!= ( X6 @ z ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
~ ( ? [X5: $i > $o,X4: $i,X7: $i,X6: $i > $o] :
( ( $true
= ( X6 @ X7 ) )
& ( $true
!= ( X5 @ X7 ) )
& ( $true
!= ( X6 @ z ) )
& ( $true
= ( X5 @ X4 ) ) )
<=> ? [X2: $i > $o,X0: $i > $o,X1: $i,X3: $i] :
( ( $true
!= ( X2 @ z ) )
& ( ( X2 @ X3 )
= $true )
& ( $true
= ( X0 @ X1 ) )
& ( ( X0 @ X3 )
!= $true ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
( ? [X2: $i > $o,X0: $i > $o,X1: $i,X3: $i] :
( ( $true
!= ( X2 @ z ) )
& ( ( X2 @ X3 )
= $true )
& ( $true
= ( X0 @ X1 ) )
& ( ( X0 @ X3 )
!= $true ) )
<~> ? [X5: $i > $o,X4: $i,X7: $i,X6: $i > $o] :
( ( $true
= ( X6 @ X7 ) )
& ( $true
!= ( X5 @ X7 ) )
& ( $true
!= ( X6 @ z ) )
& ( $true
= ( X5 @ X4 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f7,plain,
( ( ! [X5: $i > $o,X4: $i,X7: $i,X6: $i > $o] :
( ( $true
!= ( X6 @ X7 ) )
| ( $true
= ( X5 @ X7 ) )
| ( $true
= ( X6 @ z ) )
| ( $true
!= ( X5 @ X4 ) ) )
| ! [X2: $i > $o,X0: $i > $o,X1: $i,X3: $i] :
( ( $true
= ( X2 @ z ) )
| ( ( X2 @ X3 )
!= $true )
| ( $true
!= ( X0 @ X1 ) )
| ( ( X0 @ X3 )
= $true ) ) )
& ( ? [X5: $i > $o,X4: $i,X7: $i,X6: $i > $o] :
( ( $true
= ( X6 @ X7 ) )
& ( $true
!= ( X5 @ X7 ) )
& ( $true
!= ( X6 @ z ) )
& ( $true
= ( X5 @ X4 ) ) )
| ? [X2: $i > $o,X0: $i > $o,X1: $i,X3: $i] :
( ( $true
!= ( X2 @ z ) )
& ( ( X2 @ X3 )
= $true )
& ( $true
= ( X0 @ X1 ) )
& ( ( X0 @ X3 )
!= $true ) ) ) ),
inference(nnf_transformation,[],[f6]) ).
thf(f8,plain,
( ( ! [X0: $i > $o,X1: $i,X2: $i,X3: $i > $o] :
( ( $true
!= ( X3 @ X2 ) )
| ( ( X0 @ X2 )
= $true )
| ( $true
= ( X3 @ z ) )
| ( $true
!= ( X0 @ X1 ) ) )
| ! [X4: $i > $o,X5: $i > $o,X6: $i,X7: $i] :
( ( ( X4 @ z )
= $true )
| ( ( X4 @ X7 )
!= $true )
| ( $true
!= ( X5 @ X6 ) )
| ( $true
= ( X5 @ X7 ) ) ) )
& ( ? [X8: $i > $o,X9: $i,X10: $i,X11: $i > $o] :
( ( $true
= ( X11 @ X10 ) )
& ( ( X8 @ X10 )
!= $true )
& ( ( X11 @ z )
!= $true )
& ( $true
= ( X8 @ X9 ) ) )
| ? [X12: $i > $o,X13: $i > $o,X14: $i,X15: $i] :
( ( $true
!= ( X12 @ z ) )
& ( $true
= ( X12 @ X15 ) )
& ( $true
= ( X13 @ X14 ) )
& ( ( X13 @ X15 )
!= $true ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f9,plain,
( ( ! [X0: $i > $o,X1: $i,X2: $i,X3: $i > $o] :
( ( $true
!= ( X3 @ X2 ) )
| ( ( X0 @ X2 )
= $true )
| ( $true
= ( X3 @ z ) )
| ( $true
!= ( X0 @ X1 ) ) )
| ! [X4: $i > $o,X5: $i > $o,X6: $i,X7: $i] :
( ( ( X4 @ z )
= $true )
| ( ( X4 @ X7 )
!= $true )
| ( $true
!= ( X5 @ X6 ) )
| ( $true
= ( X5 @ X7 ) ) ) )
& ( ( ( $true
= ( sK3 @ sK2 ) )
& ( $true
!= ( sK0 @ sK2 ) )
& ( $true
!= ( sK3 @ z ) )
& ( $true
= ( sK0 @ sK1 ) ) )
| ( ( $true
!= ( sK4 @ z ) )
& ( ( sK4 @ sK7 )
= $true )
& ( ( sK5 @ sK6 )
= $true )
& ( ( sK5 @ sK7 )
!= $true ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7]),skolemize(X8,sK0),skolemize(X9,sK1),skolemize(X10,sK2),skolemize(X11,sK3),skolemize(X12,sK4),skolemize(X13,sK5),skolemize(X14,sK6),skolemize(X15,sK7)],[f8]) ).
thf(f10,plain,
( ( $true
= ( sK0 @ sK1 ) )
| ( ( sK5 @ sK7 )
!= $true ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f11,plain,
( ( ( sK5 @ sK6 )
= $true )
| ( $true
= ( sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f18,plain,
( ( ( sK5 @ sK7 )
!= $true )
| ( $true
!= ( sK0 @ sK2 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f19,plain,
( ( $true
!= ( sK0 @ sK2 ) )
| ( ( sK5 @ sK6 )
= $true ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f26,plain,
! [X2: $i,X3: $i > $o,X0: $i > $o,X1: $i,X6: $i,X7: $i,X4: $i > $o,X5: $i > $o] :
( ( $true
!= ( X5 @ X6 ) )
| ( ( X4 @ z )
= $true )
| ( ( X0 @ X2 )
= $true )
| ( $true
!= ( X3 @ X2 ) )
| ( $true
= ( X5 @ X7 ) )
| ( ( X4 @ X7 )
!= $true )
| ( $true
!= ( X0 @ X1 ) )
| ( $true
= ( X3 @ z ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f34,definition,
( spl8_2
<=> ( $true
= ( sK0 @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl8_2])],[avatar_definition]) ).
thf(f36,plain,
( ( $true
= ( sK0 @ sK1 ) )
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f34]) ).
thf(f49,definition,
( spl8_5
<=> ( ( sK5 @ sK7 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl8_5])],[avatar_definition]) ).
thf(f51,plain,
( ( ( sK5 @ sK7 )
!= $true )
| spl8_5 ),
inference(avatar_component_clause,[],[f49]) ).
thf(f52,plain,
( ~ spl8_5
| spl8_2 ),
inference(avatar_split_clause,[],[f10,f34,f49]) ).
thf(f54,definition,
( spl8_6
<=> ( ( sK5 @ sK6 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl8_6])],[avatar_definition]) ).
thf(f56,plain,
( ( ( sK5 @ sK6 )
= $true )
| ~ spl8_6 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f58,definition,
( spl8_7
<=> ( $true
= ( sK0 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl8_7])],[avatar_definition]) ).
thf(f60,plain,
( ( $true
!= ( sK0 @ sK2 ) )
| spl8_7 ),
inference(avatar_component_clause,[],[f58]) ).
thf(f61,plain,
( spl8_6
| ~ spl8_7 ),
inference(avatar_split_clause,[],[f19,f58,f54]) ).
thf(f63,plain,
( spl8_6
| spl8_2 ),
inference(avatar_split_clause,[],[f11,f34,f54]) ).
thf(f65,definition,
( spl8_8
<=> ! [X5: $i > $o,X4: $i > $o,X7: $i,X6: $i] :
( ( $true
!= ( X5 @ X6 ) )
| ( $true
= ( X5 @ X7 ) )
| ( ( X4 @ z )
= $true )
| ( ( X4 @ X7 )
!= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl8_8])],[avatar_definition]) ).
thf(f66,plain,
( ! [X6: $i,X7: $i,X4: $i > $o,X5: $i > $o] :
( ( $true
!= ( X5 @ X6 ) )
| ( ( X4 @ z )
= $true )
| ( $true
= ( X5 @ X7 ) )
| ( ( X4 @ X7 )
!= $true ) )
| ~ spl8_8 ),
inference(avatar_component_clause,[],[f65]) ).
thf(f67,plain,
( spl8_8
| spl8_8 ),
inference(avatar_split_clause,[],[f26,f65,f65]) ).
thf(f73,plain,
( ~ spl8_7
| ~ spl8_5 ),
inference(avatar_split_clause,[],[f18,f49,f58]) ).
thf(f82,plain,
( ! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( X2 @ X1 )
!= $true )
| ( X0 = X1 )
| ( $true
= ( X2 @ z ) ) )
| ~ spl8_8 ),
inference(leibniz_equality_elimination,[],[f66]) ).
thf(f97,plain,
( ! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( z = X0 ) )
| ~ spl8_8 ),
inference(leibniz_equality_elimination,[],[f82]) ).
thf(f138,plain,
( ! [X0: $i] :
( ( z = X0 )
| ( X0 != X0 ) )
| ~ spl8_8 ),
inference(equality_factoring,[],[f97]) ).
thf(f139,plain,
( ! [X0: $i,X1: $i] :
( ( z != X1 )
| ( X0 = X1 ) )
| ~ spl8_8 ),
inference(equality_factoring,[],[f97]) ).
thf(f140,plain,
( ! [X0: $i] : ( z = X0 )
| ~ spl8_8 ),
inference(trivial_inequality_removal,[],[f138]) ).
thf(f151,plain,
( ! [X0: $i,X1: $i] : ( X0 = X1 )
| ~ spl8_8 ),
inference(forward_subsumption_resolution,[],[f139,f140]) ).
thf(f162,plain,
( ! [X0: $i] :
( $true
= ( sK5 @ X0 ) )
| ~ spl8_6
| ~ spl8_8 ),
inference(constrained_superposition,[],[f56,f151]) ).
thf(f163,plain,
( ! [X0: $i] :
( $true
!= ( sK5 @ X0 ) )
| spl8_5
| ~ spl8_8 ),
inference(constrained_superposition,[],[f51,f151]) ).
thf(f176,plain,
( $false
| spl8_5
| ~ spl8_6
| ~ spl8_8 ),
inference(forward_subsumption_resolution,[],[f163,f162]) ).
thf(f177,plain,
( spl8_5
| ~ spl8_6
| ~ spl8_8 ),
inference(avatar_contradiction_clause,[],[f176]) ).
thf(f179,plain,
( ! [X0: $i] :
( $true
= ( sK0 @ X0 ) )
| ~ spl8_2
| ~ spl8_8 ),
inference(constrained_superposition,[],[f36,f151]) ).
thf(f199,plain,
( ! [X0: $i] :
( $true
!= ( sK0 @ X0 ) )
| spl8_7
| ~ spl8_8 ),
inference(constrained_superposition,[],[f60,f151]) ).
thf(f208,plain,
( $false
| ~ spl8_2
| spl8_7
| ~ spl8_8 ),
inference(forward_subsumption_resolution,[],[f199,f179]) ).
thf(f209,plain,
( ~ spl8_2
| spl8_7
| ~ spl8_8 ),
inference(avatar_contradiction_clause,[],[f208]) ).
cnf(s4,plain,
( spl8_2
| ~ spl8_5 ),
inference(sat_conversion,[],[f52]) ).
cnf(s5,plain,
( spl8_6
| ~ spl8_7 ),
inference(sat_conversion,[],[f61]) ).
cnf(s7,plain,
( spl8_2
| spl8_6 ),
inference(sat_conversion,[],[f63]) ).
cnf(s8,plain,
( spl8_8
| spl8_8 ),
inference(sat_conversion,[],[f67]) ).
cnf(s9,plain,
spl8_8,
inference(rat,[],[s8]) ).
cnf(s11,plain,
( ~ spl8_5
| ~ spl8_7 ),
inference(sat_conversion,[],[f73]) ).
cnf(s26,plain,
( spl8_5
| ~ spl8_6
| ~ spl8_8 ),
inference(sat_conversion,[],[f177]) ).
cnf(s29,plain,
( ~ spl8_2
| spl8_7
| ~ spl8_8 ),
inference(sat_conversion,[],[f209]) ).
cnf(s30,plain,
spl8_2,
inference(rat,[],[s26,s4,s7,s9]) ).
cnf(s31,plain,
spl8_7,
inference(rat,[],[s29,s9,s30]) ).
cnf(s32,plain,
~ spl8_5,
inference(rat,[],[s11,s31]) ).
cnf(s34,plain,
spl8_6,
inference(rat,[],[s5,s31]) ).
cnf(s35,plain,
$false,
inference(rat,[],[s26,s9,s34,s32]) ).
thf(f210,plain,
$false,
inference(avatar_sat_refutation,[],[s35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO314^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n001.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 16:50:51 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/0.23 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.29 % (1492115)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.29 % (1492124)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1147281269:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.29 % (1492126)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.20/0.29 % (1492126)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.20/0.29 % (1492125)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3560630410:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.29 % (1492122)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=551022237:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.29 % (1492120)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2316628842:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.29 % (1492121)lrs+10_16_si=on:nwc=1.5:random_seed=258087528:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.29 % (1492123)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=3046421007:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.20/0.29 % (1492126)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=131453963:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.29 % (1492124)Instruction limit reached!
% 0.20/0.29 % (1492124)------------------------------
% 0.20/0.29 % (1492124)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (1492124)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (1492124)CaDiCaL version: 2.1.3
% 0.20/0.29 % (1492124)Termination reason: Instruction limit
% 0.20/0.29 % (1492124)Termination phase: Saturation
% 0.20/0.29 % (1492124)Time elapsed: 0.007 s
% 0.20/0.29 % (1492124)Peak memory usage: 12 MB
% 0.20/0.29 % (1492124)Instructions burned: 28 (million)
% 0.20/0.29 % (1492122)Instruction limit reached!
% 0.20/0.29 % (1492122)------------------------------
% 0.20/0.29 % (1492122)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (1492122)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (1492122)CaDiCaL version: 2.1.3
% 0.20/0.29 % (1492122)Termination reason: Instruction limit
% 0.20/0.29 % (1492122)Termination phase: Saturation
% 0.20/0.29 % (1492122)Time elapsed: 0.003 s
% 0.20/0.29 % (1492122)Peak memory usage: 12 MB
% 0.20/0.29 % (1492122)Instructions burned: 4 (million)
% 0.20/0.29 % (1492120) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1492115-1492120"...
% 0.20/0.29 % (1492121) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1492115-1492121"...
% 0.20/0.29 % (1492120)...printing done.
% 0.20/0.29 % (1492125) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1492115-1492125"...
% 0.20/0.29 % (1492120)Refutation found. Thanks to Tanya!
% 0.20/0.29 % SZS status Theorem for theBenchmark
% 0.20/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.29 % (1492120)------------------------------
% 0.20/0.29 % (1492120)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (1492120)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (1492120)CaDiCaL version: 2.1.3
% 0.20/0.29 % (1492120)Termination reason: Refutation
% 0.20/0.29 % (1492120)Time elapsed: 0.006 s
% 0.20/0.29 % (1492120)Peak memory usage: 13 MB
% 0.20/0.29 % (1492120)Instructions burned: 8 (million)
% 0.20/0.29 % (1492115)Success in time 0.048 s
% 0.20/0.29 % Vampire exiting
%------------------------------------------------------------------------------