%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : ITP006^3 : TPTP v9.2.1. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Feb 25 08:53:08 AM UTC 2026
% Result : Theorem 6.03s 2.42s
% Output : Refutation 6.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 15
% Syntax : Number of formulae : 58 ( 6 unt; 0 typ; 1 def)
% Number of atoms : 672 ( 282 equ; 0 cnn)
% Maximal formula atoms : 32 ( 11 avg)
% Number of connectives : 1251 ( 207 ~; 118 |; 109 &; 752 @)
% ( 30 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 8 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 127 ( 127 >; 0 *; 0 +; 0 <<)
% Number of symbols : 42 ( 39 usr; 3 con; 0-4 aty)
% Number of variables : 349 ( 0 ^; 278 !; 71 ?; 349 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
sK20: $tType ).
thf(type_def_7,type,
sK21: $tType ).
thf(func_def_0,type,
tyop_2Emin_2Ebool: $tType ).
thf(func_def_1,type,
tyop_2Emin_2Efun: ( $tType * $tType ) > $tType ).
thf(func_def_2,type,
c_2Ebool_2E_21:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_3,type,
c_2Ebool_2E_2F_5C: $o > $o > $o ).
thf(func_def_4,type,
c_2Emin_2E_3D:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_5,type,
c_2Emin_2E_3D_3D_3E: $o > $o > $o ).
thf(func_def_6,type,
c_2Ebool_2E_3F:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_8,type,
c_2EquantHeuristics_2EGUESS__EXISTS:
!>[X0: $tType,X1: $tType] : ( ( X0 > X1 ) > ( X1 > $o ) > $o ) ).
thf(func_def_9,type,
c_2EquantHeuristics_2EGUESS__EXISTS__GAP:
!>[X0: $tType,X1: $tType] : ( ( X0 > X1 ) > ( X1 > $o ) > $o ) ).
thf(func_def_10,type,
c_2EquantHeuristics_2EGUESS__EXISTS__POINT:
!>[X0: $tType,X1: $tType] : ( ( X0 > X1 ) > ( X1 > $o ) > $o ) ).
thf(func_def_11,type,
c_2EquantHeuristics_2EGUESS__FORALL:
!>[X0: $tType,X1: $tType] : ( ( X0 > X1 ) > ( X1 > $o ) > $o ) ).
thf(func_def_12,type,
c_2EquantHeuristics_2EGUESS__FORALL__GAP:
!>[X0: $tType,X1: $tType] : ( ( X0 > X1 ) > ( X1 > $o ) > $o ) ).
thf(func_def_13,type,
c_2EquantHeuristics_2EGUESS__FORALL__POINT:
!>[X0: $tType,X1: $tType] : ( ( X0 > X1 ) > ( X1 > $o ) > $o ) ).
thf(func_def_15,type,
c_2Ebool_2E_5C_2F: $o > $o > $o ).
thf(func_def_16,type,
c_2Ebool_2E_7E: $o > $o ).
thf(func_def_23,type,
sP0: $o > $o > $o > $o ).
thf(func_def_24,type,
sP1: $o > $o > $o > $o ).
thf(func_def_25,type,
sP2: $o > $o > $o > $o ).
thf(func_def_26,type,
sP3: $o > $o > $o > $o ).
thf(func_def_27,type,
sP4: $o > $o > $o > $o ).
thf(func_def_28,type,
sP5: $o > $o > $o > $o ).
thf(func_def_29,type,
sP6: $o > $o > $o > $o ).
thf(func_def_30,type,
sP7: $o > $o > $o > $o ).
thf(func_def_31,type,
sK8:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_32,type,
sK9:
!>[X0: $tType,X1: $tType] : ( ( X1 > $o ) > ( X0 > X1 ) > X0 ) ).
thf(func_def_33,type,
sK10:
!>[X0: $tType,X1: $tType] : ( ( X1 > $o ) > ( X0 > X1 ) > X1 ) ).
thf(func_def_34,type,
sK11:
!>[X0: $tType,X1: $tType] : ( ( X1 > $o ) > ( X0 > X1 ) > X0 ) ).
thf(func_def_35,type,
sK12:
!>[X0: $tType,X1: $tType] : ( ( X1 > $o ) > ( X0 > X1 ) > X1 ) ).
thf(func_def_36,type,
sK13:
!>[X0: $tType,X1: $tType] : ( X1 > ( X0 > X1 ) > X0 ) ).
thf(func_def_37,type,
sK14:
!>[X0: $tType,X1: $tType] : ( ( X1 > $o ) > ( X0 > X1 ) > X1 ) ).
thf(func_def_38,type,
sK15:
!>[X0: $tType,X1: $tType] : ( ( X1 > $o ) > ( X0 > X1 ) > X0 ) ).
thf(func_def_39,type,
sK16:
!>[X0: $tType,X1: $tType] : ( X1 > ( X0 > X1 ) > X0 ) ).
thf(func_def_40,type,
sK17:
!>[X0: $tType,X1: $tType] : ( ( X1 > $o ) > ( X0 > X1 ) > X1 ) ).
thf(func_def_41,type,
sK18:
!>[X0: $tType,X1: $tType] : ( ( X1 > $o ) > ( X0 > X1 ) > X0 ) ).
thf(func_def_42,type,
sK19:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_43,type,
sK22: sK21 > sK20 ).
thf(func_def_44,type,
sK23: sK20 > $o ).
thf(func_def_45,type,
sK24: sK20 > $o ).
thf(func_def_47,type,
ph26:
!>[X0: $tType] : X0 ).
thf(f3444,plain,
$false,
inference(avatar_sat_refutation,[status(thm)],[f638,f3443]) ).
thf(f3443,plain,
~ spl25_1,
inference(avatar_contradiction_clause,[status(thm)],[f3442]) ).
thf(f3442,plain,
( $false
| ~ spl25_1 ),
inference(trivial_inequality_removal,[status(thm)],[f3441]) ).
thf(f3441,plain,
( ( $true = $false )
| ~ spl25_1 ),
inference(forward_demodulation,[status(thm)],[f3435,f650]) ).
thf(f650,plain,
( ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK24 )
= $false )
| ~ spl25_1 ),
inference(trivial_inequality_removal,[status(thm)],[f649]) ).
thf(f649,plain,
( ( $true != $true )
| ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK24 )
= $false )
| ~ spl25_1 ),
inference(superposition,[status(thm)],[f243,f606]) ).
thf(f606,plain,
( ! [X0: $o] :
( ( $true = X0 )
| ( $false = X0 ) )
| ~ spl25_1 ),
inference(avatar_component_clause,[status(thm)],[f605]) ).
thf(f605,definition,
( spl25_1
<=> ! [X0: $o] :
( ( $true = X0 )
| ( $false = X0 ) ) ),
introduced(definition,[new_symbols(naming,[spl25_1])],[avatar_definition]) ).
thf(f243,plain,
( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK24 )
!= $true ),
inference(cnf_transformation,[status(thm)],[f146]) ).
thf(f146,plain,
( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK23 ) )
& ! [X5: sK20] :
( ( $true
!= ( sK24 @ X5 ) )
| ( $true
= ( sK23 @ X5 ) ) )
& ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK24 )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21,sK22,sK23,sK24])],[f93,f145]) ).
thf(f145,plain,
( ? [X0: $tType,X1: $tType,X2: X1 > X0,X3: X0 > $o,X4: X0 > $o] :
( ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X3 )
= $true )
& ! [X5: X0] :
( ( ( X4 @ X5 )
!= $true )
| ( $true
= ( X3 @ X5 ) ) )
& ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X4 ) ) )
=> ( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK23 ) )
& ! [X5: sK20] :
( ( $true
!= ( sK24 @ X5 ) )
| ( $true
= ( sK23 @ X5 ) ) )
& ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK24 )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f93,plain,
? [X0: $tType,X1: $tType,X2: X1 > X0,X3: X0 > $o,X4: X0 > $o] :
( ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X3 )
= $true )
& ! [X5: X0] :
( ( ( X4 @ X5 )
!= $true )
| ( $true
= ( X3 @ X5 ) ) )
& ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X4 ) ) ),
inference(flattening,[status(thm)],[f92]) ).
thf(f92,plain,
? [X0: $tType,X1: $tType,X2: X1 > X0,X3: X0 > $o,X4: X0 > $o] :
( ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X4 ) )
& ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X3 )
= $true )
& ! [X5: X0] :
( ( ( X4 @ X5 )
!= $true )
| ( $true
= ( X3 @ X5 ) ) ) ),
inference(ennf_transformation,[status(thm)],[f61]) ).
thf(f61,plain,
~ ! [X0: $tType,X1: $tType,X2: X1 > X0,X3: X0 > $o,X4: X0 > $o] :
( ! [X5: X0] :
( ( ( X4 @ X5 )
= $true )
=> ( $true
= ( X3 @ X5 ) ) )
=> ( ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X3 )
= $true )
=> ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X4 ) ) ) ),
inference(fool_elimination,[status(thm)],[f60]) ).
thf(f60,plain,
~ ! [X0: $tType,X1: $tType,X2: X1 > X0,X3: X0 > $o,X4: X0 > $o] :
( ! [X5: X0] :
( ( X4 @ X5 )
=> ( X3 @ X5 ) )
=> ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X3 )
=> ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X4 ) ) ),
inference(rectify,[status(thm)],[f28]) ).
thf(f28,negated_conjecture,
~ ! [X0: $tType,X1: $tType,X15: X1 > X0,X16: X0 > $o,X43: X0 > $o] :
( ! [X44: X0] :
( ( X43 @ X44 )
=> ( X16 @ X44 ) )
=> ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X15 @ X16 )
=> ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X15 @ X43 ) ) ),
inference(negated_conjecture,[status(cth)],[f27]) ).
thf(f27,conjecture,
! [X0: $tType,X1: $tType,X15: X1 > X0,X16: X0 > $o,X43: X0 > $o] :
( ! [X44: X0] :
( ( X43 @ X44 )
=> ( X16 @ X44 ) )
=> ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X15 @ X16 )
=> ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X15 @ X43 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zumrShj9Js/DTF2THF_19927.p',thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT) ).
thf(f3435,plain,
( ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK24 )
= $true )
| ~ spl25_1 ),
inference(trivial_inequality_removal,[status(thm)],[f3429]) ).
thf(f3429,plain,
( ( $true = $false )
| ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK24 )
= $true )
| ~ spl25_1 ),
inference(superposition,[status(thm)],[f2379,f578]) ).
thf(f578,plain,
! [X1: $tType,X0: $tType,X28: X0 > X1,X29: X1 > $o] :
( ( $true
= ( X29 @ ( X28 @ ( sK18 @ X0 @ X1 @ X29 @ X28 ) ) ) )
| ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29 ) ) ),
inference(not_proxy_clausification,[status(thm)],[f224]) ).
thf(f224,plain,
! [X1: $tType,X0: $tType,X28: X0 > X1,X29: X1 > $o] :
( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29 ) )
| ( $true
!= ( ~ ( X29 @ ( X28 @ ( sK18 @ X0 @ X1 @ X29 @ X28 ) ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f140]) ).
thf(f140,plain,
! [X0: $tType,X1: $tType,X2: X0 > X1,X3: X1 > $o] :
( ( ! [X4: X1] :
( ( $true
= ( X3 @ ( X2 @ ( sK9 @ X0 @ X1 @ X3 @ X2 ) ) ) )
| ( $true
!= ( X3 @ X4 ) ) )
| ( ( c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3 )
!= $true ) )
& ( ( ( c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3 )
= $true )
| ( ! [X7: X0] :
( ( X3 @ ( X2 @ X7 ) )
!= $true )
& ( $true
= ( X3 @ ( sK10 @ X0 @ X1 @ X3 @ X2 ) ) ) ) )
& ( ! [X8: X1] :
( ( $true
!= ( ~ ( X3 @ X8 ) ) )
| ( $true
= ( ~ ( X3 @ ( X2 @ ( sK11 @ X0 @ X1 @ X3 @ X2 ) ) ) ) ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3 ) )
| ( ( ( ~ ( X3 @ ( sK12 @ X0 @ X1 @ X3 @ X2 ) ) )
= $true )
& ! [X11: X0] :
( ( ~ ( X3 @ ( X2 @ X11 ) ) )
!= $true ) ) )
& ! [X12: X0 > X1,X13: X1 > $o] :
( ( ! [X14: X1] :
( ( ( ~ ( X13 @ X14 ) )
!= $true )
| ( ( X12 @ ( sK13 @ X0 @ X1 @ X14 @ X12 ) )
= X14 ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X12 @ X13 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X12 @ X13 ) )
| ( ( $true
= ( ~ ( X13 @ ( sK14 @ X0 @ X1 @ X13 @ X12 ) ) ) )
& ! [X17: X0] :
( ( X12 @ X17 )
!= ( sK14 @ X0 @ X1 @ X13 @ X12 ) ) ) ) )
& ! [X18: X0 > X1,X19: X1 > $o] :
( ( ! [X20: X0] :
( $true
= ( X19 @ ( X18 @ X20 ) ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X18 @ X19 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X18 @ X19 ) )
| ( $true
!= ( X19 @ ( X18 @ ( sK15 @ X0 @ X1 @ X19 @ X18 ) ) ) ) ) )
& ! [X22: X0 > X1,X23: X1 > $o] :
( ( ! [X24: X1] :
( ( ( X23 @ X24 )
!= $true )
| ( ( X22 @ ( sK16 @ X0 @ X1 @ X24 @ X22 ) )
= X24 ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X22 @ X23 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X22 @ X23 ) )
| ( ( ( X23 @ ( sK17 @ X0 @ X1 @ X23 @ X22 ) )
= $true )
& ! [X27: X0] :
( ( X22 @ X27 )
!= ( sK17 @ X0 @ X1 @ X23 @ X22 ) ) ) ) )
& ! [X28: X0 > X1,X29: X1 > $o] :
( ( ! [X30: X0] :
( ( ~ ( X29 @ ( X28 @ X30 ) ) )
= $true )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29 ) )
| ( $true
!= ( ~ ( X29 @ ( X28 @ ( sK18 @ X0 @ X1 @ X29 @ X28 ) ) ) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12,sK13,sK14,sK15,sK16,sK17,sK18])],[f129,f139,f138,f137,f136,f135,f134,f133,f132,f131,f130]) ).
thf(f130,plain,
! [X1: $tType,X0: $tType,X2: X0 > X1,X3: X1 > $o] :
( ? [X5: X0] :
( $true
= ( X3 @ ( X2 @ X5 ) ) )
=> ( $true
= ( X3 @ ( X2 @ ( sK9 @ X0 @ X1 @ X3 @ X2 ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f131,plain,
! [X1: $tType,X0: $tType,X2: X0 > X1,X3: X1 > $o] :
( ? [X6: X1] :
( ! [X7: X0] :
( ( X3 @ ( X2 @ X7 ) )
!= $true )
& ( $true
= ( X3 @ X6 ) ) )
=> ( ! [X7: X0] :
( ( X3 @ ( X2 @ X7 ) )
!= $true )
& ( $true
= ( X3 @ ( sK10 @ X0 @ X1 @ X3 @ X2 ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f132,plain,
! [X1: $tType,X0: $tType,X2: X0 > X1,X3: X1 > $o] :
( ? [X9: X0] :
( $true
= ( ~ ( X3 @ ( X2 @ X9 ) ) ) )
=> ( $true
= ( ~ ( X3 @ ( X2 @ ( sK11 @ X0 @ X1 @ X3 @ X2 ) ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f133,plain,
! [X1: $tType,X0: $tType,X2: X0 > X1,X3: X1 > $o] :
( ? [X10: X1] :
( ( $true
= ( ~ ( X3 @ X10 ) ) )
& ! [X11: X0] :
( ( ~ ( X3 @ ( X2 @ X11 ) ) )
!= $true ) )
=> ( ( ( ~ ( X3 @ ( sK12 @ X0 @ X1 @ X3 @ X2 ) ) )
= $true )
& ! [X11: X0] :
( ( ~ ( X3 @ ( X2 @ X11 ) ) )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f134,plain,
! [X1: $tType,X0: $tType,X12: X0 > X1,X14: X1] :
( ? [X15: X0] :
( ( X12 @ X15 )
= X14 )
=> ( ( X12 @ ( sK13 @ X0 @ X1 @ X14 @ X12 ) )
= X14 ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f135,plain,
! [X1: $tType,X0: $tType,X12: X0 > X1,X13: X1 > $o] :
( ? [X16: X1] :
( ( $true
= ( ~ ( X13 @ X16 ) ) )
& ! [X17: X0] :
( ( X12 @ X17 )
!= X16 ) )
=> ( ( $true
= ( ~ ( X13 @ ( sK14 @ X0 @ X1 @ X13 @ X12 ) ) ) )
& ! [X17: X0] :
( ( X12 @ X17 )
!= ( sK14 @ X0 @ X1 @ X13 @ X12 ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f136,plain,
! [X1: $tType,X0: $tType,X18: X0 > X1,X19: X1 > $o] :
( ? [X21: X0] :
( $true
!= ( X19 @ ( X18 @ X21 ) ) )
=> ( $true
!= ( X19 @ ( X18 @ ( sK15 @ X0 @ X1 @ X19 @ X18 ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f137,plain,
! [X1: $tType,X0: $tType,X22: X0 > X1,X24: X1] :
( ? [X25: X0] :
( ( X22 @ X25 )
= X24 )
=> ( ( X22 @ ( sK16 @ X0 @ X1 @ X24 @ X22 ) )
= X24 ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f138,plain,
! [X1: $tType,X0: $tType,X22: X0 > X1,X23: X1 > $o] :
( ? [X26: X1] :
( ( $true
= ( X23 @ X26 ) )
& ! [X27: X0] :
( ( X22 @ X27 )
!= X26 ) )
=> ( ( ( X23 @ ( sK17 @ X0 @ X1 @ X23 @ X22 ) )
= $true )
& ! [X27: X0] :
( ( X22 @ X27 )
!= ( sK17 @ X0 @ X1 @ X23 @ X22 ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f139,plain,
! [X1: $tType,X0: $tType,X28: X0 > X1,X29: X1 > $o] :
( ? [X31: X0] :
( $true
!= ( ~ ( X29 @ ( X28 @ X31 ) ) ) )
=> ( $true
!= ( ~ ( X29 @ ( X28 @ ( sK18 @ X0 @ X1 @ X29 @ X28 ) ) ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f129,plain,
! [X0: $tType,X1: $tType,X2: X0 > X1,X3: X1 > $o] :
( ( ! [X4: X1] :
( ? [X5: X0] :
( $true
= ( X3 @ ( X2 @ X5 ) ) )
| ( $true
!= ( X3 @ X4 ) ) )
| ( ( c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3 )
!= $true ) )
& ( ( ( c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3 )
= $true )
| ? [X6: X1] :
( ! [X7: X0] :
( ( X3 @ ( X2 @ X7 ) )
!= $true )
& ( $true
= ( X3 @ X6 ) ) ) )
& ( ! [X8: X1] :
( ( $true
!= ( ~ ( X3 @ X8 ) ) )
| ? [X9: X0] :
( $true
= ( ~ ( X3 @ ( X2 @ X9 ) ) ) ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3 ) )
| ? [X10: X1] :
( ( $true
= ( ~ ( X3 @ X10 ) ) )
& ! [X11: X0] :
( ( ~ ( X3 @ ( X2 @ X11 ) ) )
!= $true ) ) )
& ! [X12: X0 > X1,X13: X1 > $o] :
( ( ! [X14: X1] :
( ( ( ~ ( X13 @ X14 ) )
!= $true )
| ? [X15: X0] :
( ( X12 @ X15 )
= X14 ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X12 @ X13 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X12 @ X13 ) )
| ? [X16: X1] :
( ( $true
= ( ~ ( X13 @ X16 ) ) )
& ! [X17: X0] :
( ( X12 @ X17 )
!= X16 ) ) ) )
& ! [X18: X0 > X1,X19: X1 > $o] :
( ( ! [X20: X0] :
( $true
= ( X19 @ ( X18 @ X20 ) ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X18 @ X19 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X18 @ X19 ) )
| ? [X21: X0] :
( $true
!= ( X19 @ ( X18 @ X21 ) ) ) ) )
& ! [X22: X0 > X1,X23: X1 > $o] :
( ( ! [X24: X1] :
( ( ( X23 @ X24 )
!= $true )
| ? [X25: X0] :
( ( X22 @ X25 )
= X24 ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X22 @ X23 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X22 @ X23 ) )
| ? [X26: X1] :
( ( $true
= ( X23 @ X26 ) )
& ! [X27: X0] :
( ( X22 @ X27 )
!= X26 ) ) ) )
& ! [X28: X0 > X1,X29: X1 > $o] :
( ( ! [X30: X0] :
( ( ~ ( X29 @ ( X28 @ X30 ) ) )
= $true )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29 ) )
| ? [X31: X0] :
( $true
!= ( ~ ( X29 @ ( X28 @ X31 ) ) ) ) ) ) ),
inference(rectify,[status(thm)],[f128]) ).
thf(f128,plain,
! [X0: $tType,X1: $tType,X2: X0 > X1,X3: X1 > $o] :
( ( ! [X10: X1] :
( ? [X11: X0] :
( $true
= ( X3 @ ( X2 @ X11 ) ) )
| ( $true
!= ( X3 @ X10 ) ) )
| ( ( c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3 )
!= $true ) )
& ( ( ( c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3 )
= $true )
| ? [X10: X1] :
( ! [X11: X0] :
( $true
!= ( X3 @ ( X2 @ X11 ) ) )
& ( $true
= ( X3 @ X10 ) ) ) )
& ( ! [X8: X1] :
( ( $true
!= ( ~ ( X3 @ X8 ) ) )
| ? [X9: X0] :
( $true
= ( ~ ( X3 @ ( X2 @ X9 ) ) ) ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3 ) )
| ? [X8: X1] :
( ( $true
= ( ~ ( X3 @ X8 ) ) )
& ! [X9: X0] :
( $true
!= ( ~ ( X3 @ ( X2 @ X9 ) ) ) ) ) )
& ! [X4: X0 > X1,X5: X1 > $o] :
( ( ! [X6: X1] :
( ( $true
!= ( ~ ( X5 @ X6 ) ) )
| ? [X7: X0] :
( ( X4 @ X7 )
= X6 ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X4 @ X5 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X4 @ X5 ) )
| ? [X6: X1] :
( ( $true
= ( ~ ( X5 @ X6 ) ) )
& ! [X7: X0] :
( ( X4 @ X7 )
!= X6 ) ) ) )
& ! [X15: X0 > X1,X16: X1 > $o] :
( ( ! [X17: X0] :
( ( X16 @ ( X15 @ X17 ) )
= $true )
| ( ( c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X15 @ X16 )
!= $true ) )
& ( ( ( c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X15 @ X16 )
= $true )
| ? [X17: X0] :
( ( X16 @ ( X15 @ X17 ) )
!= $true ) ) )
& ! [X18: X0 > X1,X19: X1 > $o] :
( ( ! [X20: X1] :
( ( $true
!= ( X19 @ X20 ) )
| ? [X21: X0] :
( ( X18 @ X21 )
= X20 ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X18 @ X19 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X18 @ X19 ) )
| ? [X20: X1] :
( ( $true
= ( X19 @ X20 ) )
& ! [X21: X0] :
( ( X18 @ X21 )
!= X20 ) ) ) )
& ! [X12: X0 > X1,X13: X1 > $o] :
( ( ! [X14: X0] :
( $true
= ( ~ ( X13 @ ( X12 @ X14 ) ) ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X12 @ X13 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X12 @ X13 ) )
| ? [X14: X0] :
( $true
!= ( ~ ( X13 @ ( X12 @ X14 ) ) ) ) ) ) ),
inference(flattening,[status(thm)],[f127]) ).
thf(f127,plain,
! [X0: $tType,X1: $tType,X2: X0 > X1,X3: X1 > $o] :
( ( ! [X10: X1] :
( ? [X11: X0] :
( $true
= ( X3 @ ( X2 @ X11 ) ) )
| ( $true
!= ( X3 @ X10 ) ) )
| ( ( c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3 )
!= $true ) )
& ( ( ( c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3 )
= $true )
| ? [X10: X1] :
( ! [X11: X0] :
( $true
!= ( X3 @ ( X2 @ X11 ) ) )
& ( $true
= ( X3 @ X10 ) ) ) )
& ( ! [X8: X1] :
( ( $true
!= ( ~ ( X3 @ X8 ) ) )
| ? [X9: X0] :
( $true
= ( ~ ( X3 @ ( X2 @ X9 ) ) ) ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3 ) )
| ? [X8: X1] :
( ( $true
= ( ~ ( X3 @ X8 ) ) )
& ! [X9: X0] :
( $true
!= ( ~ ( X3 @ ( X2 @ X9 ) ) ) ) ) )
& ! [X4: X0 > X1,X5: X1 > $o] :
( ( ! [X6: X1] :
( ( $true
!= ( ~ ( X5 @ X6 ) ) )
| ? [X7: X0] :
( ( X4 @ X7 )
= X6 ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X4 @ X5 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X4 @ X5 ) )
| ? [X6: X1] :
( ( $true
= ( ~ ( X5 @ X6 ) ) )
& ! [X7: X0] :
( ( X4 @ X7 )
!= X6 ) ) ) )
& ! [X15: X0 > X1,X16: X1 > $o] :
( ( ! [X17: X0] :
( ( X16 @ ( X15 @ X17 ) )
= $true )
| ( ( c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X15 @ X16 )
!= $true ) )
& ( ( ( c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X15 @ X16 )
= $true )
| ? [X17: X0] :
( ( X16 @ ( X15 @ X17 ) )
!= $true ) ) )
& ! [X18: X0 > X1,X19: X1 > $o] :
( ( ! [X20: X1] :
( ( $true
!= ( X19 @ X20 ) )
| ? [X21: X0] :
( ( X18 @ X21 )
= X20 ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X18 @ X19 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X18 @ X19 ) )
| ? [X20: X1] :
( ( $true
= ( X19 @ X20 ) )
& ! [X21: X0] :
( ( X18 @ X21 )
!= X20 ) ) ) )
& ! [X12: X0 > X1,X13: X1 > $o] :
( ( ! [X14: X0] :
( $true
= ( ~ ( X13 @ ( X12 @ X14 ) ) ) )
| ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X12 @ X13 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X12 @ X13 ) )
| ? [X14: X0] :
( $true
!= ( ~ ( X13 @ ( X12 @ X14 ) ) ) ) ) ) ),
inference(nnf_transformation,[status(thm)],[f83]) ).
thf(f83,plain,
! [X0: $tType,X1: $tType,X2: X0 > X1,X3: X1 > $o] :
( ( ! [X10: X1] :
( ? [X11: X0] :
( $true
= ( X3 @ ( X2 @ X11 ) ) )
| ( $true
!= ( X3 @ X10 ) ) )
<=> ( ( c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3 )
= $true ) )
& ( ! [X8: X1] :
( ( $true
!= ( ~ ( X3 @ X8 ) ) )
| ? [X9: X0] :
( $true
= ( ~ ( X3 @ ( X2 @ X9 ) ) ) ) )
<=> ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3 ) ) )
& ! [X4: X0 > X1,X5: X1 > $o] :
( ! [X6: X1] :
( ( $true
!= ( ~ ( X5 @ X6 ) ) )
| ? [X7: X0] :
( ( X4 @ X7 )
= X6 ) )
<=> ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X4 @ X5 ) ) )
& ! [X15: X0 > X1,X16: X1 > $o] :
( ! [X17: X0] :
( ( X16 @ ( X15 @ X17 ) )
= $true )
<=> ( ( c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X15 @ X16 )
= $true ) )
& ! [X18: X0 > X1,X19: X1 > $o] :
( ! [X20: X1] :
( ( $true
!= ( X19 @ X20 ) )
| ? [X21: X0] :
( ( X18 @ X21 )
= X20 ) )
<=> ( $true
= ( c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X18 @ X19 ) ) )
& ! [X12: X0 > X1,X13: X1 > $o] :
( ! [X14: X0] :
( $true
= ( ~ ( X13 @ ( X12 @ X14 ) ) ) )
<=> ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X12 @ X13 ) ) ) ),
inference(ennf_transformation,[status(thm)],[f53]) ).
thf(f53,plain,
! [X0: $tType,X1: $tType,X2: X0 > X1,X3: X1 > $o] :
( ! [X4: X0 > X1,X5: X1 > $o] :
( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X4 @ X5 ) )
<=> ! [X6: X1] :
( ( $true
= ( ~ ( X5 @ X6 ) ) )
=> ? [X7: X0] :
( ( X4 @ X7 )
= X6 ) ) )
& ! [X12: X0 > X1,X13: X1 > $o] :
( ! [X14: X0] :
( $true
= ( ~ ( X13 @ ( X12 @ X14 ) ) ) )
<=> ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X12 @ X13 ) ) )
& ! [X15: X0 > X1,X16: X1 > $o] :
( ! [X17: X0] :
( ( X16 @ ( X15 @ X17 ) )
= $true )
<=> ( ( c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X15 @ X16 )
= $true ) )
& ! [X18: X0 > X1,X19: X1 > $o] :
( ! [X20: X1] :
( ( $true
= ( X19 @ X20 ) )
=> ? [X21: X0] :
( ( X18 @ X21 )
= X20 ) )
<=> ( $true
= ( c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X18 @ X19 ) ) )
& ( ( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3 ) )
<=> ! [X8: X1] :
( ( $true
= ( ~ ( X3 @ X8 ) ) )
=> ? [X9: X0] :
( $true
= ( ~ ( X3 @ ( X2 @ X9 ) ) ) ) ) )
& ( ( ( c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3 )
= $true )
<=> ! [X10: X1] :
( ( $true
= ( X3 @ X10 ) )
=> ? [X11: X0] :
( $true
= ( X3 @ ( X2 @ X11 ) ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f52]) ).
thf(f52,plain,
! [X0: $tType,X1: $tType,X2: X0 > X1,X3: X1 > $o] :
( ! [X4: X0 > X1,X5: X1 > $o] :
( ( c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X4 @ X5 )
<=> ! [X6: X1] :
( ~ ( X5 @ X6 )
=> ? [X7: X0] :
( ( X4 @ X7 )
= X6 ) ) )
& ( ( c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3 )
<=> ! [X8: X1] :
( ~ ( X3 @ X8 )
=> ? [X9: X0] :
~ ( X3 @ ( X2 @ X9 ) ) ) )
& ( ( c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3 )
<=> ! [X10: X1] :
( ( X3 @ X10 )
=> ? [X11: X0] : ( X3 @ ( X2 @ X11 ) ) ) )
& ! [X12: X0 > X1,X13: X1 > $o] :
( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X12 @ X13 )
<=> ! [X14: X0] :
~ ( X13 @ ( X12 @ X14 ) ) )
& ! [X15: X0 > X1,X16: X1 > $o] :
( ( c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X15 @ X16 )
<=> ! [X17: X0] : ( X16 @ ( X15 @ X17 ) ) )
& ! [X18: X0 > X1,X19: X1 > $o] :
( ( c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X18 @ X19 )
<=> ! [X20: X1] :
( ( X19 @ X20 )
=> ? [X21: X0] :
( ( X18 @ X21 )
= X20 ) ) ) ),
inference(rectify,[status(thm)],[f15]) ).
thf(f15,axiom,
! [X0: $tType,X1: $tType,X15: X0 > X1,X16: X1 > $o] :
( ! [X31: X0 > X1,X32: X1 > $o] :
( ( c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X31 @ X32 )
<=> ! [X33: X1] :
( ~ ( X32 @ X33 )
=> ? [X34: X0] :
( ( X31 @ X34 )
= X33 ) ) )
& ( ( c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X15 @ X16 )
<=> ! [X19: X1] :
( ~ ( X16 @ X19 )
=> ? [X20: X0] :
~ ( X16 @ ( X15 @ X20 ) ) ) )
& ( ( c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X15 @ X16 )
<=> ! [X17: X1] :
( ( X16 @ X17 )
=> ? [X18: X0] : ( X16 @ ( X15 @ X18 ) ) ) )
& ! [X24: X0 > X1,X25: X1 > $o] :
( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X24 @ X25 )
<=> ! [X26: X0] :
~ ( X25 @ ( X24 @ X26 ) ) )
& ! [X21: X0 > X1,X22: X1 > $o] :
( ( c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X21 @ X22 )
<=> ! [X23: X0] : ( X22 @ ( X21 @ X23 ) ) )
& ! [X27: X0 > X1,X28: X1 > $o] :
( ( c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X27 @ X28 )
<=> ! [X29: X1] :
( ( X28 @ X29 )
=> ? [X30: X0] :
( ( X27 @ X30 )
= X29 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zumrShj9Js/DTF2THF_19927.p',thm_2EquantHeuristics_2EGUESS__REWRITES) ).
thf(f2379,plain,
( ! [X0: sK21] :
( ( sK24 @ ( sK22 @ X0 ) )
= $false )
| ~ spl25_1 ),
inference(trivial_inequality_removal,[status(thm)],[f2369]) ).
thf(f2369,plain,
( ! [X0: sK21] :
( ( ( sK24 @ ( sK22 @ X0 ) )
= $false )
| ( $true = $false ) )
| ~ spl25_1 ),
inference(superposition,[status(thm)],[f644,f2308]) ).
thf(f2308,plain,
! [X0: sK21] :
( ( sK23 @ ( sK22 @ X0 ) )
= $false ),
inference(trivial_inequality_removal,[status(thm)],[f2304]) ).
thf(f2304,plain,
! [X0: sK21] :
( ( $true != $true )
| ( ( sK23 @ ( sK22 @ X0 ) )
= $false ) ),
inference(superposition,[status(thm)],[f528,f245]) ).
thf(f245,plain,
( $true
= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK23 ) ),
inference(cnf_transformation,[status(thm)],[f146]) ).
thf(f528,plain,
! [X1: $tType,X0: $tType,X28: X0 > X1,X29: X1 > $o,X30: X0] :
( ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29 ) )
| ( ( X29 @ ( X28 @ X30 ) )
= $false ) ),
inference(not_proxy_clausification,[status(thm)],[f225]) ).
thf(f225,plain,
! [X1: $tType,X0: $tType,X28: X0 > X1,X29: X1 > $o,X30: X0] :
( ( $true
!= ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29 ) )
| ( ( ~ ( X29 @ ( X28 @ X30 ) ) )
= $true ) ),
inference(cnf_transformation,[status(thm)],[f140]) ).
thf(f644,plain,
( ! [X0: sK20] :
( ( $true
= ( sK23 @ X0 ) )
| ( ( sK24 @ X0 )
= $false ) )
| ~ spl25_1 ),
inference(trivial_inequality_removal,[status(thm)],[f642]) ).
thf(f642,plain,
( ! [X0: sK20] :
( ( ( sK24 @ X0 )
= $false )
| ( $true != $true )
| ( $true
= ( sK23 @ X0 ) ) )
| ~ spl25_1 ),
inference(superposition,[status(thm)],[f244,f606]) ).
thf(f244,plain,
! [X5: sK20] :
( ( $true
!= ( sK24 @ X5 ) )
| ( $true
= ( sK23 @ X5 ) ) ),
inference(cnf_transformation,[status(thm)],[f146]) ).
thf(f638,plain,
spl25_1,
inference(avatar_split_clause,[status(thm)],[f498,f605]) ).
thf(f498,plain,
! [X0: $o] :
( ( $true = X0 )
| ( $false = X0 ) ),
inference(not_proxy_clausification,[status(thm)],[f421]) ).
thf(f421,plain,
! [X0: $o] :
( ( $true = X0 )
| ( $true = ( ~ X0 ) ) ),
inference(equality_resolution,[status(thm)],[f255]) ).
thf(f255,plain,
! [X0: $o,X1: $o] :
( ( $true = X0 )
| ( $true = X1 )
| ( ( ~ X0 ) != X1 ) ),
inference(cnf_transformation,[status(thm)],[f152]) ).
thf(f152,plain,
! [X0: $o,X1: $o] :
( ( ( ( ~ X0 ) = X1 )
| ( ( $true != X0 )
& ( $true != X1 ) )
| ( ( $true != ( ~ X1 ) )
& ( $true != ( ~ X0 ) ) ) )
& ( ( ( ( $true = X0 )
| ( $true = X1 ) )
& ( ( $true = ( ~ X1 ) )
| ( $true = ( ~ X0 ) ) ) )
| ( ( ~ X0 ) != X1 ) ) ),
inference(flattening,[status(thm)],[f151]) ).
thf(f151,plain,
! [X0: $o,X1: $o] :
( ( ( ( ~ X0 ) = X1 )
| ( ( $true != X0 )
& ( $true != X1 ) )
| ( ( $true != ( ~ X1 ) )
& ( $true != ( ~ X0 ) ) ) )
& ( ( ( ( $true = X0 )
| ( $true = X1 ) )
& ( ( $true = ( ~ X1 ) )
| ( $true = ( ~ X0 ) ) ) )
| ( ( ~ X0 ) != X1 ) ) ),
inference(nnf_transformation,[status(thm)],[f73]) ).
thf(f73,plain,
! [X0: $o,X1: $o] :
( ( ( ~ X0 ) = X1 )
<=> ( ( ( $true = X0 )
| ( $true = X1 ) )
& ( ( $true = ( ~ X1 ) )
| ( $true = ( ~ X0 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f72]) ).
thf(f72,plain,
! [X0: $o,X1: $o] :
( ( ~ X0
<=> X1 )
<=> ( ( ~ X1
| ~ X0 )
& ( X0
| X1 ) ) ),
inference(rectify,[status(thm)],[f24]) ).
thf(f24,axiom,
! [X41: $o,X42: $o] :
( ( ~ X41
<=> X42 )
<=> ( ( ~ X42
| ~ X41 )
& ( X41
| X42 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zumrShj9Js/DTF2THF_19927.p',thm_2Esat_2Edc__neg) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ITP006^3 : TPTP v9.2.1. Bugfixed v7.5.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/0.33 % Computer : n009.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue Feb 24 08:17:40 EST 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.33 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.18/0.45 ---- Original DTF file ---
% 0.18/0.45 thf(spec,logic,$$dhol).
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 % File : ITP006^3 : TPTP v9.2.1. Bugfixed v7.5.0.
% 0.18/0.45 % Domain : Interactive Theorem Proving
% 0.18/0.45 % Problem : HOL4 syntactic export of thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT.p, bushy mode
% 0.18/0.45 % Version : [BG+19] axioms.
% 0.18/0.45 % English :
% 0.18/0.45
% 0.18/0.45 % Refs : [BG+19] Brown et al. (2019), GRUNGE: A Grand Unified ATP Chall
% 0.18/0.45 % : [Gau19] Gauthier (2019), Email to Geoff Sutcliffe
% 0.18/0.45 % Source : [BG+19]
% 0.18/0.45 % Names : thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT.p [Gau19]
% 0.18/0.45 % : HL402501^3.p [TPAP]
% 0.18/0.45
% 0.18/0.45 % Status : Theorem
% 0.18/0.45 % Rating : 0.33 v8.1.0, 0.25 v7.5.0
% 0.18/0.45 % Syntax : Number of formulae : 44 ( 7 unt; 17 typ; 0 def)
% 0.18/0.45 % Number of atoms : 91 ( 12 equ; 39 cnn)
% 0.18/0.45 % Maximal formula atoms : 12 ( 3 avg)
% 0.18/0.45 % Number of connectives : 266 ( 39 ~; 22 |; 25 &; 103 @)
% 0.18/0.45 % ( 39 <=>; 38 =>; 0 <=; 0 <~>)
% 0.18/0.45 % Maximal formula depth : 17 ( 7 avg)
% 0.18/0.45 % Number of types : 2 ( 1 usr)
% 0.18/0.45 % Number of type conns : 54 ( 54 >; 0 *; 0 +; 0 <<)
% 0.18/0.45 % Number of symbols : 18 ( 16 usr; 3 con; 0-4 aty)
% 0.18/0.45 % Number of variables : 94 ( 0 ^; 74 !; 5 ?; 94 :)
% 0.18/0.45 % ( 15 !>; 0 ?*; 0 @-; 0 @+)
% 0.18/0.45 % SPC : TH1_THM_EQU_NAR
% 0.18/0.45
% 0.18/0.45 % Comments :
% 0.18/0.45 % Bugfixes : v7.5.0 - Bugfixes in axioms and export.
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 thf(tyop_2Emin_2Ebool,type,
% 0.18/0.45 tyop_2Emin_2Ebool: $tType ).
% 0.18/0.45
% 0.18/0.45 thf(tyop_2Emin_2Efun,type,
% 0.18/0.45 tyop_2Emin_2Efun: $tType > $tType > $tType ).
% 0.18/0.45
% 0.18/0.45 thf(c_2Ebool_2E_21,type,
% 0.18/0.45 c_2Ebool_2E_21:
% 0.18/0.45 !>[A_27a: $tType] : ( ( A_27a > $o ) > $o ) ).
% 0.18/0.45
% 0.18/0.45 thf(c_2Ebool_2E_2F_5C,type,
% 0.18/0.45 c_2Ebool_2E_2F_5C: $o > $o > $o ).
% 0.18/0.45
% 0.18/0.45 thf(c_2Emin_2E_3D,type,
% 0.18/0.45 c_2Emin_2E_3D:
% 0.18/0.45 !>[A_27a: $tType] : ( A_27a > A_27a > $o ) ).
% 0.18/0.45
% 0.18/0.45 thf(c_2Emin_2E_3D_3D_3E,type,
% 0.18/0.45 c_2Emin_2E_3D_3D_3E: $o > $o > $o ).
% 0.18/0.45
% 0.18/0.45 thf(c_2Ebool_2E_3F,type,
% 0.18/0.45 c_2Ebool_2E_3F:
% 0.18/0.45 !>[A_27a: $tType] : ( ( A_27a > $o ) > $o ) ).
% 0.18/0.45
% 0.18/0.45 thf(c_2Ebool_2EF,type,
% 0.18/0.45 c_2Ebool_2EF: $o ).
% 0.18/0.45
% 0.18/0.45 thf(c_2EquantHeuristics_2EGUESS__EXISTS,type,
% 0.18/0.45 c_2EquantHeuristics_2EGUESS__EXISTS:
% 0.18/0.45 !>[A_27a: $tType,A_27b: $tType] : ( ( A_27a > A_27b ) > ( A_27b > $o ) > $o ) ).
% 0.18/0.45
% 0.18/0.45 thf(c_2EquantHeuristics_2EGUESS__EXISTS__GAP,type,
% 0.18/0.45 c_2EquantHeuristics_2EGUESS__EXISTS__GAP:
% 0.18/0.45 !>[A_27a: $tType,A_27b: $tType] : ( ( A_27a > A_27b ) > ( A_27b > $o ) > $o ) ).
% 0.18/0.45
% 0.18/0.45 thf(c_2EquantHeuristics_2EGUESS__EXISTS__POINT,type,
% 0.18/0.45 c_2EquantHeuristics_2EGUESS__EXISTS__POINT:
% 0.18/0.45 !>[A_27a: $tType,A_27b: $tType] : ( ( A_27a > A_27b ) > ( A_27b > $o ) > $o ) ).
% 0.18/0.45
% 0.18/0.45 thf(c_2EquantHeuristics_2EGUESS__FORALL,type,
% 0.18/0.45 c_2EquantHeuristics_2EGUESS__FORALL:
% 0.18/0.45 !>[A_27a: $tType,A_27b: $tType] : ( ( A_27a > A_27b ) > ( A_27b > $o ) > $o ) ).
% 0.18/0.45
% 0.18/0.45 thf(c_2EquantHeuristics_2EGUESS__FORALL__GAP,type,
% 0.18/0.45 c_2EquantHeuristics_2EGUESS__FORALL__GAP:
% 0.18/0.45 !>[A_27a: $tType,A_27b: $tType] : ( ( A_27a > A_27b ) > ( A_27b > $o ) > $o ) ).
% 0.18/0.45
% 0.18/0.45 thf(c_2EquantHeuristics_2EGUESS__FORALL__POINT,type,
% 0.18/0.45 c_2EquantHeuristics_2EGUESS__FORALL__POINT:
% 0.18/0.45 !>[A_27a: $tType,A_27b: $tType] : ( ( A_27a > A_27b ) > ( A_27b > $o ) > $o ) ).
% 0.18/0.45
% 0.18/0.45 thf(c_2Ebool_2ET,type,
% 0.18/0.45 c_2Ebool_2ET: $o ).
% 0.18/0.45
% 0.18/0.45 thf(c_2Ebool_2E_5C_2F,type,
% 0.18/0.45 c_2Ebool_2E_5C_2F: $o > $o > $o ).
% 0.18/0.45
% 0.18/0.45 thf(c_2Ebool_2E_7E,type,
% 0.18/0.45 c_2Ebool_2E_7E: $o > $o ).
% 0.18/0.45
% 0.18/0.45 thf(logicdef_2E_2F_5C,axiom,
% 0.18/0.45 ! [V0: $o,V1: $o] :
% 0.18/0.45 ( ( c_2Ebool_2E_2F_5C @ V0 @ V1 )
% 0.18/0.45 <=> ( V0
% 0.18/0.45 & V1 ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(logicdef_2E_5C_2F,axiom,
% 0.18/0.45 ! [V0: $o,V1: $o] :
% 0.18/0.45 ( ( c_2Ebool_2E_5C_2F @ V0 @ V1 )
% 0.18/0.45 <=> ( V0
% 0.18/0.45 | V1 ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(logicdef_2E_7E,axiom,
% 0.18/0.45 ! [V0: $o] :
% 0.18/0.45 ( ( c_2Ebool_2E_7E @ V0 )
% 0.18/0.45 <=> ( (~) @ V0 ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(logicdef_2E_3D_3D_3E,axiom,
% 0.18/0.45 ! [V0: $o,V1: $o] :
% 0.18/0.45 ( ( c_2Emin_2E_3D_3D_3E @ V0 @ V1 )
% 0.18/0.45 <=> ( V0
% 0.18/0.45 => V1 ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(logicdef_2E_3D,axiom,
% 0.18/0.45 ! [A_27a: $tType,V0: A_27a,V1: A_27a] :
% 0.18/0.45 ( ( c_2Emin_2E_3D @ A_27a @ V0 @ V1 )
% 0.18/0.45 <=> ( V0 = V1 ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(quantdef_2E_21,axiom,
% 0.18/0.45 ! [A_27a: $tType,V0f: A_27a > $o] :
% 0.18/0.45 ( ( c_2Ebool_2E_21 @ A_27a @ V0f )
% 0.18/0.45 <=> ! [V1x: A_27a] : ( V0f @ V1x ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(quantdef_2E_3F,axiom,
% 0.18/0.45 ! [A_27a: $tType,V0f: A_27a > $o] :
% 0.18/0.45 ( ( c_2Ebool_2E_3F @ A_27a @ V0f )
% 0.18/0.45 <=> ? [V1x: A_27a] : ( V0f @ V1x ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Ebool_2ETRUTH,axiom,
% 0.18/0.45 c_2Ebool_2ET ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Ebool_2EIMP__CLAUSES,axiom,
% 0.18/0.45 ! [V0t: $o] :
% 0.18/0.45 ( ( ( c_2Ebool_2ET
% 0.18/0.45 => V0t )
% 0.18/0.45 <=> V0t )
% 0.18/0.45 & ( ( V0t
% 0.18/0.45 => c_2Ebool_2ET )
% 0.18/0.45 <=> c_2Ebool_2ET )
% 0.18/0.45 & ( ( c_2Ebool_2EF
% 0.18/0.45 => V0t )
% 0.18/0.45 <=> c_2Ebool_2ET )
% 0.18/0.45 & ( ( V0t
% 0.18/0.45 => V0t )
% 0.18/0.45 <=> c_2Ebool_2ET )
% 0.18/0.45 & ( ( V0t
% 0.18/0.45 => c_2Ebool_2EF )
% 0.18/0.45 <=> ( (~) @ V0t ) ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Ebool_2ENOT__CLAUSES,axiom,
% 0.18/0.45 ( ! [V0t: $o] :
% 0.18/0.45 ( ( (~) @ ( (~) @ V0t ) )
% 0.18/0.45 <=> V0t )
% 0.18/0.45 & ( ( (~) @ c_2Ebool_2ET )
% 0.18/0.45 <=> c_2Ebool_2EF )
% 0.18/0.45 & ( ( (~) @ c_2Ebool_2EF )
% 0.18/0.45 <=> c_2Ebool_2ET ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Ebool_2EEQ__SYM__EQ,axiom,
% 0.18/0.45 ! [A_27a: $tType,V0x: A_27a,V1y: A_27a] :
% 0.18/0.45 ( ( V0x = V1y )
% 0.18/0.45 <=> ( V1y = V0x ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Ebool_2EEQ__CLAUSES,axiom,
% 0.18/0.45 ! [V0t: $o] :
% 0.18/0.45 ( ( ( c_2Ebool_2ET = V0t )
% 0.18/0.45 <=> V0t )
% 0.18/0.45 & ( ( V0t = c_2Ebool_2ET )
% 0.18/0.45 <=> V0t )
% 0.18/0.45 & ( ( c_2Ebool_2EF = V0t )
% 0.18/0.45 <=> ( (~) @ V0t ) )
% 0.18/0.45 & ( ( V0t = c_2Ebool_2EF )
% 0.18/0.45 <=> ( (~) @ V0t ) ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Ebool_2EAND__IMP__INTRO,axiom,
% 0.18/0.45 ! [V0t1: $o,V1t2: $o,V2t3: $o] :
% 0.18/0.45 ( ( V0t1
% 0.18/0.45 => ( V1t2
% 0.18/0.45 => V2t3 ) )
% 0.18/0.45 <=> ( ( V0t1
% 0.18/0.45 & V1t2 )
% 0.18/0.45 => V2t3 ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Ebool_2EIMP__CONG,axiom,
% 0.18/0.45 ! [V0x: $o,V1x_27: $o,V2y: $o,V3y_27: $o] :
% 0.18/0.45 ( ( ( V0x = V1x_27 )
% 0.18/0.45 & ( V1x_27
% 0.18/0.45 => ( V2y = V3y_27 ) ) )
% 0.18/0.45 => ( ( V0x
% 0.18/0.45 => V2y )
% 0.18/0.45 <=> ( V1x_27
% 0.18/0.45 => V3y_27 ) ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2EquantHeuristics_2EGUESS__REWRITES,axiom,
% 0.18/0.45 ! [A_27a: $tType,A_27b: $tType,V0i: A_27a > A_27b,V1P: A_27b > $o] :
% 0.18/0.45 ( ( ( c_2EquantHeuristics_2EGUESS__EXISTS @ A_27a @ A_27b @ V0i @ V1P )
% 0.18/0.45 <=> ! [V2v: A_27b] :
% 0.18/0.45 ( ( V1P @ V2v )
% 0.18/0.45 => ? [V3fv: A_27a] : ( V1P @ ( V0i @ V3fv ) ) ) )
% 0.18/0.45 & ( ( c_2EquantHeuristics_2EGUESS__FORALL @ A_27a @ A_27b @ V0i @ V1P )
% 0.18/0.45 <=> ! [V4v: A_27b] :
% 0.18/0.45 ( ( (~) @ ( V1P @ V4v ) )
% 0.18/0.45 => ? [V5fv: A_27a] : ( (~) @ ( V1P @ ( V0i @ V5fv ) ) ) ) )
% 0.18/0.45 & ! [V6i: A_27a > A_27b,V7P: A_27b > $o] :
% 0.18/0.45 ( ( c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ A_27a @ A_27b @ V6i @ V7P )
% 0.18/0.45 <=> ! [V8fv: A_27a] : ( V7P @ ( V6i @ V8fv ) ) )
% 0.18/0.45 & ! [V9i: A_27a > A_27b,V10P: A_27b > $o] :
% 0.18/0.45 ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ A_27a @ A_27b @ V9i @ V10P )
% 0.18/0.45 <=> ! [V11fv: A_27a] : ( (~) @ ( V10P @ ( V9i @ V11fv ) ) ) )
% 0.18/0.45 & ! [V12i: A_27a > A_27b,V13P: A_27b > $o] :
% 0.18/0.45 ( ( c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ A_27a @ A_27b @ V12i @ V13P )
% 0.18/0.45 <=> ! [V14v: A_27b] :
% 0.18/0.45 ( ( V13P @ V14v )
% 0.18/0.45 => ? [V15fv: A_27a] :
% 0.18/0.45 ( V14v
% 0.18/0.45 = ( V12i @ V15fv ) ) ) )
% 0.18/0.45 & ! [V16i: A_27a > A_27b,V17P: A_27b > $o] :
% 0.18/0.45 ( ( c_2EquantHeuristics_2EGUESS__FORALL__GAP @ A_27a @ A_27b @ V16i @ V17P )
% 0.18/0.45 <=> ! [V18v: A_27b] :
% 0.18/0.45 ( ( (~) @ ( V17P @ V18v ) )
% 0.18/0.45 => ? [V19fv: A_27a] :
% 0.18/0.45 ( V18v
% 0.18/0.45 = ( V16i @ V19fv ) ) ) ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Esat_2ENOT__NOT,axiom,
% 0.18/0.45 ! [V0t: $o] :
% 0.18/0.45 ( ( (~) @ ( (~) @ V0t ) )
% 0.18/0.45 <=> V0t ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Esat_2EAND__INV__IMP,axiom,
% 0.18/0.45 ! [V0A: $o] :
% 0.18/0.45 ( V0A
% 0.18/0.45 => ( ( (~) @ V0A )
% 0.18/0.45 => c_2Ebool_2EF ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Esat_2EOR__DUAL2,axiom,
% 0.18/0.45 ! [V0B: $o,V1A: $o] :
% 0.18/0.45 ( ( ( (~)
% 0.18/0.45 @ ( V1A
% 0.18/0.45 | V0B ) )
% 0.18/0.45 => c_2Ebool_2EF )
% 0.18/0.45 <=> ( ( V1A
% 0.18/0.45 => c_2Ebool_2EF )
% 0.18/0.45 => ( ( (~) @ V0B )
% 0.18/0.45 => c_2Ebool_2EF ) ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Esat_2EOR__DUAL3,axiom,
% 0.18/0.45 ! [V0B: $o,V1A: $o] :
% 0.18/0.45 ( ( ( (~)
% 0.18/0.45 @ ( ( (~) @ V1A )
% 0.18/0.45 | V0B ) )
% 0.18/0.45 => c_2Ebool_2EF )
% 0.18/0.45 <=> ( V1A
% 0.18/0.45 => ( ( (~) @ V0B )
% 0.18/0.45 => c_2Ebool_2EF ) ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Esat_2EAND__INV2,axiom,
% 0.18/0.45 ! [V0A: $o] :
% 0.18/0.45 ( ( ( (~) @ V0A )
% 0.18/0.45 => c_2Ebool_2EF )
% 0.18/0.45 => ( ( V0A
% 0.18/0.45 => c_2Ebool_2EF )
% 0.18/0.45 => c_2Ebool_2EF ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Esat_2Edc__eq,axiom,
% 0.18/0.45 ! [V0r: $o,V1q: $o,V2p: $o] :
% 0.18/0.45 ( ( V2p
% 0.18/0.45 <=> ( V1q = V0r ) )
% 0.18/0.45 <=> ( ( V2p
% 0.18/0.45 | V1q
% 0.18/0.45 | V0r )
% 0.18/0.45 & ( V2p
% 0.18/0.45 | ( (~) @ V0r )
% 0.18/0.45 | ( (~) @ V1q ) )
% 0.18/0.45 & ( V1q
% 0.18/0.45 | ( (~) @ V0r )
% 0.18/0.45 | ( (~) @ V2p ) )
% 0.18/0.45 & ( V0r
% 0.18/0.45 | ( (~) @ V1q )
% 0.18/0.45 | ( (~) @ V2p ) ) ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Esat_2Edc__disj,axiom,
% 0.18/0.45 ! [V0r: $o,V1q: $o,V2p: $o] :
% 0.18/0.45 ( ( V2p
% 0.18/0.45 <=> ( V1q
% 0.18/0.45 | V0r ) )
% 0.18/0.45 <=> ( ( V2p
% 0.18/0.45 | ( (~) @ V1q ) )
% 0.18/0.45 & ( V2p
% 0.18/0.45 | ( (~) @ V0r ) )
% 0.18/0.45 & ( V1q
% 0.18/0.45 | V0r
% 0.18/0.45 | ( (~) @ V2p ) ) ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Esat_2Edc__imp,axiom,
% 0.18/0.45 ! [V0r: $o,V1q: $o,V2p: $o] :
% 0.18/0.45 ( ( V2p
% 0.18/0.45 <=> ( V1q
% 0.18/0.45 => V0r ) )
% 0.18/0.45 <=> ( ( V2p
% 0.18/0.45 | V1q )
% 0.18/0.45 & ( V2p
% 0.18/0.45 | ( (~) @ V0r ) )
% 0.18/0.45 & ( ( (~) @ V1q )
% 0.18/0.45 | V0r
% 0.18/0.45 | ( (~) @ V2p ) ) ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Esat_2Edc__neg,axiom,
% 0.18/0.45 ! [V0q: $o,V1p: $o] :
% 0.18/0.45 ( ( V1p
% 0.18/0.45 <=> ( (~) @ V0q ) )
% 0.18/0.45 <=> ( ( V1p
% 0.18/0.45 | V0q )
% 0.18/0.45 & ( ( (~) @ V0q )
% 0.18/0.45 | ( (~) @ V1p ) ) ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Esat_2Epth__ni1,axiom,
% 0.18/0.45 ! [V0q: $o,V1p: $o] :
% 0.18/0.45 ( ( (~)
% 0.18/0.45 @ ( V1p
% 0.18/0.45 => V0q ) )
% 0.18/0.45 => V1p ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2Esat_2Epth__ni2,axiom,
% 0.18/0.45 ! [V0q: $o,V1p: $o] :
% 0.18/0.45 ( ( (~)
% 0.18/0.45 @ ( V1p
% 0.18/0.45 => V0q ) )
% 0.18/0.45 => ( (~) @ V0q ) ) ).
% 0.18/0.45
% 0.18/0.45 thf(thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT,conjecture,
% 0.18/0.45 ! [A_27a: $tType,A_27b: $tType,V0i: A_27b > A_27a,V1P: A_27a > $o,V2Q: A_27a > $o] :
% 0.18/0.45 ( ! [V3x: A_27a] :
% 0.18/0.45 ( ( V2Q @ V3x )
% 0.18/0.45 => ( V1P @ V3x ) )
% 0.18/0.45 => ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ A_27b @ A_27a @ V0i @ V1P )
% 0.18/0.45 => ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ A_27b @ A_27a @ V0i @ V2Q ) ) ) ).
% 0.18/0.45
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 ------------------------
% 2.29/1.76 ---- Embedded in THF ---
% 2.29/1.77 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 2.29/1.77 %%% Generated on Tue Feb 24 08:17:41 EST 2026
% 2.29/1.77 %%% using '$$dhol' embedding, version 1.3.0.
% 2.29/1.77 %%% Logic specification used:
% 2.29/1.77 %%% thf(spec, logic, $$dhol).
% 2.29/1.77
% 2.29/1.77 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.zumrShj9Js/DTF2DTF19927.p
% See solution above
% 2.29/1.77 ------------------------
% 2.29/1.78 ---- Cleaned THF ---
% 2.29/1.78 thf(tyop_2Emin_2Ebool,type,
% 2.29/1.78 tyop_2Emin_2Ebool: $tType ).
% 2.29/1.78
% 2.29/1.78 thf(tyop_2Emin_2Efun,type,
% 2.29/1.78 tyop_2Emin_2Efun: $tType > $tType > $tType ).
% 2.29/1.78
% 2.29/1.78 thf(c_2Ebool_2E_21,type,
% 2.29/1.78 c_2Ebool_2E_21:
% 2.29/1.78 !>[A_27a: $tType] : ( ( A_27a > $o ) > $o ) ).
% 2.29/1.78
% 2.29/1.78 thf(c_2Ebool_2E_2F_5C,type,
% 2.29/1.78 c_2Ebool_2E_2F_5C: $o > $o > $o ).
% 2.29/1.78
% 2.29/1.78 thf(c_2Emin_2E_3D,type,
% 2.29/1.78 c_2Emin_2E_3D:
% 2.29/1.78 !>[A_27a: $tType] : ( A_27a > A_27a > $o ) ).
% 2.29/1.78
% 2.29/1.78 thf(c_2Emin_2E_3D_3D_3E,type,
% 2.29/1.78 c_2Emin_2E_3D_3D_3E: $o > $o > $o ).
% 2.29/1.78
% 2.29/1.78 thf(c_2Ebool_2E_3F,type,
% 2.29/1.78 c_2Ebool_2E_3F:
% 2.29/1.78 !>[A_27a: $tType] : ( ( A_27a > $o ) > $o ) ).
% 2.29/1.78
% 2.29/1.78 thf(c_2Ebool_2EF,type,
% 2.29/1.78 c_2Ebool_2EF: $o ).
% 2.29/1.78
% 2.29/1.78 thf(c_2EquantHeuristics_2EGUESS__EXISTS,type,
% 2.29/1.78 c_2EquantHeuristics_2EGUESS__EXISTS:
% 2.29/1.78 !>[A_27a: $tType,A_27b: $tType] : ( ( A_27a > A_27b ) > ( A_27b > $o ) > $o ) ).
% 2.29/1.78
% 2.29/1.78 thf(c_2EquantHeuristics_2EGUESS__EXISTS__GAP,type,
% 2.29/1.78 c_2EquantHeuristics_2EGUESS__EXISTS__GAP:
% 2.29/1.78 !>[A_27a: $tType,A_27b: $tType] : ( ( A_27a > A_27b ) > ( A_27b > $o ) > $o ) ).
% 2.29/1.78
% 2.29/1.78 thf(c_2EquantHeuristics_2EGUESS__EXISTS__POINT,type,
% 2.29/1.78 c_2EquantHeuristics_2EGUESS__EXISTS__POINT:
% 2.29/1.78 !>[A_27a: $tType,A_27b: $tType] : ( ( A_27a > A_27b ) > ( A_27b > $o ) > $o ) ).
% 2.29/1.78
% 2.29/1.78 thf(c_2EquantHeuristics_2EGUESS__FORALL,type,
% 2.29/1.78 c_2EquantHeuristics_2EGUESS__FORALL:
% 2.29/1.78 !>[A_27a: $tType,A_27b: $tType] : ( ( A_27a > A_27b ) > ( A_27b > $o ) > $o ) ).
% 2.29/1.78
% 2.29/1.78 thf(c_2EquantHeuristics_2EGUESS__FORALL__GAP,type,
% 2.29/1.78 c_2EquantHeuristics_2EGUESS__FORALL__GAP:
% 2.29/1.78 !>[A_27a: $tType,A_27b: $tType] : ( ( A_27a > A_27b ) > ( A_27b > $o ) > $o ) ).
% 2.29/1.78
% 2.29/1.78 thf(c_2EquantHeuristics_2EGUESS__FORALL__POINT,type,
% 2.29/1.78 c_2EquantHeuristics_2EGUESS__FORALL__POINT:
% 2.29/1.78 !>[A_27a: $tType,A_27b: $tType] : ( ( A_27a > A_27b ) > ( A_27b > $o ) > $o ) ).
% 2.29/1.78
% 2.29/1.78 thf(c_2Ebool_2ET,type,
% 2.29/1.78 c_2Ebool_2ET: $o ).
% 2.29/1.78
% 2.29/1.78 thf(c_2Ebool_2E_5C_2F,type,
% 2.29/1.78 c_2Ebool_2E_5C_2F: $o > $o > $o ).
% 2.29/1.78
% 2.29/1.78 thf(c_2Ebool_2E_7E,type,
% 2.29/1.78 c_2Ebool_2E_7E: $o > $o ).
% 2.29/1.78
% 2.29/1.78 thf(logicdef_2E_2F_5C,axiom,
% 2.29/1.78 ! [V0: $o,V1: $o] :
% 2.29/1.78 ( ( c_2Ebool_2E_2F_5C @ V0 @ V1 )
% 2.29/1.78 <=> ( V0
% 2.29/1.78 & V1 ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(logicdef_2E_5C_2F,axiom,
% 2.29/1.78 ! [V0: $o,V1: $o] :
% 2.29/1.78 ( ( c_2Ebool_2E_5C_2F @ V0 @ V1 )
% 2.29/1.78 <=> ( V0
% 2.29/1.78 | V1 ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(logicdef_2E_7E,axiom,
% 2.29/1.78 ! [V0: $o] :
% 2.29/1.78 ( ( c_2Ebool_2E_7E @ V0 )
% 2.29/1.78 <=> ( (~) @ V0 ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(logicdef_2E_3D_3D_3E,axiom,
% 2.29/1.78 ! [V0: $o,V1: $o] :
% 2.29/1.78 ( ( c_2Emin_2E_3D_3D_3E @ V0 @ V1 )
% 2.29/1.78 <=> ( V0
% 2.29/1.78 => V1 ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(logicdef_2E_3D,axiom,
% 2.29/1.78 ! [A_27a: $tType,V0: A_27a,V1: A_27a] :
% 2.29/1.78 ( ( c_2Emin_2E_3D @ A_27a @ V0 @ V1 )
% 2.29/1.78 <=> ( V0 = V1 ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(quantdef_2E_21,axiom,
% 2.29/1.78 ! [A_27a: $tType,V0f: A_27a > $o] :
% 2.29/1.78 ( ( c_2Ebool_2E_21 @ A_27a @ V0f )
% 2.29/1.78 <=> ! [V1x: A_27a] : ( V0f @ V1x ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(quantdef_2E_3F,axiom,
% 2.29/1.78 ! [A_27a: $tType,V0f: A_27a > $o] :
% 2.29/1.78 ( ( c_2Ebool_2E_3F @ A_27a @ V0f )
% 2.29/1.78 <=> ? [V1x: A_27a] : ( V0f @ V1x ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Ebool_2ETRUTH,axiom,
% 2.29/1.78 c_2Ebool_2ET ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Ebool_2EIMP__CLAUSES,axiom,
% 2.29/1.78 ! [V0t: $o] :
% 2.29/1.78 ( ( ( c_2Ebool_2ET
% 2.29/1.78 => V0t )
% 2.29/1.78 <=> V0t )
% 2.29/1.78 & ( ( V0t
% 2.29/1.78 => c_2Ebool_2ET )
% 2.29/1.78 <=> c_2Ebool_2ET )
% 2.29/1.78 & ( ( c_2Ebool_2EF
% 2.29/1.78 => V0t )
% 2.29/1.78 <=> c_2Ebool_2ET )
% 2.29/1.78 & ( ( V0t
% 2.29/1.78 => V0t )
% 2.29/1.78 <=> c_2Ebool_2ET )
% 2.29/1.78 & ( ( V0t
% 2.29/1.78 => c_2Ebool_2EF )
% 2.29/1.78 <=> ( (~) @ V0t ) ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Ebool_2ENOT__CLAUSES,axiom,
% 2.29/1.78 ( ! [V0t: $o] :
% 2.29/1.78 ( ( (~) @ ( (~) @ V0t ) )
% 2.29/1.78 <=> V0t )
% 2.29/1.78 & ( ( (~) @ c_2Ebool_2ET )
% 2.29/1.78 <=> c_2Ebool_2EF )
% 2.29/1.78 & ( ( (~) @ c_2Ebool_2EF )
% 2.29/1.78 <=> c_2Ebool_2ET ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Ebool_2EEQ__SYM__EQ,axiom,
% 2.29/1.78 ! [A_27a: $tType,V0x: A_27a,V1y: A_27a] :
% 2.29/1.78 ( ( V0x = V1y )
% 2.29/1.78 <=> ( V1y = V0x ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Ebool_2EEQ__CLAUSES,axiom,
% 2.29/1.78 ! [V0t: $o] :
% 2.29/1.78 ( ( ( c_2Ebool_2ET = V0t )
% 2.29/1.78 <=> V0t )
% 2.29/1.78 & ( ( V0t = c_2Ebool_2ET )
% 2.29/1.78 <=> V0t )
% 2.29/1.78 & ( ( c_2Ebool_2EF = V0t )
% 2.29/1.78 <=> ( (~) @ V0t ) )
% 2.29/1.78 & ( ( V0t = c_2Ebool_2EF )
% 2.29/1.78 <=> ( (~) @ V0t ) ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Ebool_2EAND__IMP__INTRO,axiom,
% 2.29/1.78 ! [V0t1: $o,V1t2: $o,V2t3: $o] :
% 2.29/1.78 ( ( V0t1
% 2.29/1.78 => ( V1t2
% 2.29/1.78 => V2t3 ) )
% 2.29/1.78 <=> ( ( V0t1
% 2.29/1.78 & V1t2 )
% 2.29/1.78 => V2t3 ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Ebool_2EIMP__CONG,axiom,
% 2.29/1.78 ! [V0x: $o,V1x_27: $o,V2y: $o,V3y_27: $o] :
% 2.29/1.78 ( ( ( V0x = V1x_27 )
% 2.29/1.78 & ( V1x_27
% 2.29/1.78 => ( V2y = V3y_27 ) ) )
% 2.29/1.78 => ( ( V0x
% 2.29/1.78 => V2y )
% 2.29/1.78 <=> ( V1x_27
% 2.29/1.78 => V3y_27 ) ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2EquantHeuristics_2EGUESS__REWRITES,axiom,
% 2.29/1.78 ! [A_27a: $tType,A_27b: $tType,V0i: A_27a > A_27b,V1P: A_27b > $o] :
% 2.29/1.78 ( ( ( c_2EquantHeuristics_2EGUESS__EXISTS @ A_27a @ A_27b @ V0i @ V1P )
% 2.29/1.78 <=> ! [V2v: A_27b] :
% 2.29/1.78 ( ( V1P @ V2v )
% 2.29/1.78 => ? [V3fv: A_27a] : ( V1P @ ( V0i @ V3fv ) ) ) )
% 2.29/1.78 & ( ( c_2EquantHeuristics_2EGUESS__FORALL @ A_27a @ A_27b @ V0i @ V1P )
% 2.29/1.78 <=> ! [V4v: A_27b] :
% 2.29/1.78 ( ( (~) @ ( V1P @ V4v ) )
% 2.29/1.78 => ? [V5fv: A_27a] : ( (~) @ ( V1P @ ( V0i @ V5fv ) ) ) ) )
% 2.29/1.78 & ! [V6i: A_27a > A_27b,V7P: A_27b > $o] :
% 2.29/1.78 ( ( c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ A_27a @ A_27b @ V6i @ V7P )
% 2.29/1.78 <=> ! [V8fv: A_27a] : ( V7P @ ( V6i @ V8fv ) ) )
% 2.29/1.78 & ! [V9i: A_27a > A_27b,V10P: A_27b > $o] :
% 2.29/1.78 ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ A_27a @ A_27b @ V9i @ V10P )
% 2.29/1.78 <=> ! [V11fv: A_27a] : ( (~) @ ( V10P @ ( V9i @ V11fv ) ) ) )
% 2.29/1.78 & ! [V12i: A_27a > A_27b,V13P: A_27b > $o] :
% 2.29/1.78 ( ( c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ A_27a @ A_27b @ V12i @ V13P )
% 2.29/1.78 <=> ! [V14v: A_27b] :
% 2.29/1.78 ( ( V13P @ V14v )
% 2.29/1.78 => ? [V15fv: A_27a] :
% 2.29/1.78 ( V14v
% 2.29/1.78 = ( V12i @ V15fv ) ) ) )
% 2.29/1.78 & ! [V16i: A_27a > A_27b,V17P: A_27b > $o] :
% 2.29/1.78 ( ( c_2EquantHeuristics_2EGUESS__FORALL__GAP @ A_27a @ A_27b @ V16i @ V17P )
% 2.29/1.78 <=> ! [V18v: A_27b] :
% 2.29/1.78 ( ( (~) @ ( V17P @ V18v ) )
% 2.29/1.78 => ? [V19fv: A_27a] :
% 2.29/1.78 ( V18v
% 2.29/1.78 = ( V16i @ V19fv ) ) ) ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Esat_2ENOT__NOT,axiom,
% 2.29/1.78 ! [V0t: $o] :
% 2.29/1.78 ( ( (~) @ ( (~) @ V0t ) )
% 2.29/1.78 <=> V0t ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Esat_2EAND__INV__IMP,axiom,
% 2.29/1.78 ! [V0A: $o] :
% 2.29/1.78 ( V0A
% 2.29/1.78 => ( ( (~) @ V0A )
% 2.29/1.78 => c_2Ebool_2EF ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Esat_2EOR__DUAL2,axiom,
% 2.29/1.78 ! [V0B: $o,V1A: $o] :
% 2.29/1.78 ( ( ( (~)
% 2.29/1.78 @ ( V1A
% 2.29/1.78 | V0B ) )
% 2.29/1.78 => c_2Ebool_2EF )
% 2.29/1.78 <=> ( ( V1A
% 2.29/1.78 => c_2Ebool_2EF )
% 2.29/1.78 => ( ( (~) @ V0B )
% 2.29/1.78 => c_2Ebool_2EF ) ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Esat_2EOR__DUAL3,axiom,
% 2.29/1.78 ! [V0B: $o,V1A: $o] :
% 2.29/1.78 ( ( ( (~)
% 2.29/1.78 @ ( ( (~) @ V1A )
% 2.29/1.78 | V0B ) )
% 2.29/1.78 => c_2Ebool_2EF )
% 2.29/1.78 <=> ( V1A
% 2.29/1.78 => ( ( (~) @ V0B )
% 2.29/1.78 => c_2Ebool_2EF ) ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Esat_2EAND__INV2,axiom,
% 2.29/1.78 ! [V0A: $o] :
% 2.29/1.78 ( ( ( (~) @ V0A )
% 2.29/1.78 => c_2Ebool_2EF )
% 2.29/1.78 => ( ( V0A
% 2.29/1.78 => c_2Ebool_2EF )
% 2.29/1.78 => c_2Ebool_2EF ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Esat_2Edc__eq,axiom,
% 2.29/1.78 ! [V0r: $o,V1q: $o,V2p: $o] :
% 2.29/1.78 ( ( V2p
% 2.29/1.78 <=> ( V1q = V0r ) )
% 2.29/1.78 <=> ( ( V2p
% 2.29/1.78 | V1q
% 2.29/1.78 | V0r )
% 2.29/1.78 & ( V2p
% 2.29/1.78 | ( (~) @ V0r )
% 2.29/1.78 | ( (~) @ V1q ) )
% 2.29/1.78 & ( V1q
% 2.29/1.78 | ( (~) @ V0r )
% 2.29/1.78 | ( (~) @ V2p ) )
% 2.29/1.78 & ( V0r
% 2.29/1.78 | ( (~) @ V1q )
% 2.29/1.78 | ( (~) @ V2p ) ) ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Esat_2Edc__disj,axiom,
% 2.29/1.78 ! [V0r: $o,V1q: $o,V2p: $o] :
% 2.29/1.78 ( ( V2p
% 2.29/1.78 <=> ( V1q
% 2.29/1.78 | V0r ) )
% 2.29/1.78 <=> ( ( V2p
% 2.29/1.78 | ( (~) @ V1q ) )
% 2.29/1.78 & ( V2p
% 2.29/1.78 | ( (~) @ V0r ) )
% 2.29/1.78 & ( V1q
% 2.29/1.78 | V0r
% 2.29/1.78 | ( (~) @ V2p ) ) ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Esat_2Edc__imp,axiom,
% 2.29/1.78 ! [V0r: $o,V1q: $o,V2p: $o] :
% 2.29/1.78 ( ( V2p
% 2.29/1.78 <=> ( V1q
% 2.29/1.78 => V0r ) )
% 2.29/1.78 <=> ( ( V2p
% 2.29/1.78 | V1q )
% 2.29/1.78 & ( V2p
% 2.29/1.78 | ( (~) @ V0r ) )
% 2.29/1.78 & ( ( (~) @ V1q )
% 2.29/1.78 | V0r
% 2.29/1.78 | ( (~) @ V2p ) ) ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Esat_2Edc__neg,axiom,
% 2.29/1.78 ! [V0q: $o,V1p: $o] :
% 2.29/1.78 ( ( V1p
% 2.29/1.78 <=> ( (~) @ V0q ) )
% 2.29/1.78 <=> ( ( V1p
% 2.29/1.78 | V0q )
% 2.29/1.78 & ( ( (~) @ V0q )
% 2.29/1.78 | ( (~) @ V1p ) ) ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Esat_2Epth__ni1,axiom,
% 2.29/1.78 ! [V0q: $o,V1p: $o] :
% 2.29/1.78 ( ( (~)
% 2.29/1.78 @ ( V1p
% 2.29/1.78 => V0q ) )
% 2.29/1.78 => V1p ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2Esat_2Epth__ni2,axiom,
% 2.29/1.78 ! [V0q: $o,V1p: $o] :
% 2.29/1.78 ( ( (~)
% 2.29/1.78 @ ( V1p
% 2.29/1.78 => V0q ) )
% 2.29/1.78 => ( (~) @ V0q ) ) ).
% 2.29/1.78
% 2.29/1.78 thf(thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT,conjecture,
% 2.29/1.78 ! [A_27a: $tType,A_27b: $tType,V0i: A_27b > A_27a,V1P: A_27a > $o,V2Q: A_27a > $o] :
% 2.29/1.78 ( ! [V3x: A_27a] :
% 2.29/1.78 ( ( V2Q @ V3x )
% 2.29/1.78 => ( V1P @ V3x ) )
% 2.29/1.78 => ( ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ A_27b @ A_27a @ V0i @ V1P )
% 2.29/1.78 => ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ A_27b @ A_27a @ V0i @ V2Q ) ) ) ).
% 2.29/1.78 ------------------------
% 2.42/1.81 % (20032)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/275Mi)
% 2.42/1.81 % (20031)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/2Mi)
% 2.42/1.81 % (20029)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/27Mi)
% 2.42/1.81 % (20028)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/4Mi)
% 2.42/1.81 % (20027)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/183Mi)
% 2.42/1.81 % (20033)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/18Mi)
% 2.42/1.81 % (20030)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/2Mi)
% 2.42/1.81 % Exception at run slice level
% 2.42/1.81 User error: % (20030)Instruction limit reached!
% 2.42/1.81 % (20030)------------------------------
% 2.42/1.81 % (20030)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.81 % (20030)Termination reason: Unknown
% 2.42/1.81 % (20030)Termination phase: Property scanning
% 2.42/1.81
% 2.42/1.81 % (20030)Memory used [KB]: 1023
% 2.42/1.81 % (20030)Time elapsed: 0.003 s
% 2.42/1.81 % (20030)Instructions burned: 3 (million)
% 2.42/1.81 % (20030)------------------------------
% 2.42/1.81 % (20030)------------------------------
% 2.42/1.81 Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire% (20031)Instruction limit reached!
% 2.42/1.81 % (20031)------------------------------
% 2.42/1.81 % (20031)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.81 % (20031)Termination reason: Unknown
% 2.42/1.81 % (20031)Termination phase: shuffling
% 2.42/1.81
% 2.42/1.81 % (20031)Memory used [KB]: 1023
% 2.42/1.81 % (20031)Time elapsed: 0.004 s
% 2.42/1.81 % (20031)Instructions burned: 2 (million)
% 2.42/1.81 % (20031)------------------------------
% 2.42/1.81 % (20031)------------------------------
% 2.42/1.81 % (20028)Instruction limit reached!
% 2.42/1.81 % (20028)------------------------------
% 2.42/1.81 % (20028)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.81 % (20028)Termination reason: Unknown
% 2.42/1.81 % (20028)Termination phase: shuffling
% 2.42/1.81
% 2.42/1.81 % (20028)Memory used [KB]: 1023
% 2.42/1.81 % (20028)Time elapsed: 0.004 s
% 2.42/1.81 % (20028)Instructions burned: 4 (million)
% 2.42/1.81 % (20028)------------------------------
% 2.42/1.81 % (20028)------------------------------
% 2.42/1.81 % (20032)Refutation not found, incomplete strategy
% 2.42/1.81 % (20032)------------------------------
% 2.42/1.81 % (20032)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.81 % (20032)Termination reason: Refutation not found, incomplete strategy
% 2.42/1.81
% 2.42/1.81
% 2.42/1.81 % (20032)Memory used [KB]: 5500
% 2.42/1.81 % (20032)Time elapsed: 0.005 s
% 2.42/1.81 % (20032)Instructions burned: 4 (million)
% 2.42/1.81 % (20032)------------------------------
% 2.42/1.81 % (20032)------------------------------
% 2.42/1.82 % (20033)Instruction limit reached!
% 2.42/1.82 % (20033)------------------------------
% 2.42/1.82 % (20033)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.82 % (20033)Termination reason: Unknown
% 2.42/1.82 % (20033)Termination phase: Saturation
% 2.42/1.82
% 2.42/1.82 % (20033)Memory used [KB]: 5756
% 2.42/1.82 % (20033)Time elapsed: 0.013 s
% 2.42/1.82 % (20033)Instructions burned: 18 (million)
% 2.42/1.82 % (20033)------------------------------
% 2.42/1.82 % (20033)------------------------------
% 2.42/1.82 % (20029)Instruction limit reached!
% 2.42/1.82 % (20029)------------------------------
% 2.42/1.82 % (20029)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.82 % (20029)Termination reason: Unknown
% 2.42/1.82 % (20029)Termination phase: Saturation
% 2.42/1.82
% 2.42/1.82 % (20029)Memory used [KB]: 5884
% 2.42/1.82 % (20029)Time elapsed: 0.018 s
% 2.42/1.82 % (20029)Instructions burned: 27 (million)
% 2.42/1.82 % (20029)------------------------------
% 2.42/1.82 % (20029)------------------------------
% 2.42/1.83 % (20036)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/15Mi)
% 2.42/1.83 % (20035)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/37Mi)
% 2.42/1.83 % (20034)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/3Mi)
% 2.42/1.83 % Exception at run slice level
% 2.42/1.83 User error: % (20034)Instruction limit reached!
% 2.42/1.83 % (20034)------------------------------
% 2.42/1.83 % (20034)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.83 % (20034)Termination reason: Unknown
% 2.42/1.83 % (20034)Termination phase: Naming
% 2.42/1.83
% 2.42/1.83 % (20034)Memory used [KB]: 1023
% 2.42/1.83 % (20034)Time elapsed: 0.004 s
% 2.42/1.83 % (20034)Instructions burned: 3 (million)
% 2.42/1.83 % (20034)------------------------------
% 2.42/1.83 % (20034)------------------------------
% 2.42/1.83 Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 2.42/1.83 % (20037)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/3Mi)
% 2.42/1.83 % (20037)Instruction limit reached!
% 2.42/1.83 % (20037)------------------------------
% 2.42/1.83 % (20037)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.83 % (20037)Termination reason: Unknown
% 2.42/1.83 % (20037)Termination phase: Property scanning
% 2.42/1.83
% 2.42/1.83 % (20037)Memory used [KB]: 1023
% 2.42/1.83 % (20037)Time elapsed: 0.003 s
% 2.42/1.83 % (20037)Instructions burned: 3 (million)
% 2.42/1.83 % (20037)------------------------------
% 2.42/1.83 % (20037)------------------------------
% 2.42/1.84 % (20036)Instruction limit reached!
% 2.42/1.84 % (20036)------------------------------
% 2.42/1.84 % (20036)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.84 % (20036)Termination reason: Unknown
% 2.42/1.84 % (20038)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/1041Mi)
% 2.42/1.84 % (20036)Termination phase: Property scanning
% 2.42/1.84
% 2.42/1.84 % (20036)Memory used [KB]: 1279
% 2.42/1.84 % (20036)Time elapsed: 0.010 s
% 2.42/1.84 % (20036)Instructions burned: 15 (million)
% 2.42/1.84 % (20036)------------------------------
% 2.42/1.84 % (20036)------------------------------
% 2.42/1.84 % Exception at run slice level
% 2.42/1.84 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 2.42/1.84 % (20039)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/7Mi)
% 2.42/1.85 % (20039)Instruction limit reached!
% 2.42/1.85 % (20039)------------------------------
% 2.42/1.85 % (20039)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.85 % (20039)Termination reason: Unknown
% 2.42/1.85 % (20039)Termination phase: Property scanning
% 2.42/1.85
% 2.42/1.85 % (20039)Memory used [KB]: 1151
% 2.42/1.85 % (20039)Time elapsed: 0.007 s
% 2.42/1.85 % (20039)Instructions burned: 8 (million)
% 2.42/1.85 % (20039)------------------------------
% 2.42/1.85 % (20039)------------------------------
% 2.42/1.85 % (20040)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/16Mi)
% 2.42/1.85 % (20041)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/3Mi)
% 2.42/1.85 % (20042)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/3Mi)
% 2.42/1.85 % (20041)Instruction limit reached!
% 2.42/1.85 % (20041)------------------------------
% 2.42/1.85 % (20041)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.85 % (20041)Termination reason: Unknown
% 2.42/1.85 % (20041)Termination phase: Preprocessing 1
% 2.42/1.85
% 2.42/1.85 % (20041)Memory used [KB]: 1023
% 2.42/1.85 % (20041)Time elapsed: 0.004 s
% 2.42/1.85 % (20041)Instructions burned: 3 (million)
% 2.42/1.85 % (20041)------------------------------
% 2.42/1.85 % (20041)------------------------------
% 2.42/1.85 % (20042)Instruction limit reached!
% 2.42/1.85 % (20042)------------------------------
% 2.42/1.85 % (20042)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.85 % (20042)Termination reason: Unknown
% 2.42/1.85 % (20042)Termination phase: Preprocessing 2
% 2.42/1.85
% 2.42/1.85 % (20042)Memory used [KB]: 1023
% 2.42/1.85 % (20042)Time elapsed: 0.004 s
% 2.42/1.85 % (20042)Instructions burned: 4 (million)
% 2.42/1.85 % (20042)------------------------------
% 2.42/1.85 % (20042)------------------------------
% 2.42/1.86 % (20043)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/7Mi)
% 2.42/1.86 % (20044)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/3Mi)
% 2.42/1.86 % (20044)Instruction limit reached!
% 2.42/1.86 % (20044)------------------------------
% 2.42/1.86 % (20044)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.86 % (20044)Termination reason: Unknown
% 2.42/1.86 % (20044)Termination phase: shuffling
% 2.42/1.86
% 2.42/1.86 % (20044)Memory used [KB]: 1023
% 2.42/1.86 % (20044)Time elapsed: 0.003 s
% 2.42/1.86 % (20044)Instructions burned: 3 (million)
% 2.42/1.86 % (20044)------------------------------
% 2.42/1.86 % (20044)------------------------------
% 2.42/1.86 % (20040)Instruction limit reached!
% 2.42/1.86 % (20040)------------------------------
% 2.42/1.86 % (20040)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.86 % (20040)Termination reason: Unknown
% 2.42/1.86 % (20040)Termination phase: Saturation
% 2.42/1.86
% 2.42/1.86 % (20040)Memory used [KB]: 5756
% 2.42/1.86 % (20040)Time elapsed: 0.011 s
% 2.42/1.86 % (20040)Instructions burned: 16 (million)
% 2.42/1.86 % (20040)------------------------------
% 2.42/1.86 % (20040)------------------------------
% 2.42/1.86 % (20043)Instruction limit reached!
% 2.42/1.86 % (20043)------------------------------
% 2.42/1.86 % (20043)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.86 % (20043)Termination reason: Unknown
% 2.42/1.86 % (20043)Termination phase: Property scanning
% 2.42/1.86
% 2.42/1.86 % (20043)Memory used [KB]: 1151
% 2.42/1.86 % (20043)Time elapsed: 0.006 s
% 2.42/1.86 % (20043)Instructions burned: 7 (million)
% 2.42/1.86 % (20043)------------------------------
% 2.42/1.86 % (20043)------------------------------
% 2.42/1.87 % (20045)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/4Mi)
% 2.42/1.87 % (20046)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/18Mi)
% 2.42/1.87 % (20045)Instruction limit reached!
% 2.42/1.87 % (20045)------------------------------
% 2.42/1.87 % (20045)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.87 % (20045)Termination reason: Unknown
% 2.42/1.87 % (20045)Termination phase: Preprocessing 3
% 2.42/1.87
% 2.42/1.87 % (20045)Memory used [KB]: 1151
% 2.42/1.87 % (20045)Time elapsed: 0.005 s
% 2.42/1.87 % (20045)Instructions burned: 5 (million)
% 2.42/1.87 % (20045)------------------------------
% 2.42/1.87 % (20045)------------------------------
% 2.42/1.87 % (20047)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/710Mi)
% 2.42/1.88 % (20049)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/902Mi)
% 2.42/1.88 % (20048)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/6Mi)
% 2.42/1.88 % (20050)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/21Mi)
% 2.42/1.88 % (20046)Instruction limit reached!
% 2.42/1.88 % (20046)------------------------------
% 2.42/1.88 % (20046)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.88 % (20046)Termination reason: Unknown
% 2.42/1.88 % (20046)Termination phase: Saturation
% 2.42/1.88
% 2.42/1.88 % (20046)Memory used [KB]: 5756
% 2.42/1.88 % (20046)Time elapsed: 0.012 s
% 2.42/1.88 % (20046)Instructions burned: 18 (million)
% 2.42/1.88 % (20046)------------------------------
% 2.42/1.88 % (20046)------------------------------
% 2.42/1.88 % (20048)Instruction limit reached!
% 2.42/1.88 % (20048)------------------------------
% 2.42/1.88 % (20048)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.88 % (20048)Termination reason: Unknown
% 2.42/1.88 % (20048)Termination phase: Clausification
% 2.42/1.88
% 2.42/1.88 % (20048)Memory used [KB]: 1151
% 2.42/1.88 % (20048)Time elapsed: 0.006 s
% 2.42/1.88 % (20048)Instructions burned: 6 (million)
% 2.42/1.88 % (20048)------------------------------
% 2.42/1.88 % (20048)------------------------------
% 2.42/1.89 % (20050)Instruction limit reached!
% 2.42/1.89 % (20050)------------------------------
% 2.42/1.89 % (20050)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.89 % (20050)Termination reason: Unknown
% 2.42/1.89 % (20050)Termination phase: Property scanning
% 2.42/1.89
% 2.42/1.89 % (20051)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/5Mi)
% 2.42/1.89 % (20050)Memory used [KB]: 1535
% 2.42/1.89 % (20050)Time elapsed: 0.013 s
% 2.42/1.89 % (20050)Instructions burned: 21 (million)
% 2.42/1.89 % (20050)------------------------------
% 2.42/1.89 % (20050)------------------------------
% 2.42/1.89 % Exception at run slice level
% 2.42/1.89 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 2.42/1.90 % (20052)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/6Mi)
% 2.42/1.90 % (20053)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/377Mi)
% 2.42/1.90 % Exception at run slice level
% 2.42/1.90 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 2.42/1.91 % (20054)dis+1010_1:4_atotf=0.2:c=on:cbe=off:cnfonf=lazy_simp:fe=off:ins=2:ntd=on:s2a=on:s2at=5.0:sgt=5:ss=axioms:st=1.5:i=779:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/779Mi)
% 2.42/1.91 % (20055)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on DTF2THF_19927 for (2999ds/19Mi)
% 2.42/1.91 % Exception at run slice level
% 2.42/1.91 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 2.42/1.91 % Exception at run slice level
% 2.42/1.91 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 2.42/1.92 % (20027)Instruction limit reached!
% 2.42/1.92 % (20027)------------------------------
% 2.42/1.92 % (20027)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.92 % (20027)Termination reason: Unknown
% 2.42/1.92 % (20027)Termination phase: Saturation
% 2.42/1.92
% 2.42/1.92 % (20027)Memory used [KB]: 6908
% 2.42/1.92 % (20027)Time elapsed: 0.114 s
% 2.42/1.92 % (20027)Instructions burned: 184 (million)
% 2.42/1.92 % (20027)------------------------------
% 2.42/1.92 % (20027)------------------------------
% 2.42/1.92 % (20056)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on DTF2THF_19927 for (2998ds/879Mi)
% 2.42/1.93 % (20057)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on DTF2THF_19927 for (2998ds/17Mi)
% 2.42/1.93 % (20058)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on DTF2THF_19927 for (2998ds/3Mi)
% 2.42/1.93 % (20058)Instruction limit reached!
% 2.42/1.93 % (20058)------------------------------
% 2.42/1.93 % (20058)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.93 % (20058)Termination reason: Unknown
% 2.42/1.93 % (20058)Termination phase: Property scanning
% 2.42/1.93
% 2.42/1.93 % (20058)Memory used [KB]: 1023
% 2.42/1.93 % (20058)Time elapsed: 0.003 s
% 2.42/1.93 % (20058)Instructions burned: 3 (million)
% 2.42/1.93 % (20058)------------------------------
% 2.42/1.93 % (20058)------------------------------
% 2.42/1.94 % (20059)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on DTF2THF_19927 for (2998ds/30Mi)
% 2.42/1.94 % (20057)Instruction limit reached!
% 2.42/1.94 % (20057)------------------------------
% 2.42/1.94 % (20057)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.94 % (20057)Termination reason: Unknown
% 2.42/1.94 % (20057)Termination phase: Saturation
% 2.42/1.94
% 2.42/1.94 % (20057)Memory used [KB]: 5756
% 2.42/1.94 % (20057)Time elapsed: 0.013 s
% 2.42/1.94 % (20057)Instructions burned: 18 (million)
% 2.42/1.94 % (20057)------------------------------
% 2.42/1.94 % (20057)------------------------------
% 2.42/1.96 % (20060)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on DTF2THF_19927 for (2998ds/127Mi)
% 2.42/1.96 % (20059)Instruction limit reached!
% 2.42/1.96 % (20059)------------------------------
% 2.42/1.96 % (20059)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.96 % (20059)Termination reason: Unknown
% 2.42/1.96 % (20059)Termination phase: Saturation
% 2.42/1.96
% 2.42/1.96 % (20059)Memory used [KB]: 5884
% 2.42/1.96 % (20059)Time elapsed: 0.020 s
% 2.42/1.96 % (20059)Instructions burned: 30 (million)
% 2.42/1.96 % (20059)------------------------------
% 2.42/1.96 % (20059)------------------------------
% 2.42/1.97 % (20061)lrs+1002_1:1_au=on:cbe=off:cnfonf=conj_eager:cond=on:hi=on:i=100:si=on:rtra=on_0 on DTF2THF_19927 for (2998ds/100Mi)
% 2.42/1.98 % (20062)dis+10_1:1_anc=none:cnfonf=lazy_gen:fd=preordered:fe=off:hud=10:ins=3:ixr=off:nwc=5.0:plsq=on:plsqc=1:plsqr=32,1:sp=const_frequency:uhcvi=on:i=3:si=on:rtra=on_0 on DTF2THF_19927 for (2998ds/3Mi)
% 2.42/1.98 % (20062)Instruction limit reached!
% 2.42/1.98 % (20062)------------------------------
% 2.42/1.98 % (20062)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/1.98 % (20062)Termination reason: Unknown
% 2.42/1.98 % (20062)Termination phase: shuffling
% 2.42/1.98
% 2.42/1.98 % (20062)Memory used [KB]: 1023
% 2.42/1.98 % (20062)Time elapsed: 0.004 s
% 2.42/1.98 % (20062)Instructions burned: 3 (million)
% 2.42/1.98 % (20062)------------------------------
% 2.42/1.98 % (20062)------------------------------
% 2.42/2.00 % (20063)lrs+10_8:1_au=on:avsq=on:e2e=on:ins=3:s2a=on:s2at=3.0:ss=axioms:i=20:si=on:rtra=on_0 on DTF2THF_19927 for (2997ds/20Mi)
% 2.42/2.01 % (20063)Refutation not found, incomplete strategy
% 2.42/2.01 % (20063)------------------------------
% 2.42/2.01 % (20063)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/2.01 % (20063)Termination reason: Refutation not found, incomplete strategy
% 2.42/2.01
% 2.42/2.01
% 2.42/2.01 % (20063)Memory used [KB]: 5628
% 2.42/2.01 % (20063)Time elapsed: 0.005 s
% 2.42/2.01 % (20063)Instructions burned: 5 (million)
% 2.42/2.01 % (20063)------------------------------
% 2.42/2.01 % (20063)------------------------------
% 2.42/2.03 % (20061)Instruction limit reached!
% 2.42/2.03 % (20061)------------------------------
% 2.42/2.03 % (20061)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 2.42/2.03 % (20061)Termination reason: Unknown
% 2.42/2.03 % (20061)Termination phase: Saturation
% 2.42/2.03
% 2.42/2.03 % (20061)Memory used [KB]: 5884
% 2.42/2.03 % (20061)Time elapsed: 0.062 s
% 2.42/2.03 % (20061)Instructions burned: 101 (million)
% 2.42/2.03 % (20061)------------------------------
% 2.42/2.03 % (20061)------------------------------
% 2.42/2.03 % (20064)dis+1002_1:1_cbe=off:hud=5:nm=4:plsq=on:plsqr=7,1:prag=on:sp=const_max:tnu=1:i=86:si=on:rtra=on_0 on DTF2THF_19927 for (2997ds/86Mi)
% 4.04/2.04 % (20060)Instruction limit reached!
% 4.04/2.04 % (20060)------------------------------
% 4.04/2.04 % (20060)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 4.04/2.04 % (20060)Termination reason: Unknown
% 4.04/2.04 % (20060)Termination phase: Saturation
% 4.04/2.04
% 4.04/2.04 % (20060)Memory used [KB]: 6396
% 4.04/2.04 % (20060)Time elapsed: 0.084 s
% 4.04/2.04 % (20060)Instructions burned: 128 (million)
% 4.04/2.04 % (20060)------------------------------
% 4.04/2.04 % (20060)------------------------------
% 4.04/2.05 % (20065)lrs+1010_1:1_au=on:cbe=off:nm=2:ntd=on:sd=2:ss=axioms:st=5.0:i=107:si=on:rtra=on_0 on DTF2THF_19927 for (2997ds/107Mi)
% 4.04/2.06 % (20066)lrs+2_1:1024_cnfonf=lazy_gen:fe=off:hud=15:plsq=on:plsqc=1:plsqr=32,1:i=39:si=on:rtra=on_0 on DTF2THF_19927 for (2997ds/39Mi)
% 4.04/2.06 % Exception at run slice level
% 4.04/2.06 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 4.04/2.08 % (20067)dis+10_1:1_cnfonf=lazy_not_gen:fsr=off:kws=precedence:nwc=5.0:s2a=on:ss=axioms:st=1.5:i=448:si=on:rtra=on_0 on DTF2THF_19927 for (2997ds/448Mi)
% 4.04/2.08 % Exception at run slice level
% 4.04/2.08 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 4.04/2.08 % (20064)Instruction limit reached!
% 4.04/2.08 % (20064)------------------------------
% 4.04/2.08 % (20064)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 4.04/2.08 % (20064)Termination reason: Unknown
% 4.04/2.08 % (20064)Termination phase: Saturation
% 4.04/2.08
% 4.04/2.08 % (20064)Memory used [KB]: 6396
% 4.04/2.08 % (20064)Time elapsed: 0.055 s
% 4.04/2.08 % (20064)Instructions burned: 86 (million)
% 4.04/2.08 % (20064)------------------------------
% 4.04/2.08 % (20064)------------------------------
% 4.04/2.10 % (20069)lrs+10_1:10_au=on:av=off:cbe=off:cnfonf=lazy_pi_sigma_gen:ntd=on:plsq=on:plsqc=1:plsqr=32,1:i=98:si=on:rtra=on_0 on DTF2THF_19927 for (2997ds/98Mi)
% 4.04/2.10 % (20068)lrs+10_1:512_au=on:fde=unused:lma=on:nm=32:plsq=on:plsqc=1:plsqr=16121663,131072:sfv=off:sp=const_max:ss=axioms:st=3.0:tgt=full:i=46:si=on:rtra=on_0 on DTF2THF_19927 for (2997ds/46Mi)
% 4.04/2.10 % Exception at run slice level
% 4.04/2.10 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 4.04/2.11 % (20065)Instruction limit reached!
% 4.04/2.11 % (20065)------------------------------
% 4.04/2.11 % (20065)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 4.04/2.11 % (20065)Termination reason: Unknown
% 4.04/2.11 % (20065)Termination phase: Saturation
% 4.04/2.11
% 4.04/2.11 % (20065)Memory used [KB]: 6140
% 4.04/2.11 % (20065)Time elapsed: 0.069 s
% 4.04/2.11 % (20065)Instructions burned: 108 (million)
% 4.04/2.11 % (20065)------------------------------
% 4.04/2.11 % (20065)------------------------------
% 4.04/2.12 % (20070)ott+1002_1:1_apa=on:au=on:bd=off:cnfonf=off:fd=off:sos=on:sp=weighted_frequency:i=507:si=on:rtra=on_0 on DTF2THF_19927 for (2996ds/507Mi)
% 4.04/2.13 % (20068)Instruction limit reached!
% 4.04/2.13 % (20068)------------------------------
% 4.04/2.13 % (20068)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 4.04/2.13 % (20068)Termination reason: Unknown
% 4.04/2.13 % (20068)Termination phase: Saturation
% 4.04/2.13
% 4.04/2.13 % (20068)Memory used [KB]: 5884
% 4.04/2.13 % (20068)Time elapsed: 0.030 s
% 4.04/2.13 % (20068)Instructions burned: 47 (million)
% 4.04/2.13 % (20068)------------------------------
% 4.04/2.13 % (20068)------------------------------
% 4.73/2.13 % (20071)dis+1010_2:3_amm=off:fd=preordered:ixr=off:nm=0:pe=on:piset=equals:prag=on:sac=on:tgt=ground:i=149:si=on:rtra=on_0 on DTF2THF_19927 for (2996ds/149Mi)
% 4.73/2.14 % (20053)Instruction limit reached!
% 4.73/2.14 % (20053)------------------------------
% 4.73/2.14 % (20053)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 4.73/2.14 % (20053)Termination reason: Unknown
% 4.73/2.14 % (20053)Termination phase: Saturation
% 4.73/2.14
% 4.73/2.14 % (20053)Memory used [KB]: 6652
% 4.73/2.14 % (20053)Time elapsed: 0.264 s
% 4.73/2.14 % (20053)Instructions burned: 378 (million)
% 4.73/2.14 % (20053)------------------------------
% 4.73/2.14 % (20053)------------------------------
% 4.73/2.15 % (20072)lrs+21_1:16_au=on:bd=off:piset=and:i=39:si=on:rtra=on_0 on DTF2THF_19927 for (2996ds/39Mi)
% 4.73/2.16 % (20073)lrs+1004_1:1_cnfonf=lazy_pi_sigma_gen:fe=off:gs=on:hud=10:prag=on:tnu=1:i=6:si=on:rtra=on_0 on DTF2THF_19927 for (2996ds/6Mi)
% 4.73/2.16 % Exception at run slice level
% 4.73/2.16 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 4.73/2.17 % (20072)Instruction limit reached!
% 4.73/2.17 % (20072)------------------------------
% 4.73/2.17 % (20072)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 4.73/2.17 % (20072)Termination reason: Unknown
% 4.73/2.17 % (20072)Termination phase: Saturation
% 4.73/2.17
% 4.73/2.17 % (20072)Memory used [KB]: 5884
% 4.73/2.17 % (20072)Time elapsed: 0.022 s
% 4.73/2.17 % (20072)Instructions burned: 40 (million)
% 4.73/2.17 % (20072)------------------------------
% 4.73/2.17 % (20072)------------------------------
% 4.73/2.18 % (20074)dis+1002_1:1_aac=none:au=on:e2e=on:nm=2:nwc=10.0:sd=1:ss=axioms:st=3.0:i=1087:si=on:rtra=on_0 on DTF2THF_19927 for (2996ds/1087Mi)
% 4.73/2.18 % (20075)dis+10_1:1_aac=none:cs=on:i=47:si=on:rtra=on_0 on DTF2THF_19927 for (2996ds/47Mi)
% 5.02/2.20 % (20075)Instruction limit reached!
% 5.02/2.20 % (20075)------------------------------
% 5.02/2.20 % (20075)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 5.02/2.20 % (20075)Termination reason: Unknown
% 5.02/2.20 % (20075)Termination phase: Saturation
% 5.02/2.20
% 5.02/2.20 % (20075)Memory used [KB]: 6012
% 5.02/2.20 % (20075)Time elapsed: 0.021 s
% 5.02/2.20 % (20075)Instructions burned: 48 (million)
% 5.02/2.20 % (20075)------------------------------
% 5.02/2.20 % (20075)------------------------------
% 5.02/2.22 % (20076)lrs+1010_1:128_av=off:cbe=off:cnfonf=lazy_simp:fsr=off:ntd=on:ss=axioms:st=1.5:i=44:si=on:rtra=on_0 on DTF2THF_19927 for (2995ds/44Mi)
% 5.02/2.22 % (20071)Instruction limit reached!
% 5.02/2.22 % (20071)------------------------------
% 5.02/2.22 % (20071)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 5.02/2.22 % (20071)Termination reason: Unknown
% 5.02/2.22 % (20071)Termination phase: Saturation
% 5.02/2.22
% 5.02/2.22 % (20071)Memory used [KB]: 6396
% 5.02/2.22 % (20071)Time elapsed: 0.093 s
% 5.02/2.22 % (20071)Instructions burned: 149 (million)
% 5.02/2.22 % (20071)------------------------------
% 5.02/2.22 % (20071)------------------------------
% 5.02/2.23 % Exception at run slice level
% 5.02/2.23 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 5.02/2.24 % (20077)dis+10_1:1_av=off:bd=off:cnfonf=lazy_gen:fe=off:hud=10:plsq=on:plsqc=1:plsqr=32,1:prag=on:tnu=1:i=432:si=on:rtra=on_0 on DTF2THF_19927 for (2995ds/432Mi)
% 5.02/2.24 % (20078)lrs+10_7:1_cnfonf=lazy_gen:fe=off:nwc=5.0:plsq=on:i=62:si=on:rtra=on_0 on DTF2THF_19927 for (2995ds/62Mi)
% 5.02/2.25 % Exception at run slice level
% 5.02/2.25 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 5.02/2.25 % Exception at run slice level
% 5.02/2.25 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 5.02/2.27 % (20080)dis+10_1:128_hud=1:i=96:si=on:rtra=on_0 on DTF2THF_19927 for (2995ds/96Mi)
% 5.02/2.27 % (20079)lrs+1010_1:16_add=large:amm=off:anc=all_dependent:chr=on:fd=off:ins=2:sp=const_max:tnu=5:uhcvi=on:i=31:si=on:rtra=on_0 on DTF2THF_19927 for (2995ds/31Mi)
% 5.02/2.29 % (20079)Instruction limit reached!
% 5.02/2.29 % (20079)------------------------------
% 5.02/2.29 % (20079)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 5.02/2.29 % (20079)Termination reason: Unknown
% 5.02/2.29 % (20079)Termination phase: Saturation
% 5.02/2.29
% 5.02/2.29 % (20079)Memory used [KB]: 5884
% 5.02/2.29 % (20079)Time elapsed: 0.021 s
% 5.02/2.29 % (20079)Instructions burned: 31 (million)
% 5.02/2.29 % (20079)------------------------------
% 5.02/2.29 % (20079)------------------------------
% 5.57/2.30 % (20047)Instruction limit reached!
% 5.57/2.30 % (20047)------------------------------
% 5.57/2.30 % (20047)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 5.57/2.30 % (20047)Termination reason: Unknown
% 5.57/2.30 % (20047)Termination phase: Saturation
% 5.57/2.30
% 5.57/2.30 % (20047)Memory used [KB]: 7291
% 5.57/2.30 % (20047)Time elapsed: 0.451 s
% 5.57/2.30 % (20047)Instructions burned: 710 (million)
% 5.57/2.30 % (20047)------------------------------
% 5.57/2.30 % (20047)------------------------------
% 5.57/2.31 % (20081)lrs+1002_1:4_au=on:cbe=off:cnfonf=lazy_pi_sigma_gen:hud=15:inj=on:nwc=4.0:s2a=on:sac=on:sp=reverse_arity:i=453:si=on:rtra=on_0 on DTF2THF_19927 for (2994ds/453Mi)
% 5.57/2.31 % Exception at run slice level
% 5.57/2.31 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 5.57/2.32 % (20082)lrs-1004_1:1_au=on:bsd=on:cbe=off:cnfonf=off:fe=axiom:fsd=on:i=71:si=on:rtra=on_0 on DTF2THF_19927 for (2994ds/71Mi)
% 5.57/2.33 % (20080)Instruction limit reached!
% 5.57/2.33 % (20080)------------------------------
% 5.57/2.33 % (20080)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 5.57/2.33 % (20080)Termination reason: Unknown
% 5.57/2.33 % (20080)Termination phase: Saturation
% 5.57/2.33
% 5.57/2.33 % (20080)Memory used [KB]: 6140
% 5.57/2.33 % (20080)Time elapsed: 0.084 s
% 5.57/2.33 % (20080)Instructions burned: 96 (million)
% 5.57/2.33 % (20080)------------------------------
% 5.57/2.33 % (20080)------------------------------
% 5.57/2.33 % (20083)dis+1002_1:1_bd=off:fsr=off:ntd=on:s2a=on:ss=axioms:i=83:si=on:rtra=on_0 on DTF2THF_19927 for (2994ds/83Mi)
% 5.57/2.33 % (20083)Refutation not found, incomplete strategy
% 5.57/2.33 % (20083)------------------------------
% 5.57/2.33 % (20083)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 5.57/2.33 % (20083)Termination reason: Refutation not found, incomplete strategy
% 5.57/2.33
% 5.57/2.33
% 5.57/2.33 % (20083)Memory used [KB]: 5628
% 5.57/2.33 % (20083)Time elapsed: 0.006 s
% 5.57/2.33 % (20083)Instructions burned: 5 (million)
% 5.57/2.33 % (20083)------------------------------
% 5.57/2.33 % (20083)------------------------------
% 5.57/2.35 % (20084)lrs+10_1:128_cnfonf=lazy_not_gen_be_off:hud=1:ins=1:i=11:si=on:rtra=on_0 on DTF2THF_19927 for (2994ds/11Mi)
% 5.57/2.35 % Exception at run slice level
% 5.57/2.35 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 5.57/2.36 % (20085)lrs+1010_1:1_au=on:cbe=off:cnfonf=lazy_not_gen_be_off:fsr=off:spb=non_intro:i=41:si=on:rtra=on_0 on DTF2THF_19927 for (2994ds/41Mi)
% 5.57/2.36 % Exception at run slice level
% 5.57/2.36 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 5.57/2.36 % (20082)Instruction limit reached!
% 5.57/2.36 % (20082)------------------------------
% 5.57/2.36 % (20082)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 5.57/2.36 % (20082)Termination reason: Unknown
% 5.57/2.36 % (20082)Termination phase: Saturation
% 5.57/2.36
% 5.57/2.36 % (20082)Memory used [KB]: 6012
% 5.57/2.36 % (20082)Time elapsed: 0.046 s
% 5.57/2.36 % (20082)Instructions burned: 71 (million)
% 5.57/2.36 % (20082)------------------------------
% 5.57/2.36 % (20082)------------------------------
% 5.57/2.37 % (20086)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on DTF2THF_19927 for (2994ds/6Mi)
% 5.57/2.37 % (20086)Instruction limit reached!
% 5.57/2.37 % (20086)------------------------------
% 5.57/2.37 % (20086)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 5.57/2.37 % (20086)Termination reason: Unknown
% 5.57/2.37 % (20086)Termination phase: Property scanning
% 5.57/2.37
% 5.57/2.37 % (20086)Memory used [KB]: 1151
% 5.57/2.37 % (20086)Time elapsed: 0.006 s
% 5.57/2.37 % (20086)Instructions burned: 6 (million)
% 5.57/2.37 % (20086)------------------------------
% 5.57/2.37 % (20086)------------------------------
% 5.57/2.38 % (20087)dis+10_1:1_avsq=on:cnfonf=off:e2e=on:nm=32:i=150:si=on:rtra=on_0 on DTF2THF_19927 for (2994ds/150Mi)
% 5.57/2.38 % (20088)ott+1010_1:1_au=on:s2a=on:sd=7:ss=axioms:st=1.5:i=343:si=on:rtra=on_0 on DTF2THF_19927 for (2994ds/343Mi)
% 5.57/2.39 % (20089)ott+1010_1:4_cbe=off:chr=on:hfsq=on:hfsqr=1,16:hud=3:sac=on:sp=unary_frequency:ss=axioms:st=5.0:tnu=2:i=109:si=on:rtra=on_0 on DTF2THF_19927 for (2994ds/109Mi)
% 6.03/2.42 % (20056)First to succeed.
% 6.03/2.42 % (20056)Refutation found. Thanks to Tanya!
% 6.03/2.42 % SZS status Theorem for DTF2THF_19927
% 6.03/2.42 % SZS output start Proof for DTF2THF_19927
% 6.03/2.42 thf(type_def_6, type, sK20: $tType).
% 6.03/2.42 thf(type_def_7, type, sK21: $tType).
% 6.03/2.42 thf(func_def_0, type, tyop_2Emin_2Ebool: $tType).
% 6.03/2.42 thf(func_def_1, type, tyop_2Emin_2Efun: ($tType * $tType) > $tType).
% 6.03/2.42 thf(func_def_2, type, c_2Ebool_2E_21: !>[X0: $tType]:((X0 > $o) > $o)).
% 6.03/2.42 thf(func_def_3, type, c_2Ebool_2E_2F_5C: $o > $o > $o).
% 6.03/2.42 thf(func_def_4, type, c_2Emin_2E_3D: !>[X0: $tType]:(X0 > X0 > $o)).
% 6.03/2.42 thf(func_def_5, type, c_2Emin_2E_3D_3D_3E: $o > $o > $o).
% 6.03/2.42 thf(func_def_6, type, c_2Ebool_2E_3F: !>[X0: $tType]:((X0 > $o) > $o)).
% 6.03/2.42 thf(func_def_8, type, c_2EquantHeuristics_2EGUESS__EXISTS: !>[X0: $tType, X1: $tType]:((X0 > X1) > (X1 > $o) > $o)).
% 6.03/2.42 thf(func_def_9, type, c_2EquantHeuristics_2EGUESS__EXISTS__GAP: !>[X0: $tType, X1: $tType]:((X0 > X1) > (X1 > $o) > $o)).
% 6.03/2.42 thf(func_def_10, type, c_2EquantHeuristics_2EGUESS__EXISTS__POINT: !>[X0: $tType, X1: $tType]:((X0 > X1) > (X1 > $o) > $o)).
% 6.03/2.42 thf(func_def_11, type, c_2EquantHeuristics_2EGUESS__FORALL: !>[X0: $tType, X1: $tType]:((X0 > X1) > (X1 > $o) > $o)).
% 6.03/2.42 thf(func_def_12, type, c_2EquantHeuristics_2EGUESS__FORALL__GAP: !>[X0: $tType, X1: $tType]:((X0 > X1) > (X1 > $o) > $o)).
% 6.03/2.42 thf(func_def_13, type, c_2EquantHeuristics_2EGUESS__FORALL__POINT: !>[X0: $tType, X1: $tType]:((X0 > X1) > (X1 > $o) > $o)).
% 6.03/2.42 thf(func_def_15, type, c_2Ebool_2E_5C_2F: $o > $o > $o).
% 6.03/2.42 thf(func_def_16, type, c_2Ebool_2E_7E: $o > $o).
% 6.03/2.42 thf(func_def_23, type, sP0: $o > $o > $o > $o).
% 6.03/2.42 thf(func_def_24, type, sP1: $o > $o > $o > $o).
% 6.03/2.42 thf(func_def_25, type, sP2: $o > $o > $o > $o).
% 6.03/2.42 thf(func_def_26, type, sP3: $o > $o > $o > $o).
% 6.03/2.42 thf(func_def_27, type, sP4: $o > $o > $o > $o).
% 6.03/2.42 thf(func_def_28, type, sP5: $o > $o > $o > $o).
% 6.03/2.42 thf(func_def_29, type, sP6: $o > $o > $o > $o).
% 6.03/2.42 thf(func_def_30, type, sP7: $o > $o > $o > $o).
% 6.03/2.42 thf(func_def_31, type, sK8: !>[X0: $tType]:((X0 > $o) > X0)).
% 6.03/2.42 thf(func_def_32, type, sK9: !>[X0: $tType, X1: $tType]:((X1 > $o) > (X0 > X1) > X0)).
% 6.03/2.42 thf(func_def_33, type, sK10: !>[X0: $tType, X1: $tType]:((X1 > $o) > (X0 > X1) > X1)).
% 6.03/2.42 thf(func_def_34, type, sK11: !>[X0: $tType, X1: $tType]:((X1 > $o) > (X0 > X1) > X0)).
% 6.03/2.42 thf(func_def_35, type, sK12: !>[X0: $tType, X1: $tType]:((X1 > $o) > (X0 > X1) > X1)).
% 6.03/2.42 thf(func_def_36, type, sK13: !>[X0: $tType, X1: $tType]:(X1 > (X0 > X1) > X0)).
% 6.03/2.42 thf(func_def_37, type, sK14: !>[X0: $tType, X1: $tType]:((X1 > $o) > (X0 > X1) > X1)).
% 6.03/2.42 thf(func_def_38, type, sK15: !>[X0: $tType, X1: $tType]:((X1 > $o) > (X0 > X1) > X0)).
% 6.03/2.42 thf(func_def_39, type, sK16: !>[X0: $tType, X1: $tType]:(X1 > (X0 > X1) > X0)).
% 6.03/2.42 thf(func_def_40, type, sK17: !>[X0: $tType, X1: $tType]:((X1 > $o) > (X0 > X1) > X1)).
% 6.03/2.42 thf(func_def_41, type, sK18: !>[X0: $tType, X1: $tType]:((X1 > $o) > (X0 > X1) > X0)).
% 6.03/2.42 thf(func_def_42, type, sK19: !>[X0: $tType]:((X0 > $o) > X0)).
% 6.03/2.42 thf(func_def_43, type, sK22: sK21 > sK20).
% 6.03/2.42 thf(func_def_44, type, sK23: sK20 > $o).
% 6.03/2.42 thf(func_def_45, type, sK24: sK20 > $o).
% 6.03/2.42 thf(func_def_47, type, ph26: !>[X0: $tType]:(X0)).
% 6.03/2.42 thf(f3444,plain,(
% 6.03/2.42 $false),
% 6.03/2.42 inference(avatar_sat_refutation,[status(thm)],[f638,f3443])).
% 6.03/2.42 thf(f3443,plain,(
% 6.03/2.42 ~spl25_1),
% 6.03/2.42 inference(avatar_contradiction_clause,[status(thm)],[f3442])).
% 6.03/2.42 thf(f3442,plain,(
% 6.03/2.42 $false | ~spl25_1),
% 6.03/2.42 inference(trivial_inequality_removal,[status(thm)],[f3441])).
% 6.03/2.42 thf(f3441,plain,(
% 6.03/2.42 ($true = $false) | ~spl25_1),
% 6.03/2.42 inference(forward_demodulation,[status(thm)],[f3435,f650])).
% 6.03/2.42 thf(f650,plain,(
% 6.03/2.42 ((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK24) = $false) | ~spl25_1),
% 6.03/2.42 inference(trivial_inequality_removal,[status(thm)],[f649])).
% 6.03/2.42 thf(f649,plain,(
% 6.03/2.42 ($true != $true) | ((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK24) = $false) | ~spl25_1),
% 6.03/2.42 inference(superposition,[status(thm)],[f243,f606])).
% 6.03/2.42 thf(f606,plain,(
% 6.03/2.42 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) ) | ~spl25_1),
% 6.03/2.42 inference(avatar_component_clause,[status(thm)],[f605])).
% 6.03/2.42 thf(f605,definition,(
% 6.03/2.42 spl25_1 <=> ! [X0 : $o] : (($true = X0) | ($false = X0))),
% 6.03/2.42 introduced(definition,[new_symbols(naming,[spl25_1])],[avatar_definition])).
% 6.03/2.42 thf(f243,plain,(
% 6.03/2.42 ((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK24) != $true)),
% 6.03/2.42 inference(cnf_transformation,[status(thm)],[f146])).
% 6.03/2.42 thf(f146,plain,(
% 6.03/2.42 ($true = (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK23)) & ! [X5 : sK20] : (($true != (sK24 @ X5)) | ($true = (sK23 @ X5))) & ((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK24) != $true)),
% 6.03/2.42 inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21,sK22,sK23,sK24])],[f93,f145])).
% 6.03/2.42 thf(f145,plain,(
% 6.03/2.42 ? [X0 : $tType,X1 : $tType,X2 : X1 > X0,X3 : X0 > $o,X4 : X0 > $o] : (((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X3) = $true) & ! [X5 : X0] : (((X4 @ X5) != $true) | ($true = (X3 @ X5))) & ($true != (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X4))) => (($true = (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK23)) & ! [X5 : sK20] : (($true != (sK24 @ X5)) | ($true = (sK23 @ X5))) & ((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK24) != $true))),
% 6.03/2.42 introduced(definition,[],[choice_axiom])).
% 6.03/2.42 thf(f93,plain,(
% 6.03/2.42 ? [X0 : $tType,X1 : $tType,X2 : X1 > X0,X3 : X0 > $o,X4 : X0 > $o] : (((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X3) = $true) & ! [X5 : X0] : (((X4 @ X5) != $true) | ($true = (X3 @ X5))) & ($true != (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X4)))),
% 6.03/2.42 inference(flattening,[status(thm)],[f92])).
% 6.03/2.42 thf(f92,plain,(
% 6.03/2.42 ? [X0 : $tType,X1 : $tType,X2 : X1 > X0,X3 : X0 > $o,X4 : X0 > $o] : ((($true != (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X4)) & ((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X3) = $true)) & ! [X5 : X0] : (((X4 @ X5) != $true) | ($true = (X3 @ X5))))),
% 6.03/2.42 inference(ennf_transformation,[status(thm)],[f61])).
% 6.03/2.42 thf(f61,plain,(
% 6.03/2.42 ~! [X0 : $tType,X1 : $tType,X2 : X1 > X0,X3 : X0 > $o,X4 : X0 > $o] : (! [X5 : X0] : (((X4 @ X5) = $true) => ($true = (X3 @ X5))) => (((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X3) = $true) => ($true = (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X4))))),
% 6.03/2.42 inference(fool_elimination,[status(thm)],[f60])).
% 6.03/2.42 thf(f60,plain,(
% 6.03/2.42 ~! [X0 : $tType,X1 : $tType,X2 : X1 > X0,X3 : X0 > $o,X4 : X0 > $o] : (! [X5 : X0] : ((X4 @ X5) => (X3 @ X5)) => ((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X3) => (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X2 @ X4)))),
% 6.03/2.42 inference(rectify,[status(thm)],[f28])).
% 6.03/2.42 thf(f28,negated_conjecture,(
% 6.03/2.42 ~! [X0 : $tType,X1 : $tType,X15 : X1 > X0,X16 : X0 > $o,X43 : X0 > $o] : (! [X44 : X0] : ((X43 @ X44) => (X16 @ X44)) => ((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X15 @ X16) => (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X15 @ X43)))),
% 6.03/2.42 inference(negated_conjecture,[status(cth)],[f27])).
% 6.03/2.42 thf(f27,conjecture,(
% 6.03/2.42 ! [X0 : $tType,X1 : $tType,X15 : X1 > X0,X16 : X0 > $o,X43 : X0 > $o] : (! [X44 : X0] : ((X43 @ X44) => (X16 @ X44)) => ((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X15 @ X16) => (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X0 @ X15 @ X43)))),
% 6.03/2.42 file('/export/starexec/sandbox2/tmp/tmp.zumrShj9Js/DTF2THF_19927.p',thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT)).
% 6.03/2.42 thf(f3435,plain,(
% 6.03/2.42 ((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK24) = $true) | ~spl25_1),
% 6.03/2.42 inference(trivial_inequality_removal,[status(thm)],[f3429])).
% 6.03/2.42 thf(f3429,plain,(
% 6.03/2.42 ($true = $false) | ((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK24) = $true) | ~spl25_1),
% 6.03/2.42 inference(superposition,[status(thm)],[f2379,f578])).
% 6.03/2.42 thf(f578,plain,(
% 6.03/2.42 ( ! [X1 : $tType,X0 : $tType,X28 : X0 > X1,X29 : X1 > $o] : (($true = (X29 @ (X28 @ (sK18 @ X0 @ X1 @ X29 @ X28)))) | ($true = (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29))) )),
% 6.03/2.42 inference(not_proxy_clausification,[status(thm)],[f224])).
% 6.03/2.42 thf(f224,plain,(
% 6.03/2.42 ( ! [X1 : $tType,X0 : $tType,X28 : X0 > X1,X29 : X1 > $o] : (($true = (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29)) | ($true != (~ (X29 @ (X28 @ (sK18 @ X0 @ X1 @ X29 @ X28)))))) )),
% 6.03/2.42 inference(cnf_transformation,[status(thm)],[f140])).
% 6.03/2.42 thf(f140,plain,(
% 6.03/2.42 ! [X0 : $tType,X1 : $tType,X2 : X0 > X1,X3 : X1 > $o] : ((! [X4 : X1] : (($true = (X3 @ (X2 @ (sK9 @ X0 @ X1 @ X3 @ X2)))) | ($true != (X3 @ X4))) | ((c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3) != $true)) & (((c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3) = $true) | (! [X7 : X0] : ((X3 @ (X2 @ X7)) != $true) & ($true = (X3 @ (sK10 @ X0 @ X1 @ X3 @ X2))))) & (! [X8 : X1] : (($true != (~ (X3 @ X8))) | ($true = (~ (X3 @ (X2 @ (sK11 @ X0 @ X1 @ X3 @ X2)))))) | ($true != (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3))) & (($true = (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3)) | (((~ (X3 @ (sK12 @ X0 @ X1 @ X3 @ X2))) = $true) & ! [X11 : X0] : ((~ (X3 @ (X2 @ X11))) != $true))) & ! [X12 : X0 > X1,X13 : X1 > $o] : ((! [X14 : X1] : (((~ (X13 @ X14)) != $true) | ((X12 @ (sK13 @ X0 @ X1 @ X14 @ X12)) = X14)) | ($true != (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X12 @ X13))) & (($true = (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X12 @ X13)) | (($true = (~ (X13 @ (sK14 @ X0 @ X1 @ X13 @ X12)))) & ! [X17 : X0] : ((X12 @ X17) != (sK14 @ X0 @ X1 @ X13 @ X12))))) & ! [X18 : X0 > X1,X19 : X1 > $o] : ((! [X20 : X0] : ($true = (X19 @ (X18 @ X20))) | ($true != (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X18 @ X19))) & (($true = (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X18 @ X19)) | ($true != (X19 @ (X18 @ (sK15 @ X0 @ X1 @ X19 @ X18)))))) & ! [X22 : X0 > X1,X23 : X1 > $o] : ((! [X24 : X1] : (((X23 @ X24) != $true) | ((X22 @ (sK16 @ X0 @ X1 @ X24 @ X22)) = X24)) | ($true != (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X22 @ X23))) & (($true = (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X22 @ X23)) | (((X23 @ (sK17 @ X0 @ X1 @ X23 @ X22)) = $true) & ! [X27 : X0] : ((X22 @ X27) != (sK17 @ X0 @ X1 @ X23 @ X22))))) & ! [X28 : X0 > X1,X29 : X1 > $o] : ((! [X30 : X0] : ((~ (X29 @ (X28 @ X30))) = $true) | ($true != (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29))) & (($true = (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29)) | ($true != (~ (X29 @ (X28 @ (sK18 @ X0 @ X1 @ X29 @ X28))))))))),
% 6.03/2.42 inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12,sK13,sK14,sK15,sK16,sK17,sK18])],[f129,f139,f138,f137,f136,f135,f134,f133,f132,f131,f130])).
% 6.03/2.42 thf(f130,plain,(
% 6.03/2.42 ! [X1 : $tType,X0 : $tType,X2 : X0 > X1,X3 : X1 > $o] : (? [X5 : X0] : ($true = (X3 @ (X2 @ X5))) => ($true = (X3 @ (X2 @ (sK9 @ X0 @ X1 @ X3 @ X2)))))),
% 6.03/2.42 introduced(definition,[],[choice_axiom])).
% 6.03/2.42 thf(f131,plain,(
% 6.03/2.42 ! [X1 : $tType,X0 : $tType,X2 : X0 > X1,X3 : X1 > $o] : (? [X6 : X1] : (! [X7 : X0] : ((X3 @ (X2 @ X7)) != $true) & ($true = (X3 @ X6))) => (! [X7 : X0] : ((X3 @ (X2 @ X7)) != $true) & ($true = (X3 @ (sK10 @ X0 @ X1 @ X3 @ X2)))))),
% 6.03/2.42 introduced(definition,[],[choice_axiom])).
% 6.03/2.42 thf(f132,plain,(
% 6.03/2.42 ! [X1 : $tType,X0 : $tType,X2 : X0 > X1,X3 : X1 > $o] : (? [X9 : X0] : ($true = (~ (X3 @ (X2 @ X9)))) => ($true = (~ (X3 @ (X2 @ (sK11 @ X0 @ X1 @ X3 @ X2))))))),
% 6.03/2.42 introduced(definition,[],[choice_axiom])).
% 6.03/2.42 thf(f133,plain,(
% 6.03/2.42 ! [X1 : $tType,X0 : $tType,X2 : X0 > X1,X3 : X1 > $o] : (? [X10 : X1] : (($true = (~ (X3 @ X10))) & ! [X11 : X0] : ((~ (X3 @ (X2 @ X11))) != $true)) => (((~ (X3 @ (sK12 @ X0 @ X1 @ X3 @ X2))) = $true) & ! [X11 : X0] : ((~ (X3 @ (X2 @ X11))) != $true)))),
% 6.03/2.42 introduced(definition,[],[choice_axiom])).
% 6.03/2.42 thf(f134,plain,(
% 6.03/2.42 ! [X1 : $tType,X0 : $tType,X12 : X0 > X1,X14 : X1] : (? [X15 : X0] : ((X12 @ X15) = X14) => ((X12 @ (sK13 @ X0 @ X1 @ X14 @ X12)) = X14))),
% 6.03/2.42 introduced(definition,[],[choice_axiom])).
% 6.03/2.42 thf(f135,plain,(
% 6.03/2.42 ! [X1 : $tType,X0 : $tType,X12 : X0 > X1,X13 : X1 > $o] : (? [X16 : X1] : (($true = (~ (X13 @ X16))) & ! [X17 : X0] : ((X12 @ X17) != X16)) => (($true = (~ (X13 @ (sK14 @ X0 @ X1 @ X13 @ X12)))) & ! [X17 : X0] : ((X12 @ X17) != (sK14 @ X0 @ X1 @ X13 @ X12))))),
% 6.03/2.42 introduced(definition,[],[choice_axiom])).
% 6.03/2.42 thf(f136,plain,(
% 6.03/2.42 ! [X1 : $tType,X0 : $tType,X18 : X0 > X1,X19 : X1 > $o] : (? [X21 : X0] : ($true != (X19 @ (X18 @ X21))) => ($true != (X19 @ (X18 @ (sK15 @ X0 @ X1 @ X19 @ X18)))))),
% 6.03/2.42 introduced(definition,[],[choice_axiom])).
% 6.03/2.42 thf(f137,plain,(
% 6.03/2.42 ! [X1 : $tType,X0 : $tType,X22 : X0 > X1,X24 : X1] : (? [X25 : X0] : ((X22 @ X25) = X24) => ((X22 @ (sK16 @ X0 @ X1 @ X24 @ X22)) = X24))),
% 6.03/2.42 introduced(definition,[],[choice_axiom])).
% 6.03/2.42 thf(f138,plain,(
% 6.03/2.42 ! [X1 : $tType,X0 : $tType,X22 : X0 > X1,X23 : X1 > $o] : (? [X26 : X1] : (($true = (X23 @ X26)) & ! [X27 : X0] : ((X22 @ X27) != X26)) => (((X23 @ (sK17 @ X0 @ X1 @ X23 @ X22)) = $true) & ! [X27 : X0] : ((X22 @ X27) != (sK17 @ X0 @ X1 @ X23 @ X22))))),
% 6.03/2.42 introduced(definition,[],[choice_axiom])).
% 6.03/2.42 thf(f139,plain,(
% 6.03/2.42 ! [X1 : $tType,X0 : $tType,X28 : X0 > X1,X29 : X1 > $o] : (? [X31 : X0] : ($true != (~ (X29 @ (X28 @ X31)))) => ($true != (~ (X29 @ (X28 @ (sK18 @ X0 @ X1 @ X29 @ X28))))))),
% 6.03/2.42 introduced(definition,[],[choice_axiom])).
% 6.03/2.42 thf(f129,plain,(
% 6.03/2.42 ! [X0 : $tType,X1 : $tType,X2 : X0 > X1,X3 : X1 > $o] : ((! [X4 : X1] : (? [X5 : X0] : ($true = (X3 @ (X2 @ X5))) | ($true != (X3 @ X4))) | ((c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3) != $true)) & (((c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3) = $true) | ? [X6 : X1] : (! [X7 : X0] : ((X3 @ (X2 @ X7)) != $true) & ($true = (X3 @ X6)))) & (! [X8 : X1] : (($true != (~ (X3 @ X8))) | ? [X9 : X0] : ($true = (~ (X3 @ (X2 @ X9))))) | ($true != (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3))) & (($true = (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3)) | ? [X10 : X1] : (($true = (~ (X3 @ X10))) & ! [X11 : X0] : ((~ (X3 @ (X2 @ X11))) != $true))) & ! [X12 : X0 > X1,X13 : X1 > $o] : ((! [X14 : X1] : (((~ (X13 @ X14)) != $true) | ? [X15 : X0] : ((X12 @ X15) = X14)) | ($true != (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X12 @ X13))) & (($true = (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X12 @ X13)) | ? [X16 : X1] : (($true = (~ (X13 @ X16))) & ! [X17 : X0] : ((X12 @ X17) != X16)))) & ! [X18 : X0 > X1,X19 : X1 > $o] : ((! [X20 : X0] : ($true = (X19 @ (X18 @ X20))) | ($true != (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X18 @ X19))) & (($true = (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X18 @ X19)) | ? [X21 : X0] : ($true != (X19 @ (X18 @ X21))))) & ! [X22 : X0 > X1,X23 : X1 > $o] : ((! [X24 : X1] : (((X23 @ X24) != $true) | ? [X25 : X0] : ((X22 @ X25) = X24)) | ($true != (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X22 @ X23))) & (($true = (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X22 @ X23)) | ? [X26 : X1] : (($true = (X23 @ X26)) & ! [X27 : X0] : ((X22 @ X27) != X26)))) & ! [X28 : X0 > X1,X29 : X1 > $o] : ((! [X30 : X0] : ((~ (X29 @ (X28 @ X30))) = $true) | ($true != (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29))) & (($true = (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29)) | ? [X31 : X0] : ($true != (~ (X29 @ (X28 @ X31)))))))),
% 6.03/2.42 inference(rectify,[status(thm)],[f128])).
% 6.03/2.42 thf(f128,plain,(
% 6.03/2.42 ! [X0 : $tType,X1 : $tType,X2 : X0 > X1,X3 : X1 > $o] : ((! [X10 : X1] : (? [X11 : X0] : ($true = (X3 @ (X2 @ X11))) | ($true != (X3 @ X10))) | ((c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3) != $true)) & (((c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3) = $true) | ? [X10 : X1] : (! [X11 : X0] : ($true != (X3 @ (X2 @ X11))) & ($true = (X3 @ X10)))) & (! [X8 : X1] : (($true != (~ (X3 @ X8))) | ? [X9 : X0] : ($true = (~ (X3 @ (X2 @ X9))))) | ($true != (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3))) & (($true = (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3)) | ? [X8 : X1] : (($true = (~ (X3 @ X8))) & ! [X9 : X0] : ($true != (~ (X3 @ (X2 @ X9)))))) & ! [X4 : X0 > X1,X5 : X1 > $o] : ((! [X6 : X1] : (($true != (~ (X5 @ X6))) | ? [X7 : X0] : ((X4 @ X7) = X6)) | ($true != (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X4 @ X5))) & (($true = (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X4 @ X5)) | ? [X6 : X1] : (($true = (~ (X5 @ X6))) & ! [X7 : X0] : ((X4 @ X7) != X6)))) & ! [X15 : X0 > X1,X16 : X1 > $o] : ((! [X17 : X0] : ((X16 @ (X15 @ X17)) = $true) | ((c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X15 @ X16) != $true)) & (((c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X15 @ X16) = $true) | ? [X17 : X0] : ((X16 @ (X15 @ X17)) != $true))) & ! [X18 : X0 > X1,X19 : X1 > $o] : ((! [X20 : X1] : (($true != (X19 @ X20)) | ? [X21 : X0] : ((X18 @ X21) = X20)) | ($true != (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X18 @ X19))) & (($true = (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X18 @ X19)) | ? [X20 : X1] : (($true = (X19 @ X20)) & ! [X21 : X0] : ((X18 @ X21) != X20)))) & ! [X12 : X0 > X1,X13 : X1 > $o] : ((! [X14 : X0] : ($true = (~ (X13 @ (X12 @ X14)))) | ($true != (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X12 @ X13))) & (($true = (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X12 @ X13)) | ? [X14 : X0] : ($true != (~ (X13 @ (X12 @ X14)))))))),
% 6.03/2.42 inference(flattening,[status(thm)],[f127])).
% 6.03/2.42 thf(f127,plain,(
% 6.03/2.42 ! [X0 : $tType,X1 : $tType,X2 : X0 > X1,X3 : X1 > $o] : (((! [X10 : X1] : (? [X11 : X0] : ($true = (X3 @ (X2 @ X11))) | ($true != (X3 @ X10))) | ((c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3) != $true)) & (((c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3) = $true) | ? [X10 : X1] : (! [X11 : X0] : ($true != (X3 @ (X2 @ X11))) & ($true = (X3 @ X10))))) & ((! [X8 : X1] : (($true != (~ (X3 @ X8))) | ? [X9 : X0] : ($true = (~ (X3 @ (X2 @ X9))))) | ($true != (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3))) & (($true = (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3)) | ? [X8 : X1] : (($true = (~ (X3 @ X8))) & ! [X9 : X0] : ($true != (~ (X3 @ (X2 @ X9))))))) & ! [X4 : X0 > X1,X5 : X1 > $o] : ((! [X6 : X1] : (($true != (~ (X5 @ X6))) | ? [X7 : X0] : ((X4 @ X7) = X6)) | ($true != (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X4 @ X5))) & (($true = (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X4 @ X5)) | ? [X6 : X1] : (($true = (~ (X5 @ X6))) & ! [X7 : X0] : ((X4 @ X7) != X6)))) & ! [X15 : X0 > X1,X16 : X1 > $o] : ((! [X17 : X0] : ((X16 @ (X15 @ X17)) = $true) | ((c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X15 @ X16) != $true)) & (((c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X15 @ X16) = $true) | ? [X17 : X0] : ((X16 @ (X15 @ X17)) != $true))) & ! [X18 : X0 > X1,X19 : X1 > $o] : ((! [X20 : X1] : (($true != (X19 @ X20)) | ? [X21 : X0] : ((X18 @ X21) = X20)) | ($true != (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X18 @ X19))) & (($true = (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X18 @ X19)) | ? [X20 : X1] : (($true = (X19 @ X20)) & ! [X21 : X0] : ((X18 @ X21) != X20)))) & ! [X12 : X0 > X1,X13 : X1 > $o] : ((! [X14 : X0] : ($true = (~ (X13 @ (X12 @ X14)))) | ($true != (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X12 @ X13))) & (($true = (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X12 @ X13)) | ? [X14 : X0] : ($true != (~ (X13 @ (X12 @ X14)))))))),
% 6.03/2.42 inference(nnf_transformation,[status(thm)],[f83])).
% 6.03/2.42 thf(f83,plain,(
% 6.03/2.42 ! [X0 : $tType,X1 : $tType,X2 : X0 > X1,X3 : X1 > $o] : ((! [X10 : X1] : (? [X11 : X0] : ($true = (X3 @ (X2 @ X11))) | ($true != (X3 @ X10))) <=> ((c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3) = $true)) & (! [X8 : X1] : (($true != (~ (X3 @ X8))) | ? [X9 : X0] : ($true = (~ (X3 @ (X2 @ X9))))) <=> ($true = (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3))) & ! [X4 : X0 > X1,X5 : X1 > $o] : (! [X6 : X1] : (($true != (~ (X5 @ X6))) | ? [X7 : X0] : ((X4 @ X7) = X6)) <=> ($true = (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X4 @ X5))) & ! [X15 : X0 > X1,X16 : X1 > $o] : (! [X17 : X0] : ((X16 @ (X15 @ X17)) = $true) <=> ((c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X15 @ X16) = $true)) & ! [X18 : X0 > X1,X19 : X1 > $o] : (! [X20 : X1] : (($true != (X19 @ X20)) | ? [X21 : X0] : ((X18 @ X21) = X20)) <=> ($true = (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X18 @ X19))) & ! [X12 : X0 > X1,X13 : X1 > $o] : (! [X14 : X0] : ($true = (~ (X13 @ (X12 @ X14)))) <=> ($true = (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X12 @ X13))))),
% 6.03/2.42 inference(ennf_transformation,[status(thm)],[f53])).
% 6.03/2.42 thf(f53,plain,(
% 6.03/2.42 ! [X0 : $tType,X1 : $tType,X2 : X0 > X1,X3 : X1 > $o] : (! [X4 : X0 > X1,X5 : X1 > $o] : (($true = (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X4 @ X5)) <=> ! [X6 : X1] : (($true = (~ (X5 @ X6))) => ? [X7 : X0] : ((X4 @ X7) = X6))) & ! [X12 : X0 > X1,X13 : X1 > $o] : (! [X14 : X0] : ($true = (~ (X13 @ (X12 @ X14)))) <=> ($true = (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X12 @ X13))) & ! [X15 : X0 > X1,X16 : X1 > $o] : (! [X17 : X0] : ((X16 @ (X15 @ X17)) = $true) <=> ((c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X15 @ X16) = $true)) & ! [X18 : X0 > X1,X19 : X1 > $o] : (! [X20 : X1] : (($true = (X19 @ X20)) => ? [X21 : X0] : ((X18 @ X21) = X20)) <=> ($true = (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X18 @ X19))) & (($true = (c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3)) <=> ! [X8 : X1] : (($true = (~ (X3 @ X8))) => ? [X9 : X0] : ($true = (~ (X3 @ (X2 @ X9)))))) & (((c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3) = $true) <=> ! [X10 : X1] : (($true = (X3 @ X10)) => ? [X11 : X0] : ($true = (X3 @ (X2 @ X11))))))),
% 6.03/2.42 inference(fool_elimination,[status(thm)],[f52])).
% 6.03/2.42 thf(f52,plain,(
% 6.03/2.42 ! [X0 : $tType,X1 : $tType,X2 : X0 > X1,X3 : X1 > $o] : (! [X4 : X0 > X1,X5 : X1 > $o] : ((c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X4 @ X5) <=> ! [X6 : X1] : ((~ (X5 @ X6)) => ? [X7 : X0] : ((X4 @ X7) = X6))) & ((c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X2 @ X3) <=> ! [X8 : X1] : ((~ (X3 @ X8)) => ? [X9 : X0] : (~ (X3 @ (X2 @ X9))))) & ((c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X2 @ X3) <=> ! [X10 : X1] : ((X3 @ X10) => ? [X11 : X0] : (X3 @ (X2 @ X11)))) & ! [X12 : X0 > X1,X13 : X1 > $o] : ((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X12 @ X13) <=> ! [X14 : X0] : (~ (X13 @ (X12 @ X14)))) & ! [X15 : X0 > X1,X16 : X1 > $o] : ((c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X15 @ X16) <=> ! [X17 : X0] : (X16 @ (X15 @ X17))) & ! [X18 : X0 > X1,X19 : X1 > $o] : ((c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X18 @ X19) <=> ! [X20 : X1] : ((X19 @ X20) => ? [X21 : X0] : ((X18 @ X21) = X20))))),
% 6.03/2.42 inference(rectify,[status(thm)],[f15])).
% 6.03/2.42 thf(f15,axiom,(
% 6.03/2.42 ! [X0 : $tType,X1 : $tType,X15 : X0 > X1,X16 : X1 > $o] : (! [X31 : X0 > X1,X32 : X1 > $o] : ((c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X0 @ X1 @ X31 @ X32) <=> ! [X33 : X1] : ((~ (X32 @ X33)) => ? [X34 : X0] : ((X31 @ X34) = X33))) & ((c_2EquantHeuristics_2EGUESS__FORALL @ X0 @ X1 @ X15 @ X16) <=> ! [X19 : X1] : ((~ (X16 @ X19)) => ? [X20 : X0] : (~ (X16 @ (X15 @ X20))))) & ((c_2EquantHeuristics_2EGUESS__EXISTS @ X0 @ X1 @ X15 @ X16) <=> ! [X17 : X1] : ((X16 @ X17) => ? [X18 : X0] : (X16 @ (X15 @ X18)))) & ! [X24 : X0 > X1,X25 : X1 > $o] : ((c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X24 @ X25) <=> ! [X26 : X0] : (~ (X25 @ (X24 @ X26)))) & ! [X21 : X0 > X1,X22 : X1 > $o] : ((c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X0 @ X1 @ X21 @ X22) <=> ! [X23 : X0] : (X22 @ (X21 @ X23))) & ! [X27 : X0 > X1,X28 : X1 > $o] : ((c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X0 @ X1 @ X27 @ X28) <=> ! [X29 : X1] : ((X28 @ X29) => ? [X30 : X0] : ((X27 @ X30) = X29))))),
% 6.03/2.42 file('/export/starexec/sandbox2/tmp/tmp.zumrShj9Js/DTF2THF_19927.p',thm_2EquantHeuristics_2EGUESS__REWRITES)).
% 6.03/2.42 thf(f2379,plain,(
% 6.03/2.42 ( ! [X0 : sK21] : (((sK24 @ (sK22 @ X0)) = $false)) ) | ~spl25_1),
% 6.03/2.42 inference(trivial_inequality_removal,[status(thm)],[f2369])).
% 6.03/2.42 thf(f2369,plain,(
% 6.03/2.42 ( ! [X0 : sK21] : (((sK24 @ (sK22 @ X0)) = $false) | ($true = $false)) ) | ~spl25_1),
% 6.03/2.42 inference(superposition,[status(thm)],[f644,f2308])).
% 6.03/2.42 thf(f2308,plain,(
% 6.03/2.42 ( ! [X0 : sK21] : (((sK23 @ (sK22 @ X0)) = $false)) )),
% 6.03/2.42 inference(trivial_inequality_removal,[status(thm)],[f2304])).
% 6.03/2.42 thf(f2304,plain,(
% 6.03/2.42 ( ! [X0 : sK21] : (($true != $true) | ((sK23 @ (sK22 @ X0)) = $false)) )),
% 6.03/2.42 inference(superposition,[status(thm)],[f528,f245])).
% 6.03/2.42 thf(f245,plain,(
% 6.03/2.42 ($true = (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ sK21 @ sK20 @ sK22 @ sK23))),
% 6.03/2.42 inference(cnf_transformation,[status(thm)],[f146])).
% 6.03/2.42 thf(f528,plain,(
% 6.03/2.42 ( ! [X1 : $tType,X0 : $tType,X28 : X0 > X1,X29 : X1 > $o,X30 : X0] : (($true != (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29)) | ((X29 @ (X28 @ X30)) = $false)) )),
% 6.03/2.42 inference(not_proxy_clausification,[status(thm)],[f225])).
% 6.03/2.42 thf(f225,plain,(
% 6.03/2.42 ( ! [X1 : $tType,X0 : $tType,X28 : X0 > X1,X29 : X1 > $o,X30 : X0] : (($true != (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X0 @ X1 @ X28 @ X29)) | ((~ (X29 @ (X28 @ X30))) = $true)) )),
% 6.03/2.42 inference(cnf_transformation,[status(thm)],[f140])).
% 6.03/2.42 thf(f644,plain,(
% 6.03/2.42 ( ! [X0 : sK20] : (($true = (sK23 @ X0)) | ((sK24 @ X0) = $false)) ) | ~spl25_1),
% 6.03/2.42 inference(trivial_inequality_removal,[status(thm)],[f642])).
% 6.03/2.42 thf(f642,plain,(
% 6.03/2.42 ( ! [X0 : sK20] : (((sK24 @ X0) = $false) | ($true != $true) | ($true = (sK23 @ X0))) ) | ~spl25_1),
% 6.03/2.42 inference(superposition,[status(thm)],[f244,f606])).
% 6.03/2.42 thf(f244,plain,(
% 6.03/2.42 ( ! [X5 : sK20] : (($true != (sK24 @ X5)) | ($true = (sK23 @ X5))) )),
% 6.03/2.42 inference(cnf_transformation,[status(thm)],[f146])).
% 6.03/2.42 thf(f638,plain,(
% 6.03/2.42 spl25_1),
% 6.03/2.42 inference(avatar_split_clause,[status(thm)],[f498,f605])).
% 6.03/2.42 thf(f498,plain,(
% 6.03/2.42 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 6.03/2.42 inference(not_proxy_clausification,[status(thm)],[f421])).
% 6.03/2.42 thf(f421,plain,(
% 6.03/2.42 ( ! [X0 : $o] : (($true = X0) | ($true = (~ X0))) )),
% 6.03/2.42 inference(equality_resolution,[status(thm)],[f255])).
% 6.03/2.42 thf(f255,plain,(
% 6.03/2.42 ( ! [X0 : $o,X1 : $o] : (($true = X0) | ($true = X1) | ((~ X0) != X1)) )),
% 6.03/2.42 inference(cnf_transformation,[status(thm)],[f152])).
% 6.03/2.42 thf(f152,plain,(
% 6.03/2.42 ! [X0 : $o,X1 : $o] : ((((~ X0) = X1) | (($true != X0) & ($true != X1)) | (($true != (~ X1)) & ($true != (~ X0)))) & (((($true = X0) | ($true = X1)) & (($true = (~ X1)) | ($true = (~ X0)))) | ((~ X0) != X1)))),
% 6.03/2.42 inference(flattening,[status(thm)],[f151])).
% 6.03/2.42 thf(f151,plain,(
% 6.03/2.42 ! [X0 : $o,X1 : $o] : ((((~ X0) = X1) | ((($true != X0) & ($true != X1)) | (($true != (~ X1)) & ($true != (~ X0))))) & (((($true = X0) | ($true = X1)) & (($true = (~ X1)) | ($true = (~ X0)))) | ((~ X0) != X1)))),
% 6.03/2.42 inference(nnf_transformation,[status(thm)],[f73])).
% 6.03/2.42 thf(f73,plain,(
% 6.03/2.42 ! [X0 : $o,X1 : $o] : (((~ X0) = X1) <=> ((($true = X0) | ($true = X1)) & (($true = (~ X1)) | ($true = (~ X0)))))),
% 6.03/2.42 inference(fool_elimination,[status(thm)],[f72])).
% 6.03/2.42 thf(f72,plain,(
% 6.03/2.42 ! [X0 : $o,X1 : $o] : (((~ X0) <=> X1) <=> (((~ X1) | (~ X0)) & (X0 | X1)))),
% 6.03/2.42 inference(rectify,[status(thm)],[f24])).
% 6.03/2.42 thf(f24,axiom,(
% 6.03/2.42 ! [X41 : $o,X42 : $o] : (((~ X41) <=> X42) <=> (((~ X42) | (~ X41)) & (X41 | X42)))),
% 6.03/2.42 file('/export/starexec/sandbox2/tmp/tmp.zumrShj9Js/DTF2THF_19927.p',thm_2Esat_2Edc__neg)).
% 6.03/2.42 % SZS output end Proof for DTF2THF_19927
% 6.03/2.42 % (20056)------------------------------
% 6.03/2.42 % (20056)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 6.03/2.42 % (20056)Termination reason: Refutation
% 6.03/2.42
% 6.03/2.42 % (20056)Memory used [KB]: 8059
% 6.03/2.42 % (20056)Time elapsed: 0.527 s
% 6.03/2.42 % (20056)Instructions burned: 801 (million)
% 6.03/2.42 % (20056)------------------------------
% 6.03/2.42 % (20056)------------------------------
% 6.03/2.42 % (20026)Success in time 0.642 s
%------------------------------------------------------------------------------