%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET907^7 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:23:29 AM UTC 2026
% Result : Theorem 2.44s 0.64s
% Output : Refutation 2.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 38
% Number of leaves : 11
% Syntax : Number of formulae : 126 ( 85 unt; 0 typ; 0 def)
% Number of atoms : 1092 ( 201 equ; 0 cnn)
% Maximal formula atoms : 9 ( 8 avg)
% Number of connectives : 2308 ( 214 ~; 214 |; 0 &;1711 @)
% ( 0 <=>; 82 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 3 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 135 ( 135 >; 0 *; 0 +; 0 <<)
% Number of symbols : 65 ( 61 usr; 7 con; 0-4 aty)
% ( 87 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 423 ( 321 ^; 102 !; 0 ?; 423 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
mu: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
qmltpeq: mu > mu > $i > $o ).
thf(func_def_1,type,
meq_prop: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_3,type,
mnot: ( $i > $o ) > $i > $o ).
thf(func_def_4,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_5,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_6,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(func_def_7,type,
mtrue: $i > $o ).
thf(func_def_8,type,
mfalse: $i > $o ).
thf(func_def_9,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
mimplied: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_12,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_13,type,
mxor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_14,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_15,type,
exists_in_world: mu > $i > $o ).
thf(func_def_16,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(func_def_17,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(func_def_18,type,
mexists_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(func_def_19,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(func_def_20,type,
msymmetric: ( $i > $i > $o ) > $o ).
thf(func_def_21,type,
mserial: ( $i > $i > $o ) > $o ).
thf(func_def_22,type,
mtransitive: ( $i > $i > $o ) > $o ).
thf(func_def_23,type,
meuclidean: ( $i > $i > $o ) > $o ).
thf(func_def_24,type,
mpartially_functional: ( $i > $i > $o ) > $o ).
thf(func_def_25,type,
mfunctional: ( $i > $i > $o ) > $o ).
thf(func_def_26,type,
mweakly_dense: ( $i > $i > $o ) > $o ).
thf(func_def_27,type,
mweakly_connected: ( $i > $i > $o ) > $o ).
thf(func_def_28,type,
mweakly_directed: ( $i > $i > $o ) > $o ).
thf(func_def_29,type,
mvalid: ( $i > $o ) > $o ).
thf(func_def_30,type,
msatisfiable: ( $i > $o ) > $o ).
thf(func_def_31,type,
mcountersatisfiable: ( $i > $o ) > $o ).
thf(func_def_32,type,
minvalid: ( $i > $o ) > $o ).
thf(func_def_33,type,
rel_s4: $i > $i > $o ).
thf(func_def_34,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(func_def_35,type,
mdia_s4: ( $i > $o ) > $i > $o ).
thf(func_def_36,type,
empty: mu > $i > $o ).
thf(func_def_37,type,
subset: mu > mu > $i > $o ).
thf(func_def_38,type,
in: mu > mu > $i > $o ).
thf(func_def_39,type,
unordered_pair: mu > mu > mu ).
thf(func_def_40,type,
set_union2: mu > mu > mu ).
thf(func_def_41,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_42,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_43,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_44,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_45,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_48,type,
vOR: $o > $o > $o ).
thf(func_def_49,type,
vNOT: $o > $o ).
thf(func_def_50,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_51,type,
vIMP: $o > $o > $o ).
thf(func_def_52,type,
vAND: $o > $o > $o ).
thf(func_def_53,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_54,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_55,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_57,type,
sK1: mu ).
thf(func_def_58,type,
sK2: mu ).
thf(func_def_59,type,
sK3: mu ).
thf(func_def_60,type,
sK4: $i > mu ).
thf(func_def_61,type,
sK5: $i > mu ).
thf(func_def_62,type,
sK6: $i > mu ).
thf(f2,axiom,
( ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) )
= mnot ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mnot) ).
thf(f3,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= mor ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mor) ).
thf(f8,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o] : ( mnot @ ( mor @ ( mnot @ X0 ) @ ( mnot @ X1 ) ) ) )
= mand ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mand) ).
thf(f9,axiom,
( mimplies
= ( ^ [X0: $i > $o,X1: $i > $o] : ( mor @ ( mnot @ X0 ) @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mimplies) ).
thf(f11,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o] : ( mand @ ( mimplies @ X0 @ X1 ) @ ( mimplies @ X1 @ X0 ) ) )
= mequiv ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mequiv) ).
thf(f15,axiom,
( ( ^ [X0: mu > $i > $o,X1: $i] :
! [X2: mu] :
( ( exists_in_world @ X2 @ X1 )
=> ( X0 @ X2 @ X1 ) ) )
= mforall_ind ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mforall_ind) ).
thf(f28,axiom,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mvalid) ).
thf(f37,axiom,
! [X1: mu,X2: mu,X0: $i] : ( exists_in_world @ ( unordered_pair @ X1 @ X2 ) @ X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_unordered_pair_ax) ).
thf(f60,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X0: mu] :
( mforall_ind
@ ^ [X1: mu] : ( mimplies @ ( subset @ X0 @ X1 ) @ ( qmltpeq @ ( set_union2 @ X0 @ X1 ) @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).
thf(f61,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X0: mu] :
( mforall_ind
@ ^ [X1: mu] :
( mforall_ind
@ ^ [X2: mu] : ( mequiv @ ( subset @ ( unordered_pair @ X0 @ X1 ) @ X2 ) @ ( mand @ ( in @ X0 @ X2 ) @ ( in @ X1 @ X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
thf(f62,conjecture,
( mvalid
@ ( mforall_ind
@ ^ [X0: mu] :
( mforall_ind
@ ^ [X1: mu] :
( mforall_ind
@ ^ [X2: mu] : ( mimplies @ ( mand @ ( in @ X0 @ X1 ) @ ( in @ X2 @ X1 ) ) @ ( qmltpeq @ ( set_union2 @ ( unordered_pair @ X0 @ X2 ) @ X1 ) @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_zfmisc_1) ).
thf(f63,negated_conjecture,
~ ( mvalid
@ ( mforall_ind
@ ^ [X0: mu] :
( mforall_ind
@ ^ [X1: mu] :
( mforall_ind
@ ^ [X2: mu] : ( mimplies @ ( mand @ ( in @ X0 @ X1 ) @ ( in @ X2 @ X1 ) ) @ ( qmltpeq @ ( set_union2 @ ( unordered_pair @ X0 @ X2 ) @ X1 ) @ X1 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f62]) ).
thf(f70,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f77,plain,
~ ( mvalid
@ ( mforall_ind
@ ^ [X0: mu] :
( mforall_ind
@ ^ [X1: mu] :
( mforall_ind
@ ^ [X2: mu] : ( mimplies @ ( mand @ ( in @ X0 @ X1 ) @ ( in @ X2 @ X1 ) ) @ ( qmltpeq @ ( set_union2 @ ( unordered_pair @ X0 @ X2 ) @ X1 ) @ X1 ) ) ) ) ) ),
inference(rectify,[],[f63]) ).
thf(f78,plain,
( $true
= ( ~ ( mvalid
@ ( mforall_ind
@ ^ [Y0: mu] :
( mforall_ind
@ ^ [Y1: mu] :
( mforall_ind
@ ^ [Y2: mu] : ( mimplies @ ( mand @ ( in @ Y0 @ Y1 ) @ ( in @ Y2 @ Y1 ) ) @ ( qmltpeq @ ( set_union2 @ ( unordered_pair @ Y0 @ Y2 ) @ Y1 ) @ Y1 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f77]) ).
thf(f79,plain,
( mvalid
@ ( mforall_ind
@ ^ [X0: mu] :
( mforall_ind
@ ^ [X1: mu] :
( mforall_ind
@ ^ [X2: mu] : ( mequiv @ ( subset @ ( unordered_pair @ X0 @ X1 ) @ X2 ) @ ( mand @ ( in @ X0 @ X2 ) @ ( in @ X1 @ X2 ) ) ) ) ) ) ),
inference(rectify,[],[f61]) ).
thf(f80,plain,
( $true
= ( mvalid
@ ( mforall_ind
@ ^ [Y0: mu] :
( mforall_ind
@ ^ [Y1: mu] :
( mforall_ind
@ ^ [Y2: mu] : ( mequiv @ ( subset @ ( unordered_pair @ Y0 @ Y1 ) @ Y2 ) @ ( mand @ ( in @ Y0 @ Y2 ) @ ( in @ Y1 @ Y2 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f79]) ).
thf(f87,plain,
( mand
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mnot @ ( mor @ ( mnot @ Y0 ) @ ( mnot @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f102,plain,
( ( ^ [X0: mu > $i > $o,X1: $i] :
! [X2: mu] :
( ( exists_in_world @ X2 @ X1 )
=> ( X0 @ X2 @ X1 ) ) )
= mforall_ind ),
inference(rectify,[],[f15]) ).
thf(f103,plain,
( mforall_ind
= ( ^ [Y0: mu > $i > $o,Y1: $i] :
( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ Y1 )
=> ( Y0 @ Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f102]) ).
thf(f121,plain,
! [X0: mu,X1: mu,X2: $i] : ( exists_in_world @ ( unordered_pair @ X0 @ X1 ) @ X2 ),
inference(rectify,[],[f37]) ).
thf(f122,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
( !! @ mu
@ ^ [Y2: mu] : ( exists_in_world @ ( unordered_pair @ Y2 @ Y1 ) @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f121]) ).
thf(f125,plain,
( mvalid
@ ( mforall_ind
@ ^ [X0: mu] :
( mforall_ind
@ ^ [X1: mu] : ( mimplies @ ( subset @ X0 @ X1 ) @ ( qmltpeq @ ( set_union2 @ X0 @ X1 ) @ X1 ) ) ) ) ),
inference(rectify,[],[f60]) ).
thf(f126,plain,
( $true
= ( mvalid
@ ( mforall_ind
@ ^ [Y0: mu] :
( mforall_ind
@ ^ [Y1: mu] : ( mimplies @ ( subset @ Y0 @ Y1 ) @ ( qmltpeq @ ( set_union2 @ Y0 @ Y1 ) @ Y1 ) ) ) ) ) ),
inference(fool_elimination,[],[f125]) ).
thf(f148,plain,
( mequiv
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mand @ ( mimplies @ Y0 @ Y1 ) @ ( mimplies @ Y1 @ Y0 ) ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f151,plain,
( ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) )
= mnot ),
inference(rectify,[],[f2]) ).
thf(f152,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f151]) ).
thf(f159,plain,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
inference(rectify,[],[f28]) ).
thf(f160,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f159]) ).
thf(f172,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= mor ),
inference(rectify,[],[f3]) ).
thf(f173,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f172]) ).
thf(f181,plain,
( $true
= ( mvalid
@ ( mforall_ind
@ ^ [Y0: mu] :
( mforall_ind
@ ^ [Y1: mu] :
( mforall_ind
@ ^ [Y2: mu] : ( mequiv @ ( subset @ ( unordered_pair @ Y0 @ Y1 ) @ Y2 ) @ ( mand @ ( in @ Y0 @ Y2 ) @ ( in @ Y1 @ Y2 ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f80]) ).
thf(f184,plain,
( mforall_ind
= ( ^ [Y0: mu > $i > $o,Y1: $i] :
( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ Y1 )
=> ( Y0 @ Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f103]) ).
thf(f194,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f152]) ).
thf(f198,plain,
( $true
= ( ~ ( mvalid
@ ( mforall_ind
@ ^ [Y0: mu] :
( mforall_ind
@ ^ [Y1: mu] :
( mforall_ind
@ ^ [Y2: mu] : ( mimplies @ ( mand @ ( in @ Y0 @ Y1 ) @ ( in @ Y2 @ Y1 ) ) @ ( qmltpeq @ ( set_union2 @ ( unordered_pair @ Y0 @ Y2 ) @ Y1 ) @ Y1 ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f78]) ).
thf(f201,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(cnf_transformation,[],[f70]) ).
thf(f205,plain,
( mand
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mnot @ ( mor @ ( mnot @ Y0 ) @ ( mnot @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f87]) ).
thf(f209,plain,
( mequiv
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mand @ ( mimplies @ Y0 @ Y1 ) @ ( mimplies @ Y1 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f148]) ).
thf(f215,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f160]) ).
thf(f219,plain,
( $true
= ( mvalid
@ ( mforall_ind
@ ^ [Y0: mu] :
( mforall_ind
@ ^ [Y1: mu] : ( mimplies @ ( subset @ Y0 @ Y1 ) @ ( qmltpeq @ ( set_union2 @ Y0 @ Y1 ) @ Y1 ) ) ) ) ) ),
inference(cnf_transformation,[],[f126]) ).
thf(f225,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
( !! @ mu
@ ^ [Y2: mu] : ( exists_in_world @ ( unordered_pair @ Y2 @ Y1 ) @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f122]) ).
thf(f230,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f173]) ).
thf(f243,plain,
( mand
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y1 ) ) ) ) ),
inference(definition_unfolding,[],[f205,f194,f230,f194,f194]) ).
thf(f244,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 ) ) ),
inference(definition_unfolding,[],[f201,f230,f194]) ).
thf(f246,plain,
( mequiv
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o] :
( ^ [Y4: $i > $o,Y5: $i] :
~ ( Y4 @ Y5 )
@ ( ^ [Y4: $i > $o,Y5: $i > $o,Y6: $i] :
( ( Y4 @ Y6 )
| ( Y5 @ Y6 ) )
@ ( ^ [Y4: $i > $o,Y5: $i] :
~ ( Y4 @ Y5 )
@ Y2 )
@ ( ^ [Y4: $i > $o,Y5: $i] :
~ ( Y4 @ Y5 )
@ Y3 ) ) )
@ ( ^ [Y2: $i > $o,Y3: $i > $o] :
( ^ [Y4: $i > $o,Y5: $i > $o,Y6: $i] :
( ( Y4 @ Y6 )
| ( Y5 @ Y6 ) )
@ ( ^ [Y4: $i > $o,Y5: $i] :
~ ( Y4 @ Y5 )
@ Y2 )
@ Y3 )
@ Y0
@ Y1 )
@ ( ^ [Y2: $i > $o,Y3: $i > $o] :
( ^ [Y4: $i > $o,Y5: $i > $o,Y6: $i] :
( ( Y4 @ Y6 )
| ( Y5 @ Y6 ) )
@ ( ^ [Y4: $i > $o,Y5: $i] :
~ ( Y4 @ Y5 )
@ Y2 )
@ Y3 )
@ Y1
@ Y0 ) ) ) ),
inference(definition_unfolding,[],[f209,f243,f244,f244]) ).
thf(f254,plain,
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: mu > $i > $o,Y1: $i] :
( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ Y1 )
=> ( Y0 @ Y2 @ Y1 ) ) )
@ ^ [Y0: mu] :
( ^ [Y1: mu > $i > $o,Y2: $i] :
( !! @ mu
@ ^ [Y3: mu] :
( ( exists_in_world @ Y3 @ Y2 )
=> ( Y1 @ Y3 @ Y2 ) ) )
@ ^ [Y1: mu] :
( ^ [Y2: mu > $i > $o,Y3: $i] :
( !! @ mu
@ ^ [Y4: mu] :
( ( exists_in_world @ Y4 @ Y3 )
=> ( Y2 @ Y4 @ Y3 ) ) )
@ ^ [Y2: mu] :
( ^ [Y3: $i > $o,Y4: $i > $o] :
( ^ [Y5: $i > $o,Y6: $i > $o] :
( ^ [Y7: $i > $o,Y8: $i] :
~ ( Y7 @ Y8 )
@ ( ^ [Y7: $i > $o,Y8: $i > $o,Y9: $i] :
( ( Y7 @ Y9 )
| ( Y8 @ Y9 ) )
@ ( ^ [Y7: $i > $o,Y8: $i] :
~ ( Y7 @ Y8 )
@ Y5 )
@ ( ^ [Y7: $i > $o,Y8: $i] :
~ ( Y7 @ Y8 )
@ Y6 ) ) )
@ ( ^ [Y5: $i > $o,Y6: $i > $o] :
( ^ [Y7: $i > $o,Y8: $i > $o,Y9: $i] :
( ( Y7 @ Y9 )
| ( Y8 @ Y9 ) )
@ ( ^ [Y7: $i > $o,Y8: $i] :
~ ( Y7 @ Y8 )
@ Y5 )
@ Y6 )
@ Y3
@ Y4 )
@ ( ^ [Y5: $i > $o,Y6: $i > $o] :
( ^ [Y7: $i > $o,Y8: $i > $o,Y9: $i] :
( ( Y7 @ Y9 )
| ( Y8 @ Y9 ) )
@ ( ^ [Y7: $i > $o,Y8: $i] :
~ ( Y7 @ Y8 )
@ Y5 )
@ Y6 )
@ Y4
@ Y3 ) )
@ ( subset @ ( unordered_pair @ Y0 @ Y1 ) @ Y2 )
@ ( ^ [Y3: $i > $o,Y4: $i > $o] :
( ^ [Y5: $i > $o,Y6: $i] :
~ ( Y5 @ Y6 )
@ ( ^ [Y5: $i > $o,Y6: $i > $o,Y7: $i] :
( ( Y5 @ Y7 )
| ( Y6 @ Y7 ) )
@ ( ^ [Y5: $i > $o,Y6: $i] :
~ ( Y5 @ Y6 )
@ Y3 )
@ ( ^ [Y5: $i > $o,Y6: $i] :
~ ( Y5 @ Y6 )
@ Y4 ) ) )
@ ( in @ Y0 @ Y2 )
@ ( in @ Y1 @ Y2 ) ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f181,f215,f184,f184,f184,f246,f243]) ).
thf(f262,plain,
( $true
= ( ~ ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: mu > $i > $o,Y1: $i] :
( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ Y1 )
=> ( Y0 @ Y2 @ Y1 ) ) )
@ ^ [Y0: mu] :
( ^ [Y1: mu > $i > $o,Y2: $i] :
( !! @ mu
@ ^ [Y3: mu] :
( ( exists_in_world @ Y3 @ Y2 )
=> ( Y1 @ Y3 @ Y2 ) ) )
@ ^ [Y1: mu] :
( ^ [Y2: mu > $i > $o,Y3: $i] :
( !! @ mu
@ ^ [Y4: mu] :
( ( exists_in_world @ Y4 @ Y3 )
=> ( Y2 @ Y4 @ Y3 ) ) )
@ ^ [Y2: mu] :
( ^ [Y3: $i > $o,Y4: $i > $o] :
( ^ [Y5: $i > $o,Y6: $i > $o,Y7: $i] :
( ( Y5 @ Y7 )
| ( Y6 @ Y7 ) )
@ ( ^ [Y5: $i > $o,Y6: $i] :
~ ( Y5 @ Y6 )
@ Y3 )
@ Y4 )
@ ( ^ [Y3: $i > $o,Y4: $i > $o] :
( ^ [Y5: $i > $o,Y6: $i] :
~ ( Y5 @ Y6 )
@ ( ^ [Y5: $i > $o,Y6: $i > $o,Y7: $i] :
( ( Y5 @ Y7 )
| ( Y6 @ Y7 ) )
@ ( ^ [Y5: $i > $o,Y6: $i] :
~ ( Y5 @ Y6 )
@ Y3 )
@ ( ^ [Y5: $i > $o,Y6: $i] :
~ ( Y5 @ Y6 )
@ Y4 ) ) )
@ ( in @ Y0 @ Y1 )
@ ( in @ Y2 @ Y1 ) )
@ ( qmltpeq @ ( set_union2 @ ( unordered_pair @ Y0 @ Y2 ) @ Y1 ) @ Y1 ) ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f198,f215,f184,f184,f184,f244,f243]) ).
thf(f268,plain,
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: mu > $i > $o,Y1: $i] :
( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ Y1 )
=> ( Y0 @ Y2 @ Y1 ) ) )
@ ^ [Y0: mu] :
( ^ [Y1: mu > $i > $o,Y2: $i] :
( !! @ mu
@ ^ [Y3: mu] :
( ( exists_in_world @ Y3 @ Y2 )
=> ( Y1 @ Y3 @ Y2 ) ) )
@ ^ [Y1: mu] :
( ^ [Y2: $i > $o,Y3: $i > $o] :
( ^ [Y4: $i > $o,Y5: $i > $o,Y6: $i] :
( ( Y4 @ Y6 )
| ( Y5 @ Y6 ) )
@ ( ^ [Y4: $i > $o,Y5: $i] :
~ ( Y4 @ Y5 )
@ Y2 )
@ Y3 )
@ ( subset @ Y0 @ Y1 )
@ ( qmltpeq @ ( set_union2 @ Y0 @ Y1 ) @ Y1 ) ) ) ) ) ),
inference(definition_unfolding,[],[f219,f215,f184,f184,f244]) ).
thf(f279,plain,
( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ Y0 )
=> ( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ Y0 )
=> ( !! @ mu
@ ^ [Y3: mu] :
( ( exists_in_world @ Y3 @ Y0 )
=> ( ~ ~ ( ~ ( in @ Y1 @ Y2 @ Y0 )
| ~ ( in @ Y3 @ Y2 @ Y0 ) )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ Y1 @ Y3 ) @ Y2 ) @ Y2 @ Y0 ) ) ) ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f262]) ).
thf(f280,plain,
( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ Y0 )
=> ( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ Y0 )
=> ( !! @ mu
@ ^ [Y3: mu] :
( ( exists_in_world @ Y3 @ Y0 )
=> ( ~ ( in @ Y1 @ Y2 @ Y0 )
| ~ ( in @ Y3 @ Y2 @ Y0 )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ Y1 @ Y3 ) @ Y2 ) @ Y2 @ Y0 ) ) ) ) ) ) ) ) ) ) ),
inference(boolean_simplification,[],[f279]) ).
thf(f306,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ Y0 )
=> ( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ Y0 )
=> ( !! @ mu
@ ^ [Y3: mu] :
( ( exists_in_world @ Y3 @ Y0 )
=> ~ ( ~ ( ~ ( subset @ ( unordered_pair @ Y1 @ Y2 ) @ Y3 @ Y0 )
| ~ ( ~ ( in @ Y1 @ Y3 @ Y0 )
| ~ ( in @ Y2 @ Y3 @ Y0 ) ) )
| ~ ( ~ ~ ( ~ ( in @ Y1 @ Y3 @ Y0 )
| ~ ( in @ Y2 @ Y3 @ Y0 ) )
| ( subset @ ( unordered_pair @ Y1 @ Y2 ) @ Y3 @ Y0 ) ) ) ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f254]) ).
thf(f307,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ Y0 )
=> ( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ Y0 )
=> ( !! @ mu
@ ^ [Y3: mu] :
( ( exists_in_world @ Y3 @ Y0 )
=> ~ ( ~ ( ~ ( subset @ ( unordered_pair @ Y1 @ Y2 ) @ Y3 @ Y0 )
| ~ ( ~ ( in @ Y1 @ Y3 @ Y0 )
| ~ ( in @ Y2 @ Y3 @ Y0 ) ) )
| ~ ( ~ ( in @ Y1 @ Y3 @ Y0 )
| ~ ( in @ Y2 @ Y3 @ Y0 )
| ( subset @ ( unordered_pair @ Y1 @ Y2 ) @ Y3 @ Y0 ) ) ) ) ) ) ) ) ) ) ),
inference(boolean_simplification,[],[f306]) ).
thf(f313,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ Y0 )
=> ( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ Y0 )
=> ( ~ ( subset @ Y1 @ Y2 @ Y0 )
| ( qmltpeq @ ( set_union2 @ Y1 @ Y2 ) @ Y2 @ Y0 ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f268]) ).
thf(f315,plain,
( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ Y0 )
=> ( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ Y0 )
=> ( !! @ mu
@ ^ [Y3: mu] :
( ( exists_in_world @ Y3 @ Y0 )
=> ( ~ ( in @ Y1 @ Y2 @ Y0 )
| ~ ( in @ Y3 @ Y2 @ Y0 )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ Y1 @ Y3 ) @ Y2 ) @ Y2 @ Y0 ) ) ) ) ) ) ) ) ) ),
inference(not_proxy_clausification,[],[f280]) ).
thf(f316,plain,
( $false
= ( ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ Y0 )
=> ( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ Y0 )
=> ( !! @ mu
@ ^ [Y3: mu] :
( ( exists_in_world @ Y3 @ Y0 )
=> ( ~ ( in @ Y1 @ Y2 @ Y0 )
| ~ ( in @ Y3 @ Y2 @ Y0 )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ Y1 @ Y3 ) @ Y2 ) @ Y2 @ Y0 ) ) ) ) ) ) ) )
@ sK0 ) ),
inference(sigma_proxy_clausification,[],[f315]) ).
thf(f317,plain,
( ( !! @ mu
@ ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ sK0 )
=> ( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ sK0 )
=> ( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ sK0 )
=> ( ~ ( in @ Y0 @ Y1 @ sK0 )
| ~ ( in @ Y2 @ Y1 @ sK0 )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ Y0 @ Y2 ) @ Y1 ) @ Y1 @ sK0 ) ) ) ) ) ) ) )
= $false ),
inference(beta-eta_normalization,[],[f316]) ).
thf(f318,plain,
( $false
= ( ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ sK0 )
=> ( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ sK0 )
=> ( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ sK0 )
=> ( ~ ( in @ Y0 @ Y1 @ sK0 )
| ~ ( in @ Y2 @ Y1 @ sK0 )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ Y0 @ Y2 ) @ Y1 ) @ Y1 @ sK0 ) ) ) ) ) ) )
@ sK1 ) ),
inference(sigma_proxy_clausification,[],[f317]) ).
thf(f319,plain,
( ( ( exists_in_world @ sK1 @ sK0 )
=> ( !! @ mu
@ ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ sK0 )
=> ( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ sK0 )
=> ( ~ ( in @ sK1 @ Y0 @ sK0 )
| ~ ( in @ Y1 @ Y0 @ sK0 )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ sK1 @ Y1 ) @ Y0 ) @ Y0 @ sK0 ) ) ) ) ) ) )
= $false ),
inference(beta-eta_normalization,[],[f318]) ).
thf(f320,plain,
( ( !! @ mu
@ ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ sK0 )
=> ( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ sK0 )
=> ( ~ ( in @ sK1 @ Y0 @ sK0 )
| ~ ( in @ Y1 @ Y0 @ sK0 )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ sK1 @ Y1 ) @ Y0 ) @ Y0 @ sK0 ) ) ) ) ) )
= $false ),
inference(imp_proxy_clausification,[],[f319]) ).
thf(f321,plain,
( $true
= ( exists_in_world @ sK1 @ sK0 ) ),
inference(imp_proxy_clausification,[],[f319]) ).
thf(f322,plain,
( ( ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ sK0 )
=> ( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ sK0 )
=> ( ~ ( in @ sK1 @ Y0 @ sK0 )
| ~ ( in @ Y1 @ Y0 @ sK0 )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ sK1 @ Y1 ) @ Y0 ) @ Y0 @ sK0 ) ) ) ) )
@ sK2 )
= $false ),
inference(sigma_proxy_clausification,[],[f320]) ).
thf(f323,plain,
( ( ( exists_in_world @ sK2 @ sK0 )
=> ( !! @ mu
@ ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ sK0 )
=> ( ~ ( in @ sK1 @ sK2 @ sK0 )
| ~ ( in @ Y0 @ sK2 @ sK0 )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ sK1 @ Y0 ) @ sK2 ) @ sK2 @ sK0 ) ) ) ) )
= $false ),
inference(beta-eta_normalization,[],[f322]) ).
thf(f324,plain,
( $false
= ( !! @ mu
@ ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ sK0 )
=> ( ~ ( in @ sK1 @ sK2 @ sK0 )
| ~ ( in @ Y0 @ sK2 @ sK0 )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ sK1 @ Y0 ) @ sK2 ) @ sK2 @ sK0 ) ) ) ) ),
inference(imp_proxy_clausification,[],[f323]) ).
thf(f325,plain,
( $true
= ( exists_in_world @ sK2 @ sK0 ) ),
inference(imp_proxy_clausification,[],[f323]) ).
thf(f341,plain,
( $false
= ( ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ sK0 )
=> ( ~ ( in @ sK1 @ sK2 @ sK0 )
| ~ ( in @ Y0 @ sK2 @ sK0 )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ sK1 @ Y0 ) @ sK2 ) @ sK2 @ sK0 ) ) )
@ sK3 ) ),
inference(sigma_proxy_clausification,[],[f324]) ).
thf(f344,plain,
( $false
= ( ( exists_in_world @ sK3 @ sK0 )
=> ( ~ ( in @ sK1 @ sK2 @ sK0 )
| ~ ( in @ sK3 @ sK2 @ sK0 )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ sK1 @ sK3 ) @ sK2 ) @ sK2 @ sK0 ) ) ) ),
inference(beta-eta_normalization,[],[f341]) ).
thf(f345,plain,
( $false
= ( ~ ( in @ sK1 @ sK2 @ sK0 )
| ~ ( in @ sK3 @ sK2 @ sK0 )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ sK1 @ sK3 ) @ sK2 ) @ sK2 @ sK0 ) ) ),
inference(imp_proxy_clausification,[],[f344]) ).
thf(f346,plain,
( ( exists_in_world @ sK3 @ sK0 )
= $true ),
inference(imp_proxy_clausification,[],[f344]) ).
thf(f347,plain,
( ( qmltpeq @ ( set_union2 @ ( unordered_pair @ sK1 @ sK3 ) @ sK2 ) @ sK2 @ sK0 )
= $false ),
inference(or_proxy_clausification,[],[f345]) ).
thf(f348,plain,
( ( ~ ( in @ sK1 @ sK2 @ sK0 )
| ~ ( in @ sK3 @ sK2 @ sK0 ) )
= $false ),
inference(or_proxy_clausification,[],[f345]) ).
thf(f349,plain,
( ( ~ ( in @ sK3 @ sK2 @ sK0 ) )
= $false ),
inference(or_proxy_clausification,[],[f348]) ).
thf(f350,plain,
( $false
= ( ~ ( in @ sK1 @ sK2 @ sK0 ) ) ),
inference(or_proxy_clausification,[],[f348]) ).
thf(f351,plain,
( $true
= ( in @ sK1 @ sK2 @ sK0 ) ),
inference(not_proxy_clausification,[],[f350]) ).
thf(f352,plain,
( $true
= ( in @ sK3 @ sK2 @ sK0 ) ),
inference(not_proxy_clausification,[],[f349]) ).
thf(f365,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
( !! @ mu
@ ^ [Y2: mu] : ( exists_in_world @ ( unordered_pair @ Y2 @ Y1 ) @ Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f225]) ).
thf(f366,plain,
! [X1: $i] :
( $true
= ( !! @ mu
@ ^ [Y0: mu] :
( !! @ mu
@ ^ [Y1: mu] : ( exists_in_world @ ( unordered_pair @ Y1 @ Y0 ) @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f365]) ).
thf(f367,plain,
! [X2: mu,X1: $i] :
( $true
= ( ^ [Y0: mu] :
( !! @ mu
@ ^ [Y1: mu] : ( exists_in_world @ ( unordered_pair @ Y1 @ Y0 ) @ X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f366]) ).
thf(f368,plain,
! [X2: mu,X1: $i] :
( $true
= ( !! @ mu
@ ^ [Y0: mu] : ( exists_in_world @ ( unordered_pair @ Y0 @ X2 ) @ X1 ) ) ),
inference(beta-eta_normalization,[],[f367]) ).
thf(f369,plain,
! [X2: mu,X3: mu,X1: $i] :
( $true
= ( ^ [Y0: mu] : ( exists_in_world @ ( unordered_pair @ Y0 @ X2 ) @ X1 )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f368]) ).
thf(f370,plain,
! [X2: mu,X3: mu,X1: $i] :
( $true
= ( exists_in_world @ ( unordered_pair @ X3 @ X2 ) @ X1 ) ),
inference(beta-eta_normalization,[],[f369]) ).
thf(f544,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ Y0 )
=> ( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ Y0 )
=> ( ~ ( subset @ Y1 @ Y2 @ Y0 )
| ( qmltpeq @ ( set_union2 @ Y1 @ Y2 ) @ Y2 @ Y0 ) ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f313]) ).
thf(f545,plain,
! [X1: $i] :
( $true
= ( !! @ mu
@ ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ X1 )
=> ( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ X1 )
=> ( ~ ( subset @ Y0 @ Y1 @ X1 )
| ( qmltpeq @ ( set_union2 @ Y0 @ Y1 ) @ Y1 @ X1 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f544]) ).
thf(f548,plain,
! [X2: mu,X1: $i] :
( $true
= ( ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ X1 )
=> ( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ X1 )
=> ( ~ ( subset @ Y0 @ Y1 @ X1 )
| ( qmltpeq @ ( set_union2 @ Y0 @ Y1 ) @ Y1 @ X1 ) ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f545]) ).
thf(f549,plain,
! [X2: mu,X1: $i] :
( $true
= ( ( exists_in_world @ X2 @ X1 )
=> ( !! @ mu
@ ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ X1 )
=> ( ~ ( subset @ X2 @ Y0 @ X1 )
| ( qmltpeq @ ( set_union2 @ X2 @ Y0 ) @ Y0 @ X1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f548]) ).
thf(f550,plain,
! [X2: mu,X1: $i] :
( ( ( !! @ mu
@ ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ X1 )
=> ( ~ ( subset @ X2 @ Y0 @ X1 )
| ( qmltpeq @ ( set_union2 @ X2 @ Y0 ) @ Y0 @ X1 ) ) ) )
= $true )
| ( ( exists_in_world @ X2 @ X1 )
= $false ) ),
inference(imp_proxy_clausification,[],[f549]) ).
thf(f551,plain,
! [X2: mu,X3: mu,X1: $i] :
( ( ( exists_in_world @ X2 @ X1 )
= $false )
| ( ( ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ X1 )
=> ( ~ ( subset @ X2 @ Y0 @ X1 )
| ( qmltpeq @ ( set_union2 @ X2 @ Y0 ) @ Y0 @ X1 ) ) )
@ X3 )
= $true ) ),
inference(pi_proxy_clausification,[],[f550]) ).
thf(f552,plain,
! [X2: mu,X3: mu,X1: $i] :
( ( ( exists_in_world @ X2 @ X1 )
= $false )
| ( $true
= ( ( exists_in_world @ X3 @ X1 )
=> ( ~ ( subset @ X2 @ X3 @ X1 )
| ( qmltpeq @ ( set_union2 @ X2 @ X3 ) @ X3 @ X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f551]) ).
thf(f553,plain,
! [X2: mu,X3: mu,X1: $i] :
( ( ( exists_in_world @ X2 @ X1 )
= $false )
| ( $true
= ( ~ ( subset @ X2 @ X3 @ X1 )
| ( qmltpeq @ ( set_union2 @ X2 @ X3 ) @ X3 @ X1 ) ) )
| ( ( exists_in_world @ X3 @ X1 )
= $false ) ),
inference(imp_proxy_clausification,[],[f552]) ).
thf(f554,plain,
! [X2: mu,X3: mu,X1: $i] :
( ( ( qmltpeq @ ( set_union2 @ X2 @ X3 ) @ X3 @ X1 )
= $true )
| ( $true
= ( ~ ( subset @ X2 @ X3 @ X1 ) ) )
| ( ( exists_in_world @ X3 @ X1 )
= $false )
| ( ( exists_in_world @ X2 @ X1 )
= $false ) ),
inference(or_proxy_clausification,[],[f553]) ).
thf(f555,plain,
! [X2: mu,X3: mu,X1: $i] :
( ( ( qmltpeq @ ( set_union2 @ X2 @ X3 ) @ X3 @ X1 )
= $true )
| ( ( subset @ X2 @ X3 @ X1 )
= $false )
| ( ( exists_in_world @ X3 @ X1 )
= $false )
| ( ( exists_in_world @ X2 @ X1 )
= $false ) ),
inference(not_proxy_clausification,[],[f554]) ).
thf(f558,plain,
( ( $true = $false )
| ( $false
= ( exists_in_world @ sK2 @ sK0 ) )
| ( ( exists_in_world @ ( unordered_pair @ sK1 @ sK3 ) @ sK0 )
= $false )
| ( $false
= ( subset @ ( unordered_pair @ sK1 @ sK3 ) @ sK2 @ sK0 ) ) ),
inference(superposition,[],[f555,f347]) ).
thf(f560,plain,
( ( $false
= ( exists_in_world @ sK2 @ sK0 ) )
| ( ( exists_in_world @ ( unordered_pair @ sK1 @ sK3 ) @ sK0 )
= $false )
| ( $false
= ( subset @ ( unordered_pair @ sK1 @ sK3 ) @ sK2 @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f558]) ).
thf(f562,plain,
( ( ( exists_in_world @ ( unordered_pair @ sK1 @ sK3 ) @ sK0 )
= $false )
| ( $true = $false )
| ( $false
= ( subset @ ( unordered_pair @ sK1 @ sK3 ) @ sK2 @ sK0 ) ) ),
inference(forward_demodulation,[],[f560,f325]) ).
thf(f563,plain,
( ( ( exists_in_world @ ( unordered_pair @ sK1 @ sK3 ) @ sK0 )
= $false )
| ( $false
= ( subset @ ( unordered_pair @ sK1 @ sK3 ) @ sK2 @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f562]) ).
thf(f566,plain,
( ( $true = $false )
| ( $false
= ( subset @ ( unordered_pair @ sK1 @ sK3 ) @ sK2 @ sK0 ) ) ),
inference(forward_demodulation,[],[f563,f370]) ).
thf(f567,plain,
( $false
= ( subset @ ( unordered_pair @ sK1 @ sK3 ) @ sK2 @ sK0 ) ),
inference(trivial_inequality_removal,[],[f566]) ).
thf(f2154,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ Y0 )
=> ( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ Y0 )
=> ( !! @ mu
@ ^ [Y3: mu] :
( ( exists_in_world @ Y3 @ Y0 )
=> ~ ( ~ ( ~ ( subset @ ( unordered_pair @ Y1 @ Y2 ) @ Y3 @ Y0 )
| ~ ( ~ ( in @ Y1 @ Y3 @ Y0 )
| ~ ( in @ Y2 @ Y3 @ Y0 ) ) )
| ~ ( ~ ( in @ Y1 @ Y3 @ Y0 )
| ~ ( in @ Y2 @ Y3 @ Y0 )
| ( subset @ ( unordered_pair @ Y1 @ Y2 ) @ Y3 @ Y0 ) ) ) ) ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f307]) ).
thf(f2155,plain,
! [X1: $i] :
( $true
= ( !! @ mu
@ ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ X1 )
=> ( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ X1 )
=> ( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ X1 )
=> ~ ( ~ ( ~ ( subset @ ( unordered_pair @ Y0 @ Y1 ) @ Y2 @ X1 )
| ~ ( ~ ( in @ Y0 @ Y2 @ X1 )
| ~ ( in @ Y1 @ Y2 @ X1 ) ) )
| ~ ( ~ ( in @ Y0 @ Y2 @ X1 )
| ~ ( in @ Y1 @ Y2 @ X1 )
| ( subset @ ( unordered_pair @ Y0 @ Y1 ) @ Y2 @ X1 ) ) ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f2154]) ).
thf(f2243,plain,
! [X2: mu,X1: $i] :
( $true
= ( ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ X1 )
=> ( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ X1 )
=> ( !! @ mu
@ ^ [Y2: mu] :
( ( exists_in_world @ Y2 @ X1 )
=> ~ ( ~ ( ~ ( subset @ ( unordered_pair @ Y0 @ Y1 ) @ Y2 @ X1 )
| ~ ( ~ ( in @ Y0 @ Y2 @ X1 )
| ~ ( in @ Y1 @ Y2 @ X1 ) ) )
| ~ ( ~ ( in @ Y0 @ Y2 @ X1 )
| ~ ( in @ Y1 @ Y2 @ X1 )
| ( subset @ ( unordered_pair @ Y0 @ Y1 ) @ Y2 @ X1 ) ) ) ) ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f2155]) ).
thf(f2244,plain,
! [X2: mu,X1: $i] :
( $true
= ( ( exists_in_world @ X2 @ X1 )
=> ( !! @ mu
@ ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ X1 )
=> ( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ X1 )
=> ~ ( ~ ( ~ ( subset @ ( unordered_pair @ X2 @ Y0 ) @ Y1 @ X1 )
| ~ ( ~ ( in @ X2 @ Y1 @ X1 )
| ~ ( in @ Y0 @ Y1 @ X1 ) ) )
| ~ ( ~ ( in @ X2 @ Y1 @ X1 )
| ~ ( in @ Y0 @ Y1 @ X1 )
| ( subset @ ( unordered_pair @ X2 @ Y0 ) @ Y1 @ X1 ) ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f2243]) ).
thf(f2245,plain,
! [X2: mu,X1: $i] :
( ( $true
= ( !! @ mu
@ ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ X1 )
=> ( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ X1 )
=> ~ ( ~ ( ~ ( subset @ ( unordered_pair @ X2 @ Y0 ) @ Y1 @ X1 )
| ~ ( ~ ( in @ X2 @ Y1 @ X1 )
| ~ ( in @ Y0 @ Y1 @ X1 ) ) )
| ~ ( ~ ( in @ X2 @ Y1 @ X1 )
| ~ ( in @ Y0 @ Y1 @ X1 )
| ( subset @ ( unordered_pair @ X2 @ Y0 ) @ Y1 @ X1 ) ) ) ) ) ) ) )
| ( ( exists_in_world @ X2 @ X1 )
= $false ) ),
inference(imp_proxy_clausification,[],[f2244]) ).
thf(f2304,plain,
! [X2: mu,X3: mu,X1: $i] :
( ( ( exists_in_world @ X2 @ X1 )
= $false )
| ( ( ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ X1 )
=> ( !! @ mu
@ ^ [Y1: mu] :
( ( exists_in_world @ Y1 @ X1 )
=> ~ ( ~ ( ~ ( subset @ ( unordered_pair @ X2 @ Y0 ) @ Y1 @ X1 )
| ~ ( ~ ( in @ X2 @ Y1 @ X1 )
| ~ ( in @ Y0 @ Y1 @ X1 ) ) )
| ~ ( ~ ( in @ X2 @ Y1 @ X1 )
| ~ ( in @ Y0 @ Y1 @ X1 )
| ( subset @ ( unordered_pair @ X2 @ Y0 ) @ Y1 @ X1 ) ) ) ) ) )
@ X3 )
= $true ) ),
inference(pi_proxy_clausification,[],[f2245]) ).
thf(f2305,plain,
! [X2: mu,X3: mu,X1: $i] :
( ( ( exists_in_world @ X2 @ X1 )
= $false )
| ( ( ( exists_in_world @ X3 @ X1 )
=> ( !! @ mu
@ ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ X1 )
=> ~ ( ~ ( ~ ( subset @ ( unordered_pair @ X2 @ X3 ) @ Y0 @ X1 )
| ~ ( ~ ( in @ X2 @ Y0 @ X1 )
| ~ ( in @ X3 @ Y0 @ X1 ) ) )
| ~ ( ~ ( in @ X2 @ Y0 @ X1 )
| ~ ( in @ X3 @ Y0 @ X1 )
| ( subset @ ( unordered_pair @ X2 @ X3 ) @ Y0 @ X1 ) ) ) ) ) )
= $true ) ),
inference(beta-eta_normalization,[],[f2304]) ).
thf(f2306,plain,
! [X2: mu,X3: mu,X1: $i] :
( ( $true
= ( !! @ mu
@ ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ X1 )
=> ~ ( ~ ( ~ ( subset @ ( unordered_pair @ X2 @ X3 ) @ Y0 @ X1 )
| ~ ( ~ ( in @ X2 @ Y0 @ X1 )
| ~ ( in @ X3 @ Y0 @ X1 ) ) )
| ~ ( ~ ( in @ X2 @ Y0 @ X1 )
| ~ ( in @ X3 @ Y0 @ X1 )
| ( subset @ ( unordered_pair @ X2 @ X3 ) @ Y0 @ X1 ) ) ) ) ) )
| ( ( exists_in_world @ X2 @ X1 )
= $false )
| ( ( exists_in_world @ X3 @ X1 )
= $false ) ),
inference(imp_proxy_clausification,[],[f2305]) ).
thf(f2355,plain,
! [X2: mu,X3: mu,X1: $i,X4: mu] :
( ( ( exists_in_world @ X2 @ X1 )
= $false )
| ( $true
= ( ^ [Y0: mu] :
( ( exists_in_world @ Y0 @ X1 )
=> ~ ( ~ ( ~ ( subset @ ( unordered_pair @ X2 @ X3 ) @ Y0 @ X1 )
| ~ ( ~ ( in @ X2 @ Y0 @ X1 )
| ~ ( in @ X3 @ Y0 @ X1 ) ) )
| ~ ( ~ ( in @ X2 @ Y0 @ X1 )
| ~ ( in @ X3 @ Y0 @ X1 )
| ( subset @ ( unordered_pair @ X2 @ X3 ) @ Y0 @ X1 ) ) ) )
@ X4 ) )
| ( ( exists_in_world @ X3 @ X1 )
= $false ) ),
inference(pi_proxy_clausification,[],[f2306]) ).
thf(f2356,plain,
! [X2: mu,X3: mu,X1: $i,X4: mu] :
( ( ( exists_in_world @ X3 @ X1 )
= $false )
| ( $true
= ( ( exists_in_world @ X4 @ X1 )
=> ~ ( ~ ( ~ ( subset @ ( unordered_pair @ X2 @ X3 ) @ X4 @ X1 )
| ~ ( ~ ( in @ X2 @ X4 @ X1 )
| ~ ( in @ X3 @ X4 @ X1 ) ) )
| ~ ( ~ ( in @ X2 @ X4 @ X1 )
| ~ ( in @ X3 @ X4 @ X1 )
| ( subset @ ( unordered_pair @ X2 @ X3 ) @ X4 @ X1 ) ) ) ) )
| ( ( exists_in_world @ X2 @ X1 )
= $false ) ),
inference(beta-eta_normalization,[],[f2355]) ).
thf(f2357,plain,
! [X2: mu,X3: mu,X1: $i,X4: mu] :
( ( ( exists_in_world @ X4 @ X1 )
= $false )
| ( $true
= ( ~ ( ~ ( ~ ( subset @ ( unordered_pair @ X2 @ X3 ) @ X4 @ X1 )
| ~ ( ~ ( in @ X2 @ X4 @ X1 )
| ~ ( in @ X3 @ X4 @ X1 ) ) )
| ~ ( ~ ( in @ X2 @ X4 @ X1 )
| ~ ( in @ X3 @ X4 @ X1 )
| ( subset @ ( unordered_pair @ X2 @ X3 ) @ X4 @ X1 ) ) ) ) )
| ( ( exists_in_world @ X2 @ X1 )
= $false )
| ( ( exists_in_world @ X3 @ X1 )
= $false ) ),
inference(imp_proxy_clausification,[],[f2356]) ).
thf(f2358,plain,
! [X2: mu,X3: mu,X1: $i,X4: mu] :
( ( ( exists_in_world @ X3 @ X1 )
= $false )
| ( $false
= ( ~ ( ~ ( subset @ ( unordered_pair @ X2 @ X3 ) @ X4 @ X1 )
| ~ ( ~ ( in @ X2 @ X4 @ X1 )
| ~ ( in @ X3 @ X4 @ X1 ) ) )
| ~ ( ~ ( in @ X2 @ X4 @ X1 )
| ~ ( in @ X3 @ X4 @ X1 )
| ( subset @ ( unordered_pair @ X2 @ X3 ) @ X4 @ X1 ) ) ) )
| ( ( exists_in_world @ X4 @ X1 )
= $false )
| ( ( exists_in_world @ X2 @ X1 )
= $false ) ),
inference(not_proxy_clausification,[],[f2357]) ).
thf(f2359,plain,
! [X2: mu,X3: mu,X1: $i,X4: mu] :
( ( ( exists_in_world @ X2 @ X1 )
= $false )
| ( $false
= ( ~ ( ~ ( in @ X2 @ X4 @ X1 )
| ~ ( in @ X3 @ X4 @ X1 )
| ( subset @ ( unordered_pair @ X2 @ X3 ) @ X4 @ X1 ) ) ) )
| ( ( exists_in_world @ X3 @ X1 )
= $false )
| ( ( exists_in_world @ X4 @ X1 )
= $false ) ),
inference(or_proxy_clausification,[],[f2358]) ).
thf(f2361,plain,
! [X2: mu,X3: mu,X1: $i,X4: mu] :
( ( ( exists_in_world @ X3 @ X1 )
= $false )
| ( ( exists_in_world @ X4 @ X1 )
= $false )
| ( ( exists_in_world @ X2 @ X1 )
= $false )
| ( $true
= ( ~ ( in @ X2 @ X4 @ X1 )
| ~ ( in @ X3 @ X4 @ X1 )
| ( subset @ ( unordered_pair @ X2 @ X3 ) @ X4 @ X1 ) ) ) ),
inference(not_proxy_clausification,[],[f2359]) ).
thf(f2363,plain,
! [X2: mu,X3: mu,X1: $i,X4: mu] :
( ( $true
= ( ~ ( in @ X2 @ X4 @ X1 )
| ~ ( in @ X3 @ X4 @ X1 ) ) )
| ( ( exists_in_world @ X4 @ X1 )
= $false )
| ( ( exists_in_world @ X3 @ X1 )
= $false )
| ( ( subset @ ( unordered_pair @ X2 @ X3 ) @ X4 @ X1 )
= $true )
| ( ( exists_in_world @ X2 @ X1 )
= $false ) ),
inference(or_proxy_clausification,[],[f2361]) ).
thf(f2365,plain,
! [X2: mu,X3: mu,X1: $i,X4: mu] :
( ( $true
= ( ~ ( in @ X2 @ X4 @ X1 ) ) )
| ( ( exists_in_world @ X4 @ X1 )
= $false )
| ( ( exists_in_world @ X2 @ X1 )
= $false )
| ( ( exists_in_world @ X3 @ X1 )
= $false )
| ( ( subset @ ( unordered_pair @ X2 @ X3 ) @ X4 @ X1 )
= $true )
| ( $true
= ( ~ ( in @ X3 @ X4 @ X1 ) ) ) ),
inference(or_proxy_clausification,[],[f2363]) ).
thf(f2367,plain,
! [X2: mu,X3: mu,X1: $i,X4: mu] :
( ( ( subset @ ( unordered_pair @ X2 @ X3 ) @ X4 @ X1 )
= $true )
| ( ( exists_in_world @ X3 @ X1 )
= $false )
| ( ( exists_in_world @ X4 @ X1 )
= $false )
| ( $true
= ( ~ ( in @ X3 @ X4 @ X1 ) ) )
| ( ( exists_in_world @ X2 @ X1 )
= $false )
| ( $false
= ( in @ X2 @ X4 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f2365]) ).
thf(f2369,plain,
! [X2: mu,X3: mu,X1: $i,X4: mu] :
( ( ( subset @ ( unordered_pair @ X2 @ X3 ) @ X4 @ X1 )
= $true )
| ( ( exists_in_world @ X2 @ X1 )
= $false )
| ( ( exists_in_world @ X4 @ X1 )
= $false )
| ( $false
= ( in @ X2 @ X4 @ X1 ) )
| ( $false
= ( in @ X3 @ X4 @ X1 ) )
| ( ( exists_in_world @ X3 @ X1 )
= $false ) ),
inference(not_proxy_clausification,[],[f2367]) ).
thf(f3142,plain,
( ( $false
= ( exists_in_world @ sK2 @ sK0 ) )
| ( ( exists_in_world @ sK3 @ sK0 )
= $false )
| ( $false
= ( in @ sK1 @ sK2 @ sK0 ) )
| ( $false
= ( exists_in_world @ sK1 @ sK0 ) )
| ( $true = $false )
| ( $false
= ( in @ sK3 @ sK2 @ sK0 ) ) ),
inference(superposition,[],[f567,f2369]) ).
thf(f3162,plain,
( ( $false
= ( exists_in_world @ sK2 @ sK0 ) )
| ( $false
= ( exists_in_world @ sK1 @ sK0 ) )
| ( ( exists_in_world @ sK3 @ sK0 )
= $false )
| ( $false
= ( in @ sK3 @ sK2 @ sK0 ) )
| ( $false
= ( in @ sK1 @ sK2 @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f3142]) ).
thf(f3198,plain,
( ( ( exists_in_world @ sK3 @ sK0 )
= $false )
| ( $true = $false )
| ( $false
= ( in @ sK1 @ sK2 @ sK0 ) )
| ( $false
= ( exists_in_world @ sK1 @ sK0 ) )
| ( $false
= ( in @ sK3 @ sK2 @ sK0 ) ) ),
inference(forward_demodulation,[],[f3162,f325]) ).
thf(f3199,plain,
( ( ( exists_in_world @ sK3 @ sK0 )
= $false )
| ( $false
= ( in @ sK1 @ sK2 @ sK0 ) )
| ( $false
= ( in @ sK3 @ sK2 @ sK0 ) )
| ( $false
= ( exists_in_world @ sK1 @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f3198]) ).
thf(f3236,plain,
( ( $true = $false )
| ( $false
= ( in @ sK3 @ sK2 @ sK0 ) )
| ( $false
= ( exists_in_world @ sK1 @ sK0 ) )
| ( $false
= ( in @ sK1 @ sK2 @ sK0 ) ) ),
inference(forward_demodulation,[],[f3199,f346]) ).
thf(f3237,plain,
( ( $false
= ( exists_in_world @ sK1 @ sK0 ) )
| ( $false
= ( in @ sK3 @ sK2 @ sK0 ) )
| ( $false
= ( in @ sK1 @ sK2 @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f3236]) ).
thf(f3264,plain,
( ( $true = $false )
| ( $false
= ( in @ sK1 @ sK2 @ sK0 ) )
| ( $false
= ( in @ sK3 @ sK2 @ sK0 ) ) ),
inference(forward_demodulation,[],[f3237,f321]) ).
thf(f3265,plain,
( ( $false
= ( in @ sK1 @ sK2 @ sK0 ) )
| ( $false
= ( in @ sK3 @ sK2 @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f3264]) ).
thf(f3284,plain,
( ( $true = $false )
| ( $false
= ( in @ sK3 @ sK2 @ sK0 ) ) ),
inference(forward_demodulation,[],[f3265,f351]) ).
thf(f3285,plain,
( $false
= ( in @ sK3 @ sK2 @ sK0 ) ),
inference(trivial_inequality_removal,[],[f3284]) ).
thf(f3292,plain,
$true = $false,
inference(superposition,[],[f3285,f352]) ).
thf(f3300,plain,
$false,
inference(trivial_inequality_removal,[],[f3292]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET907^7 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 % Computer : n017.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 13:36:22 UTC 2026
% 0.08/0.21 % CPUTime :
% 0.08/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.21/0.26 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.59/0.39 % (348000)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.59/0.39 % (348009)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=255560132:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.59/0.39 % (348011)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.59/0.39 % (348011)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.59/0.39 % (348005)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=182819077:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.59/0.39 % (348006)lrs+10_16_si=on:nwc=1.5:random_seed=2271558282:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.59/0.39 % (348007)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2869337755:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.59/0.39 % (348008)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=3478447184: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.59/0.39 % (348009)Instruction limit reached!
% 0.59/0.39 % (348009)------------------------------
% 0.59/0.39 % (348009)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.39 % (348009)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.39 % (348010)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=4135872323:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.59/0.39 % (348009)CaDiCaL version: 2.1.3
% 0.59/0.39 % (348009)Termination reason: Instruction limit
% 0.59/0.39 % (348009)Termination phase: Saturation
% 0.59/0.39 % (348009)Time elapsed: 0.007 s
% 0.59/0.39 % (348009)Peak memory usage: 12 MB
% 0.59/0.39 % (348009)Instructions burned: 25 (million)
% 0.59/0.39 % (348011)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=1351705839:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.59/0.39 % (348007)Instruction limit reached!
% 0.59/0.39 % (348007)------------------------------
% 0.59/0.39 % (348007)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.39 % (348007)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.39 % (348007)CaDiCaL version: 2.1.3
% 0.59/0.39 % (348007)Termination reason: Instruction limit
% 0.59/0.39 % (348007)Termination phase: shuffling
% 0.59/0.39 % (348007)Time elapsed: 0.002 s
% 0.59/0.39 % (348007)Peak memory usage: 9 MB
% 0.59/0.39 % (348007)Instructions burned: 4 (million)
% 0.59/0.39 % (348006)Instruction limit reached!
% 0.59/0.39 % (348006)------------------------------
% 0.59/0.39 % (348006)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.39 % (348006)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.39 % (348006)CaDiCaL version: 2.1.3
% 0.59/0.39 % (348006)Termination reason: Instruction limit
% 0.59/0.39 % (348006)Termination phase: Property scanning
% 0.59/0.39 % (348006)Time elapsed: 0.008 s
% 0.59/0.39 % (348006)Peak memory usage: 10 MB
% 0.59/0.39 % (348006)Instructions burned: 19 (million)
% 0.59/0.39 % (348019)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3484665311:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.59/0.39 % (348019)Instruction limit reached!
% 0.59/0.39 % (348019)------------------------------
% 0.59/0.39 % (348019)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.39 % (348019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.39 % (348019)CaDiCaL version: 2.1.3
% 0.59/0.39 % (348019)Termination reason: Instruction limit
% 0.59/0.39 % (348019)Termination phase: shuffling
% 0.59/0.39 % (348019)Time elapsed: 0.001 s
% 0.59/0.39 % (348019)Peak memory usage: 9 MB
% 0.59/0.39 % (348019)Instructions burned: 4 (million)
% 0.59/0.39 % (348020)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=1139495529:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.59/0.39 % (348023)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=925029097:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.59/0.42 % (348020)Instruction limit reached!
% 0.59/0.42 % (348020)------------------------------
% 0.59/0.42 % (348020)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.42 % (348020)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.42 % (348020)CaDiCaL version: 2.1.3
% 0.59/0.42 % (348020)Termination reason: Instruction limit
% 0.59/0.42 % (348020)Termination phase: Property scanning
% 0.59/0.42 % (348020)Time elapsed: 0.003 s
% 0.59/0.42 % (348020)Peak memory usage: 10 MB
% 0.59/0.42 % (348020)Instructions burned: 6 (million)
% 0.59/0.42 % (348021)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.59/0.42 % (348023)Instruction limit reached!
% 0.59/0.42 % (348023)------------------------------
% 0.59/0.42 % (348023)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.42 % (348023)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.42 % (348023)CaDiCaL version: 2.1.3
% 0.59/0.42 % (348023)Termination reason: Instruction limit
% 0.59/0.42 % (348023)Termination phase: Property scanning
% 0.59/0.42 % (348023)Time elapsed: 0.003 s
% 0.59/0.42 % (348023)Peak memory usage: 10 MB
% 0.59/0.42 % (348023)Instructions burned: 15 (million)
% 0.59/0.42 % (348021)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=253355560:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.59/0.42 % (348021)Instruction limit reached!
% 0.59/0.42 % (348021)------------------------------
% 0.59/0.42 % (348021)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.42 % (348021)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.42 % (348021)CaDiCaL version: 2.1.3
% 0.59/0.42 % (348021)Termination reason: Instruction limit
% 0.59/0.42 % (348021)Termination phase: Property scanning
% 0.59/0.42 % (348021)Time elapsed: 0.004 s
% 0.59/0.42 % (348021)Peak memory usage: 10 MB
% 0.59/0.42 % (348021)Instructions burned: 7 (million)
% 0.59/0.42 % (348010)Instruction limit reached!
% 0.59/0.42 % (348010)------------------------------
% 0.59/0.42 % (348010)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.42 % (348010)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.42 % (348010)CaDiCaL version: 2.1.3
% 0.59/0.42 % (348010)Termination reason: Instruction limit
% 0.59/0.42 % (348010)Termination phase: Saturation
% 0.59/0.42 % (348010)Time elapsed: 0.035 s
% 0.59/0.42 % (348010)Peak memory usage: 12 MB
% 0.59/0.42 % (348010)Instructions burned: 76 (million)
% 0.59/0.42 % (348027)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=2609290253:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.59/0.42 % (348005)Instruction limit reached!
% 0.59/0.42 % (348005)------------------------------
% 0.59/0.42 % (348005)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.42 % (348005)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.42 % (348005)CaDiCaL version: 2.1.3
% 0.59/0.42 % (348005)Termination reason: Instruction limit
% 0.59/0.42 % (348005)Termination phase: Saturation
% 0.59/0.42 % (348005)Time elapsed: 0.041 s
% 0.59/0.42 % (348005)Peak memory usage: 12 MB
% 0.59/0.42 % (348005)Instructions burned: 87 (million)
% 0.59/0.42 % (348026)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.59/0.42 % (348026)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.59/0.42 % (348026)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=2788149342: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.59/0.42 % (348030)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.59/0.42 % (348029)lrs+10_1_si=on:cs=on:random_seed=1902308495:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.59/0.45 % (348030)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=1369621785:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.59/0.45 % (348030)Instruction limit reached!
% 0.59/0.45 % (348030)------------------------------
% 0.59/0.45 % (348030)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.45 % (348030)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.45 % (348030)CaDiCaL version: 2.1.3
% 0.59/0.45 % (348030)Termination reason: Instruction limit
% 0.59/0.45 % (348030)Termination phase: shuffling
% 0.59/0.45 % (348030)Time elapsed: 0.002 s
% 0.59/0.45 % (348030)Peak memory usage: 10 MB
% 0.59/0.45 % (348030)Instructions burned: 4 (million)
% 0.59/0.45 % (348026)Instruction limit reached!
% 0.59/0.45 % (348026)------------------------------
% 0.59/0.45 % (348026)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.45 % (348026)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.45 % (348026)CaDiCaL version: 2.1.3
% 0.59/0.45 % (348026)Termination reason: Instruction limit
% 0.59/0.45 % (348026)Termination phase: Saturation
% 0.59/0.45 % (348026)Time elapsed: 0.012 s
% 0.59/0.45 % (348026)Peak memory usage: 11 MB
% 0.59/0.45 % (348026)Instructions burned: 29 (million)
% 0.59/0.45 % (348029)Instruction limit reached!
% 0.59/0.45 % (348029)------------------------------
% 0.59/0.45 % (348029)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.45 % (348029)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.45 % (348029)CaDiCaL version: 2.1.3
% 0.59/0.45 % (348029)Termination reason: Instruction limit
% 0.59/0.45 % (348029)Termination phase: Preprocessing 3
% 0.59/0.45 % (348029)Time elapsed: 0.004 s
% 0.59/0.45 % (348029)Peak memory usage: 10 MB
% 0.59/0.45 % (348029)Instructions burned: 9 (million)
% 0.59/0.45 % (348032)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=64505982:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/38Mi)
% 0.59/0.45 % (348027)Instruction limit reached!
% 0.59/0.45 % (348027)------------------------------
% 0.59/0.45 % (348027)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.45 % (348027)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.45 % (348027)CaDiCaL version: 2.1.3
% 0.59/0.45 % (348027)Termination reason: Instruction limit
% 0.59/0.45 % (348027)Termination phase: Saturation
% 0.59/0.45 % (348027)Time elapsed: 0.022 s
% 0.59/0.45 % (348027)Peak memory usage: 13 MB
% 0.59/0.45 % (348027)Instructions burned: 86 (million)
% 0.59/0.45 % (348032)Refutation not found, incomplete strategy
% 0.59/0.45 % (348032)------------------------------
% 0.59/0.45 % (348032)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.45 % (348032)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.45 % (348032)CaDiCaL version: 2.1.3
% 0.59/0.45 % (348032)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.45 % (348032)Time elapsed: 0.008 s
% 0.59/0.45 % (348032)Peak memory usage: 12 MB
% 0.59/0.45 % (348032)Instructions burned: 15 (million)
% 0.59/0.45 % (348032)------------------------------
% 0.59/0.45 % (348032)------------------------------
% 0.59/0.45 % (348040)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=3830012629:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/327Mi)
% 0.59/0.45 % (348011)Instruction limit reached!
% 0.59/0.45 % (348011)------------------------------
% 0.59/0.45 % (348011)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.59/0.45 % (348011)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.59/0.45 % (348011)CaDiCaL version: 2.1.3
% 0.59/0.45 % (348011)Termination reason: Instruction limit
% 0.59/0.45 % (348011)Termination phase: Saturation
% 0.59/0.45 % (348011)Time elapsed: 0.074 s
% 0.59/0.45 % (348011)Peak memory usage: 12 MB
% 0.59/0.45 % (348011)Instructions burned: 158 (million)
% 0.59/0.45 % (348036)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=1730980339:st=2:i=249:sd=1:rtra=on:ss=axioms_2999 on theBenchmark for (2999ds/249Mi)
% 0.59/0.45 % (348037)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=1277797899:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/25Mi)
% 0.59/0.45 % (348038)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=3196589890:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2999 on theBenchmark for (2999ds/14Mi)
% 1.32/0.48 % (348038)Instruction limit reached!
% 1.32/0.48 % (348038)------------------------------
% 1.32/0.48 % (348038)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.48 % (348038)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.48 % (348038)CaDiCaL version: 2.1.3
% 1.32/0.48 % (348038)Termination reason: Instruction limit
% 1.32/0.48 % (348038)Termination phase: Function definition elimination
% 1.32/0.48 % (348038)Time elapsed: 0.007 s
% 1.32/0.48 % (348038)Peak memory usage: 10 MB
% 1.32/0.48 % (348038)Instructions burned: 16 (million)
% 1.32/0.48 % (348036)Refutation not found, incomplete strategy
% 1.32/0.48 % (348036)------------------------------
% 1.32/0.48 % (348036)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.48 % (348036)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.48 % (348036)CaDiCaL version: 2.1.3
% 1.32/0.49 % (348036)Termination reason: Refutation not found, incomplete strategy
% 1.32/0.49 % (348036)Time elapsed: 0.009 s
% 1.32/0.49 % (348036)Peak memory usage: 12 MB
% 1.32/0.49 % (348036)Instructions burned: 20 (million)
% 1.32/0.49 % (348036)------------------------------
% 1.32/0.49 % (348036)------------------------------
% 1.32/0.49 % (348041)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=591414826:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/14Mi)
% 1.32/0.49 % (348037)Instruction limit reached!
% 1.32/0.49 % (348037)------------------------------
% 1.32/0.49 % (348037)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.49 % (348037)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.49 % (348037)CaDiCaL version: 2.1.3
% 1.32/0.49 % (348037)Termination reason: Instruction limit
% 1.32/0.49 % (348037)Termination phase: Saturation
% 1.32/0.49 % (348037)Time elapsed: 0.014 s
% 1.32/0.49 % (348037)Peak memory usage: 12 MB
% 1.32/0.49 % (348037)Instructions burned: 26 (million)
% 1.32/0.49 % (348043)ott+21_20_to=lpo:sil=128000:tgt=ground:si=on:sp=arity:lma=off:uwa=off:foolp=on:random_seed=1060960248:st=4:i=2:add=off:sd=3:nm=16:fsr=off:rtra=on:ss=axioms:sgt=8:ntd=on_2998 on theBenchmark for (2998ds/2Mi)
% 1.32/0.49 % (348041)Instruction limit reached!
% 1.32/0.49 % (348041)------------------------------
% 1.32/0.49 % (348041)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.49 % (348041)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.49 % (348041)CaDiCaL version: 2.1.3
% 1.32/0.49 % (348041)Termination reason: Instruction limit
% 1.32/0.49 % (348041)Termination phase: Function definition elimination
% 1.32/0.49 % (348041)Time elapsed: 0.006 s
% 1.32/0.49 % (348041)Peak memory usage: 10 MB
% 1.32/0.49 % (348041)Instructions burned: 14 (million)
% 1.32/0.49 % (348043)Instruction limit reached!
% 1.32/0.49 % (348043)------------------------------
% 1.32/0.49 % (348043)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.49 % (348043)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.49 % (348043)CaDiCaL version: 2.1.3
% 1.32/0.49 % (348043)Termination reason: Instruction limit
% 1.32/0.49 % (348043)Termination phase: shuffling
% 1.32/0.49 % (348043)Time elapsed: 0.002 s
% 1.32/0.49 % (348043)Peak memory usage: 9 MB
% 1.32/0.49 % (348043)Instructions burned: 4 (million)
% 1.32/0.49 % (348047)ott+1004_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=unary_frequency:cbe=off:uwa=off:nwc=1:random_seed=806729440:i=26:ep=R:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/26Mi)
% 1.32/0.49 % (348048)dis+1002_16_sil=128000:si=on:sp=occurrence:random_seed=2137280008:cond=fast:i=23:hud=1:av=off:rtra=on:fe=abstraction:ntd=on_2998 on theBenchmark for (2998ds/23Mi)
% 1.32/0.49 % (348050)lrs+1002_1024_sil=128000:tgt=ground:fde=none:e2e=on:si=on:uwa=off:nwc=1:random_seed=3956462137:cond=on:i=60:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/60Mi)
% 1.32/0.49 % (348052)WARNING Broken Constraint: if sine_to_age_generality_threshold(10) 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
% 1.32/0.49 % (348052)WARNING Broken Constraint: if lrs_weight_limit_only(on) has been set then saturation_algorithm(otter) is equal to lrs
% 1.32/0.52 % (348053)WARNING Broken Constraint: if choice_reasoning(on) has been set then choice_ax(on) is equal to off
% 1.32/0.52 % (348052)ott+21_1_to=kbo:sil=128000:cnfonf=lazy_gen:bsd=on:si=on:sp=const_frequency:lma=off:uwa=off:foolp=on:s2agt=10:lwlo=on:random_seed=2338574594:i=14:add=off:nm=40:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 1.32/0.52 % (348047)Instruction limit reached!
% 1.32/0.52 % (348047)------------------------------
% 1.32/0.52 % (348047)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.52 % (348047)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.52 % (348047)CaDiCaL version: 2.1.3
% 1.32/0.52 % (348047)Termination reason: Instruction limit
% 1.32/0.52 % (348047)Termination phase: Saturation
% 1.32/0.52 % (348047)Time elapsed: 0.011 s
% 1.32/0.52 % (348047)Peak memory usage: 11 MB
% 1.32/0.52 % (348047)Instructions burned: 26 (million)
% 1.32/0.52 % (348053)lrs+1010_4:1_slsqr=8,1:to=kbo:cha=on:drc=off:si=on:sp=arity:lcm=predicate:uwa=off:fd=preordered:gs=on:nwc=5:s2agt=32:slsqc=1:kmz=on:updr=off:chr=on:pe=on:slsq=on:random_seed=1390449763:i=8:nm=2:rtra=on:fe=abstraction:inj=on_2998 on theBenchmark for (2998ds/8Mi)
% 1.32/0.52 % (348048)Instruction limit reached!
% 1.32/0.52 % (348048)------------------------------
% 1.32/0.52 % (348048)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.52 % (348048)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.52 % (348048)CaDiCaL version: 2.1.3
% 1.32/0.52 % (348048)Termination reason: Instruction limit
% 1.32/0.52 % (348048)Termination phase: Saturation
% 1.32/0.52 % (348048)Time elapsed: 0.010 s
% 1.32/0.52 % (348048)Peak memory usage: 11 MB
% 1.32/0.52 % (348048)Instructions burned: 24 (million)
% 1.32/0.52 % (348053)Instruction limit reached!
% 1.32/0.52 % (348053)------------------------------
% 1.32/0.52 % (348053)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.52 % (348053)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.52 % (348053)CaDiCaL version: 2.1.3
% 1.32/0.52 % (348053)Termination reason: Instruction limit
% 1.32/0.52 % (348053)Termination phase: SInE selection
% 1.32/0.52 % (348053)Time elapsed: 0.004 s
% 1.32/0.52 % (348053)Peak memory usage: 10 MB
% 1.32/0.52 % (348053)Instructions burned: 9 (million)
% 1.32/0.52 % (348052)Instruction limit reached!
% 1.32/0.52 % (348052)------------------------------
% 1.32/0.52 % (348052)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.52 % (348052)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.52 % (348052)CaDiCaL version: 2.1.3
% 1.32/0.52 % (348052)Termination reason: Instruction limit
% 1.32/0.52 % (348052)Termination phase: Property scanning
% 1.32/0.52 % (348052)Time elapsed: 0.009 s
% 1.32/0.52 % (348052)Peak memory usage: 10 MB
% 1.32/0.52 % (348052)Instructions burned: 22 (million)
% 1.32/0.52 % (348058)dis+1004_50_to=lpo:drc=off:fde=unused:cnfonf=lazy_not_gen_be_off:si=on:sp=reverse_arity:spb=units:cbe=off:foolp=on:random_seed=957373207:uwa_fpi=on:i=31:doe=on:bd=preordered:rtra=on:fsd=on_2998 on theBenchmark for (2998ds/31Mi)
% 1.32/0.52 % (348060)dis+10_1024_sil=128000:cnfonf=off:si=on:fd=off:random_seed=2466734271:i=7:hud=5:bd=preordered:rtra=on:bet=on_2998 on theBenchmark for (2998ds/7Mi)
% 1.32/0.52 % (348061)lrs+10_1_plsq=on:drc=ordering:cnfonf=lazy_not_gen_be_off:bsd=on:si=on:plsqr=32,1:cs=on:random_seed=1305518537:i=23:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/23Mi)
% 1.32/0.52 % (348060)Instruction limit reached!
% 1.32/0.52 % (348060)------------------------------
% 1.32/0.52 % (348060)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.52 % (348060)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.52 % (348060)CaDiCaL version: 2.1.3
% 1.32/0.52 % (348060)Termination reason: Instruction limit
% 1.32/0.52 % (348060)Termination phase: Property scanning
% 1.32/0.52 % (348060)Time elapsed: 0.004 s
% 1.32/0.52 % (348060)Peak memory usage: 10 MB
% 1.32/0.52 % (348060)Instructions burned: 8 (million)
% 1.32/0.52 % (348050)Instruction limit reached!
% 1.32/0.52 % (348050)------------------------------
% 1.32/0.52 % (348050)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.52 % (348050)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.52 % (348050)CaDiCaL version: 2.1.3
% 1.32/0.52 % (348050)Termination reason: Instruction limit
% 2.05/0.57 % (348050)Termination phase: Saturation
% 2.05/0.57 % (348050)Time elapsed: 0.032 s
% 2.05/0.57 % (348050)Peak memory usage: 12 MB
% 2.05/0.57 % (348050)Instructions burned: 61 (million)
% 2.05/0.57 % (348062)lrs+10_1_sil=128000:fde=unused:si=on:random_seed=3463657190:s2a=on:i=20:kws=inv_frequency:bd=all:rtra=on_2998 on theBenchmark for (2998ds/20Mi)
% 2.05/0.57 % (348058)Instruction limit reached!
% 2.05/0.57 % (348058)------------------------------
% 2.05/0.57 % (348058)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.05/0.57 % (348058)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/0.57 % (348058)CaDiCaL version: 2.1.3
% 2.05/0.57 % (348058)Termination reason: Instruction limit
% 2.05/0.57 % (348058)Termination phase: Saturation
% 2.05/0.57 % (348058)Time elapsed: 0.016 s
% 2.05/0.57 % (348058)Peak memory usage: 12 MB
% 2.05/0.57 % (348058)Instructions burned: 31 (million)
% 2.05/0.57 % (348061)Instruction limit reached!
% 2.05/0.57 % (348061)------------------------------
% 2.05/0.57 % (348061)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.05/0.57 % (348061)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/0.57 % (348061)CaDiCaL version: 2.1.3
% 2.05/0.57 % (348061)Termination reason: Instruction limit
% 2.05/0.57 % (348061)Termination phase: Saturation
% 2.05/0.57 % (348061)Time elapsed: 0.011 s
% 2.05/0.57 % (348061)Peak memory usage: 10 MB
% 2.05/0.57 % (348061)Instructions burned: 23 (million)
% 2.05/0.57 % (348040)Instruction limit reached!
% 2.05/0.57 % (348040)------------------------------
% 2.05/0.57 % (348040)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.05/0.57 % (348040)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/0.57 % (348040)CaDiCaL version: 2.1.3
% 2.05/0.57 % (348040)Termination reason: Instruction limit
% 2.05/0.57 % (348040)Termination phase: Saturation
% 2.05/0.57 % (348040)Time elapsed: 0.080 s
% 2.05/0.57 % (348040)Peak memory usage: 13 MB
% 2.05/0.57 % (348040)Instructions burned: 328 (million)
% 2.05/0.57 % (348062)Instruction limit reached!
% 2.05/0.57 % (348062)------------------------------
% 2.05/0.57 % (348062)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.05/0.57 % (348062)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/0.57 % (348062)CaDiCaL version: 2.1.3
% 2.05/0.57 % (348062)Termination reason: Instruction limit
% 2.05/0.57 % (348062)Termination phase: Saturation
% 2.05/0.57 % (348062)Time elapsed: 0.010 s
% 2.05/0.57 % (348062)Peak memory usage: 12 MB
% 2.05/0.57 % (348062)Instructions burned: 21 (million)
% 2.05/0.57 % (348066)dis+1010_2:1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:uwa=off:slsq=on:random_seed=985334385:i=1240:rtra=on:ixr=off_2998 on theBenchmark for (2998ds/1240Mi)
% 2.05/0.57 % (348071)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 2.05/0.57 % (348071)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=1861189793:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2998 on theBenchmark for (2998ds/7Mi)
% 2.05/0.57 % (348068)ott+1002_32_tgt=ground:si=on:sp=const_max:acc=on:nwc=0.5:random_seed=1095032951:i=143:fgj=on:piset=pi_sigma:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/143Mi)
% 2.05/0.57 % (348071)Instruction limit reached!
% 2.05/0.57 % (348071)------------------------------
% 2.05/0.57 % (348071)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.05/0.57 % (348071)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/0.57 % (348071)CaDiCaL version: 2.1.3
% 2.05/0.57 % (348071)Termination reason: Instruction limit
% 2.05/0.57 % (348071)Termination phase: Property scanning
% 2.05/0.57 % (348071)Time elapsed: 0.002 s
% 2.05/0.57 % (348071)Peak memory usage: 10 MB
% 2.05/0.57 % (348071)Instructions burned: 9 (million)
% 2.05/0.57 % (348069)lrs+1002_1_sil=128000:si=on:acc=on:uwa=off:random_seed=1358797742:st=5:s2a=on:i=193:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/193Mi)
% 2.05/0.57 % (348070)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=2715929212:i=42:hud=10:rtra=on_2998 on theBenchmark for (2998ds/42Mi)
% 2.05/0.57 % (348072)lrs+10_1_to=lpo:sil=128000:si=on:sp=arity:urr=on:random_seed=3972739475:i=181:sd=2:bd=preordered:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/181Mi)
% 2.05/0.57 % (348076)dis+10_8_sil=128000:plsq=on:plsqc=1:si=on:sp=unary_first:sos=on:lma=off:plsqr=64,1:uwa=interpreted_only:foolp=on:random_seed=1555776318:st=3:avsq=on:i=169:avsqr=8,1:sd=2:kws=precedence:bd=preordered:rtra=on:ss=axioms:ntd=on_2997 on theBenchmark for (2997ds/169Mi)
% 2.44/0.64 % (348072)Refutation not found, incomplete strategy
% 2.44/0.64 % (348072)------------------------------
% 2.44/0.64 % (348072)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.44/0.64 % (348072)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/0.64 % (348072)CaDiCaL version: 2.1.3
% 2.44/0.64 % (348072)Termination reason: Refutation not found, incomplete strategy
% 2.44/0.64 % (348072)Time elapsed: 0.013 s
% 2.44/0.64 % (348072)Peak memory usage: 12 MB
% 2.44/0.64 % (348072)Instructions burned: 27 (million)
% 2.44/0.64 % (348072)------------------------------
% 2.44/0.64 % (348072)------------------------------
% 2.44/0.64 % (348076)Refutation not found, incomplete strategy
% 2.44/0.64 % (348076)------------------------------
% 2.44/0.64 % (348076)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.44/0.64 % (348076)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/0.64 % (348076)CaDiCaL version: 2.1.3
% 2.44/0.64 % (348076)Termination reason: Refutation not found, incomplete strategy
% 2.44/0.64 % (348076)Time elapsed: 0.012 s
% 2.44/0.64 % (348076)Peak memory usage: 12 MB
% 2.44/0.64 % (348076)Instructions burned: 52 (million)
% 2.44/0.64 % (348070)Instruction limit reached!
% 2.44/0.64 % (348070)------------------------------
% 2.44/0.64 % (348070)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.44/0.64 % (348070)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/0.64 % (348070)CaDiCaL version: 2.1.3
% 2.44/0.64 % (348070)Termination reason: Instruction limit
% 2.44/0.64 % (348070)Termination phase: Saturation
% 2.44/0.64 % (348070)Time elapsed: 0.018 s
% 2.44/0.64 % (348070)Peak memory usage: 12 MB
% 2.44/0.64 % (348070)Instructions burned: 43 (million)
% 2.44/0.64 % (348076)------------------------------
% 2.44/0.64 % (348076)------------------------------
% 2.44/0.64 % (348069)Refutation not found, incomplete strategy
% 2.44/0.64 % (348069)------------------------------
% 2.44/0.64 % (348069)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.44/0.64 % (348069)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/0.64 % (348069)CaDiCaL version: 2.1.3
% 2.44/0.64 % (348069)Termination reason: Refutation not found, incomplete strategy
% 2.44/0.64 % (348069)Time elapsed: 0.027 s
% 2.44/0.64 % (348069)Peak memory usage: 13 MB
% 2.44/0.64 % (348069)Instructions burned: 57 (million)
% 2.44/0.64 % (348069)------------------------------
% 2.44/0.64 % (348069)------------------------------
% 2.44/0.64 % (348082)ott+2_5:4_anc=none:to=lpo:si=on:lma=off:cbe=off:uwa=ground:nwc=3:random_seed=2400104490:uwa_fpi=on:i=22:add=on:doe=on:ins=1:rtra=on_2997 on theBenchmark for (2997ds/22Mi)
% 2.44/0.64 % (348081)WARNING Broken Constraint: if sine_level_split_queue_cutoffs(5) has been set then sine_level_split_queue(off) is equal to on
% 2.44/0.64 % (348082)Instruction limit reached!
% 2.44/0.64 % (348082)------------------------------
% 2.44/0.64 % (348082)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.44/0.64 % (348082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/0.64 % (348082)CaDiCaL version: 2.1.3
% 2.44/0.64 % (348082)Termination reason: Instruction limit
% 2.44/0.64 % (348082)Termination phase: Property scanning
% 2.44/0.64 % (348082)Time elapsed: 0.005 s
% 2.44/0.64 % (348082)Peak memory usage: 10 MB
% 2.44/0.64 % (348082)Instructions burned: 23 (million)
% 2.44/0.64 % (348083)dis+1010_1_to=lpo:sil=128000:cnfonf=lazy_pi_sigma_gen:sas=cadical:si=on:sos=all:uwa=off:sac=on:random_seed=1600219525:i=19:add=on:rtra=on_2997 on theBenchmark for (2997ds/19Mi)
% 2.44/0.64 % (348081)lrs+1002_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=arity:cbe=off:uwa=all:slsqc=5:random_seed=210415794:st=4:s2a=on:i=6:add=on:doe=on:hud=10:rtra=on:bet=on:ss=axioms_2997 on theBenchmark for (2997ds/6Mi)
% 2.44/0.64 % (348081)Instruction limit reached!
% 2.44/0.64 % (348081)------------------------------
% 2.44/0.64 % (348081)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.44/0.64 % (348081)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/0.64 % (348081)CaDiCaL version: 2.1.3
% 2.44/0.64 % (348081)Termination reason: Instruction limit
% 2.44/0.64 % (348081)Termination phase: Property scanning
% 2.44/0.64 % (348081)Time elapsed: 0.003 s
% 2.44/0.64 % (348081)Peak memory usage: 10 MB
% 2.44/0.64 % (348081)Instructions burned: 7 (million)
% 2.44/0.64 % (348086)dis+1004_4:1_slsqr=1,2:to=lpo:plsq=on:fde=unused:e2e=on:si=on:spb=goal_then_units:acc=on:urr=on:uwa=off:fd=preordered:s2agt=16:slsqc=1:slsq=on:random_seed=2130651555:hsq=on:hsqr=16,1:s2a=on:i=853:add=off:bd=all:nm=64:rtra=on:gtg=position:c=on:ntd=on_2997 on theBenchmark for (2997ds/853Mi)
% 2.44/0.64 % (348083)Instruction limit reached!
% 2.44/0.64 % (348083)------------------------------
% 2.44/0.64 % (348083)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.44/0.64 % (348083)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/0.64 % (348083)CaDiCaL version: 2.1.3
% 2.44/0.64 % (348083)Termination reason: Instruction limit
% 2.44/0.64 % (348083)Termination phase: Property scanning
% 2.44/0.64 % (348083)Time elapsed: 0.008 s
% 2.44/0.64 % (348083)Peak memory usage: 10 MB
% 2.44/0.64 % (348083)Instructions burned: 20 (million)
% 2.44/0.64 % (348084)ott+10_1_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:lma=off:plsqr=128,1:urr=ec_only:uwa=off:rp=on:nwc=20:br=off:random_seed=658094537:i=316:bs=unit_only:ins=25:rtra=on:ntd=on_2997 on theBenchmark for (2997ds/316Mi)
% 2.44/0.64 % (348089)dis+1003_3:4_to=kbo:plsq=on:prc=on:sims=off:e2e=on:si=on:spb=intro:acc=on:urr=on:uwa=off:foolp=on:s2agt=32:slsqc=3:slsq=on:random_seed=2108199096:hsq=on:hsqr=16,1:s2a=on:i=45:erml=3:slsql=off:rtra=on:gtg=exists_top:er=filter:ntd=on_2997 on theBenchmark for (2997ds/45Mi)
% 2.44/0.64 % (348068)Instruction limit reached!
% 2.44/0.64 % (348068)------------------------------
% 2.44/0.64 % (348068)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.44/0.64 % (348068)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/0.64 % (348068)CaDiCaL version: 2.1.3
% 2.44/0.64 % (348068)Termination reason: Instruction limit
% 2.44/0.64 % (348068)Termination phase: Saturation
% 2.44/0.64 % (348068)Time elapsed: 0.068 s
% 2.44/0.64 % (348068)Peak memory usage: 13 MB
% 2.44/0.64 % (348068)Instructions burned: 144 (million)
% 2.44/0.64 % (348091)lrs+1002_1_sil=128000:fde=unused:e2e=on:si=on:sos=on:uwa=interpreted_only:random_seed=1623084796:i=480:rtra=on_2997 on theBenchmark for (2997ds/480Mi)
% 2.44/0.64 % (348091)Refutation not found, incomplete strategy
% 2.44/0.64 % (348091)------------------------------
% 2.44/0.64 % (348091)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.44/0.64 % (348091)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/0.64 % (348091)CaDiCaL version: 2.1.3
% 2.44/0.64 % (348091)Termination reason: Refutation not found, incomplete strategy
% 2.44/0.64 % (348091)Time elapsed: 0.010 s
% 2.44/0.64 % (348091)Peak memory usage: 12 MB
% 2.44/0.64 % (348091)Instructions burned: 21 (million)
% 2.44/0.64 % (348091)------------------------------
% 2.44/0.64 % (348091)------------------------------
% 2.44/0.64 % (348094)dis+1010_40_sil=128000:si=on:uwa=off:nwc=1:sac=on:chr=on:avsqc=3:random_seed=3279354042:avsq=on:i=21:avsqr=8,1:kws=frequency:fgj=on:bd=all:rtra=on:fe=axiom:ntd=on_2997 on theBenchmark for (2997ds/21Mi)
% 2.44/0.64 % (348089)Instruction limit reached!
% 2.44/0.64 % (348089)------------------------------
% 2.44/0.64 % (348089)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.44/0.64 % (348089)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/0.64 % (348089)CaDiCaL version: 2.1.3
% 2.44/0.64 % (348089)Termination reason: Instruction limit
% 2.44/0.64 % (348089)Termination phase: Saturation
% 2.44/0.64 % (348089)Time elapsed: 0.022 s
% 2.44/0.64 % (348089)Peak memory usage: 12 MB
% 2.44/0.64 % (348089)Instructions burned: 45 (million)
% 2.44/0.64 % (348094)Instruction limit reached!
% 2.44/0.64 % (348094)------------------------------
% 2.44/0.64 % (348094)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.44/0.64 % (348094)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/0.64 % (348094)CaDiCaL version: 2.1.3
% 2.44/0.64 % (348094)Termination reason: Instruction limit
% 2.44/0.64 % (348094)Termination phase: Property scanning
% 2.44/0.64 % (348094)Time elapsed: 0.010 s
% 2.44/0.64 % (348094)Peak memory usage: 11 MB
% 2.44/0.64 % (348094)Instructions burned: 23 (million)
% 2.44/0.64 % (348096)WARNING Broken Constraint: if sine_level_split_queue_cutoffs(2) has been set then sine_level_split_queue(off) is equal to on
% 2.44/0.64 % (348096)ott+1002_3_si=on:sp=weighted_frequency:spb=goal:cbe=off:slsqc=2:random_seed=1111414254:cts=off:uwa_fpi=on:i=200:av=off:fsr=off:rtra=on:ntd=on_2997 on theBenchmark for (2997ds/200Mi)
% 2.44/0.64 % (348098)lrs+10_1_sil=128000:fde=unused:si=on:random_seed=1302919025:s2a=on:i=13:kws=inv_frequency:bd=all:rtra=on_2997 on theBenchmark for (2997ds/13Mi)
% 2.44/0.64 % (348099)lrs+1010_1_anc=none:slsqr=1,2:sil=128000:cnfonf=conj_eager:sas=cadical:si=on:hi=on:uwa=one_side_interpreted:rp=on:nwc=2:slsqc=3:slsq=on:random_seed=2238057638:i=66:s2at=3:nm=2:rtra=on:rawr=on_2996 on theBenchmark for (2996ds/66Mi)
% 2.44/0.64 % (348098)Instruction limit reached!
% 2.44/0.64 % (348098)------------------------------
% 2.44/0.64 % (348098)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.44/0.64 % (348098)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/0.64 % (348098)CaDiCaL version: 2.1.3
% 2.44/0.64 % (348098)Termination reason: Instruction limit
% 2.44/0.64 % (348098)Termination phase: Property scanning
% 2.44/0.64 % (348098)Time elapsed: 0.006 s
% 2.44/0.64 % (348098)Peak memory usage: 10 MB
% 2.44/0.64 % (348098)Instructions burned: 14 (million)
% 2.44/0.64 % (348103)lrs+1004_128_si=on:sos=all:uwa=off:random_seed=3437073260:i=51:fsr=off:rtra=on_2996 on theBenchmark for (2996ds/51Mi)
% 2.44/0.64 % (348099)Instruction limit reached!
% 2.44/0.64 % (348099)------------------------------
% 2.44/0.64 % (348099)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.44/0.64 % (348099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/0.64 % (348099)CaDiCaL version: 2.1.3
% 2.44/0.64 % (348099)Termination reason: Instruction limit
% 2.44/0.64 % (348099)Termination phase: Saturation
% 2.44/0.64 % (348099)Time elapsed: 0.029 s
% 2.44/0.64 % (348099)Peak memory usage: 12 MB
% 2.44/0.64 % (348099)Instructions burned: 68 (million)
% 2.44/0.64 % (348066) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-348000-348066"...
% 2.44/0.64 % (348103)Instruction limit reached!
% 2.44/0.64 % (348103)------------------------------
% 2.44/0.64 % (348103)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.44/0.64 % (348103)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/0.64 % (348103)CaDiCaL version: 2.1.3
% 2.44/0.64 % (348103)Termination reason: Instruction limit
% 2.44/0.64 % (348103)Termination phase: Saturation
% 2.44/0.64 % (348103)Time elapsed: 0.023 s
% 2.44/0.64 % (348103)Peak memory usage: 12 MB
% 2.44/0.64 % (348103)Instructions burned: 52 (million)
% 2.44/0.64 % (348105)dis+1002_64_sil=128000:cnfonf=lazy_not_gen_be_off:si=on:cbe=off:uwa=off:nwc=0.5:random_seed=3854457665:i=31:kws=inv_frequency:bd=all:rtra=on:ntd=on_2996 on theBenchmark for (2996ds/31Mi)
% 2.44/0.64 % (348066)...printing done.
% 2.44/0.64 % (348066)Refutation found. Thanks to Tanya!
% 2.44/0.64 % SZS status Theorem for theBenchmark
% 2.44/0.64 % SZS output start Proof for theBenchmark
% See solution above
% 2.44/0.65 % (348066)------------------------------
% 2.44/0.65 % (348066)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.44/0.65 % (348066)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/0.65 % (348066)CaDiCaL version: 2.1.3
% 2.44/0.65 % (348066)Termination reason: Refutation
% 2.44/0.65 % (348066)Time elapsed: 0.170 s
% 2.44/0.65 % (348066)Peak memory usage: 14 MB
% 2.44/0.65 % (348066)Instructions burned: 349 (million)
% 2.44/0.65 % (348000)Success in time 0.374 s
% 2.44/0.65 % Vampire exiting
%------------------------------------------------------------------------------