%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU802^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 : n016.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:28 AM UTC 2026
% Result : Theorem 0.25s 0.35s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 4
% Syntax : Number of formulae : 61 ( 41 unt; 0 typ; 0 def)
% Number of atoms : 448 ( 102 equ; 0 cnn)
% Maximal formula atoms : 3 ( 7 avg)
% Number of connectives : 614 ( 10 ~; 15 |; 26 &; 487 @)
% ( 0 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 31 ( 26 usr; 9 con; 0-4 aty)
% ( 25 !!; 16 ??; 0 @@+; 0 @@-)
% Number of variables : 149 ( 96 ^; 48 !; 5 ?; 149 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_2,type,
dsetconstrER: $o ).
thf(func_def_4,type,
funcSet: $i > $i > $i ).
thf(func_def_5,type,
ap: $i > $i > $i > $i > $i ).
thf(func_def_6,type,
surjective: $i > $i > $i > $o ).
thf(func_def_7,type,
surjFuncSet: $i > $i > $i ).
thf(func_def_8,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_9,type,
vIMP: $o > $o > $o ).
thf(func_def_10,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_13,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_15,type,
vAND: $o > $o > $o ).
thf(func_def_16,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_17,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_18,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_24,type,
vNOT: $o > $o ).
thf(func_def_27,type,
sK5: $i > $i ).
thf(func_def_28,type,
sK6: $i > $i ).
thf(f1,axiom,
( dsetconstrER
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrER) ).
thf(f2,axiom,
( surjective
= ( ^ [X0: $i,X1: $i,X2: $i] :
! [X3: $i] :
( ( in @ X3 @ X1 )
=> ? [X4: $i] :
( ( ( ap @ X0 @ X1 @ X2 @ X4 )
= X3 )
& ( in @ X4 @ X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',surjective) ).
thf(f3,axiom,
( surjFuncSet
= ( ^ [X0: $i,X1: $i] :
( dsetconstr @ ( funcSet @ X0 @ X1 )
@ ^ [X2: $i] : ( surjective @ X0 @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',surjFuncSet) ).
thf(f4,conjecture,
( dsetconstrER
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( surjFuncSet @ X0 @ X1 ) )
=> ( surjective @ X0 @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',surjFuncSetFuncSurj) ).
thf(f5,negated_conjecture,
~ ( dsetconstrER
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( surjFuncSet @ X0 @ X1 ) )
=> ( surjective @ X0 @ X1 @ X2 ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
( dsetconstrER
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( dsetconstrER
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( surjective
= ( ^ [X0: $i,X1: $i,X2: $i] :
! [X3: $i] :
( ( in @ X3 @ X1 )
=> ? [X4: $i] :
( ( ( ap @ X0 @ X1 @ X2 @ X4 )
= X3 )
& ( in @ X4 @ X0 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f9,plain,
( surjective
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( ?? @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y0 )
& ( ( ap @ Y0 @ Y1 @ Y2 @ Y4 )
= Y3 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
( surjFuncSet
= ( ^ [X0: $i,X1: $i] :
( dsetconstr @ ( funcSet @ X0 @ X1 )
@ ^ [X2: $i] : ( surjective @ X0 @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f11,plain,
( surjFuncSet
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( funcSet @ Y0 @ Y1 )
@ ^ [Y2: $i] : ( surjective @ Y0 @ Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
~ ( dsetconstrER
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( surjFuncSet @ X0 @ X1 ) )
=> ( surjective @ X0 @ X1 @ X2 ) ) ),
inference(rectify,[],[f5]) ).
thf(f13,plain,
~ ( ( dsetconstrER = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( surjFuncSet @ X0 @ X1 ) )
= $true )
=> ( ( surjective @ X0 @ X1 @ X2 )
= $true ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( surjective @ X0 @ X1 @ X2 )
!= $true )
& ( ( in @ X2 @ ( surjFuncSet @ X0 @ X1 ) )
= $true ) )
& ( dsetconstrER = $true ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f15,plain,
( ( $true
!= ( surjective @ sK0 @ sK1 @ sK2 ) )
& ( $true
= ( in @ sK2 @ ( surjFuncSet @ sK0 @ sK1 ) ) )
& ( dsetconstrER = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f14]) ).
thf(f16,plain,
( dsetconstrER
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f17,plain,
( surjective
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( ?? @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y0 )
& ( ( ap @ Y0 @ Y1 @ Y2 @ Y4 )
= Y3 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f18,plain,
( surjFuncSet
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( funcSet @ Y0 @ Y1 )
@ ^ [Y2: $i] : ( surjective @ Y0 @ Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f19,plain,
dsetconstrER = $true,
inference(cnf_transformation,[],[f15]) ).
thf(f20,plain,
( $true
= ( in @ sK2 @ ( surjFuncSet @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f21,plain,
( $true
!= ( surjective @ sK0 @ sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f24,plain,
( surjFuncSet
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( funcSet @ Y0 @ Y1 )
@ ^ [Y2: $i] :
( ^ [Y3: $i,Y4: $i,Y5: $i] :
( !! @ $i
@ ^ [Y6: $i] :
( ( in @ Y6 @ Y4 )
=> ( ?? @ $i
@ ^ [Y7: $i] :
( ( in @ Y7 @ Y3 )
& ( ( ap @ Y3 @ Y4 @ Y5 @ Y7 )
= Y6 ) ) ) ) )
@ Y0
@ Y1
@ Y2 ) ) ) ),
inference(definition_unfolding,[],[f18,f17]) ).
thf(f25,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f16,f19]) ).
thf(f26,plain,
( $true
!= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( ?? @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y0 )
& ( ( ap @ Y0 @ Y1 @ Y2 @ Y4 )
= Y3 ) ) ) ) )
@ sK0
@ sK1
@ sK2 ) ),
inference(definition_unfolding,[],[f21,f17]) ).
thf(f27,plain,
( $true
= ( in @ sK2
@ ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ ( funcSet @ Y0 @ Y1 )
@ ^ [Y2: $i] :
( ^ [Y3: $i,Y4: $i,Y5: $i] :
( !! @ $i
@ ^ [Y6: $i] :
( ( in @ Y6 @ Y4 )
=> ( ?? @ $i
@ ^ [Y7: $i] :
( ( in @ Y7 @ Y3 )
& ( ( ap @ Y3 @ Y4 @ Y5 @ Y7 )
= Y6 ) ) ) ) )
@ Y0
@ Y1
@ Y2 ) )
@ sK0
@ sK1 ) ) ),
inference(definition_unfolding,[],[f20,f24]) ).
thf(f28,plain,
( $true
= ( in @ sK2
@ ( dsetconstr @ ( funcSet @ sK0 @ sK1 )
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK1 )
=> ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ sK0 )
& ( ( ap @ sK0 @ sK1 @ Y0 @ Y2 )
= Y1 ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f27]) ).
thf(f29,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK1 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK0 )
& ( ( ap @ sK0 @ sK1 @ sK2 @ Y1 )
= Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f26]) ).
thf(f30,plain,
( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ sK1 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK0 )
& ( ( ap @ sK0 @ sK1 @ sK2 @ Y1 )
= Y0 ) ) ) )
@ sK3 ) ),
inference(sigma_proxy_clausification,[],[f29]) ).
thf(f31,plain,
( $false
= ( ( in @ sK3 @ sK1 )
=> ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
& ( ( ap @ sK0 @ sK1 @ sK2 @ Y0 )
= sK3 ) ) ) ) ),
inference(beta-eta_normalization,[],[f30]) ).
thf(f32,plain,
( $false
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
& ( ( ap @ sK0 @ sK1 @ sK2 @ Y0 )
= sK3 ) ) ) ),
inference(imp_proxy_clausification,[],[f31]) ).
thf(f33,plain,
( $true
= ( in @ sK3 @ sK1 ) ),
inference(imp_proxy_clausification,[],[f31]) ).
thf(f34,plain,
! [X1: $i] :
( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
& ( ( ap @ sK0 @ sK1 @ sK2 @ Y0 )
= sK3 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f32]) ).
thf(f35,plain,
! [X1: $i] :
( $false
= ( ( in @ X1 @ sK0 )
& ( ( ap @ sK0 @ sK1 @ sK2 @ X1 )
= sK3 ) ) ),
inference(beta-eta_normalization,[],[f34]) ).
thf(f36,plain,
! [X1: $i] :
( ( $false
= ( ( ap @ sK0 @ sK1 @ sK2 @ X1 )
= sK3 ) )
| ( $false
= ( in @ X1 @ sK0 ) ) ),
inference(and_proxy_clausification,[],[f35]) ).
thf(f37,plain,
! [X1: $i] :
( ( sK3
!= ( ap @ sK0 @ sK1 @ sK2 @ X1 ) )
| ( $false
= ( in @ X1 @ sK0 ) ) ),
inference(equality_proxy_clausification,[],[f36]) ).
thf(f38,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f25]) ).
thf(f39,plain,
! [X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( Y0 @ X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f38]) ).
thf(f40,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( Y0 @ X1 ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f39]) ).
thf(f41,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( X2 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f40]) ).
thf(f42,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( X2 @ X1 ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f41]) ).
thf(f43,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) )
=> ( X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f42]) ).
thf(f44,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $true
= ( X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f43]) ).
thf(f82,plain,
( ( $true = $false )
| ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK1 )
=> ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ sK0 )
& ( ( ap @ sK0 @ sK1 @ Y0 @ Y2 )
= Y1 ) ) ) ) )
@ sK2 ) ) ),
inference(constrained_superposition,[],[f44,f28]) ).
thf(f83,plain,
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK1 )
=> ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ sK0 )
& ( ( ap @ sK0 @ sK1 @ Y0 @ Y2 )
= Y1 ) ) ) ) )
@ sK2 ) ),
inference(trivial_inequality_removal,[],[f82]) ).
thf(f84,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK1 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK0 )
& ( ( ap @ sK0 @ sK1 @ sK2 @ Y1 )
= Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f83]) ).
thf(f85,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ sK1 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK0 )
& ( ( ap @ sK0 @ sK1 @ sK2 @ Y1 )
= Y0 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f84]) ).
thf(f86,plain,
! [X1: $i] :
( $true
= ( ( in @ X1 @ sK1 )
=> ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
& ( ( ap @ sK0 @ sK1 @ sK2 @ Y0 )
= X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f85]) ).
thf(f87,plain,
! [X1: $i] :
( ( $false
= ( in @ X1 @ sK1 ) )
| ( $true
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
& ( ( ap @ sK0 @ sK1 @ sK2 @ Y0 )
= X1 ) ) ) ) ),
inference(imp_proxy_clausification,[],[f86]) ).
thf(f88,plain,
! [X1: $i] :
( ( $false
= ( in @ X1 @ sK1 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
& ( ( ap @ sK0 @ sK1 @ sK2 @ Y0 )
= X1 ) )
@ ( sK5 @ X1 ) ) ) ),
inference(sigma_proxy_clausification,[],[f87]) ).
thf(f89,plain,
! [X1: $i] :
( ( $false
= ( in @ X1 @ sK1 ) )
| ( $true
= ( ( in @ ( sK5 @ X1 ) @ sK0 )
& ( ( ap @ sK0 @ sK1 @ sK2 @ ( sK5 @ X1 ) )
= X1 ) ) ) ),
inference(beta-eta_normalization,[],[f88]) ).
thf(f90,plain,
! [X1: $i] :
( ( $false
= ( in @ X1 @ sK1 ) )
| ( $true
= ( ( ap @ sK0 @ sK1 @ sK2 @ ( sK5 @ X1 ) )
= X1 ) ) ),
inference(and_proxy_clausification,[],[f89]) ).
thf(f91,plain,
! [X1: $i] :
( ( $true
= ( in @ ( sK5 @ X1 ) @ sK0 ) )
| ( $false
= ( in @ X1 @ sK1 ) ) ),
inference(and_proxy_clausification,[],[f89]) ).
thf(f92,plain,
! [X1: $i] :
( ( ( ap @ sK0 @ sK1 @ sK2 @ ( sK5 @ X1 ) )
= X1 )
| ( $false
= ( in @ X1 @ sK1 ) ) ),
inference(equality_proxy_clausification,[],[f90]) ).
thf(f132,plain,
! [X0: $i] :
( ( sK3 != X0 )
| ( $false
= ( in @ ( sK5 @ X0 ) @ sK0 ) )
| ( $false
= ( in @ X0 @ sK1 ) ) ),
inference(constrained_superposition,[],[f37,f92]) ).
thf(f157,plain,
( ( $false
= ( in @ ( sK5 @ sK3 ) @ sK0 ) )
| ( $false
= ( in @ sK3 @ sK1 ) ) ),
inference(equality_resolution,[],[f132]) ).
thf(f158,plain,
( ( $true = $false )
| ( $false
= ( in @ ( sK5 @ sK3 ) @ sK0 ) ) ),
inference(forward_demodulation,[],[f157,f33]) ).
thf(f159,plain,
( $false
= ( in @ ( sK5 @ sK3 ) @ sK0 ) ),
inference(trivial_inequality_removal,[],[f158]) ).
thf(f166,plain,
( ( $true = $false )
| ( $false
= ( in @ sK3 @ sK1 ) ) ),
inference(constrained_superposition,[],[f91,f159]) ).
thf(f167,plain,
( $false
= ( in @ sK3 @ sK1 ) ),
inference(trivial_inequality_removal,[],[f166]) ).
thf(f170,plain,
$true = $false,
inference(constrained_superposition,[],[f33,f167]) ).
thf(f171,plain,
$false,
inference(trivial_inequality_removal,[],[f170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU802^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.25 % Computer : n016.cluster.edu
% 0.12/0.25 % Model : x86_64 x86_64
% 0.12/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.25 % Memory : 8046.5625MB
% 0.12/0.25 % OS : Linux 6.8.0-71-generic
% 0.12/0.25 % CPULimit : 300
% 0.12/0.25 % WCLimit : 300
% 0.12/0.25 % DateTime : Tue Sep 29 14:37:05 UTC 2026
% 0.12/0.25 % CPUTime :
% 0.12/0.25 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.25/0.30 Running first-order model finding
% 0.25/0.30 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.25/0.35 % (433447)Will run a generic schedule for satisfiability detection.
% 0.25/0.35 % (433454)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3709367781:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.25/0.35 % (433454) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-433447-433454"...
% 0.25/0.35 % (433453)% WARNING: option uhcvi not known.
% 0.25/0.35 % (433454)...printing done.
% 0.25/0.35 % (433454)Refutation found. Thanks to Tanya!
% 0.25/0.35 % SZS status Theorem for theBenchmark
% 0.25/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.36 % (433454)------------------------------
% 0.25/0.36 % (433454)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.36 % (433454)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.36 % (433454)CaDiCaL version: 2.1.3
% 0.25/0.36 % (433454)Termination reason: Refutation
% 0.25/0.36 % (433454)Time elapsed: 0.009 s
% 0.25/0.36 % (433454)Peak memory usage: 12 MB
% 0.25/0.36 % (433454)Instructions burned: 15 (million)
% 0.25/0.36 % (433447)Success in time 0.038 s
% 0.25/0.36 % Vampire exiting
%------------------------------------------------------------------------------