%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV241^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:38:06 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 136 ( 48 equ; 0 cnn)
% Maximal formula atoms : 5 ( 6 avg)
% Number of connectives : 80 ( 7 ~; 16 |; 13 &; 36 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 0 ^; 12 !; 4 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cW: a > $o ).
thf(func_def_1,type,
cU: a > $o ).
thf(func_def_5,type,
sK0: a ).
thf(func_def_6,type,
sK1: a > $o ).
thf(f1,conjecture,
! [X0: a] :
( ( ( cU @ X0 )
& ( cW @ X0 ) )
=> ! [X1: a > $o] :
( ( ( X1 = cU )
| ( X1 = cW ) )
=> ( X1 @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5201A_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ( ( cU @ X0 )
& ( cW @ X0 ) )
=> ! [X1: a > $o] :
( ( ( X1 = cU )
| ( X1 = cW ) )
=> ( X1 @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a] :
( ( ( cU @ X0 )
& ( cW @ X0 ) )
=> ! [X1: a > $o] :
( ( ( X1 = cU )
| ( X1 = cW ) )
=> ( X1 @ X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a] :
( ( ( ( cU @ X0 )
= $true )
& ( ( cW @ X0 )
= $true ) )
=> ! [X1: a > $o] :
( ( ( cW = X1 )
| ( cU = X1 ) )
=> ( ( X1 @ X0 )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: a] :
( ? [X1: a > $o] :
( ( ( cW = X1 )
| ( cU = X1 ) )
& ( ( X1 @ X0 )
!= $true ) )
& ( ( cU @ X0 )
= $true )
& ( ( cW @ X0 )
= $true ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: a] :
( ( ( cW @ X0 )
= $true )
& ? [X1: a > $o] :
( ( ( cW = X1 )
| ( cU = X1 ) )
& ( ( X1 @ X0 )
!= $true ) )
& ( ( cU @ X0 )
= $true ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
( ( ( cW @ sK0 )
= $true )
& ( ( cW = sK1 )
| ( cU = sK1 ) )
& ( ( sK1 @ sK0 )
!= $true )
& ( ( cU @ sK0 )
= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f6]) ).
thf(f8,plain,
( ( cU @ sK0 )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
( ( sK1 @ sK0 )
!= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
( ( cW = sK1 )
| ( cU = sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
( ( cW @ sK0 )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f13,plain,
! [X1: a] :
( ( ( sK1 @ X1 )
= ( cW @ X1 ) )
| ( cU = sK1 ) ),
inference(argument_congruence,[],[f10]) ).
thf(f14,plain,
! [X1: a] :
( ( ( cW @ X1 )
= $false )
| ( cU = sK1 )
| ( ( sK1 @ X1 )
= $true ) ),
inference(iff_proxy_clausification,[],[f13]) ).
thf(f17,plain,
( ( ( sK1 @ sK0 )
= $true )
| ( cU = sK1 )
| ( $false = $true ) ),
inference(superposition,[],[f11,f14]) ).
thf(f18,plain,
( ( cU = sK1 )
| ( ( sK1 @ sK0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f17]) ).
thf(f20,plain,
cU = sK1,
inference(forward_subsumption_resolution,[],[f18,f9]) ).
thf(f22,plain,
! [X1: a] :
( ( cU @ X1 )
= ( sK1 @ X1 ) ),
inference(argument_congruence,[],[f20]) ).
thf(f24,plain,
! [X1: a] :
( ( ( cU @ X1 )
= $false )
| ( ( sK1 @ X1 )
= $true ) ),
inference(iff_proxy_clausification,[],[f22]) ).
thf(f27,plain,
( ( $false = $true )
| ( ( sK1 @ sK0 )
= $true ) ),
inference(superposition,[],[f8,f24]) ).
thf(f29,plain,
( ( sK1 @ sK0 )
= $true ),
inference(trivial_inequality_removal,[],[f27]) ).
thf(f33,plain,
$false,
inference(forward_subsumption_resolution,[],[f29,f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV241^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 % Computer : n026.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 15:29:27 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 Running higher-order theorem proving
% 0.10/0.24 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.27 % (730796)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.27 % (730805)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=169641390:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.27 % (730805) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-730796-730805"...
% 0.20/0.27 % (730805)...printing done.
% 0.20/0.27 % (730805)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (730805)------------------------------
% 0.20/0.27 % (730805)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (730805)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (730805)CaDiCaL version: 2.1.3
% 0.20/0.27 % (730805)Termination reason: Refutation
% 0.20/0.27 % (730805)Time elapsed: 0.001 s
% 0.20/0.27 % (730805)Peak memory usage: 12 MB
% 0.20/0.27 % (730805)Instructions burned: 2 (million)
% 0.20/0.27 % (730796)Success in time 0.025 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------