%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO485^6 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:50:18 AM UTC 2026
% Result : Theorem 0.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 12
% Syntax : Number of formulae : 78 ( 56 unt; 0 typ; 2 def)
% Number of atoms : 319 ( 90 equ; 0 cnn)
% Maximal formula atoms : 5 ( 4 avg)
% Number of connectives : 422 ( 87 ~; 29 |; 0 &; 267 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 64 ( 64 >; 0 *; 0 +; 0 <<)
% Number of symbols : 57 ( 53 usr; 7 con; 0-4 aty)
% ( 37 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 175 ( 4 sgn 29 !; 0 ?; 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,
rel_s5: $i > $i > $o ).
thf(func_def_33,type,
mbox_s5: ( $i > $o ) > $i > $o ).
thf(func_def_34,type,
mdia_s5: ( $i > $o ) > $i > $o ).
thf(func_def_35,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_36,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_37,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_38,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_39,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_40,type,
vNOT: $o > $o ).
thf(func_def_41,type,
vOR: $o > $o > $o ).
thf(func_def_42,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_45,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_46,type,
vIMP: $o > $o > $o ).
thf(func_def_47,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_48,type,
vAND: $o > $o > $o ).
thf(func_def_49,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_50,type,
db5:
!>[X0: $tType] : X0 ).
thf(func_def_52,type,
sK1: mu ).
thf(f1,axiom,
( meq_ind
= ( ^ [X0: mu,X1: mu,X2: $i] : ( X0 = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',meq_ind) ).
thf(f3,axiom,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(f10,axiom,
( mforall_ind
= ( ^ [X0: mu > $i > $o,X1: $i] :
! [X2: mu] : ( X0 @ X2 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mforall_ind) ).
thf(f12,axiom,
( mexists_ind
= ( ^ [X0: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X1: mu] : ( mnot @ ( X0 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mexists_ind) ).
thf(f18,axiom,
( mreflexive
= ( ^ [X0: $i > $i > $o] :
! [X1: $i] : ( X0 @ X1 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mreflexive) ).
thf(f28,axiom,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(f32,axiom,
( mbox_s5
= ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ( X0 @ X2 )
| ~ ( rel_s5 @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^6.ax',mbox_s5) ).
thf(f33,axiom,
( mdia_s5
= ( ^ [X0: $i > $o] : ( mnot @ ( mbox_s5 @ ( mnot @ X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^6.ax',mdia_s5) ).
thf(f34,axiom,
mreflexive @ rel_s5,
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^6.ax',a1) ).
thf(f37,conjecture,
( mvalid
@ ( mforall_ind
@ ^ [X0: mu] :
( mdia_s5
@ ( mexists_ind
@ ^ [X1: mu] : ( meq_ind @ X0 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
thf(f38,negated_conjecture,
~ ( mvalid
@ ( mforall_ind
@ ^ [X0: mu] :
( mdia_s5
@ ( mexists_ind
@ ^ [X1: mu] : ( meq_ind @ X0 @ X1 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f37]) ).
thf(f39,plain,
( meq_ind
= ( ^ [Y0: mu,Y1: mu,Y2: $i] : ( Y0 = Y1 ) ) ),
inference(fool_elimination,[],[f1]) ).
thf(f41,plain,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
inference(rectify,[],[f3]) ).
thf(f42,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f41]) ).
thf(f50,plain,
( mforall_ind
= ( ^ [X0: mu > $i > $o,X1: $i] :
! [X2: mu] : ( X0 @ X2 @ X1 ) ) ),
inference(rectify,[],[f10]) ).
thf(f51,plain,
( mforall_ind
= ( ^ [Y0: mu > $i > $o,Y1: $i] :
( !! @ mu
@ ^ [Y2: mu] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f50]) ).
thf(f54,plain,
( mexists_ind
= ( ^ [X0: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X1: mu] : ( mnot @ ( X0 @ X1 ) ) ) ) ) ),
inference(rectify,[],[f12]) ).
thf(f55,plain,
( mexists_ind
= ( ^ [Y0: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [Y1: mu] : ( mnot @ ( Y0 @ Y1 ) ) ) ) ) ),
inference(fool_elimination,[],[f54]) ).
thf(f62,plain,
( mreflexive
= ( ^ [X0: $i > $i > $o] :
! [X1: $i] : ( X0 @ X1 @ X1 ) ) ),
inference(rectify,[],[f18]) ).
thf(f63,plain,
( mreflexive
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f62]) ).
thf(f82,plain,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
inference(rectify,[],[f28]) ).
thf(f83,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f82]) ).
thf(f90,plain,
( mbox_s5
= ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ( X0 @ X2 )
| ~ ( rel_s5 @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f32]) ).
thf(f91,plain,
( mbox_s5
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_s5 @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f90]) ).
thf(f92,plain,
( mdia_s5
= ( ^ [Y0: $i > $o] : ( mnot @ ( mbox_s5 @ ( mnot @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f33]) ).
thf(f93,plain,
mreflexive @ rel_s5,
inference(rectify,[],[f34]) ).
thf(f94,plain,
( ( mreflexive @ rel_s5 )
= $true ),
inference(fool_elimination,[],[f93]) ).
thf(f99,plain,
~ ( mvalid
@ ( mforall_ind
@ ^ [X0: mu] :
( mdia_s5
@ ( mexists_ind
@ ^ [X1: mu] : ( meq_ind @ X0 @ X1 ) ) ) ) ),
inference(rectify,[],[f38]) ).
thf(f100,plain,
( $true
!= ( mvalid
@ ( mforall_ind
@ ^ [Y0: mu] :
( mdia_s5
@ ( mexists_ind
@ ^ [Y1: mu] : ( meq_ind @ Y0 @ Y1 ) ) ) ) ) ),
inference(fool_elimination,[],[f99]) ).
thf(f101,plain,
( $true
!= ( mvalid
@ ( mforall_ind
@ ^ [Y0: mu] :
( mdia_s5
@ ( mexists_ind
@ ^ [Y1: mu] : ( meq_ind @ Y0 @ Y1 ) ) ) ) ) ),
inference(flattening,[],[f100]) ).
thf(f102,plain,
( meq_ind
= ( ^ [Y0: mu,Y1: mu,Y2: $i] : ( Y0 = Y1 ) ) ),
inference(cnf_transformation,[],[f39]) ).
thf(f104,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f42]) ).
thf(f111,plain,
( mforall_ind
= ( ^ [Y0: mu > $i > $o,Y1: $i] :
( !! @ mu
@ ^ [Y2: mu] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f51]) ).
thf(f113,plain,
( mexists_ind
= ( ^ [Y0: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [Y1: mu] : ( mnot @ ( Y0 @ Y1 ) ) ) ) ) ),
inference(cnf_transformation,[],[f55]) ).
thf(f119,plain,
( mreflexive
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f63]) ).
thf(f129,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f83]) ).
thf(f133,plain,
( mbox_s5
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_s5 @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f91]) ).
thf(f134,plain,
( mdia_s5
= ( ^ [Y0: $i > $o] : ( mnot @ ( mbox_s5 @ ( mnot @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f92]) ).
thf(f135,plain,
( ( mreflexive @ rel_s5 )
= $true ),
inference(cnf_transformation,[],[f94]) ).
thf(f138,plain,
( $true
!= ( mvalid
@ ( mforall_ind
@ ^ [Y0: mu] :
( mdia_s5
@ ( mexists_ind
@ ^ [Y1: mu] : ( meq_ind @ Y0 @ Y1 ) ) ) ) ) ),
inference(cnf_transformation,[],[f101]) ).
thf(f146,plain,
( mexists_ind
= ( ^ [Y0: mu > $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: mu > $i > $o,Y2: $i] :
( !! @ mu
@ ^ [Y3: mu] : ( Y1 @ Y3 @ Y2 ) )
@ ^ [Y1: mu] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( Y0 @ Y1 ) ) ) ) ) ),
inference(definition_unfolding,[],[f113,f104,f111,f104]) ).
thf(f150,plain,
( mdia_s5
= ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ ( ^ [Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( rel_s5 @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) )
@ ( ^ [Y1: $i > $o,Y2: $i] :
~ ( Y1 @ Y2 )
@ Y0 ) ) ) ) ),
inference(definition_unfolding,[],[f134,f104,f133,f104]) ).
thf(f151,plain,
( $true
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 @ Y1 ) )
@ rel_s5 ) ),
inference(definition_unfolding,[],[f135,f119]) ).
thf(f154,plain,
( $true
!= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: mu > $i > $o,Y1: $i] :
( !! @ mu
@ ^ [Y2: mu] : ( Y0 @ Y2 @ Y1 ) )
@ ^ [Y0: mu] :
( ^ [Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: $i > $o,Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ~ ( rel_s5 @ Y3 @ Y4 )
| ( Y2 @ Y4 ) ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y1 ) ) )
@ ( ^ [Y1: mu > $i > $o] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: mu > $i > $o,Y3: $i] :
( !! @ mu
@ ^ [Y4: mu] : ( Y2 @ Y4 @ Y3 ) )
@ ^ [Y2: mu] :
( ^ [Y3: $i > $o,Y4: $i] :
~ ( Y3 @ Y4 )
@ ( Y1 @ Y2 ) ) ) )
@ ^ [Y1: mu] :
( ^ [Y2: mu,Y3: mu,Y4: $i] : ( Y2 = Y3 )
@ Y0
@ Y1 ) ) ) ) ) ),
inference(definition_unfolding,[],[f138,f129,f111,f150,f146,f102]) ).
thf(f155,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_s5 @ Y0 @ Y2 )
| ~ ~ ( !! @ mu
@ ^ [Y3: mu] : ( Y1 != Y3 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f154]) ).
thf(f156,plain,
( $false
= ( ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
~ ( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_s5 @ Y0 @ Y2 )
| ~ ~ ( !! @ mu
@ ^ [Y3: mu] : ( Y1 != Y3 ) ) ) ) )
@ sK0 ) ),
inference(sigma_proxy_clausification,[],[f155]) ).
thf(f157,plain,
( $false
= ( !! @ mu
@ ^ [Y0: mu] :
~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_s5 @ sK0 @ Y1 )
| ~ ~ ( !! @ mu
@ ^ [Y2: mu] : ( Y0 != Y2 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f156]) ).
thf(f158,plain,
( $false
= ( ^ [Y0: mu] :
~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_s5 @ sK0 @ Y1 )
| ~ ~ ( !! @ mu
@ ^ [Y2: mu] : ( Y0 != Y2 ) ) ) )
@ sK1 ) ),
inference(sigma_proxy_clausification,[],[f157]) ).
thf(f159,plain,
( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_s5 @ sK0 @ Y0 )
| ~ ~ ( !! @ mu
@ ^ [Y1: mu] : ( sK1 != Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f158]) ).
thf(f160,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_s5 @ sK0 @ Y0 )
| ~ ~ ( !! @ mu
@ ^ [Y1: mu] : ( sK1 != Y1 ) ) ) ) ),
inference(not_proxy_clausification,[],[f159]) ).
thf(f161,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ~ ( rel_s5 @ sK0 @ Y0 )
| ~ ~ ( !! @ mu
@ ^ [Y1: mu] : ( sK1 != Y1 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f160]) ).
thf(f162,plain,
! [X1: $i] :
( $true
= ( ~ ( rel_s5 @ sK0 @ X1 )
| ~ ~ ( !! @ mu
@ ^ [Y0: mu] : ( sK1 != Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f161]) ).
thf(f163,plain,
! [X1: $i] :
( ( $true
= ( ~ ~ ( !! @ mu
@ ^ [Y0: mu] : ( sK1 != Y0 ) ) ) )
| ( $true
= ( ~ ( rel_s5 @ sK0 @ X1 ) ) ) ),
inference(or_proxy_clausification,[],[f162]) ).
thf(f164,plain,
! [X1: $i] :
( ( $false
= ( ~ ( !! @ mu
@ ^ [Y0: mu] : ( sK1 != Y0 ) ) ) )
| ( $true
= ( ~ ( rel_s5 @ sK0 @ X1 ) ) ) ),
inference(not_proxy_clausification,[],[f163]) ).
thf(f165,plain,
! [X1: $i] :
( ( $true
= ( !! @ mu
@ ^ [Y0: mu] : ( sK1 != Y0 ) ) )
| ( $true
= ( ~ ( rel_s5 @ sK0 @ X1 ) ) ) ),
inference(not_proxy_clausification,[],[f164]) ).
thf(f166,plain,
! [X2: mu,X1: $i] :
( ( $true
= ( ^ [Y0: mu] : ( sK1 != Y0 )
@ X2 ) )
| ( $true
= ( ~ ( rel_s5 @ sK0 @ X1 ) ) ) ),
inference(pi_proxy_clausification,[],[f165]) ).
thf(f167,plain,
! [X2: mu,X1: $i] :
( ( $true
= ( ^ [Y0: mu] : ( sK1 != Y0 )
@ X2 ) )
| ( $false
= ( rel_s5 @ sK0 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f166]) ).
thf(f168,plain,
! [X2: mu,X1: $i] :
( ( $true
= ( sK1 != X2 ) )
| ( $false
= ( rel_s5 @ sK0 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f167]) ).
thf(f169,plain,
! [X2: mu,X1: $i] :
( ( $false
= ( sK1 = X2 ) )
| ( $false
= ( rel_s5 @ sK0 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f168]) ).
thf(f170,plain,
! [X2: mu,X1: $i] :
( ( sK1 != X2 )
| ( $false
= ( rel_s5 @ sK0 @ X1 ) ) ),
inference(equality_proxy_clausification,[],[f169]) ).
thf(f186,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] : ( rel_s5 @ Y0 @ Y0 ) ) ),
inference(beta-eta_normalization,[],[f151]) ).
thf(f187,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] : ( rel_s5 @ Y0 @ Y0 )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f186]) ).
thf(f188,plain,
! [X1: $i] :
( $true
= ( rel_s5 @ X1 @ X1 ) ),
inference(beta-eta_normalization,[],[f187]) ).
thf(f190,definition,
( spl2_1
<=> ! [X1: $i] :
( $false
= ( rel_s5 @ sK0 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f191,plain,
( ! [X1: $i] :
( $false
= ( rel_s5 @ sK0 @ X1 ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f190]) ).
thf(f193,definition,
( spl2_2
<=> ! [X2: mu] : ( sK1 != X2 ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f194,plain,
( ! [X2: mu] : ( sK1 != X2 )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f193]) ).
thf(f195,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f170,f193,f190]) ).
thf(f196,plain,
( $false
| ~ spl2_2 ),
inference(equality_resolution,[],[f194]) ).
thf(f197,plain,
~ spl2_2,
inference(avatar_contradiction_clause,[],[f196]) ).
thf(f207,plain,
( ( $true = $false )
| ~ spl2_1 ),
inference(constrained_superposition,[],[f188,f191]) ).
thf(f211,plain,
( $false
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f207]) ).
thf(f212,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f211]) ).
cnf(s1,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f195]) ).
cnf(s2,plain,
~ spl2_2,
inference(sat_conversion,[],[f197]) ).
cnf(s4,plain,
~ spl2_1,
inference(sat_conversion,[],[f212]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s1,s2,s4]) ).
thf(f213,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO485^6 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n019.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 17:08:48 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.27 % (1089975)Will run a generic schedule for satisfiability detection.
% 0.19/0.27 % (1089981)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3286002840_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.27 % Exception at run slice level
% 0.19/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.27 % (1089982)% WARNING: option uhcvi not known.
% 0.19/0.27 % (1089984)dis+10_1_sil=32000:sp=arity:random_seed=2553654438:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.27 % (1089982)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3054126935:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.27 % (1089983)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3105595758:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.27 % (1089985)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1400934989:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.27 % (1089986)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2578914531:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.27 % (1089982)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.27 % (1089985)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.27 % (1089982)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.27 % (1089989)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2658168635:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.19/0.27 % (1089984) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1089975-1089984"...
% 0.19/0.27 % (1089985) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1089975-1089985"...
% 0.19/0.27 % (1089982) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1089975-1089982"...
% 0.19/0.27 % (1089986) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1089975-1089986"...
% 0.19/0.27 % (1089983) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1089975-1089983"...
% 0.19/0.27 % Exception at run slice level
% 0.19/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.27 % (1089982)...printing done.
% 0.19/0.27 % (1089985)...printing done.
% 0.19/0.27 % (1089984)...printing done.
% 0.19/0.27 % (1089986)...printing done.
% 0.19/0.27 % (1089983)...printing done.
% 0.19/0.27 % (1089982)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27 % (1089982)------------------------------
% 0.19/0.27 % (1089982)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (1089982)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (1089982)CaDiCaL version: 2.1.3
% 0.19/0.27 % (1089982)Termination reason: Refutation
% 0.19/0.27 % (1089982)Time elapsed: 0.008 s
% 0.19/0.27 % (1089982)Peak memory usage: 12 MB
% 0.19/0.27 % (1089982)Instructions burned: 13 (million)
% 0.19/0.27 % (1089975)Success in time 0.042 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------