%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYN064^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:41:39 AM UTC 2026
% Result : Theorem 0.09s 0.23s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 41 ( 10 equ; 0 cnn)
% Maximal formula atoms : 2 ( 4 avg)
% Number of connectives : 46 ( 7 ~; 0 |; 3 &; 32 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 0 ^; 16 !; 12 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cP: $i > $i > $o ).
thf(f1,conjecture,
? [X1: $i,X0: $i] :
( ( cP @ X0 @ X1 )
=> ! [X2: $i,X3: $i] : ( cP @ X2 @ X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cPELL35) ).
thf(f2,negated_conjecture,
~ ? [X1: $i,X0: $i] :
( ( cP @ X0 @ X1 )
=> ! [X2: $i,X3: $i] : ( cP @ X2 @ X3 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ? [X0: $i,X1: $i] :
( ( cP @ X1 @ X0 )
=> ! [X2: $i,X3: $i] : ( cP @ X2 @ X3 ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ? [X0: $i,X1: $i] :
( ( ( cP @ X1 @ X0 )
= $true )
=> ! [X3: $i,X2: $i] :
( ( cP @ X2 @ X3 )
= $true ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
! [X1: $i,X0: $i] :
( ? [X2: $i,X3: $i] :
( ( cP @ X2 @ X3 )
!= $true )
& ( ( cP @ X1 @ X0 )
= $true ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
! [X0: $i,X1: $i] :
( ? [X2: $i,X3: $i] :
( ( cP @ X2 @ X3 )
!= $true )
& ( ( cP @ X0 @ X1 )
= $true ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
! [X0: $i,X1: $i] :
( ( ( cP @ sK0 @ sK1 )
!= $true )
& ( ( cP @ X0 @ X1 )
= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0),skolemize(X3,sK1)],[f6]) ).
thf(f8,plain,
! [X0: $i,X1: $i] :
( ( cP @ X0 @ X1 )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
( ( cP @ sK0 @ sK1 )
!= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f12,plain,
$false,
inference(forward_subsumption_resolution,[],[f9,f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN064^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.16 % Computer : n001.cluster.edu
% 0.09/0.16 % Model : x86_64 x86_64
% 0.09/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16 % Memory : 8046.5625MB
% 0.09/0.16 % OS : Linux 6.8.0-71-generic
% 0.09/0.16 % CPULimit : 300
% 0.09/0.16 % WCLimit : 300
% 0.09/0.16 % DateTime : Tue Sep 29 16:20:37 UTC 2026
% 0.09/0.16 % CPUTime :
% 0.09/0.16 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 Running higher-order theorem proving
% 0.09/0.20 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.09/0.23 % (1441999)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.09/0.23 % (1442011)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2594886486:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.09/0.23 % (1442011) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1441999-1442011"...
% 0.09/0.23 % (1442011)...printing done.
% 0.09/0.23 % (1442011)Refutation found. Thanks to Tanya!
% 0.09/0.23 % SZS status Theorem for theBenchmark
% 0.09/0.23 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.23 % (1442011)------------------------------
% 0.09/0.23 % (1442011)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.23 % (1442011)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.23 % (1442011)CaDiCaL version: 2.1.3
% 0.09/0.23 % (1442011)Termination reason: Refutation
% 0.09/0.23 % (1442011)Time elapsed: 0.001 s
% 0.09/0.23 % (1442011)Peak memory usage: 12 MB
% 0.09/0.23 % (1441999)Success in time 0.016 s
% 0.09/0.23 % Vampire exiting
%------------------------------------------------------------------------------