%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU803^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 : n026.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.22s 0.27s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 2
% Syntax : Number of formulae : 33 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 301 ( 76 equ; 0 cnn)
% Maximal formula atoms : 6 ( 9 avg)
% Number of connectives : 413 ( 24 ~; 15 |; 23 &; 312 @)
% ( 0 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 27 ( 22 usr; 8 con; 0-4 aty)
% ( 4 !!; 7 ??; 0 @@+; 0 @@-)
% Number of variables : 82 ( 28 ^; 40 !; 14 ?; 82 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
funcSet: $i > $i > $i ).
thf(func_def_2,type,
ap: $i > $i > $i > $i > $i ).
thf(func_def_3,type,
surjective: $i > $i > $i > $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,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_8,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_10,type,
vAND: $o > $o > $o ).
thf(func_def_11,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_15,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_20,type,
sK2: $i > $i ).
thf(func_def_22,type,
vNOT: $o > $o ).
thf(f1,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/sandbox/benchmark/theBenchmark.p',surjective) ).
thf(f2,conjecture,
! [X0: $i,X1: $i,X2: $i > $i] :
( ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( in @ ( X2 @ X3 ) @ X1 ) )
=> ! [X4: $i] :
( ( in @ X4 @ ( funcSet @ X1 @ X0 ) )
=> ( ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( ap @ X1 @ X0 @ X4 @ ( X2 @ X3 ) )
= X3 ) )
=> ( surjective @ X1 @ X0 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leftInvIsSurj) ).
thf(f3,negated_conjecture,
~ ! [X0: $i,X1: $i,X2: $i > $i] :
( ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( in @ ( X2 @ X3 ) @ X1 ) )
=> ! [X4: $i] :
( ( in @ X4 @ ( funcSet @ X1 @ X0 ) )
=> ( ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( ap @ X1 @ X0 @ X4 @ ( X2 @ X3 ) )
= X3 ) )
=> ( surjective @ X1 @ X0 @ X4 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,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,[],[f1]) ).
thf(f5,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,[],[f4]) ).
thf(f6,plain,
~ ! [X0: $i,X1: $i,X2: $i > $i] :
( ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( in @ ( X2 @ X3 ) @ X1 ) )
=> ! [X4: $i] :
( ( in @ X4 @ ( funcSet @ X1 @ X0 ) )
=> ( ! [X5: $i] :
( ( in @ X5 @ X0 )
=> ( ( ap @ X1 @ X0 @ X4 @ ( X2 @ X5 ) )
= X5 ) )
=> ( surjective @ X1 @ X0 @ X4 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
~ ! [X0: $i,X1: $i,X2: $i > $i] :
( ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ( ( in @ ( X2 @ X3 ) @ X1 )
= $true ) )
=> ! [X4: $i] :
( ( ( in @ X4 @ ( funcSet @ X1 @ X0 ) )
= $true )
=> ( ! [X5: $i] :
( ( ( in @ X5 @ X0 )
= $true )
=> ( ( ap @ X1 @ X0 @ X4 @ ( X2 @ X5 ) )
= X5 ) )
=> ( ( surjective @ X1 @ X0 @ X4 )
= $true ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
? [X0: $i,X1: $i,X2: $i > $i] :
( ? [X4: $i] :
( ( ( surjective @ X1 @ X0 @ X4 )
!= $true )
& ! [X5: $i] :
( ( ( ap @ X1 @ X0 @ X4 @ ( X2 @ X5 ) )
= X5 )
| ( ( in @ X5 @ X0 )
!= $true ) )
& ( ( in @ X4 @ ( funcSet @ X1 @ X0 ) )
= $true ) )
& ! [X3: $i] :
( ( ( in @ ( X2 @ X3 ) @ X1 )
= $true )
| ( ( in @ X3 @ X0 )
!= $true ) ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f9,plain,
? [X0: $i,X1: $i,X2: $i > $i] :
( ? [X4: $i] :
( ( ( surjective @ X1 @ X0 @ X4 )
!= $true )
& ! [X5: $i] :
( ( ( ap @ X1 @ X0 @ X4 @ ( X2 @ X5 ) )
= X5 )
| ( ( in @ X5 @ X0 )
!= $true ) )
& ( ( in @ X4 @ ( funcSet @ X1 @ X0 ) )
= $true ) )
& ! [X3: $i] :
( ( ( in @ ( X2 @ X3 ) @ X1 )
= $true )
| ( ( in @ X3 @ X0 )
!= $true ) ) ),
inference(flattening,[],[f8]) ).
thf(f10,plain,
? [X0: $i,X1: $i,X2: $i > $i] :
( ? [X3: $i] :
( ( $true
!= ( surjective @ X1 @ X0 @ X3 ) )
& ! [X4: $i] :
( ( ( ap @ X1 @ X0 @ X3 @ ( X2 @ X4 ) )
= X4 )
| ( ( in @ X4 @ X0 )
!= $true ) )
& ( $true
= ( in @ X3 @ ( funcSet @ X1 @ X0 ) ) ) )
& ! [X5: $i] :
( ( $true
= ( in @ ( X2 @ X5 ) @ X1 ) )
| ( ( in @ X5 @ X0 )
!= $true ) ) ),
inference(rectify,[],[f9]) ).
thf(f11,plain,
( ( $true
!= ( surjective @ sK1 @ sK0 @ sK3 ) )
& ! [X4: $i] :
( ( ( ap @ sK1 @ sK0 @ sK3 @ ( sK2 @ X4 ) )
= X4 )
| ( $true
!= ( in @ X4 @ sK0 ) ) )
& ( $true
= ( in @ sK3 @ ( funcSet @ sK1 @ sK0 ) ) )
& ! [X5: $i] :
( ( $true
= ( in @ ( sK2 @ X5 ) @ sK1 ) )
| ( $true
!= ( in @ X5 @ sK0 ) ) ) ),
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,
( 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,[],[f5]) ).
thf(f13,plain,
! [X5: $i] :
( ( $true
!= ( in @ X5 @ sK0 ) )
| ( $true
= ( in @ ( sK2 @ X5 ) @ sK1 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f15,plain,
! [X4: $i] :
( ( $true
!= ( in @ X4 @ sK0 ) )
| ( ( ap @ sK1 @ sK0 @ sK3 @ ( sK2 @ X4 ) )
= X4 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f16,plain,
( $true
!= ( surjective @ sK1 @ sK0 @ sK3 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f19,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 ) ) ) ) )
@ sK1
@ sK0
@ sK3 ) ),
inference(definition_unfolding,[],[f16,f12]) ).
thf(f20,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK1 )
& ( ( ap @ sK1 @ sK0 @ sK3 @ Y1 )
= Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f19]) ).
thf(f21,plain,
( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK1 )
& ( ( ap @ sK1 @ sK0 @ sK3 @ Y1 )
= Y0 ) ) ) )
@ sK4 ) ),
inference(sigma_proxy_clausification,[],[f20]) ).
thf(f22,plain,
( $false
= ( ( in @ sK4 @ sK0 )
=> ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK1 )
& ( ( ap @ sK1 @ sK0 @ sK3 @ Y0 )
= sK4 ) ) ) ) ),
inference(beta-eta_normalization,[],[f21]) ).
thf(f23,plain,
( $false
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK1 )
& ( ( ap @ sK1 @ sK0 @ sK3 @ Y0 )
= sK4 ) ) ) ),
inference(imp_proxy_clausification,[],[f22]) ).
thf(f24,plain,
( $true
= ( in @ sK4 @ sK0 ) ),
inference(imp_proxy_clausification,[],[f22]) ).
thf(f25,plain,
! [X1: $i] :
( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ sK1 )
& ( ( ap @ sK1 @ sK0 @ sK3 @ Y0 )
= sK4 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f23]) ).
thf(f26,plain,
! [X1: $i] :
( $false
= ( ( in @ X1 @ sK1 )
& ( ( ap @ sK1 @ sK0 @ sK3 @ X1 )
= sK4 ) ) ),
inference(beta-eta_normalization,[],[f25]) ).
thf(f27,plain,
! [X1: $i] :
( ( $false
= ( ( ap @ sK1 @ sK0 @ sK3 @ X1 )
= sK4 ) )
| ( $false
= ( in @ X1 @ sK1 ) ) ),
inference(and_proxy_clausification,[],[f26]) ).
thf(f28,plain,
! [X1: $i] :
( ( sK4
!= ( ap @ sK1 @ sK0 @ sK3 @ X1 ) )
| ( $false
= ( in @ X1 @ sK1 ) ) ),
inference(equality_proxy_clausification,[],[f27]) ).
thf(f29,plain,
( ( $true != $true )
| ( sK4
= ( ap @ sK1 @ sK0 @ sK3 @ ( sK2 @ sK4 ) ) ) ),
inference(constrained_superposition,[],[f15,f24]) ).
thf(f30,plain,
( ( $true != $true )
| ( $true
= ( in @ ( sK2 @ sK4 ) @ sK1 ) ) ),
inference(constrained_superposition,[],[f13,f24]) ).
thf(f31,plain,
( $true
= ( in @ ( sK2 @ sK4 ) @ sK1 ) ),
inference(trivial_inequality_removal,[],[f30]) ).
thf(f32,plain,
( sK4
= ( ap @ sK1 @ sK0 @ sK3 @ ( sK2 @ sK4 ) ) ),
inference(trivial_inequality_removal,[],[f29]) ).
thf(f44,plain,
( ( sK4 != sK4 )
| ( $false
= ( in @ ( sK2 @ sK4 ) @ sK1 ) ) ),
inference(constrained_superposition,[],[f28,f32]) ).
thf(f45,plain,
( $false
= ( in @ ( sK2 @ sK4 ) @ sK1 ) ),
inference(trivial_inequality_removal,[],[f44]) ).
thf(f50,plain,
$true = $false,
inference(constrained_superposition,[],[f31,f45]) ).
thf(f51,plain,
$false,
inference(trivial_inequality_removal,[],[f50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU803^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n026.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 14:34:57 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.22/0.27 % (682164)Will run a generic schedule for satisfiability detection.
% 0.22/0.27 % (682170)% WARNING: option uhcvi not known.
% 0.22/0.27 % (682170)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=515485292:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.27 % (682170)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.27 % (682170)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.22/0.27 % (682170) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-682164-682170"...
% 0.22/0.27 % (682170)...printing done.
% 0.22/0.27 % (682170)Refutation found. Thanks to Tanya!
% 0.22/0.27 % SZS status Theorem for theBenchmark
% 0.22/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.27 % (682170)------------------------------
% 0.22/0.27 % (682170)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.27 % (682170)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.27 % (682170)CaDiCaL version: 2.1.3
% 0.22/0.27 % (682170)Termination reason: Refutation
% 0.22/0.27 % (682170)Time elapsed: 0.003 s
% 0.22/0.27 % (682170)Peak memory usage: 12 MB
% 0.22/0.27 % (682170)Instructions burned: 6 (million)
% 0.22/0.27 % (682164)Success in time 0.029 s
% 0.22/0.27 % Vampire exiting
%------------------------------------------------------------------------------