%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL710^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 : 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:14:32 AM UTC 2026
% Result : Theorem 0.20s 0.30s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 9
% Syntax : Number of formulae : 77 ( 51 unt; 0 typ; 0 def)
% Number of atoms : 424 ( 115 equ; 1 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 675 ( 87 ~; 78 |; 2 &; 450 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 146 ( 146 >; 0 *; 0 +; 0 <<)
% Number of symbols : 54 ( 49 usr; 6 con; 0-4 aty)
% ( 44 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 227 ( 157 ^; 69 !; 1 ?; 227 :)
% 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,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_33,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_34,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_35,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_36,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
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,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_41,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_44,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_45,type,
vNOT: $o > $o ).
thf(func_def_46,type,
vOR: $o > $o > $o ).
thf(func_def_47,type,
sK0: $i > $i > $o ).
thf(func_def_50,type,
sK3: $i > ( $i > $o ) > $i ).
thf(f3,axiom,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(f4,axiom,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mor) ).
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(f11,axiom,
( ( ^ [X0: ( $i > $o ) > $i > $o,X1: $i] :
! [X2: $i > $o] : ( X0 @ X2 @ X1 ) )
= mforall_prop ),
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,
( ( ^ [X0: $i > $i > $o,X1: $i > $o] : ( mnot @ ( mbox @ X0 @ ( mnot @ X1 ) ) ) )
= mdia ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mdia) ).
thf(f19,axiom,
( ( ^ [X0: $i > $i > $o] :
! [X2: $i,X1: $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,conjecture,
! [X0: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X1: $i > $o] : ( mimplies @ X1 @ ( mbox @ X0 @ ( mdia @ X0 @ X1 ) ) ) ) )
=> ( msymmetric @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f33,negated_conjecture,
~ ! [X0: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X1: $i > $o] : ( mimplies @ X1 @ ( mbox @ X0 @ ( mdia @ X0 @ X1 ) ) ) ) )
=> ( msymmetric @ X0 ) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
thf(f34,plain,
( ( ^ [X0: ( $i > $o ) > $i > $o,X1: $i] :
! [X2: $i > $o] : ( X0 @ X2 @ X1 ) )
= mforall_prop ),
inference(rectify,[],[f11]) ).
thf(f35,plain,
( mforall_prop
= ( ^ [Y0: ( $i > $o ) > $i > $o,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f34]) ).
thf(f41,plain,
~ ! [X0: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X1: $i > $o] : ( mimplies @ X1 @ ( mbox @ X0 @ ( mdia @ X0 @ X1 ) ) ) ) )
=> ( msymmetric @ X0 ) ),
inference(rectify,[],[f33]) ).
thf(f42,plain,
~ ! [X0: $i > $i > $o] :
( ( $true
= ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] : ( mimplies @ Y0 @ ( mbox @ X0 @ ( mdia @ X0 @ Y0 ) ) ) ) ) )
=> ( ( msymmetric @ X0 )
= $true ) ),
inference(fool_elimination,[],[f41]) ).
thf(f50,plain,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
inference(rectify,[],[f3]) ).
thf(f51,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f50]) ).
thf(f54,plain,
( ( ^ [X0: $i > $i > $o] :
! [X1: $i,X2: $i] :
( ( X0 @ X2 @ X1 )
=> ( X0 @ X1 @ X2 ) ) )
= msymmetric ),
inference(rectify,[],[f19]) ).
thf(f55,plain,
( msymmetric
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
=> ( Y0 @ Y2 @ Y1 ) ) ) ) ) ),
inference(fool_elimination,[],[f54]) ).
thf(f59,plain,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f60,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f59]) ).
thf(f68,plain,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
inference(rectify,[],[f28]) ).
thf(f69,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f68]) ).
thf(f77,plain,
( mdia
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o] : ( mnot @ ( mbox @ Y0 @ ( mnot @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f17]) ).
thf(f78,plain,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ~ ( X0 @ X2 @ X3 )
| ( X1 @ X3 ) ) ) ),
inference(rectify,[],[f16]) ).
thf(f79,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y1 @ Y3 )
| ~ ( Y0 @ Y2 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f78]) ).
thf(f84,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f87,plain,
? [X0: $i > $i > $o] :
( ( $true
= ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] : ( mimplies @ Y0 @ ( mbox @ X0 @ ( mdia @ X0 @ Y0 ) ) ) ) ) )
& ( ( msymmetric @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f42]) ).
thf(f88,plain,
( ( $true
= ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] : ( mimplies @ Y0 @ ( mbox @ sK0 @ ( mdia @ sK0 @ Y0 ) ) ) ) ) )
& ( $true
!= ( msymmetric @ sK0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f87]) ).
thf(f89,plain,
( msymmetric
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
=> ( Y0 @ Y2 @ Y1 ) ) ) ) ) ),
inference(cnf_transformation,[],[f55]) ).
thf(f90,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(cnf_transformation,[],[f84]) ).
thf(f98,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f60]) ).
thf(f99,plain,
( mforall_prop
= ( ^ [Y0: ( $i > $o ) > $i > $o,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f35]) ).
thf(f100,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y1 @ Y3 )
| ~ ( Y0 @ Y2 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f79]) ).
thf(f103,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f51]) ).
thf(f109,plain,
( mdia
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o] : ( mnot @ ( mbox @ Y0 @ ( mnot @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f77]) ).
thf(f114,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f69]) ).
thf(f117,plain,
( $true
!= ( msymmetric @ sK0 ) ),
inference(cnf_transformation,[],[f88]) ).
thf(f118,plain,
( $true
= ( mvalid
@ ( mforall_prop
@ ^ [Y0: $i > $o] : ( mimplies @ Y0 @ ( mbox @ sK0 @ ( mdia @ sK0 @ Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f88]) ).
thf(f125,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,[],[f90,f98,f103]) ).
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,[],[f109,f103,f100,f103]) ).
thf(f133,plain,
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: ( $i > $o ) > $i > $o,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] : ( Y0 @ Y2 @ Y1 ) )
@ ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o,Y2: $i > $o] :
( ^ [Y3: $i > $o,Y4: $i > $o,Y5: $i] :
( ( Y4 @ Y5 )
| ( Y3 @ Y5 ) )
@ ( ^ [Y3: $i > $o,Y4: $i] :
~ ( Y3 @ Y4 )
@ Y1 )
@ Y2 )
@ Y0
@ ( ^ [Y1: $i > $i > $o,Y2: $i > $o,Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ( Y2 @ Y4 )
| ~ ( Y1 @ Y3 @ Y4 ) ) )
@ sK0
@ ( ^ [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 ) ) ) ) ) ),
inference(definition_unfolding,[],[f118,f114,f99,f125,f100,f132]) ).
thf(f134,plain,
( $true
!= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y1 @ Y2 )
=> ( Y0 @ Y2 @ Y1 ) ) ) )
@ sK0 ) ),
inference(definition_unfolding,[],[f117,f89]) ).
thf(f135,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
=> ( sK0 @ Y1 @ Y0 ) ) ) )
!= $true ),
inference(beta-eta_normalization,[],[f134]) ).
thf(f136,plain,
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
=> ( sK0 @ Y1 @ Y0 ) ) )
@ sK1 )
= $false ),
inference(sigma_proxy_clausification,[],[f135]) ).
thf(f137,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
=> ( sK0 @ Y0 @ sK1 ) ) )
= $false ),
inference(beta-eta_normalization,[],[f136]) ).
thf(f138,plain,
( ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
=> ( sK0 @ Y0 @ sK1 ) )
@ sK2 )
= $false ),
inference(sigma_proxy_clausification,[],[f137]) ).
thf(f139,plain,
( ( ( sK0 @ sK1 @ sK2 )
=> ( sK0 @ sK2 @ sK1 ) )
= $false ),
inference(beta-eta_normalization,[],[f138]) ).
thf(f140,plain,
( $false
= ( sK0 @ sK2 @ sK1 ) ),
inference(imp_proxy_clausification,[],[f139]) ).
thf(f141,plain,
( ( sK0 @ sK1 @ sK2 )
= $true ),
inference(imp_proxy_clausification,[],[f139]) ).
thf(f142,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( Y1 @ Y3 )
| ~ ( sK0 @ Y2 @ Y3 ) ) )
| ~ ( sK0 @ Y0 @ Y2 ) ) )
| ~ ( Y1 @ Y0 ) ) ) )
= $true ),
inference(beta-eta_normalization,[],[f133]) ).
thf(f143,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( !! @ $i
@ ^ [Y3: $i] :
( ~ ( Y1 @ Y3 )
| ~ ( sK0 @ Y2 @ Y3 ) ) )
| ~ ( sK0 @ Y0 @ Y2 ) ) )
| ~ ( Y1 @ Y0 ) ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f142]) ).
thf(f144,plain,
! [X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( Y0 @ Y2 )
| ~ ( sK0 @ Y1 @ Y2 ) ) )
| ~ ( sK0 @ X1 @ Y1 ) ) )
| ~ ( Y0 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f143]) ).
thf(f145,plain,
! [X2: $i > $o,X1: $i] :
( ( ^ [Y0: $i > $o] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( Y0 @ Y2 )
| ~ ( sK0 @ Y1 @ Y2 ) ) )
| ~ ( sK0 @ X1 @ Y1 ) ) )
| ~ ( Y0 @ X1 ) )
@ X2 )
= $true ),
inference(pi_proxy_clausification,[],[f144]) ).
thf(f146,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( X2 @ Y1 )
| ~ ( sK0 @ Y0 @ Y1 ) ) )
| ~ ( sK0 @ X1 @ Y0 ) ) )
| ~ ( X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f145]) ).
thf(f147,plain,
! [X2: $i > $o,X1: $i] :
( ( ( ~ ( X2 @ X1 ) )
= $true )
| ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( X2 @ Y1 )
| ~ ( sK0 @ Y0 @ Y1 ) ) )
| ~ ( sK0 @ X1 @ Y0 ) ) ) ) ),
inference(or_proxy_clausification,[],[f146]) ).
thf(f148,plain,
! [X2: $i > $o,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( X2 @ Y1 )
| ~ ( sK0 @ Y0 @ Y1 ) ) )
| ~ ( sK0 @ X1 @ Y0 ) ) ) )
| ( ( X2 @ X1 )
= $false ) ),
inference(not_proxy_clausification,[],[f147]) ).
thf(f149,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( X2 @ Y1 )
| ~ ( sK0 @ Y0 @ Y1 ) ) )
| ~ ( sK0 @ X1 @ Y0 ) )
@ X3 ) )
| ( ( X2 @ X1 )
= $false ) ),
inference(pi_proxy_clausification,[],[f148]) ).
thf(f150,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( X2 @ Y0 )
| ~ ( sK0 @ X3 @ Y0 ) ) )
| ~ ( sK0 @ X1 @ X3 ) ) )
| ( ( X2 @ X1 )
= $false ) ),
inference(beta-eta_normalization,[],[f149]) ).
thf(f151,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( ( X2 @ X1 )
= $false )
| ( ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( X2 @ Y0 )
| ~ ( sK0 @ X3 @ Y0 ) ) ) )
= $true )
| ( $true
= ( ~ ( sK0 @ X1 @ X3 ) ) ) ),
inference(or_proxy_clausification,[],[f150]) ).
thf(f152,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( ( X2 @ X1 )
= $false )
| ( $true
= ( ~ ( sK0 @ X1 @ X3 ) ) )
| ( ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( X2 @ Y0 )
| ~ ( sK0 @ X3 @ Y0 ) ) )
= $false ) ),
inference(not_proxy_clausification,[],[f151]) ).
thf(f153,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( ( X2 @ X1 )
= $false )
| ( ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( X2 @ Y0 )
| ~ ( sK0 @ X3 @ Y0 ) ) )
= $false )
| ( ( sK0 @ X1 @ X3 )
= $false ) ),
inference(not_proxy_clausification,[],[f152]) ).
thf(f154,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( ( X2 @ X1 )
= $false )
| ( ( sK0 @ X1 @ X3 )
= $false )
| ( ( ^ [Y0: $i] :
( ~ ( X2 @ Y0 )
| ~ ( sK0 @ X3 @ Y0 ) )
@ ( sK3 @ X3 @ X2 ) )
= $false ) ),
inference(sigma_proxy_clausification,[],[f153]) ).
thf(f155,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( ( sK0 @ X1 @ X3 )
= $false )
| ( ( ~ ( X2 @ ( sK3 @ X3 @ X2 ) )
| ~ ( sK0 @ X3 @ ( sK3 @ X3 @ X2 ) ) )
= $false )
| ( ( X2 @ X1 )
= $false ) ),
inference(beta-eta_normalization,[],[f154]) ).
thf(f156,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( ( X2 @ X1 )
= $false )
| ( ( sK0 @ X1 @ X3 )
= $false )
| ( $false
= ( ~ ( sK0 @ X3 @ ( sK3 @ X3 @ X2 ) ) ) ) ),
inference(or_proxy_clausification,[],[f155]) ).
thf(f157,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( ( X2 @ X1 )
= $false )
| ( $false
= ( ~ ( X2 @ ( sK3 @ X3 @ X2 ) ) ) )
| ( ( sK0 @ X1 @ X3 )
= $false ) ),
inference(or_proxy_clausification,[],[f155]) ).
thf(f158,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( ( sK0 @ X1 @ X3 )
= $false )
| ( ( X2 @ ( sK3 @ X3 @ X2 ) )
= $true )
| ( ( X2 @ X1 )
= $false ) ),
inference(not_proxy_clausification,[],[f157]) ).
thf(f159,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( ( sK0 @ X1 @ X3 )
= $false )
| ( ( sK0 @ X3 @ ( sK3 @ X3 @ X2 ) )
= $true )
| ( ( X2 @ X1 )
= $false ) ),
inference(not_proxy_clausification,[],[f156]) ).
thf(f160,plain,
! [X0: $i,X1: $i] :
( ( ( sK3 @ X0 @ ( (=) @ X1 ) )
= X1 )
| ( ( sK0 @ X1 @ X0 )
= $false ) ),
inference(leibniz_equality_elimination,[],[f158]) ).
thf(f254,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( sK0 @ X1 @ X0 )
= $true )
| ( ( sK0 @ X0 @ X1 )
= $false )
| ( ( X0 = X2 )
= $false )
| ( $false
= ( sK0 @ X2 @ X1 ) ) ),
inference(constrained_superposition,[],[f159,f160]) ).
thf(f322,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( sK0 @ X1 @ X0 )
= $true )
| ( $false
= ( sK0 @ X2 @ X1 ) )
| ( ( sK0 @ X0 @ X1 )
= $false )
| ( X0 != X2 ) ),
inference(equality_proxy_clausification,[],[f254]) ).
thf(f433,plain,
! [X0: $i] :
( ( ( sK0 @ X0 @ sK2 )
= $false )
| ( $true = $false )
| ( ( sK0 @ sK1 @ sK2 )
= $false )
| ( sK1 != X0 ) ),
inference(constrained_superposition,[],[f140,f322]) ).
thf(f450,plain,
! [X0: $i] :
( ( ( sK0 @ sK1 @ sK2 )
= $false )
| ( sK1 != X0 )
| ( ( sK0 @ X0 @ sK2 )
= $false ) ),
inference(trivial_inequality_removal,[],[f433]) ).
thf(f487,plain,
! [X0: $i] :
( ( sK1 != X0 )
| ( ( sK0 @ X0 @ sK2 )
= $false )
| ( $true = $false ) ),
inference(forward_demodulation,[],[f450,f141]) ).
thf(f488,plain,
! [X0: $i] :
( ( sK1 != X0 )
| ( ( sK0 @ X0 @ sK2 )
= $false ) ),
inference(trivial_inequality_removal,[],[f487]) ).
thf(f541,plain,
( ( sK0 @ sK1 @ sK2 )
= $false ),
inference(equality_resolution,[],[f488]) ).
thf(f542,plain,
$true = $false,
inference(backward_demodulation,[],[f141,f541]) ).
thf(f543,plain,
$false,
inference(trivial_inequality_removal,[],[f542]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL710^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.08/0.19 % Computer : n006.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 09:48:55 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.24 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.30 % (495572)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.30 % (495582)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2992653939:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.30 % (495583)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.30 % (495583)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.30 % (495577)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2090264851:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.30 % (495578)lrs+10_16_si=on:nwc=1.5:random_seed=181292976:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.30 % (495579)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1249164450:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.30 % (495583)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=935787915:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.30 % (495581)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3706431260:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.30 % (495580)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=2734091781: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.30 % (495579)Instruction limit reached!
% 0.20/0.30 % (495579)------------------------------
% 0.20/0.30 % (495579)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (495579)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (495579)CaDiCaL version: 2.1.3
% 0.20/0.30 % (495579)Termination reason: Instruction limit
% 0.20/0.30 % (495579)Termination phase: Preprocessing 3
% 0.20/0.30 % (495579)Time elapsed: 0.002 s
% 0.20/0.30 % (495579)Peak memory usage: 10 MB
% 0.20/0.30 % (495579)Instructions burned: 4 (million)
% 0.20/0.30 % (495583)Refutation not found, incomplete strategy
% 0.20/0.30 % (495583)------------------------------
% 0.20/0.30 % (495583)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (495583)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (495583)CaDiCaL version: 2.1.3
% 0.20/0.30 % (495583)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.30 % (495583)Time elapsed: 0.007 s
% 0.20/0.30 % (495583)Peak memory usage: 12 MB
% 0.20/0.30 % (495583)Instructions burned: 12 (million)
% 0.20/0.30 % (495582) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-495572-495582"...
% 0.20/0.30 % (495583)------------------------------
% 0.20/0.30 % (495583)------------------------------
% 0.20/0.30 % (495578)Instruction limit reached!
% 0.20/0.30 % (495578)------------------------------
% 0.20/0.30 % (495578)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (495578)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (495578)CaDiCaL version: 2.1.3
% 0.20/0.30 % (495578)Termination reason: Instruction limit
% 0.20/0.30 % (495578)Termination phase: Saturation
% 0.20/0.30 % (495578)Time elapsed: 0.009 s
% 0.20/0.30 % (495578)Peak memory usage: 12 MB
% 0.20/0.30 % (495578)Instructions burned: 18 (million)
% 0.20/0.30 % (495577) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-495572-495577"...
% 0.20/0.30 % (495582)...printing done.
% 0.20/0.30 % (495582)Refutation found. Thanks to Tanya!
% 0.20/0.30 % SZS status Theorem for theBenchmark
% 0.20/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.30 % (495582)------------------------------
% 0.20/0.30 % (495582)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (495582)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (495582)CaDiCaL version: 2.1.3
% 0.20/0.30 % (495582)Termination reason: Refutation
% 0.20/0.30 % (495582)Time elapsed: 0.016 s
% 0.20/0.30 % (495582)Peak memory usage: 12 MB
% 0.20/0.30 % (495582)Instructions burned: 58 (million)
% 0.20/0.30 % (495572)Success in time 0.047 s
% 0.20/0.30 % Vampire exiting
%------------------------------------------------------------------------------