%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO450^4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:47:44 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 11
% Syntax : Number of formulae : 128 ( 57 unt; 0 typ; 2 def)
% Number of atoms : 1009 ( 202 equ; 0 cnn)
% Maximal formula atoms : 17 ( 7 avg)
% Number of connectives : 1324 ( 240 ~; 229 |; 0 &; 789 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 88 ( 88 >; 0 *; 0 +; 0 <<)
% Number of symbols : 59 ( 55 usr; 6 con; 0-4 aty)
% ( 64 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 249 ( 0 sgn 57 !; 0 ?; 249 :)
% 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,
rel_b: $i > $i > $o ).
thf(func_def_33,type,
mbox_b: ( $i > $o ) > $i > $o ).
thf(func_def_34,type,
mdia_b: ( $i > $o ) > $i > $o ).
thf(func_def_35,type,
p: $i > $o ).
thf(func_def_36,type,
q: $i > $o ).
thf(func_def_37,type,
r: $i > $o ).
thf(func_def_38,type,
vOR: $o > $o > $o ).
thf(func_def_39,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_40,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_41,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_42,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_43,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_44,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_45,type,
vAND: $o > $o > $o ).
thf(func_def_46,type,
vIMP: $o > $o > $o ).
thf(func_def_47,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_48,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_49,type,
vNOT: $o > $o ).
thf(func_def_50,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_54,type,
sK1: $i > $i ).
thf(f3,axiom,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(f4,axiom,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mor) ).
thf(f6,axiom,
( mimplies
= ( ^ [X0: $i > $o,X1: $i > $o] : ( mor @ ( mnot @ X0 ) @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(f18,axiom,
( mreflexive
= ( ^ [X0: $i > $i > $o] :
! [X1: $i] : ( X0 @ X1 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mreflexive) ).
thf(f28,axiom,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(f32,axiom,
( mbox_b
= ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ( X0 @ X2 )
| ~ ( rel_b @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^4.ax',mbox_b) ).
thf(f33,axiom,
( ( ^ [X0: $i > $o] : ( mnot @ ( mbox_b @ ( mnot @ X0 ) ) ) )
= mdia_b ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^4.ax',mdia_b) ).
thf(f34,axiom,
mreflexive @ rel_b,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^4.ax',a1) ).
thf(f36,conjecture,
mvalid @ ( mimplies @ ( mbox_b @ ( mimplies @ p @ ( mdia_b @ ( mimplies @ q @ r ) ) ) ) @ ( mdia_b @ ( mimplies @ q @ ( mimplies @ ( mbox_b @ p ) @ ( mdia_b @ r ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
thf(f37,negated_conjecture,
~ ( mvalid @ ( mimplies @ ( mbox_b @ ( mimplies @ p @ ( mdia_b @ ( mimplies @ q @ r ) ) ) ) @ ( mdia_b @ ( mimplies @ q @ ( mimplies @ ( mbox_b @ p ) @ ( mdia_b @ r ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
thf(f38,plain,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f39,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f38]) ).
thf(f48,plain,
( mdia_b
= ( ^ [Y0: $i > $o] : ( mnot @ ( mbox_b @ ( mnot @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f33]) ).
thf(f53,plain,
( mreflexive
= ( ^ [X0: $i > $i > $o] :
! [X1: $i] : ( X0 @ X1 @ X1 ) ) ),
inference(rectify,[],[f18]) ).
thf(f54,plain,
( mreflexive
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f53]) ).
thf(f57,plain,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
inference(rectify,[],[f3]) ).
thf(f58,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f57]) ).
thf(f59,plain,
( mbox_b
= ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ( X0 @ X2 )
| ~ ( rel_b @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f32]) ).
thf(f60,plain,
( mbox_b
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f59]) ).
thf(f67,plain,
~ ( mvalid @ ( mimplies @ ( mbox_b @ ( mimplies @ p @ ( mdia_b @ ( mimplies @ q @ r ) ) ) ) @ ( mdia_b @ ( mimplies @ q @ ( mimplies @ ( mbox_b @ p ) @ ( mdia_b @ r ) ) ) ) ) ),
inference(rectify,[],[f37]) ).
thf(f68,plain,
( ( mvalid @ ( mimplies @ ( mbox_b @ ( mimplies @ p @ ( mdia_b @ ( mimplies @ q @ r ) ) ) ) @ ( mdia_b @ ( mimplies @ q @ ( mimplies @ ( mbox_b @ p ) @ ( mdia_b @ r ) ) ) ) ) )
!= $true ),
inference(fool_elimination,[],[f67]) ).
thf(f73,plain,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
inference(rectify,[],[f28]) ).
thf(f74,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f73]) ).
thf(f83,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f84,plain,
mreflexive @ rel_b,
inference(rectify,[],[f34]) ).
thf(f85,plain,
( ( mreflexive @ rel_b )
= $true ),
inference(fool_elimination,[],[f84]) ).
thf(f98,plain,
( ( mvalid @ ( mimplies @ ( mbox_b @ ( mimplies @ p @ ( mdia_b @ ( mimplies @ q @ r ) ) ) ) @ ( mdia_b @ ( mimplies @ q @ ( mimplies @ ( mbox_b @ p ) @ ( mdia_b @ r ) ) ) ) ) )
!= $true ),
inference(flattening,[],[f68]) ).
thf(f102,plain,
( mdia_b
= ( ^ [Y0: $i > $o] : ( mnot @ ( mbox_b @ ( mnot @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f48]) ).
thf(f103,plain,
( ( mreflexive @ rel_b )
= $true ),
inference(cnf_transformation,[],[f85]) ).
thf(f111,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f58]) ).
thf(f113,plain,
( mreflexive
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f54]) ).
thf(f115,plain,
( ( mvalid @ ( mimplies @ ( mbox_b @ ( mimplies @ p @ ( mdia_b @ ( mimplies @ q @ r ) ) ) ) @ ( mdia_b @ ( mimplies @ q @ ( mimplies @ ( mbox_b @ p ) @ ( mdia_b @ r ) ) ) ) ) )
!= $true ),
inference(cnf_transformation,[],[f98]) ).
thf(f123,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(cnf_transformation,[],[f83]) ).
thf(f124,plain,
( mbox_b
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f60]) ).
thf(f125,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f39]) ).
thf(f130,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f74]) ).
thf(f138,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y3 @ Y4 )
| ( Y2 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 ) ) ),
inference(definition_unfolding,[],[f123,f125,f111]) ).
thf(f146,plain,
( mdia_b
= ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( rel_b @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) )
@ ( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ Y0 ) ) ) ) ),
inference(definition_unfolding,[],[f102,f111,f124,f111]) ).
thf(f147,plain,
( ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 @ Y1 ) )
@ rel_b )
= $true ),
inference(definition_unfolding,[],[f103,f113]) ).
thf(f148,plain,
( ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y3 @ Y4 )
| ( Y2 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 )
@ ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y3 @ Y4 )
| ( Y2 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 )
@ p
@ ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( rel_b @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) )
@ ( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ Y0 ) ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y3 @ Y4 )
| ( Y2 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 )
@ q
@ r ) ) ) )
@ ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( rel_b @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) )
@ ( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ Y0 ) ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y3 @ Y4 )
| ( Y2 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 )
@ q
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y3 @ Y4 )
| ( Y2 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 )
@ ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) )
@ p )
@ ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( rel_b @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) )
@ ( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ Y0 ) ) )
@ r ) ) ) ) ) )
!= $true ),
inference(definition_unfolding,[],[f115,f130,f138,f124,f138,f146,f138,f146,f138,f138,f124,f146]) ).
thf(f156,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ~ ( r @ Y2 ) ) )
| ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ( p @ Y2 ) ) )
| ~ ( q @ Y1 ) ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ~ ( ( r @ Y2 )
| ~ ( q @ Y2 ) ) ) )
| ~ ( p @ Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f148]) ).
thf(f157,plain,
( ( ^ [Y0: $i] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ~ ( r @ Y2 ) ) )
| ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ( p @ Y2 ) ) )
| ~ ( q @ Y1 ) ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ~ ( ( r @ Y2 )
| ~ ( q @ Y2 ) ) ) )
| ~ ( p @ Y1 ) ) ) )
@ sK0 )
= $false ),
inference(sigma_proxy_clausification,[],[f156]) ).
thf(f158,plain,
( ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK0 @ Y0 )
| ~ ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( r @ Y1 ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ( p @ Y1 ) ) )
| ~ ( q @ Y0 ) ) ) )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK0 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( ( r @ Y1 )
| ~ ( q @ Y1 ) ) ) )
| ~ ( p @ Y0 ) ) ) )
= $false ),
inference(beta-eta_normalization,[],[f157]) ).
thf(f159,plain,
( ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK0 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( ( r @ Y1 )
| ~ ( q @ Y1 ) ) ) )
| ~ ( p @ Y0 ) ) ) )
= $false ),
inference(or_proxy_clausification,[],[f158]) ).
thf(f160,plain,
( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK0 @ Y0 )
| ~ ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( r @ Y1 ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ( p @ Y1 ) ) )
| ~ ( q @ Y0 ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f158]) ).
thf(f161,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK0 @ Y0 )
| ~ ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( r @ Y1 ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ( p @ Y1 ) ) )
| ~ ( q @ Y0 ) ) ) )
= $true ),
inference(not_proxy_clausification,[],[f160]) ).
thf(f162,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( ~ ( rel_b @ sK0 @ Y0 )
| ~ ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( r @ Y1 ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ( p @ Y1 ) ) )
| ~ ( q @ Y0 ) ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f161]) ).
thf(f163,plain,
! [X1: $i] :
( ( ~ ( rel_b @ sK0 @ X1 )
| ~ ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ~ ( r @ Y0 ) ) )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ( p @ Y0 ) ) )
| ~ ( q @ X1 ) ) )
= $true ),
inference(beta-eta_normalization,[],[f162]) ).
thf(f164,plain,
! [X1: $i] :
( ( ( ~ ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ~ ( r @ Y0 ) ) )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ( p @ Y0 ) ) )
| ~ ( q @ X1 ) ) )
= $true )
| ( $true
= ( ~ ( rel_b @ sK0 @ X1 ) ) ) ),
inference(or_proxy_clausification,[],[f163]) ).
thf(f165,plain,
! [X1: $i] :
( ( ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ~ ( r @ Y0 ) ) )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ( p @ Y0 ) ) )
| ~ ( q @ X1 ) )
= $false )
| ( $true
= ( ~ ( rel_b @ sK0 @ X1 ) ) ) ),
inference(not_proxy_clausification,[],[f164]) ).
thf(f166,plain,
! [X1: $i] :
( ( ( ~ ( q @ X1 ) )
= $false )
| ( $true
= ( ~ ( rel_b @ sK0 @ X1 ) ) ) ),
inference(or_proxy_clausification,[],[f165]) ).
thf(f167,plain,
! [X1: $i] :
( ( $true
= ( ~ ( rel_b @ sK0 @ X1 ) ) )
| ( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ~ ( r @ Y0 ) ) )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ( p @ Y0 ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f165]) ).
thf(f168,plain,
! [X1: $i] :
( ( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ~ ( r @ Y0 ) ) )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ( p @ Y0 ) ) ) ) )
| ( $false
= ( rel_b @ sK0 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f167]) ).
thf(f169,plain,
! [X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ( p @ Y0 ) ) ) )
= $false ) ),
inference(or_proxy_clausification,[],[f168]) ).
thf(f170,plain,
! [X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ~ ( r @ Y0 ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f168]) ).
thf(f171,plain,
! [X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ~ ( r @ Y0 ) ) )
= $true ) ),
inference(not_proxy_clausification,[],[f170]) ).
thf(f172,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( ( ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ~ ( r @ Y0 ) )
@ X2 )
= $true ) ),
inference(pi_proxy_clausification,[],[f171]) ).
thf(f173,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( ( ~ ( rel_b @ X1 @ X2 )
| ~ ( r @ X2 ) )
= $true ) ),
inference(beta-eta_normalization,[],[f172]) ).
thf(f174,plain,
! [X2: $i,X1: $i] :
( ( ( ~ ( r @ X2 ) )
= $true )
| ( ( ~ ( rel_b @ X1 @ X2 ) )
= $true )
| ( $false
= ( rel_b @ sK0 @ X1 ) ) ),
inference(or_proxy_clausification,[],[f173]) ).
thf(f175,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( ( r @ X2 )
= $false )
| ( ( ~ ( rel_b @ X1 @ X2 ) )
= $true ) ),
inference(not_proxy_clausification,[],[f174]) ).
thf(f176,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( ( rel_b @ X1 @ X2 )
= $false )
| ( ( r @ X2 )
= $false ) ),
inference(not_proxy_clausification,[],[f175]) ).
thf(f177,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ( p @ Y0 ) ) ) )
| ( $false
= ( rel_b @ sK0 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f169]) ).
thf(f178,plain,
! [X2: $i,X1: $i] :
( ( ( ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ( p @ Y0 ) )
@ X2 )
= $true )
| ( $false
= ( rel_b @ sK0 @ X1 ) ) ),
inference(pi_proxy_clausification,[],[f177]) ).
thf(f179,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ~ ( rel_b @ X1 @ X2 )
| ( p @ X2 ) ) )
| ( $false
= ( rel_b @ sK0 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f178]) ).
thf(f180,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( ( p @ X2 )
= $true )
| ( ( ~ ( rel_b @ X1 @ X2 ) )
= $true ) ),
inference(or_proxy_clausification,[],[f179]) ).
thf(f181,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( ( rel_b @ X1 @ X2 )
= $false )
| ( ( p @ X2 )
= $true ) ),
inference(not_proxy_clausification,[],[f180]) ).
thf(f182,plain,
! [X1: $i] :
( ( $true
= ( q @ X1 ) )
| ( $true
= ( ~ ( rel_b @ sK0 @ X1 ) ) ) ),
inference(not_proxy_clausification,[],[f166]) ).
thf(f183,plain,
! [X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( $true
= ( q @ X1 ) ) ),
inference(not_proxy_clausification,[],[f182]) ).
thf(f184,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK0 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( ( r @ Y1 )
| ~ ( q @ Y1 ) ) ) )
| ~ ( p @ Y0 ) ) )
= $true ),
inference(not_proxy_clausification,[],[f159]) ).
thf(f185,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( ~ ( rel_b @ sK0 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( ( r @ Y1 )
| ~ ( q @ Y1 ) ) ) )
| ~ ( p @ Y0 ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f184]) ).
thf(f186,plain,
! [X1: $i] :
( $true
= ( ~ ( rel_b @ sK0 @ X1 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ~ ( ( r @ Y0 )
| ~ ( q @ Y0 ) ) ) )
| ~ ( p @ X1 ) ) ),
inference(beta-eta_normalization,[],[f185]) ).
thf(f187,plain,
! [X1: $i] :
( ( $true
= ( ~ ( rel_b @ sK0 @ X1 ) ) )
| ( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ~ ( ( r @ Y0 )
| ~ ( q @ Y0 ) ) ) )
| ~ ( p @ X1 ) ) ) ),
inference(or_proxy_clausification,[],[f186]) ).
thf(f188,plain,
! [X1: $i] :
( ( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ~ ( ( r @ Y0 )
| ~ ( q @ Y0 ) ) ) )
| ~ ( p @ X1 ) ) )
| ( $false
= ( rel_b @ sK0 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f187]) ).
thf(f189,plain,
! [X1: $i] :
( ( ( ~ ( p @ X1 ) )
= $true )
| ( ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ~ ( ( r @ Y0 )
| ~ ( q @ Y0 ) ) ) ) )
= $true )
| ( $false
= ( rel_b @ sK0 @ X1 ) ) ),
inference(or_proxy_clausification,[],[f188]) ).
thf(f190,plain,
! [X1: $i] :
( ( ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ~ ( ( r @ Y0 )
| ~ ( q @ Y0 ) ) ) ) )
= $true )
| ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( ( p @ X1 )
= $false ) ),
inference(not_proxy_clausification,[],[f189]) ).
thf(f191,plain,
! [X1: $i] :
( ( ( p @ X1 )
= $false )
| ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ~ ( ( r @ Y0 )
| ~ ( q @ Y0 ) ) ) ) ) ),
inference(not_proxy_clausification,[],[f190]) ).
thf(f192,plain,
! [X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( rel_b @ X1 @ Y0 )
| ~ ( ( r @ Y0 )
| ~ ( q @ Y0 ) ) )
@ ( sK1 @ X1 ) ) )
| ( ( p @ X1 )
= $false ) ),
inference(sigma_proxy_clausification,[],[f191]) ).
thf(f193,plain,
! [X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( ( ~ ( rel_b @ X1 @ ( sK1 @ X1 ) )
| ~ ( ( r @ ( sK1 @ X1 ) )
| ~ ( q @ ( sK1 @ X1 ) ) ) )
= $false )
| ( ( p @ X1 )
= $false ) ),
inference(beta-eta_normalization,[],[f192]) ).
thf(f194,plain,
! [X1: $i] :
( ( ( p @ X1 )
= $false )
| ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( $false
= ( ~ ( ( r @ ( sK1 @ X1 ) )
| ~ ( q @ ( sK1 @ X1 ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f193]) ).
thf(f195,plain,
! [X1: $i] :
( ( ( ~ ( rel_b @ X1 @ ( sK1 @ X1 ) ) )
= $false )
| ( ( p @ X1 )
= $false )
| ( $false
= ( rel_b @ sK0 @ X1 ) ) ),
inference(or_proxy_clausification,[],[f193]) ).
thf(f196,plain,
! [X1: $i] :
( ( ( rel_b @ X1 @ ( sK1 @ X1 ) )
= $true )
| ( ( p @ X1 )
= $false )
| ( $false
= ( rel_b @ sK0 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f195]) ).
thf(f197,plain,
! [X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( $true
= ( ( r @ ( sK1 @ X1 ) )
| ~ ( q @ ( sK1 @ X1 ) ) ) )
| ( ( p @ X1 )
= $false ) ),
inference(not_proxy_clausification,[],[f194]) ).
thf(f198,plain,
! [X1: $i] :
( ( ( r @ ( sK1 @ X1 ) )
= $true )
| ( ( p @ X1 )
= $false )
| ( ( ~ ( q @ ( sK1 @ X1 ) ) )
= $true )
| ( $false
= ( rel_b @ sK0 @ X1 ) ) ),
inference(or_proxy_clausification,[],[f197]) ).
thf(f199,plain,
! [X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( ( p @ X1 )
= $false )
| ( $false
= ( q @ ( sK1 @ X1 ) ) )
| ( ( r @ ( sK1 @ X1 ) )
= $true ) ),
inference(not_proxy_clausification,[],[f198]) ).
thf(f200,plain,
( ( !! @ $i
@ ^ [Y0: $i] : ( rel_b @ Y0 @ Y0 ) )
= $true ),
inference(beta-eta_normalization,[],[f147]) ).
thf(f201,plain,
! [X1: $i] :
( ( ^ [Y0: $i] : ( rel_b @ Y0 @ Y0 )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f200]) ).
thf(f202,plain,
! [X1: $i] :
( ( rel_b @ X1 @ X1 )
= $true ),
inference(beta-eta_normalization,[],[f201]) ).
thf(f204,plain,
( ( ( p @ sK0 )
= $false )
| ( ( q @ ( sK1 @ sK0 ) )
= $true )
| ( $false = $true )
| ( ( rel_b @ sK0 @ sK0 )
= $false ) ),
inference(constrained_superposition,[],[f183,f196]) ).
thf(f206,plain,
( ( ( rel_b @ sK0 @ sK0 )
= $false )
| ( ( p @ sK0 )
= $false )
| ( ( q @ ( sK1 @ sK0 ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f204]) ).
thf(f209,plain,
( ( $false = $true )
| ( ( p @ sK0 )
= $false )
| ( ( q @ ( sK1 @ sK0 ) )
= $true ) ),
inference(forward_demodulation,[],[f206,f202]) ).
thf(f210,plain,
( ( ( q @ ( sK1 @ sK0 ) )
= $true )
| ( ( p @ sK0 )
= $false ) ),
inference(trivial_inequality_removal,[],[f209]) ).
thf(f212,definition,
( spl2_1
<=> ( ( q @ ( sK1 @ sK0 ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f214,plain,
( ( ( q @ ( sK1 @ sK0 ) )
= $true )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f212]) ).
thf(f216,definition,
( spl2_2
<=> ( ( p @ sK0 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f218,plain,
( ( ( p @ sK0 )
= $false )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f216]) ).
thf(f220,plain,
( spl2_2
| spl2_1 ),
inference(avatar_split_clause,[],[f210,f212,f216]) ).
thf(f221,plain,
! [X0: $i] :
( ( ( rel_b @ sK0 @ X0 )
= $false )
| ( ( r @ ( sK1 @ X0 ) )
= $false )
| ( $false = $true )
| ( ( rel_b @ sK0 @ X0 )
= $false )
| ( ( p @ X0 )
= $false ) ),
inference(constrained_superposition,[],[f176,f196]) ).
thf(f227,plain,
! [X0: $i] :
( ( ( rel_b @ sK0 @ X0 )
= $false )
| ( ( r @ ( sK1 @ X0 ) )
= $false )
| ( $false = $true )
| ( ( p @ X0 )
= $false ) ),
inference(duplicate_literal_removal,[],[f221]) ).
thf(f228,plain,
! [X0: $i] :
( ( ( rel_b @ sK0 @ X0 )
= $false )
| ( ( p @ X0 )
= $false )
| ( ( r @ ( sK1 @ X0 ) )
= $false ) ),
inference(trivial_inequality_removal,[],[f227]) ).
thf(f241,plain,
( ( ( rel_b @ sK0 @ sK0 )
= $false )
| ( ( p @ sK0 )
= $true )
| ( $false != $false ) ),
inference(equality_factoring,[],[f181]) ).
thf(f242,plain,
( ( $false != $false )
| ( ( p @ sK0 )
= $true )
| ( ( rel_b @ sK0 @ sK0 )
= $false ) ),
inference(equality_factoring,[],[f181]) ).
thf(f247,plain,
( ( ( rel_b @ sK0 @ sK0 )
= $false )
| ( ( p @ sK0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f241]) ).
thf(f248,plain,
( ( ( p @ sK0 )
= $true )
| ( ( rel_b @ sK0 @ sK0 )
= $false ) ),
inference(trivial_inequality_removal,[],[f242]) ).
thf(f249,plain,
( ( $false = $true )
| ( ( p @ sK0 )
= $true ) ),
inference(forward_demodulation,[],[f247,f202]) ).
thf(f250,plain,
( ( p @ sK0 )
= $true ),
inference(trivial_inequality_removal,[],[f249]) ).
thf(f251,plain,
( ( ( rel_b @ sK0 @ sK0 )
= $false )
| ( $false = $true )
| ~ spl2_2 ),
inference(forward_demodulation,[],[f248,f218]) ).
thf(f252,plain,
( ( ( rel_b @ sK0 @ sK0 )
= $false )
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f251]) ).
thf(f256,plain,
( ( $false = $true )
| ~ spl2_2 ),
inference(forward_demodulation,[],[f252,f202]) ).
thf(f257,plain,
( $false
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f256]) ).
thf(f258,plain,
~ spl2_2,
inference(avatar_contradiction_clause,[],[f257]) ).
thf(f289,plain,
( ( $false = $true )
| ( ( p @ sK0 )
= $false )
| ( ( r @ ( sK1 @ sK0 ) )
= $false ) ),
inference(constrained_superposition,[],[f202,f228]) ).
thf(f294,plain,
( ( ( p @ sK0 )
= $false )
| ( $false = $true )
| ( ( r @ ( sK1 @ sK0 ) )
= $true )
| ( $false
= ( q @ ( sK1 @ sK0 ) ) ) ),
inference(constrained_superposition,[],[f199,f202]) ).
thf(f305,plain,
( ( ( p @ sK0 )
= $false )
| ( ( r @ ( sK1 @ sK0 ) )
= $false ) ),
inference(trivial_inequality_removal,[],[f289]) ).
thf(f307,plain,
( ( $false
= ( q @ ( sK1 @ sK0 ) ) )
| ( ( r @ ( sK1 @ sK0 ) )
= $true )
| ( ( p @ sK0 )
= $false ) ),
inference(trivial_inequality_removal,[],[f294]) ).
thf(f320,plain,
( ( $false = $true )
| ( ( r @ ( sK1 @ sK0 ) )
= $false ) ),
inference(forward_demodulation,[],[f305,f250]) ).
thf(f321,plain,
( ( r @ ( sK1 @ sK0 ) )
= $false ),
inference(trivial_inequality_removal,[],[f320]) ).
thf(f322,plain,
( ( $false = $true )
| ( ( r @ ( sK1 @ sK0 ) )
= $true )
| ( ( p @ sK0 )
= $false )
| ~ spl2_1 ),
inference(forward_demodulation,[],[f307,f214]) ).
thf(f323,plain,
( ( ( p @ sK0 )
= $false )
| ( ( r @ ( sK1 @ sK0 ) )
= $true )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f322]) ).
thf(f332,plain,
( ( $false = $true )
| ( ( r @ ( sK1 @ sK0 ) )
= $true )
| ~ spl2_1 ),
inference(forward_demodulation,[],[f323,f250]) ).
thf(f333,plain,
( ( ( r @ ( sK1 @ sK0 ) )
= $true )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f332]) ).
thf(f343,plain,
( ( $false = $true )
| ~ spl2_1 ),
inference(forward_demodulation,[],[f333,f321]) ).
thf(f344,plain,
( $false
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f343]) ).
thf(f345,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f344]) ).
cnf(s2,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f220]) ).
cnf(s4,plain,
~ spl2_2,
inference(sat_conversion,[],[f258]) ).
cnf(s10,plain,
~ spl2_1,
inference(sat_conversion,[],[f345]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s2,s4,s10]) ).
thf(f346,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO450^4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n018.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 16:54:26 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 Running higher-order theorem proving
% 0.08/0.22 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.20/0.27 % (344932)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.27 % (344946)lrs+10_16_si=on:nwc=1.5:random_seed=3885858505:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.27 % (344951)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.20/0.27 % (344951)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.20/0.27 % (344946)Instruction limit reached!
% 0.20/0.27 % (344946)------------------------------
% 0.20/0.27 % (344946)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (344946)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (344946)CaDiCaL version: 2.1.3
% 0.20/0.27 % (344946)Termination reason: Instruction limit
% 0.20/0.27 % (344946)Termination phase: Saturation
% 0.20/0.27 % (344946)Time elapsed: 0.006 s
% 0.20/0.27 % (344946)Peak memory usage: 12 MB
% 0.20/0.27 % (344946)Instructions burned: 21 (million)
% 0.20/0.27 % (344945)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2839918034:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.27 % (344947)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2026830685:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.27 % (344949)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3188416541:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.27 % (344950)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=89610286:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.27 % (344948)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=2019212537: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.20/0.27 % (344951)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=759176765:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.27 % (344947)Instruction limit reached!
% 0.20/0.27 % (344947)------------------------------
% 0.20/0.27 % (344947)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (344947)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (344947)CaDiCaL version: 2.1.3
% 0.20/0.27 % (344947)Termination reason: Instruction limit
% 0.20/0.27 % (344947)Termination phase: Property scanning
% 0.20/0.27 % (344947)Time elapsed: 0.002 s
% 0.20/0.27 % (344947)Peak memory usage: 10 MB
% 0.20/0.27 % (344947)Instructions burned: 4 (million)
% 0.20/0.27 % (344957)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3674191017:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.20/0.27 % (344957)Instruction limit reached!
% 0.20/0.27 % (344957)------------------------------
% 0.20/0.27 % (344957)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (344957)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (344957)CaDiCaL version: 2.1.3
% 0.20/0.27 % (344957)Termination reason: Instruction limit
% 0.20/0.27 % (344957)Termination phase: Property scanning
% 0.20/0.27 % (344957)Time elapsed: 0.001 s
% 0.20/0.27 % (344957)Peak memory usage: 10 MB
% 0.20/0.27 % (344957)Instructions burned: 4 (million)
% 0.20/0.27 % (344945) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-344932-344945"...
% 0.20/0.27 % (344949)Instruction limit reached!
% 0.20/0.27 % (344949)------------------------------
% 0.20/0.27 % (344949)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (344949)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (344949)CaDiCaL version: 2.1.3
% 0.20/0.27 % (344949)Termination reason: Instruction limit
% 0.20/0.27 % (344949)Termination phase: Saturation
% 0.20/0.27 % (344949)Time elapsed: 0.014 s
% 0.20/0.27 % (344949)Peak memory usage: 11 MB
% 0.20/0.27 % (344949)Instructions burned: 25 (million)
% 0.20/0.27 % (344950) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-344932-344950"...
% 0.20/0.27 % (344951) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-344932-344951"...
% 0.20/0.27 % (344945)...printing done.
% 0.20/0.27 % (344945)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (344945)------------------------------
% 0.20/0.28 % (344945)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (344945)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (344945)CaDiCaL version: 2.1.3
% 0.20/0.28 % (344945)Termination reason: Refutation
% 0.20/0.28 % (344945)Time elapsed: 0.014 s
% 0.20/0.28 % (344945)Peak memory usage: 13 MB
% 0.20/0.28 % (344945)Instructions burned: 26 (million)
% 0.20/0.28 % (344932)Success in time 0.049 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------