%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL701^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:14:31 AM UTC 2026
% Result : Theorem 0.26s 0.34s
% Output : Refutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 9
% Syntax : Number of formulae : 70 ( 57 unt; 0 typ; 0 def)
% Number of atoms : 332 ( 76 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 497 ( 68 ~; 43 |; 2 &; 341 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 131 ( 131 >; 0 *; 0 +; 0 <<)
% Number of symbols : 54 ( 49 usr; 5 con; 0-4 aty)
% ( 33 !!; 6 ??; 0 @@+; 0 @@-)
% Number of variables : 175 ( 148 ^; 24 !; 3 ?; 175 :)
% 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,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_33,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_34,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_35,type,
vNOT: $o > $o ).
thf(func_def_36,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_37,type,
vIMP: $o > $o > $o ).
thf(func_def_38,type,
vAND: $o > $o > $o ).
thf(func_def_39,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_40,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_41,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_42,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_45,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_46,type,
vOR: $o > $o > $o ).
thf(func_def_47,type,
sK0: $i > $i > $o ).
thf(func_def_48,type,
sK1: $i > $i ).
thf(func_def_50,type,
sK3: $i > $o ).
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(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] :
( ~ ( X0 @ X2 @ X3 )
| ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(f17,axiom,
( mdia
= ( ^ [X0: $i > $i > $o,X1: $i > $o] : ( mnot @ ( mbox @ X0 @ ( mnot @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mdia) ).
thf(f20,axiom,
( ( ^ [X0: $i > $i > $o] :
! [X1: $i] :
? [X2: $i] : ( X0 @ X1 @ X2 ) )
= mserial ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mserial) ).
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] :
( ( mserial @ X0 )
=> ( mvalid
@ ( mforall_prop
@ ^ [X1: $i > $o] : ( mimplies @ ( mbox @ X0 @ X1 ) @ ( mdia @ X0 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f33,negated_conjecture,
~ ! [X0: $i > $i > $o] :
( ( mserial @ X0 )
=> ( mvalid
@ ( mforall_prop
@ ^ [X1: $i > $o] : ( mimplies @ ( mbox @ X0 @ X1 ) @ ( mdia @ X0 @ X1 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
thf(f34,plain,
( mdia
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o] : ( mnot @ ( mbox @ Y0 @ ( mnot @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f17]) ).
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(f40,plain,
~ ! [X0: $i > $i > $o] :
( ( mserial @ X0 )
=> ( mvalid
@ ( mforall_prop
@ ^ [X1: $i > $o] : ( mimplies @ ( mbox @ X0 @ X1 ) @ ( mdia @ X0 @ X1 ) ) ) ) ),
inference(rectify,[],[f33]) ).
thf(f41,plain,
~ ! [X0: $i > $i > $o] :
( ( ( mserial @ X0 )
= $true )
=> ( ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] : ( mimplies @ ( mbox @ X0 @ Y0 ) @ ( mdia @ X0 @ Y0 ) ) ) )
= $true ) ),
inference(fool_elimination,[],[f40]) ).
thf(f44,plain,
( mforall_prop
= ( ^ [X0: ( $i > $o ) > $i > $o,X1: $i] :
! [X2: $i > $o] : ( X0 @ X2 @ X1 ) ) ),
inference(rectify,[],[f11]) ).
thf(f45,plain,
( mforall_prop
= ( ^ [Y0: ( $i > $o ) > $i > $o,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f44]) ).
thf(f57,plain,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ~ ( X0 @ X2 @ X3 )
| ( X1 @ X3 ) ) ) ),
inference(rectify,[],[f16]) ).
thf(f58,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y1 @ Y3 )
| ~ ( Y0 @ Y2 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f57]) ).
thf(f62,plain,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f63,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f62]) ).
thf(f66,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f67,plain,
( ( ^ [X0: $i > $i > $o] :
! [X1: $i] :
? [X2: $i] : ( X0 @ X1 @ X2 ) )
= mserial ),
inference(rectify,[],[f20]) ).
thf(f68,plain,
( mserial
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f67]) ).
thf(f71,plain,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
inference(rectify,[],[f28]) ).
thf(f72,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f71]) ).
thf(f87,plain,
? [X0: $i > $i > $o] :
( ( ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] : ( mimplies @ ( mbox @ X0 @ Y0 ) @ ( mdia @ X0 @ Y0 ) ) ) )
!= $true )
& ( ( mserial @ X0 )
= $true ) ),
inference(ennf_transformation,[],[f41]) ).
thf(f88,plain,
( ( $true
!= ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] : ( mimplies @ ( mbox @ sK0 @ Y0 ) @ ( mdia @ sK0 @ Y0 ) ) ) ) )
& ( $true
= ( mserial @ sK0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f87]) ).
thf(f96,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f63]) ).
thf(f102,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y1 @ Y3 )
| ~ ( Y0 @ Y2 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f58]) ).
thf(f105,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(cnf_transformation,[],[f66]) ).
thf(f108,plain,
( $true
= ( mserial @ sK0 ) ),
inference(cnf_transformation,[],[f88]) ).
thf(f109,plain,
( $true
!= ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] : ( mimplies @ ( mbox @ sK0 @ Y0 ) @ ( mdia @ sK0 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f88]) ).
thf(f111,plain,
( mdia
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o] : ( mnot @ ( mbox @ Y0 @ ( mnot @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f34]) ).
thf(f115,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f37]) ).
thf(f116,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f72]) ).
thf(f119,plain,
( mserial
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f68]) ).
thf(f121,plain,
( mforall_prop
= ( ^ [Y0: ( $i > $o ) > $i > $o,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f45]) ).
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,[],[f105,f96,f115]) ).
thf(f132,plain,
( mdia
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ( Y3 @ Y5 )
| ~ ( Y2 @ Y4 @ Y5 ) ) )
@ Y0
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y1 ) ) ) ) ),
inference(definition_unfolding,[],[f111,f115,f102,f115]) ).
thf(f133,plain,
( ( ^ [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,Y2: $i > $o] :
( ^ [Y3: $i > $o,Y4: $i > $o,Y5: $i] :
( ( Y3 @ Y5 )
| ( Y4 @ Y5 ) )
@ ( ^ [Y3: $i > $o,Y4: $i] :
~ ( Y3 @ Y4 )
@ Y1 )
@ Y2 )
@ ( ^ [Y1: $i > $i > $o,Y2: $i > $o,Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ( Y2 @ Y4 )
| ~ ( Y1 @ Y3 @ Y4 ) ) )
@ sK0
@ Y0 )
@ ( ^ [Y1: $i > $i > $o,Y2: $i > $o] :
( ^ [Y3: $i > $o,Y4: $i] :
~ ( Y3 @ Y4 )
@ ( ^ [Y3: $i > $i > $o,Y4: $i > $o,Y5: $i] :
( !! @ $i
@ ^ [Y6: $i] :
( ( Y4 @ Y6 )
| ~ ( Y3 @ Y5 @ Y6 ) ) )
@ Y1
@ ( ^ [Y3: $i > $o,Y4: $i] :
~ ( Y3 @ Y4 )
@ Y2 ) ) )
@ sK0
@ Y0 ) ) ) )
!= $true ),
inference(definition_unfolding,[],[f109,f116,f121,f125,f102,f132]) ).
thf(f134,plain,
( ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) ) )
@ sK0 )
= $true ),
inference(definition_unfolding,[],[f108,f119]) ).
thf(f135,plain,
( ( !! @ $i
@ ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) ) )
= $true ),
inference(beta-eta_normalization,[],[f134]) ).
thf(f136,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] : ( ?? @ $i @ ( sK0 @ Y0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f135]) ).
thf(f137,plain,
! [X1: $i] :
( ( ?? @ $i @ ( sK0 @ X1 ) )
= $true ),
inference(beta-eta_normalization,[],[f136]) ).
thf(f138,plain,
! [X1: $i] :
( ( sK0 @ X1 @ ( sK1 @ X1 ) )
= $true ),
inference(sigma_proxy_clausification,[],[f137]) ).
thf(f139,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( !! @ $i
@ ^ [Y2: $i] :
( ( Y1 @ Y2 )
| ~ ( sK0 @ Y0 @ Y2 ) ) )
| ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( Y1 @ Y2 )
| ~ ( sK0 @ Y0 @ Y2 ) ) ) ) ) )
!= $true ),
inference(beta-eta_normalization,[],[f133]) ).
thf(f140,plain,
( ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ~ ( !! @ $i
@ ^ [Y2: $i] :
( ( Y1 @ Y2 )
| ~ ( sK0 @ Y0 @ Y2 ) ) )
| ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( Y1 @ Y2 )
| ~ ( sK0 @ Y0 @ Y2 ) ) ) ) )
@ sK2 )
= $false ),
inference(sigma_proxy_clausification,[],[f139]) ).
thf(f141,plain,
( ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
| ~ ( sK0 @ sK2 @ Y1 ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( Y0 @ Y1 )
| ~ ( sK0 @ sK2 @ Y1 ) ) ) ) )
= $false ),
inference(beta-eta_normalization,[],[f140]) ).
thf(f142,plain,
( ( ^ [Y0: $i > $o] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
| ~ ( sK0 @ sK2 @ Y1 ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( Y0 @ Y1 )
| ~ ( sK0 @ sK2 @ Y1 ) ) ) )
@ sK3 )
= $false ),
inference(sigma_proxy_clausification,[],[f141]) ).
thf(f143,plain,
( ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( sK3 @ Y0 )
| ~ ( sK0 @ sK2 @ Y0 ) ) )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK3 @ Y0 )
| ~ ( sK0 @ sK2 @ Y0 ) ) ) )
= $false ),
inference(beta-eta_normalization,[],[f142]) ).
thf(f144,plain,
( ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK3 @ Y0 )
| ~ ( sK0 @ sK2 @ Y0 ) ) ) )
= $false ),
inference(or_proxy_clausification,[],[f143]) ).
thf(f145,plain,
( ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( sK3 @ Y0 )
| ~ ( sK0 @ sK2 @ Y0 ) ) ) )
= $false ),
inference(or_proxy_clausification,[],[f143]) ).
thf(f146,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( sK3 @ Y0 )
| ~ ( sK0 @ sK2 @ Y0 ) ) ) ),
inference(not_proxy_clausification,[],[f145]) ).
thf(f147,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( sK3 @ Y0 )
| ~ ( sK0 @ sK2 @ Y0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f146]) ).
thf(f148,plain,
! [X1: $i] :
( $true
= ( ( sK3 @ X1 )
| ~ ( sK0 @ sK2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f147]) ).
thf(f149,plain,
! [X1: $i] :
( ( $true
= ( sK3 @ X1 ) )
| ( ( ~ ( sK0 @ sK2 @ X1 ) )
= $true ) ),
inference(or_proxy_clausification,[],[f148]) ).
thf(f150,plain,
! [X1: $i] :
( ( ( sK0 @ sK2 @ X1 )
= $false )
| ( $true
= ( sK3 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f149]) ).
thf(f151,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( sK3 @ Y0 )
| ~ ( sK0 @ sK2 @ Y0 ) ) ) ),
inference(not_proxy_clausification,[],[f144]) ).
thf(f152,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ~ ( sK3 @ Y0 )
| ~ ( sK0 @ sK2 @ Y0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f151]) ).
thf(f153,plain,
! [X1: $i] :
( $true
= ( ~ ( sK3 @ X1 )
| ~ ( sK0 @ sK2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f152]) ).
thf(f154,plain,
! [X1: $i] :
( ( $true
= ( ~ ( sK3 @ X1 ) ) )
| ( ( ~ ( sK0 @ sK2 @ X1 ) )
= $true ) ),
inference(or_proxy_clausification,[],[f153]) ).
thf(f155,plain,
! [X1: $i] :
( ( ( ~ ( sK0 @ sK2 @ X1 ) )
= $true )
| ( $false
= ( sK3 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f154]) ).
thf(f156,plain,
! [X1: $i] :
( ( ( sK0 @ sK2 @ X1 )
= $false )
| ( $false
= ( sK3 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f155]) ).
thf(f157,plain,
( ( $true = $false )
| ( ( sK3 @ ( sK1 @ sK2 ) )
= $true ) ),
inference(constrained_superposition,[],[f150,f138]) ).
thf(f159,plain,
( ( sK3 @ ( sK1 @ sK2 ) )
= $true ),
inference(trivial_inequality_removal,[],[f157]) ).
thf(f161,plain,
( ( $true = $false )
| ( ( sK3 @ ( sK1 @ sK2 ) )
= $false ) ),
inference(constrained_superposition,[],[f156,f138]) ).
thf(f163,plain,
( ( sK3 @ ( sK1 @ sK2 ) )
= $false ),
inference(trivial_inequality_removal,[],[f161]) ).
thf(f165,plain,
$true = $false,
inference(forward_demodulation,[],[f163,f159]) ).
thf(f166,plain,
$false,
inference(trivial_inequality_removal,[],[f165]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL701^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 % Computer : n007.cluster.edu
% 0.09/0.22 % Model : x86_64 x86_64
% 0.09/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22 % Memory : 8046.5625MB
% 0.09/0.22 % OS : Linux 6.8.0-71-generic
% 0.09/0.22 % CPULimit : 300
% 0.09/0.22 % WCLimit : 300
% 0.09/0.22 % DateTime : Tue Sep 29 09:36:11 UTC 2026
% 0.09/0.22 % CPUTime :
% 0.09/0.22 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.27 Running higher-order theorem proving
% 0.26/0.30 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.26/0.34 % (3131972)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.26/0.34 % (3131977)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=895050942:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.26/0.34 % (3131979)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1674155168:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.26/0.34 % (3131977) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3131972-3131977"...
% 0.26/0.34 % (3131979)Instruction limit reached!
% 0.26/0.34 % (3131979)------------------------------
% 0.26/0.34 % (3131979)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.34 % (3131979)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.34 % (3131979)CaDiCaL version: 2.1.3
% 0.26/0.34 % (3131979)Termination reason: Instruction limit
% 0.26/0.34 % (3131979)Termination phase: Property scanning
% 0.26/0.34 % (3131979)Time elapsed: 0.002 s
% 0.26/0.34 % (3131979)Peak memory usage: 10 MB
% 0.26/0.34 % (3131979)Instructions burned: 4 (million)
% 0.26/0.34 % (3131977)...printing done.
% 0.26/0.34 % (3131983)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.26/0.34 % (3131983)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.26/0.34 % (3131977)Refutation found. Thanks to Tanya!
% 0.26/0.34 % SZS status Theorem for theBenchmark
% 0.26/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.26/0.34 % (3131977)------------------------------
% 0.26/0.34 % (3131977)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.34 % (3131977)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.34 % (3131977)CaDiCaL version: 2.1.3
% 0.26/0.34 % (3131977)Termination reason: Refutation
% 0.26/0.34 % (3131977)Time elapsed: 0.007 s
% 0.26/0.34 % (3131977)Peak memory usage: 12 MB
% 0.26/0.34 % (3131977)Instructions burned: 13 (million)
% 0.26/0.34 % (3131972)Success in time 0.031 s
% 0.26/0.34 % Vampire exiting
%------------------------------------------------------------------------------