%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV299^5 : TPTP v9.3.1. Bugfixed v6.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:38:13 AM UTC 2026
% Result : Theorem 0.25s 0.37s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 2
% Syntax : Number of formulae : 35 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 299 ( 86 equ; 0 cnn)
% Maximal formula atoms : 5 ( 8 avg)
% Number of connectives : 321 ( 15 ~; 39 |; 26 &; 193 @)
% ( 0 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 202 ( 202 >; 0 *; 0 +; 0 <<)
% Number of symbols : 24 ( 20 usr; 3 con; 0-4 aty)
% ( 14 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 73 ( 22 ^; 45 !; 6 ?; 73 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cNAT: ( ( $i > $o ) > $o ) > $o ).
thf(func_def_1,type,
cSUCC: ( ( $i > $o ) > $o ) > ( $i > $o ) > $o ).
thf(func_def_2,type,
cZERO: ( $i > $o ) > $o ).
thf(func_def_4,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_5,type,
vIMP: $o > $o > $o ).
thf(func_def_6,type,
vAND: $o > $o > $o ).
thf(func_def_7,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_8,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_10,type,
vNOT: $o > $o ).
thf(func_def_11,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_14,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_16,type,
sK0: ( ( $i > $o ) > $o ) > $o ).
thf(func_def_17,type,
sK1: ( $i > $o ) > $o ).
thf(func_def_18,type,
sK2: ( $i > $o ) > $i ).
thf(func_def_19,type,
sK3: ( ( $i > $o ) > $o ) > ( ( $i > $o ) > $o ) > $o ).
thf(func_def_20,type,
sK4: ( ( ( $i > $o ) > $o ) > $o ) > ( $i > $o ) > $o ).
thf(func_def_21,type,
sK5: ( ( $i > $o ) > $o ) > ( $i > $o ) > $i ).
thf(f3,axiom,
( ( ^ [X0: ( $i > $o ) > $o] :
! [X1: ( ( $i > $o ) > $o ) > $o] :
( ( ( X1 @ cZERO )
& ! [X2: ( $i > $o ) > $o] :
( ( X1 @ X2 )
=> ( X1 @ ( cSUCC @ X2 ) ) ) )
=> ( X1 @ X0 ) ) )
= cNAT ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cNAT_def) ).
thf(f4,conjecture,
! [X0: ( ( $i > $o ) > $o ) > $o] :
( ( ! [X1: ( $i > $o ) > $o] :
( ( X0 @ X1 )
=> ( X0 @ ( cSUCC @ X1 ) ) )
& ( X0 @ cZERO ) )
=> ! [X2: ( $i > $o ) > $o] :
( ( cNAT @ X2 )
=> ( X0 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cINDUCTION) ).
thf(f5,negated_conjecture,
~ ! [X0: ( ( $i > $o ) > $o ) > $o] :
( ( ! [X1: ( $i > $o ) > $o] :
( ( X0 @ X1 )
=> ( X0 @ ( cSUCC @ X1 ) ) )
& ( X0 @ cZERO ) )
=> ! [X2: ( $i > $o ) > $o] :
( ( cNAT @ X2 )
=> ( X0 @ X2 ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
( ( ^ [X0: ( $i > $o ) > $o] :
! [X1: ( ( $i > $o ) > $o ) > $o] :
( ( ( X1 @ cZERO )
& ! [X2: ( $i > $o ) > $o] :
( ( X1 @ X2 )
=> ( X1 @ ( cSUCC @ X2 ) ) ) )
=> ( X1 @ X0 ) ) )
= cNAT ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
( cNAT
= ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cSUCC @ Y2 ) ) ) )
& ( Y1 @ cZERO ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f10,plain,
~ ! [X0: ( ( $i > $o ) > $o ) > $o] :
( ( ! [X1: ( $i > $o ) > $o] :
( ( X0 @ X1 )
=> ( X0 @ ( cSUCC @ X1 ) ) )
& ( X0 @ cZERO ) )
=> ! [X2: ( $i > $o ) > $o] :
( ( cNAT @ X2 )
=> ( X0 @ X2 ) ) ),
inference(rectify,[],[f5]) ).
thf(f11,plain,
~ ! [X0: ( ( $i > $o ) > $o ) > $o] :
( ( ( ( X0 @ cZERO )
= $true )
& ! [X1: ( $i > $o ) > $o] :
( ( ( X0 @ X1 )
= $true )
=> ( ( X0 @ ( cSUCC @ X1 ) )
= $true ) ) )
=> ! [X2: ( $i > $o ) > $o] :
( ( ( cNAT @ X2 )
= $true )
=> ( ( X0 @ X2 )
= $true ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f14,plain,
? [X0: ( ( $i > $o ) > $o ) > $o] :
( ? [X2: ( $i > $o ) > $o] :
( ( ( X0 @ X2 )
!= $true )
& ( ( cNAT @ X2 )
= $true ) )
& ( ( X0 @ cZERO )
= $true )
& ! [X1: ( $i > $o ) > $o] :
( ( ( X0 @ X1 )
!= $true )
| ( ( X0 @ ( cSUCC @ X1 ) )
= $true ) ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f15,plain,
? [X0: ( ( $i > $o ) > $o ) > $o] :
( ? [X2: ( $i > $o ) > $o] :
( ( ( X0 @ X2 )
!= $true )
& ( ( cNAT @ X2 )
= $true ) )
& ( ( X0 @ cZERO )
= $true )
& ! [X1: ( $i > $o ) > $o] :
( ( ( X0 @ X1 )
!= $true )
| ( ( X0 @ ( cSUCC @ X1 ) )
= $true ) ) ),
inference(flattening,[],[f14]) ).
thf(f16,plain,
? [X0: ( ( $i > $o ) > $o ) > $o] :
( ? [X1: ( $i > $o ) > $o] :
( ( ( X0 @ X1 )
!= $true )
& ( ( cNAT @ X1 )
= $true ) )
& ( ( X0 @ cZERO )
= $true )
& ! [X2: ( $i > $o ) > $o] :
( ( ( X0 @ X2 )
!= $true )
| ( ( X0 @ ( cSUCC @ X2 ) )
= $true ) ) ),
inference(rectify,[],[f15]) ).
thf(f17,plain,
( ( ( sK0 @ sK1 )
!= $true )
& ( ( cNAT @ sK1 )
= $true )
& ( $true
= ( sK0 @ cZERO ) )
& ! [X2: ( $i > $o ) > $o] :
( ( ( sK0 @ X2 )
!= $true )
| ( ( sK0 @ ( cSUCC @ X2 ) )
= $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f16]) ).
thf(f18,plain,
( cNAT
= ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cSUCC @ Y2 ) ) ) )
& ( Y1 @ cZERO ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f19,plain,
! [X2: ( $i > $o ) > $o] :
( ( ( sK0 @ ( cSUCC @ X2 ) )
= $true )
| ( ( sK0 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f20,plain,
( $true
= ( sK0 @ cZERO ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f21,plain,
( ( cNAT @ sK1 )
= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f22,plain,
( ( sK0 @ sK1 )
!= $true ),
inference(cnf_transformation,[],[f17]) ).
thf(f64,plain,
! [X1: ( $i > $o ) > $o] :
( ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cSUCC @ Y2 ) ) ) )
& ( Y1 @ cZERO ) )
=> ( Y1 @ Y0 ) ) )
@ X1 )
= ( cNAT @ X1 ) ),
inference(argument_congruence,[],[f18]) ).
thf(f65,plain,
! [X1: ( $i > $o ) > $o] :
( ( ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cSUCC @ Y2 ) ) ) )
& ( Y1 @ cZERO ) )
=> ( Y1 @ Y0 ) ) )
@ X1 )
= $true )
| ( ( cNAT @ X1 )
= $false ) ),
inference(iff_proxy_clausification,[],[f64]) ).
thf(f77,plain,
! [X1: ( $i > $o ) > $o] :
( ( ( cNAT @ X1 )
= $false )
| ( ( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y0: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y1: ( $i > $o ) > $o] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cSUCC @ Y1 ) ) ) )
& ( Y0 @ cZERO ) )
=> ( Y0 @ X1 ) ) )
= $true ) ),
inference(beta-eta_normalization,[],[f65]) ).
thf(f78,plain,
! [X2: ( ( $i > $o ) > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( ( cNAT @ X1 )
= $false )
| ( ( ^ [Y0: ( ( $i > $o ) > $o ) > $o] :
( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y1: ( $i > $o ) > $o] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cSUCC @ Y1 ) ) ) )
& ( Y0 @ cZERO ) )
=> ( Y0 @ X1 ) )
@ X2 )
= $true ) ),
inference(pi_proxy_clausification,[],[f77]) ).
thf(f79,plain,
! [X2: ( ( $i > $o ) > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( ( cNAT @ X1 )
= $false )
| ( ( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y0: ( $i > $o ) > $o] :
( ( X2 @ Y0 )
=> ( X2 @ ( cSUCC @ Y0 ) ) ) )
& ( X2 @ cZERO ) )
=> ( X2 @ X1 ) )
= $true ) ),
inference(beta-eta_normalization,[],[f78]) ).
thf(f80,plain,
! [X2: ( ( $i > $o ) > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y0: ( $i > $o ) > $o] :
( ( X2 @ Y0 )
=> ( X2 @ ( cSUCC @ Y0 ) ) ) )
& ( X2 @ cZERO ) )
= $false )
| ( ( cNAT @ X1 )
= $false )
| ( ( X2 @ X1 )
= $true ) ),
inference(imp_proxy_clausification,[],[f79]) ).
thf(f81,plain,
! [X2: ( ( $i > $o ) > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( ( cNAT @ X1 )
= $false )
| ( ( X2 @ X1 )
= $true )
| ( $false
= ( X2 @ cZERO ) )
| ( ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y0: ( $i > $o ) > $o] :
( ( X2 @ Y0 )
=> ( X2 @ ( cSUCC @ Y0 ) ) ) )
= $false ) ),
inference(and_proxy_clausification,[],[f80]) ).
thf(f82,plain,
! [X2: ( ( $i > $o ) > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( ( cNAT @ X1 )
= $false )
| ( ( ^ [Y0: ( $i > $o ) > $o] :
( ( X2 @ Y0 )
=> ( X2 @ ( cSUCC @ Y0 ) ) )
@ ( sK4 @ X2 ) )
= $false )
| ( ( X2 @ X1 )
= $true )
| ( $false
= ( X2 @ cZERO ) ) ),
inference(sigma_proxy_clausification,[],[f81]) ).
thf(f83,plain,
! [X2: ( ( $i > $o ) > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( $false
= ( X2 @ cZERO ) )
| ( ( X2 @ X1 )
= $true )
| ( ( ( X2 @ ( sK4 @ X2 ) )
=> ( X2 @ ( cSUCC @ ( sK4 @ X2 ) ) ) )
= $false )
| ( ( cNAT @ X1 )
= $false ) ),
inference(beta-eta_normalization,[],[f82]) ).
thf(f84,plain,
! [X2: ( ( $i > $o ) > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( ( X2 @ ( cSUCC @ ( sK4 @ X2 ) ) )
= $false )
| ( ( cNAT @ X1 )
= $false )
| ( ( X2 @ X1 )
= $true )
| ( $false
= ( X2 @ cZERO ) ) ),
inference(imp_proxy_clausification,[],[f83]) ).
thf(f85,plain,
! [X2: ( ( $i > $o ) > $o ) > $o,X1: ( $i > $o ) > $o] :
( ( ( X2 @ X1 )
= $true )
| ( $true
= ( X2 @ ( sK4 @ X2 ) ) )
| ( ( cNAT @ X1 )
= $false )
| ( $false
= ( X2 @ cZERO ) ) ),
inference(imp_proxy_clausification,[],[f83]) ).
thf(f244,plain,
! [X0: ( $i > $o ) > $o] :
( ( ( sK0 @ ( sK4 @ sK0 ) )
!= $true )
| ( $false = $true )
| ( ( sK0 @ X0 )
= $true )
| ( ( cNAT @ X0 )
= $false )
| ( $false
= ( sK0 @ cZERO ) ) ),
inference(superposition,[],[f19,f84]) ).
thf(f263,plain,
! [X0: ( $i > $o ) > $o] :
( ( $false
= ( sK0 @ cZERO ) )
| ( ( sK0 @ X0 )
= $true )
| ( ( cNAT @ X0 )
= $false )
| ( ( sK0 @ ( sK4 @ sK0 ) )
!= $true ) ),
inference(trivial_inequality_removal,[],[f244]) ).
thf(f286,plain,
! [X0: ( $i > $o ) > $o] :
( ( $false
= ( sK0 @ cZERO ) )
| ( ( sK0 @ X0 )
= $true )
| ( ( cNAT @ X0 )
= $false ) ),
inference(forward_subsumption_resolution,[],[f263,f85]) ).
thf(f288,plain,
! [X0: ( $i > $o ) > $o] :
( ( $false = $true )
| ( ( cNAT @ X0 )
= $false )
| ( ( sK0 @ X0 )
= $true ) ),
inference(forward_demodulation,[],[f286,f20]) ).
thf(f289,plain,
! [X0: ( $i > $o ) > $o] :
( ( ( cNAT @ X0 )
= $false )
| ( ( sK0 @ X0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f288]) ).
thf(f293,plain,
( ( $false = $true )
| ( ( sK0 @ sK1 )
= $true ) ),
inference(superposition,[],[f289,f21]) ).
thf(f301,plain,
( ( sK0 @ sK1 )
= $true ),
inference(trivial_inequality_removal,[],[f293]) ).
thf(f310,plain,
$false,
inference(forward_subsumption_resolution,[],[f301,f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV299^5 : TPTP v9.3.1. Bugfixed v6.2.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.23 % Computer : n013.cluster.edu
% 0.11/0.23 % Model : x86_64 x86_64
% 0.11/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.23 % Memory : 8046.5625MB
% 0.11/0.23 % OS : Linux 6.8.0-71-generic
% 0.11/0.23 % CPULimit : 300
% 0.11/0.23 % WCLimit : 300
% 0.11/0.23 % DateTime : Tue Sep 29 15:31:37 UTC 2026
% 0.11/0.23 % CPUTime :
% 0.11/0.23 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.29 Running higher-order theorem proving
% 0.25/0.30 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.25/0.37 % (2256118)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.25/0.37 % (2256129)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1207140196:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.25/0.37 % (2256125)lrs+10_16_si=on:nwc=1.5:random_seed=2870210348:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.25/0.37 % (2256130)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.25/0.37 % (2256130)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.25/0.37 % (2256126)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2597784735:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.25/0.37 % (2256124)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=610965144:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.25/0.37 % (2256128)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1012836692:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.25/0.37 % (2256127)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=1616009126: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.25/0.37 % (2256130)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=701080574:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.25/0.37 % (2256126)Instruction limit reached!
% 0.25/0.37 % (2256126)------------------------------
% 0.25/0.37 % (2256126)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.37 % (2256126)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.37 % (2256126)CaDiCaL version: 2.1.3
% 0.25/0.37 % (2256126)Termination reason: Instruction limit
% 0.25/0.37 % (2256126)Termination phase: Saturation
% 0.25/0.37 % (2256126)Time elapsed: 0.004 s
% 0.25/0.37 % (2256126)Peak memory usage: 12 MB
% 0.25/0.37 % (2256126)Instructions burned: 3 (million)
% 0.25/0.37 % (2256125)Instruction limit reached!
% 0.25/0.37 % (2256125)------------------------------
% 0.25/0.37 % (2256125)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.37 % (2256125)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.37 % (2256125)CaDiCaL version: 2.1.3
% 0.25/0.37 % (2256125)Termination reason: Instruction limit
% 0.25/0.37 % (2256125)Termination phase: Saturation
% 0.25/0.37 % (2256125)Time elapsed: 0.019 s
% 0.25/0.37 % (2256125)Peak memory usage: 12 MB
% 0.25/0.37 % (2256125)Instructions burned: 18 (million)
% 0.25/0.37 % (2256130)Refutation not found, incomplete strategy
% 0.25/0.37 % (2256130)------------------------------
% 0.25/0.37 % (2256130)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.37 % (2256130)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.37 % (2256130)CaDiCaL version: 2.1.3
% 0.25/0.37 % (2256130)Termination reason: Refutation not found, incomplete strategy
% 0.25/0.37 % (2256130)Time elapsed: 0.015 s
% 0.25/0.37 % (2256130)Peak memory usage: 12 MB
% 0.25/0.37 % (2256130)Instructions burned: 15 (million)
% 0.25/0.37 % (2256130)------------------------------
% 0.25/0.37 % (2256130)------------------------------
% 0.25/0.37 % (2256128) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2256118-2256128"...
% 0.25/0.37 % (2256128)...printing done.
% 0.25/0.37 % (2256129)Instruction limit reached!
% 0.25/0.37 % (2256129)------------------------------
% 0.25/0.37 % (2256129)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.37 % (2256129)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.37 % (2256129)CaDiCaL version: 2.1.3
% 0.25/0.37 % (2256129)Termination reason: Instruction limit
% 0.25/0.37 % (2256129)Termination phase: Saturation
% 0.25/0.37 % (2256129)Time elapsed: 0.036 s
% 0.25/0.37 % (2256129)Peak memory usage: 12 MB
% 0.25/0.37 % (2256129)Instructions burned: 77 (million)
% 0.25/0.37 % (2256128)Refutation found. Thanks to Tanya!
% 0.25/0.37 % SZS status Theorem for theBenchmark
% 0.25/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.38 % (2256128)------------------------------
% 0.25/0.38 % (2256128)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.38 % (2256128)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.38 % (2256128)CaDiCaL version: 2.1.3
% 0.25/0.38 % (2256128)Termination reason: Refutation
% 0.25/0.38 % (2256128)Time elapsed: 0.021 s
% 0.25/0.38 % (2256128)Peak memory usage: 12 MB
% 0.25/0.38 % (2256128)Instructions burned: 21 (million)
% 0.25/0.38 % (2256118)Success in time 0.06 s
% 0.25/0.38 % Vampire exiting
%------------------------------------------------------------------------------