↑ Up

DT2H2X---1.9.5.THM-Ref.s

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

% Computer : n029.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:53:21 AM UTC 2026

% Result   : Theorem 1.46s 1.30s
% Output   : Refutation 1.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   35 (   4 unt;   0 typ;   6 def)
%            Number of atoms       :  362 (  98 equ)
%            Maximal formula atoms :   14 (  10 avg)
%            Number of connectives :  211 (  80   ~;  76   |;  34   &)
%                                         (   6 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of FOOLs       :  196 ( 196 fml;   0 var)
%            Number of types       :    0 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   16 (  13 usr;  15 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(f53,plain,
    $false,
    inference(avatar_sat_refutation,[status(thm)],[f28,f32,f36,f40,f45,f50,f52]) ).

tff(f52,plain,
    ~ spl0_6,
    inference(avatar_contradiction_clause,[status(thm)],[f51]) ).

tff(f51,plain,
    ( $false
    | ~ spl0_6 ),
    inference(subsumption_resolution,[status(thm)],[f44,f10]) ).

tff(f10,plain,
    t != $true,
    inference(cnf_transformation,[status(thm)],[f9]) ).

tff(f9,plain,
    ( ( s = $true )
    & ( ( ( b = $true )
        & ( a = $true )
        & ( c = $true )
        & ( d = $true ) )
      | ( p != $true ) )
    & ( ( t = $true )
      | ( s != $true )
      | ( ( p = $true )
        & ( ( a != $true )
          | ( c != $true )
          | ( d != $true )
          | ( b != $true ) ) ) )
    & ( t != $true ) ),
    inference(flattening,[status(thm)],[f8]) ).

tff(f8,plain,
    ( ( t != $true )
    & ( s = $true )
    & ( ( ( d = $true )
        & ( c = $true )
        & ( a = $true )
        & ( b = $true ) )
      | ( p != $true ) )
    & ( ( t = $true )
      | ( s != $true )
      | ( ( p = $true )
        & ( ( a != $true )
          | ( c != $true )
          | ( d != $true )
          | ( b != $true ) ) ) ) ),
    inference(ennf_transformation,[status(thm)],[f7]) ).

tff(f7,plain,
    ~ ( ( ( ( s = $true )
         => ( t = $true ) )
        | ( ( p = $true )
          & ( ( a != $true )
            | ( c != $true )
            | ( d != $true )
            | ( b != $true ) ) ) )
     => ( ( ( s = $true )
         => ( t = $true ) )
        | ( ( ~ ( ( d = $true )
                & ( c = $true ) )
            | ~ ( ( a = $true )
                & ( b = $true ) ) )
          & ( p = $true ) ) ) ),
    inference(flattening,[status(thm)],[f6]) ).

tff(f6,plain,
    ~ ( ( ( ( ( a != $true )
            | ( d != $true )
            | ( c != $true )
            | ( b != $true ) )
          & ( p = $true ) )
        | ( ( s = $true )
         => ( t = $true ) ) )
     => ( ( ( s = $true )
         => ( t = $true ) )
        | ( ( ~ ( ( d = $true )
                & ( c = $true ) )
            | ~ ( ( a = $true )
                & ( b = $true ) ) )
          & ( p = $true ) ) ) ),
    inference(fool_elimination,[status(thm)],[f5]) ).

tff(f5,plain,
    ~ ( ( ( ( ~ a
            | ~ d
            | ~ c
            | ~ b )
          & p )
        | ( s
         => t ) )
     => ( ( s
         => t )
        | ( p
          & ( ~ ( b
                & a )
            | ~ ( c
                & d ) ) ) ) ),
    inference(rectify,[status(thm)],[f2]) ).

tff(f2,negated_conjecture,
    ~ ( ( ( ( ~ a
            | ~ d
            | ~ c
            | ~ b )
          & p )
        | ( s
         => t ) )
     => ( ( s
         => t )
        | ( p
          & ( ~ ( b
                & a )
            | ~ ( c
                & d ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

tff(f1,conjecture,
    ( ( ( ( ~ a
          | ~ d
          | ~ c
          | ~ b )
        & p )
      | ( s
       => t ) )
   => ( ( s
       => t )
      | ( p
        & ( ~ ( b
              & a )
          | ~ ( c
              & d ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.sYvTfGnuzl/DTF2THF_24637.p',cARR_COM_DMG5) ).

tff(f44,plain,
    ( ( t = $true )
    | ~ spl0_6 ),
    inference(avatar_component_clause,[status(thm)],[f43]) ).

tff(f43,definition,
    ( spl0_6
  <=> ( t = $true ) ),
    introduced(definition,[new_symbols(naming,[spl0_6])],[avatar_definition]) ).

tff(f50,plain,
    ( ~ spl0_4
    | spl0_6
    | ~ spl0_5
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(avatar_split_clause,[status(thm)],[f20,f30,f26,f38,f43,f34]) ).

tff(f34,definition,
    ( spl0_4
  <=> ( c = $true ) ),
    introduced(definition,[new_symbols(naming,[spl0_4])],[avatar_definition]) ).

tff(f38,definition,
    ( spl0_5
  <=> ( b = $true ) ),
    introduced(definition,[new_symbols(naming,[spl0_5])],[avatar_definition]) ).

tff(f26,definition,
    ( spl0_2
  <=> ( a = $true ) ),
    introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition]) ).

tff(f30,definition,
    ( spl0_3
  <=> ( d = $true ) ),
    introduced(definition,[new_symbols(naming,[spl0_3])],[avatar_definition]) ).

tff(f20,plain,
    ( ( b != $true )
    | ( c != $true )
    | ( a != $true )
    | ( d != $true )
    | ( t = $true ) ),
    inference(trivial_inequality_removal,[status(thm)],[f19]) ).

tff(f19,plain,
    ( ( $true != $true )
    | ( b != $true )
    | ( c != $true )
    | ( d != $true )
    | ( t = $true )
    | ( a != $true ) ),
    inference(definition_unfolding,[status(thm)],[f11,f17]) ).

tff(f17,plain,
    s = $true,
    inference(cnf_transformation,[status(thm)],[f9]) ).

tff(f11,plain,
    ( ( t = $true )
    | ( s != $true )
    | ( a != $true )
    | ( c != $true )
    | ( d != $true )
    | ( b != $true ) ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

tff(f45,plain,
    ( spl0_1
    | spl0_6 ),
    inference(avatar_split_clause,[status(thm)],[f21,f43,f23]) ).

tff(f23,definition,
    ( spl0_1
  <=> ( p = $true ) ),
    introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition]) ).

tff(f21,plain,
    ( ( p = $true )
    | ( t = $true ) ),
    inference(trivial_inequality_removal,[status(thm)],[f18]) ).

tff(f18,plain,
    ( ( p = $true )
    | ( t = $true )
    | ( $true != $true ) ),
    inference(definition_unfolding,[status(thm)],[f12,f17]) ).

tff(f12,plain,
    ( ( t = $true )
    | ( s != $true )
    | ( p = $true ) ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

tff(f40,plain,
    ( spl0_5
    | ~ spl0_1 ),
    inference(avatar_split_clause,[status(thm)],[f16,f23,f38]) ).

tff(f16,plain,
    ( ( b = $true )
    | ( p != $true ) ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

tff(f36,plain,
    ( spl0_4
    | ~ spl0_1 ),
    inference(avatar_split_clause,[status(thm)],[f14,f23,f34]) ).

tff(f14,plain,
    ( ( p != $true )
    | ( c = $true ) ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

tff(f32,plain,
    ( ~ spl0_1
    | spl0_3 ),
    inference(avatar_split_clause,[status(thm)],[f13,f30,f23]) ).

tff(f13,plain,
    ( ( d = $true )
    | ( p != $true ) ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

tff(f28,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[status(thm)],[f15,f26,f23]) ).

tff(f15,plain,
    ( ( p != $true )
    | ( a = $true ) ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYO088^5 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.34  % Computer : n029.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 14:24:14 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.46  ---- Original DTF file ---
% 0.21/0.46  thf(spec,logic,$$dhol).
% 0.21/0.46  %------------------------------------------------------------------------------
% 0.21/0.46  % File     : SYO088^5 : TPTP v9.2.1. Released v4.0.0.
% 0.21/0.46  % Domain   : Syntactic
% 0.21/0.46  % Problem  : TPS problem ARR-COM-DMG5
% 0.21/0.46  % Version  : Especial.
% 0.21/0.46  % English  : A propositional problem suggested by Jay Hunschel Kim.
% 0.21/0.46  
% 0.21/0.46  % Refs     : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.21/0.46  % Source   : [Bro09]
% 0.21/0.46  % Names    : tps_0153 [Bro09]
% 0.21/0.46  %          : ARR-COM-DMG5 [TPS]
% 0.21/0.46  
% 0.21/0.46  % Status   : Theorem
% 0.21/0.46  % Rating   : 0.17 v9.1.0, 0.12 v9.0.0, 0.17 v8.2.0, 0.18 v8.1.0, 0.08 v7.4.0, 0.11 v7.3.0, 0.10 v7.2.0, 0.12 v7.1.0, 0.14 v7.0.0, 0.12 v6.4.0, 0.14 v6.3.0, 0.17 v6.0.0, 0.00 v4.0.0
% 0.21/0.46  % Syntax   : Number of formulae    :    8 (   0 unt;   7 typ;   0 def)
% 0.21/0.46  %            Number of atoms       :   14 (   0 equ;   0 cnn)
% 0.21/0.46  %            Maximal formula atoms :   14 (  14 avg)
% 0.21/0.46  %            Number of connectives :   19 (   6   ~;   6   |;   4   &;   0   @)
% 0.21/0.46  %                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
% 0.21/0.46  %            Maximal formula depth :    8 (   8 avg)
% 0.21/0.46  %            Number of types       :    1 (   0 usr)
% 0.21/0.46  %            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
% 0.21/0.46  %            Number of symbols     :    7 (   7 usr;   7 con; 0-0 aty)
% 0.21/0.46  %            Number of variables   :    0 (   0   ^;   0   !;   0   ?;   0   :)
% 0.21/0.46  % SPC      : TH0_THM_NEQ_NAR
% 0.21/0.46  
% 0.21/0.46  % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.21/0.46  %            project in the Department of Mathematical Sciences at Carnegie
% 0.21/0.46  %            Mellon University. Distributed under the Creative Commons copyleft
% 0.21/0.46  %            license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.21/0.46  %------------------------------------------------------------------------------
% 0.21/0.46  thf(t,type,
% 0.21/0.46      t: $o ).
% 0.21/0.46  
% 0.21/0.46  thf(s,type,
% 0.21/0.46      s: $o ).
% 0.21/0.46  
% 0.21/0.46  thf(p,type,
% 0.21/0.46      p: $o ).
% 0.21/0.46  
% 0.21/0.46  thf(d,type,
% 0.21/0.46      d: $o ).
% 0.21/0.46  
% 0.21/0.46  thf(c,type,
% 0.21/0.46      c: $o ).
% 0.21/0.46  
% 0.21/0.46  thf(b,type,
% 0.21/0.46      b: $o ).
% 0.21/0.46  
% 0.21/0.46  thf(a,type,
% 0.21/0.46      a: $o ).
% 0.21/0.46  
% 0.21/0.46  thf(cARR_COM_DMG5,conjecture,
% 0.21/0.46      ( ( ( p
% 0.21/0.46          & ( ~ a
% 0.21/0.46            | ~ b
% 0.21/0.46            | ~ c
% 0.21/0.46            | ~ d ) )
% 0.21/0.46        | ( s
% 0.21/0.46         => t ) )
% 0.21/0.46     => ( ( ( ~ ( a
% 0.21/0.46                & b )
% 0.21/0.46            | ~ ( c
% 0.21/0.46                & d ) )
% 0.21/0.46          & p )
% 0.21/0.46        | ( s
% 0.21/0.46         => t ) ) ) ).
% 0.21/0.46  
% 0.21/0.46  %------------------------------------------------------------------------------
% 0.21/0.46  ------------------------
% 1.46/1.27  ---- Embedded in THF ---
% 1.46/1.27  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.46/1.27  %%% Generated on Tue Feb 24 14:24:15 EST 2026
% 1.46/1.27  %%% using '$$dhol' embedding, version 1.3.0.
% 1.46/1.27  %%% Logic specification used:
% 1.46/1.27  %%% thf(spec, logic, $$dhol).
% 1.46/1.27  
% 1.46/1.27  % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.sYvTfGnuzl/DTF2DTF24637.p
% See solution above
% 1.46/1.27  ------------------------
% 1.46/1.28  ---- Cleaned THF ---
% 1.46/1.28  thf(t,type,
% 1.46/1.28      t: $o ).
% 1.46/1.28  
% 1.46/1.28  thf(s,type,
% 1.46/1.28      s: $o ).
% 1.46/1.28  
% 1.46/1.28  thf(p,type,
% 1.46/1.28      p: $o ).
% 1.46/1.28  
% 1.46/1.28  thf(d,type,
% 1.46/1.28      d: $o ).
% 1.46/1.28  
% 1.46/1.28  thf(c,type,
% 1.46/1.28      c: $o ).
% 1.46/1.28  
% 1.46/1.28  thf(b,type,
% 1.46/1.28      b: $o ).
% 1.46/1.28  
% 1.46/1.28  thf(a,type,
% 1.46/1.28      a: $o ).
% 1.46/1.28  
% 1.46/1.28  thf(cARR_COM_DMG5,conjecture,
% 1.46/1.28      ( ( ( p
% 1.46/1.28          & ( ~ a
% 1.46/1.28            | ~ b
% 1.46/1.28            | ~ c
% 1.46/1.28            | ~ d ) )
% 1.46/1.28        | ( s
% 1.46/1.28         => t ) )
% 1.46/1.28     => ( ( ( ~ ( a
% 1.46/1.28                & b )
% 1.46/1.28            | ~ ( c
% 1.46/1.28                & d ) )
% 1.46/1.28          & p )
% 1.46/1.28        | ( s
% 1.46/1.28         => t ) ) ) ).
% 1.46/1.28  ------------------------
% 1.46/1.29  % (24968)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_24637 for (2999ds/2Mi)
% 1.46/1.29  % (24968)First to succeed.
% 1.46/1.30  % (24968)Refutation found. Thanks to Tanya!
% 1.46/1.30  % SZS status Theorem for DTF2THF_24637
% 1.46/1.30  % SZS output start Proof for DTF2THF_24637
% 1.46/1.30  tff(f53,plain,(
% 1.46/1.30    $false),
% 1.46/1.30    inference(avatar_sat_refutation,[status(thm)],[f28,f32,f36,f40,f45,f50,f52])).
% 1.46/1.30  tff(f52,plain,(
% 1.46/1.30    ~spl0_6),
% 1.46/1.30    inference(avatar_contradiction_clause,[status(thm)],[f51])).
% 1.46/1.30  tff(f51,plain,(
% 1.46/1.30    $false | ~spl0_6),
% 1.46/1.30    inference(subsumption_resolution,[status(thm)],[f44,f10])).
% 1.46/1.30  tff(f10,plain,(
% 1.46/1.30    (t != $true)),
% 1.46/1.30    inference(cnf_transformation,[status(thm)],[f9])).
% 1.46/1.30  tff(f9,plain,(
% 1.46/1.30    (s = $true) & (((b = $true) & (a = $true) & (c = $true) & (d = $true)) | (p != $true)) & ((t = $true) | (s != $true) | ((p = $true) & ((a != $true) | (c != $true) | (d != $true) | (b != $true)))) & (t != $true)),
% 1.46/1.30    inference(flattening,[status(thm)],[f8])).
% 1.46/1.30  tff(f8,plain,(
% 1.46/1.30    (((t != $true) & (s = $true)) & ((((d = $true) & (c = $true)) & ((a = $true) & (b = $true))) | (p != $true))) & (((t = $true) | (s != $true)) | ((p = $true) & ((a != $true) | (c != $true) | (d != $true) | (b != $true))))),
% 1.46/1.30    inference(ennf_transformation,[status(thm)],[f7])).
% 1.46/1.30  tff(f7,plain,(
% 1.46/1.30    ~((((s = $true) => (t = $true)) | ((p = $true) & ((a != $true) | (c != $true) | (d != $true) | (b != $true)))) => (((s = $true) => (t = $true)) | ((~((d = $true) & (c = $true)) | ~((a = $true) & (b = $true))) & (p = $true))))),
% 1.46/1.30    inference(flattening,[status(thm)],[f6])).
% 1.46/1.30  tff(f6,plain,(
% 1.46/1.30    ~((((~(a = $true) | ~(d = $true) | ~(c = $true) | ~(b = $true)) & (p = $true)) | ((s = $true) => (t = $true))) => (((s = $true) => (t = $true)) | ((~((d = $true) & (c = $true)) | ~((a = $true) & (b = $true))) & (p = $true))))),
% 1.46/1.30    inference(fool_elimination,[status(thm)],[f5])).
% 1.46/1.30  tff(f5,plain,(
% 1.46/1.30    ~((((~a | ~d | ~c | ~b) & p) | (s => t)) => ((s => t) | (p & (~(b & a) | ~(c & d)))))),
% 1.46/1.30    inference(rectify,[status(thm)],[f2])).
% 1.46/1.30  tff(f2,negated_conjecture,(
% 1.46/1.30    ~((((~a | ~d | ~c | ~b) & p) | (s => t)) => ((s => t) | (p & (~(b & a) | ~(c & d)))))),
% 1.46/1.30    inference(negated_conjecture,[status(cth)],[f1])).
% 1.46/1.30  tff(f1,conjecture,(
% 1.46/1.30    (((~a | ~d | ~c | ~b) & p) | (s => t)) => ((s => t) | (p & (~(b & a) | ~(c & d))))),
% 1.46/1.30    file('/export/starexec/sandbox/tmp/tmp.sYvTfGnuzl/DTF2THF_24637.p',cARR_COM_DMG5)).
% 1.46/1.30  tff(f44,plain,(
% 1.46/1.30    (t = $true) | ~spl0_6),
% 1.46/1.30    inference(avatar_component_clause,[status(thm)],[f43])).
% 1.46/1.30  tff(f43,definition,(
% 1.46/1.30    spl0_6 <=> (t = $true)),
% 1.46/1.30    introduced(definition,[new_symbols(naming,[spl0_6])],[avatar_definition])).
% 1.46/1.30  tff(f50,plain,(
% 1.46/1.30    ~spl0_4 | spl0_6 | ~spl0_5 | ~spl0_2 | ~spl0_3),
% 1.46/1.30    inference(avatar_split_clause,[status(thm)],[f20,f30,f26,f38,f43,f34])).
% 1.46/1.30  tff(f34,definition,(
% 1.46/1.30    spl0_4 <=> (c = $true)),
% 1.46/1.30    introduced(definition,[new_symbols(naming,[spl0_4])],[avatar_definition])).
% 1.46/1.30  tff(f38,definition,(
% 1.46/1.30    spl0_5 <=> (b = $true)),
% 1.46/1.30    introduced(definition,[new_symbols(naming,[spl0_5])],[avatar_definition])).
% 1.46/1.30  tff(f26,definition,(
% 1.46/1.30    spl0_2 <=> (a = $true)),
% 1.46/1.30    introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition])).
% 1.46/1.30  tff(f30,definition,(
% 1.46/1.30    spl0_3 <=> (d = $true)),
% 1.46/1.30    introduced(definition,[new_symbols(naming,[spl0_3])],[avatar_definition])).
% 1.46/1.30  tff(f20,plain,(
% 1.46/1.30    (b != $true) | (c != $true) | (a != $true) | (d != $true) | (t = $true)),
% 1.46/1.30    inference(trivial_inequality_removal,[status(thm)],[f19])).
% 1.46/1.30  tff(f19,plain,(
% 1.46/1.30    ($true != $true) | (b != $true) | (c != $true) | (d != $true) | (t = $true) | (a != $true)),
% 1.46/1.30    inference(definition_unfolding,[status(thm)],[f11,f17])).
% 1.46/1.30  tff(f17,plain,(
% 1.46/1.30    (s = $true)),
% 1.46/1.30    inference(cnf_transformation,[status(thm)],[f9])).
% 1.46/1.30  tff(f11,plain,(
% 1.46/1.30    (t = $true) | (s != $true) | (a != $true) | (c != $true) | (d != $true) | (b != $true)),
% 1.46/1.30    inference(cnf_transformation,[status(thm)],[f9])).
% 1.46/1.30  tff(f45,plain,(
% 1.46/1.30    spl0_1 | spl0_6),
% 1.46/1.30    inference(avatar_split_clause,[status(thm)],[f21,f43,f23])).
% 1.46/1.30  tff(f23,definition,(
% 1.46/1.30    spl0_1 <=> (p = $true)),
% 1.46/1.30    introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition])).
% 1.46/1.30  tff(f21,plain,(
% 1.46/1.30    (p = $true) | (t = $true)),
% 1.46/1.30    inference(trivial_inequality_removal,[status(thm)],[f18])).
% 1.46/1.30  tff(f18,plain,(
% 1.46/1.30    (p = $true) | (t = $true) | ($true != $true)),
% 1.46/1.30    inference(definition_unfolding,[status(thm)],[f12,f17])).
% 1.46/1.30  tff(f12,plain,(
% 1.46/1.30    (t = $true) | (s != $true) | (p = $true)),
% 1.46/1.30    inference(cnf_transformation,[status(thm)],[f9])).
% 1.46/1.30  tff(f40,plain,(
% 1.46/1.30    spl0_5 | ~spl0_1),
% 1.46/1.30    inference(avatar_split_clause,[status(thm)],[f16,f23,f38])).
% 1.46/1.30  tff(f16,plain,(
% 1.46/1.30    (b = $true) | (p != $true)),
% 1.46/1.30    inference(cnf_transformation,[status(thm)],[f9])).
% 1.46/1.30  tff(f36,plain,(
% 1.46/1.30    spl0_4 | ~spl0_1),
% 1.46/1.30    inference(avatar_split_clause,[status(thm)],[f14,f23,f34])).
% 1.46/1.30  tff(f14,plain,(
% 1.46/1.30    (p != $true) | (c = $true)),
% 1.46/1.30    inference(cnf_transformation,[status(thm)],[f9])).
% 1.46/1.30  tff(f32,plain,(
% 1.46/1.30    ~spl0_1 | spl0_3),
% 1.46/1.30    inference(avatar_split_clause,[status(thm)],[f13,f30,f23])).
% 1.46/1.30  tff(f13,plain,(
% 1.46/1.30    (d = $true) | (p != $true)),
% 1.46/1.30    inference(cnf_transformation,[status(thm)],[f9])).
% 1.46/1.30  tff(f28,plain,(
% 1.46/1.30    ~spl0_1 | spl0_2),
% 1.46/1.30    inference(avatar_split_clause,[status(thm)],[f15,f26,f23])).
% 1.46/1.30  tff(f15,plain,(
% 1.46/1.30    (p != $true) | (a = $true)),
% 1.46/1.30    inference(cnf_transformation,[status(thm)],[f9])).
% 1.46/1.30  % SZS output end Proof for DTF2THF_24637
% 1.46/1.30  % (24968)------------------------------
% 1.46/1.30  % (24968)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.46/1.30  % (24968)Termination reason: Refutation
% 1.46/1.30  
% 1.46/1.30  % (24968)Memory used [KB]: 5500
% 1.46/1.30  % (24968)Time elapsed: 0.003 s
% 1.46/1.30  % (24968)Instructions burned: 1 (million)
% 1.46/1.30  % (24968)------------------------------
% 1.46/1.30  % (24968)------------------------------
% 1.46/1.30  % (24963)Success in time 0.012 s
%------------------------------------------------------------------------------