%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV429^2 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:39:57 AM UTC 2026
% Result : Theorem 0.21s 0.29s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 46 unt; 0 typ; 0 def)
% Number of atoms : 195 ( 45 equ; 0 cnn)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 231 ( 21 ~; 13 |; 0 &; 174 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 77 ( 77 >; 0 *; 0 +; 0 <<)
% Number of symbols : 50 ( 46 usr; 5 con; 0-4 aty)
% ( 12 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 109 ( 105 ^; 4 !; 0 ?; 109 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_6,type,
individuals: $tType ).
thf(func_def_1,type,
prop_a: $i > $o ).
thf(func_def_2,type,
prop_b: $i > $o ).
thf(func_def_3,type,
prop_c: $i > $o ).
thf(func_def_4,type,
mfalse: $i > $o ).
thf(func_def_5,type,
mtrue: $i > $o ).
thf(func_def_6,type,
mnot: ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
miff: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_12,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_13,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_14,type,
mall: ( individuals > $i > $o ) > $i > $o ).
thf(func_def_15,type,
mexists: ( individuals > $i > $o ) > $i > $o ).
thf(func_def_16,type,
mvalid: ( $i > $o ) > $o ).
thf(func_def_17,type,
msatisfiable: ( $i > $o ) > $o ).
thf(func_def_18,type,
mcountersatisfiable: ( $i > $o ) > $o ).
thf(func_def_19,type,
minvalid: ( $i > $o ) > $o ).
thf(func_def_20,type,
rel: $i > $i > $o ).
thf(func_def_21,type,
icl_atom: ( $i > $o ) > $i > $o ).
thf(func_def_22,type,
icl_princ: ( $i > $o ) > $i > $o ).
thf(func_def_23,type,
icl_and: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_24,type,
icl_or: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_25,type,
icl_impl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_26,type,
icl_true: $i > $o ).
thf(func_def_27,type,
icl_false: $i > $o ).
thf(func_def_28,type,
icl_says: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_29,type,
iclval: ( $i > $o ) > $o ).
thf(func_def_30,type,
icl_impl_princ: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_31,type,
a: $i > $o ).
thf(func_def_32,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_33,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_34,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_35,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_36,type,
vAND: $o > $o > $o ).
thf(func_def_37,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_38,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_39,type,
vOR: $o > $o > $o ).
thf(func_def_40,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_43,type,
vNOT: $o > $o ).
thf(func_def_44,type,
vIMP: $o > $o > $o ).
thf(func_def_45,type,
sK0: $i > ( $i > $o ) > $i ).
thf(func_def_46,type,
sK1: $i > ( $i > $o ) > $i ).
thf(f3,axiom,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^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/LCL008^0.ax',mor) ).
thf(f6,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o] : ( mor @ ( mnot @ X0 ) @ X1 ) )
= mimpl ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mimpl) ).
thf(f8,axiom,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mbox) ).
thf(f12,axiom,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mvalid) ).
thf(f17,axiom,
( icl_princ
= ( ^ [X0: $i > $o] : X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^0.ax',icl_princ) ).
thf(f24,axiom,
( iclval
= ( ^ [X0: $i > $o] : ( mvalid @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^0.ax',icl_s4_valid) ).
thf(f27,axiom,
( icl_impl_princ
= ( ^ [X0: $i > $o,X1: $i > $o] : ( mbox @ rel @ ( mimpl @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^2.ax',icl_impl_princ) ).
thf(f28,conjecture,
iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f29,negated_conjecture,
~ ( iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ) ),
inference(negated_conjecture,[status(cth)],[f28]) ).
thf(f31,plain,
( mimpl
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f36,plain,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f37,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f36]) ).
thf(f38,plain,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
inference(rectify,[],[f12]) ).
thf(f39,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f38]) ).
thf(f44,plain,
( icl_princ
= ( ^ [Y0: $i > $o] : Y0 ) ),
inference(fool_elimination,[],[f17]) ).
thf(f46,plain,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
inference(rectify,[],[f3]) ).
thf(f47,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f46]) ).
thf(f48,plain,
( iclval
= ( ^ [Y0: $i > $o] : ( mvalid @ Y0 ) ) ),
inference(fool_elimination,[],[f24]) ).
thf(f53,plain,
( icl_impl_princ
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mbox @ rel @ ( mimpl @ Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f27]) ).
thf(f60,plain,
~ ( iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ) ),
inference(rectify,[],[f29]) ).
thf(f61,plain,
( ( iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ) )
!= $true ),
inference(fool_elimination,[],[f60]) ).
thf(f63,plain,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X3 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f64,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f63]) ).
thf(f70,plain,
( ( iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ) )
!= $true ),
inference(flattening,[],[f61]) ).
thf(f71,plain,
( mimpl
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(cnf_transformation,[],[f31]) ).
thf(f73,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f39]) ).
thf(f75,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f64]) ).
thf(f76,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f47]) ).
thf(f78,plain,
( iclval
= ( ^ [Y0: $i > $o] : ( mvalid @ Y0 ) ) ),
inference(cnf_transformation,[],[f48]) ).
thf(f79,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f37]) ).
thf(f88,plain,
( ( iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ) )
!= $true ),
inference(cnf_transformation,[],[f70]) ).
thf(f92,plain,
( icl_impl_princ
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mbox @ rel @ ( mimpl @ Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f53]) ).
thf(f98,plain,
( icl_princ
= ( ^ [Y0: $i > $o] : Y0 ) ),
inference(cnf_transformation,[],[f44]) ).
thf(f101,plain,
( mimpl
= ( ^ [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,[],[f71,f79,f76]) ).
thf(f110,plain,
( iclval
= ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] : ( Y1 @ Y2 ) )
@ Y0 ) ) ),
inference(definition_unfolding,[],[f78,f73]) ).
thf(f111,plain,
( icl_impl_princ
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ( Y2 @ Y4 @ Y5 )
=> ( Y3 @ Y5 ) ) )
@ rel
@ ( ^ [Y2: $i > $o,Y3: $i > $o] :
( ^ [Y4: $i > $o,Y5: $i > $o,Y6: $i] :
( ( Y5 @ Y6 )
| ( Y4 @ Y6 ) )
@ ( ^ [Y4: $i > $o,Y5: $i] :
~ ( Y4 @ Y5 )
@ Y2 )
@ Y3 )
@ Y0
@ Y1 ) ) ) ),
inference(definition_unfolding,[],[f92,f75,f101]) ).
thf(f113,plain,
( $true
!= ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] : ( Y1 @ Y2 ) )
@ Y0 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ( Y2 @ Y4 @ Y5 )
=> ( Y3 @ Y5 ) ) )
@ rel
@ ( ^ [Y2: $i > $o,Y3: $i > $o] :
( ^ [Y4: $i > $o,Y5: $i > $o,Y6: $i] :
( ( Y5 @ Y6 )
| ( Y4 @ Y6 ) )
@ ( ^ [Y4: $i > $o,Y5: $i] :
~ ( Y4 @ Y5 )
@ Y2 )
@ Y3 )
@ Y0
@ Y1 ) )
@ ( ^ [Y0: $i > $o] : Y0
@ a )
@ ( ^ [Y0: $i > $o] : Y0
@ a ) ) ) ),
inference(definition_unfolding,[],[f88,f110,f111,f98,f98]) ).
thf(f140,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( rel @ Y0 @ Y1 )
=> ( ( a @ Y1 )
| ~ ( a @ Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f113]) ).
thf(f141,plain,
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( rel @ Y0 @ Y1 )
=> ( ( a @ Y1 )
| ~ ( a @ Y1 ) ) ) )
@ sK2 )
= $false ),
inference(sigma_proxy_clausification,[],[f140]) ).
thf(f142,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ( rel @ sK2 @ Y0 )
=> ( ( a @ Y0 )
| ~ ( a @ Y0 ) ) ) )
= $false ),
inference(beta-eta_normalization,[],[f141]) ).
thf(f143,plain,
( ( ^ [Y0: $i] :
( ( rel @ sK2 @ Y0 )
=> ( ( a @ Y0 )
| ~ ( a @ Y0 ) ) )
@ sK3 )
= $false ),
inference(sigma_proxy_clausification,[],[f142]) ).
thf(f144,plain,
( ( ( rel @ sK2 @ sK3 )
=> ( ( a @ sK3 )
| ~ ( a @ sK3 ) ) )
= $false ),
inference(beta-eta_normalization,[],[f143]) ).
thf(f145,plain,
( ( ( a @ sK3 )
| ~ ( a @ sK3 ) )
= $false ),
inference(imp_proxy_clausification,[],[f144]) ).
thf(f147,plain,
( ( ~ ( a @ sK3 ) )
= $false ),
inference(or_proxy_clausification,[],[f145]) ).
thf(f148,plain,
( ( a @ sK3 )
= $false ),
inference(or_proxy_clausification,[],[f145]) ).
thf(f149,plain,
( ( a @ sK3 )
= $true ),
inference(not_proxy_clausification,[],[f147]) ).
thf(f150,plain,
$true = $false,
inference(forward_demodulation,[],[f149,f148]) ).
thf(f151,plain,
$false,
inference(trivial_inequality_removal,[],[f150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV429^2 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n007.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 16:00:48 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.23 Running higher-order theorem proving
% 0.09/0.25 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.21/0.29 % (3551650)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.29 % (3551669)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3192589816:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.29 % (3551669) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3551650-3551669"...
% 0.21/0.29 % (3551670)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.29 % (3551670)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.29 % (3551669)...printing done.
% 0.21/0.29 % (3551669)Refutation found. Thanks to Tanya!
% 0.21/0.29 % SZS status Theorem for theBenchmark
% 0.21/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29 % (3551669)------------------------------
% 0.21/0.29 % (3551669)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29 % (3551669)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29 % (3551669)CaDiCaL version: 2.1.3
% 0.21/0.29 % (3551669)Termination reason: Refutation
% 0.21/0.29 % (3551669)Time elapsed: 0.003 s
% 0.21/0.29 % (3551669)Peak memory usage: 12 MB
% 0.21/0.29 % (3551669)Instructions burned: 9 (million)
% 0.21/0.29 % (3551650)Success in time 0.034 s
% 0.21/0.29 % Vampire exiting
%------------------------------------------------------------------------------