%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU516^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 : n011.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:53 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 25 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 298 ( 104 equ; 0 cnn)
% Maximal formula atoms : 14 ( 11 avg)
% Number of connectives : 322 ( 45 ~; 47 |; 32 &; 186 @)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 57 ( 0 ^; 39 !; 18 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
setadjoin: $i > $i > $i ).
thf(func_def_2,type,
setadjoinAx: $o ).
thf(f1,axiom,
! [X0: $i,X2: $i,X1: $i] :
( ( ( ( X2 = X0 )
| ( in @ X2 @ X1 ) )
<=> ( in @ X2 @ ( setadjoin @ X0 @ X1 ) ) )
= setadjoinAx ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinAx) ).
thf(f2,conjecture,
( setadjoinAx
=> ! [X2: $i,X1: $i,X0: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
=> ( ( in @ X2 @ X1 )
| ( X2 = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinOr) ).
thf(f3,negated_conjecture,
~ ( setadjoinAx
=> ! [X2: $i,X1: $i,X0: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ X1 ) )
=> ( ( in @ X2 @ X1 )
| ( X2 = X0 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
~ ( setadjoinAx
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X0 @ ( setadjoin @ X2 @ X1 ) )
=> ( ( in @ X0 @ X1 )
| ( X2 = X0 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f5,plain,
~ ( ( setadjoinAx = $true )
=> ! [X2: $i,X0: $i,X1: $i] :
( ( $true
= ( in @ X0 @ ( setadjoin @ X2 @ X1 ) ) )
=> ( ( X0 = X2 )
| ( ( in @ X0 @ X1 )
= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( ( X0 = X1 )
| ( in @ X1 @ X2 ) )
<=> ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) )
= setadjoinAx ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( ! [X0: $i,X1: $i,X2: $i] :
( ( $true
= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) )
<=> ( ( $true
= ( in @ X1 @ X2 ) )
| ( X0 = X1 ) ) )
<=> ( setadjoinAx = $true ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( ? [X2: $i,X0: $i,X1: $i] :
( ( X0 != X2 )
& ( ( in @ X0 @ X1 )
!= $true )
& ( $true
= ( in @ X0 @ ( setadjoin @ X2 @ X1 ) ) ) )
& ( setadjoinAx = $true ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f9,plain,
( ? [X2: $i,X0: $i,X1: $i] :
( ( X0 != X2 )
& ( ( in @ X0 @ X1 )
!= $true )
& ( $true
= ( in @ X0 @ ( setadjoin @ X2 @ X1 ) ) ) )
& ( setadjoinAx = $true ) ),
inference(flattening,[],[f8]) ).
thf(f10,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( $true
= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) )
| ( ( $true
!= ( in @ X1 @ X2 ) )
& ( X0 != X1 ) ) )
& ( ( $true
= ( in @ X1 @ X2 ) )
| ( X0 = X1 )
| ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) ) ) )
| ( setadjoinAx != $true ) )
& ( ( setadjoinAx = $true )
| ? [X0: $i,X1: $i,X2: $i] :
( ( ( ( $true
!= ( in @ X1 @ X2 ) )
& ( X0 != X1 ) )
| ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) ) )
& ( ( $true
= ( in @ X1 @ X2 ) )
| ( X0 = X1 )
| ( $true
= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) ) ) ) ) ),
inference(nnf_transformation,[],[f7]) ).
thf(f11,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( $true
= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) )
| ( ( $true
!= ( in @ X1 @ X2 ) )
& ( X0 != X1 ) ) )
& ( ( $true
= ( in @ X1 @ X2 ) )
| ( X0 = X1 )
| ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) ) ) )
| ( setadjoinAx != $true ) )
& ( ( setadjoinAx = $true )
| ? [X0: $i,X1: $i,X2: $i] :
( ( ( ( $true
!= ( in @ X1 @ X2 ) )
& ( X0 != X1 ) )
| ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) ) )
& ( ( $true
= ( in @ X1 @ X2 ) )
| ( X0 = X1 )
| ( $true
= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) ) ) ) ) ),
inference(flattening,[],[f10]) ).
thf(f12,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( $true
= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) )
| ( ( $true
!= ( in @ X1 @ X2 ) )
& ( X0 != X1 ) ) )
& ( ( $true
= ( in @ X1 @ X2 ) )
| ( X0 = X1 )
| ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) ) ) )
| ( setadjoinAx != $true ) )
& ( ( setadjoinAx = $true )
| ? [X3: $i,X4: $i,X5: $i] :
( ( ( ( ( in @ X4 @ X5 )
!= $true )
& ( X3 != X4 ) )
| ( ( in @ X4 @ ( setadjoin @ X3 @ X5 ) )
!= $true ) )
& ( ( ( in @ X4 @ X5 )
= $true )
| ( X3 = X4 )
| ( ( in @ X4 @ ( setadjoin @ X3 @ X5 ) )
= $true ) ) ) ) ),
inference(rectify,[],[f11]) ).
thf(f13,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( $true
= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) )
| ( ( $true
!= ( in @ X1 @ X2 ) )
& ( X0 != X1 ) ) )
& ( ( $true
= ( in @ X1 @ X2 ) )
| ( X0 = X1 )
| ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) ) ) )
| ( setadjoinAx != $true ) )
& ( ( setadjoinAx = $true )
| ( ( ( ( ( in @ sK1 @ sK2 )
!= $true )
& ( sK1 != sK0 ) )
| ( ( in @ sK1 @ ( setadjoin @ sK0 @ sK2 ) )
!= $true ) )
& ( ( ( in @ sK1 @ sK2 )
= $true )
| ( sK1 = sK0 )
| ( ( in @ sK1 @ ( setadjoin @ sK0 @ sK2 ) )
= $true ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X3,sK0),skolemize(X4,sK1),skolemize(X5,sK2)],[f12]) ).
thf(f14,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( X0 != X1 )
& ( $true
!= ( in @ X1 @ X2 ) )
& ( $true
= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) ) )
& ( setadjoinAx = $true ) ),
inference(rectify,[],[f9]) ).
thf(f15,plain,
( ( sK4 != sK3 )
& ( $true
!= ( in @ sK4 @ sK5 ) )
& ( $true
= ( in @ sK4 @ ( setadjoin @ sK3 @ sK5 ) ) )
& ( setadjoinAx = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5)],[f14]) ).
thf(f19,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( X0 = X1 )
| ( setadjoinAx != $true )
| ( $true
= ( in @ X1 @ X2 ) )
| ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f22,plain,
setadjoinAx = $true,
inference(cnf_transformation,[],[f15]) ).
thf(f23,plain,
( $true
= ( in @ sK4 @ ( setadjoin @ sK3 @ sK5 ) ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f24,plain,
( $true
!= ( in @ sK4 @ sK5 ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f25,plain,
sK4 != sK3,
inference(cnf_transformation,[],[f15]) ).
thf(f31,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) )
| ( $true
= ( in @ X1 @ X2 ) )
| ( X0 = X1 ) ),
inference(forward_subsumption_resolution,[],[f19,f22]) ).
thf(f32,plain,
( ( $true != $true )
| ( $true
= ( in @ sK4 @ sK5 ) )
| ( sK4 = sK3 ) ),
inference(superposition,[],[f31,f23]) ).
thf(f34,plain,
( ( sK4 = sK3 )
| ( $true
= ( in @ sK4 @ sK5 ) ) ),
inference(trivial_inequality_removal,[],[f32]) ).
thf(f35,plain,
( $true
= ( in @ sK4 @ sK5 ) ),
inference(forward_subsumption_resolution,[],[f34,f25]) ).
thf(f36,plain,
$false,
inference(forward_subsumption_resolution,[],[f35,f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU516^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.18 % Computer : n011.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 13:47:46 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running higher-order theorem proving
% 0.10/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 % (121360)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.28 % (121378)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2899460372:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.28 % (121378) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-121360-121378"...
% 0.21/0.28 % (121378)...printing done.
% 0.21/0.28 % (121378)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 % (121378)------------------------------
% 0.21/0.28 % (121378)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (121378)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (121378)CaDiCaL version: 2.1.3
% 0.21/0.28 % (121378)Termination reason: Refutation
% 0.21/0.28 % (121378)Time elapsed: 0.002 s
% 0.21/0.28 % (121378)Peak memory usage: 12 MB
% 0.21/0.28 % (121378)Instructions burned: 4 (million)
% 0.21/0.28 % (121360)Success in time 0.038 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------