%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU578^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:30:09 AM UTC 2026
% Result : Theorem 0.20s 0.26s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 33 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 244 ( 74 equ; 0 cnn)
% Maximal formula atoms : 6 ( 7 avg)
% Number of connectives : 204 ( 32 ~; 24 |; 15 &; 119 @)
% ( 3 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 43 ( 0 ^; 35 !; 8 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
powerset: $i > $i ).
thf(func_def_2,type,
subset: $i > $i > $o ).
thf(func_def_3,type,
subsetRefl: $o ).
thf(func_def_5,type,
powersetI1: $o ).
thf(func_def_12,type,
vNOT: $o > $o ).
thf(f1,axiom,
! [X0: $i] :
( ( subset @ X0 @ X0 )
= subsetRefl ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetRefl) ).
thf(f2,axiom,
! [X0: $i,X1: $i] :
( ( ( subset @ X1 @ X0 )
=> ( in @ X1 @ ( powerset @ X0 ) ) )
= powersetI1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetI1) ).
thf(f3,conjecture,
( subsetRefl
=> ( powersetI1
=> ! [X0: $i] : ( in @ X0 @ ( powerset @ X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inPowerset) ).
thf(f4,negated_conjecture,
~ ( subsetRefl
=> ( powersetI1
=> ! [X0: $i] : ( in @ X0 @ ( powerset @ X0 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
! [X0: $i,X1: $i] :
( ( ( subset @ X1 @ X0 )
=> ( in @ X1 @ ( powerset @ X0 ) ) )
= powersetI1 ),
inference(rectify,[],[f2]) ).
thf(f6,plain,
( ! [X1: $i,X0: $i] :
( ( ( subset @ X1 @ X0 )
= $true )
=> ( ( in @ X1 @ ( powerset @ X0 ) )
= $true ) )
<=> ( powersetI1 = $true ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
! [X0: $i] :
( ( subset @ X0 @ X0 )
= subsetRefl ),
inference(rectify,[],[f1]) ).
thf(f8,plain,
( ! [X0: $i] :
( ( subset @ X0 @ X0 )
= $true )
<=> ( subsetRefl = $true ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( subsetRefl
=> ( powersetI1
=> ! [X0: $i] : ( in @ X0 @ ( powerset @ X0 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ( ( subsetRefl = $true )
=> ( ( powersetI1 = $true )
=> ! [X0: $i] :
( ( in @ X0 @ ( powerset @ X0 ) )
= $true ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ? [X0: $i] :
( ( in @ X0 @ ( powerset @ X0 ) )
!= $true )
& ( powersetI1 = $true )
& ( subsetRefl = $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f12,plain,
( ( powersetI1 = $true )
& ? [X0: $i] :
( ( in @ X0 @ ( powerset @ X0 ) )
!= $true )
& ( subsetRefl = $true ) ),
inference(flattening,[],[f11]) ).
thf(f13,plain,
( ( powersetI1 = $true )
<=> ! [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
| ( ( subset @ X1 @ X0 )
!= $true ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f14,plain,
( ( ( powersetI1 = $true )
| ? [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
!= $true )
& ( ( subset @ X1 @ X0 )
= $true ) ) )
& ( ! [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
| ( ( subset @ X1 @ X0 )
!= $true ) )
| ( powersetI1 != $true ) ) ),
inference(nnf_transformation,[],[f13]) ).
thf(f15,plain,
( ( ( powersetI1 = $true )
| ? [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
!= $true )
& ( ( subset @ X1 @ X0 )
= $true ) ) )
& ( ! [X2: $i,X3: $i] :
( ( ( in @ X3 @ ( powerset @ X2 ) )
= $true )
| ( ( subset @ X3 @ X2 )
!= $true ) )
| ( powersetI1 != $true ) ) ),
inference(rectify,[],[f14]) ).
thf(f16,plain,
( ( ( powersetI1 = $true )
| ( ( ( in @ sK1 @ ( powerset @ sK0 ) )
!= $true )
& ( ( subset @ sK1 @ sK0 )
= $true ) ) )
& ( ! [X2: $i,X3: $i] :
( ( ( in @ X3 @ ( powerset @ X2 ) )
= $true )
| ( ( subset @ X3 @ X2 )
!= $true ) )
| ( powersetI1 != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f15]) ).
thf(f17,plain,
( ( ! [X0: $i] :
( ( subset @ X0 @ X0 )
= $true )
| ( subsetRefl != $true ) )
& ( ( subsetRefl = $true )
| ? [X0: $i] :
( ( subset @ X0 @ X0 )
!= $true ) ) ),
inference(nnf_transformation,[],[f8]) ).
thf(f18,plain,
( ( ! [X0: $i] :
( ( subset @ X0 @ X0 )
= $true )
| ( subsetRefl != $true ) )
& ( ( subsetRefl = $true )
| ? [X1: $i] :
( $true
!= ( subset @ X1 @ X1 ) ) ) ),
inference(rectify,[],[f17]) ).
thf(f19,plain,
( ( ! [X0: $i] :
( ( subset @ X0 @ X0 )
= $true )
| ( subsetRefl != $true ) )
& ( ( subsetRefl = $true )
| ( $true
!= ( subset @ sK2 @ sK2 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X1,sK2)],[f18]) ).
thf(f20,plain,
( ( powersetI1 = $true )
& ( ( in @ sK3 @ ( powerset @ sK3 ) )
!= $true )
& ( subsetRefl = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X0,sK3)],[f12]) ).
thf(f21,plain,
! [X2: $i,X3: $i] :
( ( ( in @ X3 @ ( powerset @ X2 ) )
= $true )
| ( ( subset @ X3 @ X2 )
!= $true )
| ( powersetI1 != $true ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f25,plain,
! [X0: $i] :
( ( ( subset @ X0 @ X0 )
= $true )
| ( subsetRefl != $true ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f26,plain,
subsetRefl = $true,
inference(cnf_transformation,[],[f20]) ).
thf(f27,plain,
( ( in @ sK3 @ ( powerset @ sK3 ) )
!= $true ),
inference(cnf_transformation,[],[f20]) ).
thf(f28,plain,
powersetI1 = $true,
inference(cnf_transformation,[],[f20]) ).
thf(f33,plain,
! [X2: $i,X3: $i] :
( ( ( subset @ X3 @ X2 )
!= $true )
| ( $true != $true )
| ( ( in @ X3 @ ( powerset @ X2 ) )
= $true ) ),
inference(definition_unfolding,[],[f21,f28]) ).
thf(f34,plain,
! [X0: $i] :
( ( $true != $true )
| ( ( subset @ X0 @ X0 )
= $true ) ),
inference(definition_unfolding,[],[f25,f26]) ).
thf(f36,plain,
! [X0: $i] :
( ( subset @ X0 @ X0 )
= $true ),
inference(trivial_inequality_removal,[],[f34]) ).
thf(f37,plain,
! [X2: $i,X3: $i] :
( ( ( subset @ X3 @ X2 )
!= $true )
| ( ( in @ X3 @ ( powerset @ X2 ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f33]) ).
thf(f38,plain,
! [X0: $i] :
( ( ( in @ X0 @ ( powerset @ X0 ) )
= $true )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f37,f36]) ).
thf(f39,plain,
! [X0: $i] :
( ( in @ X0 @ ( powerset @ X0 ) )
= $true ),
inference(trivial_inequality_removal,[],[f38]) ).
thf(f40,plain,
$true != $true,
inference(constrained_superposition,[],[f27,f39]) ).
thf(f41,plain,
$false,
inference(trivial_inequality_removal,[],[f40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU578^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n019.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 13:52:03 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running higher-order theorem proving
% 0.08/0.22 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.20/0.26 % (804087)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.26 % (804092)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=13688815:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.26 % (804092) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-804087-804092"...
% 0.20/0.26 % (804092)...printing done.
% 0.20/0.26 % (804092)Refutation found. Thanks to Tanya!
% 0.20/0.26 % SZS status Theorem for theBenchmark
% 0.20/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.26 % (804092)------------------------------
% 0.20/0.26 % (804092)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.26 % (804092)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.26 % (804092)CaDiCaL version: 2.1.3
% 0.20/0.26 % (804092)Termination reason: Refutation
% 0.20/0.26 % (804092)Time elapsed: 0.002 s
% 0.20/0.26 % (804092)Peak memory usage: 12 MB
% 0.20/0.26 % (804092)Instructions burned: 2 (million)
% 0.20/0.26 % (804087)Success in time 0.027 s
% 0.20/0.26 % Vampire exiting
%------------------------------------------------------------------------------