%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU517^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 : n010.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:32:16 AM UTC 2026
% Result : Theorem 0.39s 0.36s
% Output : Refutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 4
% Syntax : Number of formulae : 80 ( 37 unt; 0 typ; 0 def)
% Number of atoms : 610 ( 185 equ; 0 cnn)
% Maximal formula atoms : 6 ( 7 avg)
% Number of connectives : 1050 ( 7 ~; 81 |; 9 &; 799 @)
% ( 0 <=>; 98 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 48 ( 48 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 17 usr; 7 con; 0-4 aty)
% ( 56 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 256 ( 123 ^; 131 !; 2 ?; 256 :)
% 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,
dsetconstrI: $o ).
thf(func_def_4,type,
dsetconstrEL: $o ).
thf(func_def_5,type,
setext: $o ).
thf(func_def_6,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_7,type,
vIMP: $o > $o > $o ).
thf(func_def_8,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_12,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_16,type,
vNOT: $o > $o ).
thf(func_def_17,type,
sK1: $i > $i > $i ).
thf(func_def_18,type,
sK2: $i > $i > $i ).
thf(f1,axiom,
( dsetconstrI
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrI) ).
thf(f2,axiom,
( dsetconstrEL
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( in @ X2 @ X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrEL) ).
thf(f3,axiom,
( setext
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) )
=> ( ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ X2 @ X0 ) )
=> ( X0 = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setext) ).
thf(f4,conjecture,
( dsetconstrI
=> ( dsetconstrEL
=> ( setext
=> ! [X0: $i] :
( ( dsetconstr @ X0
@ ^ [X1: $i] : $true )
= X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setoftrueEq) ).
thf(f5,negated_conjecture,
~ ( dsetconstrI
=> ( dsetconstrEL
=> ( setext
=> ! [X0: $i] :
( ( dsetconstr @ X0
@ ^ [X1: $i] : $true )
= X0 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
( dsetconstrI
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( dsetconstrI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( dsetconstrEL
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( in @ X2 @ X0 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f9,plain,
( dsetconstrEL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y0 @ Y2 ) ) ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
( setext
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) )
=> ( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ X0 ) )
=> ( X0 = X1 ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f11,plain,
( setext
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
~ ( dsetconstrI
=> ( dsetconstrEL
=> ( setext
=> ! [X0: $i] :
( ( dsetconstr @ X0
@ ^ [X1: $i] : $true )
= X0 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f13,plain,
~ ( ( dsetconstrI = $true )
=> ( ( dsetconstrEL = $true )
=> ( ( setext = $true )
=> ! [X0: $i] :
( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X0 ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
( ? [X0: $i] :
( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
!= X0 )
& ( setext = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrI = $true ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f15,plain,
( ? [X0: $i] :
( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
!= X0 )
& ( setext = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrI = $true ) ),
inference(flattening,[],[f14]) ).
thf(f16,plain,
( ( sK0
!= ( dsetconstr @ sK0
@ ^ [Y0: $i] : $true ) )
& ( setext = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrI = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f15]) ).
thf(f17,plain,
( dsetconstrI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f18,plain,
( dsetconstrEL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y0 @ Y2 ) ) ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f19,plain,
( setext
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f20,plain,
dsetconstrI = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f21,plain,
dsetconstrEL = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f22,plain,
setext = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f23,plain,
( sK0
!= ( dsetconstr @ sK0
@ ^ [Y0: $i] : $true ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f26,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f17,f20]) ).
thf(f27,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y0 @ Y2 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f18,f21]) ).
thf(f28,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f19,f22]) ).
thf(f29,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f28]) ).
thf(f30,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ X1 )
=> ( in @ Y1 @ Y0 ) ) )
=> ( Y0 = X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f29]) ).
thf(f31,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ X1 )
=> ( in @ Y1 @ Y0 ) ) )
=> ( Y0 = X1 ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f30]) ).
thf(f32,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) )
=> ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) ) )
=> ( X2 = X1 ) ) ) ),
inference(beta-eta_normalization,[],[f31]) ).
thf(f33,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) ) )
| ( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) ) )
=> ( X2 = X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f32]) ).
thf(f34,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK1 @ X1 @ X2 ) ) )
| ( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) ) )
=> ( X2 = X1 ) ) ) ),
inference(sigma_proxy_clausification,[],[f33]) ).
thf(f35,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK1 @ X1 @ X2 ) ) )
| ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) ) ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f34]) ).
thf(f36,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK1 @ X1 @ X2 ) ) )
| ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) )
@ ( sK2 @ X1 @ X2 ) ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(sigma_proxy_clausification,[],[f35]) ).
thf(f37,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK1 @ X1 @ X2 ) ) )
| ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) )
@ ( sK2 @ X1 @ X2 ) ) )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f36]) ).
thf(f38,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ( in @ ( sK1 @ X1 @ X2 ) @ X2 )
=> ( in @ ( sK1 @ X1 @ X2 ) @ X1 ) ) )
| ( $false
= ( ( in @ ( sK2 @ X1 @ X2 ) @ X1 )
=> ( in @ ( sK2 @ X1 @ X2 ) @ X2 ) ) )
| ( X1 = X2 ) ),
inference(beta-eta_normalization,[],[f37]) ).
thf(f39,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK1 @ X1 @ X2 ) @ X1 ) )
| ( $false
= ( ( in @ ( sK2 @ X1 @ X2 ) @ X1 )
=> ( in @ ( sK2 @ X1 @ X2 ) @ X2 ) ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f38]) ).
thf(f40,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK1 @ X1 @ X2 ) @ X2 ) )
| ( $false
= ( ( in @ ( sK2 @ X1 @ X2 ) @ X1 )
=> ( in @ ( sK2 @ X1 @ X2 ) @ X2 ) ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f38]) ).
thf(f41,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK2 @ X1 @ X2 ) @ X2 ) )
| ( $true
= ( in @ ( sK1 @ X1 @ X2 ) @ X2 ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f40]) ).
thf(f42,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK2 @ X1 @ X2 ) @ X1 ) )
| ( $true
= ( in @ ( sK1 @ X1 @ X2 ) @ X2 ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f40]) ).
thf(f43,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK2 @ X1 @ X2 ) @ X2 ) )
| ( $false
= ( in @ ( sK1 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f39]) ).
thf(f44,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK2 @ X1 @ X2 ) @ X1 ) )
| ( $false
= ( in @ ( sK1 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f39]) ).
thf(f45,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y0 @ Y2 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f27]) ).
thf(f46,plain,
! [X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( in @ X1 @ Y1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f45]) ).
thf(f47,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( in @ X1 @ Y1 ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f46]) ).
thf(f48,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( in @ X1 @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f47]) ).
thf(f49,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( in @ X1 @ Y0 ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f48]) ).
thf(f50,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) )
=> ( in @ X1 @ X3 ) ) ),
inference(beta-eta_normalization,[],[f49]) ).
thf(f51,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $true
= ( in @ X1 @ X3 ) ) ),
inference(imp_proxy_clausification,[],[f50]) ).
thf(f52,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f26]) ).
thf(f53,plain,
! [X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ( Y0 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f52]) ).
thf(f54,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ( Y0 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f53]) ).
thf(f55,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f54]) ).
thf(f56,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f55]) ).
thf(f57,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ X3 )
=> ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f56]) ).
thf(f58,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ X3 ) )
| ( $true
= ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ) ) ),
inference(imp_proxy_clausification,[],[f57]) ).
thf(f59,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $false
= ( X2 @ X1 ) )
| ( $false
= ( in @ X1 @ X3 ) ) ),
inference(imp_proxy_clausification,[],[f58]) ).
thf(f85,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true = $false )
| ( $true
= ( in @ ( sK2 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X0 ) )
| ( $true
= ( in @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X2 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X2 ) ),
inference(constrained_superposition,[],[f51,f42]) ).
thf(f88,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true
= ( in @ ( sK2 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X0 ) )
| ( $true
= ( in @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X2 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X2 ) ),
inference(trivial_inequality_removal,[],[f85]) ).
thf(f96,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true = $false )
| ( $false
= ( X1 @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) ) )
| ( $false
= ( in @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X0 ) )
| ( $false
= ( in @ ( sK2 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X2 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X2 ) ),
inference(constrained_superposition,[],[f59,f43]) ).
thf(f97,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( $false
= ( in @ ( sK2 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X2 ) )
| ( $false
= ( in @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X0 ) )
| ( $false
= ( X1 @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) ) )
| ( ( dsetconstr @ X0 @ X1 )
= X2 ) ),
inference(trivial_inequality_removal,[],[f96]) ).
thf(f104,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true = $false )
| ( $true
= ( in @ ( sK2 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X0 ) )
| ( $false
= ( in @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ ( dsetconstr @ X0 @ X1 ) ) )
| ( ( dsetconstr @ X0 @ X1 )
= X2 ) ),
inference(constrained_superposition,[],[f51,f44]) ).
thf(f105,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( $false
= ( in @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ ( dsetconstr @ X0 @ X1 ) ) )
| ( $true
= ( in @ ( sK2 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X0 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X2 ) ),
inference(trivial_inequality_removal,[],[f104]) ).
thf(f119,plain,
! [X0: $i,X1: $i > $o] :
( ( $true = $false )
| ( $true
= ( in @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X0 ) @ X0 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X0 )
| ( $true
= ( in @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X0 ) @ X0 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X0 ) ),
inference(constrained_superposition,[],[f41,f88]) ).
thf(f122,plain,
! [X0: $i,X1: $i > $o] :
( ( $true = $false )
| ( $true
= ( in @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X0 ) @ X0 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X0 ) ),
inference(duplicate_literal_removal,[],[f119]) ).
thf(f123,plain,
! [X0: $i,X1: $i > $o] :
( ( $true
= ( in @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X0 ) @ X0 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X0 ) ),
inference(trivial_inequality_removal,[],[f122]) ).
thf(f135,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true = $false )
| ( $false
= ( X1 @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) ) )
| ( $false
= ( in @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X0 ) )
| ( $true
= ( in @ ( sK2 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X0 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X2 ) ),
inference(constrained_superposition,[],[f59,f105]) ).
thf(f136,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true
= ( in @ ( sK2 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X0 ) )
| ( $false
= ( X1 @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) ) )
| ( $false
= ( in @ ( sK1 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X0 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X2 ) ),
inference(trivial_inequality_removal,[],[f135]) ).
thf(f139,plain,
! [X2: $i,X0: $i] :
( ( $false
= ( in
@ ( sK2
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X2 )
@ X2 ) )
| ( $false
= ( in
@ ( sK1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X2 )
@ X0 ) )
| ( $false
= ( ^ [Y0: $i] : $true
@ ( sK1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X2 ) ) )
| ( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X2 ) ),
inference(primitive_instantiation,[],[f97]) ).
thf(f269,plain,
! [X2: $i,X0: $i] :
( ( $false
= ( in
@ ( sK2
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X2 )
@ X2 ) )
| ( $false
= ( in
@ ( sK1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X2 )
@ X0 ) )
| ( $true = $false )
| ( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X2 ) ),
inference(beta-eta_normalization,[],[f139]) ).
thf(f270,plain,
! [X2: $i,X0: $i] :
( ( $false
= ( in
@ ( sK2
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X2 )
@ X2 ) )
| ( $false
= ( in
@ ( sK1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X2 )
@ X0 ) )
| ( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X2 ) ),
inference(trivial_inequality_removal,[],[f269]) ).
thf(f622,plain,
! [X0: $i] :
( ( $true = $false )
| ( $false
= ( in
@ ( sK1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X0 )
@ X0 ) )
| ( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X0 )
| ( $false
= ( ^ [Y0: $i] : $true
@ ( sK1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X0 ) ) )
| ( $false
= ( in
@ ( sK1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X0 )
@ X0 ) )
| ( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X0 ) ),
inference(constrained_superposition,[],[f270,f136]) ).
thf(f696,plain,
! [X0: $i] :
( ( $true = $false )
| ( $false
= ( in
@ ( sK1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X0 )
@ X0 ) )
| ( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X0 )
| ( $false
= ( ^ [Y0: $i] : $true
@ ( sK1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X0 ) ) ) ),
inference(duplicate_literal_removal,[],[f622]) ).
thf(f697,plain,
! [X0: $i] :
( ( $false
= ( in
@ ( sK1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X0 )
@ X0 ) )
| ( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X0 )
| ( $false
= ( ^ [Y0: $i] : $true
@ ( sK1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X0 ) ) ) ),
inference(trivial_inequality_removal,[],[f696]) ).
thf(f698,plain,
! [X0: $i] :
( ( $false
= ( in
@ ( sK1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X0 )
@ X0 ) )
| ( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X0 )
| ( $true = $false ) ),
inference(beta-eta_normalization,[],[f697]) ).
thf(f699,plain,
! [X0: $i] :
( ( $false
= ( in
@ ( sK1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
@ X0 )
@ X0 ) )
| ( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X0 ) ),
inference(trivial_inequality_removal,[],[f698]) ).
thf(f918,plain,
! [X0: $i] :
( ( $true = $false )
| ( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X0 )
| ( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X0 ) ),
inference(constrained_superposition,[],[f123,f699]) ).
thf(f919,plain,
! [X0: $i] :
( ( $true = $false )
| ( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X0 ) ),
inference(duplicate_literal_removal,[],[f918]) ).
thf(f920,plain,
! [X0: $i] :
( ( dsetconstr @ X0
@ ^ [Y0: $i] : $true )
= X0 ),
inference(trivial_inequality_removal,[],[f919]) ).
thf(f1046,plain,
$false,
inference(backward_subsumption_resolution,[],[f23,f920]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU517^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.10/0.16 % Computer : n010.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Tue Sep 29 13:48:18 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20 Running first-order model finding
% 0.10/0.20 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.39/0.36 % (2881350)Will run a generic schedule for satisfiability detection.
% 0.39/0.36 % (2881358)dis+10_1_sil=32000:sp=arity:random_seed=1611537372:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.39/0.36 % (2881356)% WARNING: option uhcvi not known.
% 0.39/0.36 % (2881357)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=541443189:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.39/0.36 % (2881356)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2074082026:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.39/0.36 % (2881360)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2242169359:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.39/0.36 % (2881361)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2761013914:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.39/0.36 % (2881359)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3429581419:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.39/0.36 % (2881356)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.39/0.36 % (2881356)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.39/0.36 % (2881355)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=63769909_2999 on theBenchmark for (2999ds/0Mi)
% 0.39/0.36 % (2881359)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.39/0.36 % Exception at run slice level
% 0.39/0.36 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.39/0.36 % (2881358)Instruction limit reached!
% 0.39/0.36 % (2881358)------------------------------
% 0.39/0.36 % (2881358)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.36 % (2881358)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.36 % (2881358)CaDiCaL version: 2.1.3
% 0.39/0.36 % (2881358)Termination reason: Instruction limit
% 0.39/0.36 % (2881358)Termination phase: Saturation
% 0.39/0.36 % (2881358)Time elapsed: 0.028 s
% 0.39/0.36 % (2881358)Peak memory usage: 12 MB
% 0.39/0.36 % (2881358)Instructions burned: 105 (million)
% 0.39/0.36 % (2881369)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3384291846:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.39/0.36 % Exception at run slice level
% 0.39/0.36 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.39/0.36 % (2881370)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2903819737:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.39/0.36 % (2881372)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3628451125:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.39/0.36 % (2881372)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.39/0.36 % (2881372)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.39/0.36 % (2881359)Instruction limit reached!
% 0.39/0.36 % (2881359)------------------------------
% 0.39/0.36 % (2881359)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.36 % (2881359)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.36 % (2881359)CaDiCaL version: 2.1.3
% 0.39/0.36 % (2881359)Termination reason: Instruction limit
% 0.39/0.36 % (2881359)Termination phase: Saturation
% 0.39/0.36 % (2881359)Time elapsed: 0.056 s
% 0.39/0.36 % (2881359)Peak memory usage: 12 MB
% 0.39/0.36 % (2881359)Instructions burned: 117 (million)
% 0.39/0.36 % (2881370)Instruction limit reached!
% 0.39/0.36 % (2881370)------------------------------
% 0.39/0.36 % (2881370)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.36 % (2881370)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.36 % (2881370)CaDiCaL version: 2.1.3
% 0.39/0.36 % (2881370)Termination reason: Instruction limit
% 0.39/0.36 % (2881370)Termination phase: Saturation
% 0.39/0.36 % (2881370)Time elapsed: 0.035 s
% 0.39/0.36 % (2881370)Peak memory usage: 13 MB
% 0.39/0.36 % (2881370)Instructions burned: 131 (million)
% 0.39/0.36 % (2881360)Instruction limit reached!
% 0.39/0.36 % (2881360)------------------------------
% 0.39/0.36 % (2881360)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.36 % (2881360)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.36 % (2881360)CaDiCaL version: 2.1.3
% 0.39/0.36 % (2881360)Termination reason: Instruction limit
% 0.39/0.36 % (2881360)Termination phase: Saturation
% 0.39/0.36 % (2881360)Time elapsed: 0.067 s
% 0.39/0.36 % (2881360)Peak memory usage: 13 MB
% 0.39/0.36 % (2881360)Instructions burned: 132 (million)
% 0.39/0.36 % (2881375)ott-21_1_sil=16000:fs=off:random_seed=3158512787:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.39/0.36 % (2881376)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3133181424:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.39/0.36 % (2881361)Instruction limit reached!
% 0.39/0.36 % (2881361)------------------------------
% 0.39/0.36 % (2881361)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.36 % (2881361)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.36 % (2881361)CaDiCaL version: 2.1.3
% 0.39/0.36 % (2881361)Termination reason: Instruction limit
% 0.39/0.36 % (2881361)Termination phase: Saturation
% 0.39/0.36 % (2881361)Time elapsed: 0.079 s
% 0.39/0.36 % (2881361)Peak memory usage: 12 MB
% 0.39/0.36 % (2881361)Instructions burned: 161 (million)
% 0.39/0.36 % (2881377)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3316656764:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 0.39/0.36 % Exception at run slice level
% 0.39/0.36 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.39/0.36 % (2881380)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2391600494:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 0.39/0.36 % (2881382)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2806790168:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 0.39/0.36 % (2881356) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2881350-2881356"...
% 0.39/0.36 % Exception at run slice level
% 0.39/0.36 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.39/0.36 % (2881356)...printing done.
% 0.39/0.36 % (2881356)Refutation found. Thanks to Tanya!
% 0.39/0.36 % SZS status Theorem for theBenchmark
% 0.39/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.39/0.36 % (2881356)------------------------------
% 0.39/0.36 % (2881356)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.36 % (2881356)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.36 % (2881356)CaDiCaL version: 2.1.3
% 0.39/0.36 % (2881356)Termination reason: Refutation
% 0.39/0.36 % (2881356)Time elapsed: 0.109 s
% 0.39/0.36 % (2881356)Peak memory usage: 13 MB
% 0.39/0.36 % (2881356)Instructions burned: 233 (million)
% 0.39/0.36 % (2881350)Success in time 0.15 s
% 0.39/0.36 % Vampire exiting
%------------------------------------------------------------------------------