%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV394^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 : 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:38:34 AM UTC 2026
% Result : Theorem 0.07s 0.27s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 1
% Syntax : Number of formulae : 26 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 186 ( 73 equ; 0 cnn)
% Maximal formula atoms : 6 ( 7 avg)
% Number of connectives : 214 ( 37 ~; 21 |; 38 &; 100 @)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 79 ( 26 ^; 41 !; 12 ?; 79 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_3,type,
vAND: $o > $o > $o ).
thf(func_def_4,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_5,type,
vNOT: $o > $o ).
thf(func_def_6,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_7,type,
sK0: a > $o ).
thf(func_def_8,type,
sK1: a > $o ).
thf(func_def_9,type,
sK2: a > $o ).
thf(func_def_10,type,
sK3: a ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ( ( ^ [X3: a] :
( ~ ( X1 @ X3 )
& ( X2 @ X3 ) ) )
= ( ^ [X3: a] : $false ) )
& ! [X3: a] :
( ( ~ ( X2 @ X3 )
& ( X0 @ X3 ) )
=> ( X1 @ X3 ) ) )
=> ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM269_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ( ( ^ [X3: a] :
( ~ ( X1 @ X3 )
& ( X2 @ X3 ) ) )
= ( ^ [X3: a] : $false ) )
& ! [X3: a] :
( ( ~ ( X2 @ X3 )
& ( X0 @ X3 ) )
=> ( X1 @ X3 ) ) )
=> ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ X3 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ( ( ^ [X3: a] :
( ~ ( X1 @ X3 )
& ( X2 @ X3 ) ) )
= ( ^ [X4: a] : $false ) )
& ! [X5: a] :
( ( ~ ( X2 @ X5 )
& ( X0 @ X5 ) )
=> ( X1 @ X5 ) ) )
=> ! [X6: a] :
( ( X0 @ X6 )
=> ( X1 @ X6 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
& ~ ( X1 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
& ! [X5: a] :
( ( ( $true
!= ( X2 @ X5 ) )
& ( $true
= ( X0 @ X5 ) ) )
=> ( $true
= ( X1 @ X5 ) ) ) )
=> ! [X6: a] :
( ( $true
= ( X0 @ X6 ) )
=> ( ( X1 @ X6 )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
& ~ ( X1 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
& ! [X3: a] :
( ( ( ( X2 @ X3 )
!= $true )
& ( ( X0 @ X3 )
= $true ) )
=> ( ( X1 @ X3 )
= $true ) ) )
=> ! [X4: a] :
( ( $true
= ( X0 @ X4 ) )
=> ( $true
= ( X1 @ X4 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f6,plain,
~ ! [X2: a > $o,X1: a > $o,X0: a > $o] :
( ( ! [X3: a] :
( ( ( ( X0 @ X3 )
= $true )
& ( ( X2 @ X3 )
!= $true ) )
=> ( ( X1 @ X3 )
= $true ) )
& ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
& ~ ( X1 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) ) )
=> ! [X4: a] :
( ( $true
= ( X0 @ X4 ) )
=> ( $true
= ( X1 @ X4 ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
? [X2: a > $o,X1: a > $o,X0: a > $o] :
( ? [X4: a] :
( ( $true
= ( X0 @ X4 ) )
& ( $true
!= ( X1 @ X4 ) ) )
& ! [X3: a] :
( ( ( X1 @ X3 )
= $true )
| ( ( X0 @ X3 )
!= $true )
| ( ( X2 @ X3 )
= $true ) )
& ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
& ~ ( X1 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f8,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
& ~ ( X1 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
& ? [X4: a] :
( ( $true
= ( X0 @ X4 ) )
& ( $true
!= ( X1 @ X4 ) ) )
& ! [X3: a] :
( ( ( X0 @ X3 )
!= $true )
| ( ( X1 @ X3 )
= $true )
| ( ( X2 @ X3 )
= $true ) ) ),
inference(flattening,[],[f7]) ).
thf(f9,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
& ~ ( X1 @ Y0 ) ) )
= ( ^ [Y0: a] : $false ) )
& ? [X3: a] :
( ( ( X0 @ X3 )
= $true )
& ( ( X1 @ X3 )
!= $true ) )
& ! [X4: a] :
( ( $true
!= ( X0 @ X4 ) )
| ( $true
= ( X1 @ X4 ) )
| ( $true
= ( X2 @ X4 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f10,plain,
( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) )
& ( ( sK0 @ sK3 )
= $true )
& ( $true
!= ( sK1 @ sK3 ) )
& ! [X4: a] :
( ( $true
!= ( sK0 @ X4 ) )
| ( $true
= ( sK1 @ X4 ) )
| ( $true
= ( sK2 @ X4 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f9]) ).
thf(f11,plain,
! [X4: a] :
( ( $true
!= ( sK0 @ X4 ) )
| ( $true
= ( sK2 @ X4 ) )
| ( $true
= ( sK1 @ X4 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f12,plain,
( $true
!= ( sK1 @ sK3 ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f13,plain,
( ( sK0 @ sK3 )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f14,plain,
( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ~ ( sK1 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f17,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f11,f13]) ).
thf(f18,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $true
= ( sK2 @ sK3 ) ) ),
inference(trivial_inequality_removal,[],[f17]) ).
thf(f19,plain,
( $true
= ( sK2 @ sK3 ) ),
inference(forward_subsumption_resolution,[],[f18,f12]) ).
thf(f20,plain,
! [X1: a] :
( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ~ ( sK1 @ Y0 ) )
@ X1 )
= ( ^ [Y0: a] : $false
@ X1 ) ),
inference(argument_congruence,[],[f14]) ).
thf(f22,plain,
! [X1: a] :
( ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
& ~ ( sK1 @ Y0 ) )
@ X1 )
= $false )
| ( $true
= ( ^ [Y0: a] : $false
@ X1 ) ) ),
inference(iff_proxy_clausification,[],[f20]) ).
thf(f23,plain,
! [X1: a] :
( ( ( ( sK2 @ X1 )
& ~ ( sK1 @ X1 ) )
= $false )
| ( $true = $false ) ),
inference(beta-eta_normalization,[],[f22]) ).
thf(f24,plain,
! [X1: a] :
( ( $false
= ( ~ ( sK1 @ X1 ) ) )
| ( ( sK2 @ X1 )
= $false )
| ( $true = $false ) ),
inference(and_proxy_clausification,[],[f23]) ).
thf(f25,plain,
! [X1: a] :
( ( $true
= ( sK1 @ X1 ) )
| ( ( sK2 @ X1 )
= $false )
| ( $true = $false ) ),
inference(not_proxy_clausification,[],[f24]) ).
thf(f26,plain,
! [X1: a] :
( ( ( sK2 @ X1 )
= $false )
| ( $true
= ( sK1 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f25]) ).
thf(f31,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $true = $false ) ),
inference(constrained_superposition,[],[f26,f19]) ).
thf(f33,plain,
( $true
= ( sK1 @ sK3 ) ),
inference(trivial_inequality_removal,[],[f31]) ).
thf(f35,plain,
$false,
inference(forward_subsumption_resolution,[],[f33,f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV394^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.07/0.17 % Computer : n007.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 15:41:56 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 Running higher-order theorem proving
% 0.07/0.22 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.07/0.27 % (3528939)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.07/0.27 % (3528944)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2056731412:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.07/0.27 % (3528944) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3528939-3528944"...
% 0.07/0.27 % (3528944)...printing done.
% 0.07/0.27 % (3528944)Refutation found. Thanks to Tanya!
% 0.07/0.27 % SZS status Theorem for theBenchmark
% 0.07/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.27 % (3528944)------------------------------
% 0.07/0.27 % (3528944)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.27 % (3528944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.27 % (3528944)CaDiCaL version: 2.1.3
% 0.07/0.27 % (3528944)Termination reason: Refutation
% 0.07/0.27 % (3528944)Time elapsed: 0.001 s
% 0.07/0.27 % (3528944)Peak memory usage: 12 MB
% 0.07/0.27 % (3528944)Instructions burned: 2 (million)
% 0.07/0.27 % (3528939)Success in time 0.037 s
% 0.07/0.27 % Vampire exiting
%------------------------------------------------------------------------------