%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYN390^4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:41:42 AM UTC 2026
% Result : Theorem 0.24s 0.36s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 11
% Syntax : Number of formulae : 66 ( 55 unt; 0 typ; 0 def)
% Number of atoms : 360 ( 70 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 553 ( 27 ~; 26 |; 10 &; 408 @)
% ( 0 <=>; 44 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 124 ( 124 >; 0 *; 0 +; 0 <<)
% Number of symbols : 38 ( 34 usr; 5 con; 0-4 aty)
% ( 38 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 218 ( 210 ^; 8 !; 0 ?; 218 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
irel: $i > $i > $o ).
thf(func_def_2,type,
mnot: ( $i > $o ) > $i > $o ).
thf(func_def_3,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_4,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_5,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_6,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
iatom: ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
inot: ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
itrue: $i > $o ).
thf(func_def_10,type,
ifalse: $i > $o ).
thf(func_def_11,type,
iand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_12,type,
ior: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_13,type,
iimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_14,type,
iimplied: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_15,type,
iequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_16,type,
ixor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_17,type,
ivalid: ( $i > $o ) > $o ).
thf(func_def_18,type,
isatisfiable: ( $i > $o ) > $o ).
thf(func_def_19,type,
icountersatisfiable: ( $i > $o ) > $o ).
thf(func_def_20,type,
iinvalid: ( $i > $o ) > $o ).
thf(func_def_21,type,
p: $i > $o ).
thf(func_def_24,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_25,type,
vNOT: $o > $o ).
thf(func_def_26,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_27,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_28,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_29,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_30,type,
vAND: $o > $o > $o ).
thf(func_def_31,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_32,type,
vIMP: $o > $o > $o ).
thf(func_def_33,type,
vOR: $o > $o > $o ).
thf(f3,axiom,
( ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) )
= mnot ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',mnot) ).
thf(f4,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= mor ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',mor) ).
thf(f5,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) )
= mand ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',mand) ).
thf(f6,axiom,
( mimplies
= ( ^ [X0: $i > $o,X1: $i > $o] : ( mor @ ( mnot @ X0 ) @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',mimplies) ).
thf(f7,axiom,
( ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ( irel @ X1 @ X2 )
=> ( X0 @ X2 ) ) )
= mbox_s4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',mbox_s4) ).
thf(f8,axiom,
( ( ^ [X0: $i > $o] : X0 )
= iatom ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',iatom) ).
thf(f12,axiom,
( iand
= ( ^ [X0: $i > $o,X1: $i > $o] : ( mand @ X0 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',iand) ).
thf(f14,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o] : ( mimplies @ ( mbox_s4 @ X0 ) @ ( mbox_s4 @ X1 ) ) )
= iimplies ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',iimplies) ).
thf(f16,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o] : ( iand @ ( iimplies @ X0 @ X1 ) @ ( iimplies @ X1 @ X0 ) ) )
= iequiv ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',iequiv) ).
thf(f18,axiom,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= ivalid ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',ivalid) ).
thf(f22,conjecture,
ivalid @ ( iequiv @ ( iatom @ p ) @ ( iatom @ p ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel11) ).
thf(f23,negated_conjecture,
~ ( ivalid @ ( iequiv @ ( iatom @ p ) @ ( iatom @ p ) ) ),
inference(negated_conjecture,[status(cth)],[f22]) ).
thf(f24,plain,
~ ( ivalid @ ( iequiv @ ( iatom @ p ) @ ( iatom @ p ) ) ),
inference(rectify,[],[f23]) ).
thf(f25,plain,
( ( ivalid @ ( iequiv @ ( iatom @ p ) @ ( iatom @ p ) ) )
!= $true ),
inference(fool_elimination,[],[f24]) ).
thf(f31,plain,
( iand
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mand @ Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f32,plain,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= ivalid ),
inference(rectify,[],[f18]) ).
thf(f33,plain,
( ivalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f32]) ).
thf(f37,plain,
( iatom
= ( ^ [Y0: $i > $o] : Y0 ) ),
inference(fool_elimination,[],[f8]) ).
thf(f39,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) )
= mand ),
inference(rectify,[],[f5]) ).
thf(f40,plain,
( mand
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f39]) ).
thf(f41,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f44,plain,
( iequiv
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( iand @ ( iimplies @ Y0 @ Y1 ) @ ( iimplies @ Y1 @ Y0 ) ) ) ),
inference(fool_elimination,[],[f16]) ).
thf(f47,plain,
( ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) )
= mnot ),
inference(rectify,[],[f3]) ).
thf(f48,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f47]) ).
thf(f49,plain,
( ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ( irel @ X1 @ X2 )
=> ( X0 @ X2 ) ) )
= mbox_s4 ),
inference(rectify,[],[f7]) ).
thf(f50,plain,
( mbox_s4
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( irel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f49]) ).
thf(f51,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= mor ),
inference(rectify,[],[f4]) ).
thf(f52,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f51]) ).
thf(f55,plain,
( iimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mimplies @ ( mbox_s4 @ Y0 ) @ ( mbox_s4 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f14]) ).
thf(f56,plain,
( ( ivalid @ ( iequiv @ ( iatom @ p ) @ ( iatom @ p ) ) )
!= $true ),
inference(flattening,[],[f25]) ).
thf(f60,plain,
( mand
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f40]) ).
thf(f61,plain,
( iequiv
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( iand @ ( iimplies @ Y0 @ Y1 ) @ ( iimplies @ Y1 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f44]) ).
thf(f62,plain,
( iatom
= ( ^ [Y0: $i > $o] : Y0 ) ),
inference(cnf_transformation,[],[f37]) ).
thf(f63,plain,
( ( ivalid @ ( iequiv @ ( iatom @ p ) @ ( iatom @ p ) ) )
!= $true ),
inference(cnf_transformation,[],[f56]) ).
thf(f64,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(cnf_transformation,[],[f41]) ).
thf(f65,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f52]) ).
thf(f67,plain,
( mbox_s4
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( irel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f50]) ).
thf(f72,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f48]) ).
thf(f76,plain,
( iand
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mand @ Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f31]) ).
thf(f78,plain,
( iimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mimplies @ ( mbox_s4 @ Y0 ) @ ( mbox_s4 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f55]) ).
thf(f81,plain,
( ivalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f33]) ).
thf(f84,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,[],[f64,f65,f72]) ).
thf(f87,plain,
( iand
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
& ( Y3 @ Y4 ) )
@ Y0
@ Y1 ) ) ),
inference(definition_unfolding,[],[f76,f60]) ).
thf(f89,plain,
( iimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o] :
( ^ [Y4: $i > $o,Y5: $i > $o,Y6: $i] :
( ( Y4 @ Y6 )
| ( Y5 @ Y6 ) )
@ ( ^ [Y4: $i > $o,Y5: $i] :
~ ( Y4 @ Y5 )
@ Y2 )
@ Y3 )
@ ( ^ [Y2: $i > $o,Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ( irel @ Y3 @ Y4 )
=> ( Y2 @ Y4 ) ) )
@ Y0 )
@ ( ^ [Y2: $i > $o,Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ( irel @ Y3 @ Y4 )
=> ( Y2 @ Y4 ) ) )
@ Y1 ) ) ) ),
inference(definition_unfolding,[],[f78,f84,f67,f67]) ).
thf(f91,plain,
( iequiv
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o] :
( ^ [Y4: $i > $o,Y5: $i > $o,Y6: $i] :
( ( Y4 @ Y6 )
& ( Y5 @ Y6 ) )
@ Y2
@ Y3 )
@ ( ^ [Y2: $i > $o,Y3: $i > $o] :
( ^ [Y4: $i > $o,Y5: $i > $o] :
( ^ [Y6: $i > $o,Y7: $i > $o,Y8: $i] :
( ( Y6 @ Y8 )
| ( Y7 @ Y8 ) )
@ ( ^ [Y6: $i > $o,Y7: $i] :
~ ( Y6 @ Y7 )
@ Y4 )
@ Y5 )
@ ( ^ [Y4: $i > $o,Y5: $i] :
( !! @ $i
@ ^ [Y6: $i] :
( ( irel @ Y5 @ Y6 )
=> ( Y4 @ Y6 ) ) )
@ Y2 )
@ ( ^ [Y4: $i > $o,Y5: $i] :
( !! @ $i
@ ^ [Y6: $i] :
( ( irel @ Y5 @ Y6 )
=> ( Y4 @ Y6 ) ) )
@ Y3 ) )
@ Y0
@ Y1 )
@ ( ^ [Y2: $i > $o,Y3: $i > $o] :
( ^ [Y4: $i > $o,Y5: $i > $o] :
( ^ [Y6: $i > $o,Y7: $i > $o,Y8: $i] :
( ( Y6 @ Y8 )
| ( Y7 @ Y8 ) )
@ ( ^ [Y6: $i > $o,Y7: $i] :
~ ( Y6 @ Y7 )
@ Y4 )
@ Y5 )
@ ( ^ [Y4: $i > $o,Y5: $i] :
( !! @ $i
@ ^ [Y6: $i] :
( ( irel @ Y5 @ Y6 )
=> ( Y4 @ Y6 ) ) )
@ Y2 )
@ ( ^ [Y4: $i > $o,Y5: $i] :
( !! @ $i
@ ^ [Y6: $i] :
( ( irel @ Y5 @ Y6 )
=> ( Y4 @ Y6 ) ) )
@ Y3 ) )
@ Y1
@ Y0 ) ) ) ),
inference(definition_unfolding,[],[f61,f87,f89,f89]) ).
thf(f93,plain,
( ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o] :
( ^ [Y4: $i > $o,Y5: $i > $o,Y6: $i] :
( ( Y4 @ Y6 )
& ( Y5 @ Y6 ) )
@ Y2
@ Y3 )
@ ( ^ [Y2: $i > $o,Y3: $i > $o] :
( ^ [Y4: $i > $o,Y5: $i > $o] :
( ^ [Y6: $i > $o,Y7: $i > $o,Y8: $i] :
( ( Y6 @ Y8 )
| ( Y7 @ Y8 ) )
@ ( ^ [Y6: $i > $o,Y7: $i] :
~ ( Y6 @ Y7 )
@ Y4 )
@ Y5 )
@ ( ^ [Y4: $i > $o,Y5: $i] :
( !! @ $i
@ ^ [Y6: $i] :
( ( irel @ Y5 @ Y6 )
=> ( Y4 @ Y6 ) ) )
@ Y2 )
@ ( ^ [Y4: $i > $o,Y5: $i] :
( !! @ $i
@ ^ [Y6: $i] :
( ( irel @ Y5 @ Y6 )
=> ( Y4 @ Y6 ) ) )
@ Y3 ) )
@ Y0
@ Y1 )
@ ( ^ [Y2: $i > $o,Y3: $i > $o] :
( ^ [Y4: $i > $o,Y5: $i > $o] :
( ^ [Y6: $i > $o,Y7: $i > $o,Y8: $i] :
( ( Y6 @ Y8 )
| ( Y7 @ Y8 ) )
@ ( ^ [Y6: $i > $o,Y7: $i] :
~ ( Y6 @ Y7 )
@ Y4 )
@ Y5 )
@ ( ^ [Y4: $i > $o,Y5: $i] :
( !! @ $i
@ ^ [Y6: $i] :
( ( irel @ Y5 @ Y6 )
=> ( Y4 @ Y6 ) ) )
@ Y2 )
@ ( ^ [Y4: $i > $o,Y5: $i] :
( !! @ $i
@ ^ [Y6: $i] :
( ( irel @ Y5 @ Y6 )
=> ( Y4 @ Y6 ) ) )
@ Y3 ) )
@ Y1
@ Y0 ) )
@ ( ^ [Y0: $i > $o] : Y0
@ p )
@ ( ^ [Y0: $i > $o] : Y0
@ p ) ) )
!= $true ),
inference(definition_unfolding,[],[f63,f81,f91,f62,f62]) ).
thf(f94,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( irel @ Y0 @ Y1 )
=> ( p @ Y1 ) ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ( irel @ Y0 @ Y1 )
=> ( p @ Y1 ) ) ) )
& ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( irel @ Y0 @ Y1 )
=> ( p @ Y1 ) ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ( irel @ Y0 @ Y1 )
=> ( p @ Y1 ) ) ) ) ) )
!= $true ),
inference(beta-eta_normalization,[],[f93]) ).
thf(f95,plain,
( $false
= ( ^ [Y0: $i] :
( ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( irel @ Y0 @ Y1 )
=> ( p @ Y1 ) ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ( irel @ Y0 @ Y1 )
=> ( p @ Y1 ) ) ) )
& ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( irel @ Y0 @ Y1 )
=> ( p @ Y1 ) ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ( irel @ Y0 @ Y1 )
=> ( p @ Y1 ) ) ) ) )
@ sK0 ) ),
inference(sigma_proxy_clausification,[],[f94]) ).
thf(f96,plain,
( $false
= ( ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) ) )
| ( !! @ $i
@ ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) ) ) )
& ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) ) )
| ( !! @ $i
@ ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f95]) ).
thf(f97,plain,
( ( ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) ) )
| ( !! @ $i
@ ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) ) ) )
= $false )
| ( ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) ) )
| ( !! @ $i
@ ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) ) ) )
= $false ) ),
inference(and_proxy_clausification,[],[f96]) ).
thf(f98,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) ) )
= $false )
| ( ( !! @ $i
@ ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) ) )
= $false ) ),
inference(or_proxy_clausification,[],[f97]) ).
thf(f99,plain,
( ( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) ) ) ) )
| ( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) ) ) ) ) ),
inference(or_proxy_clausification,[],[f97]) ).
thf(f100,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) ) )
= $true )
| ( ( !! @ $i
@ ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) ) )
= $true ) ),
inference(not_proxy_clausification,[],[f99]) ).
thf(f101,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) )
@ X1 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) )
@ X1 ) ) ),
inference(pi_proxy_clausification,[],[f100]) ).
thf(f102,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) )
@ X1 ) ),
inference(duplicate_literal_removal,[],[f101]) ).
thf(f103,plain,
! [X1: $i] :
( ( ( irel @ sK0 @ X1 )
=> ( p @ X1 ) )
= $true ),
inference(beta-eta_normalization,[],[f102]) ).
thf(f104,plain,
! [X1: $i] :
( ( ( irel @ sK0 @ X1 )
= $false )
| ( $true
= ( p @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f103]) ).
thf(f105,plain,
( ( ( ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) )
@ sK1 )
= $false )
| ( ( ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) )
@ sK1 )
= $false ) ),
inference(sigma_proxy_clausification,[],[f98]) ).
thf(f106,plain,
( ( ^ [Y0: $i] :
( ( irel @ sK0 @ Y0 )
=> ( p @ Y0 ) )
@ sK1 )
= $false ),
inference(duplicate_literal_removal,[],[f105]) ).
thf(f107,plain,
( $false
= ( ( irel @ sK0 @ sK1 )
=> ( p @ sK1 ) ) ),
inference(beta-eta_normalization,[],[f106]) ).
thf(f108,plain,
( $false
= ( p @ sK1 ) ),
inference(imp_proxy_clausification,[],[f107]) ).
thf(f109,plain,
( ( irel @ sK0 @ sK1 )
= $true ),
inference(imp_proxy_clausification,[],[f107]) ).
thf(f110,plain,
( ( $false = $true )
| ( ( p @ sK1 )
= $true ) ),
inference(constrained_superposition,[],[f109,f104]) ).
thf(f112,plain,
( ( p @ sK1 )
= $true ),
inference(trivial_inequality_removal,[],[f110]) ).
thf(f114,plain,
$false = $true,
inference(forward_demodulation,[],[f112,f108]) ).
thf(f115,plain,
$false,
inference(trivial_inequality_removal,[],[f114]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN390^4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 % Computer : n007.cluster.edu
% 0.08/0.22 % Model : x86_64 x86_64
% 0.08/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.22 % Memory : 8046.5625MB
% 0.08/0.22 % OS : Linux 6.8.0-71-generic
% 0.08/0.22 % CPULimit : 300
% 0.08/0.22 % WCLimit : 300
% 0.08/0.22 % DateTime : Tue Sep 29 16:13:41 UTC 2026
% 0.08/0.22 % CPUTime :
% 0.08/0.22 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.28 Running higher-order theorem proving
% 0.24/0.29 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.24/0.36 % (3568615)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.24/0.36 % (3568622)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=949472454:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.24/0.36 % (3568622)Instruction limit reached!
% 0.24/0.36 % (3568622)------------------------------
% 0.24/0.36 % (3568622)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.36 % (3568622)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.36 % (3568622)CaDiCaL version: 2.1.3
% 0.24/0.36 % (3568622)Termination reason: Instruction limit
% 0.24/0.36 % (3568622)Termination phase: Saturation
% 0.24/0.36 % (3568622)Time elapsed: 0.002 s
% 0.24/0.36 % (3568622)Peak memory usage: 11 MB
% 0.24/0.36 % (3568622)Instructions burned: 4 (million)
% 0.24/0.36 % (3568625)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1115740180:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.24/0.36 % (3568625) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3568615-3568625"...
% 0.24/0.36 % (3568620)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2651034328:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.24/0.36 % (3568621)lrs+10_16_si=on:nwc=1.5:random_seed=277617681:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.24/0.36 % (3568626)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.24/0.36 % (3568626)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.24/0.36 % (3568623)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=2947362111: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.24/0.36 % (3568624)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1125409490:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.24/0.36 % (3568625)...printing done.
% 0.24/0.36 % (3568620) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3568615-3568620"...
% 0.24/0.36 % (3568626)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=4152140364:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.24/0.36 % (3568621) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3568615-3568621"...
% 0.24/0.36 % (3568625)Refutation found. Thanks to Tanya!
% 0.24/0.36 % SZS status Theorem for theBenchmark
% 0.24/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.36 % (3568625)------------------------------
% 0.24/0.36 % (3568625)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.36 % (3568625)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.36 % (3568625)CaDiCaL version: 2.1.3
% 0.24/0.36 % (3568625)Termination reason: Refutation
% 0.24/0.36 % (3568625)Time elapsed: 0.011 s
% 0.24/0.36 % (3568625)Peak memory usage: 12 MB
% 0.24/0.36 % (3568625)Instructions burned: 10 (million)
% 0.24/0.36 % (3568615)Success in time 0.055 s
% 0.24/0.36 % Vampire exiting
%------------------------------------------------------------------------------