%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYN358^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:40 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 210 ( 63 equ; 0 cnn)
% Maximal formula atoms : 8 ( 10 avg)
% Number of connectives : 129 ( 33 ~; 28 |; 22 &; 41 @)
% ( 4 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 33 ( 0 ^; 17 !; 16 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cQ: $i > $o ).
thf(func_def_1,type,
p: $o ).
thf(f1,conjecture,
( ( p
& ? [X0: $i] : ( cQ @ X0 ) )
<=> ? [X0: $i] :
( ( cQ @ X0 )
& p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX2109) ).
thf(f2,negated_conjecture,
~ ( ( p
& ? [X0: $i] : ( cQ @ X0 ) )
<=> ? [X0: $i] :
( ( cQ @ X0 )
& p ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( p
& ? [X0: $i] : ( cQ @ X0 ) )
<=> ? [X1: $i] :
( ( cQ @ X1 )
& p ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ? [X1: $i] :
( ( p = $true )
& ( $true
= ( cQ @ X1 ) ) )
<=> ( ( p = $true )
& ? [X0: $i] :
( ( cQ @ X0 )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ? [X1: $i] :
( ( p = $true )
& ( $true
= ( cQ @ X1 ) ) )
<~> ( ( p = $true )
& ? [X0: $i] :
( ( cQ @ X0 )
= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( ( p != $true )
| ! [X0: $i] :
( ( cQ @ X0 )
!= $true )
| ! [X1: $i] :
( ( p != $true )
| ( $true
!= ( cQ @ X1 ) ) ) )
& ( ( ( p = $true )
& ? [X0: $i] :
( ( cQ @ X0 )
= $true ) )
| ? [X1: $i] :
( ( p = $true )
& ( $true
= ( cQ @ X1 ) ) ) ) ),
inference(nnf_transformation,[],[f5]) ).
thf(f7,plain,
( ( ( p != $true )
| ! [X0: $i] :
( ( cQ @ X0 )
!= $true )
| ! [X1: $i] :
( ( p != $true )
| ( $true
!= ( cQ @ X1 ) ) ) )
& ( ( ( p = $true )
& ? [X0: $i] :
( ( cQ @ X0 )
= $true ) )
| ? [X1: $i] :
( ( p = $true )
& ( $true
= ( cQ @ X1 ) ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f8,plain,
( ( ( p != $true )
| ! [X0: $i] :
( ( cQ @ X0 )
!= $true )
| ! [X1: $i] :
( ( p != $true )
| ( $true
!= ( cQ @ X1 ) ) ) )
& ( ( ( p = $true )
& ? [X2: $i] :
( $true
= ( cQ @ X2 ) ) )
| ? [X3: $i] :
( ( p = $true )
& ( $true
= ( cQ @ X3 ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f9,plain,
( ( ( p != $true )
| ! [X0: $i] :
( ( cQ @ X0 )
!= $true )
| ! [X1: $i] :
( ( p != $true )
| ( $true
!= ( cQ @ X1 ) ) ) )
& ( ( ( p = $true )
& ( $true
= ( cQ @ sK0 ) ) )
| ( ( p = $true )
& ( $true
= ( cQ @ sK1 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0),skolemize(X3,sK1)],[f8]) ).
thf(f10,plain,
( ( $true
= ( cQ @ sK1 ) )
| ( $true
= ( cQ @ sK0 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f13,plain,
( ( p = $true )
| ( p = $true ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f14,plain,
! [X0: $i,X1: $i] :
( ( $true
!= ( cQ @ X1 ) )
| ( p != $true )
| ( ( cQ @ X0 )
!= $true )
| ( p != $true ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f16,plain,
p = $true,
inference(duplicate_literal_removal,[],[f13]) ).
thf(f17,plain,
! [X0: $i,X1: $i] :
( ( ( cQ @ X0 )
!= $true )
| ( p != $true )
| ( $true
!= ( cQ @ X1 ) ) ),
inference(duplicate_literal_removal,[],[f14]) ).
thf(f19,plain,
! [X0: $i,X1: $i] :
( ( $true
!= ( cQ @ X1 ) )
| ( ( cQ @ X0 )
!= $true ) ),
inference(forward_subsumption_resolution,[],[f17,f16]) ).
thf(f20,plain,
! [X0: $i] :
( ( $true
= ( cQ @ sK0 ) )
| ( ( cQ @ X0 )
!= $true )
| ( $true != $true ) ),
inference(superposition,[],[f19,f10]) ).
thf(f21,plain,
! [X0: $i] :
( ( $true
= ( cQ @ sK0 ) )
| ( ( cQ @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f20]) ).
thf(f22,plain,
! [X0: $i] :
( ( cQ @ X0 )
!= $true ),
inference(forward_subsumption_resolution,[],[f21,f19]) ).
thf(f23,plain,
( ( $true != $true )
| ( $true
= ( cQ @ sK0 ) ) ),
inference(superposition,[],[f22,f10]) ).
thf(f24,plain,
( $true
= ( cQ @ sK0 ) ),
inference(trivial_inequality_removal,[],[f23]) ).
thf(f25,plain,
$false,
inference(forward_subsumption_resolution,[],[f24,f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN358^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n018.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 16:17:11 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/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.21/0.28 % (282350)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.28 % (282361)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3210612628:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.28 % (282361) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-282350-282361"...
% 0.21/0.28 % (282361)...printing done.
% 0.21/0.28 % (282361)Refutation found. Thanks to Tanya!
% 0.21/0.28 % SZS status Theorem for theBenchmark
% 0.21/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28 % (282361)------------------------------
% 0.21/0.28 % (282361)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (282361)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (282361)CaDiCaL version: 2.1.3
% 0.21/0.28 % (282361)Termination reason: Refutation
% 0.21/0.28 % (282361)Time elapsed: 0.001 s
% 0.21/0.28 % (282361)Peak memory usage: 12 MB
% 0.21/0.28 % (282361)Instructions burned: 1 (million)
% 0.21/0.28 % (282350)Success in time 0.03 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------