%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU927^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:31:57 AM UTC 2026
% Result : Theorem 0.22s 0.29s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 78 ( 31 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 126 ( 14 ~; 6 |; 11 &; 85 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 3 con; 0-4 aty)
% Number of variables : 56 ( 33 ^; 19 !; 4 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_3,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_4,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_5,type,
sK0: ( a > a ) > $o ).
thf(func_def_6,type,
sK1: a > a ).
thf(func_def_7,type,
sK2: a ).
thf(f1,conjecture,
! [X1: ( a > a ) > $o,X0: a > a] :
( ( ( X1
@ ^ [X2: a] : X2 )
& ! [X3: a > a] :
( ( X1 @ X3 )
=> ( X1
@ ^ [X4: a] : ( X0 @ ( X3 @ X4 ) ) ) ) )
=> ( X1
@ ^ [X4: a] : ( X0 @ ( X0 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM92_pme) ).
thf(f2,negated_conjecture,
~ ! [X1: ( a > a ) > $o,X0: a > a] :
( ( ( X1
@ ^ [X2: a] : X2 )
& ! [X3: a > a] :
( ( X1 @ X3 )
=> ( X1
@ ^ [X4: a] : ( X0 @ ( X3 @ X4 ) ) ) ) )
=> ( X1
@ ^ [X4: a] : ( X0 @ ( X0 @ X4 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: ( a > a ) > $o,X1: a > a] :
( ( ( X0
@ ^ [X2: a] : X2 )
& ! [X3: a > a] :
( ( X0 @ X3 )
=> ( X0
@ ^ [X4: a] : ( X1 @ ( X3 @ X4 ) ) ) ) )
=> ( X0
@ ^ [X5: a] : ( X1 @ ( X1 @ X5 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: ( a > a ) > $o,X1: a > a] :
( ( ( ( X0
@ ^ [Y0: a] : Y0 )
= $true )
& ! [X3: a > a] :
( ( $true
= ( X0 @ X3 ) )
=> ( $true
= ( X0
@ ^ [Y0: a] : ( X1 @ ( X3 @ Y0 ) ) ) ) ) )
=> ( ( X0
@ ^ [Y0: a] : ( X1 @ ( X1 @ Y0 ) ) )
= $true ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
~ ! [X0: ( a > a ) > $o,X1: a > a] :
( ( ( ( X0
@ ^ [Y0: a] : Y0 )
= $true )
& ! [X2: a > a] :
( ( ( X0 @ X2 )
= $true )
=> ( ( X0
@ ^ [Y0: a] : ( X1 @ ( X2 @ Y0 ) ) )
= $true ) ) )
=> ( ( X0
@ ^ [Y0: a] : ( X1 @ ( X1 @ Y0 ) ) )
= $true ) ),
inference(rectify,[],[f4]) ).
thf(f6,plain,
? [X0: ( a > a ) > $o,X1: a > a] :
( ( ( X0
@ ^ [Y0: a] : ( X1 @ ( X1 @ Y0 ) ) )
!= $true )
& ( ( X0
@ ^ [Y0: a] : Y0 )
= $true )
& ! [X2: a > a] :
( ( ( X0
@ ^ [Y0: a] : ( X1 @ ( X2 @ Y0 ) ) )
= $true )
| ( ( X0 @ X2 )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f7,plain,
? [X0: ( a > a ) > $o,X1: a > a] :
( ( ( X0
@ ^ [Y0: a] : Y0 )
= $true )
& ( ( X0
@ ^ [Y0: a] : ( X1 @ ( X1 @ Y0 ) ) )
!= $true )
& ! [X2: a > a] :
( ( ( X0
@ ^ [Y0: a] : ( X1 @ ( X2 @ Y0 ) ) )
= $true )
| ( ( X0 @ X2 )
!= $true ) ) ),
inference(flattening,[],[f6]) ).
thf(f8,plain,
( ( $true
= ( sK0
@ ^ [Y0: a] : Y0 ) )
& ( ( sK0
@ ^ [Y0: a] : ( sK1 @ ( sK1 @ Y0 ) ) )
!= $true )
& ! [X2: a > a] :
( ( ( sK0
@ ^ [Y0: a] : ( sK1 @ ( X2 @ Y0 ) ) )
= $true )
| ( ( sK0 @ X2 )
!= $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f7]) ).
thf(f9,plain,
! [X2: a > a] :
( ( ( sK0 @ X2 )
!= $true )
| ( ( sK0
@ ^ [Y0: a] : ( sK1 @ ( X2 @ Y0 ) ) )
= $true ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f10,plain,
( ( sK0
@ ^ [Y0: a] : ( sK1 @ ( sK1 @ Y0 ) ) )
!= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f11,plain,
( $true
= ( sK0
@ ^ [Y0: a] : Y0 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f18,plain,
( ( $true
= ( sK0
@ ^ [Y0: a] :
( sK1
@ ( ^ [Y1: a] : Y1
@ Y0 ) ) ) )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f9,f11]) ).
thf(f19,plain,
( $true
= ( sK0
@ ^ [Y0: a] :
( sK1
@ ( ^ [Y1: a] : Y1
@ Y0 ) ) ) ),
inference(trivial_inequality_removal,[],[f18]) ).
thf(f20,plain,
( $true
= ( sK0 @ sK1 ) ),
inference(beta-eta_normalization,[],[f19]) ).
thf(f22,plain,
( ( $true != $true )
| ( ( sK0
@ ^ [Y0: a] : ( sK1 @ ( sK1 @ Y0 ) ) )
= $true ) ),
inference(constrained_superposition,[],[f9,f20]) ).
thf(f23,plain,
( ( sK0
@ ^ [Y0: a] : ( sK1 @ ( sK1 @ Y0 ) ) )
= $true ),
inference(trivial_inequality_removal,[],[f22]) ).
thf(f25,plain,
$false,
inference(forward_subsumption_resolution,[],[f23,f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU927^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 % Computer : n008.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 14:47:24 UTC 2026
% 0.08/0.21 % CPUTime :
% 0.08/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.08/0.25 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.22/0.29 % (3260856)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.29 % (3260866)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2499729380:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.22/0.29 % (3260866) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3260856-3260866"...
% 0.22/0.29 % (3260866)...printing done.
% 0.22/0.29 % (3260867)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.29 % (3260867)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.22/0.29 % (3260866)Refutation found. Thanks to Tanya!
% 0.22/0.29 % SZS status Theorem for theBenchmark
% 0.22/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.29 % (3260866)------------------------------
% 0.22/0.29 % (3260866)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (3260866)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (3260866)CaDiCaL version: 2.1.3
% 0.22/0.29 % (3260866)Termination reason: Refutation
% 0.22/0.29 % (3260866)Time elapsed: 0.001 s
% 0.22/0.29 % (3260866)Peak memory usage: 12 MB
% 0.22/0.29 % (3260866)Instructions burned: 2 (million)
% 0.22/0.29 % (3260856)Success in time 0.027 s
% 0.22/0.29 % Vampire exiting
%------------------------------------------------------------------------------