%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO229^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 : 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:47:14 AM UTC 2026
% Result : Theorem 0.23s 0.30s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 19 ( 6 equ)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 23 ( 5 ~; 0 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 6 ( 6 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 0 con; 1-4 aty)
% Number of variables : 12 ( 2 !; 4 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
cB: $i > $o ).
tff(func_def_1,type,
cA: $i > $o ).
tff(func_def_3,type,
vAND: $o > $o > $o ).
tff(func_def_4,type,
db0:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
tff(f1,conjecture,
? [X0: $i > $o] :
( ( ^ [X1: $i] :
( ( cA @ X1 )
& ( cB @ X1 ) ) )
= (X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cSV3) ).
tff(f2,negated_conjecture,
~ ? [X0: $i > $o] :
( ( ^ [X1: $i] :
( ( cA @ X1 )
& ( cB @ X1 ) ) )
= (X0) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
~ ? [X0: $i > $o] :
( ( ^ [X1: $i] :
( ( cA @ X1 )
& ( cB @ X1 ) ) )
= (X0) ),
inference(rectify,[],[f2]) ).
tff(f4,plain,
~ ? [X0: $i > $o] :
( ( ^ [Y0: $i] :
( ( cB @ Y0 )
& ( cA @ Y0 ) ) )
= (X0) ),
inference(fool_elimination,[],[f3]) ).
tff(f5,plain,
! [X0: $i > $o] :
( ( ^ [Y0: $i] :
( ( cB @ Y0 )
& ( cA @ Y0 ) ) )
!= (X0) ),
inference(ennf_transformation,[],[f4]) ).
tff(f6,plain,
! [X0: $i > $o] :
( ( ^ [Y0: $i] :
( ( cB @ Y0 )
& ( cA @ Y0 ) ) )
!= (X0) ),
inference(cnf_transformation,[],[f5]) ).
tff(f8,plain,
$false,
inference(equality_resolution,[],[f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO229^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.20 % Computer : n026.cluster.edu
% 0.11/0.20 % Model : x86_64 x86_64
% 0.11/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.20 % Memory : 8046.5625MB
% 0.11/0.20 % OS : Linux 6.8.0-71-generic
% 0.11/0.20 % CPULimit : 300
% 0.11/0.20 % WCLimit : 300
% 0.11/0.20 % DateTime : Tue Sep 29 16:42:42 UTC 2026
% 0.11/0.20 % CPUTime :
% 0.11/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.24 Running higher-order theorem proving
% 0.11/0.25 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.23/0.30 % (844289)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.23/0.30 % (844300)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=3388297275:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.23/0.30 % (844300) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-844289-844300"...
% 0.23/0.30 % (844300)...printing done.
% 0.23/0.30 % (844300)Refutation found. Thanks to Tanya!
% 0.23/0.30 % SZS status Theorem for theBenchmark
% 0.23/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.30 % (844300)------------------------------
% 0.23/0.30 % (844300)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.30 % (844300)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.30 % (844300)CaDiCaL version: 2.1.3
% 0.23/0.30 % (844300)Termination reason: Refutation
% 0.23/0.30 % (844300)Time elapsed: 0.001 s
% 0.23/0.30 % (844300)Peak memory usage: 12 MB
% 0.23/0.30 % (844289)Success in time 0.037 s
% 0.23/0.30 % Vampire exiting
%------------------------------------------------------------------------------