%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO549^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:48:24 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 61 ( 9 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 67 ( 27 ~; 0 |; 0 &; 40 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 2 con; 0-4 aty)
% Number of variables : 12 ( 12 ^; 0 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
p: ( $o > $o ) > ( $o > $o ) > $o ).
thf(func_def_1,type,
f: $o > $o ).
thf(func_def_2,type,
g: $o > $o ).
thf(func_def_4,type,
vNOT: $o > $o ).
thf(func_def_5,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_6,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(f1,axiom,
( p
@ ^ [X0: $o] :
( f
@ ~ ~ X0 )
@ g ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pfg) ).
thf(f2,conjecture,
( p @ f
@ ^ [X0: $o] :
( g
@ ~ ~ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pfgc) ).
thf(f3,negated_conjecture,
~ ( p @ f
@ ^ [X0: $o] :
( g
@ ~ ~ X0 ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
( p
@ ^ [X0: $o] :
( f
@ ~ ~ X0 )
@ g ),
inference(rectify,[],[f1]) ).
thf(f5,plain,
( ( p
@ ^ [Y0: $o] :
( f
@ ~ ~ Y0 )
@ g )
= $true ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
~ ( p @ f
@ ^ [X0: $o] :
( g
@ ~ ~ X0 ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
( $true
!= ( p @ f
@ ^ [Y0: $o] :
( g
@ ~ ~ Y0 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( $true
!= ( p @ f
@ ^ [Y0: $o] :
( g
@ ~ ~ Y0 ) ) ),
inference(flattening,[],[f7]) ).
thf(f9,plain,
( $true
!= ( p @ f
@ ^ [Y0: $o] :
( g
@ ~ ~ Y0 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f10,plain,
( ( p
@ ^ [Y0: $o] :
( f
@ ~ ~ Y0 )
@ g )
= $true ),
inference(cnf_transformation,[],[f5]) ).
thf(f12,plain,
( ( p @ f
@ ^ [Y0: $o] : ( g @ Y0 ) )
!= $true ),
inference(boolean_simplification,[],[f9]) ).
thf(f13,plain,
( $true
!= ( p @ f @ g ) ),
inference(beta-eta_normalization,[],[f12]) ).
thf(f14,plain,
( $true
= ( p
@ ^ [Y0: $o] : ( f @ Y0 )
@ g ) ),
inference(boolean_simplification,[],[f10]) ).
thf(f15,plain,
( $true
= ( p @ f @ g ) ),
inference(beta-eta_normalization,[],[f14]) ).
thf(f16,plain,
$false,
inference(forward_subsumption_resolution,[],[f15,f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO549^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n018.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 17:16:41 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running higher-order theorem proving
% 0.08/0.23 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 % (371544)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.27 % (371553)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=958124912:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.27 % (371553) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-371544-371553"...
% 0.20/0.27 % (371553)...printing done.
% 0.20/0.27 % (371553)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 % (371553)------------------------------
% 0.20/0.27 % (371553)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (371553)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (371553)CaDiCaL version: 2.1.3
% 0.20/0.27 % (371553)Termination reason: Refutation
% 0.20/0.27 % (371553)Time elapsed: 0.001 s
% 0.20/0.27 % (371553)Peak memory usage: 12 MB
% 0.20/0.27 % (371553)Instructions burned: 1 (million)
% 0.20/0.27 % (371544)Success in time 0.034 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------