%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU532^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:29:57 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 120 ( 32 equ; 0 cnn)
% Maximal formula atoms : 4 ( 6 avg)
% Number of connectives : 131 ( 16 ~; 8 |; 6 &; 96 @)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 34 ( 0 ^; 26 !; 8 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_2,type,
setadjoin: $i > $i > $i ).
thf(func_def_3,type,
setadjoinIL: $o ).
thf(func_def_11,type,
vNOT: $o > $o ).
thf(f1,axiom,
! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ X1 ) )
= setadjoinIL ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinIL) ).
thf(f2,conjecture,
( setadjoinIL
=> ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairsetIL) ).
thf(f3,negated_conjecture,
~ ( setadjoinIL
=> ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ X1 ) )
= setadjoinIL ),
inference(rectify,[],[f1]) ).
thf(f5,plain,
( ( setadjoinIL = $true )
<=> ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ X1 ) )
= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
~ ( setadjoinIL
=> ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
~ ( ( setadjoinIL = $true )
=> ! [X1: $i,X0: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) )
= $true ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( ( setadjoinIL = $true )
& ? [X1: $i,X0: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) )
!= $true ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f9,plain,
( ( setadjoinIL = $true )
& ? [X0: $i,X1: $i] :
( $true
!= ( in @ X1 @ ( setadjoin @ X1 @ ( setadjoin @ X0 @ emptyset ) ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f10,plain,
( ( setadjoinIL = $true )
& ( $true
!= ( in @ sK1 @ ( setadjoin @ sK1 @ ( setadjoin @ sK0 @ emptyset ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f9]) ).
thf(f11,plain,
( ( ( setadjoinIL = $true )
| ? [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ X1 ) )
!= $true ) )
& ( ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ X1 ) )
= $true )
| ( setadjoinIL != $true ) ) ),
inference(nnf_transformation,[],[f5]) ).
thf(f12,plain,
( ( ( setadjoinIL = $true )
| ? [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X0 @ X1 ) )
!= $true ) )
& ( ! [X2: $i,X3: $i] :
( ( in @ X2 @ ( setadjoin @ X2 @ X3 ) )
= $true )
| ( setadjoinIL != $true ) ) ),
inference(rectify,[],[f11]) ).
thf(f13,plain,
( ( ( setadjoinIL = $true )
| ( $true
!= ( in @ sK2 @ ( setadjoin @ sK2 @ sK3 ) ) ) )
& ( ! [X2: $i,X3: $i] :
( ( in @ X2 @ ( setadjoin @ X2 @ X3 ) )
= $true )
| ( setadjoinIL != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f12]) ).
thf(f14,plain,
( $true
!= ( in @ sK1 @ ( setadjoin @ sK1 @ ( setadjoin @ sK0 @ emptyset ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f15,plain,
setadjoinIL = $true,
inference(cnf_transformation,[],[f10]) ).
thf(f16,plain,
! [X2: $i,X3: $i] :
( ( ( in @ X2 @ ( setadjoin @ X2 @ X3 ) )
= $true )
| ( setadjoinIL != $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f21,plain,
! [X2: $i,X3: $i] :
( ( ( in @ X2 @ ( setadjoin @ X2 @ X3 ) )
= $true )
| ( $true != $true ) ),
inference(definition_unfolding,[],[f16,f15]) ).
thf(f22,plain,
! [X2: $i,X3: $i] :
( ( in @ X2 @ ( setadjoin @ X2 @ X3 ) )
= $true ),
inference(trivial_inequality_removal,[],[f21]) ).
thf(f23,plain,
$true != $true,
inference(backward_demodulation,[],[f14,f22]) ).
thf(f24,plain,
$false,
inference(trivial_inequality_removal,[],[f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU532^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n009.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:48:46 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 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 % (4020833)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.28 % (4020843)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1205692536:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.28 % (4020843) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4020833-4020843"...
% 0.21/0.28 % (4020843)...printing done.
% 0.21/0.28 % (4020843)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 % (4020843)------------------------------
% 0.21/0.28 % (4020843)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (4020843)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (4020843)CaDiCaL version: 2.1.3
% 0.21/0.28 % (4020843)Termination reason: Refutation
% 0.21/0.28 % (4020843)Time elapsed: 0.001 s
% 0.21/0.28 % (4020843)Peak memory usage: 12 MB
% 0.21/0.28 % (4020843)Instructions burned: 1 (million)
% 0.21/0.28 % (4020833)Success in time 0.037 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------