%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYN375^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 : 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:41:41 AM UTC 2026
% Result : Theorem 0.21s 0.29s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 235 ( 69 equ; 0 cnn)
% Maximal formula atoms : 8 ( 11 avg)
% Number of connectives : 183 ( 32 ~; 29 |; 20 &; 84 @)
% ( 4 <=>; 12 =>; 0 <=; 2 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 75 ( 0 ^; 45 !; 30 ?; 75 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cP: $i > $o ).
thf(f1,conjecture,
( ( ( ! [X0: $i] : ( cP @ X0 )
=> ? [X1: $i] : ( cP @ X1 ) )
& ( ? [X1: $i] : ( cP @ X1 )
=> ! [X0: $i] : ( cP @ X0 ) ) )
=> ( ? [X1: $i] : ( cP @ X1 )
<=> ! [X0: $i] : ( cP @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX2126_BUG) ).
thf(f2,negated_conjecture,
~ ( ( ( ! [X0: $i] : ( cP @ X0 )
=> ? [X1: $i] : ( cP @ X1 ) )
& ( ? [X1: $i] : ( cP @ X1 )
=> ! [X0: $i] : ( cP @ X0 ) ) )
=> ( ? [X1: $i] : ( cP @ X1 )
<=> ! [X0: $i] : ( cP @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ( ! [X0: $i] : ( cP @ X0 )
=> ? [X1: $i] : ( cP @ X1 ) )
& ( ? [X2: $i] : ( cP @ X2 )
=> ! [X3: $i] : ( cP @ X3 ) ) )
=> ( ? [X4: $i] : ( cP @ X4 )
<=> ! [X5: $i] : ( cP @ X5 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ( ( ? [X2: $i] :
( $true
= ( cP @ X2 ) )
=> ! [X3: $i] :
( $true
= ( cP @ X3 ) ) )
& ( ! [X0: $i] :
( ( cP @ X0 )
= $true )
=> ? [X1: $i] :
( ( cP @ X1 )
= $true ) ) )
=> ( ! [X5: $i] :
( ( cP @ X5 )
= $true )
<=> ? [X4: $i] :
( $true
= ( cP @ X4 ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ! [X5: $i] :
( ( cP @ X5 )
= $true )
<~> ? [X4: $i] :
( $true
= ( cP @ X4 ) ) )
& ( ! [X3: $i] :
( $true
= ( cP @ X3 ) )
| ! [X2: $i] :
( $true
!= ( cP @ X2 ) ) )
& ( ? [X0: $i] :
( ( cP @ X0 )
!= $true )
| ? [X1: $i] :
( ( cP @ X1 )
= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( ? [X0: $i] :
( ( cP @ X0 )
!= $true )
| ? [X1: $i] :
( ( cP @ X1 )
= $true ) )
& ( ! [X3: $i] :
( $true
= ( cP @ X3 ) )
| ! [X2: $i] :
( $true
!= ( cP @ X2 ) ) )
& ( ! [X5: $i] :
( ( cP @ X5 )
= $true )
<~> ? [X4: $i] :
( $true
= ( cP @ X4 ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
( ( ? [X0: $i] :
( ( cP @ X0 )
!= $true )
| ? [X1: $i] :
( ( cP @ X1 )
= $true ) )
& ( ! [X3: $i] :
( $true
= ( cP @ X3 ) )
| ! [X2: $i] :
( $true
!= ( cP @ X2 ) ) )
& ( ! [X4: $i] :
( $true
!= ( cP @ X4 ) )
| ? [X5: $i] :
( ( cP @ X5 )
!= $true ) )
& ( ? [X4: $i] :
( $true
= ( cP @ X4 ) )
| ! [X5: $i] :
( ( cP @ X5 )
= $true ) ) ),
inference(nnf_transformation,[],[f6]) ).
thf(f8,plain,
( ( ? [X0: $i] :
( ( cP @ X0 )
!= $true )
| ? [X1: $i] :
( ( cP @ X1 )
= $true ) )
& ( ! [X3: $i] :
( $true
= ( cP @ X3 ) )
| ! [X2: $i] :
( $true
!= ( cP @ X2 ) ) )
& ( ! [X4: $i] :
( $true
!= ( cP @ X4 ) )
| ? [X5: $i] :
( ( cP @ X5 )
!= $true ) )
& ( ? [X4: $i] :
( $true
= ( cP @ X4 ) )
| ! [X5: $i] :
( ( cP @ X5 )
= $true ) ) ),
inference(flattening,[],[f7]) ).
thf(f9,plain,
( ( ? [X0: $i] :
( ( cP @ X0 )
!= $true )
| ? [X1: $i] :
( ( cP @ X1 )
= $true ) )
& ( ! [X2: $i] :
( $true
= ( cP @ X2 ) )
| ! [X3: $i] :
( $true
!= ( cP @ X3 ) ) )
& ( ! [X4: $i] :
( $true
!= ( cP @ X4 ) )
| ? [X5: $i] :
( ( cP @ X5 )
!= $true ) )
& ( ? [X6: $i] :
( $true
= ( cP @ X6 ) )
| ! [X7: $i] :
( $true
= ( cP @ X7 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f10,plain,
( ( ( $true
!= ( cP @ sK0 ) )
| ( $true
= ( cP @ sK1 ) ) )
& ( ! [X2: $i] :
( $true
= ( cP @ X2 ) )
| ! [X3: $i] :
( $true
!= ( cP @ X3 ) ) )
& ( ! [X4: $i] :
( $true
!= ( cP @ X4 ) )
| ( $true
!= ( cP @ sK2 ) ) )
& ( ( $true
= ( cP @ sK3 ) )
| ! [X7: $i] :
( $true
= ( cP @ X7 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X5,sK2),skolemize(X6,sK3)],[f9]) ).
thf(f11,plain,
! [X7: $i] :
( ( $true
= ( cP @ X7 ) )
| ( $true
= ( cP @ sK3 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f12,plain,
! [X4: $i] :
( ( $true
!= ( cP @ X4 ) )
| ( $true
!= ( cP @ sK2 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f13,plain,
! [X2: $i,X3: $i] :
( ( $true
!= ( cP @ X3 ) )
| ( $true
= ( cP @ X2 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f21,plain,
! [X0: $i] :
( ( ( cP @ X0 )
= $true )
| ( $true
!= ( cP @ sK2 ) )
| ( $true != $true ) ),
inference(superposition,[],[f12,f11]) ).
thf(f22,plain,
! [X0: $i] :
( ( ( cP @ X0 )
= $true )
| ( $true
!= ( cP @ sK2 ) ) ),
inference(trivial_inequality_removal,[],[f21]) ).
thf(f24,plain,
( $true
!= ( cP @ sK2 ) ),
inference(forward_subsumption_resolution,[],[f22,f12]) ).
thf(f32,plain,
! [X0: $i,X1: $i] :
( ( $true != $true )
| ( ( cP @ X0 )
= $true )
| ( ( cP @ X1 )
= $true ) ),
inference(superposition,[],[f13,f11]) ).
thf(f34,plain,
! [X0: $i,X1: $i] :
( ( ( cP @ X1 )
= $true )
| ( ( cP @ X0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f32]) ).
thf(f36,plain,
! [X1: $i] :
( ( cP @ X1 )
= $true ),
inference(forward_subsumption_resolution,[],[f34,f13]) ).
thf(f39,plain,
$true != $true,
inference(superposition,[],[f24,f36]) ).
thf(f40,plain,
$false,
inference(trivial_inequality_removal,[],[f39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN375^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.08/0.19 % Computer : n018.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 16:17:26 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.25 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.21/0.29 % (283053)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.29 % (283064)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2384457554:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.29 % (283064) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-283053-283064"...
% 0.21/0.29 % (283064)...printing done.
% 0.21/0.29 % (283064)Refutation found. Thanks to Tanya!
% 0.21/0.29 % SZS status Theorem for theBenchmark
% 0.21/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29 % (283064)------------------------------
% 0.21/0.29 % (283064)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29 % (283064)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29 % (283064)CaDiCaL version: 2.1.3
% 0.21/0.29 % (283064)Termination reason: Refutation
% 0.21/0.29 % (283064)Time elapsed: 0.001 s
% 0.21/0.29 % (283064)Peak memory usage: 12 MB
% 0.21/0.29 % (283064)Instructions burned: 2 (million)
% 0.21/0.29 % (283053)Success in time 0.032 s
% 0.21/0.29 % Vampire exiting
%------------------------------------------------------------------------------