%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO543^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:48:23 AM UTC 2026
% Result : Theorem 0.20s 0.29s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 3
% Syntax : Number of formulae : 60 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 285 ( 184 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 402 ( 79 ~; 84 |; 48 &; 188 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 163 ( 163 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 17 usr; 3 con; 0-4 aty)
% Number of variables : 183 ( 47 ^; 131 !; 5 ?; 183 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
epsii: ( ( $i > $i ) > $o ) > $i > $i ).
thf(func_def_2,type,
if: $o > ( $i > $i ) > ( $i > $i ) > $i > $i ).
thf(func_def_3,type,
vOR: $o > $o > $o ).
thf(func_def_4,type,
vAND: $o > $o > $o ).
thf(func_def_5,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_6,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_7,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_8,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
vNOT: $o > $o ).
thf(func_def_11,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_14,type,
sK0: $i > $i ).
thf(func_def_15,type,
sK1: $o ).
thf(func_def_18,type,
sK4: $o > $i ).
thf(func_def_19,type,
sK5: ( $i > $i ) > $i ).
thf(func_def_20,type,
sK6: ( $i > $i ) > $i ).
thf(f1,axiom,
! [X0: ( $i > $i ) > $o] :
( ? [X1: $i > $i] : ( X0 @ X1 )
=> ( X0 @ ( epsii @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',choiceaxii) ).
thf(f2,axiom,
( ( ^ [X0: $o,X1: $i > $i,X2: $i > $i] :
( epsii
@ ^ [X3: $i > $i] :
( ( ~ X0
& ( X3 = X2 ) )
| ( X0
& ( X3 = X1 ) ) ) ) )
= if ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifd) ).
thf(f3,conjecture,
! [X1: $i > $i,X0: $o] :
( ( if @ X0 @ X1 @ X1 )
= X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f4,negated_conjecture,
~ ! [X1: $i > $i,X0: $o] :
( ( if @ X0 @ X1 @ X1 )
= X1 ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( ( ^ [X0: $o,X1: $i > $i,X2: $i > $i] :
( epsii
@ ^ [X3: $i > $i] :
( ( ~ X0
& ( X3 = X2 ) )
| ( X0
& ( X3 = X1 ) ) ) ) )
= if ),
inference(rectify,[],[f2]) ).
thf(f6,plain,
( if
= ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ( Y1 = Y3 )
& Y0 )
| ( ( Y2 = Y3 )
& ~ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
! [X0: ( $i > $i ) > $o] :
( ? [X1: $i > $i] : ( X0 @ X1 )
=> ( X0 @ ( epsii @ X0 ) ) ),
inference(rectify,[],[f1]) ).
thf(f8,plain,
! [X0: ( $i > $i ) > $o] :
( ? [X1: $i > $i] :
( ( X0 @ X1 )
= $true )
=> ( ( X0 @ ( epsii @ X0 ) )
= $true ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ! [X1: $o,X0: $i > $i] :
( ( if @ X1 @ X0 @ X0 )
= X0 ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
! [X0: ( $i > $i ) > $o] :
( ! [X1: $i > $i] :
( ( X0 @ X1 )
!= $true )
| ( ( X0 @ ( epsii @ X0 ) )
= $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f11,plain,
? [X0: $i > $i,X1: $o] :
( ( if @ X1 @ X0 @ X0 )
!= X0 ),
inference(ennf_transformation,[],[f9]) ).
thf(f12,plain,
( sK0
!= ( if @ sK1 @ sK0 @ sK0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f11]) ).
thf(f13,plain,
! [X0: ( $i > $i ) > $o,X1: $i > $i] :
( ( ( X0 @ X1 )
!= $true )
| ( ( X0 @ ( epsii @ X0 ) )
= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f14,plain,
( if
= ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ( Y1 = Y3 )
& Y0 )
| ( ( Y2 = Y3 )
& ~ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f15,plain,
( sK0
!= ( if @ sK1 @ sK0 @ sK0 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f17,plain,
( ( ( if @ $true @ sK0 @ sK0 )
!= sK0 )
| ( $false = sK1 ) ),
inference(fool_paramodulation,[],[f15]) ).
thf(f24,plain,
! [X2: ( $i > $i ) > $o,X1: $i > $i] :
( ( ( ^ [Y0: $i > $i] :
~ ( X2 @ Y0 )
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ( X2 @ Y0 ) ) )
= $true )
| ( ( ^ [Y0: $i > $i] :
~ ( X2 @ Y0 )
@ X1 )
!= $true ) ),
inference(primitive_instantiation,[],[f13]) ).
thf(f29,plain,
! [X2: ( $i > $i ) > $o,X1: $i > $i] :
( ( ( ~ ( X2
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ( X2 @ Y0 ) ) ) )
= $true )
| ( ( ~ ( X2 @ X1 ) )
!= $true ) ),
inference(beta-eta_normalization,[],[f24]) ).
thf(f30,plain,
! [X2: ( $i > $i ) > $o,X1: $i > $i] :
( ( ( ~ ( X2 @ X1 ) )
!= $true )
| ( $false
= ( X2
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ( X2 @ Y0 ) ) ) ) ),
inference(not_proxy_clausification,[],[f29]) ).
thf(f31,plain,
! [X2: ( $i > $i ) > $o,X1: $i > $i] :
( ( $false
= ( X2
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ( X2 @ Y0 ) ) ) )
| ( ( X2 @ X1 )
= $true ) ),
inference(not_proxy_clausification,[],[f30]) ).
thf(f36,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( $false
= ( ^ [Y0: $i > $i] :
~ ( X3 @ Y0 )
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ( ^ [Y1: $i > $i] :
~ ( X3 @ Y1 )
@ Y0 ) ) ) )
| ( ( ^ [Y0: $i > $i] :
~ ( X3 @ Y0 )
@ X1 )
= $true ) ),
inference(primitive_instantiation,[],[f31]) ).
thf(f45,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( $true
= ( ~ ( X3 @ X1 ) ) )
| ( $false
= ( ~ ( X3
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ~ ( X3 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f36]) ).
thf(f46,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( $false
= ( X3 @ X1 ) )
| ( $false
= ( ~ ( X3
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ~ ( X3 @ Y0 ) ) ) ) ) ),
inference(not_proxy_clausification,[],[f45]) ).
thf(f47,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( ( X3
@ ( epsii
@ ^ [Y0: $i > $i] :
~ ~ ( X3 @ Y0 ) ) )
= $true )
| ( $false
= ( X3 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f46]) ).
thf(f48,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( $true
= ( X3
@ ( epsii
@ ^ [Y0: $i > $i] : ( X3 @ Y0 ) ) ) )
| ( $false
= ( X3 @ X1 ) ) ),
inference(boolean_simplification,[],[f47]) ).
thf(f49,plain,
! [X3: ( $i > $i ) > $o,X1: $i > $i] :
( ( $false
= ( X3 @ X1 ) )
| ( ( X3 @ ( epsii @ X3 ) )
= $true ) ),
inference(beta-eta_normalization,[],[f48]) ).
thf(f89,plain,
! [X1: $o] :
( ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ( Y1 = Y3 )
& Y0 )
| ( ( Y2 = Y3 )
& ~ Y0 ) ) )
@ X1 )
= ( if @ X1 ) ),
inference(argument_congruence,[],[f14]) ).
thf(f90,plain,
! [X1: $o] :
( ( if @ X1 )
= ( ^ [Y0: $i > $i,Y1: $i > $i] :
( epsii
@ ^ [Y2: $i > $i] :
( ( ( Y0 = Y2 )
& X1 )
| ( ( Y1 = Y2 )
& ~ X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f89]) ).
thf(f96,plain,
! [X2: $i > $i,X1: $o] :
( ( if @ X1 @ X2 )
= ( ^ [Y0: $i > $i,Y1: $i > $i] :
( epsii
@ ^ [Y2: $i > $i] :
( ( ( Y0 = Y2 )
& X1 )
| ( ( Y1 = Y2 )
& ~ X1 ) ) )
@ X2 ) ),
inference(argument_congruence,[],[f90]) ).
thf(f97,plain,
! [X2: $i > $i,X1: $o] :
( ( ^ [Y0: $i > $i] :
( epsii
@ ^ [Y1: $i > $i] :
( ( ( X2 = Y1 )
& X1 )
| ( ( Y0 = Y1 )
& ~ X1 ) ) ) )
= ( if @ X1 @ X2 ) ),
inference(beta-eta_normalization,[],[f96]) ).
thf(f98,plain,
! [X2: $i > $i,X3: $i > $i,X1: $o] :
( ( if @ X1 @ X2 @ X3 )
= ( ^ [Y0: $i > $i] :
( epsii
@ ^ [Y1: $i > $i] :
( ( ( X2 = Y1 )
& X1 )
| ( ( Y0 = Y1 )
& ~ X1 ) ) )
@ X3 ) ),
inference(argument_congruence,[],[f97]) ).
thf(f99,plain,
! [X2: $i > $i,X3: $i > $i,X1: $o] :
( ( if @ X1 @ X2 @ X3 )
= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( X2 = Y0 )
& X1 )
| ( ( X3 = Y0 )
& ~ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f98]) ).
thf(f101,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( ^ [Y0: $i > $i] :
( ( ( X1 = Y0 )
& X0 )
| ( ( X2 = Y0 )
& ~ X0 ) )
@ ( if @ X0 @ X1 @ X2 ) )
= $true )
| ( $false
= ( ^ [Y0: $i > $i] :
( ( ( X1 = Y0 )
& X0 )
| ( ( X2 = Y0 )
& ~ X0 ) )
@ X3 ) ) ),
inference(superposition,[],[f49,f99]) ).
thf(f102,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( ( ( X1 = X3 )
& X0 )
| ( ( X2 = X3 )
& ~ X0 ) )
= $false )
| ( ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
| ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 ) )
= $true ) ),
inference(beta-eta_normalization,[],[f101]) ).
thf(f103,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
| ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 ) )
= $true )
| ( $false
= ( ( X2 = X3 )
& ~ X0 ) ) ),
inference(or_proxy_clausification,[],[f102]) ).
thf(f104,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
| ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 ) )
= $true )
| ( $false
= ( ( X1 = X3 )
& X0 ) ) ),
inference(or_proxy_clausification,[],[f102]) ).
thf(f105,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( $false
= ( ( X1 = X3 )
& X0 ) )
| ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
= $true )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true ) ),
inference(or_proxy_clausification,[],[f104]) ).
thf(f106,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
= $true )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( ( X1 = X3 )
= $false )
| ( $false = X0 ) ),
inference(and_proxy_clausification,[],[f105]) ).
thf(f108,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( $false = X0 )
| ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
= $true )
| ( ( X1 = X3 )
= $false ) ),
inference(and_proxy_clausification,[],[f106]) ).
thf(f109,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( ~ X0 ) = $true )
| ( $false = X0 )
| ( ( X1 = X3 )
= $false )
| ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
= $true ) ),
inference(and_proxy_clausification,[],[f108]) ).
thf(f114,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( $false = X0 )
| ( ( X1 = X3 )
= $false )
| ( $false = X0 )
| ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
= $true ) ),
inference(not_proxy_clausification,[],[f109]) ).
thf(f115,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
= $true )
| ( $false = X0 )
| ( $false = X0 )
| ( X1 != X3 ) ),
inference(equality_proxy_clausification,[],[f114]) ).
thf(f116,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( $false = X0 )
| ( X1 != X3 )
| ( $false = X0 )
| ( ( if @ X0 @ X1 @ X2 )
= X1 ) ),
inference(equality_proxy_clausification,[],[f115]) ).
thf(f117,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( if @ X0 @ X1 @ X2 )
= X1 )
| ( $false = X0 )
| ( X1 != X3 ) ),
inference(duplicate_literal_removal,[],[f116]) ).
thf(f125,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( ( X1
= ( if @ X0 @ X1 @ X2 ) )
& X0 )
= $true )
| ( $false
= ( ( X2 = X3 )
& ~ X0 ) )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true ) ),
inference(or_proxy_clausification,[],[f103]) ).
thf(f126,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( $false
= ( ( X2 = X3 )
& ~ X0 ) )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( $true = X0 ) ),
inference(and_proxy_clausification,[],[f125]) ).
thf(f139,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( X2 = X3 )
= $false )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( $false = ( ~ X0 ) )
| ( $true = X0 ) ),
inference(and_proxy_clausification,[],[f126]) ).
thf(f140,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( $true = X0 )
| ( $false = ( ~ X0 ) )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( X2 != X3 ) ),
inference(equality_proxy_clausification,[],[f139]) ).
thf(f141,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( $true = X0 )
| ( X2 != X3 )
| ( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
& ~ X0 )
= $true )
| ( $true = X0 ) ),
inference(not_proxy_clausification,[],[f140]) ).
thf(f143,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( X2
= ( if @ X0 @ X1 @ X2 ) )
= $true )
| ( $true = X0 )
| ( X2 != X3 )
| ( $true = X0 ) ),
inference(and_proxy_clausification,[],[f141]) ).
thf(f144,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( if @ X0 @ X1 @ X2 )
= X2 )
| ( $true = X0 )
| ( X2 != X3 )
| ( $true = X0 ) ),
inference(equality_proxy_clausification,[],[f143]) ).
thf(f145,plain,
! [X2: $i > $i,X3: $i > $i,X0: $o,X1: $i > $i] :
( ( ( if @ X0 @ X1 @ X2 )
= X2 )
| ( $true = X0 )
| ( X2 != X3 ) ),
inference(duplicate_literal_removal,[],[f144]) ).
thf(f169,plain,
! [X0: $i > $i] :
( ( $false = $true )
| ( sK0 != sK0 )
| ( sK0 != X0 )
| ( $false = sK1 ) ),
inference(superposition,[],[f17,f117]) ).
thf(f171,plain,
! [X0: $i > $i] :
( ( sK0 != X0 )
| ( $false = sK1 ) ),
inference(trivial_inequality_removal,[],[f169]) ).
thf(f177,plain,
! [X0: $i > $i] :
( ( sK0 != sK0 )
| ( sK0 != X0 )
| ( sK1 = $true ) ),
inference(superposition,[],[f15,f145]) ).
thf(f181,plain,
! [X0: $i > $i] :
( ( sK0 != X0 )
| ( sK1 = $true ) ),
inference(trivial_inequality_removal,[],[f177]) ).
thf(f184,plain,
$false = sK1,
inference(equality_resolution,[],[f171]) ).
thf(f189,plain,
! [X0: $i > $i] :
( ( sK0 != X0 )
| ( $false = $true ) ),
inference(forward_demodulation,[],[f181,f184]) ).
thf(f190,plain,
! [X0: $i > $i] : ( sK0 != X0 ),
inference(trivial_inequality_removal,[],[f189]) ).
thf(f193,plain,
$false,
inference(equality_resolution,[],[f190]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO543^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n014.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:14:00 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/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 % (2948210)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.29 % (2948217)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1697291945:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.29 % (2948217)Refutation not found, incomplete strategy
% 0.20/0.29 % (2948217)------------------------------
% 0.20/0.29 % (2948217)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (2948217)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (2948217)CaDiCaL version: 2.1.3
% 0.20/0.29 % (2948217)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.29 % (2948217)Time elapsed: 0.001 s
% 0.20/0.29 % (2948217)Peak memory usage: 12 MB
% 0.20/0.29 % (2948217)Instructions burned: 2 (million)
% 0.20/0.29 % (2948217)------------------------------
% 0.20/0.29 % (2948217)------------------------------
% 0.20/0.29 % (2948221)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 % (2948221)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 % (2948216)lrs+10_16_si=on:nwc=1.5:random_seed=1990363238:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.29 % (2948219)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=660708140:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.29 % (2948215)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3690611786:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.29 % (2948218)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=189761555: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 % (2948220)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=326484324:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.29 % (2948221)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=3038469945:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.29 % (2948221)Refutation not found, incomplete strategy
% 0.20/0.29 % (2948221)------------------------------
% 0.20/0.29 % (2948221)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (2948221)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (2948221)CaDiCaL version: 2.1.3
% 0.20/0.29 % (2948221)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.29 % (2948221)Time elapsed: 0.002 s
% 0.20/0.29 % (2948221)Peak memory usage: 12 MB
% 0.20/0.29 % (2948221)Instructions burned: 1 (million)
% 0.20/0.29 % (2948215)Refutation not found, incomplete strategy
% 0.20/0.29 % (2948215)------------------------------
% 0.20/0.29 % (2948215)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (2948215)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (2948215)CaDiCaL version: 2.1.3
% 0.20/0.29 % (2948215)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.29 % (2948215)Time elapsed: 0.003 s
% 0.20/0.29 % (2948215)Peak memory usage: 12 MB
% 0.20/0.29 % (2948215)Instructions burned: 4 (million)
% 0.20/0.29 % (2948221)------------------------------
% 0.20/0.29 % (2948221)------------------------------
% 0.20/0.29 % (2948215)------------------------------
% 0.20/0.29 % (2948215)------------------------------
% 0.20/0.29 % (2948223)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3048855077:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.20/0.29 % (2948219) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2948210-2948219"...
% 0.20/0.29 % (2948218) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2948210-2948218"...
% 0.20/0.29 % (2948223)Instruction limit reached!
% 0.20/0.29 % (2948223)------------------------------
% 0.20/0.29 % (2948223)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (2948223)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (2948223)CaDiCaL version: 2.1.3
% 0.20/0.29 % (2948223)Termination reason: Instruction limit
% 0.20/0.29 % (2948223)Termination phase: Saturation
% 0.20/0.29 % (2948223)Time elapsed: 0.002 s
% 0.20/0.29 % (2948223)Peak memory usage: 12 MB
% 0.20/0.29 % (2948223)Instructions burned: 5 (million)
% 0.20/0.29 % (2948219)...printing done.
% 0.20/0.29 % (2948218)...printing done.
% 0.20/0.29 % (2948219)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 % (2948219)------------------------------
% 0.20/0.29 % (2948219)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (2948219)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (2948219)CaDiCaL version: 2.1.3
% 0.20/0.29 % (2948219)Termination reason: Refutation
% 0.20/0.29 % (2948219)Time elapsed: 0.009 s
% 0.20/0.29 % (2948219)Peak memory usage: 12 MB
% 0.20/0.29 % (2948219)Instructions burned: 14 (million)
% 0.20/0.29 % (2948210)Success in time 0.047 s
% 0.20/0.29 % Vampire exiting
%------------------------------------------------------------------------------