↑ Up

DT2H2X---1.9.5.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : DT2H2X---1.9.5
% Problem  : NUM757^1 : TPTP v9.2.1. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n001.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 09:24:35 AM UTC 2026

% Result   : Theorem 1.72s 1.46s
% Output   : Refutation 1.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   49 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :  302 (  90 equ;   0 cnn)
%            Maximal formula atoms :    6 (   6 avg)
%            Number of connectives :  464 (  83   ~;  33   |;   6   &; 308   @)
%                                         (   0 <=>;  34  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   77 (   0   ^;  77   !;   0   ?;  77   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    frac: $tType ).

thf(func_def_0,type,
    frac: $tType ).

thf(func_def_1,type,
    x: frac ).

thf(func_def_2,type,
    y: frac ).

thf(func_def_3,type,
    z: frac ).

thf(func_def_4,type,
    lessf: frac > frac > $o ).

thf(func_def_5,type,
    pf: frac > frac > frac ).

thf(func_def_7,type,
    moref: frac > frac > $o ).

thf(func_def_8,type,
    eq: frac > frac > $o ).

thf(f66,plain,
    $false,
    inference(subsumption_resolution,[status(thm)],[f65,f61]) ).

thf(f61,plain,
    ( ( moref @ x @ y )
    = $true ),
    inference(subsumption_resolution,[status(thm)],[f60,f37]) ).

thf(f37,plain,
    ( ( lessf @ x @ y )
   != $true ),
    inference(cnf_transformation,[status(thm)],[f25]) ).

thf(f25,plain,
    ( ( lessf @ x @ y )
   != $true ),
    inference(flattening,[status(thm)],[f13]) ).

thf(f13,plain,
    ( ( lessf @ x @ y )
   != $true ),
    inference(fool_elimination,[status(thm)],[f12]) ).

thf(f12,plain,
    ~ ( lessf @ x @ y ),
    inference(rectify,[status(thm)],[f8]) ).

thf(f8,negated_conjecture,
    ~ ( lessf @ x @ y ),
    inference(negated_conjecture,[status(cth)],[f7]) ).

thf(f7,conjecture,
    lessf @ x @ y,
    file('/export/starexec/sandbox/tmp/tmp.GnJ8VRyHmp/DTF2THF_15273.p',satz63c) ).

thf(f60,plain,
    ( ( ( moref @ x @ y )
      = $true )
    | ( ( lessf @ x @ y )
      = $true ) ),
    inference(trivial_inequality_removal,[status(thm)],[f59]) ).

thf(f59,plain,
    ( ( ( moref @ x @ y )
      = $true )
    | ( ( lessf @ x @ y )
      = $true )
    | ( $true != $true ) ),
    inference(superposition,[status(thm)],[f58,f40]) ).

thf(f40,plain,
    ! [X0: frac,X1: frac] :
      ( ( ( eq @ X1 @ X0 )
        = $true )
      | ( ( moref @ X1 @ X0 )
        = $true )
      | ( ( lessf @ X1 @ X0 )
        = $true ) ),
    inference(cnf_transformation,[status(thm)],[f33]) ).

thf(f33,plain,
    ! [X0: frac,X1: frac] :
      ( ( ( lessf @ X1 @ X0 )
        = $true )
      | ( ( eq @ X1 @ X0 )
        = $true )
      | ( ( moref @ X1 @ X0 )
        = $true ) ),
    inference(flattening,[status(thm)],[f32]) ).

thf(f32,plain,
    ! [X1: frac,X0: frac] :
      ( ( ( lessf @ X1 @ X0 )
        = $true )
      | ( ( moref @ X1 @ X0 )
        = $true )
      | ( ( eq @ X1 @ X0 )
        = $true ) ),
    inference(ennf_transformation,[status(thm)],[f27]) ).

thf(f27,plain,
    ! [X1: frac,X0: frac] :
      ( ( ( eq @ X1 @ X0 )
       != $true )
     => ( ( ( moref @ X1 @ X0 )
         != $true )
       => ( ( lessf @ X1 @ X0 )
          = $true ) ) ),
    inference(flattening,[status(thm)],[f21]) ).

thf(f21,plain,
    ! [X0: frac,X1: frac] :
      ( ( ( eq @ X1 @ X0 )
       != $true )
     => ( ( ( moref @ X1 @ X0 )
         != $true )
       => ( ( lessf @ X1 @ X0 )
          = $true ) ) ),
    inference(fool_elimination,[status(thm)],[f20]) ).

thf(f20,plain,
    ! [X0: frac,X1: frac] :
      ( ~ ( eq @ X1 @ X0 )
     => ( ~ ( moref @ X1 @ X0 )
       => ( lessf @ X1 @ X0 ) ) ),
    inference(rectify,[status(thm)],[f6]) ).

thf(f6,axiom,
    ! [X2: frac,X1: frac] :
      ( ~ ( eq @ X1 @ X2 )
     => ( ~ ( moref @ X1 @ X2 )
       => ( lessf @ X1 @ X2 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.GnJ8VRyHmp/DTF2THF_15273.p',satz41a) ).

thf(f58,plain,
    ( ( eq @ x @ y )
   != $true ),
    inference(trivial_inequality_removal,[status(thm)],[f57]) ).

thf(f57,plain,
    ( ( ( eq @ x @ y )
     != $true )
    | ( $true != $true ) ),
    inference(superposition,[status(thm)],[f52,f39]) ).

thf(f39,plain,
    ( ( lessf @ ( pf @ x @ z ) @ ( pf @ y @ z ) )
    = $true ),
    inference(cnf_transformation,[status(thm)],[f15]) ).

thf(f15,plain,
    ( ( lessf @ ( pf @ x @ z ) @ ( pf @ y @ z ) )
    = $true ),
    inference(fool_elimination,[status(thm)],[f14]) ).

thf(f14,plain,
    lessf @ ( pf @ x @ z ) @ ( pf @ y @ z ),
    inference(rectify,[status(thm)],[f1]) ).

thf(f1,axiom,
    lessf @ ( pf @ x @ z ) @ ( pf @ y @ z ),
    file('/export/starexec/sandbox/tmp/tmp.GnJ8VRyHmp/DTF2THF_15273.p',l) ).

thf(f52,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( ( $true
       != ( lessf @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) ) )
      | ( ( eq @ X0 @ X2 )
       != $true ) ),
    inference(trivial_inequality_removal,[status(thm)],[f50]) ).

thf(f50,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( ( $true != $true )
      | ( ( eq @ X0 @ X2 )
       != $true )
      | ( $true
       != ( lessf @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) ) ) ),
    inference(superposition,[status(thm)],[f42,f38]) ).

thf(f38,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( ( $true
        = ( eq @ ( pf @ X1 @ X2 ) @ ( pf @ X0 @ X2 ) ) )
      | ( ( eq @ X1 @ X0 )
       != $true ) ),
    inference(cnf_transformation,[status(thm)],[f35]) ).

thf(f35,plain,
    ! [X0: frac,X1: frac,X2: frac] :
      ( ( $true
        = ( eq @ ( pf @ X1 @ X2 ) @ ( pf @ X0 @ X2 ) ) )
      | ( ( eq @ X1 @ X0 )
       != $true ) ),
    inference(rectify,[status(thm)],[f28]) ).

thf(f28,plain,
    ! [X2: frac,X1: frac,X0: frac] :
      ( ( ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X0 ) )
        = $true )
      | ( ( eq @ X1 @ X2 )
       != $true ) ),
    inference(ennf_transformation,[status(thm)],[f17]) ).

thf(f17,plain,
    ! [X2: frac,X1: frac,X0: frac] :
      ( ( ( eq @ X1 @ X2 )
        = $true )
     => ( ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X0 ) )
        = $true ) ),
    inference(fool_elimination,[status(thm)],[f16]) ).

