%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO141^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 : n019.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:46:42 AM UTC 2026
% Result : Theorem 0.07s 0.28s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 117 ( 26 equ; 0 cnn)
% Maximal formula atoms : 8 ( 9 avg)
% Number of connectives : 81 ( 12 ~; 4 |; 9 &; 40 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 17 ( 0 ^; 17 !; 0 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
cQ: $i > $o ).
thf(func_def_3,type,
cR: $i > $o ).
thf(func_def_4,type,
cP: $i > $o ).
thf(f1,conjecture,
( ( ( cP @ a )
=> ! [X0: $i] : ( cQ @ X0 ) )
=> ( ! [X0: $i] : ( cP @ X0 )
=> ( ( cR @ x )
=> ( cQ @ a ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cADDHYP2) ).
thf(f2,negated_conjecture,
~ ( ( ( cP @ a )
=> ! [X0: $i] : ( cQ @ X0 ) )
=> ( ! [X0: $i] : ( cP @ X0 )
=> ( ( cR @ x )
=> ( cQ @ a ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ( cP @ a )
=> ! [X0: $i] : ( cQ @ X0 ) )
=> ( ! [X1: $i] : ( cP @ X1 )
=> ( ( cR @ x )
=> ( cQ @ a ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ( ( ( cP @ a )
= $true )
=> ! [X0: $i] :
( ( cQ @ X0 )
= $true ) )
=> ( ! [X1: $i] :
( $true
= ( cP @ X1 ) )
=> ( ( ( cR @ x )
= $true )
=> ( ( cQ @ a )
= $true ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ( cQ @ a )
!= $true )
& ( ( cR @ x )
= $true )
& ! [X1: $i] :
( $true
= ( cP @ X1 ) )
& ( ! [X0: $i] :
( ( cQ @ X0 )
= $true )
| ( ( cP @ a )
!= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ! [X1: $i] :
( $true
= ( cP @ X1 ) )
& ( ! [X0: $i] :
( ( cQ @ X0 )
= $true )
| ( ( cP @ a )
!= $true ) )
& ( ( cR @ x )
= $true )
& ( ( cQ @ a )
!= $true ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
( ! [X0: $i] :
( ( cP @ X0 )
= $true )
& ( ! [X1: $i] :
( ( cQ @ X1 )
= $true )
| ( ( cP @ a )
!= $true ) )
& ( ( cR @ x )
= $true )
& ( ( cQ @ a )
!= $true ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
( ( cQ @ a )
!= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
! [X1: $i] :
( ( ( cP @ a )
!= $true )
| ( ( cQ @ X1 )
= $true ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
! [X0: $i] :
( ( cP @ X0 )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f14,plain,
! [X1: $i] :
( ( cQ @ X1 )
= $true ),
inference(forward_subsumption_resolution,[],[f10,f11]) ).
thf(f15,plain,
$true != $true,
inference(constrained_superposition,[],[f8,f14]) ).
thf(f16,plain,
$false,
inference(trivial_inequality_removal,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO141^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.19 % Computer : n019.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 16:35:03 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/0.24 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.28 % (1014317)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.07/0.28 % (1014322)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1000815915:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.07/0.28 % (1014322) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1014317-1014322"...
% 0.07/0.28 % (1014322)...printing done.
% 0.07/0.28 % (1014322)Refutation found. Thanks to Tanya!
% 0.07/0.28 % SZS status Theorem for theBenchmark
% 0.07/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.28 % (1014322)------------------------------
% 0.07/0.28 % (1014322)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.28 % (1014322)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.28 % (1014322)CaDiCaL version: 2.1.3
% 0.07/0.28 % (1014322)Termination reason: Refutation
% 0.07/0.28 % (1014322)Time elapsed: 0.001 s
% 0.07/0.28 % (1014322)Peak memory usage: 12 MB
% 0.07/0.28 % (1014322)Instructions burned: 1 (million)
% 0.07/0.28 % (1014317)Success in time 0.036 s
% 0.07/0.28 % Vampire exiting
%------------------------------------------------------------------------------