%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU720^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 : n008.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:07 AM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 2
% Syntax : Number of formulae : 31 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 245 ( 55 equ; 0 cnn)
% Maximal formula atoms : 5 ( 7 avg)
% Number of connectives : 360 ( 31 ~; 8 |; 12 &; 251 @)
% ( 0 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 15 usr; 7 con; 0-4 aty)
% ( 15 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 66 ( 18 ^; 42 !; 6 ?; 66 :)
% 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,
setminus: $i > $i > $i ).
thf(func_def_3,type,
setminusI: $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,
vNOT: $o > $o ).
thf(func_def_10,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(f1,axiom,
( setminusI
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ~ ( in @ X2 @ X1 )
=> ( in @ X2 @ ( setminus @ X0 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusI) ).
thf(f2,conjecture,
( setminusI
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( ~ ( in @ X2 @ ( setminus @ X0 @ X1 ) )
=> ( in @ X2 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complementTE1) ).
thf(f3,negated_conjecture,
~ ( setminusI
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( ~ ( in @ X2 @ ( setminus @ X0 @ X1 ) )
=> ( in @ X2 @ X1 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
( setminusI
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ~ ( in @ X2 @ X1 )
=> ( in @ X2 @ ( setminus @ X0 @ X1 ) ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f5,plain,
( setminusI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ~ ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( setminus @ Y2 @ Y1 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
~ ( setminusI
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( ~ ( in @ X2 @ ( setminus @ X0 @ X1 ) )
=> ( in @ X2 @ X1 ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
~ ( ( setminusI = $true )
=> ! [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
=> ! [X2: $i] :
( ( ( in @ X2 @ X0 )
= $true )
=> ( ( ( in @ X2 @ ( setminus @ X0 @ X1 ) )
!= $true )
=> ( ( in @ X2 @ X1 )
= $true ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
~ ( ( setminusI = $true )
=> ! [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
=> ! [X2: $i] :
( ( ( in @ X2 @ X0 )
= $true )
=> ( ( ( in @ X2 @ ( setminus @ X0 @ X1 ) )
!= $true )
=> ( ( in @ X2 @ X1 )
= $true ) ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f9,plain,
( ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ( ( in @ X2 @ X1 )
!= $true )
& ( ( in @ X2 @ ( setminus @ X0 @ X1 ) )
!= $true )
& ( ( in @ X2 @ X0 )
= $true ) )
& ( ( in @ X1 @ ( powerset @ X0 ) )
= $true ) )
& ( setminusI = $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f10,plain,
( ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ( ( in @ X2 @ X1 )
!= $true )
& ( ( in @ X2 @ ( setminus @ X0 @ X1 ) )
!= $true )
& ( ( in @ X2 @ X0 )
= $true ) )
& ( ( in @ X1 @ ( powerset @ X0 ) )
= $true ) )
& ( setminusI = $true ) ),
inference(flattening,[],[f9]) ).
thf(f11,plain,
( ( $true
!= ( in @ sK2 @ sK1 ) )
& ( $true
!= ( in @ sK2 @ ( setminus @ sK0 @ sK1 ) ) )
& ( $true
= ( in @ sK2 @ sK0 ) )
& ( $true
= ( in @ sK1 @ ( powerset @ sK0 ) ) )
& ( setminusI = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f10]) ).
thf(f12,plain,
( setminusI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ~ ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( setminus @ Y2 @ Y1 ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f13,plain,
setminusI = $true,
inference(cnf_transformation,[],[f11]) ).
thf(f15,plain,
( $true
= ( in @ sK2 @ sK0 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f16,plain,
( $true
!= ( in @ sK2 @ ( setminus @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f17,plain,
( $true
!= ( in @ sK2 @ sK1 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f20,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ~ ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( setminus @ Y2 @ Y1 ) ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f12,f13]) ).
thf(f21,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ~ ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( setminus @ Y2 @ Y1 ) ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f20]) ).
thf(f22,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ~ ( in @ X1 @ Y0 )
=> ( in @ X1 @ ( setminus @ Y1 @ Y0 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f21]) ).
thf(f23,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ~ ( in @ X1 @ Y0 )
=> ( in @ X1 @ ( setminus @ Y1 @ Y0 ) ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f22]) ).
thf(f24,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ~ ( in @ X1 @ X2 )
=> ( in @ X1 @ ( setminus @ Y0 @ X2 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f23]) ).
thf(f25,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ~ ( in @ X1 @ X2 )
=> ( in @ X1 @ ( setminus @ Y0 @ X2 ) ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f24]) ).
thf(f26,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ X3 )
=> ( ~ ( in @ X1 @ X2 )
=> ( in @ X1 @ ( setminus @ X3 @ X2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f25]) ).
thf(f27,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ X3 ) )
| ( $true
= ( ~ ( in @ X1 @ X2 )
=> ( in @ X1 @ ( setminus @ X3 @ X2 ) ) ) ) ),
inference(imp_proxy_clausification,[],[f26]) ).
thf(f28,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ X3 ) )
| ( $false
= ( ~ ( in @ X1 @ X2 ) ) )
| ( $true
= ( in @ X1 @ ( setminus @ X3 @ X2 ) ) ) ),
inference(imp_proxy_clausification,[],[f27]) ).
thf(f29,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( in @ X1 @ ( setminus @ X3 @ X2 ) ) )
| ( $true
= ( in @ X1 @ X2 ) )
| ( $false
= ( in @ X1 @ X3 ) ) ),
inference(not_proxy_clausification,[],[f28]) ).
thf(f30,plain,
( ( $true != $true )
| ( $true
= ( in @ sK2 @ sK1 ) )
| ( ( in @ sK2 @ sK0 )
= $false ) ),
inference(constrained_superposition,[],[f16,f29]) ).
thf(f31,plain,
( ( $true
= ( in @ sK2 @ sK1 ) )
| ( ( in @ sK2 @ sK0 )
= $false ) ),
inference(trivial_inequality_removal,[],[f30]) ).
thf(f32,plain,
( ( in @ sK2 @ sK0 )
= $false ),
inference(forward_subsumption_resolution,[],[f31,f17]) ).
thf(f34,plain,
$true = $false,
inference(constrained_superposition,[],[f15,f32]) ).
thf(f35,plain,
$false,
inference(trivial_inequality_removal,[],[f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU720^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.09/0.18 % Computer : n008.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 14:17:32 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/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.09/0.26 % (3222595)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (3222600)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=933927362_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.26 % Exception at run slice level
% 0.09/0.26 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.09/0.26 % (3222601)% WARNING: option uhcvi not known.
% 0.09/0.26 % (3222602)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3383986692:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.26 % (3222601)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=730387472:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.26 % (3222603)dis+10_1_sil=32000:sp=arity:random_seed=3291833788:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.26 % (3222604)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=65264387:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.26 % (3222601)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.09/0.26 % (3222604)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.09/0.26 % (3222601)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.09/0.26 % (3222605)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1889314632:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.26 % (3222605) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3222595-3222605"...
% 0.09/0.26 % (3222603) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3222595-3222603"...
% 0.09/0.26 % (3222604) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3222595-3222604"...
% 0.09/0.26 % (3222601) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3222595-3222601"...
% 0.09/0.26 % (3222602) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3222595-3222602"...
% 0.09/0.26 % (3222605)...printing done.
% 0.09/0.26 % (3222605)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26 % (3222605)------------------------------
% 0.09/0.26 % (3222605)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (3222605)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (3222605)CaDiCaL version: 2.1.3
% 0.09/0.26 % (3222605)Termination reason: Refutation
% 0.09/0.26 % (3222605)Time elapsed: 0.002 s
% 0.09/0.26 % (3222605)Peak memory usage: 12 MB
% 0.09/0.26 % (3222605)Instructions burned: 4 (million)
% 0.09/0.26 % (3222595)Success in time 0.041 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------