%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ALG278^5 : TPTP v9.3.1. Bugfixed v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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 07:45:19 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 5
% Syntax : Number of formulae : 51 ( 45 unt; 0 typ; 0 def)
% Number of atoms : 193 ( 89 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 430 ( 7 ~; 0 |; 17 &; 355 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 54 ( 54 >; 0 *; 0 +; 0 <<)
% Number of symbols : 24 ( 19 usr; 6 con; 0-4 aty)
% ( 38 !!; 9 ??; 0 @@+; 0 @@-)
% Number of variables : 146 ( 91 ^; 51 !; 4 ?; 146 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
g: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cGROUP2: ( g > g > g ) > g > $o ).
thf(func_def_1,type,
cGRP_ASSOC: ( g > g > g ) > $o ).
thf(func_def_2,type,
cGRP_LEFT_INVERSE: ( g > g > g ) > g > $o ).
thf(func_def_3,type,
cGRP_LEFT_UNIT: ( g > g > g ) > g > $o ).
thf(func_def_7,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_8,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_9,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_14,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_15,type,
vAND: $o > $o > $o ).
thf(func_def_16,type,
sK0: g > g > g ).
thf(func_def_17,type,
sK1: g ).
thf(func_def_18,type,
sK2: g ).
thf(func_def_19,type,
vNOT: $o > $o ).
thf(func_def_20,type,
sK3: g > g ).
thf(f1,axiom,
( ( ^ [X0: g > g > g] :
! [X1: g,X3: g,X2: g] :
( ( X0 @ ( X0 @ X1 @ X2 ) @ X3 )
= ( X0 @ X1 @ ( X0 @ X2 @ X3 ) ) ) )
= cGRP_ASSOC ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cGRP_ASSOC_def) ).
thf(f2,axiom,
( cGRP_LEFT_INVERSE
= ( ^ [X0: g > g > g,X1: g] :
! [X2: g] :
? [X3: g] :
( ( X0 @ X3 @ X2 )
= X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cGRP_LEFT_INVERSE_def) ).
thf(f3,axiom,
( cGRP_LEFT_UNIT
= ( ^ [X0: g > g > g,X1: g] :
! [X2: g] :
( ( X0 @ X1 @ X2 )
= X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cGRP_LEFT_UNIT_def) ).
thf(f4,axiom,
( cGROUP2
= ( ^ [X0: g > g > g,X1: g] :
( ( cGRP_ASSOC @ X0 )
& ( cGRP_LEFT_INVERSE @ X0 @ X1 )
& ( cGRP_LEFT_UNIT @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cGROUP2_def) ).
thf(f5,conjecture,
! [X0: g > g > g,X1: g] :
( ( cGROUP2 @ X0 @ X1 )
=> ! [X2: g] :
( ( X0 @ X2 @ X1 )
= X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cE12A1) ).
thf(f6,negated_conjecture,
~ ! [X0: g > g > g,X1: g] :
( ( cGROUP2 @ X0 @ X1 )
=> ! [X2: g] :
( ( X0 @ X2 @ X1 )
= X2 ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
~ ! [X0: g > g > g,X1: g] :
( ( cGROUP2 @ X0 @ X1 )
=> ! [X2: g] :
( ( X0 @ X2 @ X1 )
= X2 ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
~ ! [X1: g,X0: g > g > g] :
( ( ( cGROUP2 @ X0 @ X1 )
= $true )
=> ! [X2: g] :
( ( X0 @ X2 @ X1 )
= X2 ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
( cGRP_LEFT_INVERSE
= ( ^ [Y0: g > g > g,Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( ?? @ g
@ ^ [Y3: g] :
( ( Y0 @ Y3 @ Y2 )
= Y1 ) ) ) ) ),
inference(fool_elimination,[],[f2]) ).
thf(f10,plain,
( cGROUP2
= ( ^ [X0: g > g > g,X1: g] :
( ( cGRP_ASSOC @ X0 )
& ( cGRP_LEFT_INVERSE @ X0 @ X1 )
& ( cGRP_LEFT_UNIT @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f11,plain,
( cGROUP2
= ( ^ [Y0: g > g > g,Y1: g] :
( ( cGRP_LEFT_UNIT @ Y0 @ Y1 )
& ( cGRP_LEFT_INVERSE @ Y0 @ Y1 )
& ( cGRP_ASSOC @ Y0 ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
( cGRP_LEFT_UNIT
= ( ^ [Y0: g > g > g,Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( ( Y0 @ Y1 @ Y2 )
= Y2 ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f13,plain,
( ( ^ [X0: g > g > g] :
! [X1: g,X2: g,X3: g] :
( ( X0 @ ( X0 @ X1 @ X3 ) @ X2 )
= ( X0 @ X1 @ ( X0 @ X3 @ X2 ) ) ) )
= cGRP_ASSOC ),
inference(rectify,[],[f1]) ).
thf(f14,plain,
( cGRP_ASSOC
= ( ^ [Y0: g > g > g] :
( !! @ g
@ ^ [Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( !! @ g
@ ^ [Y3: g] :
( ( Y0 @ ( Y0 @ Y3 @ Y1 ) @ Y2 )
= ( Y0 @ Y3 @ ( Y0 @ Y1 @ Y2 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
? [X0: g > g > g,X1: g] :
( ? [X2: g] :
( ( X0 @ X2 @ X1 )
!= X2 )
& ( ( cGROUP2 @ X0 @ X1 )
= $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f16,plain,
( ( ( sK0 @ sK2 @ sK1 )
!= sK2 )
& ( ( cGROUP2 @ sK0 @ sK1 )
= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f15]) ).
thf(f17,plain,
( cGRP_LEFT_UNIT
= ( ^ [Y0: g > g > g,Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( ( Y0 @ Y1 @ Y2 )
= Y2 ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f18,plain,
( cGRP_LEFT_INVERSE
= ( ^ [Y0: g > g > g,Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( ?? @ g
@ ^ [Y3: g] :
( ( Y0 @ Y3 @ Y2 )
= Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f19,plain,
( ( cGROUP2 @ sK0 @ sK1 )
= $true ),
inference(cnf_transformation,[],[f16]) ).
thf(f20,plain,
( ( sK0 @ sK2 @ sK1 )
!= sK2 ),
inference(cnf_transformation,[],[f16]) ).
thf(f21,plain,
( cGROUP2
= ( ^ [Y0: g > g > g,Y1: g] :
( ( cGRP_LEFT_UNIT @ Y0 @ Y1 )
& ( cGRP_LEFT_INVERSE @ Y0 @ Y1 )
& ( cGRP_ASSOC @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f22,plain,
( cGRP_ASSOC
= ( ^ [Y0: g > g > g] :
( !! @ g
@ ^ [Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( !! @ g
@ ^ [Y3: g] :
( ( Y0 @ ( Y0 @ Y3 @ Y1 ) @ Y2 )
= ( Y0 @ Y3 @ ( Y0 @ Y1 @ Y2 ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f25,plain,
( cGROUP2
= ( ^ [Y0: g > g > g,Y1: g] :
( ( ^ [Y2: g > g > g,Y3: g] :
( !! @ g
@ ^ [Y4: g] :
( ( Y2 @ Y3 @ Y4 )
= Y4 ) )
@ Y0
@ Y1 )
& ( ^ [Y2: g > g > g,Y3: g] :
( !! @ g
@ ^ [Y4: g] :
( ?? @ g
@ ^ [Y5: g] :
( ( Y2 @ Y5 @ Y4 )
= Y3 ) ) )
@ Y0
@ Y1 )
& ( ^ [Y2: g > g > g] :
( !! @ g
@ ^ [Y3: g] :
( !! @ g
@ ^ [Y4: g] :
( !! @ g
@ ^ [Y5: g] :
( ( Y2 @ ( Y2 @ Y5 @ Y3 ) @ Y4 )
= ( Y2 @ Y5 @ ( Y2 @ Y3 @ Y4 ) ) ) ) ) )
@ Y0 ) ) ) ),
inference(definition_unfolding,[],[f21,f17,f18,f22]) ).
thf(f26,plain,
( ( ^ [Y0: g > g > g,Y1: g] :
( ( ^ [Y2: g > g > g,Y3: g] :
( !! @ g
@ ^ [Y4: g] :
( ( Y2 @ Y3 @ Y4 )
= Y4 ) )
@ Y0
@ Y1 )
& ( ^ [Y2: g > g > g,Y3: g] :
( !! @ g
@ ^ [Y4: g] :
( ?? @ g
@ ^ [Y5: g] :
( ( Y2 @ Y5 @ Y4 )
= Y3 ) ) )
@ Y0
@ Y1 )
& ( ^ [Y2: g > g > g] :
( !! @ g
@ ^ [Y3: g] :
( !! @ g
@ ^ [Y4: g] :
( !! @ g
@ ^ [Y5: g] :
( ( Y2 @ ( Y2 @ Y5 @ Y3 ) @ Y4 )
= ( Y2 @ Y5 @ ( Y2 @ Y3 @ Y4 ) ) ) ) ) )
@ Y0 ) )
@ sK0
@ sK1 )
= $true ),
inference(definition_unfolding,[],[f19,f25]) ).
thf(f27,plain,
( ( ( !! @ g
@ ^ [Y0: g] :
( ( sK0 @ sK1 @ Y0 )
= Y0 ) )
& ( !! @ g
@ ^ [Y0: g] :
( ?? @ g
@ ^ [Y1: g] :
( ( sK0 @ Y1 @ Y0 )
= sK1 ) ) )
& ( !! @ g
@ ^ [Y0: g] :
( !! @ g
@ ^ [Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( ( sK0 @ ( sK0 @ Y2 @ Y0 ) @ Y1 )
= ( sK0 @ Y2 @ ( sK0 @ Y0 @ Y1 ) ) ) ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f26]) ).
thf(f28,plain,
( ( !! @ g
@ ^ [Y0: g] :
( !! @ g
@ ^ [Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( ( sK0 @ ( sK0 @ Y2 @ Y0 ) @ Y1 )
= ( sK0 @ Y2 @ ( sK0 @ Y0 @ Y1 ) ) ) ) ) )
= $true ),
inference(and_proxy_clausification,[],[f27]) ).
thf(f29,plain,
( ( ( !! @ g
@ ^ [Y0: g] :
( ( sK0 @ sK1 @ Y0 )
= Y0 ) )
& ( !! @ g
@ ^ [Y0: g] :
( ?? @ g
@ ^ [Y1: g] :
( ( sK0 @ Y1 @ Y0 )
= sK1 ) ) ) )
= $true ),
inference(and_proxy_clausification,[],[f27]) ).
thf(f30,plain,
( ( !! @ g
@ ^ [Y0: g] :
( ?? @ g
@ ^ [Y1: g] :
( ( sK0 @ Y1 @ Y0 )
= sK1 ) ) )
= $true ),
inference(and_proxy_clausification,[],[f29]) ).
thf(f31,plain,
( ( !! @ g
@ ^ [Y0: g] :
( ( sK0 @ sK1 @ Y0 )
= Y0 ) )
= $true ),
inference(and_proxy_clausification,[],[f29]) ).
thf(f32,plain,
! [X1: g] :
( ( ^ [Y0: g] :
( ( sK0 @ sK1 @ Y0 )
= Y0 )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f31]) ).
thf(f33,plain,
! [X1: g] :
( ( ( sK0 @ sK1 @ X1 )
= X1 )
= $true ),
inference(beta-eta_normalization,[],[f32]) ).
thf(f34,plain,
! [X1: g] :
( ( sK0 @ sK1 @ X1 )
= X1 ),
inference(equality_proxy_clausification,[],[f33]) ).
thf(f35,plain,
! [X1: g] :
( ( ^ [Y0: g] :
( ?? @ g
@ ^ [Y1: g] :
( ( sK0 @ Y1 @ Y0 )
= sK1 ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f30]) ).
thf(f36,plain,
! [X1: g] :
( ( ?? @ g
@ ^ [Y0: g] :
( ( sK0 @ Y0 @ X1 )
= sK1 ) )
= $true ),
inference(beta-eta_normalization,[],[f35]) ).
thf(f37,plain,
! [X1: g] :
( ( ^ [Y0: g] :
( ( sK0 @ Y0 @ X1 )
= sK1 )
@ ( sK3 @ X1 ) )
= $true ),
inference(sigma_proxy_clausification,[],[f36]) ).
thf(f38,plain,
! [X1: g] :
( ( ( sK0 @ ( sK3 @ X1 ) @ X1 )
= sK1 )
= $true ),
inference(beta-eta_normalization,[],[f37]) ).
thf(f39,plain,
! [X1: g] :
( sK1
= ( sK0 @ ( sK3 @ X1 ) @ X1 ) ),
inference(equality_proxy_clausification,[],[f38]) ).
thf(f40,plain,
! [X1: g] :
( ( ^ [Y0: g] :
( !! @ g
@ ^ [Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( ( sK0 @ ( sK0 @ Y2 @ Y0 ) @ Y1 )
= ( sK0 @ Y2 @ ( sK0 @ Y0 @ Y1 ) ) ) ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f28]) ).
thf(f41,plain,
! [X1: g] :
( ( !! @ g
@ ^ [Y0: g] :
( !! @ g
@ ^ [Y1: g] :
( ( sK0 @ ( sK0 @ Y1 @ X1 ) @ Y0 )
= ( sK0 @ Y1 @ ( sK0 @ X1 @ Y0 ) ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f40]) ).
thf(f42,plain,
! [X2: g,X1: g] :
( ( ^ [Y0: g] :
( !! @ g
@ ^ [Y1: g] :
( ( sK0 @ ( sK0 @ Y1 @ X1 ) @ Y0 )
= ( sK0 @ Y1 @ ( sK0 @ X1 @ Y0 ) ) ) )
@ X2 )
= $true ),
inference(pi_proxy_clausification,[],[f41]) ).
thf(f43,plain,
! [X2: g,X1: g] :
( ( !! @ g
@ ^ [Y0: g] :
( ( sK0 @ ( sK0 @ Y0 @ X1 ) @ X2 )
= ( sK0 @ Y0 @ ( sK0 @ X1 @ X2 ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f42]) ).
thf(f44,plain,
! [X2: g,X3: g,X1: g] :
( ( ^ [Y0: g] :
( ( sK0 @ ( sK0 @ Y0 @ X1 ) @ X2 )
= ( sK0 @ Y0 @ ( sK0 @ X1 @ X2 ) ) )
@ X3 )
= $true ),
inference(pi_proxy_clausification,[],[f43]) ).
thf(f45,plain,
! [X2: g,X3: g,X1: g] :
( ( ( sK0 @ ( sK0 @ X3 @ X1 ) @ X2 )
= ( sK0 @ X3 @ ( sK0 @ X1 @ X2 ) ) )
= $true ),
inference(beta-eta_normalization,[],[f44]) ).
thf(f46,plain,
! [X2: g,X3: g,X1: g] :
( ( sK0 @ X3 @ ( sK0 @ X1 @ X2 ) )
= ( sK0 @ ( sK0 @ X3 @ X1 ) @ X2 ) ),
inference(equality_proxy_clausification,[],[f45]) ).
thf(f51,plain,
! [X0: g,X1: g] :
( ( sK0 @ sK1 @ X1 )
= ( sK0 @ ( sK3 @ X0 ) @ ( sK0 @ X0 @ X1 ) ) ),
inference(constrained_superposition,[],[f46,f39]) ).
thf(f52,plain,
! [X0: g,X1: g] :
( ( sK0 @ ( sK3 @ X0 ) @ ( sK0 @ X0 @ X1 ) )
= X1 ),
inference(forward_demodulation,[],[f51,f34]) ).
thf(f54,plain,
! [X0: g] :
( ( sK0 @ ( sK3 @ ( sK3 @ X0 ) ) @ sK1 )
= X0 ),
inference(constrained_superposition,[],[f52,f39]) ).
thf(f55,plain,
! [X0: g,X1: g] :
( ( sK0 @ X1 @ X0 )
= ( sK0 @ ( sK3 @ ( sK3 @ X1 ) ) @ X0 ) ),
inference(constrained_superposition,[],[f52,f52]) ).
thf(f59,plain,
! [X0: g] :
( ( sK0 @ X0 @ sK1 )
= X0 ),
inference(forward_demodulation,[],[f54,f55]) ).
thf(f66,plain,
sK2 != sK2,
inference(constrained_superposition,[],[f20,f59]) ).
thf(f67,plain,
$false,
inference(trivial_inequality_removal,[],[f66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG278^5 : TPTP v9.3.1. Bugfixed v5.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n020.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 17:37:05 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.24 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.21/0.28 % (1367568)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.28 % (1367577)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=575435674:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.28 % (1367579)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.28 % (1367579)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.21/0.28 % (1367574)lrs+10_16_si=on:nwc=1.5:random_seed=3102092547:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.28 % (1367573)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2390445379:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.28 % (1367575)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=4082772787:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.28 % (1367578)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2256545993:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.28 % (1367576)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=3809212267: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.21/0.28 % (1367579)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=623764266:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.28 % (1367577)Instruction limit reached!
% 0.21/0.28 % (1367577)------------------------------
% 0.21/0.28 % (1367577)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (1367577)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (1367577)CaDiCaL version: 2.1.3
% 0.21/0.28 % (1367577)Termination reason: Instruction limit
% 0.21/0.28 % (1367577)Termination phase: Saturation
% 0.21/0.28 % (1367577)Time elapsed: 0.008 s
% 0.21/0.28 % (1367577)Peak memory usage: 12 MB
% 0.21/0.28 % (1367577)Instructions burned: 28 (million)
% 0.21/0.28 % (1367575)Refutation not found, incomplete strategy
% 0.21/0.28 % (1367575)------------------------------
% 0.21/0.28 % (1367575)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (1367575)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (1367575)CaDiCaL version: 2.1.3
% 0.21/0.28 % (1367575)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.28 % (1367575)Time elapsed: 0.002 s
% 0.21/0.28 % (1367575)Peak memory usage: 12 MB
% 0.21/0.28 % (1367575)Instructions burned: 2 (million)
% 0.21/0.28 % (1367574) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1367568-1367574"...
% 0.21/0.28 % (1367575)------------------------------
% 0.21/0.28 % (1367575)------------------------------
% 0.21/0.28 % (1367573) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1367568-1367573"...
% 0.21/0.28 % (1367578) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1367568-1367578"...
% 0.21/0.28 % (1367574)...printing done.
% 0.21/0.28 % (1367573)...printing done.
% 0.21/0.28 % (1367578)...printing done.
% 0.21/0.28 % (1367579) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1367568-1367579"...
% 0.21/0.28 % (1367574)Refutation found. Thanks to Tanya!
% 0.21/0.28 % SZS status Theorem for theBenchmark
% 0.21/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28 % (1367574)------------------------------
% 0.21/0.28 % (1367574)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (1367574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (1367574)CaDiCaL version: 2.1.3
% 0.21/0.28 % (1367574)Termination reason: Refutation
% 0.21/0.28 % (1367574)Time elapsed: 0.005 s
% 0.21/0.28 % (1367574)Peak memory usage: 12 MB
% 0.21/0.28 % (1367574)Instructions burned: 8 (million)
% 0.21/0.28 % (1367568)Success in time 0.029 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------