%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO457^3 : 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 : n006.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:50 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 9
% Syntax : Number of formulae : 73 ( 60 unt; 0 typ; 0 def)
% Number of atoms : 388 ( 75 equ; 0 cnn)
% Maximal formula atoms : 9 ( 5 avg)
% Number of connectives : 550 ( 99 ~; 63 |; 0 &; 353 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 68 ( 68 >; 0 *; 0 +; 0 <<)
% Number of symbols : 56 ( 52 usr; 5 con; 0-4 aty)
% ( 35 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 149 ( 131 ^; 18 !; 0 ?; 149 :)
% 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_m: $i > $i > $o ).
thf(func_def_33,type,
mbox_m: ( $i > $o ) > $i > $o ).
thf(func_def_34,type,
mdia_m: ( $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,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_38,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_39,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_40,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_41,type,
vIMP: $o > $o > $o ).
thf(func_def_42,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_43,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_44,type,
vAND: $o > $o > $o ).
thf(func_def_45,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_46,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_51,type,
vOR: $o > $o > $o ).
thf(f3,axiom,
( ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) )
= mnot ),
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(f6,axiom,
( mimplies
= ( ^ [X0: $i > $o,X1: $i > $o] : ( mor @ ( mnot @ X0 ) @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(f18,axiom,
( ( ^ [X0: $i > $i > $o] :
! [X1: $i] : ( X0 @ X1 @ X1 ) )
= mreflexive ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mreflexive) ).
thf(f28,axiom,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(f32,axiom,
( mbox_m
= ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ( X0 @ X2 )
| ~ ( rel_m @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^3.ax',mbox_m) ).
thf(f33,axiom,
( mdia_m
= ( ^ [X0: $i > $o] : ( mnot @ ( mbox_m @ ( mnot @ X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^3.ax',mdia_m) ).
thf(f34,axiom,
mreflexive @ rel_m,
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^3.ax',a1) ).
thf(f35,conjecture,
mvalid @ ( mimplies @ ( mdia_m @ ( mbox_m @ p ) ) @ ( mdia_m @ ( mimplies @ q @ p ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
thf(f36,negated_conjecture,
~ ( mvalid @ ( mimplies @ ( mdia_m @ ( mbox_m @ p ) ) @ ( mdia_m @ ( mimplies @ q @ p ) ) ) ),
inference(negated_conjecture,[status(cth)],[f35]) ).
thf(f55,plain,
~ ( mvalid @ ( mimplies @ ( mdia_m @ ( mbox_m @ p ) ) @ ( mdia_m @ ( mimplies @ q @ p ) ) ) ),
inference(rectify,[],[f36]) ).
thf(f56,plain,
( ( mvalid @ ( mimplies @ ( mdia_m @ ( mbox_m @ p ) ) @ ( mdia_m @ ( mimplies @ q @ p ) ) ) )
!= $true ),
inference(fool_elimination,[],[f55]) ).
thf(f62,plain,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
inference(rectify,[],[f28]) ).
thf(f63,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f62]) ).
thf(f66,plain,
( ( ^ [X0: $i > $i > $o] :
! [X1: $i] : ( X0 @ X1 @ X1 ) )
= mreflexive ),
inference(rectify,[],[f18]) ).
thf(f67,plain,
( mreflexive
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f66]) ).
thf(f72,plain,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f73,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f72]) ).
thf(f74,plain,
( mbox_m
= ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ( X0 @ X2 )
| ~ ( rel_m @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f32]) ).
thf(f75,plain,
( mbox_m
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_m @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f74]) ).
thf(f79,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f81,plain,
( ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) )
= mnot ),
inference(rectify,[],[f3]) ).
thf(f82,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f81]) ).
thf(f87,plain,
mreflexive @ rel_m,
inference(rectify,[],[f34]) ).
thf(f88,plain,
( ( mreflexive @ rel_m )
= $true ),
inference(fool_elimination,[],[f87]) ).
thf(f94,plain,
( mdia_m
= ( ^ [Y0: $i > $o] : ( mnot @ ( mbox_m @ ( mnot @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f33]) ).
thf(f95,plain,
( ( mvalid @ ( mimplies @ ( mdia_m @ ( mbox_m @ p ) ) @ ( mdia_m @ ( mimplies @ q @ p ) ) ) )
!= $true ),
inference(flattening,[],[f56]) ).
thf(f98,plain,
( ( mreflexive @ rel_m )
= $true ),
inference(cnf_transformation,[],[f88]) ).
thf(f107,plain,
( mreflexive
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f67]) ).
thf(f114,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(cnf_transformation,[],[f79]) ).
thf(f116,plain,
( mdia_m
= ( ^ [Y0: $i > $o] : ( mnot @ ( mbox_m @ ( mnot @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f94]) ).
thf(f121,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f73]) ).
thf(f122,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f82]) ).
thf(f124,plain,
( ( mvalid @ ( mimplies @ ( mdia_m @ ( mbox_m @ p ) ) @ ( mdia_m @ ( mimplies @ q @ p ) ) ) )
!= $true ),
inference(cnf_transformation,[],[f95]) ).
thf(f125,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f63]) ).
thf(f130,plain,
( mbox_m
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_m @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f75]) ).
thf(f134,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,[],[f114,f121,f122]) ).
thf(f142,plain,
( mdia_m
= ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( rel_m @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) )
@ ( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ Y0 ) ) ) ) ),
inference(definition_unfolding,[],[f116,f122,f130,f122]) ).
thf(f143,plain,
( $true
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 @ Y1 ) )
@ rel_m ) ),
inference(definition_unfolding,[],[f98,f107]) ).
thf(f144,plain,
( $true
!= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [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 )
@ ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( rel_m @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) )
@ ( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ Y0 ) ) )
@ ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_m @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) )
@ p ) )
@ ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( rel_m @ 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] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 )
@ q
@ p ) ) ) ) ),
inference(definition_unfolding,[],[f124,f125,f134,f142,f130,f142,f134]) ).
thf(f145,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_m @ Y0 @ Y1 )
| ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_m @ Y1 @ Y2 )
| ( p @ Y2 ) ) ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_m @ Y0 @ Y1 )
| ~ ( ~ ( q @ Y1 )
| ( p @ Y1 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f144]) ).
thf(f146,plain,
( $false
= ( ^ [Y0: $i] :
( ~ ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_m @ Y0 @ Y1 )
| ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_m @ Y1 @ Y2 )
| ( p @ Y2 ) ) ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_m @ Y0 @ Y1 )
| ~ ( ~ ( q @ Y1 )
| ( p @ Y1 ) ) ) ) )
@ sK0 ) ),
inference(sigma_proxy_clausification,[],[f145]) ).
thf(f147,plain,
( $false
= ( ~ ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_m @ sK0 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_m @ Y0 @ Y1 )
| ( p @ Y1 ) ) ) ) )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_m @ sK0 @ Y0 )
| ~ ( ~ ( q @ Y0 )
| ( p @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f146]) ).
thf(f148,plain,
( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_m @ sK0 @ Y0 )
| ~ ( ~ ( q @ Y0 )
| ( p @ Y0 ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f147]) ).
thf(f149,plain,
( $false
= ( ~ ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_m @ sK0 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_m @ Y0 @ Y1 )
| ( p @ Y1 ) ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f147]) ).
thf(f150,plain,
( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_m @ sK0 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_m @ Y0 @ Y1 )
| ( p @ Y1 ) ) ) ) ) ) ),
inference(not_proxy_clausification,[],[f149]) ).
thf(f151,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_m @ sK0 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_m @ Y0 @ Y1 )
| ( p @ Y1 ) ) ) ) )
= $false ),
inference(not_proxy_clausification,[],[f150]) ).
thf(f152,plain,
( $false
= ( ^ [Y0: $i] :
( ~ ( rel_m @ sK0 @ Y0 )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_m @ Y0 @ Y1 )
| ( p @ Y1 ) ) ) )
@ sK1 ) ),
inference(sigma_proxy_clausification,[],[f151]) ).
thf(f153,plain,
( $false
= ( ~ ( rel_m @ sK0 @ sK1 )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_m @ sK1 @ Y0 )
| ( p @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f152]) ).
thf(f154,plain,
( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_m @ sK1 @ Y0 )
| ( p @ Y0 ) ) ) ) ),
inference(or_proxy_clausification,[],[f153]) ).
thf(f155,plain,
( ( ~ ( rel_m @ sK0 @ sK1 ) )
= $false ),
inference(or_proxy_clausification,[],[f153]) ).
thf(f156,plain,
( ( rel_m @ sK0 @ sK1 )
= $true ),
inference(not_proxy_clausification,[],[f155]) ).
thf(f157,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_m @ sK1 @ Y0 )
| ( p @ Y0 ) ) ) ),
inference(not_proxy_clausification,[],[f154]) ).
thf(f158,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ~ ( rel_m @ sK1 @ Y0 )
| ( p @ Y0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f157]) ).
thf(f159,plain,
! [X1: $i] :
( $true
= ( ~ ( rel_m @ sK1 @ X1 )
| ( p @ X1 ) ) ),
inference(beta-eta_normalization,[],[f158]) ).
thf(f160,plain,
! [X1: $i] :
( ( $true
= ( p @ X1 ) )
| ( $true
= ( ~ ( rel_m @ sK1 @ X1 ) ) ) ),
inference(or_proxy_clausification,[],[f159]) ).
thf(f161,plain,
! [X1: $i] :
( ( ( rel_m @ sK1 @ X1 )
= $false )
| ( $true
= ( p @ X1 ) ) ),
inference(not_proxy_clausification,[],[f160]) ).
thf(f162,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_m @ sK0 @ Y0 )
| ~ ( ~ ( q @ Y0 )
| ( p @ Y0 ) ) ) ) ),
inference(not_proxy_clausification,[],[f148]) ).
thf(f163,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ~ ( rel_m @ sK0 @ Y0 )
| ~ ( ~ ( q @ Y0 )
| ( p @ Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f162]) ).
thf(f164,plain,
! [X1: $i] :
( $true
= ( ~ ( rel_m @ sK0 @ X1 )
| ~ ( ~ ( q @ X1 )
| ( p @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f163]) ).
thf(f165,plain,
! [X1: $i] :
( ( $true
= ( ~ ( rel_m @ sK0 @ X1 ) ) )
| ( ( ~ ( ~ ( q @ X1 )
| ( p @ X1 ) ) )
= $true ) ),
inference(or_proxy_clausification,[],[f164]) ).
thf(f166,plain,
! [X1: $i] :
( ( ( ~ ( ~ ( q @ X1 )
| ( p @ X1 ) ) )
= $true )
| ( $false
= ( rel_m @ sK0 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f165]) ).
thf(f167,plain,
! [X1: $i] :
( ( $false
= ( ~ ( q @ X1 )
| ( p @ X1 ) ) )
| ( $false
= ( rel_m @ sK0 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f166]) ).
thf(f168,plain,
! [X1: $i] :
( ( $false
= ( rel_m @ sK0 @ X1 ) )
| ( $false
= ( p @ X1 ) ) ),
inference(or_proxy_clausification,[],[f167]) ).
thf(f171,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] : ( rel_m @ Y0 @ Y0 ) ) ),
inference(beta-eta_normalization,[],[f143]) ).
thf(f172,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] : ( rel_m @ Y0 @ Y0 )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f171]) ).
thf(f173,plain,
! [X1: $i] :
( $true
= ( rel_m @ X1 @ X1 ) ),
inference(beta-eta_normalization,[],[f172]) ).
thf(f175,plain,
( ( $false
= ( p @ sK1 ) )
| ( $true = $false ) ),
inference(constrained_superposition,[],[f156,f168]) ).
thf(f176,plain,
( $false
= ( p @ sK1 ) ),
inference(trivial_inequality_removal,[],[f175]) ).
thf(f184,plain,
( ( $true = $false )
| ( $true
= ( p @ sK1 ) ) ),
inference(constrained_superposition,[],[f173,f161]) ).
thf(f188,plain,
( $true
= ( p @ sK1 ) ),
inference(trivial_inequality_removal,[],[f184]) ).
thf(f194,plain,
$true = $false,
inference(forward_demodulation,[],[f188,f176]) ).
thf(f195,plain,
$false,
inference(trivial_inequality_removal,[],[f194]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO457^3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n006.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 16:57:25 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.23 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.27 % (1017210)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.27 % (1017218)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2447532105:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.27 % (1017218)Refutation not found, incomplete strategy
% 0.20/0.27 % (1017218)------------------------------
% 0.20/0.27 % (1017218)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (1017218)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (1017218)CaDiCaL version: 2.1.3
% 0.20/0.27 % (1017218)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.27 % (1017218)Time elapsed: 0.002 s
% 0.20/0.27 % (1017218)Peak memory usage: 12 MB
% 0.20/0.27 % (1017218)Instructions burned: 8 (million)
% 0.20/0.27 % (1017218)------------------------------
% 0.20/0.27 % (1017218)------------------------------
% 0.20/0.27 % (1017223)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 % (1017223)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 % (1017216)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3436165340:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.27 % (1017217)lrs+10_16_si=on:nwc=1.5:random_seed=3820431865:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.27 % (1017221)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=4249236420:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.27 % (1017220)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=3671032871: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 % (1017222)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=4083150231:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.27 % (1017223)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=3818857462:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.27 % (1017216) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1017210-1017216"...
% 0.20/0.27 % (1017217) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1017210-1017217"...
% 0.20/0.27 % (1017222) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1017210-1017222"...
% 0.20/0.27 % (1017223) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1017210-1017223"...
% 0.20/0.27 % (1017216)...printing done.
% 0.20/0.27 % (1017217)...printing done.
% 0.20/0.27 % (1017216)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.27 % (1017216)------------------------------
% 0.20/0.27 % (1017216)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (1017216)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (1017216)CaDiCaL version: 2.1.3
% 0.20/0.27 % (1017216)Termination reason: Refutation
% 0.20/0.27 % (1017216)Time elapsed: 0.008 s
% 0.20/0.27 % (1017216)Peak memory usage: 12 MB
% 0.20/0.27 % (1017216)Instructions burned: 14 (million)
% 0.20/0.27 % (1017210)Success in time 0.032 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------