%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO481^6 : 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 : n010.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:48:05 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 49 unt; 0 typ; 0 def)
% Number of atoms : 235 ( 75 equ; 0 cnn)
% Maximal formula atoms : 9 ( 4 avg)
% Number of connectives : 343 ( 59 ~; 28 |; 0 &; 229 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 52 ( 52 >; 0 *; 0 +; 0 <<)
% Number of symbols : 56 ( 52 usr; 7 con; 0-4 aty)
% ( 27 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 137 ( 131 ^; 6 !; 0 ?; 137 :)
% 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,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_36,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_37,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_38,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_39,type,
vIMP: $o > $o > $o ).
thf(func_def_40,type,
vAND: $o > $o > $o ).
thf(func_def_41,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_42,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_43,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_44,type,
vNOT: $o > $o ).
thf(func_def_47,type,
vOR: $o > $o > $o ).
thf(func_def_48,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_49,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_51,type,
sK1: mu ).
thf(func_def_52,type,
sK2: mu ).
thf(f1,axiom,
( meq_ind
= ( ^ [X0: mu,X1: mu,X2: $i] : ( X0 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',meq_ind) ).
thf(f3,axiom,
( ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) )
= mnot ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL013^0.ax',mor) ).
thf(f6,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o] : ( mor @ ( mnot @ X0 ) @ X1 ) )
= mimplies ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(f10,axiom,
( ( ^ [X0: mu > $i > $o,X1: $i] :
! [X2: mu] : ( X0 @ X2 @ X1 ) )
= mforall_ind ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mforall_ind) ).
thf(f28,axiom,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(f32,axiom,
( mbox_s5
= ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ~ ( rel_s5 @ X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^6.ax',mbox_s5) ).
thf(f37,conjecture,
( mvalid
@ ( mforall_ind
@ ^ [X0: mu] :
( mforall_ind
@ ^ [X1: mu] : ( mimplies @ ( mnot @ ( meq_ind @ X0 @ X1 ) ) @ ( mbox_s5 @ ( mnot @ ( meq_ind @ X0 @ X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
thf(f38,negated_conjecture,
~ ( mvalid
@ ( mforall_ind
@ ^ [X0: mu] :
( mforall_ind
@ ^ [X1: mu] : ( mimplies @ ( mnot @ ( meq_ind @ X0 @ X1 ) ) @ ( mbox_s5 @ ( mnot @ ( meq_ind @ X0 @ X1 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f37]) ).
thf(f45,plain,
( ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) )
= mnot ),
inference(rectify,[],[f3]) ).
thf(f46,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f45]) ).
thf(f47,plain,
~ ( mvalid
@ ( mforall_ind
@ ^ [X0: mu] :
( mforall_ind
@ ^ [X1: mu] : ( mimplies @ ( mnot @ ( meq_ind @ X0 @ X1 ) ) @ ( mbox_s5 @ ( mnot @ ( meq_ind @ X0 @ X1 ) ) ) ) ) ) ),
inference(rectify,[],[f38]) ).
thf(f48,plain,
( $true
!= ( mvalid
@ ( mforall_ind
@ ^ [Y0: mu] :
( mforall_ind
@ ^ [Y1: mu] : ( mimplies @ ( mnot @ ( meq_ind @ Y0 @ Y1 ) ) @ ( mbox_s5 @ ( mnot @ ( meq_ind @ Y0 @ Y1 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f47]) ).
thf(f49,plain,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f50,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f49]) ).
thf(f52,plain,
( ( ^ [X0: mu > $i > $o,X1: $i] :
! [X2: mu] : ( X0 @ X2 @ X1 ) )
= mforall_ind ),
inference(rectify,[],[f10]) ).
thf(f53,plain,
( mforall_ind
= ( ^ [Y0: mu > $i > $o,Y1: $i] :
( !! @ mu
@ ^ [Y2: mu] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f52]) ).
thf(f54,plain,
( mbox_s5
= ( ^ [X0: $i > $o,X1: $i] :
! [X2: $i] :
( ~ ( rel_s5 @ X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f32]) ).
thf(f55,plain,
( mbox_s5
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
| ~ ( rel_s5 @ Y1 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f54]) ).
thf(f58,plain,
( meq_ind
= ( ^ [Y0: mu,Y1: mu,Y2: $i] : ( Y0 = Y1 ) ) ),
inference(fool_elimination,[],[f1]) ).
thf(f83,plain,
( ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) )
= mvalid ),
inference(rectify,[],[f28]) ).
thf(f84,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f83]) ).
thf(f95,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f101,plain,
( $true
!= ( mvalid
@ ( mforall_ind
@ ^ [Y0: mu] :
( mforall_ind
@ ^ [Y1: mu] : ( mimplies @ ( mnot @ ( meq_ind @ Y0 @ Y1 ) ) @ ( mbox_s5 @ ( mnot @ ( meq_ind @ Y0 @ Y1 ) ) ) ) ) ) ) ),
inference(flattening,[],[f48]) ).
thf(f112,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f84]) ).
thf(f113,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f50]) ).
thf(f115,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f46]) ).
thf(f120,plain,
( meq_ind
= ( ^ [Y0: mu,Y1: mu,Y2: $i] : ( Y0 = Y1 ) ) ),
inference(cnf_transformation,[],[f58]) ).
thf(f123,plain,
( mforall_ind
= ( ^ [Y0: mu > $i > $o,Y1: $i] :
( !! @ mu
@ ^ [Y2: mu] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f53]) ).
thf(f124,plain,
( $true
!= ( mvalid
@ ( mforall_ind
@ ^ [Y0: mu] :
( mforall_ind
@ ^ [Y1: mu] : ( mimplies @ ( mnot @ ( meq_ind @ Y0 @ Y1 ) ) @ ( mbox_s5 @ ( mnot @ ( meq_ind @ Y0 @ Y1 ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f101]) ).
thf(f128,plain,
( mbox_s5
= ( ^ [Y0: $i > $o,Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
| ~ ( rel_s5 @ Y1 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f55]) ).
thf(f138,plain,
( mimplies
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(cnf_transformation,[],[f95]) ).
thf(f142,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,[],[f138,f113,f115]) ).
thf(f153,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: mu > $i > $o,Y2: $i] :
( !! @ mu
@ ^ [Y3: mu] : ( Y1 @ Y3 @ Y2 ) )
@ ^ [Y1: mu] :
( ^ [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] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: mu,Y3: mu,Y4: $i] : ( Y2 = Y3 )
@ Y0
@ Y1 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ( Y2 @ Y4 )
| ~ ( rel_s5 @ Y3 @ Y4 ) ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: mu,Y3: mu,Y4: $i] : ( Y2 = Y3 )
@ Y0
@ Y1 ) ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f124,f112,f123,f123,f142,f115,f120,f128,f115,f120]) ).
thf(f173,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
( !! @ mu
@ ^ [Y2: mu] :
( ~ ( ( Y1 != Y2 ) )
| ( !! @ $i
@ ^ [Y3: $i] :
( ( Y1 != Y2 )
| ~ ( rel_s5 @ Y0 @ Y3 ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f153]) ).
thf(f174,plain,
( ( ^ [Y0: $i] :
( !! @ mu
@ ^ [Y1: mu] :
( !! @ mu
@ ^ [Y2: mu] :
( ~ ( ( Y1 != Y2 ) )
| ( !! @ $i
@ ^ [Y3: $i] :
( ( Y1 != Y2 )
| ~ ( rel_s5 @ Y0 @ Y3 ) ) ) ) ) )
@ sK0 )
= $false ),
inference(sigma_proxy_clausification,[],[f173]) ).
thf(f175,plain,
( ( !! @ mu
@ ^ [Y0: mu] :
( !! @ mu
@ ^ [Y1: mu] :
( ~ ( ( Y0 != Y1 ) )
| ( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 != Y1 )
| ~ ( rel_s5 @ sK0 @ Y2 ) ) ) ) ) )
= $false ),
inference(beta-eta_normalization,[],[f174]) ).
thf(f176,plain,
( $false
= ( ^ [Y0: mu] :
( !! @ mu
@ ^ [Y1: mu] :
( ~ ( ( Y0 != Y1 ) )
| ( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 != Y1 )
| ~ ( rel_s5 @ sK0 @ Y2 ) ) ) ) )
@ sK1 ) ),
inference(sigma_proxy_clausification,[],[f175]) ).
thf(f177,plain,
( ( !! @ mu
@ ^ [Y0: mu] :
( ~ ( ( sK1 != Y0 ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ( sK1 != Y0 )
| ~ ( rel_s5 @ sK0 @ Y1 ) ) ) ) )
= $false ),
inference(beta-eta_normalization,[],[f176]) ).
thf(f178,plain,
( ( ^ [Y0: mu] :
( ~ ( ( sK1 != Y0 ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ( sK1 != Y0 )
| ~ ( rel_s5 @ sK0 @ Y1 ) ) ) )
@ sK2 )
= $false ),
inference(sigma_proxy_clausification,[],[f177]) ).
thf(f179,plain,
( $false
= ( ~ ( ( sK1 != sK2 ) )
| ( !! @ $i
@ ^ [Y0: $i] :
( ( sK1 != sK2 )
| ~ ( rel_s5 @ sK0 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f178]) ).
thf(f180,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ( sK1 != sK2 )
| ~ ( rel_s5 @ sK0 @ Y0 ) ) )
= $false ),
inference(or_proxy_clausification,[],[f179]) ).
thf(f181,plain,
( ( ~ ( ( sK1 != sK2 ) ) )
= $false ),
inference(or_proxy_clausification,[],[f179]) ).
thf(f182,plain,
( $true
= ( sK1 != sK2 ) ),
inference(not_proxy_clausification,[],[f181]) ).
thf(f183,plain,
( ( sK1 = sK2 )
= $false ),
inference(not_proxy_clausification,[],[f182]) ).
thf(f184,plain,
sK1 != sK2,
inference(equality_proxy_clausification,[],[f183]) ).
thf(f185,plain,
( ( ^ [Y0: $i] :
( ( sK1 != sK2 )
| ~ ( rel_s5 @ sK0 @ Y0 ) )
@ sK3 )
= $false ),
inference(sigma_proxy_clausification,[],[f180]) ).
thf(f186,plain,
( ( ( sK1 != sK2 )
| ~ ( rel_s5 @ sK0 @ sK3 ) )
= $false ),
inference(beta-eta_normalization,[],[f185]) ).
thf(f188,plain,
( ( sK1 != sK2 )
= $false ),
inference(or_proxy_clausification,[],[f186]) ).
thf(f189,plain,
( $true
= ( sK1 = sK2 ) ),
inference(not_proxy_clausification,[],[f188]) ).
thf(f190,plain,
sK1 = sK2,
inference(equality_proxy_clausification,[],[f189]) ).
thf(f192,plain,
$false,
inference(forward_subsumption_resolution,[],[f190,f184]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO481^6 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n010.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % 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 17:09:18 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.24 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.21/0.28 % (3149443)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.28 % (3149460)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2344110988:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.28 % (3149460) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3149443-3149460"...
% 0.21/0.28 % (3149461)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.28 % (3149461)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.21/0.28 % (3149460)...printing done.
% 0.21/0.28 % (3149456)lrs+10_16_si=on:nwc=1.5:random_seed=2109155325:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.28 % (3149455)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=466613832:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.28 % (3149459)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3965131043:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.28 % (3149458)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=3016736101: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.21/0.28 % (3149457)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=106704502:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.28 % (3149460)Refutation found. Thanks to Tanya!
% 0.21/0.28 % SZS status Theorem for theBenchmark
% 0.21/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29 % (3149460)------------------------------
% 0.21/0.29 % (3149460)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29 % (3149460)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29 % (3149460)CaDiCaL version: 2.1.3
% 0.21/0.29 % (3149460)Termination reason: Refutation
% 0.21/0.29 % (3149460)Time elapsed: 0.005 s
% 0.21/0.29 % (3149460)Peak memory usage: 12 MB
% 0.21/0.29 % (3149460)Instructions burned: 14 (million)
% 0.21/0.29 % (3149443)Success in time 0.036 s
% 0.21/0.29 % Vampire exiting
%------------------------------------------------------------------------------