%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU889^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 : n007.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:53 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 66 ( 37 equ; 0 cnn)
% Maximal formula atoms : 5 ( 4 avg)
% Number of connectives : 95 ( 14 ~; 5 |; 21 &; 51 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 26 ( 0 ^; 8 !; 18 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
c: $tType ).
thf(type_def_6,type,
b: $tType ).
thf(type_def_7,type,
a: $tType ).
thf(type_def_8,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cG: c > b ).
thf(func_def_1,type,
cF: b > a ).
thf(func_def_2,type,
cS: c > $o ).
thf(func_def_6,type,
sK0: a ).
thf(func_def_7,type,
sK1: b ).
thf(func_def_8,type,
sK2: c ).
thf(f1,conjecture,
! [X0: a] :
( ? [X1: b] :
( ? [X2: c] :
( ( X1
= ( cG @ X2 ) )
& ( cS @ X2 ) )
& ( X0
= ( cF @ X1 ) ) )
=> ? [X1: c] :
( ( X0
= ( cF @ ( cG @ X1 ) ) )
& ( cS @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM29A_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ? [X1: b] :
( ? [X2: c] :
( ( X1
= ( cG @ X2 ) )
& ( cS @ X2 ) )
& ( X0
= ( cF @ X1 ) ) )
=> ? [X1: c] :
( ( X0
= ( cF @ ( cG @ X1 ) ) )
& ( cS @ X1 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a] :
( ? [X1: b] :
( ? [X2: c] :
( ( X1
= ( cG @ X2 ) )
& ( cS @ X2 ) )
& ( X0
= ( cF @ X1 ) ) )
=> ? [X3: c] :
( ( ( cF @ ( cG @ X3 ) )
= X0 )
& ( cS @ X3 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a] :
( ? [X1: b] :
( ? [X2: c] :
( ( ( cG @ X2 )
= X1 )
& ( ( cS @ X2 )
= $true ) )
& ( ( cF @ X1 )
= X0 ) )
=> ? [X3: c] :
( ( $true
= ( cS @ X3 ) )
& ( ( cF @ ( cG @ X3 ) )
= X0 ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: a] :
( ! [X3: c] :
( ( ( cF @ ( cG @ X3 ) )
!= X0 )
| ( $true
!= ( cS @ X3 ) ) )
& ? [X1: b] :
( ? [X2: c] :
( ( ( cG @ X2 )
= X1 )
& ( ( cS @ X2 )
= $true ) )
& ( ( cF @ X1 )
= X0 ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: a] :
( ! [X1: c] :
( ( ( cF @ ( cG @ X1 ) )
!= X0 )
| ( ( cS @ X1 )
!= $true ) )
& ? [X2: b] :
( ? [X3: c] :
( ( ( cG @ X3 )
= X2 )
& ( $true
= ( cS @ X3 ) ) )
& ( ( cF @ X2 )
= X0 ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
( ! [X1: c] :
( ( ( cF @ ( cG @ X1 ) )
!= sK0 )
| ( ( cS @ X1 )
!= $true ) )
& ( sK1
= ( cG @ sK2 ) )
& ( $true
= ( cS @ sK2 ) )
& ( sK0
= ( cF @ sK1 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X2,sK1),skolemize(X3,sK2)],[f6]) ).
thf(f8,plain,
( sK0
= ( cF @ sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
( $true
= ( cS @ sK2 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
( sK1
= ( cG @ sK2 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
! [X1: c] :
( ( ( cF @ ( cG @ X1 ) )
!= sK0 )
| ( ( cS @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f14,plain,
( ( $true
!= ( cS @ sK2 ) )
| ( sK0
!= ( cF @ sK1 ) ) ),
inference(constrained_superposition,[],[f11,f10]) ).
thf(f15,plain,
( sK0
!= ( cF @ sK1 ) ),
inference(forward_subsumption_resolution,[],[f14,f9]) ).
thf(f16,plain,
$false,
inference(forward_subsumption_resolution,[],[f15,f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU889^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.18 % Computer : n007.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 14:42:11 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 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.27 % (3456358)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.27 % (3456365)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3498888729:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.27 % (3456365) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3456358-3456365"...
% 0.20/0.27 % (3456365)...printing done.
% 0.20/0.27 % (3456365)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 % (3456365)------------------------------
% 0.20/0.27 % (3456365)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (3456365)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (3456365)CaDiCaL version: 2.1.3
% 0.20/0.27 % (3456365)Termination reason: Refutation
% 0.20/0.27 % (3456365)Time elapsed: 0.001 s
% 0.20/0.27 % (3456365)Peak memory usage: 12 MB
% 0.20/0.27 % (3456365)Instructions burned: 1 (million)
% 0.20/0.27 % (3456358)Success in time 0.03 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------