%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU778^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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:22 AM UTC 2026
% Result : Theorem 0.11s 0.23s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 169 ( 37 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 335 ( 9 ~; 0 |; 18 &; 284 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 29 ( 24 usr; 8 con; 0-4 aty)
% ( 8 !!; 4 ??; 0 @@+; 0 @@-)
% Number of variables : 115 ( 88 ^; 22 !; 5 ?; 115 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
subset: $i > $i > $o ).
thf(func_def_2,type,
kpair: $i > $i > $i ).
thf(func_def_3,type,
cartprod: $i > $i > $i ).
thf(func_def_4,type,
breln: $i > $i > $i > $o ).
thf(func_def_6,type,
dpsetconstr: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_7,type,
breln1: $i > $i > $o ).
thf(func_def_8,type,
setOfPairsIsBReln1: $o ).
thf(func_def_9,type,
breln1compset: $i > $i > $i > $i ).
thf(func_def_10,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_14,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_15,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_16,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_17,type,
vAND: $o > $o > $o ).
thf(func_def_18,type,
db5:
!>[X0: $tType] : X0 ).
thf(func_def_19,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_25,type,
vNOT: $o > $o ).
thf(f1,axiom,
( breln
= ( ^ [X0: $i,X1: $i,X2: $i] : ( subset @ X2 @ ( cartprod @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln) ).
thf(f2,axiom,
( breln1
= ( ^ [X0: $i,X1: $i] : ( breln @ X0 @ X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1) ).
thf(f3,axiom,
( setOfPairsIsBReln1
= ( ! [X0: $i,X1: $i > $i > $o] :
( breln1 @ X0
@ ( dpsetconstr @ X0 @ X0
@ ^ [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setOfPairsIsBReln1) ).
thf(f4,axiom,
( breln1compset
= ( ^ [X0: $i,X1: $i,X2: $i] :
( dpsetconstr @ X0 @ X0
@ ^ [X3: $i,X4: $i] :
? [X5: $i] :
( ( in @ ( kpair @ X5 @ X4 ) @ X2 )
& ( in @ ( kpair @ X3 @ X5 ) @ X1 )
& ( in @ X5 @ X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1compset) ).
thf(f5,conjecture,
( setOfPairsIsBReln1
=> ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ( breln1 @ X0 @ ( breln1compset @ X0 @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1compprop) ).
thf(f6,negated_conjecture,
~ ( setOfPairsIsBReln1
=> ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ( breln1 @ X0 @ ( breln1compset @ X0 @ X1 @ X2 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
( breln
= ( ^ [Y0: $i,Y1: $i,Y2: $i] : ( subset @ Y2 @ ( cartprod @ Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f1]) ).
thf(f8,plain,
( breln1
= ( ^ [Y0: $i,Y1: $i] : ( breln @ Y0 @ Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f2]) ).
thf(f9,plain,
( setOfPairsIsBReln1
= ( ! [X0: $i,X1: $i > $i > $o] :
( breln1 @ X0
@ ( dpsetconstr @ X0 @ X0
@ ^ [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f10,plain,
( setOfPairsIsBReln1
= ( !! @ ( $i > $i > $o )
@ ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( breln1 @ Y1
@ ( dpsetconstr @ Y1 @ Y1
@ ^ [Y2: $i,Y3: $i] : ( Y0 @ Y2 @ Y3 ) ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( breln1compset
= ( ^ [X0: $i,X1: $i,X2: $i] :
( dpsetconstr @ X0 @ X0
@ ^ [X3: $i,X4: $i] :
? [X5: $i] :
( ( in @ ( kpair @ X5 @ X4 ) @ X2 )
& ( in @ ( kpair @ X3 @ X5 ) @ X1 )
& ( in @ X5 @ X0 ) ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f12,plain,
( breln1compset
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( dpsetconstr @ Y0 @ Y0
@ ^ [Y3: $i,Y4: $i] :
( ?? @ $i
@ ^ [Y5: $i] :
( ( in @ Y5 @ Y0 )
& ( in @ ( kpair @ Y3 @ Y5 ) @ Y1 )
& ( in @ ( kpair @ Y5 @ Y4 ) @ Y2 ) ) ) ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
~ ( setOfPairsIsBReln1
=> ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ( breln1 @ X0 @ ( breln1compset @ X0 @ X1 @ X2 ) ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f14,plain,
~ ( ( setOfPairsIsBReln1 = $true )
=> ! [X0: $i,X1: $i] :
( ( ( breln1 @ X0 @ X1 )
= $true )
=> ! [X2: $i] :
( ( ( breln1 @ X0 @ X2 )
= $true )
=> ( ( breln1 @ X0 @ ( breln1compset @ X0 @ X1 @ X2 ) )
= $true ) ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
( ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ( ( breln1 @ X0 @ ( breln1compset @ X0 @ X1 @ X2 ) )
!= $true )
& ( ( breln1 @ X0 @ X2 )
= $true ) )
& ( ( breln1 @ X0 @ X1 )
= $true ) )
& ( setOfPairsIsBReln1 = $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f16,plain,
( ( $true
!= ( breln1 @ sK0 @ ( breln1compset @ sK0 @ sK1 @ sK2 ) ) )
& ( $true
= ( breln1 @ sK0 @ sK2 ) )
& ( $true
= ( breln1 @ sK0 @ sK1 ) )
& ( setOfPairsIsBReln1 = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f15]) ).
thf(f17,plain,
( breln
= ( ^ [Y0: $i,Y1: $i,Y2: $i] : ( subset @ Y2 @ ( cartprod @ Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f18,plain,
( breln1
= ( ^ [Y0: $i,Y1: $i] : ( breln @ Y0 @ Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f19,plain,
( setOfPairsIsBReln1
= ( !! @ ( $i > $i > $o )
@ ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( breln1 @ Y1
@ ( dpsetconstr @ Y1 @ Y1
@ ^ [Y2: $i,Y3: $i] : ( Y0 @ Y2 @ Y3 ) ) ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f20,plain,
( breln1compset
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( dpsetconstr @ Y0 @ Y0
@ ^ [Y3: $i,Y4: $i] :
( ?? @ $i
@ ^ [Y5: $i] :
( ( in @ Y5 @ Y0 )
& ( in @ ( kpair @ Y3 @ Y5 ) @ Y1 )
& ( in @ ( kpair @ Y5 @ Y4 ) @ Y2 ) ) ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f21,plain,
setOfPairsIsBReln1 = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f24,plain,
( $true
!= ( breln1 @ sK0 @ ( breln1compset @ sK0 @ sK1 @ sK2 ) ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f27,plain,
( breln1
= ( ^ [Y0: $i,Y1: $i] :
( ^ [Y2: $i,Y3: $i,Y4: $i] : ( subset @ Y4 @ ( cartprod @ Y2 @ Y3 ) )
@ Y0
@ Y0
@ Y1 ) ) ),
inference(definition_unfolding,[],[f18,f17]) ).
thf(f28,plain,
( $true
= ( !! @ ( $i > $i > $o )
@ ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ^ [Y2: $i,Y3: $i] :
( ^ [Y4: $i,Y5: $i,Y6: $i] : ( subset @ Y6 @ ( cartprod @ Y4 @ Y5 ) )
@ Y2
@ Y2
@ Y3 )
@ Y1
@ ( dpsetconstr @ Y1 @ Y1
@ ^ [Y2: $i,Y3: $i] : ( Y0 @ Y2 @ Y3 ) ) ) ) ) ),
inference(definition_unfolding,[],[f19,f21,f27]) ).
thf(f29,plain,
( $true
!= ( ^ [Y0: $i,Y1: $i] :
( ^ [Y2: $i,Y3: $i,Y4: $i] : ( subset @ Y4 @ ( cartprod @ Y2 @ Y3 ) )
@ Y0
@ Y0
@ Y1 )
@ sK0
@ ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( dpsetconstr @ Y0 @ Y0
@ ^ [Y3: $i,Y4: $i] :
( ?? @ $i
@ ^ [Y5: $i] :
( ( in @ Y5 @ Y0 )
& ( in @ ( kpair @ Y3 @ Y5 ) @ Y1 )
& ( in @ ( kpair @ Y5 @ Y4 ) @ Y2 ) ) ) )
@ sK0
@ sK1
@ sK2 ) ) ),
inference(definition_unfolding,[],[f24,f27,f20]) ).
thf(f34,plain,
( $true
!= ( subset
@ ( dpsetconstr @ sK0 @ sK0
@ ^ [Y0: $i,Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ sK0 )
& ( in @ ( kpair @ Y0 @ Y2 ) @ sK1 )
& ( in @ ( kpair @ Y2 @ Y1 ) @ sK2 ) ) ) )
@ ( cartprod @ sK0 @ sK0 ) ) ),
inference(beta-eta_normalization,[],[f29]) ).
thf(f35,plain,
! [X1: $i > $i > $o] :
( $true
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ^ [Y2: $i,Y3: $i] :
( ^ [Y4: $i,Y5: $i,Y6: $i] : ( subset @ Y6 @ ( cartprod @ Y4 @ Y5 ) )
@ Y2
@ Y2
@ Y3 )
@ Y1
@ ( dpsetconstr @ Y1 @ Y1
@ ^ [Y2: $i,Y3: $i] : ( Y0 @ Y2 @ Y3 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f28]) ).
thf(f36,plain,
! [X1: $i > $i > $o] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] : ( subset @ ( dpsetconstr @ Y0 @ Y0 @ X1 ) @ ( cartprod @ Y0 @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f35]) ).
thf(f37,plain,
! [X2: $i,X1: $i > $i > $o] :
( $true
= ( ^ [Y0: $i] : ( subset @ ( dpsetconstr @ Y0 @ Y0 @ X1 ) @ ( cartprod @ Y0 @ Y0 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f36]) ).
thf(f38,plain,
! [X2: $i,X1: $i > $i > $o] :
( $true
= ( subset @ ( dpsetconstr @ X2 @ X2 @ X1 ) @ ( cartprod @ X2 @ X2 ) ) ),
inference(beta-eta_normalization,[],[f37]) ).
thf(f46,plain,
$true != $true,
inference(constrained_superposition,[],[f34,f38]) ).
thf(f49,plain,
$false,
inference(trivial_inequality_removal,[],[f46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU778^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.16 % Computer : n020.cluster.edu
% 0.11/0.16 % Model : x86_64 x86_64
% 0.11/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.16 % Memory : 8046.5625MB
% 0.11/0.16 % OS : Linux 6.8.0-71-generic
% 0.11/0.16 % CPULimit : 300
% 0.11/0.16 % WCLimit : 300
% 0.11/0.16 % DateTime : Tue Sep 29 14:28:49 UTC 2026
% 0.11/0.16 % CPUTime :
% 0.11/0.16 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.19 Running first-order model finding
% 0.11/0.19 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.23 % (1130305)Will run a generic schedule for satisfiability detection.
% 0.11/0.23 % (1130316)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3275861434:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.23 % (1130316) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1130305-1130316"...
% 0.11/0.23 % (1130316)...printing done.
% 0.11/0.23 % (1130311)% WARNING: option uhcvi not known.
% 0.11/0.23 % (1130316)Refutation found. Thanks to Tanya!
% 0.11/0.23 % SZS status Theorem for theBenchmark
% 0.11/0.23 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.23 % (1130316)------------------------------
% 0.11/0.23 % (1130316)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.23 % (1130316)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.23 % (1130316)CaDiCaL version: 2.1.3
% 0.11/0.23 % (1130316)Termination reason: Refutation
% 0.11/0.23 % (1130316)Time elapsed: 0.002 s
% 0.11/0.23 % (1130316)Peak memory usage: 12 MB
% 0.11/0.23 % (1130316)Instructions burned: 6 (million)
% 0.11/0.23 % (1130305)Success in time 0.029 s
% 0.11/0.23 % Vampire exiting
%------------------------------------------------------------------------------