%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO421^1 : 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 : n004.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:39 AM UTC 2026
% Result : Theorem 0.20s 0.30s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 8
% Syntax : Number of formulae : 64 ( 52 unt; 0 typ; 0 def)
% Number of atoms : 321 ( 65 equ; 0 cnn)
% Maximal formula atoms : 8 ( 5 avg)
% Number of connectives : 436 ( 75 ~; 42 |; 0 &; 287 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 55 ( 55 >; 0 *; 0 +; 0 <<)
% Number of symbols : 56 ( 51 usr; 5 con; 0-4 aty)
% ( 26 !!; 6 ??; 0 @@+; 0 @@-)
% Number of variables : 127 ( 107 ^; 18 !; 2 ?; 127 :)
% 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_d: $i > $i > $o ).
thf(func_def_33,type,
mbox_d: ( $i > $o ) > $i > $o ).
thf(func_def_34,type,
mdia_d: ( $i > $o ) > $i > $o ).
thf(func_def_35,type,
p: $i > $o ).
thf(func_def_36,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_37,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_38,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_39,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_40,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_41,type,
vNOT: $o > $o ).
thf(func_def_42,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_45,type,
vOR: $o > $o > $o ).
thf(func_def_46,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_47,type,
vIMP: $o > $o > $o ).
thf(func_def_48,type,
vAND: $o > $o > $o ).
thf(func_def_49,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_50,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_52,type,
sK1: $i > $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,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= mor ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mor) ).
thf(f5,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o] : ( mnot @ ( mor @ ( mnot @ X0 ) @ ( mnot @ X1 ) ) ) )
= mand ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mand) ).
thf(f20,axiom,
( mserial
= ( ^ [X0: $i > $i > $o] :
! [X1: $i] :
? [X2: $i] : ( X0 @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mserial) ).
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_d
= ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ( X0 @ X2 )
| ~ ( rel_d @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^2.ax',mbox_d) ).
thf(f34,axiom,
mserial @ rel_d,
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^2.ax',a1) ).
thf(f35,conjecture,
mvalid @ ( mnot @ ( mand @ ( mbox_d @ p ) @ ( mbox_d @ ( mnot @ p ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
thf(f36,negated_conjecture,
~ ( mvalid @ ( mnot @ ( mand @ ( mbox_d @ p ) @ ( mbox_d @ ( mnot @ p ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f35]) ).
thf(f39,plain,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
inference(rectify,[],[f3]) ).
thf(f40,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f39]) ).
thf(f44,plain,
~ ( mvalid @ ( mnot @ ( mand @ ( mbox_d @ p ) @ ( mbox_d @ ( mnot @ p ) ) ) ) ),
inference(rectify,[],[f36]) ).
thf(f45,plain,
( ( mvalid @ ( mnot @ ( mand @ ( mbox_d @ p ) @ ( mbox_d @ ( mnot @ p ) ) ) ) )
!= $true ),
inference(fool_elimination,[],[f44]) ).
thf(f61,plain,
( mbox_d
= ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ( X0 @ X2 )
| ~ ( rel_d @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f32]) ).
thf(f62,plain,
( mbox_d
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_d @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f61]) ).
thf(f65,plain,
( mserial
= ( ^ [X0: $i > $i > $o] :
! [X1: $i] :
? [X2: $i] : ( X0 @ X1 @ X2 ) ) ),
inference(rectify,[],[f20]) ).
thf(f66,plain,
( mserial
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f65]) ).
thf(f67,plain,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
inference(rectify,[],[f28]) ).
thf(f68,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f67]) ).
thf(f77,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= mor ),
inference(rectify,[],[f4]) ).
thf(f78,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f77]) ).
thf(f87,plain,
( mand
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mnot @ ( mor @ ( mnot @ Y0 ) @ ( mnot @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f89,plain,
mserial @ rel_d,
inference(rectify,[],[f34]) ).
thf(f90,plain,
( ( mserial @ rel_d )
= $true ),
inference(fool_elimination,[],[f89]) ).
thf(f95,plain,
( ( mvalid @ ( mnot @ ( mand @ ( mbox_d @ p ) @ ( mbox_d @ ( mnot @ p ) ) ) ) )
!= $true ),
inference(flattening,[],[f45]) ).
thf(f101,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f78]) ).
thf(f103,plain,
( ( mvalid @ ( mnot @ ( mand @ ( mbox_d @ p ) @ ( mbox_d @ ( mnot @ p ) ) ) ) )
!= $true ),
inference(cnf_transformation,[],[f95]) ).
thf(f109,plain,
( mserial
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f66]) ).
thf(f114,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f68]) ).
thf(f118,plain,
( mand
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mnot @ ( mor @ ( mnot @ Y0 ) @ ( mnot @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f87]) ).
thf(f119,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f40]) ).
thf(f126,plain,
( mbox_d
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_d @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f62]) ).
thf(f129,plain,
( ( mserial @ rel_d )
= $true ),
inference(cnf_transformation,[],[f90]) ).
thf(f133,plain,
( mand
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y1 ) ) ) ) ),
inference(definition_unfolding,[],[f118,f119,f101,f119,f119]) ).
thf(f143,plain,
( $true
!= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y1 ) ) )
@ ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_d @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) )
@ p )
@ ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ~ ( rel_d @ Y1 @ Y2 )
| ( Y0 @ Y2 ) ) )
@ ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 )
@ p ) ) ) ) ) ),
inference(definition_unfolding,[],[f103,f114,f119,f133,f126,f126,f119]) ).
thf(f144,plain,
( ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) ) )
@ rel_d )
= $true ),
inference(definition_unfolding,[],[f129,f109]) ).
thf(f145,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
~ ~ ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_d @ Y0 @ Y1 )
| ( p @ Y1 ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_d @ Y0 @ Y1 )
| ~ ( p @ Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f143]) ).
thf(f146,plain,
( ( ^ [Y0: $i] :
~ ~ ( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_d @ Y0 @ Y1 )
| ( p @ Y1 ) ) )
| ~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( rel_d @ Y0 @ Y1 )
| ~ ( p @ Y1 ) ) ) )
@ sK0 )
= $false ),
inference(sigma_proxy_clausification,[],[f145]) ).
thf(f147,plain,
( $false
= ( ~ ~ ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_d @ sK0 @ Y0 )
| ( p @ Y0 ) ) )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_d @ sK0 @ Y0 )
| ~ ( p @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f146]) ).
thf(f148,plain,
( $true
= ( ~ ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_d @ sK0 @ Y0 )
| ( p @ Y0 ) ) )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_d @ sK0 @ Y0 )
| ~ ( p @ Y0 ) ) ) ) ) ),
inference(not_proxy_clausification,[],[f147]) ).
thf(f149,plain,
( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_d @ sK0 @ Y0 )
| ( p @ Y0 ) ) )
| ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_d @ sK0 @ Y0 )
| ~ ( p @ Y0 ) ) ) ) ),
inference(not_proxy_clausification,[],[f148]) ).
thf(f150,plain,
( ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_d @ sK0 @ Y0 )
| ~ ( p @ Y0 ) ) ) )
= $false ),
inference(or_proxy_clausification,[],[f149]) ).
thf(f151,plain,
( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_d @ sK0 @ Y0 )
| ( p @ Y0 ) ) ) ) ),
inference(or_proxy_clausification,[],[f149]) ).
thf(f152,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_d @ sK0 @ Y0 )
| ( p @ Y0 ) ) )
= $true ),
inference(not_proxy_clausification,[],[f151]) ).
thf(f153,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ~ ( rel_d @ sK0 @ Y0 )
| ( p @ Y0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f152]) ).
thf(f154,plain,
! [X1: $i] :
( $true
= ( ~ ( rel_d @ sK0 @ X1 )
| ( p @ X1 ) ) ),
inference(beta-eta_normalization,[],[f153]) ).
thf(f155,plain,
! [X1: $i] :
( ( $true
= ( p @ X1 ) )
| ( $true
= ( ~ ( rel_d @ sK0 @ X1 ) ) ) ),
inference(or_proxy_clausification,[],[f154]) ).
thf(f156,plain,
! [X1: $i] :
( ( $false
= ( rel_d @ sK0 @ X1 ) )
| ( $true
= ( p @ X1 ) ) ),
inference(not_proxy_clausification,[],[f155]) ).
thf(f157,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( rel_d @ sK0 @ Y0 )
| ~ ( p @ Y0 ) ) ) ),
inference(not_proxy_clausification,[],[f150]) ).
thf(f158,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ~ ( rel_d @ sK0 @ Y0 )
| ~ ( p @ Y0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f157]) ).
thf(f159,plain,
! [X1: $i] :
( ( ~ ( rel_d @ sK0 @ X1 )
| ~ ( p @ X1 ) )
= $true ),
inference(beta-eta_normalization,[],[f158]) ).
thf(f160,plain,
! [X1: $i] :
( ( $true
= ( ~ ( rel_d @ sK0 @ X1 ) ) )
| ( $true
= ( ~ ( p @ X1 ) ) ) ),
inference(or_proxy_clausification,[],[f159]) ).
thf(f161,plain,
! [X1: $i] :
( ( $true
= ( ~ ( p @ X1 ) ) )
| ( $false
= ( rel_d @ sK0 @ X1 ) ) ),
inference(not_proxy_clausification,[],[f160]) ).
thf(f162,plain,
! [X1: $i] :
( ( $false
= ( rel_d @ sK0 @ X1 ) )
| ( ( p @ X1 )
= $false ) ),
inference(not_proxy_clausification,[],[f161]) ).
thf(f163,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] : ( ?? @ $i @ ( rel_d @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f144]) ).
thf(f164,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] : ( ?? @ $i @ ( rel_d @ Y0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f163]) ).
thf(f165,plain,
! [X1: $i] :
( $true
= ( ?? @ $i @ ( rel_d @ X1 ) ) ),
inference(beta-eta_normalization,[],[f164]) ).
thf(f166,plain,
! [X1: $i] :
( $true
= ( rel_d @ X1 @ ( sK1 @ X1 ) ) ),
inference(sigma_proxy_clausification,[],[f165]) ).
thf(f167,plain,
( ( ( p @ ( sK1 @ sK0 ) )
= $false )
| ( $true = $false ) ),
inference(constrained_superposition,[],[f166,f162]) ).
thf(f170,plain,
( ( $true = $false )
| ( $true
= ( p @ ( sK1 @ sK0 ) ) ) ),
inference(constrained_superposition,[],[f156,f166]) ).
thf(f171,plain,
( ( p @ ( sK1 @ sK0 ) )
= $false ),
inference(trivial_inequality_removal,[],[f167]) ).
thf(f172,plain,
( $true
= ( p @ ( sK1 @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f170]) ).
thf(f175,plain,
$true = $false,
inference(forward_demodulation,[],[f172,f171]) ).
thf(f176,plain,
$false,
inference(trivial_inequality_removal,[],[f175]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO421^1 : 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.18 % Computer : n004.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 16:51:07 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.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 % (1555429)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.30 % (1555438)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2430940365:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.30 % (1555440)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 % (1555440)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 % (1555434)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3207142310:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.30 % (1555435)lrs+10_16_si=on:nwc=1.5:random_seed=395065758:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.30 % (1555436)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2875502041:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.30 % (1555439)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3806996871:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.30 % (1555437)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=1549455151: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 % (1555438)Instruction limit reached!
% 0.20/0.30 % (1555438)------------------------------
% 0.20/0.30 % (1555438)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (1555438)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (1555438)CaDiCaL version: 2.1.3
% 0.20/0.30 % (1555438)Termination reason: Instruction limit
% 0.20/0.30 % (1555438)Termination phase: Saturation
% 0.20/0.30 % (1555438)Time elapsed: 0.007 s
% 0.20/0.30 % (1555438)Peak memory usage: 12 MB
% 0.20/0.30 % (1555438)Instructions burned: 24 (million)
% 0.20/0.30 % (1555440)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=3918688684:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.30 % (1555436)Instruction limit reached!
% 0.20/0.30 % (1555436)------------------------------
% 0.20/0.30 % (1555436)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (1555436)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (1555436)CaDiCaL version: 2.1.3
% 0.20/0.30 % (1555436)Termination reason: Instruction limit
% 0.20/0.30 % (1555436)Termination phase: Function definition elimination
% 0.20/0.30 % (1555436)Time elapsed: 0.003 s
% 0.20/0.30 % (1555436)Peak memory usage: 10 MB
% 0.20/0.30 % (1555436)Instructions burned: 6 (million)
% 0.20/0.30 % (1555434) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1555429-1555434"...
% 0.20/0.30 % (1555435) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1555429-1555435"...
% 0.20/0.30 % (1555439) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1555429-1555439"...
% 0.20/0.30 % (1555434)...printing done.
% 0.20/0.30 % (1555435)...printing done.
% 0.20/0.30 % (1555439)...printing done.
% 0.20/0.30 % (1555440) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1555429-1555440"...
% 0.20/0.30 % (1555434)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 % (1555434)------------------------------
% 0.20/0.30 % (1555434)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (1555434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (1555434)CaDiCaL version: 2.1.3
% 0.20/0.30 % (1555434)Termination reason: Refutation
% 0.20/0.30 % (1555434)Time elapsed: 0.007 s
% 0.20/0.30 % (1555434)Peak memory usage: 12 MB
% 0.20/0.30 % (1555434)Instructions burned: 12 (million)
% 0.20/0.30 % (1555429)Success in time 0.051 s
% 0.20/0.30 % Vampire exiting
%------------------------------------------------------------------------------