↑ Up

DT2H2X---1.9.5.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : DT2H2X---1.9.5
% Problem  : NUM747^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 : n003.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:31 AM UTC 2026

% Result   : Theorem 1.70s 1.42s
% Output   : Refutation 1.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   61 (  17 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :  198 (  11   ~;   4   |;   0   &; 180   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   27 (   0   ^;  27   !;   0   ?;  27   :)

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

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

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

thf(func_def_1,type,
    x1: nat ).

thf(func_def_2,type,
    x2: nat ).

thf(func_def_3,type,
    n: nat ).

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

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

thf(func_def_6,type,
    fr: nat > nat > frac ).

thf(func_def_7,type,
    pl: nat > nat > nat ).

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

thf(f21,plain,
    $false,
    inference(subsumption_resolution,[status(thm)],[f20,f18]) ).

thf(f18,plain,
    ! [X2: nat,X0: nat,X1: nat] :
      ( $true
      = ( eq @ ( pf @ ( fr @ X0 @ X1 ) @ ( fr @ X2 @ X1 ) ) @ ( fr @ ( pl @ X0 @ X2 ) @ X1 ) ) ),
    inference(cnf_transformation,[status(thm)],[f15]) ).

thf(f15,plain,
    ! [X0: nat,X1: nat,X2: nat] :
      ( $true
      = ( eq @ ( pf @ ( fr @ X0 @ X1 ) @ ( fr @ X2 @ X1 ) ) @ ( fr @ ( pl @ X0 @ X2 ) @ X1 ) ) ),
    inference(rectify,[status(thm)],[f7]) ).

thf(f7,plain,
    ! [X2: nat,X1: nat,X0: nat] :
      ( $true
      = ( eq @ ( pf @ ( fr @ X2 @ X1 ) @ ( fr @ X0 @ X1 ) ) @ ( fr @ ( pl @ X2 @ X0 ) @ X1 ) ) ),
    inference(fool_elimination,[status(thm)],[f6]) ).

thf(f6,plain,
    ! [X0: nat,X1: nat,X2: nat] : ( eq @ ( pf @ ( fr @ X2 @ X1 ) @ ( fr @ X0 @ X1 ) ) @ ( fr @ ( pl @ X2 @ X0 ) @ X1 ) ),
    inference(rectify,[status(thm)],[f2]) ).

thf(f2,axiom,
    ! [X3: nat,X4: nat,X2: nat] : ( eq @ ( pf @ ( fr @ X2 @ X4 ) @ ( fr @ X3 @ X4 ) ) @ ( fr @ ( pl @ X2 @ X3 ) @ X4 ) ),
    file('/export/starexec/sandbox/tmp/tmp.Kl7mdGxyBb/DTF2THF_17517.p',satz57) ).

thf(f20,plain,
    ( $true
   != ( eq @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ) @ ( fr @ ( pl @ x1 @ x2 ) @ n ) ) ),
    inference(trivial_inequality_removal,[status(thm)],[f19]) ).

thf(f19,plain,
    ( ( $true != $true )
    | ( $true
     != ( eq @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ) @ ( fr @ ( pl @ x1 @ x2 ) @ n ) ) ) ),
    inference(superposition,[status(thm)],[f17,f16]) ).

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

thf(f14,plain,
    ! [X0: frac,X1: frac] :
      ( ( ( eq @ X1 @ X0 )
       != $true )
      | ( ( eq @ X0 @ X1 )
        = $true ) ),
    inference(rectify,[status(thm)],[f13]) ).

thf(f13,plain,
    ! [X1: frac,X0: frac] :
      ( ( ( eq @ X0 @ X1 )
       != $true )
      | ( ( eq @ X1 @ X0 )
        = $true ) ),
    inference(ennf_transformation,[status(thm)],[f11]) ).

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

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

thf(f1,axiom,
    ! [X0: frac,X1: frac] :
      ( ( eq @ X0 @ X1 )
     => ( eq @ X1 @ X0 ) ),
    file('/export/starexec/sandbox/tmp/tmp.Kl7mdGxyBb/DTF2THF_17517.p',satz38) ).

