%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU792^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:31:24 AM UTC 2026
% Result : Theorem 0.91s 0.37s
% Output : Refutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 40
% Number of leaves : 12
% Syntax : Number of formulae : 167 ( 76 unt; 0 typ; 5 def)
% Number of atoms : 1486 ( 322 equ; 0 cnn)
% Maximal formula atoms : 10 ( 8 avg)
% Number of connectives : 2410 ( 61 ~; 137 |; 36 &;1927 @)
% ( 5 <=>; 153 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 33 ( 29 usr; 18 con; 0-4 aty)
% ( 91 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 283 ( 0 sgn 163 !; 12 ?; 283 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
binunion: $i > $i > $i ).
thf(func_def_1,type,
breln1: $i > $i > $o ).
thf(func_def_2,type,
breln1invset: $i > $i > $i ).
thf(func_def_3,type,
breln1invprop: $o ).
thf(func_def_5,type,
breln1compset: $i > $i > $i > $i ).
thf(func_def_6,type,
breln1compprop: $o ).
thf(func_def_7,type,
breln1unionCommutes: $o ).
thf(func_def_8,type,
woz2Ex: $o ).
thf(func_def_9,type,
woz2W: $o ).
thf(func_def_10,type,
woz2A: $o ).
thf(func_def_11,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_12,type,
vIMP: $o > $o > $o ).
thf(func_def_13,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_16,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_17,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_20,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_25,type,
vNOT: $o > $o ).
thf(f1,axiom,
( breln1invprop
= ( ! [X1: $i,X0: $i] :
( ( breln1 @ X0 @ X1 )
=> ( breln1 @ X0 @ ( breln1invset @ X0 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1invprop) ).
thf(f2,axiom,
! [X0: $i,X1: $i] :
( ( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ( breln1 @ X0 @ ( breln1compset @ X0 @ X1 @ X2 ) ) ) )
= breln1compprop ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1compprop) ).
thf(f3,axiom,
( breln1unionCommutes
= ( ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ( ( binunion @ X1 @ X2 )
= ( binunion @ X2 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1unionCommutes) ).
thf(f4,axiom,
( woz2Ex
= ( ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ( X1
= ( breln1invset @ X0 @ ( breln1invset @ X0 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',woz2Ex) ).
thf(f5,axiom,
! [X1: $i,X0: $i] :
( ( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ( ( breln1invset @ X0 @ ( breln1compset @ X0 @ X1 @ X2 ) )
= ( breln1compset @ X0 @ ( breln1invset @ X0 @ X2 ) @ ( breln1invset @ X0 @ X1 ) ) ) ) )
= woz2W ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',woz2W) ).
thf(f6,axiom,
( woz2A
= ( ! [X1: $i,X0: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X0 @ X3 )
=> ( ( breln1compset @ X0 @ ( binunion @ X1 @ X2 ) @ X3 )
= ( binunion @ ( breln1compset @ X0 @ X1 @ X3 ) @ ( breln1compset @ X0 @ X2 @ X3 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',woz2A) ).
thf(f7,conjecture,
( breln1invprop
=> ( breln1compprop
=> ( breln1unionCommutes
=> ( woz2Ex
=> ( woz2W
=> ( woz2A
=> ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X0 @ X3 )
=> ( ( breln1compset @ X0 @ ( binunion @ X1 @ X2 ) @ X3 )
= ( binunion @ ( breln1invset @ X0 @ ( breln1compset @ X0 @ ( breln1invset @ X0 @ X3 ) @ ( breln1invset @ X0 @ X2 ) ) ) @ ( breln1invset @ X0 @ ( breln1compset @ X0 @ ( breln1invset @ X0 @ X3 ) @ ( breln1invset @ X0 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',woz2B) ).
thf(f8,negated_conjecture,
~ ( breln1invprop
=> ( breln1compprop
=> ( breln1unionCommutes
=> ( woz2Ex
=> ( woz2W
=> ( woz2A
=> ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X0 @ X3 )
=> ( ( breln1compset @ X0 @ ( binunion @ X1 @ X2 ) @ X3 )
= ( binunion @ ( breln1invset @ X0 @ ( breln1compset @ X0 @ ( breln1invset @ X0 @ X3 ) @ ( breln1invset @ X0 @ X2 ) ) ) @ ( breln1invset @ X0 @ ( breln1compset @ X0 @ ( breln1invset @ X0 @ X3 ) @ ( breln1invset @ X0 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
thf(f9,plain,
( breln1unionCommutes
= ( ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ( ( binunion @ X1 @ X2 )
= ( binunion @ X2 @ X1 ) ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f10,plain,
( breln1unionCommutes
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y1 @ Y2 )
=> ( ( binunion @ Y0 @ Y2 )
= ( binunion @ Y2 @ Y0 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
! [X0: $i,X1: $i] :
( ( ( breln1 @ X1 @ X0 )
=> ! [X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ( ( breln1invset @ X1 @ ( breln1compset @ X1 @ X0 @ X2 ) )
= ( breln1compset @ X1 @ ( breln1invset @ X1 @ X2 ) @ ( breln1invset @ X1 @ X0 ) ) ) ) )
= woz2W ),
inference(rectify,[],[f5]) ).
thf(f12,plain,
( woz2W
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y0 @ Y2 )
=> ( ( breln1invset @ Y0 @ ( breln1compset @ Y0 @ Y1 @ Y2 ) )
= ( breln1compset @ Y0 @ ( breln1invset @ Y0 @ Y2 ) @ ( breln1invset @ Y0 @ Y1 ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
( woz2Ex
= ( ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ( X1
= ( breln1invset @ X0 @ ( breln1invset @ X0 @ X1 ) ) ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f14,plain,
( woz2Ex
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y1 @ Y0 )
=> ( ( breln1invset @ Y1 @ ( breln1invset @ Y1 @ Y0 ) )
= Y0 ) ) ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
~ ( breln1invprop
=> ( breln1compprop
=> ( breln1unionCommutes
=> ( woz2Ex
=> ( woz2W
=> ( woz2A
=> ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X0 @ X3 )
=> ( ( breln1compset @ X0 @ ( binunion @ X1 @ X2 ) @ X3 )
= ( binunion @ ( breln1invset @ X0 @ ( breln1compset @ X0 @ ( breln1invset @ X0 @ X3 ) @ ( breln1invset @ X0 @ X2 ) ) ) @ ( breln1invset @ X0 @ ( breln1compset @ X0 @ ( breln1invset @ X0 @ X3 ) @ ( breln1invset @ X0 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f16,plain,
~ ( ( breln1invprop = $true )
=> ( ( breln1compprop = $true )
=> ( ( breln1unionCommutes = $true )
=> ( ( woz2Ex = $true )
=> ( ( woz2W = $true )
=> ( ( woz2A = $true )
=> ! [X0: $i,X1: $i] :
( ( ( breln1 @ X0 @ X1 )
= $true )
=> ! [X2: $i] :
( ( ( breln1 @ X0 @ X2 )
= $true )
=> ! [X3: $i] :
( ( ( breln1 @ X0 @ X3 )
= $true )
=> ( ( breln1compset @ X0 @ ( binunion @ X1 @ X2 ) @ X3 )
= ( binunion @ ( breln1invset @ X0 @ ( breln1compset @ X0 @ ( breln1invset @ X0 @ X3 ) @ ( breln1invset @ X0 @ X2 ) ) ) @ ( breln1invset @ X0 @ ( breln1compset @ X0 @ ( breln1invset @ X0 @ X3 ) @ ( breln1invset @ X0 @ X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
( breln1invprop
= ( ! [X0: $i,X1: $i] :
( ( breln1 @ X1 @ X0 )
=> ( breln1 @ X1 @ ( breln1invset @ X1 @ X0 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f18,plain,
( breln1invprop
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( breln1 @ Y0 @ ( breln1invset @ Y0 @ Y1 ) ) ) ) ) ),
inference(fool_elimination,[],[f17]) ).
thf(f19,plain,
( woz2A
= ( ! [X0: $i,X1: $i] :
( ( breln1 @ X1 @ X0 )
=> ! [X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ( ( breln1compset @ X1 @ ( binunion @ X0 @ X2 ) @ X3 )
= ( binunion @ ( breln1compset @ X1 @ X0 @ X3 ) @ ( breln1compset @ X1 @ X2 @ X3 ) ) ) ) ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f20,plain,
( woz2A
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y0 @ Y2 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( breln1 @ Y0 @ Y3 )
=> ( ( breln1compset @ Y0 @ ( binunion @ Y1 @ Y2 ) @ Y3 )
= ( binunion @ ( breln1compset @ Y0 @ Y1 @ Y3 ) @ ( breln1compset @ Y0 @ Y2 @ Y3 ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f19]) ).
thf(f21,plain,
! [X0: $i,X1: $i] :
( ( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ( breln1 @ X0 @ ( breln1compset @ X0 @ X1 @ X2 ) ) ) )
= breln1compprop ),
inference(rectify,[],[f2]) ).
thf(f22,plain,
( breln1compprop
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y1 @ Y2 )
=> ( breln1 @ Y1 @ ( breln1compset @ Y1 @ Y0 @ Y2 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f21]) ).
thf(f23,plain,
( ? [X1: $i,X0: $i] :
( ? [X2: $i] :
( ? [X3: $i] :
( ( ( breln1 @ X0 @ X3 )
= $true )
& ( ( breln1compset @ X0 @ ( binunion @ X1 @ X2 ) @ X3 )
!= ( binunion @ ( breln1invset @ X0 @ ( breln1compset @ X0 @ ( breln1invset @ X0 @ X3 ) @ ( breln1invset @ X0 @ X2 ) ) ) @ ( breln1invset @ X0 @ ( breln1compset @ X0 @ ( breln1invset @ X0 @ X3 ) @ ( breln1invset @ X0 @ X1 ) ) ) ) ) )
& ( ( breln1 @ X0 @ X2 )
= $true ) )
& ( ( breln1 @ X0 @ X1 )
= $true ) )
& ( woz2A = $true )
& ( woz2W = $true )
& ( woz2Ex = $true )
& ( breln1unionCommutes = $true )
& ( breln1compprop = $true )
& ( breln1invprop = $true ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f24,plain,
( ( woz2A = $true )
& ? [X1: $i,X0: $i] :
( ? [X2: $i] :
( ? [X3: $i] :
( ( ( breln1 @ X0 @ X3 )
= $true )
& ( ( breln1compset @ X0 @ ( binunion @ X1 @ X2 ) @ X3 )
!= ( binunion @ ( breln1invset @ X0 @ ( breln1compset @ X0 @ ( breln1invset @ X0 @ X3 ) @ ( breln1invset @ X0 @ X2 ) ) ) @ ( breln1invset @ X0 @ ( breln1compset @ X0 @ ( breln1invset @ X0 @ X3 ) @ ( breln1invset @ X0 @ X1 ) ) ) ) ) )
& ( ( breln1 @ X0 @ X2 )
= $true ) )
& ( ( breln1 @ X0 @ X1 )
= $true ) )
& ( breln1compprop = $true )
& ( woz2W = $true )
& ( breln1invprop = $true )
& ( breln1unionCommutes = $true )
& ( woz2Ex = $true ) ),
inference(flattening,[],[f23]) ).
thf(f25,plain,
( ( woz2A = $true )
& ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ? [X3: $i] :
( ( $true
= ( breln1 @ X1 @ X3 ) )
& ( ( binunion @ ( breln1invset @ X1 @ ( breln1compset @ X1 @ ( breln1invset @ X1 @ X3 ) @ ( breln1invset @ X1 @ X2 ) ) ) @ ( breln1invset @ X1 @ ( breln1compset @ X1 @ ( breln1invset @ X1 @ X3 ) @ ( breln1invset @ X1 @ X0 ) ) ) )
!= ( breln1compset @ X1 @ ( binunion @ X0 @ X2 ) @ X3 ) ) )
& ( $true
= ( breln1 @ X1 @ X2 ) ) )
& ( $true
= ( breln1 @ X1 @ X0 ) ) )
& ( breln1compprop = $true )
& ( woz2W = $true )
& ( breln1invprop = $true )
& ( breln1unionCommutes = $true )
& ( woz2Ex = $true ) ),
inference(rectify,[],[f24]) ).
thf(f26,plain,
( ( woz2A = $true )
& ( ( breln1 @ sK1 @ sK3 )
= $true )
& ( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
!= ( binunion @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ sK3 ) @ ( breln1invset @ sK1 @ sK2 ) ) ) @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ sK3 ) @ ( breln1invset @ sK1 @ sK0 ) ) ) ) )
& ( $true
= ( breln1 @ sK1 @ sK2 ) )
& ( $true
= ( breln1 @ sK1 @ sK0 ) )
& ( breln1compprop = $true )
& ( woz2W = $true )
& ( breln1invprop = $true )
& ( breln1unionCommutes = $true )
& ( woz2Ex = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f25]) ).
thf(f27,plain,
( breln1invprop
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( breln1 @ Y0 @ ( breln1invset @ Y0 @ Y1 ) ) ) ) ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f28,plain,
woz2Ex = $true,
inference(cnf_transformation,[],[f26]) ).
thf(f29,plain,
breln1unionCommutes = $true,
inference(cnf_transformation,[],[f26]) ).
thf(f30,plain,
breln1invprop = $true,
inference(cnf_transformation,[],[f26]) ).
thf(f31,plain,
woz2W = $true,
inference(cnf_transformation,[],[f26]) ).
thf(f32,plain,
breln1compprop = $true,
inference(cnf_transformation,[],[f26]) ).
thf(f33,plain,
( $true
= ( breln1 @ sK1 @ sK0 ) ),
inference(cnf_transformation,[],[f26]) ).
thf(f34,plain,
( $true
= ( breln1 @ sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f26]) ).
thf(f35,plain,
( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
!= ( binunion @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ sK3 ) @ ( breln1invset @ sK1 @ sK2 ) ) ) @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ sK3 ) @ ( breln1invset @ sK1 @ sK0 ) ) ) ) ),
inference(cnf_transformation,[],[f26]) ).
thf(f36,plain,
( ( breln1 @ sK1 @ sK3 )
= $true ),
inference(cnf_transformation,[],[f26]) ).
thf(f37,plain,
woz2A = $true,
inference(cnf_transformation,[],[f26]) ).
thf(f38,plain,
( breln1compprop
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y1 @ Y2 )
=> ( breln1 @ Y1 @ ( breln1compset @ Y1 @ Y0 @ Y2 ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f39,plain,
( woz2W
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y0 @ Y2 )
=> ( ( breln1invset @ Y0 @ ( breln1compset @ Y0 @ Y1 @ Y2 ) )
= ( breln1compset @ Y0 @ ( breln1invset @ Y0 @ Y2 ) @ ( breln1invset @ Y0 @ Y1 ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f40,plain,
( breln1unionCommutes
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y1 @ Y2 )
=> ( ( binunion @ Y0 @ Y2 )
= ( binunion @ Y2 @ Y0 ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f41,plain,
( woz2A
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y0 @ Y2 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( breln1 @ Y0 @ Y3 )
=> ( ( breln1compset @ Y0 @ ( binunion @ Y1 @ Y2 ) @ Y3 )
= ( binunion @ ( breln1compset @ Y0 @ Y1 @ Y3 ) @ ( breln1compset @ Y0 @ Y2 @ Y3 ) ) ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f42,plain,
( woz2Ex
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y1 @ Y0 )
=> ( ( breln1invset @ Y1 @ ( breln1invset @ Y1 @ Y0 ) )
= Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f45,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( breln1 @ Y0 @ ( breln1invset @ Y0 @ Y1 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f27,f30]) ).
thf(f46,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y1 @ Y2 )
=> ( breln1 @ Y1 @ ( breln1compset @ Y1 @ Y0 @ Y2 ) ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f38,f32]) ).
thf(f47,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y0 @ Y2 )
=> ( ( breln1invset @ Y0 @ ( breln1compset @ Y0 @ Y1 @ Y2 ) )
= ( breln1compset @ Y0 @ ( breln1invset @ Y0 @ Y2 ) @ ( breln1invset @ Y0 @ Y1 ) ) ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f39,f31]) ).
thf(f48,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y1 @ Y2 )
=> ( ( binunion @ Y0 @ Y2 )
= ( binunion @ Y2 @ Y0 ) ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f40,f29]) ).
thf(f49,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y0 @ Y2 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( breln1 @ Y0 @ Y3 )
=> ( ( breln1compset @ Y0 @ ( binunion @ Y1 @ Y2 ) @ Y3 )
= ( binunion @ ( breln1compset @ Y0 @ Y1 @ Y3 ) @ ( breln1compset @ Y0 @ Y2 @ Y3 ) ) ) ) ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f41,f37]) ).
thf(f50,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y1 @ Y0 )
=> ( ( breln1invset @ Y1 @ ( breln1invset @ Y1 @ Y0 ) )
= Y0 ) ) ) ) ),
inference(definition_unfolding,[],[f42,f28]) ).
thf(f51,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y0 @ Y2 )
=> ( ( breln1invset @ Y0 @ ( breln1compset @ Y0 @ Y1 @ Y2 ) )
= ( breln1compset @ Y0 @ ( breln1invset @ Y0 @ Y2 ) @ ( breln1invset @ Y0 @ Y1 ) ) ) ) ) ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f47]) ).
thf(f52,plain,
! [X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ X1 @ Y0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ X1 @ Y1 )
=> ( ( breln1invset @ X1 @ ( breln1compset @ X1 @ Y0 @ Y1 ) )
= ( breln1compset @ X1 @ ( breln1invset @ X1 @ Y1 ) @ ( breln1invset @ X1 @ Y0 ) ) ) ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f51]) ).
thf(f53,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( breln1 @ X1 @ Y0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ X1 @ Y1 )
=> ( ( breln1invset @ X1 @ ( breln1compset @ X1 @ Y0 @ Y1 ) )
= ( breln1compset @ X1 @ ( breln1invset @ X1 @ Y1 ) @ ( breln1invset @ X1 @ Y0 ) ) ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f52]) ).
thf(f54,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( breln1 @ X1 @ X2 )
=> ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ X1 @ Y0 )
=> ( ( breln1invset @ X1 @ ( breln1compset @ X1 @ X2 @ Y0 ) )
= ( breln1compset @ X1 @ ( breln1invset @ X1 @ Y0 ) @ ( breln1invset @ X1 @ X2 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f53]) ).
thf(f55,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( breln1 @ X1 @ X2 ) )
| ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ X1 @ Y0 )
=> ( ( breln1invset @ X1 @ ( breln1compset @ X1 @ X2 @ Y0 ) )
= ( breln1compset @ X1 @ ( breln1invset @ X1 @ Y0 ) @ ( breln1invset @ X1 @ X2 ) ) ) ) ) ) ),
inference(imp_proxy_clausification,[],[f54]) ).
thf(f56,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( breln1 @ X1 @ X2 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( breln1 @ X1 @ Y0 )
=> ( ( breln1invset @ X1 @ ( breln1compset @ X1 @ X2 @ Y0 ) )
= ( breln1compset @ X1 @ ( breln1invset @ X1 @ Y0 ) @ ( breln1invset @ X1 @ X2 ) ) ) )
@ X3 ) ) ),
inference(pi_proxy_clausification,[],[f55]) ).
thf(f57,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( ( breln1 @ X1 @ X3 )
=> ( ( breln1invset @ X1 @ ( breln1compset @ X1 @ X2 @ X3 ) )
= ( breln1compset @ X1 @ ( breln1invset @ X1 @ X3 ) @ ( breln1invset @ X1 @ X2 ) ) ) )
= $true )
| ( $false
= ( breln1 @ X1 @ X2 ) ) ),
inference(beta-eta_normalization,[],[f56]) ).
thf(f58,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( breln1 @ X1 @ X3 ) )
| ( ( ( breln1invset @ X1 @ ( breln1compset @ X1 @ X2 @ X3 ) )
= ( breln1compset @ X1 @ ( breln1invset @ X1 @ X3 ) @ ( breln1invset @ X1 @ X2 ) ) )
= $true )
| ( $false
= ( breln1 @ X1 @ X2 ) ) ),
inference(imp_proxy_clausification,[],[f57]) ).
thf(f59,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( breln1compset @ X1 @ ( breln1invset @ X1 @ X3 ) @ ( breln1invset @ X1 @ X2 ) )
= ( breln1invset @ X1 @ ( breln1compset @ X1 @ X2 @ X3 ) ) )
| ( $false
= ( breln1 @ X1 @ X2 ) )
| ( $false
= ( breln1 @ X1 @ X3 ) ) ),
inference(equality_proxy_clausification,[],[f58]) ).
thf(f60,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y0 @ Y2 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( breln1 @ Y0 @ Y3 )
=> ( ( breln1compset @ Y0 @ ( binunion @ Y1 @ Y2 ) @ Y3 )
= ( binunion @ ( breln1compset @ Y0 @ Y1 @ Y3 ) @ ( breln1compset @ Y0 @ Y2 @ Y3 ) ) ) ) ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f49]) ).
thf(f61,plain,
! [X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ X1 @ Y0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ X1 @ Y1 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ X1 @ Y2 )
=> ( ( breln1compset @ X1 @ ( binunion @ Y0 @ Y1 ) @ Y2 )
= ( binunion @ ( breln1compset @ X1 @ Y0 @ Y2 ) @ ( breln1compset @ X1 @ Y1 @ Y2 ) ) ) ) ) ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f60]) ).
thf(f62,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( breln1 @ X1 @ Y0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ X1 @ Y1 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ X1 @ Y2 )
=> ( ( breln1compset @ X1 @ ( binunion @ Y0 @ Y1 ) @ Y2 )
= ( binunion @ ( breln1compset @ X1 @ Y0 @ Y2 ) @ ( breln1compset @ X1 @ Y1 @ Y2 ) ) ) ) ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f61]) ).
thf(f63,plain,
! [X2: $i,X1: $i] :
( ( ( breln1 @ X1 @ X2 )
=> ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ X1 @ Y0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ X1 @ Y1 )
=> ( ( breln1compset @ X1 @ ( binunion @ X2 @ Y0 ) @ Y1 )
= ( binunion @ ( breln1compset @ X1 @ X2 @ Y1 ) @ ( breln1compset @ X1 @ Y0 @ Y1 ) ) ) ) ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f62]) ).
thf(f64,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ X1 @ Y0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ X1 @ Y1 )
=> ( ( breln1compset @ X1 @ ( binunion @ X2 @ Y0 ) @ Y1 )
= ( binunion @ ( breln1compset @ X1 @ X2 @ Y1 ) @ ( breln1compset @ X1 @ Y0 @ Y1 ) ) ) ) ) ) ) )
| ( $false
= ( breln1 @ X1 @ X2 ) ) ),
inference(imp_proxy_clausification,[],[f63]) ).
thf(f65,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( ^ [Y0: $i] :
( ( breln1 @ X1 @ Y0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ X1 @ Y1 )
=> ( ( breln1compset @ X1 @ ( binunion @ X2 @ Y0 ) @ Y1 )
= ( binunion @ ( breln1compset @ X1 @ X2 @ Y1 ) @ ( breln1compset @ X1 @ Y0 @ Y1 ) ) ) ) ) )
@ X3 )
= $true )
| ( $false
= ( breln1 @ X1 @ X2 ) ) ),
inference(pi_proxy_clausification,[],[f64]) ).
thf(f66,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( ( breln1 @ X1 @ X3 )
=> ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ X1 @ Y0 )
=> ( ( breln1compset @ X1 @ ( binunion @ X2 @ X3 ) @ Y0 )
= ( binunion @ ( breln1compset @ X1 @ X2 @ Y0 ) @ ( breln1compset @ X1 @ X3 @ Y0 ) ) ) ) ) )
= $true )
| ( $false
= ( breln1 @ X1 @ X2 ) ) ),
inference(beta-eta_normalization,[],[f65]) ).
thf(f67,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ X1 @ Y0 )
=> ( ( breln1compset @ X1 @ ( binunion @ X2 @ X3 ) @ Y0 )
= ( binunion @ ( breln1compset @ X1 @ X2 @ Y0 ) @ ( breln1compset @ X1 @ X3 @ Y0 ) ) ) ) )
= $true )
| ( $false
= ( breln1 @ X1 @ X2 ) )
| ( $false
= ( breln1 @ X1 @ X3 ) ) ),
inference(imp_proxy_clausification,[],[f66]) ).
thf(f68,plain,
! [X2: $i,X3: $i,X1: $i,X4: $i] :
( ( $false
= ( breln1 @ X1 @ X2 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( breln1 @ X1 @ Y0 )
=> ( ( breln1compset @ X1 @ ( binunion @ X2 @ X3 ) @ Y0 )
= ( binunion @ ( breln1compset @ X1 @ X2 @ Y0 ) @ ( breln1compset @ X1 @ X3 @ Y0 ) ) ) )
@ X4 ) )
| ( $false
= ( breln1 @ X1 @ X3 ) ) ),
inference(pi_proxy_clausification,[],[f67]) ).
thf(f69,plain,
! [X2: $i,X3: $i,X1: $i,X4: $i] :
( ( ( ( breln1 @ X1 @ X4 )
=> ( ( breln1compset @ X1 @ ( binunion @ X2 @ X3 ) @ X4 )
= ( binunion @ ( breln1compset @ X1 @ X2 @ X4 ) @ ( breln1compset @ X1 @ X3 @ X4 ) ) ) )
= $true )
| ( $false
= ( breln1 @ X1 @ X2 ) )
| ( $false
= ( breln1 @ X1 @ X3 ) ) ),
inference(beta-eta_normalization,[],[f68]) ).
thf(f70,plain,
! [X2: $i,X3: $i,X1: $i,X4: $i] :
( ( ( breln1 @ X1 @ X4 )
= $false )
| ( ( ( breln1compset @ X1 @ ( binunion @ X2 @ X3 ) @ X4 )
= ( binunion @ ( breln1compset @ X1 @ X2 @ X4 ) @ ( breln1compset @ X1 @ X3 @ X4 ) ) )
= $true )
| ( $false
= ( breln1 @ X1 @ X2 ) )
| ( $false
= ( breln1 @ X1 @ X3 ) ) ),
inference(imp_proxy_clausification,[],[f69]) ).
thf(f71,plain,
! [X2: $i,X3: $i,X1: $i,X4: $i] :
( ( ( binunion @ ( breln1compset @ X1 @ X2 @ X4 ) @ ( breln1compset @ X1 @ X3 @ X4 ) )
= ( breln1compset @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) )
| ( $false
= ( breln1 @ X1 @ X2 ) )
| ( ( breln1 @ X1 @ X4 )
= $false )
| ( $false
= ( breln1 @ X1 @ X3 ) ) ),
inference(equality_proxy_clausification,[],[f70]) ).
thf(f72,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y1 @ Y0 )
=> ( ( breln1invset @ Y1 @ ( breln1invset @ Y1 @ Y0 ) )
= Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f50]) ).
thf(f73,plain,
! [X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ Y0 @ X1 )
=> ( ( breln1invset @ Y0 @ ( breln1invset @ Y0 @ X1 ) )
= X1 ) ) )
= $true ),
inference(beta-eta_normalization,[],[f72]) ).
thf(f74,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( breln1 @ Y0 @ X1 )
=> ( ( breln1invset @ Y0 @ ( breln1invset @ Y0 @ X1 ) )
= X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f73]) ).
thf(f75,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( breln1 @ X2 @ X1 )
=> ( ( breln1invset @ X2 @ ( breln1invset @ X2 @ X1 ) )
= X1 ) ) ),
inference(beta-eta_normalization,[],[f74]) ).
thf(f76,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ( breln1invset @ X2 @ ( breln1invset @ X2 @ X1 ) )
= X1 ) )
| ( $false
= ( breln1 @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f75]) ).
thf(f77,plain,
! [X2: $i,X1: $i] :
( ( ( breln1invset @ X2 @ ( breln1invset @ X2 @ X1 ) )
= X1 )
| ( $false
= ( breln1 @ X2 @ X1 ) ) ),
inference(equality_proxy_clausification,[],[f76]) ).
thf(f78,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y1 @ Y2 )
=> ( ( binunion @ Y0 @ Y2 )
= ( binunion @ Y2 @ Y0 ) ) ) ) ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f48]) ).
thf(f79,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ Y0 @ X1 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( ( binunion @ X1 @ Y1 )
= ( binunion @ Y1 @ X1 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f78]) ).
thf(f80,plain,
! [X2: $i,X1: $i] :
( ( ^ [Y0: $i] :
( ( breln1 @ Y0 @ X1 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( ( binunion @ X1 @ Y1 )
= ( binunion @ Y1 @ X1 ) ) ) ) )
@ X2 )
= $true ),
inference(pi_proxy_clausification,[],[f79]) ).
thf(f81,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( breln1 @ X2 @ X1 )
=> ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ X2 @ Y0 )
=> ( ( binunion @ X1 @ Y0 )
= ( binunion @ Y0 @ X1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f80]) ).
thf(f82,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( breln1 @ X2 @ X1 ) )
| ( ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ X2 @ Y0 )
=> ( ( binunion @ X1 @ Y0 )
= ( binunion @ Y0 @ X1 ) ) ) )
= $true ) ),
inference(imp_proxy_clausification,[],[f81]) ).
thf(f83,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( ^ [Y0: $i] :
( ( breln1 @ X2 @ Y0 )
=> ( ( binunion @ X1 @ Y0 )
= ( binunion @ Y0 @ X1 ) ) )
@ X3 )
= $true )
| ( $false
= ( breln1 @ X2 @ X1 ) ) ),
inference(pi_proxy_clausification,[],[f82]) ).
thf(f84,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( ( breln1 @ X2 @ X3 )
=> ( ( binunion @ X1 @ X3 )
= ( binunion @ X3 @ X1 ) ) )
= $true )
| ( $false
= ( breln1 @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f83]) ).
thf(f85,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( breln1 @ X2 @ X3 )
= $false )
| ( $false
= ( breln1 @ X2 @ X1 ) )
| ( $true
= ( ( binunion @ X1 @ X3 )
= ( binunion @ X3 @ X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f84]) ).
thf(f86,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( binunion @ X1 @ X3 )
= ( binunion @ X3 @ X1 ) )
| ( ( breln1 @ X2 @ X3 )
= $false )
| ( $false
= ( breln1 @ X2 @ X1 ) ) ),
inference(equality_proxy_clausification,[],[f85]) ).
thf(f87,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( breln1 @ Y0 @ ( breln1invset @ Y0 @ Y1 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f45]) ).
thf(f88,plain,
! [X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ X1 @ Y0 )
=> ( breln1 @ X1 @ ( breln1invset @ X1 @ Y0 ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f87]) ).
thf(f89,plain,
! [X2: $i,X1: $i] :
( ( ^ [Y0: $i] :
( ( breln1 @ X1 @ Y0 )
=> ( breln1 @ X1 @ ( breln1invset @ X1 @ Y0 ) ) )
@ X2 )
= $true ),
inference(pi_proxy_clausification,[],[f88]) ).
thf(f90,plain,
! [X2: $i,X1: $i] :
( ( ( breln1 @ X1 @ X2 )
=> ( breln1 @ X1 @ ( breln1invset @ X1 @ X2 ) ) )
= $true ),
inference(beta-eta_normalization,[],[f89]) ).
thf(f91,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( breln1 @ X1 @ ( breln1invset @ X1 @ X2 ) ) )
| ( $false
= ( breln1 @ X1 @ X2 ) ) ),
inference(imp_proxy_clausification,[],[f90]) ).
thf(f92,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( breln1 @ Y1 @ Y2 )
=> ( breln1 @ Y1 @ ( breln1compset @ Y1 @ Y0 @ Y2 ) ) ) ) ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f46]) ).
thf(f93,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ Y0 @ X1 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( breln1 @ Y0 @ ( breln1compset @ Y0 @ X1 @ Y1 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f92]) ).
thf(f94,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( breln1 @ Y0 @ X1 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( breln1 @ Y0 @ Y1 )
=> ( breln1 @ Y0 @ ( breln1compset @ Y0 @ X1 @ Y1 ) ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f93]) ).
thf(f95,plain,
! [X2: $i,X1: $i] :
( ( ( breln1 @ X2 @ X1 )
=> ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ X2 @ Y0 )
=> ( breln1 @ X2 @ ( breln1compset @ X2 @ X1 @ Y0 ) ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f94]) ).
thf(f96,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( breln1 @ X2 @ X1 ) )
| ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( breln1 @ X2 @ Y0 )
=> ( breln1 @ X2 @ ( breln1compset @ X2 @ X1 @ Y0 ) ) ) ) ) ),
inference(imp_proxy_clausification,[],[f95]) ).
thf(f97,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( breln1 @ X2 @ X1 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( breln1 @ X2 @ Y0 )
=> ( breln1 @ X2 @ ( breln1compset @ X2 @ X1 @ Y0 ) ) )
@ X3 ) ) ),
inference(pi_proxy_clausification,[],[f96]) ).
thf(f98,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( ( breln1 @ X2 @ X3 )
=> ( breln1 @ X2 @ ( breln1compset @ X2 @ X1 @ X3 ) ) )
= $true )
| ( $false
= ( breln1 @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f97]) ).
thf(f99,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( breln1 @ X2 @ ( breln1compset @ X2 @ X1 @ X3 ) ) )
| ( ( breln1 @ X2 @ X3 )
= $false )
| ( $false
= ( breln1 @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f98]) ).
thf(f109,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( breln1invset @ X1 @ ( breln1compset @ X1 @ ( breln1invset @ X1 @ X0 ) @ X2 ) )
= ( breln1compset @ X1 @ ( breln1invset @ X1 @ X2 ) @ X0 ) )
| ( ( breln1 @ X1 @ ( breln1invset @ X1 @ X0 ) )
= $false )
| ( $false
= ( breln1 @ X1 @ X2 ) )
| ( $false
= ( breln1 @ X1 @ X0 ) ) ),
inference(superposition,[],[f59,f77]) ).
thf(f122,plain,
( ( $false
= ( breln1 @ sK1 @ sK2 ) )
| ( ( breln1 @ sK1 @ sK3 )
= $false )
| ( ( binunion @ ( breln1invset @ sK1 @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ sK2 @ sK3 ) ) ) @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ sK3 ) @ ( breln1invset @ sK1 @ sK0 ) ) ) )
!= ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 ) ) ),
inference(superposition,[],[f35,f59]) ).
thf(f125,plain,
( ( ( binunion @ ( breln1invset @ sK1 @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ sK2 @ sK3 ) ) ) @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ sK3 ) @ ( breln1invset @ sK1 @ sK0 ) ) ) )
!= ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 ) )
| ( $true = $false )
| ( ( breln1 @ sK1 @ sK3 )
= $false ) ),
inference(forward_demodulation,[],[f122,f34]) ).
thf(f126,plain,
( ( ( binunion @ ( breln1invset @ sK1 @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ sK2 @ sK3 ) ) ) @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ sK3 ) @ ( breln1invset @ sK1 @ sK0 ) ) ) )
!= ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 ) )
| ( ( breln1 @ sK1 @ sK3 )
= $false ) ),
inference(trivial_inequality_removal,[],[f125]) ).
thf(f138,plain,
( ( ( binunion @ ( breln1invset @ sK1 @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ sK2 @ sK3 ) ) ) @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ sK3 ) @ ( breln1invset @ sK1 @ sK0 ) ) ) )
!= ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 ) )
| ( $true = $false ) ),
inference(forward_demodulation,[],[f126,f36]) ).
thf(f139,plain,
( ( binunion @ ( breln1invset @ sK1 @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ sK2 @ sK3 ) ) ) @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ sK3 ) @ ( breln1invset @ sK1 @ sK0 ) ) ) )
!= ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 ) ),
inference(trivial_inequality_removal,[],[f138]) ).
thf(f183,definition,
( spl4_5
<=> ( ( breln1 @ sK1 @ ( breln1invset @ sK1 @ sK3 ) )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition]) ).
thf(f184,plain,
( ( ( breln1 @ sK1 @ ( breln1invset @ sK1 @ sK3 ) )
!= $false )
| spl4_5 ),
inference(avatar_component_clause,[],[f183]) ).
thf(f185,plain,
( ( ( breln1 @ sK1 @ ( breln1invset @ sK1 @ sK3 ) )
= $false )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f183]) ).
thf(f188,definition,
( spl4_6
<=> ( ( breln1 @ sK1 @ ( breln1invset @ sK1 @ sK0 ) )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl4_6])],[avatar_definition]) ).
thf(f189,plain,
( ( ( breln1 @ sK1 @ ( breln1invset @ sK1 @ sK0 ) )
!= $false )
| spl4_6 ),
inference(avatar_component_clause,[],[f188]) ).
thf(f190,plain,
( ( ( breln1 @ sK1 @ ( breln1invset @ sK1 @ sK0 ) )
= $false )
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f188]) ).
thf(f233,plain,
( ( $false
= ( breln1 @ sK1 @ ( breln1compset @ sK1 @ sK2 @ sK3 ) ) )
| ( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
!= ( binunion @ ( breln1compset @ sK1 @ sK2 @ sK3 ) @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ sK3 ) @ ( breln1invset @ sK1 @ sK0 ) ) ) ) ) ),
inference(superposition,[],[f139,f77]) ).
thf(f239,definition,
( spl4_10
<=> ( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
= ( binunion @ ( breln1compset @ sK1 @ sK2 @ sK3 ) @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ sK3 ) @ ( breln1invset @ sK1 @ sK0 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl4_10])],[avatar_definition]) ).
thf(f241,plain,
( ( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
!= ( binunion @ ( breln1compset @ sK1 @ sK2 @ sK3 ) @ ( breln1invset @ sK1 @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ sK3 ) @ ( breln1invset @ sK1 @ sK0 ) ) ) ) )
| spl4_10 ),
inference(avatar_component_clause,[],[f239]) ).
thf(f243,definition,
( spl4_11
<=> ( $false
= ( breln1 @ sK1 @ ( breln1compset @ sK1 @ sK2 @ sK3 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl4_11])],[avatar_definition]) ).
thf(f245,plain,
( ( $false
= ( breln1 @ sK1 @ ( breln1compset @ sK1 @ sK2 @ sK3 ) ) )
| ~ spl4_11 ),
inference(avatar_component_clause,[],[f243]) ).
thf(f246,plain,
( ~ spl4_10
| spl4_11 ),
inference(avatar_split_clause,[],[f233,f243,f239]) ).
thf(f313,definition,
( spl4_20
<=> ( ( binunion @ ( breln1compset @ sK1 @ sK2 @ sK3 ) @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ ( breln1invset @ sK1 @ sK0 ) ) @ sK3 ) )
= ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_20])],[avatar_definition]) ).
thf(f315,plain,
( ( ( binunion @ ( breln1compset @ sK1 @ sK2 @ sK3 ) @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ ( breln1invset @ sK1 @ sK0 ) ) @ sK3 ) )
!= ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 ) )
| spl4_20 ),
inference(avatar_component_clause,[],[f313]) ).
thf(f367,plain,
( ( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
!= ( binunion @ ( breln1compset @ sK1 @ sK2 @ sK3 ) @ ( breln1compset @ sK1 @ sK0 @ sK3 ) ) )
| ( ( breln1 @ sK1 @ sK0 )
= $false )
| spl4_20 ),
inference(superposition,[],[f315,f77]) ).
thf(f369,plain,
( ( $true = $false )
| ( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
!= ( binunion @ ( breln1compset @ sK1 @ sK2 @ sK3 ) @ ( breln1compset @ sK1 @ sK0 @ sK3 ) ) )
| spl4_20 ),
inference(forward_demodulation,[],[f367,f33]) ).
thf(f370,plain,
( ( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
!= ( binunion @ ( breln1compset @ sK1 @ sK2 @ sK3 ) @ ( breln1compset @ sK1 @ sK0 @ sK3 ) ) )
| spl4_20 ),
inference(trivial_inequality_removal,[],[f369]) ).
thf(f408,plain,
( ( ( breln1 @ sK1 @ sK3 )
= $false )
| ( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
!= ( breln1compset @ sK1 @ ( binunion @ sK2 @ sK0 ) @ sK3 ) )
| ( $false
= ( breln1 @ sK1 @ sK2 ) )
| ( ( breln1 @ sK1 @ sK0 )
= $false )
| spl4_20 ),
inference(superposition,[],[f370,f71]) ).
thf(f422,plain,
( ( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
!= ( breln1compset @ sK1 @ ( binunion @ sK2 @ sK0 ) @ sK3 ) )
| ( $true = $false )
| ( ( breln1 @ sK1 @ sK0 )
= $false )
| ( $false
= ( breln1 @ sK1 @ sK2 ) )
| spl4_20 ),
inference(forward_demodulation,[],[f408,f36]) ).
thf(f423,plain,
( ( $false
= ( breln1 @ sK1 @ sK2 ) )
| ( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
!= ( breln1compset @ sK1 @ ( binunion @ sK2 @ sK0 ) @ sK3 ) )
| ( ( breln1 @ sK1 @ sK0 )
= $false )
| spl4_20 ),
inference(trivial_inequality_removal,[],[f422]) ).
thf(f427,plain,
( ( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
!= ( breln1compset @ sK1 @ ( binunion @ sK2 @ sK0 ) @ sK3 ) )
| ( ( breln1 @ sK1 @ sK0 )
= $false )
| ( $true = $false )
| spl4_20 ),
inference(forward_demodulation,[],[f423,f34]) ).
thf(f428,plain,
( ( ( breln1 @ sK1 @ sK0 )
= $false )
| ( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
!= ( breln1compset @ sK1 @ ( binunion @ sK2 @ sK0 ) @ sK3 ) )
| spl4_20 ),
inference(trivial_inequality_removal,[],[f427]) ).
thf(f431,plain,
( ( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
!= ( breln1compset @ sK1 @ ( binunion @ sK2 @ sK0 ) @ sK3 ) )
| ( $true = $false )
| spl4_20 ),
inference(forward_demodulation,[],[f428,f33]) ).
thf(f432,plain,
( ( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
!= ( breln1compset @ sK1 @ ( binunion @ sK2 @ sK0 ) @ sK3 ) )
| spl4_20 ),
inference(trivial_inequality_removal,[],[f431]) ).
thf(f434,plain,
( ( ( breln1 @ sK1 @ sK3 )
= $false )
| ( $true = $false )
| ~ spl4_5 ),
inference(superposition,[],[f185,f91]) ).
thf(f439,plain,
( ( ( breln1 @ sK1 @ sK3 )
= $false )
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f434]) ).
thf(f442,plain,
( ( $true = $false )
| ~ spl4_5 ),
inference(superposition,[],[f439,f36]) ).
thf(f450,plain,
( $false
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f442]) ).
thf(f451,plain,
~ spl4_5,
inference(avatar_contradiction_clause,[],[f450]) ).
thf(f475,plain,
( ( $true = $false )
| ( ( breln1 @ sK1 @ sK0 )
= $false )
| ~ spl4_6 ),
inference(superposition,[],[f91,f190]) ).
thf(f476,plain,
( ( ( breln1 @ sK1 @ sK0 )
= $false )
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f475]) ).
thf(f495,plain,
( ( $true = $false )
| ~ spl4_6 ),
inference(superposition,[],[f476,f33]) ).
thf(f502,plain,
( $false
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f495]) ).
thf(f503,plain,
~ spl4_6,
inference(avatar_contradiction_clause,[],[f502]) ).
thf(f510,plain,
( ( $true = $false )
| ( $false
= ( breln1 @ sK1 @ sK2 ) )
| ( ( breln1 @ sK1 @ sK3 )
= $false )
| ~ spl4_11 ),
inference(superposition,[],[f245,f99]) ).
thf(f515,plain,
( ( ( breln1 @ sK1 @ sK3 )
= $false )
| ( $false
= ( breln1 @ sK1 @ sK2 ) )
| ~ spl4_11 ),
inference(trivial_inequality_removal,[],[f510]) ).
thf(f518,plain,
( ( $false
= ( breln1 @ sK1 @ sK2 ) )
| ( $true = $false )
| ~ spl4_11 ),
inference(forward_demodulation,[],[f515,f36]) ).
thf(f519,plain,
( ( $false
= ( breln1 @ sK1 @ sK2 ) )
| ~ spl4_11 ),
inference(trivial_inequality_removal,[],[f518]) ).
thf(f539,plain,
( ( $true = $false )
| ~ spl4_11 ),
inference(superposition,[],[f519,f34]) ).
thf(f546,plain,
( $false
| ~ spl4_11 ),
inference(trivial_inequality_removal,[],[f539]) ).
thf(f547,plain,
~ spl4_11,
inference(avatar_contradiction_clause,[],[f546]) ).
thf(f573,plain,
( ! [X0: $i] :
( ( ( breln1 @ X0 @ sK0 )
= $false )
| ( ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 )
!= ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 ) )
| ( ( breln1 @ X0 @ sK2 )
= $false ) )
| spl4_20 ),
inference(superposition,[],[f432,f86]) ).
thf(f574,plain,
( ! [X0: $i] :
( ( ( breln1 @ X0 @ sK2 )
= $false )
| ( ( breln1 @ X0 @ sK0 )
= $false ) )
| spl4_20 ),
inference(trivial_inequality_removal,[],[f573]) ).
thf(f577,plain,
( ( ( breln1 @ sK1 @ sK3 )
= $false )
| ( ( binunion @ ( breln1compset @ sK1 @ sK2 @ sK3 ) @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ ( breln1invset @ sK1 @ sK0 ) ) @ sK3 ) )
!= ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 ) )
| ( ( breln1 @ sK1 @ ( breln1invset @ sK1 @ sK3 ) )
= $false )
| ( ( breln1 @ sK1 @ ( breln1invset @ sK1 @ sK0 ) )
= $false )
| spl4_10 ),
inference(superposition,[],[f241,f109]) ).
thf(f580,plain,
( ( ( breln1 @ sK1 @ sK3 )
= $false )
| ( ( breln1 @ sK1 @ ( breln1invset @ sK1 @ sK0 ) )
= $false )
| ( ( binunion @ ( breln1compset @ sK1 @ sK2 @ sK3 ) @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ ( breln1invset @ sK1 @ sK0 ) ) @ sK3 ) )
!= ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 ) )
| spl4_5
| spl4_10 ),
inference(forward_subsumption_resolution,[],[f577,f184]) ).
thf(f584,plain,
( ( ( breln1 @ sK1 @ sK3 )
= $false )
| ( ( binunion @ ( breln1compset @ sK1 @ sK2 @ sK3 ) @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ ( breln1invset @ sK1 @ sK0 ) ) @ sK3 ) )
!= ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 ) )
| spl4_5
| spl4_6
| spl4_10 ),
inference(forward_subsumption_resolution,[],[f580,f189]) ).
thf(f589,plain,
( ( $true = $false )
| ( ( binunion @ ( breln1compset @ sK1 @ sK2 @ sK3 ) @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ ( breln1invset @ sK1 @ sK0 ) ) @ sK3 ) )
!= ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 ) )
| spl4_5
| spl4_6
| spl4_10 ),
inference(forward_demodulation,[],[f584,f36]) ).
thf(f590,plain,
( ( ( binunion @ ( breln1compset @ sK1 @ sK2 @ sK3 ) @ ( breln1compset @ sK1 @ ( breln1invset @ sK1 @ ( breln1invset @ sK1 @ sK0 ) ) @ sK3 ) )
!= ( breln1compset @ sK1 @ ( binunion @ sK0 @ sK2 ) @ sK3 ) )
| spl4_5
| spl4_6
| spl4_10 ),
inference(trivial_inequality_removal,[],[f589]) ).
thf(f592,plain,
( ~ spl4_20
| spl4_5
| spl4_6
| spl4_10 ),
inference(avatar_split_clause,[],[f590,f239,f188,f183,f313]) ).
thf(f596,plain,
( ( ( breln1 @ sK1 @ sK0 )
= $false )
| ( $true = $false )
| spl4_20 ),
inference(superposition,[],[f34,f574]) ).
thf(f597,plain,
( ( ( breln1 @ sK1 @ sK0 )
= $false )
| spl4_20 ),
inference(trivial_inequality_removal,[],[f596]) ).
thf(f635,plain,
( ( $true = $false )
| spl4_20 ),
inference(superposition,[],[f597,f33]) ).
thf(f643,plain,
( $false
| spl4_20 ),
inference(trivial_inequality_removal,[],[f635]) ).
thf(f644,plain,
spl4_20,
inference(avatar_contradiction_clause,[],[f643]) ).
cnf(s7,plain,
( ~ spl4_10
| spl4_11 ),
inference(sat_conversion,[],[f246]) ).
cnf(s28,plain,
~ spl4_5,
inference(sat_conversion,[],[f451]) ).
cnf(s30,plain,
~ spl4_6,
inference(sat_conversion,[],[f503]) ).
cnf(s34,plain,
~ spl4_11,
inference(sat_conversion,[],[f547]) ).
cnf(s40,plain,
( spl4_5
| spl4_6
| spl4_10
| ~ spl4_20 ),
inference(sat_conversion,[],[f592]) ).
cnf(s46,plain,
spl4_20,
inference(sat_conversion,[],[f644]) ).
cnf(s47,plain,
( spl4_5
| spl4_6
| spl4_10 ),
inference(rat,[],[s40,s46]) ).
cnf(s48,plain,
spl4_10,
inference(rat,[],[s47,s30,s28]) ).
cnf(s58,plain,
$false,
inference(rat,[],[s7,s34,s48]) ).
thf(f645,plain,
$false,
inference(avatar_sat_refutation,[],[s58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU792^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:30:40 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.23 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.35 % (3238657)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.35 % (3238662)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1383032818:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.35 % (3238668)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.35 % (3238668)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.22/0.35 % (3238663)lrs+10_16_si=on:nwc=1.5:random_seed=1702744661:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.22/0.35 % (3238664)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=843708728:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.22/0.35 % (3238666)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2409136313:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.22/0.35 % (3238665)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=3471046029:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.22/0.35 % (3238667)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=151260500:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.22/0.35 % (3238668)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=2424499952:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.22/0.35 % (3238664)Instruction limit reached!
% 0.22/0.35 % (3238664)------------------------------
% 0.22/0.35 % (3238664)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.35 % (3238664)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.35 % (3238664)CaDiCaL version: 2.1.3
% 0.22/0.35 % (3238664)Termination reason: Instruction limit
% 0.22/0.35 % (3238664)Termination phase: Property scanning
% 0.22/0.35 % (3238664)Time elapsed: 0.002 s
% 0.22/0.35 % (3238664)Peak memory usage: 10 MB
% 0.22/0.35 % (3238664)Instructions burned: 4 (million)
% 0.22/0.35 % (3238663)Instruction limit reached!
% 0.22/0.35 % (3238663)------------------------------
% 0.22/0.35 % (3238663)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.35 % (3238663)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.35 % (3238663)CaDiCaL version: 2.1.3
% 0.22/0.35 % (3238663)Termination reason: Instruction limit
% 0.22/0.35 % (3238663)Termination phase: Saturation
% 0.22/0.35 % (3238663)Time elapsed: 0.009 s
% 0.22/0.35 % (3238663)Peak memory usage: 12 MB
% 0.22/0.35 % (3238663)Instructions burned: 18 (million)
% 0.22/0.35 % (3238666)Instruction limit reached!
% 0.22/0.35 % (3238666)------------------------------
% 0.22/0.35 % (3238666)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.35 % (3238666)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.35 % (3238666)CaDiCaL version: 2.1.3
% 0.22/0.35 % (3238666)Termination reason: Instruction limit
% 0.22/0.35 % (3238666)Termination phase: Saturation
% 0.22/0.35 % (3238666)Time elapsed: 0.013 s
% 0.22/0.35 % (3238666)Peak memory usage: 12 MB
% 0.22/0.35 % (3238666)Instructions burned: 24 (million)
% 0.22/0.35 % (3238662)Instruction limit reached!
% 0.22/0.35 % (3238662)------------------------------
% 0.22/0.35 % (3238662)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.35 % (3238662)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.35 % (3238662)CaDiCaL version: 2.1.3
% 0.22/0.35 % (3238662)Termination reason: Instruction limit
% 0.22/0.35 % (3238662)Termination phase: Saturation
% 0.22/0.35 % (3238662)Time elapsed: 0.023 s
% 0.22/0.35 % (3238662)Peak memory usage: 13 MB
% 0.22/0.35 % (3238662)Instructions burned: 90 (million)
% 0.22/0.35 % (3238676)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=2390588698:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.22/0.35 % (3238676)Instruction limit reached!
% 0.22/0.35 % (3238676)------------------------------
% 0.22/0.35 % (3238676)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (3238676)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (3238676)CaDiCaL version: 2.1.3
% 0.91/0.37 % (3238676)Termination reason: Instruction limit
% 0.91/0.37 % (3238676)Termination phase: Property scanning
% 0.91/0.37 % (3238676)Time elapsed: 0.002 s
% 0.91/0.37 % (3238676)Peak memory usage: 10 MB
% 0.91/0.37 % (3238676)Instructions burned: 4 (million)
% 0.91/0.37 % (3238679)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=2089675119:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.91/0.37 % (3238678)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.91/0.37 % (3238677)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=4125200179:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.91/0.37 % (3238679)Instruction limit reached!
% 0.91/0.37 % (3238679)------------------------------
% 0.91/0.37 % (3238679)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (3238679)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (3238679)CaDiCaL version: 2.1.3
% 0.91/0.37 % (3238679)Termination reason: Instruction limit
% 0.91/0.37 % (3238679)Termination phase: Saturation
% 0.91/0.37 % (3238679)Time elapsed: 0.004 s
% 0.91/0.37 % (3238679)Peak memory usage: 12 MB
% 0.91/0.37 % (3238679)Instructions burned: 15 (million)
% 0.91/0.37 % (3238677)Instruction limit reached!
% 0.91/0.37 % (3238677)------------------------------
% 0.91/0.37 % (3238677)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (3238677)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (3238677)CaDiCaL version: 2.1.3
% 0.91/0.37 % (3238677)Termination reason: Instruction limit
% 0.91/0.37 % (3238677)Termination phase: Saturation
% 0.91/0.37 % (3238677)Time elapsed: 0.003 s
% 0.91/0.37 % (3238677)Peak memory usage: 11 MB
% 0.91/0.37 % (3238677)Instructions burned: 6 (million)
% 0.91/0.37 % (3238678)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=39891228:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.91/0.37 % (3238678)Instruction limit reached!
% 0.91/0.37 % (3238678)------------------------------
% 0.91/0.37 % (3238678)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (3238678)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (3238678)CaDiCaL version: 2.1.3
% 0.91/0.37 % (3238678)Termination reason: Instruction limit
% 0.91/0.37 % (3238678)Termination phase: Saturation
% 0.91/0.37 % (3238678)Time elapsed: 0.004 s
% 0.91/0.37 % (3238678)Peak memory usage: 12 MB
% 0.91/0.37 % (3238678)Instructions burned: 8 (million)
% 0.91/0.37 % (3238681)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.91/0.37 % (3238681)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.91/0.37 % (3238667)Instruction limit reached!
% 0.91/0.37 % (3238667)------------------------------
% 0.91/0.37 % (3238667)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (3238667)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (3238667)CaDiCaL version: 2.1.3
% 0.91/0.37 % (3238667)Termination reason: Instruction limit
% 0.91/0.37 % (3238667)Termination phase: Saturation
% 0.91/0.37 % (3238667)Time elapsed: 0.037 s
% 0.91/0.37 % (3238667)Peak memory usage: 12 MB
% 0.91/0.37 % (3238667)Instructions burned: 75 (million)
% 0.91/0.37 % (3238684)lrs+1002_64_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:sp=occurrence:lma=off:plsqr=32,1:uwa=interpreted_only:random_seed=1424466476:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.91/0.37 % (3238681)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=806789015:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 0.91/0.37 % (3238686)lrs+10_1_si=on:cs=on:random_seed=735455488:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.91/0.37 % (3238687)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 0.91/0.37 % (3238686)Instruction limit reached!
% 0.91/0.37 % (3238686)------------------------------
% 0.91/0.37 % (3238686)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (3238686)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (3238686)CaDiCaL version: 2.1.3
% 0.91/0.37 % (3238686)Termination reason: Instruction limit
% 0.91/0.37 % (3238686)Termination phase: Saturation
% 0.91/0.37 % (3238686)Time elapsed: 0.004 s
% 0.91/0.37 % (3238686)Peak memory usage: 11 MB
% 0.91/0.37 % (3238686)Instructions burned: 9 (million)
% 0.91/0.37 % (3238687)ott+1002_20_sil=128000:cnfonf=lazy_not_gen_be_off:si=on:sp=unary_frequency:plsqr=1,32:bce=on:uwa=interpreted_only:foolp=on:random_seed=534426696:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.91/0.37 % (3238681)Instruction limit reached!
% 0.91/0.37 % (3238681)------------------------------
% 0.91/0.37 % (3238681)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (3238681)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (3238681)CaDiCaL version: 2.1.3
% 0.91/0.37 % (3238681)Termination reason: Instruction limit
% 0.91/0.37 % (3238681)Termination phase: Saturation
% 0.91/0.37 % (3238681)Time elapsed: 0.014 s
% 0.91/0.37 % (3238681)Peak memory usage: 12 MB
% 0.91/0.37 % (3238681)Instructions burned: 28 (million)
% 0.91/0.37 % (3238687)Instruction limit reached!
% 0.91/0.37 % (3238687)------------------------------
% 0.91/0.37 % (3238687)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (3238687)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (3238687)CaDiCaL version: 2.1.3
% 0.91/0.37 % (3238687)Termination reason: Instruction limit
% 0.91/0.37 % (3238687)Termination phase: Property scanning
% 0.91/0.37 % (3238687)Time elapsed: 0.001 s
% 0.91/0.37 % (3238687)Peak memory usage: 9 MB
% 0.91/0.37 % (3238687)Instructions burned: 2 (million)
% 0.91/0.37 % (3238688)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=2959270668:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/38Mi)
% 0.91/0.37 % (3238684)Instruction limit reached!
% 0.91/0.37 % (3238684)------------------------------
% 0.91/0.37 % (3238684)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (3238684)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (3238684)CaDiCaL version: 2.1.3
% 0.91/0.37 % (3238684)Termination reason: Instruction limit
% 0.91/0.37 % (3238684)Termination phase: Saturation
% 0.91/0.37 % (3238684)Time elapsed: 0.024 s
% 0.91/0.37 % (3238684)Peak memory usage: 12 MB
% 0.91/0.37 % (3238684)Instructions burned: 98 (million)
% 0.91/0.37 % (3238693)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=1907244795:st=2:i=249:sd=1:rtra=on:ss=axioms_2999 on theBenchmark for (2999ds/249Mi)
% 0.91/0.37 % (3238697)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=2848265937:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2999 on theBenchmark for (2999ds/327Mi)
% 0.91/0.37 % (3238696)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=1514921671:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2999 on theBenchmark for (2999ds/14Mi)
% 0.91/0.37 % (3238688)Instruction limit reached!
% 0.91/0.37 % (3238688)------------------------------
% 0.91/0.37 % (3238688)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (3238688)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (3238688)CaDiCaL version: 2.1.3
% 0.91/0.37 % (3238688)Termination reason: Instruction limit
% 0.91/0.37 % (3238688)Termination phase: Saturation
% 0.91/0.37 % (3238688)Time elapsed: 0.018 s
% 0.91/0.37 % (3238688)Peak memory usage: 12 MB
% 0.91/0.37 % (3238688)Instructions burned: 40 (million)
% 0.91/0.37 % (3238694)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=2710250431:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/25Mi)
% 0.91/0.37 % (3238668)Instruction limit reached!
% 0.91/0.37 % (3238668)------------------------------
% 0.91/0.37 % (3238668)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (3238668)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (3238668)CaDiCaL version: 2.1.3
% 0.91/0.37 % (3238668)Termination reason: Instruction limit
% 0.91/0.37 % (3238668)Termination phase: Saturation
% 0.91/0.37 % (3238668)Time elapsed: 0.078 s
% 0.91/0.37 % (3238668)Peak memory usage: 13 MB
% 0.91/0.37 % (3238668)Instructions burned: 157 (million)
% 0.91/0.37 % (3238696)Instruction limit reached!
% 0.91/0.37 % (3238696)------------------------------
% 0.91/0.37 % (3238696)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (3238696)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (3238696)CaDiCaL version: 2.1.3
% 0.91/0.37 % (3238696)Termination reason: Instruction limit
% 0.91/0.37 % (3238696)Termination phase: Saturation
% 0.91/0.37 % (3238696)Time elapsed: 0.011 s
% 0.91/0.37 % (3238696)Peak memory usage: 12 MB
% 0.91/0.37 % (3238696)Instructions burned: 21 (million)
% 0.91/0.37 % (3238694)Instruction limit reached!
% 0.91/0.37 % (3238694)------------------------------
% 0.91/0.37 % (3238694)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (3238694)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (3238694)CaDiCaL version: 2.1.3
% 0.91/0.37 % (3238694)Termination reason: Instruction limit
% 0.91/0.37 % (3238694)Termination phase: Saturation
% 0.91/0.37 % (3238694)Time elapsed: 0.015 s
% 0.91/0.37 % (3238694)Peak memory usage: 12 MB
% 0.91/0.37 % (3238694)Instructions burned: 26 (million)
% 0.91/0.37 % (3238697) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3238657-3238697"...
% 0.91/0.37 % (3238702)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=4106903428:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/14Mi)
% 0.91/0.37 % (3238697)...printing done.
% 0.91/0.37 % (3238697)Refutation found. Thanks to Tanya!
% 0.91/0.37 % SZS status Theorem for theBenchmark
% 0.91/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.91/0.37 % (3238697)------------------------------
% 0.91/0.37 % (3238697)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (3238697)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (3238697)CaDiCaL version: 2.1.3
% 0.91/0.37 % (3238697)Termination reason: Refutation
% 0.91/0.37 % (3238697)Time elapsed: 0.021 s
% 0.91/0.37 % (3238697)Peak memory usage: 13 MB
% 0.91/0.37 % (3238697)Instructions burned: 80 (million)
% 0.91/0.37 % (3238657)Success in time 0.128 s
% 0.91/0.37 % Vampire exiting
%------------------------------------------------------------------------------