%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP121^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:08:26 AM UTC 2026
% Result : Theorem 0.51s 0.38s
% Output : Refutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 14 unt; 0 typ; 1 def)
% Number of atoms : 53 ( 21 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 562 ( 12 ~; 8 |; 0 &; 538 @)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 117 ( 114 usr; 15 con; 0-5 aty)
% Number of variables : 26 ( 0 sgn 26 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
set_a: $tType ).
thf(type_def_6,type,
a: $tType ).
thf(type_def_7,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
condit1627435690bove_a: ( a > a > $o ) > set_a > $o ).
thf(func_def_1,type,
condit1001553558elow_a: ( a > a > $o ) > set_a > $o ).
thf(func_def_2,type,
finite40241356em_a_a: ( a > a > a ) > $o ).
thf(func_def_3,type,
finite_finite_a: set_a > $o ).
thf(func_def_4,type,
abel_semigroup_a: ( a > a > a ) > $o ).
thf(func_def_5,type,
semigroup_a: ( a > a > a ) > $o ).
thf(func_def_6,type,
inf_inf_set_a: set_a > set_a > set_a ).
thf(func_def_7,type,
semilattice_a: ( a > a > a ) > $o ).
thf(func_def_8,type,
lattic247676691_fin_a: ( a > a > a ) > set_a > a ).
thf(func_def_9,type,
lattic1885654924_set_a: ( a > a > a ) > $o ).
thf(func_def_10,type,
lattic1781219155_fin_a: ( a > a > a ) > set_a > a ).
thf(func_def_11,type,
modula17988509_aux_a: ( a > a > a ) > ( a > a > a ) > a > a > a > a ).
thf(func_def_12,type,
modula1373251614_aux_a: ( a > a > a ) > ( a > a > a ) > a > a > a > a ).
thf(func_def_13,type,
modula581031071_aux_a: ( a > a > a ) > ( a > a > a ) > a > a > a > a ).
thf(func_def_14,type,
modula1936294176_aux_a: ( a > a > a ) > ( a > a > a ) > a > a > a > a ).
thf(func_def_15,type,
modula1144073633_aux_a: ( a > a > a ) > ( a > a > a ) > a > a > a > a ).
thf(func_def_16,type,
modula1727524044comp_a: ( a > a > $o ) > a > a > $o ).
thf(func_def_17,type,
bot_bot_set_a: set_a ).
thf(func_def_18,type,
least_a: ( a > a > $o ) > ( a > $o ) > a ).
thf(func_def_19,type,
max_a: ( a > a > $o ) > a > a > a ).
thf(func_def_20,type,
min_a: ( a > a > $o ) > a > a > a ).
thf(func_def_21,type,
ord_less_eq_set_a: set_a > set_a > $o ).
thf(func_def_22,type,
greatest_a: ( a > a > $o ) > ( a > $o ) > a ).
thf(func_def_23,type,
antimono_a_set_a: ( a > a > $o ) > ( a > set_a ) > $o ).
thf(func_def_24,type,
mono_a_set_a: ( a > a > $o ) > ( a > set_a ) > $o ).
thf(func_def_25,type,
collect_a: ( a > $o ) > set_a ).
thf(func_def_26,type,
insert_a: a > set_a > set_a ).
thf(func_def_27,type,
set_atLeast_a: ( a > a > $o ) > a > set_a ).
thf(func_def_28,type,
set_atMost_a: ( a > a > $o ) > a > set_a ).
thf(func_def_29,type,
member_a: a > set_a > $o ).
thf(func_def_30,type,
a2: a ).
thf(func_def_31,type,
b: a ).
thf(func_def_32,type,
c: a ).
thf(func_def_33,type,
inf: a > a > a ).
thf(func_def_34,type,
less_eq: a > a > $o ).
thf(func_def_35,type,
sup: a > a > a ).
thf(func_def_39,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_40,type,
vIMP: $o > $o > $o ).
thf(func_def_41,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_42,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_43,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_44,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_45,type,
vAND: $o > $o > $o ).
thf(func_def_46,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_47,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_48,type,
sK0: a > ( a > $o ) > a ).
thf(func_def_49,type,
sK1: a > ( a > $o ) > a ).
thf(func_def_50,type,
sK2: set_a > a > a ).
thf(func_def_51,type,
sK3: ( a > $o ) > a > a ).
thf(func_def_52,type,
sK4: set_a > a ).
thf(func_def_53,type,
sK5: a > set_a > a ).
thf(func_def_54,type,
sK6: set_a > a > a ).
thf(func_def_55,type,
sK7: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_56,type,
sK8: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_57,type,
sK9: a > ( a > $o ) > a ).
thf(func_def_58,type,
sK10: a > set_a > a ).
thf(func_def_59,type,
sK11: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_60,type,
sK12: ( a > a > a ) > a ).
thf(func_def_61,type,
sK13: ( a > a > a ) > a ).
thf(func_def_62,type,
sK14: ( a > a > a ) > a ).
thf(func_def_63,type,
sK15: ( a > a > a ) > a ).
thf(func_def_64,type,
sK16: ( a > a > a ) > a ).
thf(func_def_65,type,
sK17: ( a > a > a ) > a ).
thf(func_def_66,type,
sK18: ( a > a > a ) > a ).
thf(func_def_67,type,
sK19: ( a > a > a ) > a ).
thf(func_def_68,type,
sK20: ( a > a > a ) > a ).
thf(func_def_69,type,
sK21: ( a > a > a ) > a ).
thf(func_def_70,type,
sK22: a > set_a > a ).
thf(func_def_71,type,
sK23: ( a > set_a ) > a ).
thf(func_def_72,type,
sK24: ( a > set_a ) > a ).
thf(func_def_73,type,
sK25: a ).
thf(func_def_74,type,
sK26: a ).
thf(func_def_75,type,
sK27: a > ( a > $o ) > a ).
thf(func_def_76,type,
sK28: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_77,type,
sK29: ( a > $o ) > a ).
thf(func_def_78,type,
sK30: set_a > a ).
thf(func_def_79,type,
sK31: a ).
thf(func_def_80,type,
sK32: a ).
thf(func_def_81,type,
sK33: a ).
thf(func_def_82,type,
sK34: set_a > a ).
thf(func_def_83,type,
sK35: set_a > a ).
thf(func_def_84,type,
sK36: set_a > a > a ).
thf(func_def_85,type,
sK37: a ).
thf(func_def_86,type,
sK38: a ).
thf(func_def_87,type,
sK39: a ).
thf(func_def_88,type,
sK40: ( a > a > a ) > a ).
thf(func_def_89,type,
sK41: ( a > a > a ) > a ).
thf(func_def_90,type,
sK42: ( a > a > a ) > a ).
thf(func_def_91,type,
sK43: ( a > a > a ) > a ).
thf(func_def_92,type,
sK44: ( a > a > a ) > a ).
thf(func_def_93,type,
sK45: ( a > a > a ) > a ).
thf(func_def_94,type,
sK46: ( a > a > a ) > a ).
thf(func_def_95,type,
sK47: ( a > set_a ) > a ).
thf(func_def_96,type,
sK48: ( a > set_a ) > a ).
thf(func_def_97,type,
sK49: ( a > set_a ) > a ).
thf(func_def_98,type,
sK50: ( a > set_a ) > a ).
thf(func_def_99,type,
sK51: a > set_a > a ).
thf(func_def_100,type,
sK52: set_a > a > a ).
thf(func_def_101,type,
sK53: ( a > $o ) > a > a ).
thf(func_def_102,type,
sK54: a > ( a > $o ) > a ).
thf(func_def_103,type,
sK55: a > ( a > $o ) > a ).
thf(func_def_104,type,
sK56: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_105,type,
sK57: set_a > a ).
thf(func_def_106,type,
sK58: a > set_a > a ).
thf(func_def_107,type,
sK59: a > set_a > a ).
thf(func_def_108,type,
sK60: set_a > a ).
thf(func_def_109,type,
sK61: ( a > set_a ) > a ).
thf(func_def_110,type,
sK62: ( a > set_a ) > a ).
thf(func_def_111,type,
sK63: set_a > a ).
thf(func_def_112,type,
sK64: set_a > set_a > a ).
thf(func_def_113,type,
sK65: ( a > $o ) > a ).
thf(func_def_114,type,
vNOT: $o > $o ).
thf(f93,axiom,
! [X0: a,X1: a] : ( less_eq @ ( inf @ X0 @ X1 ) @ X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_92_local_Oinf_Ocobounded2) ).
thf(f127,axiom,
! [X1: a,X2: a,X0: a] :
( ( less_eq @ X0 @ X1 )
=> ( ( sup @ X0 @ ( inf @ X1 @ X2 ) )
= ( inf @ X1 @ ( sup @ X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_126_local_Omodular) ).
thf(f255,conjecture,
( ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) )
= ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(f256,negated_conjecture,
( ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) )
!= ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f255]) ).
thf(f443,plain,
! [X0: a,X1: a,X2: a] :
( ( less_eq @ X2 @ X0 )
=> ( ( inf @ X0 @ ( sup @ X2 @ X1 ) )
= ( sup @ X2 @ ( inf @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f127]) ).
thf(f444,plain,
! [X2: a,X1: a,X0: a] :
( ( ( less_eq @ X2 @ X0 )
= $true )
=> ( ( inf @ X0 @ ( sup @ X2 @ X1 ) )
= ( sup @ X2 @ ( inf @ X0 @ X1 ) ) ) ),
inference(fool_elimination,[],[f443]) ).
thf(f453,plain,
! [X0: a,X1: a] : ( less_eq @ ( inf @ X0 @ X1 ) @ X1 ),
inference(rectify,[],[f93]) ).
thf(f454,plain,
! [X0: a,X1: a] :
( ( less_eq @ ( inf @ X0 @ X1 ) @ X1 )
= $true ),
inference(fool_elimination,[],[f453]) ).
thf(f661,plain,
( ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) )
!= ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) ) ),
inference(flattening,[],[f256]) ).
thf(f854,plain,
! [X0: a,X2: a,X1: a] :
( ( ( inf @ X0 @ ( sup @ X2 @ X1 ) )
= ( sup @ X2 @ ( inf @ X0 @ X1 ) ) )
| ( ( less_eq @ X2 @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f444]) ).
thf(f1052,plain,
! [X0: a,X1: a,X2: a] :
( ( ( inf @ X0 @ ( sup @ X1 @ X2 ) )
= ( sup @ X1 @ ( inf @ X0 @ X2 ) ) )
| ( ( less_eq @ X1 @ X0 )
!= $true ) ),
inference(rectify,[],[f854]) ).
thf(f1194,plain,
( ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) )
!= ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) ) ),
inference(cnf_transformation,[],[f661]) ).
thf(f1236,plain,
! [X0: a,X1: a] :
( ( less_eq @ ( inf @ X0 @ X1 ) @ X1 )
= $true ),
inference(cnf_transformation,[],[f454]) ).
thf(f1382,plain,
! [X2: a,X0: a,X1: a] :
( ( ( inf @ X0 @ ( sup @ X1 @ X2 ) )
= ( sup @ X1 @ ( inf @ X0 @ X2 ) ) )
| ( ( less_eq @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f1052]) ).
thf(f1507,definition,
( spl66_16
<=> ( ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) )
= ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl66_16])],[avatar_definition]) ).
thf(f1509,plain,
( ( ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) )
!= ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) ) )
| spl66_16 ),
inference(avatar_component_clause,[],[f1507]) ).
thf(f1510,plain,
~ spl66_16,
inference(avatar_split_clause,[],[f1194,f1507]) ).
thf(f3211,plain,
( ( ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) )
!= ( inf @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) @ ( sup @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( sup @ a2 @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) ) ) )
| ( ( less_eq @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) )
!= $true )
| spl66_16 ),
inference(superposition,[],[f1509,f1382]) ).
thf(f3218,plain,
( ( ( less_eq @ ( inf @ ( sup @ b @ ( modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ) @ ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) )
!= $true )
| spl66_16 ),
inference(trivial_inequality_removal,[],[f3211]) ).
thf(f3221,plain,
( $false
| spl66_16 ),
inference(forward_subsumption_resolution,[],[f3218,f1236]) ).
thf(f3222,plain,
spl66_16,
inference(avatar_contradiction_clause,[],[f3221]) ).
cnf(s15,plain,
~ spl66_16,
inference(sat_conversion,[],[f1510]) ).
cnf(s177,plain,
spl66_16,
inference(sat_conversion,[],[f3222]) ).
cnf(s185,plain,
$false,
inference(rat,[],[s15,s177]) ).
thf(f3294,plain,
$false,
inference(avatar_sat_refutation,[],[s185]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP121^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n005.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % 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 19:56:31 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.20/0.27 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.51/0.38 % (2131794)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.51/0.38 % (2131802)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=1527640158: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.51/0.38 % (2131805)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.51/0.38 % (2131805)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.51/0.38 % (2131801)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1320415588:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.51/0.38 % (2131799)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3783848932:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.51/0.38 % (2131800)lrs+10_16_si=on:nwc=1.5:random_seed=2522462039:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.51/0.38 % (2131804)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3326736096:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.51/0.38 % (2131803)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3901283465:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.51/0.38 % (2131805)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=3726293140:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.51/0.38 % (2131801)Instruction limit reached!
% 0.51/0.38 % (2131801)------------------------------
% 0.51/0.38 % (2131801)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.51/0.38 % (2131801)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.51/0.38 % (2131801)CaDiCaL version: 2.1.3
% 0.51/0.38 % (2131801)Termination reason: Instruction limit
% 0.51/0.38 % (2131801)Termination phase: shuffling
% 0.51/0.38 % (2131801)Time elapsed: 0.002 s
% 0.51/0.38 % (2131801)Peak memory usage: 10 MB
% 0.51/0.38 % (2131801)Instructions burned: 5 (million)
% 0.51/0.38 % (2131800)Instruction limit reached!
% 0.51/0.38 % (2131800)------------------------------
% 0.51/0.38 % (2131800)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.51/0.38 % (2131800)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.51/0.38 % (2131800)CaDiCaL version: 2.1.3
% 0.51/0.38 % (2131800)Termination reason: Instruction limit
% 0.51/0.38 % (2131800)Termination phase: Property scanning
% 0.51/0.38 % (2131800)Time elapsed: 0.009 s
% 0.51/0.38 % (2131800)Peak memory usage: 10 MB
% 0.51/0.38 % (2131800)Instructions burned: 19 (million)
% 0.51/0.38 % (2131803)Instruction limit reached!
% 0.51/0.38 % (2131803)------------------------------
% 0.51/0.38 % (2131803)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.51/0.38 % (2131803)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.51/0.38 % (2131803)CaDiCaL version: 2.1.3
% 0.51/0.38 % (2131803)Termination reason: Instruction limit
% 0.51/0.38 % (2131803)Termination phase: Property scanning
% 0.51/0.38 % (2131803)Time elapsed: 0.010 s
% 0.51/0.38 % (2131803)Peak memory usage: 10 MB
% 0.51/0.38 % (2131803)Instructions burned: 24 (million)
% 0.51/0.38 % (2131813)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=746671685:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.51/0.38 % (2131813)Instruction limit reached!
% 0.51/0.38 % (2131813)------------------------------
% 0.51/0.38 % (2131813)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.51/0.38 % (2131813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.51/0.38 % (2131813)CaDiCaL version: 2.1.3
% 0.51/0.38 % (2131813)Termination reason: Instruction limit
% 0.51/0.38 % (2131813)Termination phase: shuffling
% 0.51/0.38 % (2131813)Time elapsed: 0.003 s
% 0.51/0.38 % (2131813)Peak memory usage: 10 MB
% 0.51/0.38 % (2131813)Instructions burned: 7 (million)
% 0.51/0.38 % (2131815)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.51/0.38 % (2131815)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=3513469779:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.51/0.38 % (2131804)Instruction limit reached!
% 0.51/0.38 % (2131804)------------------------------
% 0.51/0.38 % (2131804)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.51/0.38 % (2131804)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.51/0.38 % (2131804)CaDiCaL version: 2.1.3
% 0.51/0.38 % (2131804)Termination reason: Instruction limit
% 0.51/0.38 % (2131804)Termination phase: Saturation
% 0.51/0.38 % (2131804)Time elapsed: 0.034 s
% 0.51/0.38 % (2131804)Peak memory usage: 12 MB
% 0.51/0.38 % (2131804)Instructions burned: 76 (million)
% 0.51/0.38 % (2131815)Instruction limit reached!
% 0.51/0.38 % (2131815)------------------------------
% 0.51/0.38 % (2131815)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.51/0.38 % (2131815)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.51/0.38 % (2131815)CaDiCaL version: 2.1.3
% 0.51/0.38 % (2131815)Termination reason: Instruction limit
% 0.51/0.38 % (2131815)Termination phase: shuffling
% 0.51/0.38 % (2131815)Time elapsed: 0.007 s
% 0.51/0.38 % (2131815)Peak memory usage: 10 MB
% 0.51/0.38 % (2131815)Instructions burned: 15 (million)
% 0.51/0.38 % (2131814)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=4049126292:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.51/0.38 % (2131799)Instruction limit reached!
% 0.51/0.38 % (2131799)------------------------------
% 0.51/0.38 % (2131799)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.51/0.38 % (2131799)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.51/0.38 % (2131799)CaDiCaL version: 2.1.3
% 0.51/0.38 % (2131799)Termination reason: Instruction limit
% 0.51/0.38 % (2131799)Termination phase: Saturation
% 0.51/0.38 % (2131799)Time elapsed: 0.045 s
% 0.51/0.38 % (2131799)Peak memory usage: 12 MB
% 0.51/0.38 % (2131799)Instructions burned: 93 (million)
% 0.51/0.38 % (2131817)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=2835144616:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.51/0.38 % (2131814)Instruction limit reached!
% 0.51/0.38 % (2131814)------------------------------
% 0.51/0.38 % (2131814)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.51/0.38 % (2131814)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.51/0.38 % (2131814)CaDiCaL version: 2.1.3
% 0.51/0.38 % (2131814)Termination reason: Instruction limit
% 0.51/0.38 % (2131814)Termination phase: shuffling
% 0.51/0.38 % (2131814)Time elapsed: 0.003 s
% 0.51/0.38 % (2131814)Peak memory usage: 10 MB
% 0.51/0.38 % (2131814)Instructions burned: 6 (million)
% 0.51/0.38 % (2131802) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2131794-2131802"...
% 0.51/0.38 % (2131802)...printing done.
% 0.51/0.38 % (2131802)Refutation found. Thanks to Tanya!
% 0.51/0.38 % SZS status Theorem for theBenchmark
% 0.51/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.51/0.39 % (2131802)------------------------------
% 0.51/0.39 % (2131802)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.51/0.39 % (2131802)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.51/0.39 % (2131802)CaDiCaL version: 2.1.3
% 0.51/0.39 % (2131802)Termination reason: Refutation
% 0.51/0.39 % (2131802)Time elapsed: 0.064 s
% 0.51/0.39 % (2131802)Peak memory usage: 15 MB
% 0.51/0.39 % (2131802)Instructions burned: 234 (million)
% 0.51/0.39 % (2131794)Success in time 0.106 s
% 0.51/0.39 % Vampire exiting
%------------------------------------------------------------------------------