%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL717^1 : TPTP v9.3.1. Bugfixed v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:15:08 AM UTC 2026
% Result : Theorem 21.07s 3.28s
% Output : Refutation 21.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 56
% Number of leaves : 13
% Syntax : Number of formulae : 177 ( 66 unt; 0 typ; 4 def)
% Number of atoms : 2123 ( 624 equ; 0 cnn)
% Maximal formula atoms : 13 ( 11 avg)
% Number of connectives : 2957 ( 435 ~; 693 |; 15 &;1691 @)
% ( 4 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 287 ( 287 >; 0 *; 0 +; 0 <<)
% Number of symbols : 59 ( 55 usr; 10 con; 0-4 aty)
% ( 103 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 586 ( 0 sgn 290 !; 1 ?; 586 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
mu: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
meq_ind: 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,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_6,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
mimplied: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
mxor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(func_def_11,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(func_def_12,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(func_def_13,type,
mexists_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(func_def_14,type,
mtrue: $i > $o ).
thf(func_def_15,type,
mfalse: $i > $o ).
thf(func_def_16,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_17,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_18,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(func_def_19,type,
msymmetric: ( $i > $i > $o ) > $o ).
thf(func_def_20,type,
mserial: ( $i > $i > $o ) > $o ).
thf(func_def_21,type,
mtransitive: ( $i > $i > $o ) > $o ).
thf(func_def_22,type,
meuclidean: ( $i > $i > $o ) > $o ).
thf(func_def_23,type,
mpartially_functional: ( $i > $i > $o ) > $o ).
thf(func_def_24,type,
mfunctional: ( $i > $i > $o ) > $o ).
thf(func_def_25,type,
mweakly_dense: ( $i > $i > $o ) > $o ).
thf(func_def_26,type,
mweakly_connected: ( $i > $i > $o ) > $o ).
thf(func_def_27,type,
mweakly_directed: ( $i > $i > $o ) > $o ).
thf(func_def_28,type,
mvalid: ( $i > $o ) > $o ).
thf(func_def_29,type,
minvalid: ( $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,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_33,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_34,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_35,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_36,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_37,type,
vNOT: $o > $o ).
thf(func_def_38,type,
vOR: $o > $o > $o ).
thf(func_def_39,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_42,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_43,type,
vIMP: $o > $o > $o ).
thf(func_def_44,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_45,type,
vAND: $o > $o > $o ).
thf(func_def_46,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_47,type,
sK0: $i > $i > $o ).
thf(func_def_48,type,
sK1: ( $i > $o ) > $i > $i ).
thf(func_def_49,type,
sK2: $i > ( $i > $o ) > $i ).
thf(f3,axiom,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(f4,axiom,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mor) ).
thf(f5,axiom,
( mand
= ( ^ [X0: $i > $o,X1: $i > $o] : ( mnot @ ( mor @ ( mnot @ X0 ) @ ( mnot @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mand) ).
thf(f6,axiom,
( mimplies
= ( ^ [X0: $i > $o,X1: $i > $o] : ( mor @ ( mnot @ X0 ) @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(f11,axiom,
( mforall_prop
= ( ^ [X0: ( $i > $o ) > $i > $o,X1: $i] :
! [X2: $i > $o] : ( X0 @ X2 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mforall_prop) ).
thf(f16,axiom,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X1 @ X3 )
| ~ ( X0 @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(f26,axiom,
( mweakly_connected
= ( ^ [X0: $i > $i > $o] :
! [X1: $i,X2: $i,X3: $i] :
( ( ( X0 @ X1 @ X3 )
& ( X0 @ X1 @ X2 ) )
=> ( ( X0 @ X3 @ X2 )
| ( X2 = X3 )
| ( X0 @ X2 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mweakly_connected) ).
thf(f28,axiom,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(f32,conjecture,
! [X0: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X1: $i > $o] :
( mforall_prop
@ ^ [X2: $i > $o] : ( mor @ ( mbox @ X0 @ ( mimplies @ ( mand @ X1 @ ( mbox @ X0 @ X1 ) ) @ X2 ) ) @ ( mbox @ X0 @ ( mimplies @ ( mand @ X2 @ ( mbox @ X0 @ X2 ) ) @ X1 ) ) ) ) ) )
=> ( mweakly_connected @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f33,negated_conjecture,
~ ! [X0: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X1: $i > $o] :
( mforall_prop
@ ^ [X2: $i > $o] : ( mor @ ( mbox @ X0 @ ( mimplies @ ( mand @ X1 @ ( mbox @ X0 @ X1 ) ) @ X2 ) ) @ ( mbox @ X0 @ ( mimplies @ ( mand @ X2 @ ( mbox @ X0 @ X2 ) ) @ X1 ) ) ) ) ) )
=> ( mweakly_connected @ X0 ) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
thf(f36,plain,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
inference(rectify,[],[f3]) ).
thf(f37,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f36]) ).
thf(f38,plain,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f39,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f38]) ).
thf(f40,plain,
( mand
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mnot @ ( mor @ ( mnot @ Y0 ) @ ( mnot @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f41,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f47,plain,
( mforall_prop
= ( ^ [X0: ( $i > $o ) > $i > $o,X1: $i] :
! [X2: $i > $o] : ( X0 @ X2 @ X1 ) ) ),
inference(rectify,[],[f11]) ).
thf(f48,plain,
( mforall_prop
= ( ^ [Y0: ( $i > $o ) > $i > $o,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f47]) ).
thf(f54,plain,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X1 @ X3 )
| ~ ( X0 @ X2 @ X3 ) ) ) ),
inference(rectify,[],[f16]) ).
thf(f55,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( Y0 @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f54]) ).
thf(f73,plain,
( mweakly_connected
= ( ^ [X0: $i > $i > $o] :
! [X1: $i,X2: $i,X3: $i] :
( ( ( X0 @ X1 @ X3 )
& ( X0 @ X1 @ X2 ) )
=> ( ( X0 @ X3 @ X2 )
| ( X2 = X3 )
| ( X0 @ X2 @ X3 ) ) ) ) ),
inference(rectify,[],[f26]) ).
thf(f74,plain,
( mweakly_connected
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( ( Y0 @ Y3 @ Y2 )
& ( Y0 @ Y3 @ Y1 ) )
=> ( ( Y0 @ Y2 @ Y1 )
| ( Y2 = Y1 )
| ( Y0 @ Y1 @ Y2 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f73]) ).
thf(f77,plain,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
inference(rectify,[],[f28]) ).
thf(f78,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f77]) ).
thf(f85,plain,
~ ! [X0: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X1: $i > $o] :
( mforall_prop
@ ^ [X2: $i > $o] : ( mor @ ( mbox @ X0 @ ( mimplies @ ( mand @ X1 @ ( mbox @ X0 @ X1 ) ) @ X2 ) ) @ ( mbox @ X0 @ ( mimplies @ ( mand @ X2 @ ( mbox @ X0 @ X2 ) ) @ X1 ) ) ) ) ) )
=> ( mweakly_connected @ X0 ) ),
inference(rectify,[],[f33]) ).
thf(f86,plain,
~ ! [X0: $i > $i > $o] :
( ( $true
= ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] :
( mforall_prop
@ ^ [Y1: $i > $o] : ( mor @ ( mbox @ X0 @ ( mimplies @ ( mand @ Y0 @ ( mbox @ X0 @ Y0 ) ) @ Y1 ) ) @ ( mbox @ X0 @ ( mimplies @ ( mand @ Y1 @ ( mbox @ X0 @ Y1 ) ) @ Y0 ) ) ) ) ) ) )
=> ( ( mweakly_connected @ X0 )
= $true ) ),
inference(fool_elimination,[],[f85]) ).
thf(f87,plain,
? [X0: $i > $i > $o] :
( ( ( mweakly_connected @ X0 )
!= $true )
& ( $true
= ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] :
( mforall_prop
@ ^ [Y1: $i > $o] : ( mor @ ( mbox @ X0 @ ( mimplies @ ( mand @ Y0 @ ( mbox @ X0 @ Y0 ) ) @ Y1 ) ) @ ( mbox @ X0 @ ( mimplies @ ( mand @ Y1 @ ( mbox @ X0 @ Y1 ) ) @ Y0 ) ) ) ) ) ) ) ),
inference(ennf_transformation,[],[f86]) ).
thf(f88,plain,
( ( $true
!= ( mweakly_connected @ sK0 ) )
& ( $true
= ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] :
( mforall_prop
@ ^ [Y1: $i > $o] : ( mor @ ( mbox @ sK0 @ ( mimplies @ ( mand @ Y0 @ ( mbox @ sK0 @ Y0 ) ) @ Y1 ) ) @ ( mbox @ sK0 @ ( mimplies @ ( mand @ Y1 @ ( mbox @ sK0 @ Y1 ) ) @ Y0 ) ) ) ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f87]) ).
thf(f91,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f37]) ).
thf(f92,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f39]) ).
thf(f93,plain,
( mand
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mnot @ ( mor @ ( mnot @ Y0 ) @ ( mnot @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f40]) ).
thf(f94,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(cnf_transformation,[],[f41]) ).
thf(f99,plain,
( mforall_prop
= ( ^ [Y0: ( $i > $o ) > $i > $o,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f48]) ).
thf(f104,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( Y0 @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f55]) ).
thf(f114,plain,
( mweakly_connected
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( ( Y0 @ Y3 @ Y2 )
& ( Y0 @ Y3 @ Y1 ) )
=> ( ( Y0 @ Y2 @ Y1 )
| ( Y2 = Y1 )
| ( Y0 @ Y1 @ Y2 ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f74]) ).
thf(f116,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f78]) ).
thf(f120,plain,
( $true
= ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] :
( mforall_prop
@ ^ [Y1: $i > $o] : ( mor @ ( mbox @ sK0 @ ( mimplies @ ( mand @ Y0 @ ( mbox @ sK0 @ Y0 ) ) @ Y1 ) ) @ ( mbox @ sK0 @ ( mimplies @ ( mand @ Y1 @ ( mbox @ sK0 @ Y1 ) ) @ Y0 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f88]) ).
thf(f121,plain,
( $true
!= ( mweakly_connected @ sK0 ) ),
inference(cnf_transformation,[],[f88]) ).
thf(f124,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,[],[f93,f91,f92,f91,f91]) ).
thf(f125,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,[],[f94,f92,f91]) ).
thf(f133,plain,
( $true
!= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( ( Y0 @ Y3 @ Y2 )
& ( Y0 @ Y3 @ Y1 ) )
=> ( ( Y0 @ Y2 @ Y1 )
| ( Y2 = Y1 )
| ( Y0 @ Y1 @ Y2 ) ) ) ) ) )
@ sK0 ) ),
inference(definition_unfolding,[],[f121,f114]) ).
thf(f134,plain,
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: ( $i > $o ) > $i > $o,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] : ( Y0 @ Y2 @ Y1 ) )
@ ^ [Y0: $i > $o] :
( ^ [Y1: ( $i > $o ) > $i > $o,Y2: $i] :
( !! @ ( $i > $o )
@ ^ [Y3: $i > $o] : ( Y1 @ Y3 @ Y2 ) )
@ ^ [Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ ( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ~ ( Y2 @ Y4 @ Y5 )
| ( Y3 @ Y5 ) ) )
@ sK0
@ ( ^ [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 )
@ ( ^ [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 ) ) )
@ Y0
@ ( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ~ ( Y2 @ Y4 @ Y5 )
| ( Y3 @ Y5 ) ) )
@ sK0
@ Y0 ) )
@ Y1 ) )
@ ( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ~ ( Y2 @ Y4 @ Y5 )
| ( Y3 @ Y5 ) ) )
@ sK0
@ ( ^ [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 )
@ ( ^ [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 ) ) )
@ Y1
@ ( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ~ ( Y2 @ Y4 @ Y5 )
| ( Y3 @ Y5 ) ) )
@ sK0
@ Y1 ) )
@ Y0 ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f120,f116,f99,f99,f92,f104,f125,f124,f104,f104,f125,f124,f104]) ).
thf(f135,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( sK0 @ Y0 @ Y3 )
| ~ ~ ( ~ ( Y1 @ Y3 )
| ~ ( !! @ $i
@ ^ [Y4: $i] :
( ~ ( sK0 @ Y3 @ Y4 )
| ( Y1 @ Y4 ) ) ) )
| ( Y2 @ Y3 ) ) )
| ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( sK0 @ Y0 @ Y3 )
| ~ ~ ( ~ ( Y2 @ Y3 )
| ~ ( !! @ $i
@ ^ [Y4: $i] :
( ~ ( sK0 @ Y3 @ Y4 )
| ( Y2 @ Y4 ) ) ) )
| ( Y1 @ Y3 ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f134]) ).
thf(f136,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( sK0 @ Y0 @ Y3 )
| ~ ~ ( ~ ( Y1 @ Y3 )
| ~ ( !! @ $i
@ ^ [Y4: $i] :
( ~ ( sK0 @ Y3 @ Y4 )
| ( Y1 @ Y4 ) ) ) )
| ( Y2 @ Y3 ) ) )
| ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( sK0 @ Y0 @ Y3 )
| ~ ~ ( ~ ( Y2 @ Y3 )
| ~ ( !! @ $i
@ ^ [Y4: $i] :
( ~ ( sK0 @ Y3 @ Y4 )
| ( Y2 @ Y4 ) ) ) )
| ( Y1 @ Y3 ) ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f135]) ).
thf(f137,plain,
! [X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( sK0 @ X1 @ Y2 )
| ~ ~ ( ~ ( Y0 @ Y2 )
| ~ ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( sK0 @ Y2 @ Y3 )
| ( Y0 @ Y3 ) ) ) )
| ( Y1 @ Y2 ) ) )
| ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( sK0 @ X1 @ Y2 )
| ~ ~ ( ~ ( Y1 @ Y2 )
| ~ ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( sK0 @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) ) )
| ( Y0 @ Y2 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f136]) ).
thf(f138,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( sK0 @ X1 @ Y2 )
| ~ ~ ( ~ ( Y0 @ Y2 )
| ~ ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( sK0 @ Y2 @ Y3 )
| ( Y0 @ Y3 ) ) ) )
| ( Y1 @ Y2 ) ) )
| ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( sK0 @ X1 @ Y2 )
| ~ ~ ( ~ ( Y1 @ Y2 )
| ~ ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( sK0 @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) ) )
| ( Y0 @ Y2 ) ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f137]) ).
thf(f139,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ X1 @ Y1 )
| ~ ~ ( ~ ( X2 @ Y1 )
| ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( sK0 @ Y1 @ Y2 )
| ( X2 @ Y2 ) ) ) )
| ( Y0 @ Y1 ) ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ X1 @ Y1 )
| ~ ~ ( ~ ( Y0 @ Y1 )
| ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( sK0 @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) )
| ( X2 @ Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f138]) ).
thf(f140,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ X1 @ Y1 )
| ~ ~ ( ~ ( X2 @ Y1 )
| ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( sK0 @ Y1 @ Y2 )
| ( X2 @ Y2 ) ) ) )
| ( Y0 @ Y1 ) ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ X1 @ Y1 )
| ~ ~ ( ~ ( Y0 @ Y1 )
| ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( sK0 @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) )
| ( X2 @ Y1 ) ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f139]) ).
thf(f141,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i] :
( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ~ ~ ( ~ ( X2 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ Y0 @ Y1 )
| ( X2 @ Y1 ) ) ) )
| ( X3 @ Y0 ) ) )
| ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ~ ~ ( ~ ( X3 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ Y0 @ Y1 )
| ( X3 @ Y1 ) ) ) )
| ( X2 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f140]) ).
thf(f142,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ~ ~ ( ~ ( X3 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ Y0 @ Y1 )
| ( X3 @ Y1 ) ) ) )
| ( X2 @ Y0 ) ) ) )
| ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ~ ~ ( ~ ( X2 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ Y0 @ Y1 )
| ( X2 @ Y1 ) ) ) )
| ( X3 @ Y0 ) ) ) ) ),
inference(or_proxy_clausification,[],[f141]) ).
thf(f143,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ~ ~ ( ~ ( X3 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ Y0 @ Y1 )
| ( X3 @ Y1 ) ) ) )
| ( X2 @ Y0 ) )
@ X4 ) )
| ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ~ ~ ( ~ ( X2 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ Y0 @ Y1 )
| ( X2 @ Y1 ) ) ) )
| ( X3 @ Y0 ) ) ) ) ),
inference(pi_proxy_clausification,[],[f142]) ).
thf(f144,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ~ ~ ( ~ ( X3 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ Y0 @ Y1 )
| ( X3 @ Y1 ) ) ) )
| ( X2 @ Y0 ) )
@ X4 ) )
| ( $true
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X1 @ Y0 )
| ~ ~ ( ~ ( X2 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( sK0 @ Y0 @ Y1 )
| ( X2 @ Y1 ) ) ) )
| ( X3 @ Y0 ) )
@ X5 ) ) ),
inference(pi_proxy_clausification,[],[f143]) ).
thf(f145,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( ~ ( sK0 @ X1 @ X4 )
| ~ ~ ( ~ ( X3 @ X4 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) ) ) )
| ( X2 @ X4 ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X5 )
| ~ ~ ( ~ ( X2 @ X5 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) )
| ( X3 @ X5 ) ) ) ),
inference(beta-eta_normalization,[],[f144]) ).
thf(f146,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( ~ ~ ( ~ ( X3 @ X4 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) ) ) )
| ( X2 @ X4 ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X5 )
| ~ ~ ( ~ ( X2 @ X5 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) )
| ( X3 @ X5 ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X4 ) ) ) ),
inference(or_proxy_clausification,[],[f145]) ).
thf(f147,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X5 )
| ~ ~ ( ~ ( X2 @ X5 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) )
| ( X3 @ X5 ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X4 ) ) )
| ( $true
= ( ~ ~ ( ~ ( X3 @ X4 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f146]) ).
thf(f148,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( ~ ~ ( ~ ( X2 @ X5 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) )
| ( X3 @ X5 ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X4 ) ) )
| ( $true
= ( ~ ~ ( ~ ( X3 @ X4 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) ) ) ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X5 ) ) ) ),
inference(or_proxy_clausification,[],[f147]) ).
thf(f149,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X4 ) ) )
| ( $true
= ( ~ ~ ( ~ ( X3 @ X4 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) ) ) ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X5 ) ) )
| ( $true
= ( ~ ~ ( ~ ( X2 @ X5 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f148]) ).
thf(f150,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $true
= ( ~ ~ ( ~ ( X3 @ X4 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) ) ) ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X5 ) ) )
| ( $true
= ( ~ ~ ( ~ ( X2 @ X5 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) ) ) ) ),
inference(not_proxy_clausification,[],[f149]) ).
thf(f151,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $false
= ( ~ ( ~ ( X3 @ X4 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) ) ) ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X5 ) ) )
| ( $true
= ( ~ ~ ( ~ ( X2 @ X5 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) ) ) ) ),
inference(not_proxy_clausification,[],[f150]) ).
thf(f152,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $true
= ( ~ ( X3 @ X4 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) ) ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X5 ) ) )
| ( $true
= ( ~ ~ ( ~ ( X2 @ X5 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) ) ) ) ),
inference(not_proxy_clausification,[],[f151]) ).
thf(f153,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) ) ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X5 ) ) )
| ( $true
= ( ~ ~ ( ~ ( X2 @ X5 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) ) ) )
| ( $true
= ( ~ ( X3 @ X4 ) ) ) ),
inference(or_proxy_clausification,[],[f152]) ).
thf(f154,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X5 ) ) )
| ( $true
= ( ~ ~ ( ~ ( X2 @ X5 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) ) ) )
| ( $true
= ( ~ ( X3 @ X4 ) ) ) ),
inference(not_proxy_clausification,[],[f153]) ).
thf(f155,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) )
@ ( sK1 @ X3 @ X4 ) ) )
| ( $true
= ( ~ ( sK0 @ X1 @ X5 ) ) )
| ( $true
= ( ~ ~ ( ~ ( X2 @ X5 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) ) ) )
| ( $true
= ( ~ ( X3 @ X4 ) ) ) ),
inference(sigma_proxy_clausification,[],[f154]) ).
thf(f156,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) )
@ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $true
= ( ~ ~ ( ~ ( X2 @ X5 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) ) ) )
| ( $true
= ( ~ ( X3 @ X4 ) ) ) ),
inference(not_proxy_clausification,[],[f155]) ).
thf(f157,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) )
@ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $false
= ( ~ ( ~ ( X2 @ X5 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) ) ) )
| ( $true
= ( ~ ( X3 @ X4 ) ) ) ),
inference(not_proxy_clausification,[],[f156]) ).
thf(f158,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) )
@ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $true
= ( ~ ( X2 @ X5 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) ) )
| ( $true
= ( ~ ( X3 @ X4 ) ) ) ),
inference(not_proxy_clausification,[],[f157]) ).
thf(f159,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) )
@ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) ) )
| ( $true
= ( ~ ( X3 @ X4 ) ) )
| ( $true
= ( ~ ( X2 @ X5 ) ) ) ),
inference(or_proxy_clausification,[],[f158]) ).
thf(f160,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) )
@ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) ) ) )
| ( $true
= ( ~ ( X3 @ X4 ) ) )
| ( $true
= ( ~ ( X2 @ X5 ) ) ) ),
inference(not_proxy_clausification,[],[f159]) ).
thf(f161,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) )
@ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) )
@ ( sK2 @ X5 @ X2 ) ) )
| ( $true
= ( ~ ( X3 @ X4 ) ) )
| ( $true
= ( ~ ( X2 @ X5 ) ) ) ),
inference(sigma_proxy_clausification,[],[f160]) ).
thf(f162,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) )
@ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) )
@ ( sK2 @ X5 @ X2 ) ) )
| ( $false
= ( X3 @ X4 ) )
| ( $true
= ( ~ ( X2 @ X5 ) ) ) ),
inference(not_proxy_clausification,[],[f161]) ).
thf(f163,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X4 @ Y0 )
| ( X3 @ Y0 ) )
@ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( sK0 @ X5 @ Y0 )
| ( X2 @ Y0 ) )
@ ( sK2 @ X5 @ X2 ) ) )
| ( $false
= ( X3 @ X4 ) )
| ( $false
= ( X2 @ X5 ) ) ),
inference(not_proxy_clausification,[],[f162]) ).
thf(f164,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $false
= ( ~ ( sK0 @ X4 @ ( sK1 @ X3 @ X4 ) )
| ( X3 @ ( sK1 @ X3 @ X4 ) ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $false
= ( ~ ( sK0 @ X5 @ ( sK2 @ X5 @ X2 ) )
| ( X2 @ ( sK2 @ X5 @ X2 ) ) ) )
| ( $false
= ( X3 @ X4 ) )
| ( $false
= ( X2 @ X5 ) ) ),
inference(beta-eta_normalization,[],[f163]) ).
thf(f165,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $false
= ( X3 @ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $false
= ( ~ ( sK0 @ X5 @ ( sK2 @ X5 @ X2 ) )
| ( X2 @ ( sK2 @ X5 @ X2 ) ) ) )
| ( $false
= ( X3 @ X4 ) )
| ( $false
= ( X2 @ X5 ) ) ),
inference(or_proxy_clausification,[],[f164]) ).
thf(f166,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $false
= ( ~ ( sK0 @ X4 @ ( sK1 @ X3 @ X4 ) ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $false
= ( ~ ( sK0 @ X5 @ ( sK2 @ X5 @ X2 ) )
| ( X2 @ ( sK2 @ X5 @ X2 ) ) ) )
| ( $false
= ( X3 @ X4 ) )
| ( $false
= ( X2 @ X5 ) ) ),
inference(or_proxy_clausification,[],[f164]) ).
thf(f167,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $true
= ( sK0 @ X4 @ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $false
= ( ~ ( sK0 @ X5 @ ( sK2 @ X5 @ X2 ) )
| ( X2 @ ( sK2 @ X5 @ X2 ) ) ) )
| ( $false
= ( X3 @ X4 ) )
| ( $false
= ( X2 @ X5 ) ) ),
inference(not_proxy_clausification,[],[f166]) ).
thf(f168,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( sK0 @ X4 @ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( X2 @ ( sK2 @ X5 @ X2 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $true
= ( X2 @ X4 ) )
| ( $false
= ( X3 @ X4 ) )
| ( $false
= ( X2 @ X5 ) ) ),
inference(or_proxy_clausification,[],[f167]) ).
thf(f169,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $true
= ( sK0 @ X4 @ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $false
= ( ~ ( sK0 @ X5 @ ( sK2 @ X5 @ X2 ) ) ) )
| ( $false
= ( X3 @ X4 ) )
| ( $false
= ( X2 @ X5 ) ) ),
inference(or_proxy_clausification,[],[f167]) ).
thf(f170,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( sK0 @ X5 @ ( sK2 @ X5 @ X2 ) ) )
| ( $true
= ( sK0 @ X4 @ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $true
= ( X2 @ X4 ) )
| ( $false
= ( X3 @ X4 ) )
| ( $false
= ( X2 @ X5 ) ) ),
inference(not_proxy_clausification,[],[f169]) ).
thf(f171,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $false
= ( X2 @ ( sK2 @ X5 @ X2 ) ) )
| ( $false
= ( X3 @ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $true
= ( X2 @ X4 ) )
| ( $false
= ( X3 @ X4 ) )
| ( $false
= ( X2 @ X5 ) ) ),
inference(or_proxy_clausification,[],[f165]) ).
thf(f172,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( X2 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $false
= ( X3 @ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $false
= ( ~ ( sK0 @ X5 @ ( sK2 @ X5 @ X2 ) ) ) )
| ( $false
= ( X3 @ X4 ) )
| ( $false
= ( X2 @ X5 ) ) ),
inference(or_proxy_clausification,[],[f165]) ).
thf(f173,plain,
! [X2: $i > $o,X3: $i > $o,X1: $i,X4: $i,X5: $i] :
( ( $true
= ( sK0 @ X5 @ ( sK2 @ X5 @ X2 ) ) )
| ( $false
= ( X3 @ ( sK1 @ X3 @ X4 ) ) )
| ( $false
= ( sK0 @ X1 @ X5 ) )
| ( $false
= ( sK0 @ X1 @ X4 ) )
| ( $true
= ( X3 @ X5 ) )
| ( $true
= ( X2 @ X4 ) )
| ( $false
= ( X3 @ X4 ) )
| ( $false
= ( X2 @ X5 ) ) ),
inference(not_proxy_clausification,[],[f172]) ).
thf(f174,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( ( sK0 @ Y2 @ Y1 )
& ( sK0 @ Y2 @ Y0 ) )
=> ( ( sK0 @ Y1 @ Y0 )
| ( Y1 = Y0 )
| ( sK0 @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f133]) ).
thf(f175,plain,
( $false
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( ( sK0 @ Y2 @ Y1 )
& ( sK0 @ Y2 @ Y0 ) )
=> ( ( sK0 @ Y1 @ Y0 )
| ( Y1 = Y0 )
| ( sK0 @ Y0 @ Y1 ) ) ) ) )
@ sK3 ) ),
inference(sigma_proxy_clausification,[],[f174]) ).
thf(f176,plain,
( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( ( sK0 @ Y1 @ Y0 )
& ( sK0 @ Y1 @ sK3 ) )
=> ( ( sK0 @ Y0 @ sK3 )
| ( Y0 = sK3 )
| ( sK0 @ sK3 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f175]) ).
thf(f177,plain,
( $false
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( ( sK0 @ Y1 @ Y0 )
& ( sK0 @ Y1 @ sK3 ) )
=> ( ( sK0 @ Y0 @ sK3 )
| ( Y0 = sK3 )
| ( sK0 @ sK3 @ Y0 ) ) ) )
@ sK4 ) ),
inference(sigma_proxy_clausification,[],[f176]) ).
thf(f178,plain,
( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( ( sK0 @ Y0 @ sK4 )
& ( sK0 @ Y0 @ sK3 ) )
=> ( ( sK0 @ sK4 @ sK3 )
| ( sK4 = sK3 )
| ( sK0 @ sK3 @ sK4 ) ) ) ) ),
inference(beta-eta_normalization,[],[f177]) ).
thf(f179,plain,
( $false
= ( ^ [Y0: $i] :
( ( ( sK0 @ Y0 @ sK4 )
& ( sK0 @ Y0 @ sK3 ) )
=> ( ( sK0 @ sK4 @ sK3 )
| ( sK4 = sK3 )
| ( sK0 @ sK3 @ sK4 ) ) )
@ sK5 ) ),
inference(sigma_proxy_clausification,[],[f178]) ).
thf(f180,plain,
( $false
= ( ( ( sK0 @ sK5 @ sK4 )
& ( sK0 @ sK5 @ sK3 ) )
=> ( ( sK0 @ sK4 @ sK3 )
| ( sK4 = sK3 )
| ( sK0 @ sK3 @ sK4 ) ) ) ),
inference(beta-eta_normalization,[],[f179]) ).
thf(f181,plain,
( $false
= ( ( sK0 @ sK4 @ sK3 )
| ( sK4 = sK3 )
| ( sK0 @ sK3 @ sK4 ) ) ),
inference(imp_proxy_clausification,[],[f180]) ).
thf(f182,plain,
( $true
= ( ( sK0 @ sK5 @ sK4 )
& ( sK0 @ sK5 @ sK3 ) ) ),
inference(imp_proxy_clausification,[],[f180]) ).
thf(f183,plain,
( $true
= ( sK0 @ sK5 @ sK3 ) ),
inference(and_proxy_clausification,[],[f182]) ).
thf(f184,plain,
( $true
= ( sK0 @ sK5 @ sK4 ) ),
inference(and_proxy_clausification,[],[f182]) ).
thf(f185,plain,
( $false
= ( sK0 @ sK3 @ sK4 ) ),
inference(or_proxy_clausification,[],[f181]) ).
thf(f186,plain,
( $false
= ( ( sK0 @ sK4 @ sK3 )
| ( sK4 = sK3 ) ) ),
inference(or_proxy_clausification,[],[f181]) ).
thf(f187,plain,
( $false
= ( sK4 = sK3 ) ),
inference(or_proxy_clausification,[],[f186]) ).
thf(f188,plain,
( $false
= ( sK0 @ sK4 @ sK3 ) ),
inference(or_proxy_clausification,[],[f186]) ).
thf(f189,plain,
sK3 != sK4,
inference(equality_proxy_clausification,[],[f187]) ).
thf(f264,plain,
! [X2: $i > $o,X0: $i > $o,X1: $i] :
( ( $true = $false )
| ( $false
= ( X0 @ ( sK2 @ X1 @ X0 ) ) )
| ( $false
= ( X2 @ ( sK1 @ X2 @ sK3 ) ) )
| ( $false
= ( sK0 @ sK5 @ X1 ) )
| ( $true
= ( X2 @ X1 ) )
| ( $true
= ( X0 @ sK3 ) )
| ( $false
= ( X2 @ sK3 ) )
| ( ( X0 @ X1 )
= $false ) ),
inference(constrained_superposition,[],[f183,f171]) ).
thf(f523,plain,
! [X2: $i > $o,X0: $i > $o,X1: $i] :
( ( $false
= ( X0 @ ( sK2 @ X1 @ X0 ) ) )
| ( $false
= ( X2 @ ( sK1 @ X2 @ sK3 ) ) )
| ( $false
= ( sK0 @ sK5 @ X1 ) )
| ( $true
= ( X2 @ X1 ) )
| ( $true
= ( X0 @ sK3 ) )
| ( $false
= ( X2 @ sK3 ) )
| ( ( X0 @ X1 )
= $false ) ),
inference(trivial_inequality_removal,[],[f264]) ).
thf(f2259,plain,
! [X0: $i > $o,X1: $i > $o] :
( ( $true = $false )
| ( $false
= ( X0 @ ( sK2 @ sK4 @ X0 ) ) )
| ( $false
= ( X1 @ ( sK1 @ X1 @ sK3 ) ) )
| ( $true
= ( X1 @ sK4 ) )
| ( $true
= ( X0 @ sK3 ) )
| ( $false
= ( X1 @ sK3 ) )
| ( $false
= ( X0 @ sK4 ) ) ),
inference(constrained_superposition,[],[f184,f523]) ).
thf(f2597,plain,
! [X0: $i > $o,X1: $i > $o] :
( ( $false
= ( X0 @ ( sK2 @ sK4 @ X0 ) ) )
| ( $false
= ( X1 @ ( sK1 @ X1 @ sK3 ) ) )
| ( $true
= ( X1 @ sK4 ) )
| ( $true
= ( X0 @ sK3 ) )
| ( $false
= ( X1 @ sK3 ) )
| ( $false
= ( X0 @ sK4 ) ) ),
inference(trivial_inequality_removal,[],[f2259]) ).
thf(f2942,definition,
( spl6_5
<=> ! [X1: $i > $o] :
( ( $false
= ( X1 @ ( sK1 @ X1 @ sK3 ) ) )
| ( $false
= ( X1 @ sK3 ) )
| ( $true
= ( X1 @ sK4 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
thf(f2943,plain,
( ! [X1: $i > $o] :
( ( $false
= ( X1 @ ( sK1 @ X1 @ sK3 ) ) )
| ( $true
= ( X1 @ sK4 ) )
| ( $false
= ( X1 @ sK3 ) ) )
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f2942]) ).
thf(f2945,definition,
( spl6_6
<=> ! [X0: $i > $o] :
( ( $false
= ( X0 @ ( sK2 @ sK4 @ X0 ) ) )
| ( $false
= ( X0 @ sK4 ) )
| ( $true
= ( X0 @ sK3 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
thf(f2946,plain,
( ! [X0: $i > $o] :
( ( $false
= ( X0 @ ( sK2 @ sK4 @ X0 ) ) )
| ( $false
= ( X0 @ sK4 ) )
| ( $true
= ( X0 @ sK3 ) ) )
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f2945]) ).
thf(f2947,plain,
( spl6_5
| spl6_6 ),
inference(avatar_split_clause,[],[f2597,f2945,f2942]) ).
thf(f2948,plain,
( ( sK4
= ( sK1
@ ^ [Y0: $i] : ( Y0 != sK4 )
@ sK3 ) )
| ( $false
= ( ^ [Y0: $i] : ( Y0 != sK4 )
@ sK3 ) )
| ~ spl6_5 ),
inference(leibniz_equality_elimination,[],[f2943]) ).
thf(f3243,plain,
( ( sK4
= ( sK1
@ ^ [Y0: $i] : ( Y0 != sK4 )
@ sK3 ) )
| ( $false
= ( sK3 != sK4 ) )
| ~ spl6_5 ),
inference(beta-eta_normalization,[],[f2948]) ).
thf(f3244,plain,
( ( sK4
= ( sK1
@ ^ [Y0: $i] : ( Y0 != sK4 )
@ sK3 ) )
| ( $true
= ( sK3 = sK4 ) )
| ~ spl6_5 ),
inference(not_proxy_clausification,[],[f3243]) ).
thf(f3245,plain,
( ( sK4
= ( sK1
@ ^ [Y0: $i] : ( Y0 != sK4 )
@ sK3 ) )
| ( sK3 = sK4 )
| ~ spl6_5 ),
inference(equality_proxy_clausification,[],[f3244]) ).
thf(f3254,plain,
( ( sK4
= ( sK1
@ ^ [Y0: $i] : ( Y0 != sK4 )
@ sK3 ) )
| ~ spl6_5 ),
inference(forward_subsumption_resolution,[],[f3245,f189]) ).
thf(f4121,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( sK0 @ sK3 @ sK4 ) )
| ( $false
= ( X0 @ ( sK2 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $false
= ( sK0 @ X2 @ sK3 ) )
| ( $true
= ( ^ [Y0: $i] : ( Y0 != sK4 )
@ X1 ) )
| ( $true
= ( X0 @ sK3 ) )
| ( $false
= ( ^ [Y0: $i] : ( Y0 != sK4 )
@ sK3 ) )
| ( ( X0 @ X1 )
= $false ) )
| ~ spl6_5 ),
inference(constrained_superposition,[],[f168,f3254]) ).
thf(f5458,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( sK0 @ sK3 @ sK4 ) )
| ( $false
= ( X0 @ ( sK2 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $false
= ( sK0 @ X2 @ sK3 ) )
| ( $true
= ( X1 != sK4 ) )
| ( $true
= ( X0 @ sK3 ) )
| ( $false
= ( sK3 != sK4 ) )
| ( ( X0 @ X1 )
= $false ) )
| ~ spl6_5 ),
inference(beta-eta_normalization,[],[f4121]) ).
thf(f5459,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( sK0 @ sK3 @ sK4 ) )
| ( $false
= ( X0 @ ( sK2 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $false
= ( sK0 @ X2 @ sK3 ) )
| ( $false
= ( X1 = sK4 ) )
| ( $true
= ( X0 @ sK3 ) )
| ( $false
= ( sK3 != sK4 ) )
| ( ( X0 @ X1 )
= $false ) )
| ~ spl6_5 ),
inference(not_proxy_clausification,[],[f5458]) ).
thf(f5460,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( sK0 @ sK3 @ sK4 ) )
| ( $false
= ( X0 @ ( sK2 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $false
= ( sK0 @ X2 @ sK3 ) )
| ( sK4 != X1 )
| ( $true
= ( X0 @ sK3 ) )
| ( $false
= ( sK3 != sK4 ) )
| ( ( X0 @ X1 )
= $false ) )
| ~ spl6_5 ),
inference(equality_proxy_clausification,[],[f5459]) ).
thf(f5461,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( sK0 @ sK3 @ sK4 ) )
| ( $false
= ( X0 @ ( sK2 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $false
= ( sK0 @ X2 @ sK3 ) )
| ( sK4 != X1 )
| ( $true
= ( X0 @ sK3 ) )
| ( $true
= ( sK3 = sK4 ) )
| ( ( X0 @ X1 )
= $false ) )
| ~ spl6_5 ),
inference(not_proxy_clausification,[],[f5460]) ).
thf(f5462,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( sK0 @ sK3 @ sK4 ) )
| ( $false
= ( X0 @ ( sK2 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $false
= ( sK0 @ X2 @ sK3 ) )
| ( sK4 != X1 )
| ( $true
= ( X0 @ sK3 ) )
| ( sK3 = sK4 )
| ( ( X0 @ X1 )
= $false ) )
| ~ spl6_5 ),
inference(equality_proxy_clausification,[],[f5461]) ).
thf(f5537,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( sK0 @ sK3 @ sK4 ) )
| ( $false
= ( X0 @ ( sK2 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $false
= ( sK0 @ X2 @ sK3 ) )
| ( sK4 != X1 )
| ( $true
= ( X0 @ sK3 ) )
| ( ( X0 @ X1 )
= $false ) )
| ~ spl6_5 ),
inference(forward_subsumption_resolution,[],[f5462,f189]) ).
thf(f5540,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true = $false )
| ( $false
= ( X0 @ ( sK2 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $false
= ( sK0 @ X2 @ sK3 ) )
| ( sK4 != X1 )
| ( $true
= ( X0 @ sK3 ) )
| ( ( X0 @ X1 )
= $false ) )
| ~ spl6_5 ),
inference(forward_demodulation,[],[f5537,f185]) ).
thf(f5541,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( sK4 != X1 )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $false
= ( sK0 @ X2 @ sK3 ) )
| ( $false
= ( X0 @ ( sK2 @ X1 @ X0 ) ) )
| ( $true
= ( X0 @ sK3 ) )
| ( ( X0 @ X1 )
= $false ) )
| ~ spl6_5 ),
inference(trivial_inequality_removal,[],[f5540]) ).
thf(f5703,plain,
( ! [X0: $i,X1: $i > $o] :
( ( $false
= ( sK0 @ X0 @ sK4 ) )
| ( $false
= ( sK0 @ X0 @ sK3 ) )
| ( $false
= ( X1 @ ( sK2 @ sK4 @ X1 ) ) )
| ( $true
= ( X1 @ sK3 ) )
| ( $false
= ( X1 @ sK4 ) ) )
| ~ spl6_5 ),
inference(equality_resolution,[],[f5541]) ).
thf(f5708,definition,
( spl6_7
<=> ! [X0: $i] :
( ( $false
= ( sK0 @ X0 @ sK4 ) )
| ( $false
= ( sK0 @ X0 @ sK3 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition]) ).
thf(f5709,plain,
( ! [X0: $i] :
( ( $false
= ( sK0 @ X0 @ sK4 ) )
| ( $false
= ( sK0 @ X0 @ sK3 ) ) )
| ~ spl6_7 ),
inference(avatar_component_clause,[],[f5708]) ).
thf(f5710,plain,
( spl6_6
| spl6_7
| ~ spl6_5 ),
inference(avatar_split_clause,[],[f5703,f2942,f5708,f2945]) ).
thf(f5711,plain,
( ( sK3
= ( sK2 @ sK4
@ ^ [Y0: $i] : ( Y0 != sK3 ) ) )
| ( $false
= ( ^ [Y0: $i] : ( Y0 != sK3 )
@ sK4 ) )
| ~ spl6_6 ),
inference(leibniz_equality_elimination,[],[f2946]) ).
thf(f5916,plain,
( ( sK3
= ( sK2 @ sK4
@ ^ [Y0: $i] : ( Y0 != sK3 ) ) )
| ( $false
= ( sK4 != sK3 ) )
| ~ spl6_6 ),
inference(beta-eta_normalization,[],[f5711]) ).
thf(f5917,plain,
( ( sK3
= ( sK2 @ sK4
@ ^ [Y0: $i] : ( Y0 != sK3 ) ) )
| ( $true
= ( sK4 = sK3 ) )
| ~ spl6_6 ),
inference(not_proxy_clausification,[],[f5916]) ).
thf(f5918,plain,
( ( sK3
= ( sK2 @ sK4
@ ^ [Y0: $i] : ( Y0 != sK3 ) ) )
| ( sK3 = sK4 )
| ~ spl6_6 ),
inference(equality_proxy_clausification,[],[f5917]) ).
thf(f5924,plain,
( ( sK3
= ( sK2 @ sK4
@ ^ [Y0: $i] : ( Y0 != sK3 ) ) )
| ~ spl6_6 ),
inference(forward_subsumption_resolution,[],[f5918,f189]) ).
thf(f10157,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( $false
= ( X0 @ ( sK1 @ X0 @ X1 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $true
= ( X0 @ sK4 ) )
| ( $true
= ( ^ [Y0: $i] : ( Y0 != sK3 )
@ X1 ) )
| ( ( X0 @ X1 )
= $false )
| ( $false
= ( ^ [Y0: $i] : ( Y0 != sK3 )
@ sK4 ) ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f173,f5924]) ).
thf(f11862,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( $false
= ( X0 @ ( sK1 @ X0 @ X1 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $true
= ( X0 @ sK4 ) )
| ( $true
= ( X1 != sK3 ) )
| ( ( X0 @ X1 )
= $false )
| ( $false
= ( sK4 != sK3 ) ) )
| ~ spl6_6 ),
inference(beta-eta_normalization,[],[f10157]) ).
thf(f11863,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( $false
= ( X0 @ ( sK1 @ X0 @ X1 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $true
= ( X0 @ sK4 ) )
| ( $false
= ( X1 = sK3 ) )
| ( ( X0 @ X1 )
= $false )
| ( $false
= ( sK4 != sK3 ) ) )
| ~ spl6_6 ),
inference(not_proxy_clausification,[],[f11862]) ).
thf(f11864,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( $false
= ( X0 @ ( sK1 @ X0 @ X1 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $true
= ( X0 @ sK4 ) )
| ( sK3 != X1 )
| ( ( X0 @ X1 )
= $false )
| ( $false
= ( sK4 != sK3 ) ) )
| ~ spl6_6 ),
inference(equality_proxy_clausification,[],[f11863]) ).
thf(f11865,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( $false
= ( X0 @ ( sK1 @ X0 @ X1 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $true
= ( X0 @ sK4 ) )
| ( sK3 != X1 )
| ( ( X0 @ X1 )
= $false )
| ( $true
= ( sK4 = sK3 ) ) )
| ~ spl6_6 ),
inference(not_proxy_clausification,[],[f11864]) ).
thf(f11866,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( $false
= ( X0 @ ( sK1 @ X0 @ X1 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $true
= ( X0 @ sK4 ) )
| ( sK3 != X1 )
| ( ( X0 @ X1 )
= $false )
| ( sK3 = sK4 ) )
| ~ spl6_6 ),
inference(equality_proxy_clausification,[],[f11865]) ).
thf(f11945,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( $false
= ( X0 @ ( sK1 @ X0 @ X1 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $true
= ( X0 @ sK4 ) )
| ( sK3 != X1 )
| ( ( X0 @ X1 )
= $false ) )
| ~ spl6_6 ),
inference(forward_subsumption_resolution,[],[f11866,f189]) ).
thf(f11950,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true = $false )
| ( $false
= ( X0 @ ( sK1 @ X0 @ X1 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $true
= ( X0 @ sK4 ) )
| ( sK3 != X1 )
| ( ( X0 @ X1 )
= $false ) )
| ~ spl6_6 ),
inference(forward_demodulation,[],[f11945,f188]) ).
thf(f11951,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( sK3 != X1 )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $true
= ( X0 @ sK4 ) )
| ( $false
= ( X0 @ ( sK1 @ X0 @ X1 ) ) )
| ( ( X0 @ X1 )
= $false ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f11950]) ).
thf(f11957,plain,
( ! [X0: $i,X1: $i > $o] :
( ( $false
= ( sK0 @ X0 @ sK4 ) )
| ( $false
= ( sK0 @ X0 @ sK3 ) )
| ( $true
= ( X1 @ sK4 ) )
| ( $false
= ( X1 @ ( sK1 @ X1 @ sK3 ) ) )
| ( $false
= ( X1 @ sK3 ) ) )
| ~ spl6_6 ),
inference(equality_resolution,[],[f11951]) ).
thf(f15962,plain,
( ! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( $true
= ( sK0 @ X0 @ ( sK1 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X0 ) )
| ( $true
= ( X1 @ sK4 ) )
| ( $true
= ( ^ [Y0: $i] : ( Y0 != sK3 )
@ X0 ) )
| ( $false
= ( X1 @ X0 ) )
| ( $false
= ( ^ [Y0: $i] : ( Y0 != sK3 )
@ sK4 ) ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f170,f5924]) ).
thf(f18368,plain,
( ! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( $true
= ( sK0 @ X0 @ ( sK1 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X0 ) )
| ( $true
= ( X1 @ sK4 ) )
| ( $true
= ( X0 != sK3 ) )
| ( $false
= ( X1 @ X0 ) )
| ( $false
= ( sK4 != sK3 ) ) )
| ~ spl6_6 ),
inference(beta-eta_normalization,[],[f15962]) ).
thf(f18369,plain,
( ! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( $true
= ( sK0 @ X0 @ ( sK1 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X0 ) )
| ( $true
= ( X1 @ sK4 ) )
| ( $false
= ( X0 = sK3 ) )
| ( $false
= ( X1 @ X0 ) )
| ( $false
= ( sK4 != sK3 ) ) )
| ~ spl6_6 ),
inference(not_proxy_clausification,[],[f18368]) ).
thf(f18370,plain,
( ! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( $true
= ( sK0 @ X0 @ ( sK1 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X0 ) )
| ( $true
= ( X1 @ sK4 ) )
| ( sK3 != X0 )
| ( $false
= ( X1 @ X0 ) )
| ( $false
= ( sK4 != sK3 ) ) )
| ~ spl6_6 ),
inference(equality_proxy_clausification,[],[f18369]) ).
thf(f18371,plain,
( ! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( $true
= ( sK0 @ X0 @ ( sK1 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X0 ) )
| ( $true
= ( X1 @ sK4 ) )
| ( sK3 != X0 )
| ( $false
= ( X1 @ X0 ) )
| ( $true
= ( sK4 = sK3 ) ) )
| ~ spl6_6 ),
inference(not_proxy_clausification,[],[f18370]) ).
thf(f18372,plain,
( ! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( $true
= ( sK0 @ X0 @ ( sK1 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X0 ) )
| ( $true
= ( X1 @ sK4 ) )
| ( sK3 != X0 )
| ( $false
= ( X1 @ X0 ) )
| ( sK3 = sK4 ) )
| ~ spl6_6 ),
inference(equality_proxy_clausification,[],[f18371]) ).
thf(f18451,plain,
( ! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true
= ( sK0 @ sK4 @ sK3 ) )
| ( $true
= ( sK0 @ X0 @ ( sK1 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X0 ) )
| ( $true
= ( X1 @ sK4 ) )
| ( sK3 != X0 )
| ( $false
= ( X1 @ X0 ) ) )
| ~ spl6_6 ),
inference(forward_subsumption_resolution,[],[f18372,f189]) ).
thf(f18464,plain,
( ! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true = $false )
| ( $true
= ( sK0 @ X0 @ ( sK1 @ X1 @ X0 ) ) )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X0 ) )
| ( $true
= ( X1 @ sK4 ) )
| ( sK3 != X0 )
| ( $false
= ( X1 @ X0 ) ) )
| ~ spl6_6 ),
inference(forward_demodulation,[],[f18451,f188]) ).
thf(f18465,plain,
( ! [X2: $i,X0: $i,X1: $i > $o] :
( ( sK3 != X0 )
| ( $false
= ( sK0 @ X2 @ sK4 ) )
| ( $false
= ( sK0 @ X2 @ X0 ) )
| ( $true
= ( X1 @ sK4 ) )
| ( $true
= ( sK0 @ X0 @ ( sK1 @ X1 @ X0 ) ) )
| ( $false
= ( X1 @ X0 ) ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f18464]) ).
thf(f18472,plain,
( ! [X0: $i,X1: $i > $o] :
( ( $false
= ( sK0 @ X0 @ sK4 ) )
| ( $false
= ( sK0 @ X0 @ sK3 ) )
| ( $true
= ( X1 @ sK4 ) )
| ( $true
= ( sK0 @ sK3 @ ( sK1 @ X1 @ sK3 ) ) )
| ( $false
= ( X1 @ sK3 ) ) )
| ~ spl6_6 ),
inference(equality_resolution,[],[f18465]) ).
thf(f18687,definition,
( spl6_10
<=> ! [X1: $i > $o] :
( ( $true
= ( X1 @ sK4 ) )
| ( $false
= ( X1 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 @ ( sK1 @ X1 @ sK3 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl6_10])],[avatar_definition]) ).
thf(f18688,plain,
( ! [X1: $i > $o] :
( ( $true
= ( sK0 @ sK3 @ ( sK1 @ X1 @ sK3 ) ) )
| ( $true
= ( X1 @ sK4 ) )
| ( $false
= ( X1 @ sK3 ) ) )
| ~ spl6_10 ),
inference(avatar_component_clause,[],[f18687]) ).
thf(f18689,plain,
( spl6_10
| spl6_7
| ~ spl6_6 ),
inference(avatar_split_clause,[],[f18472,f2945,f5708,f18687]) ).
thf(f18691,plain,
( ( sK3 = sK4 )
| ( $true
= ( sK0 @ sK3
@ ( sK1
@ ^ [Y0: $i] : ( Y0 != sK4 )
@ sK3 ) ) )
| ~ spl6_10 ),
inference(leibniz_equality_elimination,[],[f18688]) ).
thf(f19383,plain,
( ( $true
= ( sK0 @ sK3
@ ( sK1
@ ^ [Y0: $i] : ( Y0 != sK4 )
@ sK3 ) ) )
| ~ spl6_10 ),
inference(forward_subsumption_resolution,[],[f18691,f189]) ).
thf(f19390,plain,
( ( $true
= ( sK0 @ sK3 @ sK4 ) )
| ~ spl6_5
| ~ spl6_10 ),
inference(forward_demodulation,[],[f19383,f3254]) ).
thf(f19391,plain,
( ( $true = $false )
| ~ spl6_5
| ~ spl6_10 ),
inference(forward_demodulation,[],[f19390,f185]) ).
thf(f19392,plain,
( $false
| ~ spl6_5
| ~ spl6_10 ),
inference(trivial_inequality_removal,[],[f19391]) ).
thf(f19393,plain,
( ~ spl6_5
| ~ spl6_10 ),
inference(avatar_contradiction_clause,[],[f19392]) ).
thf(f19428,plain,
( ( $true = $false )
| ( $false
= ( sK0 @ sK5 @ sK3 ) )
| ~ spl6_7 ),
inference(constrained_superposition,[],[f184,f5709]) ).
thf(f19610,plain,
( ( $false
= ( sK0 @ sK5 @ sK3 ) )
| ~ spl6_7 ),
inference(trivial_inequality_removal,[],[f19428]) ).
thf(f19677,plain,
( ( $true = $false )
| ~ spl6_7 ),
inference(constrained_superposition,[],[f19610,f183]) ).
thf(f19959,plain,
( $false
| ~ spl6_7 ),
inference(trivial_inequality_removal,[],[f19677]) ).
thf(f19960,plain,
~ spl6_7,
inference(avatar_contradiction_clause,[],[f19959]) ).
thf(f22301,plain,
( spl6_5
| spl6_7
| ~ spl6_6 ),
inference(avatar_split_clause,[],[f11957,f2945,f5708,f2942]) ).
cnf(s3,plain,
( spl6_5
| spl6_6 ),
inference(sat_conversion,[],[f2947]) ).
cnf(s4,plain,
( ~ spl6_5
| spl6_6
| spl6_7 ),
inference(sat_conversion,[],[f5710]) ).
cnf(s8,plain,
( ~ spl6_6
| spl6_7
| spl6_10 ),
inference(sat_conversion,[],[f18689]) ).
cnf(s11,plain,
( ~ spl6_5
| ~ spl6_10 ),
inference(sat_conversion,[],[f19393]) ).
cnf(s13,plain,
~ spl6_7,
inference(sat_conversion,[],[f19960]) ).
cnf(s14,plain,
( spl6_5
| ~ spl6_6
| spl6_7 ),
inference(sat_conversion,[],[f22301]) ).
cnf(s15,plain,
( ~ spl6_6
| spl6_10 ),
inference(rat,[],[s8,s13]) ).
cnf(s18,plain,
( ~ spl6_5
| spl6_6 ),
inference(rat,[],[s4,s13]) ).
cnf(s20,plain,
spl6_5,
inference(rat,[],[s3,s14,s13]) ).
cnf(s21,plain,
~ spl6_10,
inference(rat,[],[s11,s20]) ).
cnf(s22,plain,
spl6_6,
inference(rat,[],[s18,s20]) ).
cnf(s23,plain,
$false,
inference(rat,[],[s15,s21,s22]) ).
thf(f22302,plain,
$false,
inference(avatar_sat_refutation,[],[s23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL717^1 : TPTP v9.3.1. Bugfixed v5.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n009.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 09:53:31 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.45/0.86 % (3781112)Will run a generic schedule for satisfiability detection.
% 3.45/0.86 % (3781120)dis+10_1_sil=32000:sp=arity:random_seed=3205696294:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.45/0.86 % (3781118)% WARNING: option uhcvi not known.
% 3.45/0.86 % (3781117)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=750985033_2999 on theBenchmark for (2999ds/0Mi)
% 3.45/0.86 % (3781118)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4078035384:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.45/0.86 % (3781119)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2497998001:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.45/0.86 % (3781121)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3737070750:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.45/0.86 % (3781122)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1382548199:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.45/0.86 % (3781123)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2012207814:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.45/0.86 % (3781118)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.45/0.86 % (3781121)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.45/0.86 % Exception at run slice level
% 3.45/0.86 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.45/0.86 % (3781118)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.45/0.86 % (3781120)Instruction limit reached!
% 3.45/0.86 % (3781120)------------------------------
% 3.45/0.86 % (3781120)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.45/0.86 % (3781120)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/0.86 % (3781120)CaDiCaL version: 2.1.3
% 3.45/0.86 % (3781120)Termination reason: Instruction limit
% 3.45/0.86 % (3781120)Termination phase: Saturation
% 3.45/0.86 % (3781120)Time elapsed: 0.025 s
% 3.45/0.86 % (3781120)Peak memory usage: 12 MB
% 3.45/0.86 % (3781120)Instructions burned: 105 (million)
% 3.45/0.86 % (3781131)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1531345427:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.45/0.86 % Exception at run slice level
% 3.45/0.86 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.45/0.86 % (3781132)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3462674753:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 3.45/0.86 % (3781134)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=4162504239:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 3.45/0.86 % (3781134)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.45/0.86 % (3781134)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.45/0.86 % (3781121)Instruction limit reached!
% 3.45/0.86 % (3781121)------------------------------
% 3.45/0.86 % (3781121)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.45/0.86 % (3781121)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/0.86 % (3781121)CaDiCaL version: 2.1.3
% 3.45/0.86 % (3781121)Termination reason: Instruction limit
% 3.45/0.86 % (3781121)Termination phase: Saturation
% 3.45/0.86 % (3781121)Time elapsed: 0.052 s
% 3.45/0.86 % (3781121)Peak memory usage: 12 MB
% 3.45/0.86 % (3781121)Instructions burned: 118 (million)
% 3.45/0.86 % (3781122)Instruction limit reached!
% 3.45/0.86 % (3781122)------------------------------
% 3.45/0.86 % (3781122)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.45/0.86 % (3781122)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/0.86 % (3781122)CaDiCaL version: 2.1.3
% 3.45/0.86 % (3781122)Termination reason: Instruction limit
% 3.45/0.86 % (3781122)Termination phase: Saturation
% 3.45/0.86 % (3781122)Time elapsed: 0.058 s
% 3.45/0.86 % (3781122)Peak memory usage: 12 MB
% 3.45/0.86 % (3781122)Instructions burned: 132 (million)
% 3.45/0.86 % (3781132)Instruction limit reached!
% 3.45/0.86 % (3781132)------------------------------
% 3.45/0.86 % (3781132)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.69/2.37 % (3781132)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.69/2.37 % (3781132)CaDiCaL version: 2.1.3
% 14.69/2.37 % (3781132)Termination reason: Instruction limit
% 14.69/2.37 % (3781132)Termination phase: Saturation
% 14.69/2.37 % (3781132)Time elapsed: 0.032 s
% 14.69/2.37 % (3781132)Peak memory usage: 12 MB
% 14.69/2.37 % (3781132)Instructions burned: 133 (million)
% 14.69/2.37 % (3781139)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=928326877:fmbsr=1.3:i=865:ins=25_2999 on theBenchmark for (2999ds/865Mi)
% 14.69/2.37 % (3781137)ott-21_1_sil=16000:fs=off:random_seed=1859054714:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 14.69/2.37 % Exception at run slice level
% 14.69/2.37 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.69/2.37 % (3781123)Instruction limit reached!
% 14.69/2.37 % (3781123)------------------------------
% 14.69/2.37 % (3781123)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.69/2.37 % (3781123)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.69/2.37 % (3781123)CaDiCaL version: 2.1.3
% 14.69/2.37 % (3781123)Termination reason: Instruction limit
% 14.69/2.37 % (3781123)Termination phase: Saturation
% 14.69/2.37 % (3781123)Time elapsed: 0.073 s
% 14.69/2.37 % (3781123)Peak memory usage: 13 MB
% 14.69/2.37 % (3781123)Instructions burned: 160 (million)
% 14.69/2.37 % (3781138)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1256609667:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 14.69/2.37 % (3781142)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=8606220:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 14.69/2.37 % (3781143)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2962143539:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 14.69/2.37 % Exception at run slice level
% 14.69/2.37 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.69/2.37 % (3781147)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=2856174198:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2998 on theBenchmark for (2998ds/692Mi)
% 14.69/2.37 % (3781147)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 14.69/2.37 % (3781137)Instruction limit reached!
% 14.69/2.37 % (3781137)------------------------------
% 14.69/2.37 % (3781137)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.69/2.37 % (3781137)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.69/2.37 % (3781137)CaDiCaL version: 2.1.3
% 14.69/2.37 % (3781137)Termination reason: Instruction limit
% 14.69/2.37 % (3781137)Termination phase: Saturation
% 14.69/2.37 % (3781137)Time elapsed: 0.080 s
% 14.69/2.37 % (3781137)Peak memory usage: 12 MB
% 14.69/2.37 % (3781137)Instructions burned: 181 (million)
% 14.69/2.37 % (3781149)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3434378055:i=879:kws=inv_precedence:fsr=off_2998 on theBenchmark for (2998ds/879Mi)
% 14.69/2.37 % (3781149)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 14.69/2.37 % (3781138)Instruction limit reached!
% 14.69/2.37 % (3781138)------------------------------
% 14.69/2.37 % (3781138)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.69/2.38 % (3781138)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.69/2.38 % (3781138)CaDiCaL version: 2.1.3
% 14.69/2.38 % (3781138)Termination reason: Instruction limit
% 14.69/2.38 % (3781138)Termination phase: Saturation
% 14.69/2.38 % (3781138)Time elapsed: 0.212 s
% 14.69/2.38 % (3781138)Peak memory usage: 13 MB
% 14.69/2.38 % (3781138)Instructions burned: 479 (million)
% 14.69/2.38 % (3781151)fmb+10_1_sil=64000:random_seed=3213677141:i=22061:nm=2:gsp=on_2996 on theBenchmark for (2996ds/22061Mi)
% 14.69/2.38 % (3781151)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 14.69/2.38 % Exception at run slice level
% 14.69/2.38 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 14.69/2.38 % (3781153)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2961123126:i=9515:nm=5_2996 on theBenchmark for (2996ds/9515Mi)
% 14.69/2.38 % (3781134)Instruction limit reached!
% 14.69/2.38 % (3781134)------------------------------
% 14.69/2.38 % (3781134)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.07/3.28 % (3781134)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.07/3.28 % (3781134)CaDiCaL version: 2.1.3
% 21.07/3.28 % (3781134)Termination reason: Instruction limit
% 21.07/3.28 % (3781134)Termination phase: Saturation
% 21.07/3.28 % (3781134)Time elapsed: 0.290 s
% 21.07/3.28 % (3781134)Peak memory usage: 13 MB
% 21.07/3.28 % (3781134)Instructions burned: 685 (million)
% 21.07/3.28 % Exception at run slice level
% 21.07/3.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 21.07/3.28 % (3781142)Instruction limit reached!
% 21.07/3.28 % (3781142)------------------------------
% 21.07/3.28 % (3781142)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.07/3.28 % (3781142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.07/3.28 % (3781142)CaDiCaL version: 2.1.3
% 21.07/3.28 % (3781142)Termination reason: Instruction limit
% 21.07/3.28 % (3781142)Termination phase: Saturation
% 21.07/3.28 % (3781142)Time elapsed: 0.270 s
% 21.07/3.28 % (3781142)Peak memory usage: 14 MB
% 21.07/3.28 % (3781142)Instructions burned: 1181 (million)
% 21.07/3.28 % (3781155)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2508065154:fmbsr=1.7:i=920_2996 on theBenchmark for (2996ds/920Mi)
% 21.07/3.28 % (3781156)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3073906639:i=5131_2996 on theBenchmark for (2996ds/5131Mi)
% 21.07/3.28 % (3781156)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 21.07/3.28 % Exception at run slice level
% 21.07/3.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 21.07/3.28 % (3781157)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=1794051938:i=1472:ins=7:fdi=8:gsp=on_2996 on theBenchmark for (2996ds/1472Mi)
% 21.07/3.28 % (3781157)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 21.07/3.28 % (3781157)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 21.07/3.28 % (3781160)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1605003367:i=6324_2996 on theBenchmark for (2996ds/6324Mi)
% 21.07/3.28 % Exception at run slice level
% 21.07/3.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 21.07/3.28 % (3781163)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=3100624324:fmbsr=2.30978:i=2174_2995 on theBenchmark for (2995ds/2174Mi)
% 21.07/3.28 % Exception at run slice level
% 21.07/3.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 21.07/3.28 % (3781147)Instruction limit reached!
% 21.07/3.28 % (3781147)------------------------------
% 21.07/3.28 % (3781147)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.07/3.28 % (3781147)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.07/3.28 % (3781147)CaDiCaL version: 2.1.3
% 21.07/3.28 % (3781147)Termination reason: Instruction limit
% 21.07/3.28 % (3781147)Termination phase: Saturation
% 21.07/3.28 % (3781147)Time elapsed: 0.305 s
% 21.07/3.28 % (3781147)Peak memory usage: 15 MB
% 21.07/3.28 % (3781147)Instructions burned: 693 (million)
% 21.07/3.28 % (3781165)ott-2_1_sil=16000:newcnf=on:random_seed=4203888877:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2995 on theBenchmark for (2995ds/869Mi)
% 21.07/3.28 % (3781165)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 21.07/3.28 % (3781167)ott+10_1_sil=32000:tgt=ground:random_seed=1327564642:i=5114:av=off_2995 on theBenchmark for (2995ds/5114Mi)
% 21.07/3.28 % (3781149)Instruction limit reached!
% 21.07/3.28 % (3781149)------------------------------
% 21.07/3.28 % (3781149)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.07/3.28 % (3781149)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.07/3.28 % (3781149)CaDiCaL version: 2.1.3
% 21.07/3.28 % (3781149)Termination reason: Instruction limit
% 21.07/3.28 % (3781149)Termination phase: Saturation
% 21.07/3.28 % (3781149)Time elapsed: 0.408 s
% 21.07/3.28 % (3781149)Peak memory usage: 14 MB
% 21.07/3.28 % (3781149)Instructions burned: 880 (million)
% 21.07/3.28 % (3781169)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=2146645428:i=54282_2993 on theBenchmark for (2993ds/54282Mi)
% 21.07/3.28 % Exception at run slice level
% 21.07/3.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 21.07/3.28 % (3781171)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=604752795:i=3512:aac=none_2993 on theBenchmark for (2993ds/3512Mi)
% 21.07/3.28 % (3781171)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 21.07/3.28 % (3781157)Instruction limit reached!
% 21.07/3.28 % (3781157)------------------------------
% 21.07/3.28 % (3781157)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.07/3.28 % (3781157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.07/3.28 % (3781157)CaDiCaL version: 2.1.3
% 21.07/3.28 % (3781157)Termination reason: Instruction limit
% 21.07/3.28 % (3781157)Termination phase: Saturation
% 21.07/3.28 % (3781157)Time elapsed: 0.374 s
% 21.07/3.28 % (3781157)Peak memory usage: 19 MB
% 21.07/3.28 % (3781157)Instructions burned: 1472 (million)
% 21.07/3.28 % (3781173)dis+21_1_sil=32000:sas=cadical:random_seed=802355399:i=3773:amm=off_2992 on theBenchmark for (2992ds/3773Mi)
% 21.07/3.28 % (3781165)Instruction limit reached!
% 21.07/3.28 % (3781165)------------------------------
% 21.07/3.28 % (3781165)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.07/3.28 % (3781165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.07/3.28 % (3781165)CaDiCaL version: 2.1.3
% 21.07/3.28 % (3781165)Termination reason: Instruction limit
% 21.07/3.28 % (3781165)Termination phase: Saturation
% 21.07/3.28 % (3781165)Time elapsed: 0.379 s
% 21.07/3.28 % (3781165)Peak memory usage: 15 MB
% 21.07/3.28 % (3781165)Instructions burned: 871 (million)
% 21.07/3.28 % (3781175)ott+11_1_sil=16000:gs=on:random_seed=3168032734:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2991 on theBenchmark for (2991ds/2251Mi)
% 21.07/3.28 % (3781175)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 21.07/3.28 % (3781173)Instruction limit reached!
% 21.07/3.28 % (3781173)------------------------------
% 21.07/3.28 % (3781173)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.07/3.28 % (3781173)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.07/3.28 % (3781173)CaDiCaL version: 2.1.3
% 21.07/3.28 % (3781173)Termination reason: Instruction limit
% 21.07/3.28 % (3781173)Termination phase: Saturation
% 21.07/3.28 % (3781173)Time elapsed: 0.841 s
% 21.07/3.28 % (3781173)Peak memory usage: 16 MB
% 21.07/3.28 % (3781173)Instructions burned: 3773 (million)
% 21.07/3.28 % (3781177)fmb+10_1_fmbas=predicate:sil=64000:tgt=ground:fmbss=7:random_seed=1234670739:fmbsr=1.6:i=67534_2983 on theBenchmark for (2983ds/67534Mi)
% 21.07/3.28 % Exception at run slice level
% 21.07/3.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 21.07/3.28 % (3781179)ott-22_32_sil=16000:tgt=full:fdtod=off:sp=weighted_frequency:rnwc=on:alpa=false:random_seed=545659901:avsq=on:i=4591:add=off:avsqr=1,16:kws=inv_arity:nm=10:ins=9:fdi=4_2983 on theBenchmark for (2983ds/4591Mi)
% 21.07/3.28 % (3781175)Instruction limit reached!
% 21.07/3.28 % (3781175)------------------------------
% 21.07/3.28 % (3781175)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.07/3.28 % (3781175)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.07/3.28 % (3781175)CaDiCaL version: 2.1.3
% 21.07/3.28 % (3781175)Termination reason: Instruction limit
% 21.07/3.28 % (3781175)Termination phase: Saturation
% 21.07/3.28 % (3781175)Time elapsed: 0.914 s
% 21.07/3.28 % (3781175)Peak memory usage: 15 MB
% 21.07/3.28 % (3781175)Instructions burned: 2253 (million)
% 21.07/3.28 % (3781181)dis+10_64_to=lpo:sil=32000:spb=intro:urr=on:sac=on:random_seed=1875465419:i=29340_2982 on theBenchmark for (2982ds/29340Mi)
% 21.07/3.28 % (3781171)Instruction limit reached!
% 21.07/3.28 % (3781171)------------------------------
% 21.07/3.28 % (3781171)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.07/3.28 % (3781171)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.07/3.28 % (3781171)CaDiCaL version: 2.1.3
% 21.07/3.28 % (3781171)Termination reason: Instruction limit
% 21.07/3.28 % (3781171)Termination phase: Saturation
% 21.07/3.28 % (3781171)Time elapsed: 1.475 s
% 21.07/3.28 % (3781171)Peak memory usage: 16 MB
% 21.07/3.28 % (3781171)Instructions burned: 3512 (million)
% 21.07/3.28 % (3781183)dis-10_1_sil=64000:sas=cadical:cn=on:random_seed=3249784991:i=5211_2978 on theBenchmark for (2978ds/5211Mi)
% 21.07/3.28 % (3781156)Instruction limit reached!
% 21.07/3.28 % (3781156)------------------------------
% 21.07/3.28 % (3781156)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.07/3.28 % (3781156)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.07/3.28 % (3781156)CaDiCaL version: 2.1.3
% 21.07/3.28 % (3781156)Termination reason: Instruction limit
% 21.07/3.28 % (3781156)Termination phase: Saturation
% 21.07/3.28 % (3781156)Time elapsed: 2.123 s
% 21.07/3.28 % (3781156)Peak memory usage: 17 MB
% 21.07/3.28 % (3781156)Instructions burned: 5132 (million)
% 21.07/3.28 % (3781185)fmb+10_1_sil=32000:sas=cadical:bce=on:fmbss=17:random_seed=1060013988:i=5497:nm=2_2974 on theBenchmark for (2974ds/5497Mi)
% 21.07/3.28 % Exception at run slice level
% 21.07/3.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 21.07/3.28 % (3781187)fmb+10_1_fmbas=predicate:sil=64000:tgt=full:sas=cadical:fmbss=15:random_seed=3235218068:fmbsr=2:i=46332_2974 on theBenchmark for (2974ds/46332Mi)
% 21.07/3.28 % Exception at run slice level
% 21.07/3.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 21.07/3.28 % (3781189)fmb+10_1_sil=128000:tgt=full:sas=cadical:fmbss=12:random_seed=2041409337:i=14071_2974 on theBenchmark for (2974ds/14071Mi)
% 21.07/3.28 % Exception at run slice level
% 21.07/3.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 21.07/3.28 % (3781191)dis+10_161_sil=128000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1331609918:i=22565:add=on:rawr=on_2974 on theBenchmark for (2974ds/22565Mi)
% 21.07/3.28 % (3781167)Instruction limit reached!
% 21.07/3.28 % (3781167)------------------------------
% 21.07/3.28 % (3781167)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.07/3.28 % (3781167)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.07/3.28 % (3781167)CaDiCaL version: 2.1.3
% 21.07/3.28 % (3781167)Termination reason: Instruction limit
% 21.07/3.28 % (3781167)Termination phase: Saturation
% 21.07/3.28 % (3781167)Time elapsed: 2.206 s
% 21.07/3.28 % (3781167)Peak memory usage: 23 MB
% 21.07/3.28 % (3781167)Instructions burned: 5116 (million)
% 21.07/3.28 % (3781193)ott+4_1_sil=16000:sp=arity:gs=on:random_seed=3458667587:i=8173:av=off_2973 on theBenchmark for (2973ds/8173Mi)
% 21.07/3.28 % (3781179)Instruction limit reached!
% 21.07/3.28 % (3781179)------------------------------
% 21.07/3.28 % (3781179)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.07/3.28 % (3781179)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.07/3.28 % (3781179)CaDiCaL version: 2.1.3
% 21.07/3.28 % (3781179)Termination reason: Instruction limit
% 21.07/3.28 % (3781179)Termination phase: Saturation
% 21.07/3.28 % (3781179)Time elapsed: 1.045 s
% 21.07/3.28 % (3781179)Peak memory usage: 18 MB
% 21.07/3.28 % (3781179)Instructions burned: 4593 (million)
% 21.07/3.28 % (3781195)dis+10_16:1_sil=16000:random_seed=1385884513:i=9155:fsr=off_2972 on theBenchmark for (2972ds/9155Mi)
% 21.07/3.28 % (3781181) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3781112-3781181"...
% 21.07/3.28 % (3781181)...printing done.
% 21.07/3.28 % (3781181)Refutation found. Thanks to Tanya!
% 21.07/3.28 % SZS status Theorem for theBenchmark
% 21.07/3.28 % SZS output start Proof for theBenchmark
% See solution above
% 21.07/3.28 % (3781181)------------------------------
% 21.07/3.28 % (3781181)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 21.07/3.28 % (3781181)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.07/3.28 % (3781181)CaDiCaL version: 2.1.3
% 21.07/3.28 % (3781181)Termination reason: Refutation
% 21.07/3.28 % (3781181)Time elapsed: 1.259 s
% 21.07/3.28 % (3781181)Peak memory usage: 17 MB
% 21.07/3.28 % (3781181)Instructions burned: 2958 (million)
% 21.07/3.28 % (3781112)Success in time 3.056 s
% 21.07/3.28 % Vampire exiting
%------------------------------------------------------------------------------