%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU738^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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:33:11 AM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 2
% Syntax : Number of formulae : 27 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 215 ( 50 equ; 0 cnn)
% Maximal formula atoms : 6 ( 7 avg)
% Number of connectives : 314 ( 19 ~; 2 |; 15 &; 227 @)
% ( 0 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 16 usr; 8 con; 0-4 aty)
% ( 15 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 67 ( 18 ^; 41 !; 8 ?; 67 :)
% 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,
binunion: $i > $i > $i ).
thf(func_def_3,type,
binunionIL: $o ).
thf(func_def_5,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_6,type,
vIMP: $o > $o > $o ).
thf(func_def_7,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_8,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_17,type,
vNOT: $o > $o ).
thf(f1,axiom,
( binunionIL
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ ( binunion @ X0 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionIL) ).
thf(f2,conjecture,
( binunionIL
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ ( powerset @ X0 ) )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ~ ( in @ X3 @ ( binunion @ X1 @ X2 ) )
=> ~ ( in @ X3 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionTILcontra) ).
thf(f3,negated_conjecture,
~ ( binunionIL
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ ( powerset @ X0 ) )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ~ ( in @ X3 @ ( binunion @ X1 @ X2 ) )
=> ~ ( in @ X3 @ X1 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
( binunionIL
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ ( binunion @ X0 @ X1 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f5,plain,
( binunionIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ ( binunion @ Y2 @ Y1 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
~ ( binunionIL
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ ( powerset @ X0 ) )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ~ ( in @ X3 @ ( binunion @ X1 @ X2 ) )
=> ~ ( in @ X3 @ X1 ) ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
~ ( ( binunionIL = $true )
=> ! [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
=> ! [X2: $i] :
( ( ( in @ X2 @ ( powerset @ X0 ) )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ( ( ( in @ X3 @ ( binunion @ X1 @ X2 ) )
!= $true )
=> ( ( in @ X3 @ X1 )
!= $true ) ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
~ ( ( binunionIL = $true )
=> ! [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
=> ! [X2: $i] :
( ( ( in @ X2 @ ( powerset @ X0 ) )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ( ( ( in @ X3 @ ( binunion @ X1 @ X2 ) )
!= $true )
=> ( ( in @ X3 @ X1 )
!= $true ) ) ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f9,plain,
( ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ? [X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
& ( ( in @ X3 @ ( binunion @ X1 @ X2 ) )
!= $true )
& ( ( in @ X3 @ X0 )
= $true ) )
& ( ( in @ X2 @ ( powerset @ X0 ) )
= $true ) )
& ( ( in @ X1 @ ( powerset @ X0 ) )
= $true ) )
& ( binunionIL = $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f10,plain,
( ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ? [X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
& ( ( in @ X3 @ ( binunion @ X1 @ X2 ) )
!= $true )
& ( ( in @ X3 @ X0 )
= $true ) )
& ( ( in @ X2 @ ( powerset @ X0 ) )
= $true ) )
& ( ( in @ X1 @ ( powerset @ X0 ) )
= $true ) )
& ( binunionIL = $true ) ),
inference(flattening,[],[f9]) ).
thf(f11,plain,
( ( $true
= ( in @ sK3 @ sK1 ) )
& ( $true
!= ( in @ sK3 @ ( binunion @ sK1 @ sK2 ) ) )
& ( $true
= ( in @ sK3 @ sK0 ) )
& ( $true
= ( in @ sK2 @ ( powerset @ sK0 ) ) )
& ( $true
= ( in @ sK1 @ ( powerset @ sK0 ) ) )
& ( binunionIL = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f10]) ).
thf(f12,plain,
( binunionIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ ( binunion @ Y2 @ Y1 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f13,plain,
binunionIL = $true,
inference(cnf_transformation,[],[f11]) ).
thf(f17,plain,
( $true
!= ( in @ sK3 @ ( binunion @ sK1 @ sK2 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f18,plain,
( $true
= ( in @ sK3 @ sK1 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f21,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ ( binunion @ Y2 @ Y1 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f12,f13]) ).
thf(f22,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ ( binunion @ Y2 @ Y1 ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f21]) ).
thf(f23,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( in @ X1 @ ( binunion @ Y1 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f22]) ).
thf(f24,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( in @ X1 @ ( binunion @ Y1 @ Y0 ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f23]) ).
thf(f25,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( in @ X1 @ ( binunion @ Y0 @ X2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f24]) ).
thf(f26,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( in @ X1 @ ( binunion @ Y0 @ X2 ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f25]) ).
thf(f27,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ X3 )
=> ( in @ X1 @ ( binunion @ X3 @ X2 ) ) ) ),
inference(beta-eta_normalization,[],[f26]) ).
thf(f28,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( in @ X1 @ ( binunion @ X3 @ X2 ) ) )
| ( $false
= ( in @ X1 @ X3 ) ) ),
inference(imp_proxy_clausification,[],[f27]) ).
thf(f29,plain,
( ( $true != $true )
| ( ( in @ sK3 @ sK1 )
= $false ) ),
inference(constrained_superposition,[],[f17,f28]) ).
thf(f30,plain,
( ( in @ sK3 @ sK1 )
= $false ),
inference(trivial_inequality_removal,[],[f29]) ).
thf(f32,plain,
$true = $false,
inference(constrained_superposition,[],[f18,f30]) ).
thf(f33,plain,
$false,
inference(trivial_inequality_removal,[],[f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU738^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n002.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 14:21:37 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.25 % (1359186)Will run a generic schedule for satisfiability detection.
% 0.08/0.25 % (1359202)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2682998856:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.25 % (1359202) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1359186-1359202"...
% 0.08/0.25 % (1359202)...printing done.
% 0.08/0.25 % (1359202)Refutation found. Thanks to Tanya!
% 0.08/0.25 % SZS status Theorem for theBenchmark
% 0.08/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.25 % (1359202)------------------------------
% 0.08/0.25 % (1359202)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25 % (1359202)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25 % (1359202)CaDiCaL version: 2.1.3
% 0.08/0.25 % (1359202)Termination reason: Refutation
% 0.08/0.25 % (1359202)Time elapsed: 0.002 s
% 0.08/0.25 % (1359202)Peak memory usage: 12 MB
% 0.08/0.25 % (1359202)Instructions burned: 3 (million)
% 0.08/0.25 % (1359186)Success in time 0.029 s
% 0.08/0.25 % Vampire exiting
%------------------------------------------------------------------------------