%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO360^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 : n001.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:47:31 AM UTC 2026
% Result : Theorem 0.26s 0.32s
% Output : Refutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 23 ( 22 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 77 ( 9 ~; 0 |; 7 &; 58 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 0 ^; 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
j: a > a ).
thf(func_def_1,type,
g: ( a > a ) > a > a ).
thf(func_def_2,type,
h: a > a ).
thf(func_def_3,type,
f: ( a > a ) > a > a ).
thf(func_def_5,type,
sK0: a ).
thf(func_def_6,type,
sK1: a ).
thf(f1,conjecture,
( ( ! [X2: a] :
( ( h @ X2 )
= ( j @ X2 ) )
& ! [X0: a > a,X1: a] :
( ( f @ X0 @ X1 )
= ( g @ X0 @ X1 ) ) )
=> ( ( f @ h )
= ( g @ j ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cEDEC1) ).
thf(f2,negated_conjecture,
~ ( ( ! [X2: a] :
( ( h @ X2 )
= ( j @ X2 ) )
& ! [X0: a > a,X1: a] :
( ( f @ X0 @ X1 )
= ( g @ X0 @ X1 ) ) )
=> ( ( f @ h )
= ( g @ j ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ! [X0: a] :
( ( j @ X0 )
= ( h @ X0 ) )
& ! [X1: a > a,X2: a] :
( ( f @ X1 @ X2 )
= ( g @ X1 @ X2 ) ) )
=> ( ( f @ h )
= ( g @ j ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
( ( ( f @ h )
!= ( g @ j ) )
& ! [X0: a] :
( ( j @ X0 )
= ( h @ X0 ) )
& ! [X1: a > a,X2: a] :
( ( f @ X1 @ X2 )
= ( g @ X1 @ X2 ) ) ),
inference(ennf_transformation,[],[f3]) ).
thf(f5,plain,
( ( ( f @ h )
!= ( g @ j ) )
& ! [X0: a] :
( ( j @ X0 )
= ( h @ X0 ) )
& ! [X1: a > a,X2: a] :
( ( f @ X1 @ X2 )
= ( g @ X1 @ X2 ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
! [X2: a,X1: a > a] :
( ( f @ X1 @ X2 )
= ( g @ X1 @ X2 ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f7,plain,
! [X0: a] :
( ( j @ X0 )
= ( h @ X0 ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f8,plain,
( ( f @ h )
!= ( g @ j ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f9,plain,
( ( f @ h @ sK0 )
!= ( g @ j @ sK0 ) ),
inference(negative_extensionality,[],[f8]) ).
thf(f10,plain,
( ( g @ h @ sK0 )
!= ( g @ j @ sK0 ) ),
inference(forward_demodulation,[],[f9,f6]) ).
thf(f11,plain,
h != j,
inference(equality_resolution,[],[f10]) ).
thf(f12,plain,
( ( j @ sK1 )
!= ( h @ sK1 ) ),
inference(negative_extensionality,[],[f11]) ).
thf(f13,plain,
$false,
inference(forward_subsumption_resolution,[],[f12,f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO360^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.11/0.23 % Computer : n001.cluster.edu
% 0.11/0.23 % Model : x86_64 x86_64
% 0.11/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.23 % Memory : 8046.5625MB
% 0.11/0.23 % OS : Linux 6.8.0-71-generic
% 0.11/0.23 % CPULimit : 300
% 0.11/0.23 % WCLimit : 300
% 0.11/0.23 % DateTime : Tue Sep 29 16:54:36 UTC 2026
% 0.11/0.24 % CPUTime :
% 0.11/0.24 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.28 Running higher-order theorem proving
% 0.11/0.29 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.26/0.32 % (1499330)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.26/0.32 % (1499342)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3508444997:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_3000 on theBenchmark for (3000ds/75Mi)
% 0.26/0.32 % (1499342) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1499330-1499342"...
% 0.26/0.32 % (1499342)...printing done.
% 0.26/0.32 % (1499342)Refutation found. Thanks to Tanya!
% 0.26/0.32 % SZS status Theorem for theBenchmark
% 0.26/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.26/0.32 % (1499342)------------------------------
% 0.26/0.32 % (1499342)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.32 % (1499342)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.32 % (1499342)CaDiCaL version: 2.1.3
% 0.26/0.32 % (1499342)Termination reason: Refutation
% 0.26/0.32 % (1499342)Time elapsed: 0.001 s
% 0.26/0.32 % (1499342)Peak memory usage: 12 MB
% 0.26/0.32 % (1499342)Instructions burned: 1 (million)
% 0.26/0.32 % (1499330)Success in time 0.021 s
% 0.26/0.32 % Vampire exiting
%------------------------------------------------------------------------------