%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM638^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:18:20 AM UTC 2026
% Result : Theorem 0.07s 0.26s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 8
% Syntax : Number of formulae : 68 ( 9 unt; 0 typ; 4 def)
% Number of atoms : 254 ( 148 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 303 ( 69 ~; 79 |; 8 &; 123 @)
% ( 4 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 10 con; 0-4 aty)
% Number of variables : 71 ( 0 sgn 36 !; 6 ?; 71 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
x: nat ).
thf(func_def_1,type,
n_1: nat ).
thf(func_def_2,type,
suc: nat > nat ).
thf(func_def_3,type,
some: ( nat > $o ) > $o ).
thf(func_def_5,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_6,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_7,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_10,type,
sK0: nat ).
thf(func_def_11,type,
sK1: nat ).
thf(func_def_13,type,
sK3: nat > nat ).
thf(f1,axiom,
x != n_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
thf(f2,axiom,
! [X1: nat,X0: nat] :
( ( ( suc @ X0 )
= ( suc @ X1 ) )
=> ( X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
thf(f3,axiom,
! [X0: nat] :
( ( X0 != n_1 )
=> ( some
@ ^ [X1: nat] :
( X0
= ( suc @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz3) ).
thf(f4,conjecture,
~ ( ! [X1: nat,X0: nat] :
( ( x
= ( suc @ X0 ) )
=> ( ( x
= ( suc @ X1 ) )
=> ( X0 = X1 ) ) )
=> ~ ( some
@ ^ [X2: nat] :
( x
= ( suc @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz3a) ).
thf(f5,negated_conjecture,
~ ~ ( ! [X1: nat,X0: nat] :
( ( x
= ( suc @ X0 ) )
=> ( ( x
= ( suc @ X1 ) )
=> ( X0 = X1 ) ) )
=> ~ ( some
@ ^ [X2: nat] :
( x
= ( suc @ X2 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
! [X0: nat] :
( ( X0 != n_1 )
=> ( some
@ ^ [X1: nat] :
( X0
= ( suc @ X1 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
! [X0: nat] :
( ( n_1 != X0 )
=> ( ( some
@ ^ [Y0: nat] :
( ( suc @ Y0 )
= X0 ) )
= $true ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
~ ~ ( ! [X0: nat,X1: nat] :
( ( x
= ( suc @ X1 ) )
=> ( ( x
= ( suc @ X0 ) )
=> ( X0 = X1 ) ) )
=> ~ ( some
@ ^ [X2: nat] :
( x
= ( suc @ X2 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f9,plain,
~ ~ ( ! [X0: nat,X1: nat] :
( ( x
= ( suc @ X1 ) )
=> ( ( x
= ( suc @ X0 ) )
=> ( X0 = X1 ) ) )
=> ( ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) )
!= $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
! [X1: nat,X0: nat] :
( ( ( suc @ X0 )
= ( suc @ X1 ) )
=> ( X0 = X1 ) ),
inference(rectify,[],[f2]) ).
thf(f11,plain,
( ! [X0: nat,X1: nat] :
( ( x
= ( suc @ X1 ) )
=> ( ( x
= ( suc @ X0 ) )
=> ( X0 = X1 ) ) )
=> ( ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) )
!= $true ) ),
inference(flattening,[],[f9]) ).
thf(f12,plain,
! [X0: nat] :
( ( n_1 = X0 )
| ( ( some
@ ^ [Y0: nat] :
( ( suc @ Y0 )
= X0 ) )
= $true ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f13,plain,
( ( ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) )
!= $true )
| ? [X0: nat,X1: nat] :
( ( X0 != X1 )
& ( x
= ( suc @ X0 ) )
& ( x
= ( suc @ X1 ) ) ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f14,plain,
( ( ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) )
!= $true )
| ? [X1: nat,X0: nat] :
( ( x
= ( suc @ X0 ) )
& ( x
= ( suc @ X1 ) )
& ( X0 != X1 ) ) ),
inference(flattening,[],[f13]) ).
thf(f15,plain,
! [X0: nat,X1: nat] :
( ( X0 = X1 )
| ( ( suc @ X0 )
!= ( suc @ X1 ) ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f16,plain,
( ( ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) )
!= $true )
| ? [X0: nat,X1: nat] :
( ( x
= ( suc @ X1 ) )
& ( x
= ( suc @ X0 ) )
& ( X0 != X1 ) ) ),
inference(rectify,[],[f14]) ).
thf(f17,plain,
( ( ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) )
!= $true )
| ( ( x
= ( suc @ sK1 ) )
& ( x
= ( suc @ sK0 ) )
& ( sK0 != sK1 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f16]) ).
thf(f18,plain,
! [X0: nat,X1: nat] :
( ( ( suc @ X0 )
!= ( suc @ X1 ) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f19,plain,
( ( ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) )
!= $true )
| ( sK0 != sK1 ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f20,plain,
( ( x
= ( suc @ sK0 ) )
| ( ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) )
!= $true ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f21,plain,
( ( x
= ( suc @ sK1 ) )
| ( ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) )
!= $true ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f22,plain,
! [X0: nat] :
( ( ( some
@ ^ [Y0: nat] :
( ( suc @ Y0 )
= X0 ) )
= $true )
| ( n_1 = X0 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f23,plain,
x != n_1,
inference(cnf_transformation,[],[f1]) ).
thf(f27,definition,
( spl2_1
<=> ( x
= ( suc @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f29,plain,
( ( x
= ( suc @ sK0 ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f27]) ).
thf(f31,definition,
( spl2_2
<=> ( ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f33,plain,
( ( ( some
@ ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) )
!= $true )
| spl2_2 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f34,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f20,f31,f27]) ).
thf(f36,definition,
( spl2_3
<=> ( x
= ( suc @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
thf(f38,plain,
( ( x
= ( suc @ sK1 ) )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f39,plain,
( ~ spl2_2
| spl2_3 ),
inference(avatar_split_clause,[],[f21,f36,f31]) ).
thf(f41,definition,
( spl2_4
<=> ( sK0 = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
thf(f43,plain,
( ( sK0 != sK1 )
| spl2_4 ),
inference(avatar_component_clause,[],[f41]) ).
thf(f44,plain,
( ~ spl2_2
| ~ spl2_4 ),
inference(avatar_split_clause,[],[f19,f41,f31]) ).
thf(f46,plain,
( ! [X0: nat] :
( ( $true != $true )
| ( ( ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) )
!= ( ^ [Y0: nat] :
( ( suc @ Y0 )
= X0 ) ) )
| ( n_1 = X0 ) )
| spl2_2 ),
inference(constrained_superposition,[],[f33,f22]) ).
thf(f47,plain,
( ! [X0: nat] :
( ( ( ^ [Y0: nat] :
( x
= ( suc @ Y0 ) ) )
!= ( ^ [Y0: nat] :
( ( suc @ Y0 )
= X0 ) ) )
| ( n_1 = X0 ) )
| spl2_2 ),
inference(trivial_inequality_removal,[],[f46]) ).
thf(f48,plain,
( ! [X0: nat] :
( ( ( ^ [Y0: nat] :
( ( suc @ Y0 )
= X0 )
@ ( sK3 @ X0 ) )
!= ( ^ [Y0: nat] :
( x
= ( suc @ Y0 ) )
@ ( sK3 @ X0 ) ) )
| ( n_1 = X0 ) )
| spl2_2 ),
inference(negative_extensionality,[],[f47]) ).
thf(f49,plain,
( ! [X0: nat] :
( ( $true
= ( ^ [Y0: nat] :
( ( suc @ Y0 )
= X0 )
@ ( sK3 @ X0 ) ) )
| ( $true
= ( ^ [Y0: nat] :
( x
= ( suc @ Y0 ) )
@ ( sK3 @ X0 ) ) )
| ( n_1 = X0 ) )
| spl2_2 ),
inference(xor_proxy_clausification,[],[f48]) ).
thf(f50,plain,
( ! [X0: nat] :
( ( $false
= ( ^ [Y0: nat] :
( x
= ( suc @ Y0 ) )
@ ( sK3 @ X0 ) ) )
| ( $false
= ( ^ [Y0: nat] :
( ( suc @ Y0 )
= X0 )
@ ( sK3 @ X0 ) ) )
| ( n_1 = X0 ) )
| spl2_2 ),
inference(xor_proxy_clausification,[],[f48]) ).
thf(f51,plain,
( ! [X0: nat] :
( ( ( ( suc @ ( sK3 @ X0 ) )
= X0 )
= $false )
| ( ( x
= ( suc @ ( sK3 @ X0 ) ) )
= $false )
| ( n_1 = X0 ) )
| spl2_2 ),
inference(beta-eta_normalization,[],[f50]) ).
thf(f52,plain,
( ! [X0: nat] :
( ( ( x
= ( suc @ ( sK3 @ X0 ) ) )
= $false )
| ( ( suc @ ( sK3 @ X0 ) )
!= X0 )
| ( n_1 = X0 ) )
| spl2_2 ),
inference(equality_proxy_clausification,[],[f51]) ).
thf(f53,plain,
( ! [X0: nat] :
( ( ( suc @ ( sK3 @ X0 ) )
!= X0 )
| ( n_1 = X0 )
| ( x
!= ( suc @ ( sK3 @ X0 ) ) ) )
| spl2_2 ),
inference(equality_proxy_clausification,[],[f52]) ).
thf(f54,plain,
( ! [X0: nat] :
( ( $true
= ( ( suc @ ( sK3 @ X0 ) )
= X0 ) )
| ( ( x
= ( suc @ ( sK3 @ X0 ) ) )
= $true )
| ( n_1 = X0 ) )
| spl2_2 ),
inference(beta-eta_normalization,[],[f49]) ).
thf(f55,plain,
( ! [X0: nat] :
( ( n_1 = X0 )
| ( ( x
= ( suc @ ( sK3 @ X0 ) ) )
= $true )
| ( ( suc @ ( sK3 @ X0 ) )
= X0 ) )
| spl2_2 ),
inference(equality_proxy_clausification,[],[f54]) ).
thf(f56,plain,
( ! [X0: nat] :
( ( ( suc @ ( sK3 @ X0 ) )
= X0 )
| ( x
= ( suc @ ( sK3 @ X0 ) ) )
| ( n_1 = X0 ) )
| spl2_2 ),
inference(equality_proxy_clausification,[],[f55]) ).
thf(f63,plain,
( ! [X0: nat] :
( ( x != X0 )
| ( n_1 = X0 )
| ( x
= ( suc @ ( sK3 @ X0 ) ) ) )
| spl2_2 ),
inference(equality_factoring,[],[f56]) ).
thf(f69,plain,
( ( x = n_1 )
| ( x
= ( suc @ ( sK3 @ x ) ) )
| spl2_2 ),
inference(equality_resolution,[],[f63]) ).
thf(f70,plain,
( ( x
= ( suc @ ( sK3 @ x ) ) )
| spl2_2 ),
inference(forward_subsumption_resolution,[],[f69,f23]) ).
thf(f73,plain,
( ( x != x )
| ( x = n_1 )
| ( x != x )
| spl2_2 ),
inference(constrained_superposition,[],[f53,f70]) ).
thf(f74,plain,
( ( x = n_1 )
| ( x != x )
| spl2_2 ),
inference(duplicate_literal_removal,[],[f73]) ).
thf(f75,plain,
( ( x = n_1 )
| spl2_2 ),
inference(trivial_inequality_removal,[],[f74]) ).
thf(f76,plain,
( $false
| spl2_2 ),
inference(forward_subsumption_resolution,[],[f75,f23]) ).
thf(f77,plain,
spl2_2,
inference(avatar_contradiction_clause,[],[f76]) ).
thf(f79,plain,
( ! [X0: nat] :
( ( x
!= ( suc @ X0 ) )
| ( sK0 = X0 ) )
| ~ spl2_1 ),
inference(constrained_superposition,[],[f18,f29]) ).
thf(f82,plain,
( ( x != x )
| ( sK0 = sK1 )
| ~ spl2_1
| ~ spl2_3 ),
inference(constrained_superposition,[],[f79,f38]) ).
thf(f83,plain,
( ( sK0 = sK1 )
| ~ spl2_1
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f82]) ).
thf(f84,plain,
( $false
| ~ spl2_1
| ~ spl2_3
| spl2_4 ),
inference(forward_subsumption_resolution,[],[f83,f43]) ).
thf(f85,plain,
( ~ spl2_1
| ~ spl2_3
| spl2_4 ),
inference(avatar_contradiction_clause,[],[f84]) ).
cnf(s1,plain,
( spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f34]) ).
cnf(s2,plain,
( ~ spl2_2
| spl2_3 ),
inference(sat_conversion,[],[f39]) ).
cnf(s3,plain,
( ~ spl2_2
| ~ spl2_4 ),
inference(sat_conversion,[],[f44]) ).
cnf(s4,plain,
spl2_2,
inference(sat_conversion,[],[f77]) ).
cnf(s5,plain,
( ~ spl2_1
| ~ spl2_3
| spl2_4 ),
inference(sat_conversion,[],[f85]) ).
cnf(s6,plain,
~ spl2_4,
inference(rat,[],[s3,s4]) ).
cnf(s7,plain,
spl2_3,
inference(rat,[],[s2,s4]) ).
cnf(s8,plain,
~ spl2_1,
inference(rat,[],[s5,s6,s7]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s1,s4,s8]) ).
thf(f86,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM638^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.17 % Computer : n012.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 12:12:33 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.20 Running higher-order theorem proving
% 0.07/0.21 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.07/0.25 % (14508)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.07/0.25 % (14519)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.07/0.25 % (14519)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.07/0.25 % (14514)lrs+10_16_si=on:nwc=1.5:random_seed=66719202:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.07/0.25 % (14517)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3417211103:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.07/0.25 % (14513)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1215022892:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.07/0.25 % (14515)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=928318082:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.07/0.25 % (14516)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=191091813: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.07/0.25 % (14519)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=864002740:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.07/0.25 % (14518)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3756104479:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.07/0.25 % (14517)Refutation not found, incomplete strategy
% 0.07/0.25 % (14517)------------------------------
% 0.07/0.25 % (14517)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (14513)Refutation not found, incomplete strategy
% 0.07/0.25 % (14513)------------------------------
% 0.07/0.25 % (14513)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (14513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (14517)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (14517)CaDiCaL version: 2.1.3
% 0.07/0.25 % (14517)Termination reason: Refutation not found, incomplete strategy
% 0.07/0.25 % (14517)Time elapsed: 0.001 s
% 0.07/0.25 % (14513)CaDiCaL version: 2.1.3
% 0.07/0.25 % (14517)Peak memory usage: 11 MB
% 0.07/0.25 % (14517)Instructions burned: 1 (million)
% 0.07/0.25 % (14513)Termination reason: Refutation not found, incomplete strategy
% 0.07/0.25 % (14513)Time elapsed: 0.001 s
% 0.07/0.25 % (14513)Peak memory usage: 12 MB
% 0.07/0.25 % (14513)Instructions burned: 1 (million)
% 0.07/0.25 % (14515)Refutation not found, incomplete strategy
% 0.07/0.25 % (14515)------------------------------
% 0.07/0.25 % (14515)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (14515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (14515)CaDiCaL version: 2.1.3
% 0.07/0.25 % (14515)Termination reason: Refutation not found, incomplete strategy
% 0.07/0.25 % (14515)Time elapsed: 0.001 s
% 0.07/0.25 % (14515)Peak memory usage: 12 MB
% 0.07/0.25 % (14515)Instructions burned: 1 (million)
% 0.07/0.25 % (14516)Refutation not found, incomplete strategy
% 0.07/0.25 % (14516)------------------------------
% 0.07/0.25 % (14516)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (14516)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (14516)CaDiCaL version: 2.1.3
% 0.07/0.25 % (14516)Termination reason: Refutation not found, incomplete strategy
% 0.07/0.25 % (14516)Time elapsed: 0.001 s
% 0.07/0.25 % (14516)Peak memory usage: 12 MB
% 0.07/0.25 % (14516)Instructions burned: 1 (million)
% 0.07/0.25 % (14517)------------------------------
% 0.07/0.25 % (14517)------------------------------
% 0.07/0.25 % (14513)------------------------------
% 0.07/0.25 % (14513)------------------------------
% 0.07/0.25 % (14519)Refutation not found, incomplete strategy
% 0.07/0.25 % (14519)------------------------------
% 0.07/0.25 % (14519)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (14519)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.26 % (14519)CaDiCaL version: 2.1.3
% 0.07/0.26 % (14519)Termination reason: Refutation not found, incomplete strategy
% 0.07/0.26 % (14519)Time elapsed: 0.001 s
% 0.07/0.26 % (14519)Peak memory usage: 12 MB
% 0.07/0.26 % (14519)Instructions burned: 2 (million)
% 0.07/0.26 % (14515)------------------------------
% 0.07/0.26 % (14515)------------------------------
% 0.07/0.26 % (14516)------------------------------
% 0.07/0.26 % (14516)------------------------------
% 0.07/0.26 % (14519)------------------------------
% 0.07/0.26 % (14519)------------------------------
% 0.07/0.26 % (14514) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-14508-14514"...
% 0.07/0.26 % (14514)...printing done.
% 0.07/0.26 % (14514)Refutation found. Thanks to Tanya!
% 0.07/0.26 % SZS status Theorem for theBenchmark
% 0.07/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.26 % (14514)------------------------------
% 0.19/0.26 % (14514)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.26 % (14514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.26 % (14514)CaDiCaL version: 2.1.3
% 0.19/0.26 % (14514)Termination reason: Refutation
% 0.19/0.26 % (14514)Time elapsed: 0.004 s
% 0.19/0.26 % (14514)Peak memory usage: 13 MB
% 0.19/0.26 % (14514)Instructions burned: 6 (million)
% 0.19/0.26 % (14508)Success in time 0.034 s
% 0.19/0.26 % Vampire exiting
%------------------------------------------------------------------------------