thf(f17,plain,
    ( ( eq @ ( fr @ ( pl @ x1 @ x2 ) @ n ) @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ) )
   != $true ),
    inference(cnf_transformation,[status(thm)],[f12]) ).

thf(f12,plain,
    ( ( eq @ ( fr @ ( pl @ x1 @ x2 ) @ n ) @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ) )
   != $true ),
    inference(flattening,[status(thm)],[f9]) ).

thf(f9,plain,
    ( ( eq @ ( fr @ ( pl @ x1 @ x2 ) @ n ) @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ) )
   != $true ),
    inference(fool_elimination,[status(thm)],[f8]) ).

thf(f8,plain,
    ~ ( eq @ ( fr @ ( pl @ x1 @ x2 ) @ n ) @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ) ),
    inference(rectify,[status(thm)],[f4]) ).

thf(f4,negated_conjecture,
    ~ ( eq @ ( fr @ ( pl @ x1 @ x2 ) @ n ) @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

thf(f3,conjecture,
    eq @ ( fr @ ( pl @ x1 @ x2 ) @ n ) @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ),
    file('/export/starexec/sandbox/tmp/tmp.Kl7mdGxyBb/DTF2THF_17517.p',satz57a) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM747^1 : TPTP v9.2.1. Released v3.7.0.
% 0.13/0.13  % Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.34  % Computer : n003.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit : 300
% 0.17/0.34  % WCLimit  : 300
% 0.17/0.34  % DateTime : Tue Feb 24 11:12:40 EST 2026
% 0.17/0.34  % CPUTime  : 
% 0.17/0.34  Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.21/0.45  ---- Original DTF file ---
% 0.21/0.45  thf(spec,logic,$$dhol).
% 0.21/0.45  %------------------------------------------------------------------------------
% 0.21/0.45  % File     : NUM747^1 : TPTP v9.2.1. Released v3.7.0.
% 0.21/0.45  % Domain   : Number Theory
% 0.21/0.45  % Problem  : Landau theorem 57a
% 0.21/0.45  % Version  : Especial.
% 0.21/0.45  % English  : eq (fr (pl x1 x2) n) (pf (fr x1 n) (fr x2 n))
% 0.21/0.45  
% 0.21/0.45  % Refs     : [Lan30] Landau (1930), Grundlagen der Analysis
% 0.21/0.45  %          : [vBJ79] van Benthem Jutting (1979), Checking Landau's "Grundla
% 0.21/0.45  %          : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.21/0.45  % Source   : [Bro09]
% 0.21/0.45  % Names    : satz57a [Lan30]
% 0.21/0.45  
% 0.21/0.45  % Status   : Theorem
% 0.21/0.45  %          : Without extensionality : Theorem
% 0.21/0.45  % Rating   : 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v3.7.0
% 0.21/0.45  % Syntax   : Number of formulae    :   12 (   2 unt;   9 typ;   0 def)
% 0.21/0.45  %            Number of atoms       :    4 (   0 equ;   0 cnn)
% 0.21/0.45  %            Maximal formula atoms :    2 (   1 avg)
% 0.21/0.45  %            Number of connectives :   29 (   0   ~;   0   |;   0   &;  28   @)
% 0.21/0.45  %                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
% 0.21/0.45  %            Maximal formula depth :   10 (   8 avg)
% 0.21/0.45  %            Number of types       :    3 (   2 usr)
% 0.21/0.45  %            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
% 0.21/0.45  %            Number of symbols     :    7 (   7 usr;   3 con; 0-2 aty)
% 0.21/0.45  %            Number of variables   :    5 (   0   ^;   5   !;   0   ?;   5   :)
% 0.21/0.45  % SPC      : TH0_THM_NEQ_NAR
% 0.21/0.45  
% 0.21/0.45  % Comments : 
% 0.21/0.45  %------------------------------------------------------------------------------
% 0.21/0.45  thf(nat_type,type,
% 0.21/0.45      nat: $tType ).
% 0.21/0.45  
% 0.21/0.45  thf(x1,type,
% 0.21/0.45      x1: nat ).
% 0.21/0.45  
% 0.21/0.45  thf(x2,type,
% 0.21/0.45      x2: nat ).
% 0.21/0.45  
% 0.21/0.45  thf(n,type,
% 0.21/0.45      n: nat ).
% 0.21/0.45  
% 0.21/0.45  thf(frac_type,type,
% 0.21/0.45      frac: $tType ).
% 0.21/0.45  
% 0.21/0.45  thf(eq,type,
% 0.21/0.45      eq: frac > frac > $o ).
% 0.21/0.45  
% 0.21/0.45  thf(fr,type,
% 0.21/0.45      fr: nat > nat > frac ).
% 0.21/0.45  
% 0.21/0.45  thf(pl,type,
% 0.21/0.45      pl: nat > nat > nat ).
% 0.21/0.45  
% 0.21/0.45  thf(pf,type,
% 0.21/0.45      pf: frac > frac > frac ).
% 0.21/0.45  
% 0.21/0.45  thf(satz38,axiom,
% 0.21/0.45      ! [Xx: frac,Xy: frac] :
% 0.21/0.45        ( ( eq @ Xx @ Xy )
% 0.21/0.45       => ( eq @ Xy @ Xx ) ) ).
% 0.21/0.45  
% 0.21/0.45  thf(satz57,axiom,
% 0.21/0.45      ! [Xx1: nat,Xx2: nat,Xn: nat] : ( eq @ ( pf @ ( fr @ Xx1 @ Xn ) @ ( fr @ Xx2 @ Xn ) ) @ ( fr @ ( pl @ Xx1 @ Xx2 ) @ Xn ) ) ).
% 0.21/0.45  
% 0.21/0.45  thf(satz57a,conjecture,
% 0.21/0.45      eq @ ( fr @ ( pl @ x1 @ x2 ) @ n ) @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ) ).
% 0.21/0.45  
% 0.21/0.45  %------------------------------------------------------------------------------
% 0.21/0.45  ------------------------
% 1.50/1.39  ---- Embedded in THF ---
% 1.50/1.39  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.50/1.39  %%% Generated on Tue Feb 24 11:12:41 EST 2026
% 1.50/1.39  %%% using '$$dhol' embedding, version 1.3.0.
% 1.50/1.39  %%% Logic specification used:
% 1.50/1.39  %%% thf(spec, logic, $$dhol).
% 1.50/1.39  
% 1.50/1.39  % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.Kl7mdGxyBb/DTF2DTF17517.p
% See solution above
% 1.50/1.39  ------------------------
% 1.50/1.40  ---- Cleaned THF ---
% 1.70/1.40  thf(nat_type,type,
% 1.70/1.40      nat: $tType ).
% 1.70/1.40  
% 1.70/1.40  thf(x1,type,
% 1.70/1.40      x1: nat ).
% 1.70/1.40  
% 1.70/1.40  thf(x2,type,
% 1.70/1.40      x2: nat ).
% 1.70/1.40  
% 1.70/1.40  thf(n,type,
% 1.70/1.40      n: nat ).
% 1.70/1.40  
% 1.70/1.40  thf(frac_type,type,
% 1.70/1.40      frac: $tType ).
% 1.70/1.40  
% 1.70/1.40  thf(eq,type,
% 1.70/1.40      eq: frac > frac > $o ).
% 1.70/1.40  
% 1.70/1.40  thf(fr,type,
% 1.70/1.40      fr: nat > nat > frac ).
% 1.70/1.40  
% 1.70/1.40  thf(pl,type,
% 1.70/1.40      pl: nat > nat > nat ).
% 1.70/1.40  
% 1.70/1.40  thf(pf,type,
% 1.70/1.40      pf: frac > frac > frac ).
% 1.70/1.40  
% 1.70/1.40  thf(satz38,axiom,
% 1.70/1.40      ! [Xx: frac,Xy: frac] :
% 1.70/1.40        ( ( eq @ Xx @ Xy )
% 1.70/1.40       => ( eq @ Xy @ Xx ) ) ).
% 1.70/1.40  
% 1.70/1.40  thf(satz57,axiom,
% 1.70/1.40      ! [Xx1: nat,Xx2: nat,Xn: nat] : ( eq @ ( pf @ ( fr @ Xx1 @ Xn ) @ ( fr @ Xx2 @ Xn ) ) @ ( fr @ ( pl @ Xx1 @ Xx2 ) @ Xn ) ) ).
% 1.70/1.40  
% 1.70/1.40  thf(satz57a,conjecture,
% 1.70/1.40      eq @ ( fr @ ( pl @ x1 @ x2 ) @ n ) @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ) ).
% 1.70/1.40  ------------------------
% 1.70/1.42  % (17614)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_17517 for (2999ds/183Mi)
% 1.70/1.42  % (17615)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_17517 for (2999ds/4Mi)
% 1.70/1.42  % (17616)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_17517 for (2999ds/27Mi)
% 1.70/1.42  % (17617)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_17517 for (2999ds/2Mi)
% 1.70/1.42  % (17618)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_17517 for (2999ds/2Mi)
% 1.70/1.42  % (17619)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_17517 for (2999ds/275Mi)
% 1.70/1.42  % (17620)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_17517 for (2999ds/18Mi)
% 1.70/1.42  % (17617)Instruction limit reached!
% 1.70/1.42  % (17617)------------------------------
% 1.70/1.42  % (17617)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.42  % (17617)Termination reason: Unknown
% 1.70/1.42  % (17617)Termination phase: Saturation
% 1.70/1.42  % (17618)Instruction limit reached!
% 1.70/1.42  % (17618)------------------------------
% 1.70/1.42  % (17618)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.42  % (17618)Termination reason: Unknown
% 1.70/1.42  % (17618)Termination phase: Saturation
% 1.70/1.42  
% 1.70/1.42  % (17618)Memory used [KB]: 5500
% 1.70/1.42  % (17618)Time elapsed: 0.003 s
% 1.70/1.42  % (17618)Instructions burned: 2 (million)
% 1.70/1.42  % (17618)------------------------------
% 1.70/1.42  % (17618)------------------------------
% 1.70/1.42  
% 1.70/1.42  % (17617)Memory used [KB]: 5500
% 1.70/1.42  % (17617)Time elapsed: 0.003 s
% 1.70/1.42  % (17617)Instructions burned: 2 (million)
% 1.70/1.42  % (17617)------------------------------
% 1.70/1.42  % (17617)------------------------------
% 1.70/1.42  % (17614)First to succeed.
% 1.70/1.42  % (17615)Instruction limit reached!
% 1.70/1.42  % (17615)------------------------------
% 1.70/1.42  % (17615)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.42  % (17615)Termination reason: Unknown
% 1.70/1.42  % (17615)Termination phase: Saturation
% 1.70/1.42  
% 1.70/1.42  % (17615)Memory used [KB]: 5500
% 1.70/1.42  % (17615)Time elapsed: 0.004 s
% 1.70/1.42  % (17615)Instructions burned: 4 (million)
% 1.70/1.42  % (17615)------------------------------
% 1.70/1.42  % (17615)------------------------------
% 1.70/1.42  % (17619)Also succeeded, but the first one will report.
% 1.70/1.42  % (17616)Also succeeded, but the first one will report.
% 1.70/1.42  % (17614)Refutation found. Thanks to Tanya!
% 1.70/1.42  % SZS status Theorem for DTF2THF_17517
% 1.70/1.42  % SZS output start Proof for DTF2THF_17517
% 1.70/1.42  thf(type_def_5, type, nat: $tType).
% 1.70/1.42  thf(type_def_6, type, frac: $tType).
% 1.70/1.42  thf(func_def_0, type, nat: $tType).
% 1.70/1.42  thf(func_def_1, type, x1: nat).
% 1.70/1.42  thf(func_def_2, type, x2: nat).
% 1.70/1.42  thf(func_def_3, type, n: nat).
% 1.70/1.42  thf(func_def_4, type, frac: $tType).
% 1.70/1.42  thf(func_def_5, type, eq: frac > frac > $o).
% 1.70/1.42  thf(func_def_6, type, fr: nat > nat > frac).
% 1.70/1.42  thf(func_def_7, type, pl: nat > nat > nat).
% 1.70/1.42  thf(func_def_8, type, pf: frac > frac > frac).
% 1.70/1.42  thf(f21,plain,(
% 1.70/1.42    $false),
% 1.70/1.42    inference(subsumption_resolution,[status(thm)],[f20,f18])).
% 1.70/1.42  thf(f18,plain,(
% 1.70/1.42    ( ! [X2 : nat,X0 : nat,X1 : nat] : (($true = (eq @ (pf @ (fr @ X0 @ X1) @ (fr @ X2 @ X1)) @ (fr @ (pl @ X0 @ X2) @ X1)))) )),
% 1.70/1.42    inference(cnf_transformation,[status(thm)],[f15])).
% 1.70/1.42  thf(f15,plain,(
% 1.70/1.42    ! [X0 : nat,X1 : nat,X2 : nat] : ($true = (eq @ (pf @ (fr @ X0 @ X1) @ (fr @ X2 @ X1)) @ (fr @ (pl @ X0 @ X2) @ X1)))),
% 1.70/1.42    inference(rectify,[status(thm)],[f7])).
% 1.70/1.42  thf(f7,plain,(
% 1.70/1.42    ! [X2 : nat,X1 : nat,X0 : nat] : ($true = (eq @ (pf @ (fr @ X2 @ X1) @ (fr @ X0 @ X1)) @ (fr @ (pl @ X2 @ X0) @ X1)))),
% 1.70/1.42    inference(fool_elimination,[status(thm)],[f6])).
% 1.70/1.42  thf(f6,plain,(
% 1.70/1.42    ! [X0 : nat,X1 : nat,X2 : nat] : (eq @ (pf @ (fr @ X2 @ X1) @ (fr @ X0 @ X1)) @ (fr @ (pl @ X2 @ X0) @ X1))),
% 1.70/1.42    inference(rectify,[status(thm)],[f2])).
% 1.70/1.42  thf(f2,axiom,(
% 1.70/1.42    ! [X3 : nat,X4 : nat,X2 : nat] : (eq @ (pf @ (fr @ X2 @ X4) @ (fr @ X3 @ X4)) @ (fr @ (pl @ X2 @ X3) @ X4))),
% 1.70/1.42    file('/export/starexec/sandbox/tmp/tmp.Kl7mdGxyBb/DTF2THF_17517.p',satz57)).
% 1.70/1.42  thf(f20,plain,(
% 1.70/1.42    ($true != (eq @ (pf @ (fr @ x1 @ n) @ (fr @ x2 @ n)) @ (fr @ (pl @ x1 @ x2) @ n)))),
% 1.70/1.42    inference(trivial_inequality_removal,[status(thm)],[f19])).
% 1.70/1.42  thf(f19,plain,(
% 1.70/1.42    ($true != $true) | ($true != (eq @ (pf @ (fr @ x1 @ n) @ (fr @ x2 @ n)) @ (fr @ (pl @ x1 @ x2) @ n)))),
% 1.70/1.42    inference(superposition,[status(thm)],[f17,f16])).
% 1.70/1.42  thf(f16,plain,(
% 1.70/1.42    ( ! [X0 : frac,X1 : frac] : (((eq @ X0 @ X1) = $true) | ((eq @ X1 @ X0) != $true)) )),
% 1.70/1.42    inference(cnf_transformation,[status(thm)],[f14])).
% 1.70/1.42  thf(f14,plain,(
% 1.70/1.42    ! [X0 : frac,X1 : frac] : (((eq @ X1 @ X0) != $true) | ((eq @ X0 @ X1) = $true))),
% 1.70/1.42    inference(rectify,[status(thm)],[f13])).
% 1.70/1.42  thf(f13,plain,(
% 1.70/1.42    ! [X1 : frac,X0 : frac] : (((eq @ X0 @ X1) != $true) | ((eq @ X1 @ X0) = $true))),
% 1.70/1.42    inference(ennf_transformation,[status(thm)],[f11])).
% 1.70/1.42  thf(f11,plain,(
% 1.70/1.42    ! [X0 : frac,X1 : frac] : (((eq @ X0 @ X1) = $true) => ((eq @ X1 @ X0) = $true))),
% 1.70/1.42    inference(fool_elimination,[status(thm)],[f10])).
% 1.70/1.42  thf(f10,plain,(
% 1.70/1.42    ! [X0 : frac,X1 : frac] : ((eq @ X0 @ X1) => (eq @ X1 @ X0))),
% 1.70/1.42    inference(rectify,[status(thm)],[f1])).
% 1.70/1.42  thf(f1,axiom,(
% 1.70/1.42    ! [X0 : frac,X1 : frac] : ((eq @ X0 @ X1) => (eq @ X1 @ X0))),
% 1.70/1.42    file('/export/starexec/sandbox/tmp/tmp.Kl7mdGxyBb/DTF2THF_17517.p',satz38)).
% 1.70/1.42  thf(f17,plain,(
% 1.70/1.42    ((eq @ (fr @ (pl @ x1 @ x2) @ n) @ (pf @ (fr @ x1 @ n) @ (fr @ x2 @ n))) != $true)),
% 1.70/1.42    inference(cnf_transformation,[status(thm)],[f12])).
% 1.70/1.42  thf(f12,plain,(
% 1.70/1.42    ((eq @ (fr @ (pl @ x1 @ x2) @ n) @ (pf @ (fr @ x1 @ n) @ (fr @ x2 @ n))) != $true)),
% 1.70/1.42    inference(flattening,[status(thm)],[f9])).
% 1.70/1.42  thf(f9,plain,(
% 1.70/1.42    ~((eq @ (fr @ (pl @ x1 @ x2) @ n) @ (pf @ (fr @ x1 @ n) @ (fr @ x2 @ n))) = $true)),
% 1.70/1.42    inference(fool_elimination,[status(thm)],[f8])).
% 1.70/1.42  thf(f8,plain,(
% 1.70/1.42    ~(eq @ (fr @ (pl @ x1 @ x2) @ n) @ (pf @ (fr @ x1 @ n) @ (fr @ x2 @ n)))),
% 1.70/1.42    inference(rectify,[status(thm)],[f4])).
% 1.70/1.42  thf(f4,negated_conjecture,(
% 1.70/1.42    ~(eq @ (fr @ (pl @ x1 @ x2) @ n) @ (pf @ (fr @ x1 @ n) @ (fr @ x2 @ n)))),
% 1.70/1.42    inference(negated_conjecture,[status(cth)],[f3])).
% 1.70/1.42  thf(f3,conjecture,(
% 1.70/1.42    (eq @ (fr @ (pl @ x1 @ x2) @ n) @ (pf @ (fr @ x1 @ n) @ (fr @ x2 @ n)))),
% 1.70/1.42    file('/export/starexec/sandbox/tmp/tmp.Kl7mdGxyBb/DTF2THF_17517.p',satz57a)).
% 1.70/1.42  % SZS output end Proof for DTF2THF_17517
% 1.70/1.42  % (17614)------------------------------
% 1.70/1.42  % (17614)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.70/1.42  % (17614)Termination reason: Refutation
% 1.70/1.42  
% 1.70/1.42  % (17614)Memory used [KB]: 5500
% 1.70/1.42  % (17614)Time elapsed: 0.004 s
% 1.70/1.42  % (17614)Instructions burned: 2 (million)
% 1.70/1.42  % (17614)------------------------------
% 1.70/1.42  % (17614)------------------------------
% 1.70/1.42  % (17613)Success in time 0.018 s
%------------------------------------------------------------------------------