thf(f16,plain,
    ! [X0: frac,X1: frac,X2: frac] :
      ( ( eq @ X1 @ X2 )
     => ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X2 @ X0 ) ) ),
    inference(rectify,[status(thm)],[f5]) ).

thf(f5,axiom,
    ! [X3: frac,X1: frac,X2: frac] :
      ( ( eq @ X1 @ X2 )
     => ( eq @ ( pf @ X1 @ X3 ) @ ( pf @ X2 @ X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.GnJ8VRyHmp/DTF2THF_15273.p',satz62b) ).

thf(f42,plain,
    ! [X0: frac,X1: frac] :
      ( ( ( eq @ X1 @ X0 )
       != $true )
      | ( ( lessf @ X1 @ X0 )
       != $true ) ),
    inference(cnf_transformation,[status(thm)],[f36]) ).

thf(f36,plain,
    ! [X0: frac,X1: frac] :
      ( ( ( ( moref @ X1 @ X0 )
         != $true )
        | ( ( eq @ X1 @ X0 )
         != $true ) )
      & ( ( ( moref @ X1 @ X0 )
         != $true )
        | ( ( lessf @ X1 @ X0 )
         != $true ) )
      & ( ( ( lessf @ X1 @ X0 )
         != $true )
        | ( ( eq @ X1 @ X0 )
         != $true ) ) ),
    inference(rectify,[status(thm)],[f30]) ).

thf(f30,plain,
    ! [X1: frac,X0: frac] :
      ( ( ( ( moref @ X0 @ X1 )
         != $true )
        | ( $true
         != ( eq @ X0 @ X1 ) ) )
      & ( ( ( moref @ X0 @ X1 )
         != $true )
        | ( ( lessf @ X0 @ X1 )
         != $true ) )
      & ( ( ( lessf @ X0 @ X1 )
         != $true )
        | ( $true
         != ( eq @ X0 @ X1 ) ) ) ),
    inference(flattening,[status(thm)],[f29]) ).

thf(f29,plain,
    ! [X1: frac,X0: frac] :
      ( ( ( ( lessf @ X0 @ X1 )
         != $true )
        | ( $true
         != ( eq @ X0 @ X1 ) ) )
      & ( ( ( moref @ X0 @ X1 )
         != $true )
        | ( ( lessf @ X0 @ X1 )
         != $true ) )
      & ( ( ( moref @ X0 @ X1 )
         != $true )
        | ( $true
         != ( eq @ X0 @ X1 ) ) ) ),
    inference(ennf_transformation,[status(thm)],[f24]) ).

thf(f24,plain,
    ! [X1: frac,X0: frac] :
      ~ ( ( ( $true
            = ( eq @ X0 @ X1 ) )
         => ( ( moref @ X0 @ X1 )
           != $true ) )
       => ( ( ( ( moref @ X0 @ X1 )
              = $true )
           => ( ( lessf @ X0 @ X1 )
             != $true ) )
         => ~ ( ( ( lessf @ X0 @ X1 )
                = $true )
             => ( $true
               != ( eq @ X0 @ X1 ) ) ) ) ),
    inference(flattening,[status(thm)],[f11]) ).

thf(f11,plain,
    ! [X0: frac,X1: frac] :
      ~ ( ( ( $true
            = ( eq @ X0 @ X1 ) )
         => ( ( moref @ X0 @ X1 )
           != $true ) )
       => ~ ~ ( ( ( ( moref @ X0 @ X1 )
                  = $true )
               => ( ( lessf @ X0 @ X1 )
                 != $true ) )
             => ~ ( ( ( lessf @ X0 @ X1 )
                    = $true )
                 => ( $true
                   != ( eq @ X0 @ X1 ) ) ) ) ),
    inference(fool_elimination,[status(thm)],[f10]) ).

thf(f10,plain,
    ! [X0: frac,X1: frac] :
      ~ ( ( ( eq @ X0 @ X1 )
         => ~ ( moref @ X0 @ X1 ) )
       => ~ ~ ( ( ( moref @ X0 @ X1 )
               => ~ ( lessf @ X0 @ X1 ) )
             => ~ ( ( lessf @ X0 @ X1 )
                 => ~ ( eq @ X0 @ X1 ) ) ) ),
    inference(rectify,[status(thm)],[f3]) ).

thf(f3,axiom,
    ! [X1: frac,X2: frac] :
      ~ ( ( ( eq @ X1 @ X2 )
         => ~ ( moref @ X1 @ X2 ) )
       => ~ ~ ( ( ( moref @ X1 @ X2 )
               => ~ ( lessf @ X1 @ X2 ) )
             => ~ ( ( lessf @ X1 @ X2 )
                 => ~ ( eq @ X1 @ X2 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.GnJ8VRyHmp/DTF2THF_15273.p',satz41b) ).

thf(f65,plain,
    ( ( moref @ x @ y )
   != $true ),
    inference(trivial_inequality_removal,[status(thm)],[f64]) ).

thf(f64,plain,
    ( ( ( moref @ x @ y )
     != $true )
    | ( $true != $true ) ),
    inference(superposition,[status(thm)],[f54,f39]) ).

thf(f54,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( ( $true
       != ( lessf @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) ) )
      | ( $true
       != ( moref @ X0 @ X2 ) ) ),
    inference(trivial_inequality_removal,[status(thm)],[f53]) ).

thf(f53,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( ( $true
       != ( moref @ X0 @ X2 ) )
      | ( $true
       != ( lessf @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) ) )
      | ( $true != $true ) ),
    inference(superposition,[status(thm)],[f43,f41]) ).

thf(f41,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( ( ( moref @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) )
        = $true )
      | ( $true
       != ( moref @ X0 @ X2 ) ) ),
    inference(cnf_transformation,[status(thm)],[f31]) ).

thf(f31,plain,
    ! [X0: frac,X1: frac,X2: frac] :
      ( ( $true
       != ( moref @ X0 @ X2 ) )
      | ( ( moref @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) )
        = $true ) ),
    inference(ennf_transformation,[status(thm)],[f23]) ).

thf(f23,plain,
    ! [X1: frac,X2: frac,X0: frac] :
      ( ( $true
        = ( moref @ X0 @ X2 ) )
     => ( ( moref @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) )
        = $true ) ),
    inference(fool_elimination,[status(thm)],[f22]) ).

thf(f22,plain,
    ! [X0: frac,X1: frac,X2: frac] :
      ( ( moref @ X0 @ X2 )
     => ( moref @ ( pf @ X0 @ X1 ) @ ( pf @ X2 @ X1 ) ) ),
    inference(rectify,[status(thm)],[f4]) ).

thf(f4,axiom,
    ! [X1: frac,X3: frac,X2: frac] :
      ( ( moref @ X1 @ X2 )
     => ( moref @ ( pf @ X1 @ X3 ) @ ( pf @ X2 @ X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.GnJ8VRyHmp/DTF2THF_15273.p',satz62a) ).

thf(f43,plain,
    ! [X0: frac,X1: frac] :
      ( ( ( moref @ X1 @ X0 )
       != $true )
      | ( ( lessf @ X1 @ X0 )
       != $true ) ),
    inference(cnf_transformation,[status(thm)],[f36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : NUM757^1 : TPTP v9.2.1. Released v3.7.0.
% 0.00/0.10  % Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/0.30  % Computer : n001.cluster.edu
% 0.12/0.30  % Model    : x86_64 x86_64
% 0.12/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.30  % Memory   : 8042.1875MB
% 0.12/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.30  % CPULimit : 300
% 0.12/0.30  % WCLimit  : 300
% 0.12/0.30  % DateTime : Tue Feb 24 11:13:50 EST 2026
% 0.12/0.31  % CPUTime  : 
% 0.12/0.31  Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.41  ---- Original DTF file ---
% 0.17/0.41  thf(spec,logic,$$dhol).
% 0.17/0.41  %------------------------------------------------------------------------------
% 0.17/0.41  % File     : NUM757^1 : TPTP v9.2.1. Released v3.7.0.
% 0.17/0.41  % Domain   : Number Theory
% 0.17/0.41  % Problem  : Landau theorem 63c
% 0.17/0.41  % Version  : Especial.
% 0.17/0.41  % English  : lessf x y
% 0.17/0.41  
% 0.17/0.41  % Refs     : [Lan30] Landau (1930), Grundlagen der Analysis
% 0.17/0.41  %          : [vBJ79] van Benthem Jutting (1979), Checking Landau's "Grundla
% 0.17/0.41  %          : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.17/0.41  % Source   : [Bro09]
% 0.17/0.41  % Names    : satz63c [Lan30]
% 0.17/0.41  %          : satz73c [Lan30]
% 0.17/0.41  
% 0.17/0.41  % Status   : Theorem
% 0.17/0.41  %          : Without extensionality : Theorem
% 0.17/0.41  % Rating   : 0.08 v9.1.0, 0.00 v9.0.0, 0.08 v8.2.0, 0.09 v8.1.0, 0.00 v6.1.0, 0.17 v5.5.0, 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v4.0.1, 0.33 v4.0.0, 0.00 v3.7.0
% 0.17/0.41  % Syntax   : Number of formulae    :   15 (   2 unt;   8 typ;   0 def)
% 0.17/0.41  %            Number of atoms       :   15 (   0 equ;   0 cnn)
% 0.17/0.41  %            Maximal formula atoms :    6 (   2 avg)
% 0.17/0.41  %            Number of connectives :   63 (  11   ~;   0   |;   0   &;  42   @)
% 0.17/0.41  %                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
% 0.17/0.41  %            Maximal formula depth :   13 (   7 avg)
% 0.17/0.41  %            Number of types       :    2 (   1 usr)
% 0.17/0.41  %            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
% 0.17/0.41  %            Number of symbols     :    7 (   7 usr;   3 con; 0-2 aty)
% 0.17/0.41  %            Number of variables   :   11 (   0   ^;  11   !;   0   ?;  11   :)
% 0.17/0.41  % SPC      : TH0_THM_NEQ_NAR
% 0.17/0.41  
% 0.17/0.41  % Comments : 
% 0.17/0.41  %------------------------------------------------------------------------------
% 0.17/0.41  thf(frac_type,type,
% 0.17/0.41      frac: $tType ).
% 0.17/0.41  
% 0.17/0.41  thf(x,type,
% 0.17/0.41      x: frac ).
% 0.17/0.41  
% 0.17/0.41  thf(y,type,
% 0.17/0.41      y: frac ).
% 0.17/0.41  
% 0.17/0.41  thf(z,type,
% 0.17/0.41      z: frac ).
% 0.17/0.41  
% 0.17/0.41  thf(lessf,type,
% 0.17/0.41      lessf: frac > frac > $o ).
% 0.17/0.41  
% 0.17/0.41  thf(pf,type,
% 0.17/0.41      pf: frac > frac > frac ).
% 0.17/0.41  
% 0.17/0.41  thf(l,axiom,
% 0.17/0.41      lessf @ ( pf @ x @ z ) @ ( pf @ y @ z ) ).
% 0.17/0.41  
% 0.17/0.41  thf(et,axiom,
% 0.17/0.41      ! [Xa: $o] :
% 0.17/0.41        ( ~ ~ Xa
% 0.17/0.41       => Xa ) ).
% 0.17/0.41  
% 0.17/0.41  thf(moref,type,
% 0.17/0.41      moref: frac > frac > $o ).
% 0.17/0.41  
% 0.17/0.41  thf(eq,type,
% 0.17/0.41      eq: frac > frac > $o ).
% 0.17/0.41  
% 0.17/0.41  thf(satz41b,axiom,
% 0.17/0.41      ! [Xx: frac,Xy: frac] :
% 0.17/0.41        ~ ( ( ( eq @ Xx @ Xy )
% 0.17/0.41           => ~ ( moref @ Xx @ Xy ) )
% 0.17/0.41         => ~ ~ ( ( ( moref @ Xx @ Xy )
% 0.17/0.41                 => ~ ( lessf @ Xx @ Xy ) )
% 0.17/0.41               => ~ ( ( lessf @ Xx @ Xy )
% 0.17/0.41                   => ~ ( eq @ Xx @ Xy ) ) ) ) ).
% 0.17/0.41  
% 0.17/0.41  thf(satz62a,axiom,
% 0.17/0.41      ! [Xx: frac,Xy: frac,Xz: frac] :
% 0.17/0.41        ( ( moref @ Xx @ Xy )
% 0.17/0.41       => ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xz ) ) ) ).
% 0.17/0.41  
% 0.17/0.41  thf(satz62b,axiom,
% 0.17/0.41      ! [Xx: frac,Xy: frac,Xz: frac] :
% 0.17/0.41        ( ( eq @ Xx @ Xy )
% 0.17/0.41       => ( eq @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xz ) ) ) ).
% 0.17/0.41  
% 0.17/0.41  thf(satz41a,axiom,
% 0.17/0.41      ! [Xx: frac,Xy: frac] :
% 0.17/0.41        ( ~ ( eq @ Xx @ Xy )
% 0.17/0.41       => ( ~ ( moref @ Xx @ Xy )
% 0.17/0.41         => ( lessf @ Xx @ Xy ) ) ) ).
% 0.17/0.41  
% 0.17/0.41  thf(satz63c,conjecture,
% 0.17/0.41      lessf @ x @ y ).
% 0.17/0.41  
% 0.17/0.41  %------------------------------------------------------------------------------
% 0.17/0.41  ------------------------
% 1.72/1.42  ---- Embedded in THF ---
% 1.72/1.42  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.72/1.42  %%% Generated on Tue Feb 24 11:13:51 EST 2026
% 1.72/1.42  %%% using '$$dhol' embedding, version 1.3.0.
% 1.72/1.42  %%% Logic specification used:
% 1.72/1.42  %%% thf(spec, logic, $$dhol).
% 1.72/1.42  
% 1.72/1.42  % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.GnJ8VRyHmp/DTF2DTF15273.p
% See solution above
% 1.72/1.42  ------------------------
% 1.72/1.43  ---- Cleaned THF ---
% 1.72/1.43  thf(frac_type,type,
% 1.72/1.43      frac: $tType ).
% 1.72/1.43  
% 1.72/1.43  thf(x,type,
% 1.72/1.43      x: frac ).
% 1.72/1.43  
% 1.72/1.43  thf(y,type,
% 1.72/1.43      y: frac ).
% 1.72/1.43  
% 1.72/1.43  thf(z,type,
% 1.72/1.43      z: frac ).
% 1.72/1.43  
% 1.72/1.43  thf(lessf,type,
% 1.72/1.43      lessf: frac > frac > $o ).
% 1.72/1.43  
% 1.72/1.43  thf(pf,type,
% 1.72/1.43      pf: frac > frac > frac ).
% 1.72/1.43  
% 1.72/1.43  thf(l,axiom,
% 1.72/1.43      lessf @ ( pf @ x @ z ) @ ( pf @ y @ z ) ).
% 1.72/1.43  
% 1.72/1.43  thf(et,axiom,
% 1.72/1.43      ! [Xa: $o] :
% 1.72/1.43        ( ~ ~ Xa
% 1.72/1.43       => Xa ) ).
% 1.72/1.43  
% 1.72/1.43  thf(moref,type,
% 1.72/1.43      moref: frac > frac > $o ).
% 1.72/1.43  
% 1.72/1.43  thf(eq,type,
% 1.72/1.43      eq: frac > frac > $o ).
% 1.72/1.43  
% 1.72/1.43  thf(satz41b,axiom,
% 1.72/1.43      ! [Xx: frac,Xy: frac] :
% 1.72/1.43        ~ ( ( ( eq @ Xx @ Xy )
% 1.72/1.43           => ~ ( moref @ Xx @ Xy ) )
% 1.72/1.43         => ~ ~ ( ( ( moref @ Xx @ Xy )
% 1.72/1.43                 => ~ ( lessf @ Xx @ Xy ) )
% 1.72/1.43               => ~ ( ( lessf @ Xx @ Xy )
% 1.72/1.43                   => ~ ( eq @ Xx @ Xy ) ) ) ) ).
% 1.72/1.43  
% 1.72/1.43  thf(satz62a,axiom,
% 1.72/1.43      ! [Xx: frac,Xy: frac,Xz: frac] :
% 1.72/1.43        ( ( moref @ Xx @ Xy )
% 1.72/1.43       => ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xz ) ) ) ).
% 1.72/1.43  
% 1.72/1.43  thf(satz62b,axiom,
% 1.72/1.43      ! [Xx: frac,Xy: frac,Xz: frac] :
% 1.72/1.43        ( ( eq @ Xx @ Xy )
% 1.72/1.43       => ( eq @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xz ) ) ) ).
% 1.72/1.43  
% 1.72/1.43  thf(satz41a,axiom,
% 1.72/1.43      ! [Xx: frac,Xy: frac] :
% 1.72/1.43        ( ~ ( eq @ Xx @ Xy )
% 1.72/1.43       => ( ~ ( moref @ Xx @ Xy )
% 1.72/1.43         => ( lessf @ Xx @ Xy ) ) ) ).
% 1.72/1.43  
% 1.72/1.43  thf(satz63c,conjecture,
% 1.72/1.43      lessf @ x @ y ).
% 1.72/1.43  ------------------------
% 1.72/1.45  % (15372)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_15273 for (2999ds/4Mi)
% 1.72/1.45  % (15377)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_15273 for (2999ds/18Mi)
% 1.72/1.45  % (15374)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_15273 for (2999ds/2Mi)
% 1.72/1.45  % (15373)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_15273 for (2999ds/27Mi)
% 1.72/1.45  % (15376)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_15273 for (2999ds/275Mi)
% 1.72/1.45  % (15371)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_15273 for (2999ds/183Mi)
% 1.72/1.45  % (15374)Instruction limit reached!
% 1.72/1.45  % (15374)------------------------------
% 1.72/1.45  % (15374)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.72/1.45  % (15374)Termination reason: Unknown
% 1.72/1.45  % (15374)Termination phase: Property scanning
% 1.72/1.45  
% 1.72/1.45  % (15374)Memory used [KB]: 895
% 1.72/1.45  % (15374)Time elapsed: 0.003 s
% 1.72/1.45  % (15374)Instructions burned: 2 (million)
% 1.72/1.45  % (15374)------------------------------
% 1.72/1.45  % (15374)------------------------------
% 1.72/1.45  % (15376)Refutation not found, incomplete strategy
% 1.72/1.45  % (15376)------------------------------
% 1.72/1.45  % (15376)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.72/1.45  % (15376)Termination reason: Refutation not found, incomplete strategy
% 1.72/1.45  
% 1.72/1.45  
% 1.72/1.45  % (15376)Memory used [KB]: 5500
% 1.72/1.45  % (15376)Time elapsed: 0.003 s
% 1.72/1.45  % (15376)Instructions burned: 2 (million)
% 1.72/1.45  % (15376)------------------------------
% 1.72/1.45  % (15376)------------------------------
% 1.72/1.45  % (15375)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_15273 for (2999ds/2Mi)
% 1.72/1.45  % (15372)Instruction limit reached!
% 1.72/1.45  % (15372)------------------------------
% 1.72/1.45  % (15372)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.72/1.45  % (15372)Termination reason: Unknown
% 1.72/1.45  % (15372)Termination phase: Saturation
% 1.72/1.45  
% 1.72/1.45  % (15372)Memory used [KB]: 5500
% 1.72/1.45  % (15372)Time elapsed: 0.005 s
% 1.72/1.45  % (15372)Instructions burned: 5 (million)
% 1.72/1.45  % (15372)------------------------------
% 1.72/1.45  % (15372)------------------------------
% 1.72/1.45  % (15375)Instruction limit reached!
% 1.72/1.45  % (15375)------------------------------
% 1.72/1.45  % (15375)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.72/1.45  % (15375)Termination reason: Unknown
% 1.72/1.45  % (15375)Termination phase: Property scanning
% 1.72/1.45  
% 1.72/1.45  % (15375)Memory used [KB]: 1023
% 1.72/1.45  % (15375)Time elapsed: 0.003 s
% 1.72/1.45  % (15375)Instructions burned: 3 (million)
% 1.72/1.45  % (15375)------------------------------
% 1.72/1.45  % (15375)------------------------------
% 1.72/1.45  % (15371)First to succeed.
% 1.72/1.46  % (15377)Also succeeded, but the first one will report.
% 1.72/1.46  % (15371)Refutation found. Thanks to Tanya!
% 1.72/1.46  % SZS status Theorem for DTF2THF_15273
% 1.72/1.46  % SZS output start Proof for DTF2THF_15273
% 1.72/1.46  thf(type_def_5, type, frac: $tType).
% 1.72/1.46  thf(func_def_0, type, frac: $tType).
% 1.72/1.46  thf(func_def_1, type, x: frac).
% 1.72/1.46  thf(func_def_2, type, y: frac).
% 1.72/1.46  thf(func_def_3, type, z: frac).
% 1.72/1.46  thf(func_def_4, type, lessf: frac > frac > $o).
% 1.72/1.46  thf(func_def_5, type, pf: frac > frac > frac).
% 1.72/1.46  thf(func_def_7, type, moref: frac > frac > $o).
% 1.72/1.46  thf(func_def_8, type, eq: frac > frac > $o).
% 1.72/1.46  thf(f66,plain,(
% 1.72/1.46    $false),
% 1.72/1.46    inference(subsumption_resolution,[status(thm)],[f65,f61])).
% 1.72/1.46  thf(f61,plain,(
% 1.72/1.46    ((moref @ x @ y) = $true)),
% 1.72/1.46    inference(subsumption_resolution,[status(thm)],[f60,f37])).
% 1.72/1.46  thf(f37,plain,(
% 1.72/1.46    ((lessf @ x @ y) != $true)),
% 1.72/1.46    inference(cnf_transformation,[status(thm)],[f25])).
% 1.72/1.46  thf(f25,plain,(
% 1.72/1.46    ((lessf @ x @ y) != $true)),
% 1.72/1.46    inference(flattening,[status(thm)],[f13])).
% 1.72/1.46  thf(f13,plain,(
% 1.72/1.46    ~((lessf @ x @ y) = $true)),
% 1.72/1.46    inference(fool_elimination,[status(thm)],[f12])).
% 1.72/1.46  thf(f12,plain,(
% 1.72/1.46    ~(lessf @ x @ y)),
% 1.72/1.46    inference(rectify,[status(thm)],[f8])).
% 1.72/1.46  thf(f8,negated_conjecture,(
% 1.72/1.46    ~(lessf @ x @ y)),
% 1.72/1.46    inference(negated_conjecture,[status(cth)],[f7])).
% 1.72/1.46  thf(f7,conjecture,(
% 1.72/1.46    (lessf @ x @ y)),
% 1.72/1.46    file('/export/starexec/sandbox/tmp/tmp.GnJ8VRyHmp/DTF2THF_15273.p',satz63c)).
% 1.72/1.46  thf(f60,plain,(
% 1.72/1.46    ((moref @ x @ y) = $true) | ((lessf @ x @ y) = $true)),
% 1.72/1.46    inference(trivial_inequality_removal,[status(thm)],[f59])).
% 1.72/1.46  thf(f59,plain,(
% 1.72/1.46    ((moref @ x @ y) = $true) | ((lessf @ x @ y) = $true) | ($true != $true)),
% 1.72/1.46    inference(superposition,[status(thm)],[f58,f40])).
% 1.72/1.46  thf(f40,plain,(
% 1.72/1.46    ( ! [X0 : frac,X1 : frac] : (((eq @ X1 @ X0) = $true) | ((moref @ X1 @ X0) = $true) | ((lessf @ X1 @ X0) = $true)) )),
% 1.72/1.46    inference(cnf_transformation,[status(thm)],[f33])).
% 1.72/1.46  thf(f33,plain,(
% 1.72/1.46    ! [X0 : frac,X1 : frac] : (((lessf @ X1 @ X0) = $true) | ((eq @ X1 @ X0) = $true) | ((moref @ X1 @ X0) = $true))),
% 1.72/1.46    inference(flattening,[status(thm)],[f32])).
% 1.72/1.46  thf(f32,plain,(
% 1.72/1.46    ! [X1 : frac,X0 : frac] : ((((lessf @ X1 @ X0) = $true) | ((moref @ X1 @ X0) = $true)) | ((eq @ X1 @ X0) = $true))),
% 1.72/1.46    inference(ennf_transformation,[status(thm)],[f27])).
% 1.72/1.46  thf(f27,plain,(
% 1.72/1.46    ! [X1 : frac,X0 : frac] : (((eq @ X1 @ X0) != $true) => (((moref @ X1 @ X0) != $true) => ((lessf @ X1 @ X0) = $true)))),
% 1.72/1.46    inference(flattening,[status(thm)],[f21])).
% 1.72/1.46  thf(f21,plain,(
% 1.72/1.46    ! [X0 : frac,X1 : frac] : (~((eq @ X1 @ X0) = $true) => (~((moref @ X1 @ X0) = $true) => ((lessf @ X1 @ X0) = $true)))),
% 1.72/1.46    inference(fool_elimination,[status(thm)],[f20])).
% 1.72/1.46  thf(f20,plain,(
% 1.72/1.46    ! [X0 : frac,X1 : frac] : (~(eq @ X1 @ X0) => (~(moref @ X1 @ X0) => (lessf @ X1 @ X0)))),
% 1.72/1.46    inference(rectify,[status(thm)],[f6])).
% 1.72/1.46  thf(f6,axiom,(
% 1.72/1.46    ! [X2 : frac,X1 : frac] : (~(eq @ X1 @ X2) => (~(moref @ X1 @ X2) => (lessf @ X1 @ X2)))),
% 1.72/1.46    file('/export/starexec/sandbox/tmp/tmp.GnJ8VRyHmp/DTF2THF_15273.p',satz41a)).
% 1.72/1.46  thf(f58,plain,(
% 1.72/1.46    ((eq @ x @ y) != $true)),
% 1.72/1.46    inference(trivial_inequality_removal,[status(thm)],[f57])).
% 1.72/1.46  thf(f57,plain,(
% 1.72/1.46    ((eq @ x @ y) != $true) | ($true != $true)),
% 1.72/1.46    inference(superposition,[status(thm)],[f52,f39])).
% 1.72/1.46  thf(f39,plain,(
% 1.72/1.46    ((lessf @ (pf @ x @ z) @ (pf @ y @ z)) = $true)),
% 1.72/1.46    inference(cnf_transformation,[status(thm)],[f15])).
% 1.72/1.46  thf(f15,plain,(
% 1.72/1.46    ((lessf @ (pf @ x @ z) @ (pf @ y @ z)) = $true)),
% 1.72/1.46    inference(fool_elimination,[status(thm)],[f14])).
% 1.72/1.46  thf(f14,plain,(
% 1.72/1.46    (lessf @ (pf @ x @ z) @ (pf @ y @ z))),
% 1.72/1.46    inference(rectify,[status(thm)],[f1])).
% 1.72/1.46  thf(f1,axiom,(
% 1.72/1.46    (lessf @ (pf @ x @ z) @ (pf @ y @ z))),
% 1.72/1.46    file('/export/starexec/sandbox/tmp/tmp.GnJ8VRyHmp/DTF2THF_15273.p',l)).
% 1.72/1.46  thf(f52,plain,(
% 1.72/1.46    ( ! [X2 : frac,X0 : frac,X1 : frac] : (($true != (lessf @ (pf @ X0 @ X1) @ (pf @ X2 @ X1))) | ((eq @ X0 @ X2) != $true)) )),
% 1.72/1.46    inference(trivial_inequality_removal,[status(thm)],[f50])).
% 1.72/1.46  thf(f50,plain,(
% 1.72/1.46    ( ! [X2 : frac,X0 : frac,X1 : frac] : (($true != $true) | ((eq @ X0 @ X2) != $true) | ($true != (lessf @ (pf @ X0 @ X1) @ (pf @ X2 @ X1)))) )),
% 1.72/1.46    inference(superposition,[status(thm)],[f42,f38])).
% 1.72/1.46  thf(f38,plain,(
% 1.72/1.46    ( ! [X2 : frac,X0 : frac,X1 : frac] : (($true = (eq @ (pf @ X1 @ X2) @ (pf @ X0 @ X2))) | ((eq @ X1 @ X0) != $true)) )),
% 1.72/1.46    inference(cnf_transformation,[status(thm)],[f35])).
% 1.72/1.46  thf(f35,plain,(
% 1.72/1.46    ! [X0 : frac,X1 : frac,X2 : frac] : (($true = (eq @ (pf @ X1 @ X2) @ (pf @ X0 @ X2))) | ((eq @ X1 @ X0) != $true))),
% 1.72/1.46    inference(rectify,[status(thm)],[f28])).
% 1.72/1.46  thf(f28,plain,(
% 1.72/1.46    ! [X2 : frac,X1 : frac,X0 : frac] : (((eq @ (pf @ X1 @ X0) @ (pf @ X2 @ X0)) = $true) | ((eq @ X1 @ X2) != $true))),
% 1.72/1.46    inference(ennf_transformation,[status(thm)],[f17])).
% 1.72/1.46  thf(f17,plain,(
% 1.72/1.46    ! [X2 : frac,X1 : frac,X0 : frac] : (((eq @ X1 @ X2) = $true) => ((eq @ (pf @ X1 @ X0) @ (pf @ X2 @ X0)) = $true))),
% 1.72/1.46    inference(fool_elimination,[status(thm)],[f16])).
% 1.72/1.46  thf(f16,plain,(
% 1.72/1.46    ! [X0 : frac,X1 : frac,X2 : frac] : ((eq @ X1 @ X2) => (eq @ (pf @ X1 @ X0) @ (pf @ X2 @ X0)))),
% 1.72/1.46    inference(rectify,[status(thm)],[f5])).
% 1.72/1.46  thf(f5,axiom,(
% 1.72/1.46    ! [X3 : frac,X1 : frac,X2 : frac] : ((eq @ X1 @ X2) => (eq @ (pf @ X1 @ X3) @ (pf @ X2 @ X3)))),
% 1.72/1.46    file('/export/starexec/sandbox/tmp/tmp.GnJ8VRyHmp/DTF2THF_15273.p',satz62b)).
% 1.72/1.46  thf(f42,plain,(
% 1.72/1.46    ( ! [X0 : frac,X1 : frac] : (((eq @ X1 @ X0) != $true) | ((lessf @ X1 @ X0) != $true)) )),
% 1.72/1.46    inference(cnf_transformation,[status(thm)],[f36])).
% 1.72/1.46  thf(f36,plain,(
% 1.72/1.46    ! [X0 : frac,X1 : frac] : ((((moref @ X1 @ X0) != $true) | ((eq @ X1 @ X0) != $true)) & (((moref @ X1 @ X0) != $true) | ((lessf @ X1 @ X0) != $true)) & (((lessf @ X1 @ X0) != $true) | ((eq @ X1 @ X0) != $true)))),
% 1.72/1.46    inference(rectify,[status(thm)],[f30])).
% 1.72/1.46  thf(f30,plain,(
% 1.72/1.46    ! [X1 : frac,X0 : frac] : ((((moref @ X0 @ X1) != $true) | ($true != (eq @ X0 @ X1))) & (((moref @ X0 @ X1) != $true) | ((lessf @ X0 @ X1) != $true)) & (((lessf @ X0 @ X1) != $true) | ($true != (eq @ X0 @ X1))))),
% 1.72/1.46    inference(flattening,[status(thm)],[f29])).
% 1.72/1.46  thf(f29,plain,(
% 1.72/1.46    ! [X1 : frac,X0 : frac] : (((((lessf @ X0 @ X1) != $true) | ($true != (eq @ X0 @ X1))) & (((moref @ X0 @ X1) != $true) | ((lessf @ X0 @ X1) != $true))) & (((moref @ X0 @ X1) != $true) | ($true != (eq @ X0 @ X1))))),
% 1.72/1.46    inference(ennf_transformation,[status(thm)],[f24])).
% 1.72/1.46  thf(f24,plain,(
% 1.72/1.46    ! [X1 : frac,X0 : frac] : ~((($true = (eq @ X0 @ X1)) => ((moref @ X0 @ X1) != $true)) => ((((moref @ X0 @ X1) = $true) => ((lessf @ X0 @ X1) != $true)) => ~(((lessf @ X0 @ X1) = $true) => ($true != (eq @ X0 @ X1)))))),
% 1.72/1.46    inference(flattening,[status(thm)],[f11])).
% 1.72/1.46  thf(f11,plain,(
% 1.72/1.46    ! [X0 : frac,X1 : frac] : ~((($true = (eq @ X0 @ X1)) => ~((moref @ X0 @ X1) = $true)) => ~~((((moref @ X0 @ X1) = $true) => ~((lessf @ X0 @ X1) = $true)) => ~(((lessf @ X0 @ X1) = $true) => ~($true = (eq @ X0 @ X1)))))),
% 1.72/1.46    inference(fool_elimination,[status(thm)],[f10])).
% 1.72/1.46  thf(f10,plain,(
% 1.72/1.46    ! [X0 : frac,X1 : frac] : ~(((eq @ X0 @ X1) => ~(moref @ X0 @ X1)) => ~~(((moref @ X0 @ X1) => ~(lessf @ X0 @ X1)) => ~((lessf @ X0 @ X1) => ~(eq @ X0 @ X1))))),
% 1.72/1.46    inference(rectify,[status(thm)],[f3])).
% 1.72/1.46  thf(f3,axiom,(
% 1.72/1.46    ! [X1 : frac,X2 : frac] : ~(((eq @ X1 @ X2) => ~(moref @ X1 @ X2)) => ~~(((moref @ X1 @ X2) => ~(lessf @ X1 @ X2)) => ~((lessf @ X1 @ X2) => ~(eq @ X1 @ X2))))),
% 1.72/1.46    file('/export/starexec/sandbox/tmp/tmp.GnJ8VRyHmp/DTF2THF_15273.p',satz41b)).
% 1.72/1.46  thf(f65,plain,(
% 1.72/1.46    ((moref @ x @ y) != $true)),
% 1.72/1.46    inference(trivial_inequality_removal,[status(thm)],[f64])).
% 1.72/1.46  thf(f64,plain,(
% 1.72/1.46    ((moref @ x @ y) != $true) | ($true != $true)),
% 1.72/1.46    inference(superposition,[status(thm)],[f54,f39])).
% 1.72/1.46  thf(f54,plain,(
% 1.72/1.46    ( ! [X2 : frac,X0 : frac,X1 : frac] : (($true != (lessf @ (pf @ X0 @ X1) @ (pf @ X2 @ X1))) | ($true != (moref @ X0 @ X2))) )),
% 1.72/1.46    inference(trivial_inequality_removal,[status(thm)],[f53])).
% 1.72/1.46  thf(f53,plain,(
% 1.72/1.46    ( ! [X2 : frac,X0 : frac,X1 : frac] : (($true != (moref @ X0 @ X2)) | ($true != (lessf @ (pf @ X0 @ X1) @ (pf @ X2 @ X1))) | ($true != $true)) )),
% 1.72/1.46    inference(superposition,[status(thm)],[f43,f41])).
% 1.72/1.46  thf(f41,plain,(
% 1.72/1.46    ( ! [X2 : frac,X0 : frac,X1 : frac] : (((moref @ (pf @ X0 @ X1) @ (pf @ X2 @ X1)) = $true) | ($true != (moref @ X0 @ X2))) )),
% 1.72/1.46    inference(cnf_transformation,[status(thm)],[f31])).
% 1.72/1.46  thf(f31,plain,(
% 1.72/1.46    ! [X0 : frac,X1 : frac,X2 : frac] : (($true != (moref @ X0 @ X2)) | ((moref @ (pf @ X0 @ X1) @ (pf @ X2 @ X1)) = $true))),
% 1.72/1.46    inference(ennf_transformation,[status(thm)],[f23])).
% 1.72/1.46  thf(f23,plain,(
% 1.72/1.46    ! [X1 : frac,X2 : frac,X0 : frac] : (($true = (moref @ X0 @ X2)) => ((moref @ (pf @ X0 @ X1) @ (pf @ X2 @ X1)) = $true))),
% 1.72/1.46    inference(fool_elimination,[status(thm)],[f22])).
% 1.72/1.46  thf(f22,plain,(
% 1.72/1.46    ! [X0 : frac,X1 : frac,X2 : frac] : ((moref @ X0 @ X2) => (moref @ (pf @ X0 @ X1) @ (pf @ X2 @ X1)))),
% 1.72/1.46    inference(rectify,[status(thm)],[f4])).
% 1.72/1.46  thf(f4,axiom,(
% 1.72/1.46    ! [X1 : frac,X3 : frac,X2 : frac] : ((moref @ X1 @ X2) => (moref @ (pf @ X1 @ X3) @ (pf @ X2 @ X3)))),
% 1.72/1.46    file('/export/starexec/sandbox/tmp/tmp.GnJ8VRyHmp/DTF2THF_15273.p',satz62a)).
% 1.72/1.46  thf(f43,plain,(
% 1.72/1.46    ( ! [X0 : frac,X1 : frac] : (((moref @ X1 @ X0) != $true) | ((lessf @ X1 @ X0) != $true)) )),
% 1.72/1.46    inference(cnf_transformation,[status(thm)],[f36])).
% 1.72/1.46  % SZS output end Proof for DTF2THF_15273
% 1.72/1.46  % (15371)------------------------------
% 1.72/1.46  % (15371)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.72/1.46  % (15371)Termination reason: Refutation
% 1.72/1.46  
% 1.72/1.46  % (15371)Memory used [KB]: 5500
% 1.72/1.46  % (15371)Time elapsed: 0.007 s
% 1.72/1.46  % (15371)Instructions burned: 7 (million)
% 1.72/1.46  % (15371)------------------------------
% 1.72/1.46  % (15371)------------------------------
% 1.72/1.46  % (15370)Success in time 0.02 s
%------------------------------------------------------------------------------