%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU557^2 : TPTP v9.3.1. Bugfixed v5.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:30:03 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 6
% Syntax : Number of formulae : 88 ( 34 unt; 0 typ; 4 def)
% Number of atoms : 444 ( 127 equ; 0 cnn)
% Maximal formula atoms : 7 ( 5 avg)
% Number of connectives : 393 ( 53 ~; 58 |; 27 &; 188 @)
% ( 7 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 31 ( 26 usr; 13 con; 0-4 aty)
% ( 12 !!; 6 ??; 0 @@+; 0 @@-)
% Number of variables : 104 ( 0 sgn 36 !; 6 ?; 104 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
exu: ( $i > $o ) > $o ).
thf(func_def_1,type,
exuEu: $o ).
thf(func_def_2,type,
descr: ( $i > $o ) > $i ).
thf(func_def_3,type,
descrp: $o ).
thf(func_def_7,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_8,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_9,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_10,type,
vAND: $o > $o > $o ).
thf(func_def_11,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_12,type,
vIMP: $o > $o > $o ).
thf(func_def_13,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_16,type,
sK0: $i > $o ).
thf(func_def_17,type,
sK1: $i > $o ).
thf(func_def_18,type,
vNOT: $o > $o ).
thf(func_def_19,type,
sK2: $i > ( $i > $o ) > $i ).
thf(func_def_20,type,
sK3: ( $i > $o ) > $i > $i ).
thf(f1,axiom,
( exu
= ( ^ [X0: $i > $o] :
? [X1: $i] :
( ( X0 @ X1 )
& ! [X2: $i] :
( ( X0 @ X2 )
=> ( X1 = X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exu_def) ).
thf(f4,conjecture,
( descrp
=> ( exuEu
=> ! [X1: $i > $o,X0: $i > $o] :
( ! [X3: $i,X2: $i] :
( ( X2 = X3 )
=> ( ( X1 @ X3 )
<=> ( X0 @ X2 ) ) )
=> ( ( exu
@ ^ [X2: $i] : ( X0 @ X2 ) )
=> ( ( exu
@ ^ [X2: $i] : ( X1 @ X2 ) )
=> ( ( descr
@ ^ [X2: $i] : ( X1 @ X2 ) )
= ( descr
@ ^ [X2: $i] : ( X0 @ X2 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',descr__Cong) ).
thf(f5,negated_conjecture,
~ ( descrp
=> ( exuEu
=> ! [X1: $i > $o,X0: $i > $o] :
( ! [X3: $i,X2: $i] :
( ( X2 = X3 )
=> ( ( X1 @ X3 )
<=> ( X0 @ X2 ) ) )
=> ( ( exu
@ ^ [X2: $i] : ( X0 @ X2 ) )
=> ( ( exu
@ ^ [X2: $i] : ( X1 @ X2 ) )
=> ( ( descr
@ ^ [X2: $i] : ( X1 @ X2 ) )
= ( descr
@ ^ [X2: $i] : ( X0 @ X2 ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
~ ( descrp
=> ( exuEu
=> ! [X0: $i > $o,X1: $i > $o] :
( ! [X2: $i,X3: $i] :
( ( X2 = X3 )
=> ( ( X0 @ X2 )
<=> ( X1 @ X3 ) ) )
=> ( ( exu
@ ^ [X4: $i] : ( X1 @ X4 ) )
=> ( ( exu
@ ^ [X5: $i] : ( X0 @ X5 ) )
=> ( ( descr
@ ^ [X6: $i] : ( X0 @ X6 ) )
= ( descr
@ ^ [X7: $i] : ( X1 @ X7 ) ) ) ) ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
~ ( ( descrp = $true )
=> ( ( exuEu = $true )
=> ! [X1: $i > $o,X0: $i > $o] :
( ! [X2: $i,X3: $i] :
( ( X2 = X3 )
=> ( ( X0 @ X2 )
= ( X1 @ X3 ) ) )
=> ( ( $true
= ( exu
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
=> ( ( $true
= ( exu
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) )
=> ( ( descr
@ ^ [Y0: $i] : ( X0 @ Y0 ) )
= ( descr
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( exu
= ( ^ [X0: $i > $o] :
? [X1: $i] :
( ( X0 @ X1 )
& ! [X2: $i] :
( ( X0 @ X2 )
=> ( X1 = X2 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f9,plain,
( exu
= ( ^ [Y0: $i > $o] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 = Y2 ) ) )
& ( Y0 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f14,plain,
( ? [X1: $i > $o,X0: $i > $o] :
( ( ( descr
@ ^ [Y0: $i] : ( X0 @ Y0 ) )
!= ( descr
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
& ( $true
= ( exu
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) )
& ( $true
= ( exu
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
& ! [X2: $i,X3: $i] :
( ( ( X0 @ X2 )
= ( X1 @ X3 ) )
| ( X2 != X3 ) ) )
& ( exuEu = $true )
& ( descrp = $true ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f15,plain,
( ? [X0: $i > $o,X1: $i > $o] :
( ( ( descr
@ ^ [Y0: $i] : ( X0 @ Y0 ) )
!= ( descr
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
& ( $true
= ( exu
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
& ( $true
= ( exu
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) )
& ! [X2: $i,X3: $i] :
( ( ( X0 @ X2 )
= ( X1 @ X3 ) )
| ( X2 != X3 ) ) )
& ( exuEu = $true )
& ( descrp = $true ) ),
inference(flattening,[],[f14]) ).
thf(f16,plain,
( ( ( descr
@ ^ [Y0: $i] : ( sK0 @ Y0 ) )
!= ( descr
@ ^ [Y0: $i] : ( sK1 @ Y0 ) ) )
& ( $true
= ( exu
@ ^ [Y0: $i] : ( sK1 @ Y0 ) ) )
& ( $true
= ( exu
@ ^ [Y0: $i] : ( sK0 @ Y0 ) ) )
& ! [X2: $i,X3: $i] :
( ( ( sK1 @ X3 )
= ( sK0 @ X2 ) )
| ( X2 != X3 ) )
& ( exuEu = $true )
& ( descrp = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f15]) ).
thf(f17,plain,
( exu
= ( ^ [Y0: $i > $o] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 = Y2 ) ) )
& ( Y0 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f21,plain,
! [X2: $i,X3: $i] :
( ( ( sK1 @ X3 )
= ( sK0 @ X2 ) )
| ( X2 != X3 ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f22,plain,
( $true
= ( exu
@ ^ [Y0: $i] : ( sK0 @ Y0 ) ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f23,plain,
( $true
= ( exu
@ ^ [Y0: $i] : ( sK1 @ Y0 ) ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f24,plain,
( ( descr
@ ^ [Y0: $i] : ( sK0 @ Y0 ) )
!= ( descr
@ ^ [Y0: $i] : ( sK1 @ Y0 ) ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f29,plain,
( $true
= ( ^ [Y0: $i > $o] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 = Y2 ) ) )
& ( Y0 @ Y1 ) ) )
@ ^ [Y0: $i] : ( sK1 @ Y0 ) ) ),
inference(definition_unfolding,[],[f23,f17]) ).
thf(f30,plain,
( $true
= ( ^ [Y0: $i > $o] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 = Y2 ) ) )
& ( Y0 @ Y1 ) ) )
@ ^ [Y0: $i] : ( sK0 @ Y0 ) ) ),
inference(definition_unfolding,[],[f22,f17]) ).
thf(f32,plain,
! [X3: $i] :
( ( sK1 @ X3 )
= ( sK0 @ X3 ) ),
inference(equality_resolution,[],[f21]) ).
thf(f61,plain,
! [X3: $i] :
( ( ( sK0 @ X3 )
= $false )
| ( $true
= ( sK1 @ X3 ) ) ),
inference(iff_proxy_clausification,[],[f32]) ).
thf(f63,plain,
( $true
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( sK1 @ Y1 )
=> ( Y0 = Y1 ) ) )
& ( sK1 @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f29]) ).
thf(f64,plain,
( $true
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( sK1 @ Y1 )
=> ( Y0 = Y1 ) ) )
& ( sK1 @ Y0 ) )
@ sK4 ) ),
inference(sigma_proxy_clausification,[],[f63]) ).
thf(f65,plain,
( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( sK1 @ Y0 )
=> ( sK4 = Y0 ) ) )
& ( sK1 @ sK4 ) ) ),
inference(beta-eta_normalization,[],[f64]) ).
thf(f67,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( sK1 @ Y0 )
=> ( sK4 = Y0 ) ) ) ),
inference(and_proxy_clausification,[],[f65]) ).
thf(f68,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( ( sK1 @ Y0 )
=> ( sK4 = Y0 ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f67]) ).
thf(f69,plain,
! [X1: $i] :
( $true
= ( ( sK1 @ X1 )
=> ( sK4 = X1 ) ) ),
inference(beta-eta_normalization,[],[f68]) ).
thf(f70,plain,
! [X1: $i] :
( ( $true
= ( sK4 = X1 ) )
| ( $false
= ( sK1 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f69]) ).
thf(f71,plain,
! [X1: $i] :
( ( $false
= ( sK1 @ X1 ) )
| ( sK4 = X1 ) ),
inference(equality_proxy_clausification,[],[f70]) ).
thf(f72,plain,
( ( descr @ sK1 )
!= ( descr @ sK0 ) ),
inference(beta-eta_normalization,[],[f24]) ).
thf(f73,plain,
( $true
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y1 )
=> ( Y0 = Y1 ) ) )
& ( sK0 @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f30]) ).
thf(f74,plain,
( $true
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y1 )
=> ( Y0 = Y1 ) ) )
& ( sK0 @ Y0 ) )
@ sK5 ) ),
inference(sigma_proxy_clausification,[],[f73]) ).
thf(f75,plain,
( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( sK0 @ Y0 )
=> ( sK5 = Y0 ) ) )
& ( sK0 @ sK5 ) ) ),
inference(beta-eta_normalization,[],[f74]) ).
thf(f76,plain,
( $true
= ( sK0 @ sK5 ) ),
inference(and_proxy_clausification,[],[f75]) ).
thf(f77,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( sK0 @ Y0 )
=> ( sK5 = Y0 ) ) ) ),
inference(and_proxy_clausification,[],[f75]) ).
thf(f78,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
=> ( sK5 = Y0 ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f77]) ).
thf(f79,plain,
! [X1: $i] :
( $true
= ( ( sK0 @ X1 )
=> ( sK5 = X1 ) ) ),
inference(beta-eta_normalization,[],[f78]) ).
thf(f80,plain,
! [X1: $i] :
( ( ( sK0 @ X1 )
= $false )
| ( $true
= ( sK5 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f79]) ).
thf(f81,plain,
! [X1: $i] :
( ( ( sK0 @ X1 )
= $false )
| ( sK5 = X1 ) ),
inference(equality_proxy_clausification,[],[f80]) ).
thf(f82,plain,
sK0 != sK1,
inference(equality_resolution,[],[f72]) ).
thf(f83,plain,
( ( sK1 @ sK6 )
!= ( sK0 @ sK6 ) ),
inference(negative_extensionality,[],[f82]) ).
thf(f84,plain,
( ( $true
= ( sK1 @ sK6 ) )
| ( $true
= ( sK0 @ sK6 ) ) ),
inference(xor_proxy_clausification,[],[f83]) ).
thf(f85,plain,
( ( $false
= ( sK0 @ sK6 ) )
| ( ( sK1 @ sK6 )
= $false ) ),
inference(xor_proxy_clausification,[],[f83]) ).
thf(f87,definition,
( spl7_1
<=> ( $false
= ( sK0 @ sK6 ) ) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
thf(f89,plain,
( ( $false
= ( sK0 @ sK6 ) )
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f87]) ).
thf(f91,definition,
( spl7_2
<=> ( ( sK1 @ sK6 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
thf(f92,plain,
( ( ( sK1 @ sK6 )
!= $false )
| spl7_2 ),
inference(avatar_component_clause,[],[f91]) ).
thf(f93,plain,
( ( ( sK1 @ sK6 )
= $false )
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f91]) ).
thf(f94,plain,
( spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f85,f91,f87]) ).
thf(f96,definition,
( spl7_3
<=> ( $true
= ( sK0 @ sK6 ) ) ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
thf(f97,plain,
( ( $true
!= ( sK0 @ sK6 ) )
| spl7_3 ),
inference(avatar_component_clause,[],[f96]) ).
thf(f98,plain,
( ( $true
= ( sK0 @ sK6 ) )
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f96]) ).
thf(f100,definition,
( spl7_4
<=> ( $true
= ( sK1 @ sK6 ) ) ),
introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).
thf(f102,plain,
( ( $true
= ( sK1 @ sK6 ) )
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f100]) ).
thf(f103,plain,
( spl7_3
| spl7_4 ),
inference(avatar_split_clause,[],[f84,f100,f96]) ).
thf(f105,plain,
( ( sK5 = sK6 )
| ( $true = $false )
| ~ spl7_3 ),
inference(constrained_superposition,[],[f98,f81]) ).
thf(f106,plain,
( ( sK5 = sK6 )
| ~ spl7_3 ),
inference(trivial_inequality_removal,[],[f105]) ).
thf(f110,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( $true = $false ) ),
inference(constrained_superposition,[],[f61,f76]) ).
thf(f113,plain,
( ( $true
= ( sK1 @ sK6 ) )
| ( $true = $false )
| ~ spl7_3 ),
inference(constrained_superposition,[],[f98,f61]) ).
thf(f116,plain,
( ( sK1 @ sK5 )
= $true ),
inference(trivial_inequality_removal,[],[f110]) ).
thf(f117,plain,
( ( $true
= ( sK1 @ sK6 ) )
| ~ spl7_3 ),
inference(trivial_inequality_removal,[],[f113]) ).
thf(f127,plain,
( ( $true = $false )
| ~ spl7_2
| ~ spl7_3 ),
inference(forward_demodulation,[],[f117,f93]) ).
thf(f128,plain,
( $false
| ~ spl7_2
| ~ spl7_3 ),
inference(trivial_inequality_removal,[],[f127]) ).
thf(f129,plain,
( ~ spl7_2
| ~ spl7_3 ),
inference(avatar_contradiction_clause,[],[f128]) ).
thf(f133,plain,
( ( ( sK0 @ sK5 )
= $false )
| ~ spl7_1
| ~ spl7_3 ),
inference(forward_demodulation,[],[f89,f106]) ).
thf(f136,plain,
( ( $true = $false )
| ( sK5 = sK4 ) ),
inference(constrained_superposition,[],[f71,f116]) ).
thf(f137,plain,
sK5 = sK4,
inference(trivial_inequality_removal,[],[f136]) ).
thf(f140,plain,
( $true
= ( sK0 @ sK4 ) ),
inference(constrained_superposition,[],[f76,f137]) ).
thf(f143,plain,
( ( $true = $false )
| ~ spl7_1
| ~ spl7_3 ),
inference(constrained_superposition,[],[f76,f133]) ).
thf(f144,plain,
( $false
| ~ spl7_1
| ~ spl7_3 ),
inference(trivial_inequality_removal,[],[f143]) ).
thf(f145,plain,
( ~ spl7_1
| ~ spl7_3 ),
inference(avatar_contradiction_clause,[],[f144]) ).
thf(f148,plain,
( ( $true = $false )
| ~ spl7_2
| ~ spl7_4 ),
inference(forward_demodulation,[],[f102,f93]) ).
thf(f149,plain,
( $false
| ~ spl7_2
| ~ spl7_4 ),
inference(trivial_inequality_removal,[],[f148]) ).
thf(f150,plain,
( ~ spl7_2
| ~ spl7_4 ),
inference(avatar_contradiction_clause,[],[f149]) ).
thf(f151,plain,
( ( sK4 = sK6 )
| ( $false != $false )
| spl7_2 ),
inference(constrained_superposition,[],[f92,f71]) ).
thf(f152,plain,
( ( sK4 = sK6 )
| spl7_2 ),
inference(trivial_inequality_removal,[],[f151]) ).
thf(f156,plain,
( ( $true
!= ( sK0 @ sK4 ) )
| spl7_2
| spl7_3 ),
inference(constrained_superposition,[],[f97,f152]) ).
thf(f160,plain,
( $false
| spl7_2
| spl7_3 ),
inference(forward_subsumption_resolution,[],[f156,f140]) ).
thf(f161,plain,
( spl7_2
| spl7_3 ),
inference(avatar_contradiction_clause,[],[f160]) ).
cnf(s1,plain,
( spl7_1
| spl7_2 ),
inference(sat_conversion,[],[f94]) ).
cnf(s2,plain,
( spl7_3
| spl7_4 ),
inference(sat_conversion,[],[f103]) ).
cnf(s6,plain,
( ~ spl7_2
| ~ spl7_3 ),
inference(sat_conversion,[],[f129]) ).
cnf(s7,plain,
( ~ spl7_1
| ~ spl7_3 ),
inference(sat_conversion,[],[f145]) ).
cnf(s9,plain,
( ~ spl7_2
| ~ spl7_4 ),
inference(sat_conversion,[],[f150]) ).
cnf(s10,plain,
( spl7_2
| spl7_3 ),
inference(sat_conversion,[],[f161]) ).
cnf(s11,plain,
~ spl7_2,
inference(rat,[],[s2,s6,s9]) ).
cnf(s12,plain,
spl7_3,
inference(rat,[],[s10,s11]) ).
cnf(s13,plain,
spl7_1,
inference(rat,[],[s1,s11]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s7,s12,s13]) ).
thf(f162,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU557^2 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.17 % Computer : n013.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 13:49:21 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 Running higher-order theorem proving
% 0.07/0.22 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.20/0.28 % (2145237)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.28 % (2145257)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.28 % (2145257)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.28 % (2145251)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=4011819184:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.28 % (2145252)lrs+10_16_si=on:nwc=1.5:random_seed=2762833959:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.28 % (2145253)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3958988381:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.28 % (2145257)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=1459552560:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.28 % (2145254)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=3589293095: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.28 % (2145255)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2770684114:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.28 % (2145253)Refutation not found, incomplete strategy
% 0.20/0.28 % (2145253)------------------------------
% 0.20/0.28 % (2145253)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (2145253)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (2145253)CaDiCaL version: 2.1.3
% 0.20/0.28 % (2145253)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.28 % (2145253)Time elapsed: 0.002 s
% 0.20/0.28 % (2145253)Peak memory usage: 12 MB
% 0.20/0.28 % (2145253)Instructions burned: 3 (million)
% 0.20/0.28 % (2145253)------------------------------
% 0.20/0.28 % (2145253)------------------------------
% 0.20/0.28 % (2145256)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1221965027:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.28 % (2145252) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2145237-2145252"...
% 0.20/0.28 % (2145254) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2145237-2145254"...
% 0.20/0.28 % (2145255) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2145237-2145255"...
% 0.20/0.28 % (2145251) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2145237-2145251"...
% 0.20/0.28 % (2145252)...printing done.
% 0.20/0.28 % (2145252)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (2145252)------------------------------
% 0.20/0.28 % (2145252)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (2145252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (2145252)CaDiCaL version: 2.1.3
% 0.20/0.28 % (2145252)Termination reason: Refutation
% 0.20/0.28 % (2145252)Time elapsed: 0.007 s
% 0.20/0.28 % (2145252)Peak memory usage: 13 MB
% 0.20/0.28 % (2145252)Instructions burned: 10 (million)
% 0.20/0.28 % (2145237)Success in time 0.047 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------