%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO464^4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:47:56 AM UTC 2026
% Result : Theorem 0.21s 0.32s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 10
% Syntax : Number of formulae : 88 ( 70 unt; 0 typ; 0 def)
% Number of atoms : 560 ( 96 equ; 0 cnn)
% Maximal formula atoms : 13 ( 6 avg)
% Number of connectives : 917 ( 177 ~; 102 |; 0 &; 568 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 90 ( 90 >; 0 *; 0 +; 0 <<)
% Number of symbols : 57 ( 53 usr; 6 con; 0-4 aty)
% ( 60 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 220 ( 190 ^; 30 !; 0 ?; 220 :)
% 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,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_38,type,
vNOT: $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,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_44,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_45,type,
vOR: $o > $o > $o ).
thf(func_def_46,type,
db2:
!>[X0: $tType] : X0 ).
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,
vIMP: $o > $o > $o ).
thf(func_def_50,type,
vAND: $o > $o > $o ).
thf(func_def_51,type,
db4:
!>[X0: $tType] : X0 ).
thf(f3,axiom,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(f4,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) )
= mor ),
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,
( ( ^ [X0: $i > $o,X1: $i > $o] : ( mor @ ( mnot @ X0 ) @ X1 ) )
= mimplies ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(f19,axiom,
( ( ^ [X0: $i > $i > $o] :
! [X1: $i,X2: $i] :
( ( X0 @ X1 @ X2 )
=> ( X0 @ X2 @ X1 ) ) )
= msymmetric ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',msymmetric) ).
thf(f28,axiom,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(f32,axiom,
( ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ( X0 @ X2 )
| ~ ( rel_b @ X1 @ X2 ) ) )
= mbox_b ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^4.ax',mbox_b) ).
thf(f33,axiom,
( ( ^ [X0: $i > $o] : ( mnot @ ( mbox_b @ ( mnot @ X0 ) ) ) )
= mdia_b ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^4.ax',mdia_b) ).
thf(f35,axiom,
msymmetric @ rel_b,
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^4.ax',a2) ).
thf(f36,conjecture,
mvalid @ ( mimplies @ ( mbox_b @ ( mand @ p @ q ) ) @ ( mbox_b @ ( mbox_b @ ( mimplies @ ( mdia_b @ p ) @ ( mdia_b @ q ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
thf(f37,negated_conjecture,
~ ( mvalid @ ( mimplies @ ( mbox_b @ ( mand @ p @ q ) ) @ ( mbox_b @ ( mbox_b @ ( mimplies @ ( mdia_b @ p ) @ ( mdia_b @ q ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
thf(f40,plain,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
inference(rectify,[],[f3]) ).
thf(f41,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f40]) ).
thf(f42,plain,
~ ( mvalid @ ( mimplies @ ( mbox_b @ ( mand @ p @ q ) ) @ ( mbox_b @ ( mbox_b @ ( mimplies @ ( mdia_b @ p ) @ ( mdia_b @ q ) ) ) ) ) ),
inference(rectify,[],[f37]) ).
thf(f43,plain,
( ( mvalid @ ( mimplies @ ( mbox_b @ ( mand @ p @ q ) ) @ ( mbox_b @ ( mbox_b @ ( mimplies @ ( mdia_b @ p ) @ ( mdia_b @ q ) ) ) ) ) )
!= $true ),
inference(fool_elimination,[],[f42]) ).
thf(f46,plain,
msymmetric @ rel_b,
inference(rectify,[],[f35]) ).
thf(f47,plain,
( ( msymmetric @ rel_b )
= $true ),
inference(fool_elimination,[],[f46]) ).
thf(f52,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) )
= mor ),
inference(rectify,[],[f4]) ).
thf(f53,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f52]) ).
thf(f56,plain,
( mand
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mnot @ ( mor @ ( mnot @ Y0 ) @ ( mnot @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f62,plain,
( ( ^ [X0: $i > $i > $o] :
! [X1: $i,X2: $i] :
( ( X0 @ X1 @ X2 )
=> ( X0 @ X2 @ X1 ) ) )
= msymmetric ),
inference(rectify,[],[f19]) ).
thf(f63,plain,
( msymmetric
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 @ Y1 )
=> ( Y0 @ Y1 @ Y2 ) ) ) ) ) ),
inference(fool_elimination,[],[f62]) ).
thf(f64,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f67,plain,
( ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ( X0 @ X2 )
| ~ ( rel_b @ X1 @ X2 ) ) )
= mbox_b ),
inference(rectify,[],[f32]) ).
thf(f68,plain,
( mbox_b
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f67]) ).
thf(f79,plain,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
inference(rectify,[],[f28]) ).
thf(f80,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f79]) ).
thf(f87,plain,
( mdia_b
= ( ^ [Y0: $i > $o] : ( mnot @ ( mbox_b @ ( mnot @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f33]) ).
thf(f98,plain,
( ( mvalid @ ( mimplies @ ( mbox_b @ ( mand @ p @ q ) ) @ ( mbox_b @ ( mbox_b @ ( mimplies @ ( mdia_b @ p ) @ ( mdia_b @ q ) ) ) ) ) )
!= $true ),
inference(flattening,[],[f43]) ).
thf(f100,plain,
( ( mvalid @ ( mimplies @ ( mbox_b @ ( mand @ p @ q ) ) @ ( mbox_b @ ( mbox_b @ ( mimplies @ ( mdia_b @ p ) @ ( mdia_b @ q ) ) ) ) ) )
!= $true ),
inference(cnf_transformation,[],[f98]) ).
thf(f104,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(cnf_transformation,[],[f64]) ).
thf(f106,plain,
( mdia_b
= ( ^ [Y0: $i > $o] : ( mnot @ ( mbox_b @ ( mnot @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f87]) ).
thf(f109,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f53]) ).
thf(f112,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f41]) ).
thf(f116,plain,
( mbox_b
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f68]) ).
thf(f117,plain,
( msymmetric
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 @ Y1 )
=> ( Y0 @ Y1 @ Y2 ) ) ) ) ) ),
inference(cnf_transformation,[],[f63]) ).
thf(f118,plain,
( ( msymmetric @ rel_b )
= $true ),
inference(cnf_transformation,[],[f47]) ).
thf(f130,plain,
( mand
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mnot @ ( mor @ ( mnot @ Y0 ) @ ( mnot @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f56]) ).
thf(f134,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f80]) ).
thf(f137,plain,
( mand
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y3 @ Y4 )
| ( Y2 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y1 ) ) ) ) ),
inference(definition_unfolding,[],[f130,f112,f109,f112,f112]) ).
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,[],[f104,f109,f112]) ).
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,[],[f106,f112,f116,f112]) ).
thf(f147,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] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y3 @ Y4 )
| ( Y2 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y1 ) ) )
@ p
@ q ) )
@ ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) )
@ ( ^ [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 )
@ ( ^ [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 ) ) )
@ 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 ) ) )
@ q ) ) ) ) ) )
!= $true ),
inference(definition_unfolding,[],[f100,f134,f138,f116,f137,f116,f116,f138,f146,f146]) ).
thf(f148,plain,
( ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 @ Y1 )
=> ( Y0 @ Y1 @ Y2 ) ) ) )
@ rel_b )
= $true ),
inference(definition_unfolding,[],[f118,f117]) ).
thf(f153,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ~ ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( rel_b @ Y2 @ Y3 )
| ~ ( q @ Y3 ) ) )
| ~ ~ ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( rel_b @ Y2 @ Y3 )
| ~ ( p @ Y3 ) ) ) ) ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( ~ ( q @ Y1 )
| ~ ( p @ Y1 ) ) ) ) ) )
!= $true ),
inference(beta-eta_normalization,[],[f147]) ).
thf(f154,plain,
( $false
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ~ ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( rel_b @ Y2 @ Y3 )
| ~ ( q @ Y3 ) ) )
| ~ ~ ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( rel_b @ Y2 @ Y3 )
| ~ ( p @ Y3 ) ) ) ) ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( ~ ( q @ Y1 )
| ~ ( p @ Y1 ) ) ) ) )
@ sK0 ) ),
inference(sigma_proxy_clausification,[],[f153]) ).
thf(f155,plain,
( $false
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK0 @ Y0 )
| ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ~ ( q @ Y2 ) ) )
| ~ ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ~ ( p @ Y2 ) ) ) ) ) ) )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK0 @ Y0 )
| ~ ( ~ ( q @ Y0 )
| ~ ( p @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f154]) ).
thf(f156,plain,
( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK0 @ Y0 )
| ~ ( ~ ( q @ Y0 )
| ~ ( p @ Y0 ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f155]) ).
thf(f157,plain,
( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK0 @ Y0 )
| ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ~ ( q @ Y2 ) ) )
| ~ ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ~ ( p @ Y2 ) ) ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f155]) ).
thf(f158,plain,
( ( ^ [Y0: $i] :
( ~ ( rel_b @ sK0 @ Y0 )
| ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ~ ( q @ Y2 ) ) )
| ~ ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_b @ Y1 @ Y2 )
| ~ ( p @ Y2 ) ) ) ) ) )
@ sK1 )
= $false ),
inference(sigma_proxy_clausification,[],[f157]) ).
thf(f159,plain,
( $false
= ( ~ ( rel_b @ sK0 @ sK1 )
| ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK1 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( q @ Y1 ) ) )
| ~ ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( p @ Y1 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f158]) ).
thf(f160,plain,
( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK1 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( q @ Y1 ) ) )
| ~ ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( p @ Y1 ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f159]) ).
thf(f161,plain,
( $false
= ( ~ ( rel_b @ sK0 @ sK1 ) ) ),
inference(or_proxy_clausification,[],[f159]) ).
thf(f162,plain,
( ( rel_b @ sK0 @ sK1 )
= $true ),
inference(not_proxy_clausification,[],[f161]) ).
thf(f163,plain,
( $false
= ( ^ [Y0: $i] :
( ~ ( rel_b @ sK1 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( q @ Y1 ) ) )
| ~ ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_b @ Y0 @ Y1 )
| ~ ( p @ Y1 ) ) ) )
@ sK2 ) ),
inference(sigma_proxy_clausification,[],[f160]) ).
thf(f164,plain,
( ( ~ ( rel_b @ sK1 @ sK2 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK2 @ Y0 )
| ~ ( q @ Y0 ) ) )
| ~ ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK2 @ Y0 )
| ~ ( p @ Y0 ) ) ) )
= $false ),
inference(beta-eta_normalization,[],[f163]) ).
thf(f165,plain,
( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK2 @ Y0 )
| ~ ( q @ Y0 ) ) )
| ~ ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK2 @ Y0 )
| ~ ( p @ Y0 ) ) ) ) ),
inference(or_proxy_clausification,[],[f164]) ).
thf(f166,plain,
( $false
= ( ~ ( rel_b @ sK1 @ sK2 ) ) ),
inference(or_proxy_clausification,[],[f164]) ).
thf(f167,plain,
( ( rel_b @ sK1 @ sK2 )
= $true ),
inference(not_proxy_clausification,[],[f166]) ).
thf(f169,plain,
( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK2 @ Y0 )
| ~ ( q @ Y0 ) ) ) ) ),
inference(or_proxy_clausification,[],[f165]) ).
thf(f170,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK2 @ Y0 )
| ~ ( q @ Y0 ) ) )
= $true ),
inference(not_proxy_clausification,[],[f169]) ).
thf(f171,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( ~ ( rel_b @ sK2 @ Y0 )
| ~ ( q @ Y0 ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f170]) ).
thf(f172,plain,
! [X1: $i] :
( ( ~ ( rel_b @ sK2 @ X1 )
| ~ ( q @ X1 ) )
= $true ),
inference(beta-eta_normalization,[],[f171]) ).
thf(f173,plain,
! [X1: $i] :
( ( ( ~ ( rel_b @ sK2 @ X1 ) )
= $true )
| ( ( ~ ( q @ X1 ) )
= $true ) ),
inference(or_proxy_clausification,[],[f172]) ).
thf(f174,plain,
! [X1: $i] :
( ( $false
= ( rel_b @ sK2 @ X1 ) )
| ( ( ~ ( q @ X1 ) )
= $true ) ),
inference(not_proxy_clausification,[],[f173]) ).
thf(f175,plain,
! [X1: $i] :
( ( $false
= ( rel_b @ sK2 @ X1 ) )
| ( $false
= ( q @ X1 ) ) ),
inference(not_proxy_clausification,[],[f174]) ).
thf(f184,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_b @ sK0 @ Y0 )
| ~ ( ~ ( q @ Y0 )
| ~ ( p @ Y0 ) ) ) )
= $true ),
inference(not_proxy_clausification,[],[f156]) ).
thf(f185,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( ~ ( rel_b @ sK0 @ Y0 )
| ~ ( ~ ( q @ Y0 )
| ~ ( p @ Y0 ) ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f184]) ).
thf(f186,plain,
! [X1: $i] :
( ( ~ ( rel_b @ sK0 @ X1 )
| ~ ( ~ ( q @ X1 )
| ~ ( p @ X1 ) ) )
= $true ),
inference(beta-eta_normalization,[],[f185]) ).
thf(f187,plain,
! [X1: $i] :
( ( ( ~ ( rel_b @ sK0 @ X1 ) )
= $true )
| ( ( ~ ( ~ ( q @ X1 )
| ~ ( p @ X1 ) ) )
= $true ) ),
inference(or_proxy_clausification,[],[f186]) ).
thf(f188,plain,
! [X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( ( ~ ( ~ ( q @ X1 )
| ~ ( p @ X1 ) ) )
= $true ) ),
inference(not_proxy_clausification,[],[f187]) ).
thf(f189,plain,
! [X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( $false
= ( ~ ( q @ X1 )
| ~ ( p @ X1 ) ) ) ),
inference(not_proxy_clausification,[],[f188]) ).
thf(f191,plain,
! [X1: $i] :
( ( $false
= ( ~ ( q @ X1 ) ) )
| ( $false
= ( rel_b @ sK0 @ X1 ) ) ),
inference(or_proxy_clausification,[],[f189]) ).
thf(f192,plain,
! [X1: $i] :
( ( $false
= ( rel_b @ sK0 @ X1 ) )
| ( ( q @ X1 )
= $true ) ),
inference(not_proxy_clausification,[],[f191]) ).
thf(f194,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( rel_b @ Y1 @ Y0 )
=> ( rel_b @ Y0 @ Y1 ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f148]) ).
thf(f195,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( rel_b @ Y1 @ Y0 )
=> ( rel_b @ Y0 @ Y1 ) ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f194]) ).
thf(f196,plain,
! [X1: $i] :
( ( !! @ $i
@ ^ [Y0: $i] :
( ( rel_b @ Y0 @ X1 )
=> ( rel_b @ X1 @ Y0 ) ) )
= $true ),
inference(beta-eta_normalization,[],[f195]) ).
thf(f197,plain,
! [X2: $i,X1: $i] :
( ( ^ [Y0: $i] :
( ( rel_b @ Y0 @ X1 )
=> ( rel_b @ X1 @ Y0 ) )
@ X2 )
= $true ),
inference(pi_proxy_clausification,[],[f196]) ).
thf(f198,plain,
! [X2: $i,X1: $i] :
( ( ( rel_b @ X2 @ X1 )
=> ( rel_b @ X1 @ X2 ) )
= $true ),
inference(beta-eta_normalization,[],[f197]) ).
thf(f199,plain,
! [X2: $i,X1: $i] :
( ( ( rel_b @ X1 @ X2 )
= $true )
| ( $false
= ( rel_b @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f198]) ).
thf(f200,plain,
( ( $false = $true )
| ( ( q @ sK1 )
= $true ) ),
inference(constrained_superposition,[],[f192,f162]) ).
thf(f202,plain,
( ( q @ sK1 )
= $true ),
inference(trivial_inequality_removal,[],[f200]) ).
thf(f231,plain,
! [X0: $i] :
( ( $false
= ( q @ X0 ) )
| ( $false = $true )
| ( ( rel_b @ X0 @ sK2 )
= $false ) ),
inference(constrained_superposition,[],[f175,f199]) ).
thf(f237,plain,
! [X0: $i] :
( ( ( rel_b @ X0 @ sK2 )
= $false )
| ( $false
= ( q @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f231]) ).
thf(f260,plain,
( ( $false
= ( q @ sK1 ) )
| ( $false = $true ) ),
inference(constrained_superposition,[],[f167,f237]) ).
thf(f262,plain,
( $false
= ( q @ sK1 ) ),
inference(trivial_inequality_removal,[],[f260]) ).
thf(f267,plain,
$false = $true,
inference(forward_demodulation,[],[f262,f202]) ).
thf(f268,plain,
$false,
inference(trivial_inequality_removal,[],[f267]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO464^4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 % Computer : n010.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 17:00:48 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.25 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.32 % (3141133)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.32 % (3141141)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=2747934751: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.21/0.32 % (3141144)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.32 % (3141144)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.21/0.32 % (3141143)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1698583351:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.32 % (3141138)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=361175506:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.32 % (3141140)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3590207989:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.32 % (3141139)lrs+10_16_si=on:nwc=1.5:random_seed=448892920:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.32 % (3141144)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=3858801875:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.32 % (3141142)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1138358875:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.32 % (3141140)Instruction limit reached!
% 0.21/0.32 % (3141140)------------------------------
% 0.21/0.32 % (3141140)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.32 % (3141140)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.32 % (3141140)CaDiCaL version: 2.1.3
% 0.21/0.32 % (3141140)Termination reason: Instruction limit
% 0.21/0.32 % (3141140)Termination phase: Property scanning
% 0.21/0.32 % (3141140)Time elapsed: 0.002 s
% 0.21/0.32 % (3141140)Peak memory usage: 10 MB
% 0.21/0.32 % (3141140)Instructions burned: 5 (million)
% 0.21/0.32 % (3141138) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3141133-3141138"...
% 0.21/0.32 % (3141139) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3141133-3141139"...
% 0.21/0.32 % (3141143) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3141133-3141143"...
% 0.21/0.32 % (3141144) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3141133-3141144"...
% 0.21/0.32 % (3141138)...printing done.
% 0.21/0.32 % (3141139)...printing done.
% 0.21/0.32 % (3141138)Refutation found. Thanks to Tanya!
% 0.21/0.32 % SZS status Theorem for theBenchmark
% 0.21/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.33 % (3141138)------------------------------
% 0.21/0.33 % (3141138)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.33 % (3141138)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.33 % (3141138)CaDiCaL version: 2.1.3
% 0.21/0.33 % (3141138)Termination reason: Refutation
% 0.21/0.33 % (3141138)Time elapsed: 0.011 s
% 0.21/0.33 % (3141138)Peak memory usage: 12 MB
% 0.21/0.33 % (3141138)Instructions burned: 21 (million)
% 0.21/0.33 % (3141133)Success in time 0.055 s
% 0.21/0.33 % Vampire exiting
%------------------------------------------------------------------------------