↑ Up

Leo-III---1.8.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Leo-III---1.8.0
% Problem  : LCL495+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 07:51:57 AM UTC 2026

% Result   : Theorem 67.04s 24.44s
% Output   : Refutation 67.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   49
% Syntax   : Number of formulae    :  131 (  40 unt;   0 typ;   4 def)
%            Number of atoms       :  370 (  56 equ;   0 cnn)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives : 1226 (  80   ~;  77   |;  36   &; 935   @)
%                                         (  26 <=>;  72  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   44 (  41 usr;  37 con; 0-2 aty)
%            Number of variables   :  275 (   0   ^; 271   !;   0   ?; 275   :)
%                                         (   0  !>;   0  ?*;   0  @-;   4  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(equivalence_3_decl,type,
    equivalence_3: $o ).

thf(op_implies_or_decl,type,
    op_implies_or: $o ).

thf(op_and_decl,type,
    op_and: $o ).

thf(op_implies_and_decl,type,
    op_implies_and: $o ).

thf(op_or_decl,type,
    op_or: $o ).

thf(op_equiv_decl,type,
    op_equiv: $o ).

thf(substitution_of_equivalents_decl,type,
    substitution_of_equivalents: $o ).

thf(r3_decl,type,
    r3: $o ).

thf(r4_decl,type,
    r4: $o ).

thf(r2_decl,type,
    r2: $o ).

thf(r1_decl,type,
    r1: $o ).

thf(modus_ponens_decl,type,
    modus_ponens: $o ).

thf(or_decl,type,
    or: $i > $i > $i ).

thf(not_decl,type,
    not: $i > $i ).

thf(and_decl,type,
    and: $i > $i > $i ).

thf(implies_decl,type,
    implies: $i > $i > $i ).

thf(r5_decl,type,
    r5: $o ).

thf(equiv_decl,type,
    equiv: $i > $i > $i ).

thf(and_2_decl,type,
    and_2: $o ).

thf(is_a_theorem_decl,type,
    is_a_theorem: $i > $o ).

thf(modus_tollens_decl,type,
    modus_tollens: $o ).

thf(kn2_decl,type,
    kn2: $o ).

thf(or_3_decl,type,
    or_3: $o ).

thf(and_3_decl,type,
    and_3: $o ).

thf(kn1_decl,type,
    kn1: $o ).

thf(implies_3_decl,type,
    implies_3: $o ).

thf(equivalence_2_decl,type,
    equivalence_2: $o ).

thf(and_1_decl,type,
    and_1: $o ).

thf(implies_2_decl,type,
    implies_2: $o ).

thf(equivalence_1_decl,type,
    equivalence_1: $o ).

thf(implies_1_decl,type,
    implies_1: $o ).

thf(cn1_decl,type,
    cn1: $o ).

thf(cn2_decl,type,
    cn2: $o ).

thf(or_2_decl,type,
    or_2: $o ).

thf(kn3_decl,type,
    kn3: $o ).

thf(or_1_decl,type,
    or_1: $o ).

thf(cn3_decl,type,
    cn3: $o ).

thf(sk25_decl,type,
    sk25: $i ).

thf(sk26_decl,type,
    sk26: $i ).

thf(sk29_decl,type,
    sk29: $i ).

thf(sk30_decl,type,
    sk30: $i ).

thf(sk25_def,definition,
    ( sk25
    = ( @+[A: $i] :
          ~ ! [B: $i] :
              ( ( B @ ( A @ equiv ) @ is_a_theorem )
             => ( A = B ) ) ) ) ).

thf(sk26_def,definition,
    ( sk26
    = ( @+[A: $i] :
          ~ ( ( A @ ( sk25 @ equiv ) @ is_a_theorem )
           => ( sk25 = A ) ) ) ) ).

thf(sk29_def,definition,
    ( sk29
    = ( @+[A: $i] :
          ~ ! [B: $i] :
              ( ( ( B @ ( A @ implies ) @ is_a_theorem )
                & ( A @ is_a_theorem ) )
             => ( B @ is_a_theorem ) ) ) ) ).

thf(sk30_def,definition,
    ( sk30
    = ( @+[A: $i] :
          ~ ( ( ( A @ ( sk29 @ implies ) @ is_a_theorem )
              & ( sk29 @ is_a_theorem ) )
           => ( A @ is_a_theorem ) ) ) ) ).

thf(32,axiom,
    ( r1
  <=> ! [A: $i] : ( A @ ( A @ ( A @ or ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r1) ).

thf(120,plain,
    ( ( ! [A: $i] : ( A @ ( A @ ( A @ or ) @ implies ) @ is_a_theorem )
     => r1 )
    & ( r1
     => ! [A: $i] : ( A @ ( A @ ( A @ or ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[32]) ).

thf(33,axiom,
    ( substitution_of_equivalents
  <=> ! [A: $i,B: $i] :
        ( ( B @ ( A @ equiv ) @ is_a_theorem )
       => ( A = B ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',substitution_of_equivalents) ).

thf(124,plain,
    ( ( ! [A: $i,B: $i] :
          ( ( B @ ( A @ equiv ) @ is_a_theorem )
         => ( A = B ) )
     => substitution_of_equivalents )
    & ( substitution_of_equivalents
     => ! [A: $i,B: $i] :
          ( ( B @ ( A @ equiv ) @ is_a_theorem )
         => ( A = B ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[33]) ).

thf(125,plain,
    ! [B: $i,A: $i] :
      ( ( substitution_of_equivalents
        | ( sk25 != sk26 ) )
      & ( substitution_of_equivalents
        | ( sk26 @ ( sk25 @ equiv ) @ is_a_theorem ) )
      & ( ( A = B )
        | ~ ( B @ ( A @ equiv ) @ is_a_theorem )
        | ~ substitution_of_equivalents ) ),
    inference(cnf,[status(esa)],[124]) ).

thf(126,plain,
    ! [B: $i,A: $i] :
      ( ( A = B )
      | ~ ( B @ ( A @ equiv ) @ is_a_theorem )
      | ~ substitution_of_equivalents ),
    inference(cnfConj,[status(thm)],[125]) ).

thf(129,plain,
    ! [B: $i,A: $i] :
      ( ~ ( B @ ( A @ equiv ) @ is_a_theorem )
      | ~ substitution_of_equivalents
      | ( A = B ) ),
    inference(lifteq,[status(thm)],[126]) ).

thf(8,axiom,
    substitution_of_equivalents,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',use_substitution_of_equivalents) ).

thf(53,plain,
    substitution_of_equivalents,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(193,plain,
    ! [B: $i,A: $i] :
      ( ~ ( B @ ( A @ equiv ) @ is_a_theorem )
      | ~ $true
      | ( A = B ) ),
    inference(rewrite,[status(thm)],[129,53]) ).

thf(194,plain,
    ! [B: $i,A: $i] :
      ( ~ ( B @ ( A @ equiv ) @ is_a_theorem )
      | ( A = B ) ),
    inference(simp,[status(thm)],[193]) ).

thf(35,axiom,
    ( modus_ponens
  <=> ! [A: $i,B: $i] :
        ( ( ( B @ ( A @ implies ) @ is_a_theorem )
          & ( A @ is_a_theorem ) )
       => ( B @ is_a_theorem ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_ponens) ).

thf(135,plain,
    ( ( ! [A: $i,B: $i] :
          ( ( ( B @ ( A @ implies ) @ is_a_theorem )
            & ( A @ is_a_theorem ) )
         => ( B @ is_a_theorem ) )
     => modus_ponens )
    & ( modus_ponens
     => ! [A: $i,B: $i] :
          ( ( ( B @ ( A @ implies ) @ is_a_theorem )
            & ( A @ is_a_theorem ) )
         => ( B @ is_a_theorem ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[35]) ).

thf(136,plain,
    ! [B: $i,A: $i] :
      ( ( modus_ponens
        | ~ ( sk30 @ is_a_theorem ) )
      & ( modus_ponens
        | ( sk30 @ ( sk29 @ implies ) @ is_a_theorem ) )
      & ( modus_ponens
        | ( sk29 @ is_a_theorem ) )
      & ( ( B @ is_a_theorem )
        | ~ ( B @ ( A @ implies ) @ is_a_theorem )
        | ~ ( A @ is_a_theorem )
        | ~ modus_ponens ) ),
    inference(cnf,[status(esa)],[135]) ).

thf(137,plain,
    ! [B: $i,A: $i] :
      ( ( B @ is_a_theorem )
      | ~ ( B @ ( A @ implies ) @ is_a_theorem )
      | ~ ( A @ is_a_theorem )
      | ~ modus_ponens ),
    inference(cnfConj,[status(thm)],[136]) ).

thf(185,plain,
    ! [B: $i,A: $i] :
      ( ~ $true
      | ( ( B @ ( A @ implies ) @ is_a_theorem )
       != ( A @ is_a_theorem ) )
      | ( B @ is_a_theorem )
      | ~ ( A @ is_a_theorem )
      | ~ modus_ponens ),
    inference(eqfactor_ordered,[status(thm)],[137]) ).

thf(186,plain,
    ! [B: $i,A: $i] :
      ( ( ( B @ ( A @ implies ) @ is_a_theorem )
       != ( A @ is_a_theorem ) )
      | ~ ( A @ is_a_theorem )
      | ~ modus_ponens
      | ( B @ is_a_theorem ) ),
    inference(simp,[status(thm)],[185]) ).

thf(209,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ( B
       != ( D @ ( C @ implies ) ) )
      | ( ( A @ is_a_theorem )
       != ( C @ is_a_theorem ) )
      | ~ ( C @ is_a_theorem )
      | ~ modus_ponens
      | ( D @ is_a_theorem )
      | ~ ( B @ ( A @ equiv ) @ is_a_theorem ) ),
    inference(paramod_ordered,[status(thm)],[194,186]) ).

thf(210,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( ( A @ is_a_theorem )
       != ( B @ is_a_theorem ) )
      | ~ ( B @ is_a_theorem )
      | ~ modus_ponens
      | ( C @ is_a_theorem )
      | ~ ( C @ ( B @ implies ) @ ( A @ equiv ) @ is_a_theorem ) ),
    inference(pattern_uni,[status(thm)],[209:[bind(A,$thf( A )),bind(B,$thf( F @ ( E @ implies ) )),bind(C,$thf( E )),bind(D,$thf( F ))]]) ).

thf(212,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( ( A @ is_a_theorem )
       != ( B @ is_a_theorem ) )
      | ~ ( B @ is_a_theorem )
      | ~ modus_ponens
      | ( C @ is_a_theorem )
      | ~ ( C @ ( B @ implies ) @ ( A @ equiv ) @ is_a_theorem ) ),
    inference(simp,[status(thm)],[210]) ).

thf(16,axiom,
    ( op_implies_or
   => ! [A: $i,B: $i] :
        ( ( B @ ( A @ implies ) )
        = ( B @ ( A @ not @ or ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_or) ).

thf(63,plain,
    ( op_implies_or
   => ! [A: $i,B: $i] :
        ( ( B @ ( A @ implies ) )
        = ( B @ ( A @ not @ or ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).

thf(64,plain,
    ! [B: $i,A: $i] :
      ( ( ( B @ ( A @ implies ) )
        = ( B @ ( A @ not @ or ) ) )
      | ~ op_implies_or ),
    inference(cnf,[status(esa)],[63]) ).

thf(65,plain,
    ! [B: $i,A: $i] :
      ( ~ op_implies_or
      | ( ( B @ ( A @ implies ) )
        = ( B @ ( A @ not @ or ) ) ) ),
    inference(lifteq,[status(thm)],[64]) ).

thf(3,axiom,
    op_implies_or,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_implies_or) ).

thf(48,plain,
    op_implies_or,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(898,plain,
    ! [B: $i,A: $i] :
      ( ~ $true
      | ( ( B @ ( A @ implies ) )
        = ( B @ ( A @ not @ or ) ) ) ),
    inference(rewrite,[status(thm)],[65,48]) ).

thf(899,plain,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ implies ) )
      = ( B @ ( A @ not @ or ) ) ),
    inference(simp,[status(thm)],[898]) ).

thf(14,axiom,
    modus_ponens,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_modus_ponens) ).

thf(59,plain,
    modus_ponens,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).

thf(1966,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( ( A @ is_a_theorem )
       != ( B @ is_a_theorem ) )
      | ~ ( B @ is_a_theorem )
      | ~ $true
      | ( C @ is_a_theorem )
      | ~ ( C @ ( B @ not @ or ) @ ( A @ equiv ) @ is_a_theorem ) ),
    inference(rewrite,[status(thm)],[212,899,59]) ).

thf(1967,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( ( A @ is_a_theorem )
       != ( B @ is_a_theorem ) )
      | ~ ( B @ is_a_theorem )
      | ( C @ is_a_theorem )
      | ~ ( C @ ( B @ not @ or ) @ ( A @ equiv ) @ is_a_theorem ) ),
    inference(simp,[status(thm)],[1966]) ).

thf(12,axiom,
    op_equiv,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_equiv) ).

thf(57,plain,
    op_equiv,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).

thf(23,axiom,
    ( kn2
  <=> ! [A: $i,B: $i] : ( A @ ( B @ ( A @ and ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn2) ).

thf(84,plain,
    ( ( ! [A: $i,B: $i] : ( A @ ( B @ ( A @ and ) @ implies ) @ is_a_theorem )
     => kn2 )
    & ( kn2
     => ! [A: $i,B: $i] : ( A @ ( B @ ( A @ and ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[23]) ).

thf(31,axiom,
    ( implies_2
  <=> ! [A: $i,B: $i] : ( B @ ( A @ implies ) @ ( B @ ( A @ implies ) @ ( A @ implies ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_2) ).

thf(116,plain,
    ( ( ! [A: $i,B: $i] : ( B @ ( A @ implies ) @ ( B @ ( A @ implies ) @ ( A @ implies ) @ implies ) @ is_a_theorem )
     => implies_2 )
    & ( implies_2
     => ! [A: $i,B: $i] : ( B @ ( A @ implies ) @ ( B @ ( A @ implies ) @ ( A @ implies ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[31]) ).

thf(20,axiom,
    ( op_equiv
   => ! [A: $i,B: $i] :
        ( ( B @ ( A @ equiv ) )
        = ( A @ ( B @ implies ) @ ( B @ ( A @ implies ) @ and ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_equiv) ).

thf(73,plain,
    ( op_equiv
   => ! [A: $i,B: $i] :
        ( ( B @ ( A @ equiv ) )
        = ( A @ ( B @ implies ) @ ( B @ ( A @ implies ) @ and ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[20]) ).

thf(21,axiom,
    ( and_2
  <=> ! [A: $i,B: $i] : ( B @ ( B @ ( A @ and ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_2) ).

thf(76,plain,
    ( ( ! [A: $i,B: $i] : ( B @ ( B @ ( A @ and ) @ implies ) @ is_a_theorem )
     => and_2 )
    & ( and_2
     => ! [A: $i,B: $i] : ( B @ ( B @ ( A @ and ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[21]) ).

thf(28,axiom,
    ( implies_3
  <=> ! [A: $i,B: $i,C: $i] : ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_3) ).

thf(104,plain,
    ( ( ! [A: $i,B: $i,C: $i] : ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem )
     => implies_3 )
    & ( implies_3
     => ! [A: $i,B: $i,C: $i] : ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[28]) ).

thf(10,axiom,
    r4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r4) ).

thf(55,plain,
    r4,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).

thf(6,axiom,
    op_or,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_or) ).

thf(51,plain,
    op_or,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(27,axiom,
    ( kn1
  <=> ! [A: $i] : ( A @ ( A @ and ) @ ( A @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn1) ).

thf(100,plain,
    ( ( ! [A: $i] : ( A @ ( A @ and ) @ ( A @ implies ) @ is_a_theorem )
     => kn1 )
    & ( kn1
     => ! [A: $i] : ( A @ ( A @ and ) @ ( A @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[27]) ).

thf(18,axiom,
    r5,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r5) ).

thf(69,plain,
    r5,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).

thf(24,axiom,
    ( or_3
  <=> ! [A: $i,B: $i,C: $i] : ( C @ ( B @ ( A @ or ) @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( C @ ( A @ implies ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_3) ).

thf(88,plain,
    ( ( ! [A: $i,B: $i,C: $i] : ( C @ ( B @ ( A @ or ) @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( C @ ( A @ implies ) @ implies ) @ is_a_theorem )
     => or_3 )
    & ( or_3
     => ! [A: $i,B: $i,C: $i] : ( C @ ( B @ ( A @ or ) @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( C @ ( A @ implies ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[24]) ).

thf(11,axiom,
    r2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r2) ).

thf(56,plain,
    r2,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).

thf(39,axiom,
    ( cn2
  <=> ! [A: $i,B: $i] : ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn2) ).

thf(153,plain,
    ( ( ! [A: $i,B: $i] : ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
     => cn2 )
    & ( cn2
     => ! [A: $i,B: $i] : ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[39]) ).

thf(7,axiom,
    op_equiv,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_equiv) ).

thf(52,plain,
    op_equiv,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(40,axiom,
    ( or_2
  <=> ! [A: $i,B: $i] : ( B @ ( A @ or ) @ ( B @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_2) ).

thf(157,plain,
    ( ( ! [A: $i,B: $i] : ( B @ ( A @ or ) @ ( B @ implies ) @ is_a_theorem )
     => or_2 )
    & ( or_2
     => ! [A: $i,B: $i] : ( B @ ( A @ or ) @ ( B @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[40]) ).

thf(15,axiom,
    ( op_or
   => ! [A: $i,B: $i] :
        ( ( B @ ( A @ or ) )
        = ( B @ not @ ( A @ not @ and ) @ not ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_or) ).

thf(60,plain,
    ( op_or
   => ! [A: $i,B: $i] :
        ( ( B @ ( A @ or ) )
        = ( B @ not @ ( A @ not @ and ) @ not ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).

thf(61,plain,
    ! [B: $i,A: $i] :
      ( ( ( B @ ( A @ or ) )
        = ( B @ not @ ( A @ not @ and ) @ not ) )
      | ~ op_or ),
    inference(cnf,[status(esa)],[60]) ).

thf(62,plain,
    ! [B: $i,A: $i] :
      ( ~ op_or
      | ( ( B @ ( A @ or ) )
        = ( B @ not @ ( A @ not @ and ) @ not ) ) ),
    inference(lifteq,[status(thm)],[61]) ).

thf(226,plain,
    ! [B: $i,A: $i] :
      ( ~ $true
      | ( ( B @ ( A @ or ) )
        = ( B @ not @ ( A @ not @ and ) @ not ) ) ),
    inference(rewrite,[status(thm)],[62,51]) ).

thf(227,plain,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ or ) )
      = ( B @ not @ ( A @ not @ and ) @ not ) ),
    inference(simp,[status(thm)],[226]) ).

thf(17,axiom,
    ( op_and
   => ! [A: $i,B: $i] :
        ( ( B @ ( A @ and ) )
        = ( B @ not @ ( A @ not @ or ) @ not ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_and) ).

thf(66,plain,
    ( op_and
   => ! [A: $i,B: $i] :
        ( ( B @ ( A @ and ) )
        = ( B @ not @ ( A @ not @ or ) @ not ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).

thf(67,plain,
    ! [B: $i,A: $i] :
      ( ( ( B @ ( A @ and ) )
        = ( B @ not @ ( A @ not @ or ) @ not ) )
      | ~ op_and ),
    inference(cnf,[status(esa)],[66]) ).

thf(68,plain,
    ! [B: $i,A: $i] :
      ( ~ op_and
      | ( ( B @ ( A @ and ) )
        = ( B @ not @ ( A @ not @ or ) @ not ) ) ),
    inference(lifteq,[status(thm)],[67]) ).

thf(4,axiom,
    op_and,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_and) ).

thf(49,plain,
    op_and,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(2199,plain,
    ! [B: $i,A: $i] :
      ( ~ $true
      | ( ( B @ ( A @ and ) )
        = ( B @ not @ ( A @ not @ or ) @ not ) ) ),
    inference(rewrite,[status(thm)],[68,49]) ).

thf(2200,plain,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ and ) )
      = ( B @ not @ ( A @ not @ or ) @ not ) ),
    inference(simp,[status(thm)],[2199]) ).

thf(2204,plain,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ or ) )
      = ( B @ not @ not @ ( A @ not @ not @ or ) @ not @ not ) ),
    inference(rewrite,[status(thm)],[227,2200]) ).

thf(19,axiom,
    ( op_implies_and
   => ! [A: $i,B: $i] :
        ( ( B @ ( A @ implies ) )
        = ( B @ not @ ( A @ and ) @ not ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_and) ).

thf(70,plain,
    ( op_implies_and
   => ! [A: $i,B: $i] :
        ( ( B @ ( A @ implies ) )
        = ( B @ not @ ( A @ and ) @ not ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[19]) ).

thf(42,axiom,
    ( or_1
  <=> ! [A: $i,B: $i] : ( B @ ( A @ or ) @ ( A @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_1) ).

thf(165,plain,
    ( ( ! [A: $i,B: $i] : ( B @ ( A @ or ) @ ( A @ implies ) @ is_a_theorem )
     => or_1 )
    & ( or_1
     => ! [A: $i,B: $i] : ( B @ ( A @ or ) @ ( A @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[42]) ).

thf(25,axiom,
    ( and_3
  <=> ! [A: $i,B: $i] : ( B @ ( A @ and ) @ ( B @ implies ) @ ( A @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_3) ).

thf(92,plain,
    ( ( ! [A: $i,B: $i] : ( B @ ( A @ and ) @ ( B @ implies ) @ ( A @ implies ) @ is_a_theorem )
     => and_3 )
    & ( and_3
     => ! [A: $i,B: $i] : ( B @ ( A @ and ) @ ( B @ implies ) @ ( A @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[25]) ).

thf(43,axiom,
    ( r4
  <=> ! [A: $i,B: $i,C: $i] : ( C @ ( A @ or ) @ ( B @ or ) @ ( C @ ( B @ or ) @ ( A @ or ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r4) ).

thf(169,plain,
    ( ( ! [A: $i,B: $i,C: $i] : ( C @ ( A @ or ) @ ( B @ or ) @ ( C @ ( B @ or ) @ ( A @ or ) @ implies ) @ is_a_theorem )
     => r4 )
    & ( r4
     => ! [A: $i,B: $i,C: $i] : ( C @ ( A @ or ) @ ( B @ or ) @ ( C @ ( B @ or ) @ ( A @ or ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[43]) ).

thf(36,axiom,
    ( equivalence_1
  <=> ! [A: $i,B: $i] : ( B @ ( A @ implies ) @ ( B @ ( A @ equiv ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalence_1) ).

thf(141,plain,
    ( ( ! [A: $i,B: $i] : ( B @ ( A @ implies ) @ ( B @ ( A @ equiv ) @ implies ) @ is_a_theorem )
     => equivalence_1 )
    & ( equivalence_1
     => ! [A: $i,B: $i] : ( B @ ( A @ implies ) @ ( B @ ( A @ equiv ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[36]) ).

thf(26,axiom,
    ( r2
  <=> ! [A: $i,B: $i] : ( B @ ( A @ or ) @ ( B @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r2) ).

thf(96,plain,
    ( ( ! [A: $i,B: $i] : ( B @ ( A @ or ) @ ( B @ implies ) @ is_a_theorem )
     => r2 )
    & ( r2
     => ! [A: $i,B: $i] : ( B @ ( A @ or ) @ ( B @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[26]) ).

thf(2221,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ( ( B @ ( A @ or ) )
       != ( D @ not @ not @ ( C @ not @ not @ or ) ) )
      | ( ( B @ not @ not @ ( A @ not @ not @ or ) @ not @ not @ not @ not )
        = ( D @ ( C @ or ) ) ) ),
    inference(paramod_ordered,[status(thm)],[2204,2204]) ).

thf(2222,plain,
    ! [B: $i,A: $i] :
      ( ( B @ not @ not @ not @ not @ ( A @ not @ not @ not @ not @ or ) @ not @ not @ not @ not )
      = ( B @ ( A @ or ) ) ),
    inference(pattern_uni,[status(thm)],[2221:[bind(A,$thf( F @ not @ not )),bind(B,$thf( H @ not @ not )),bind(C,$thf( F )),bind(D,$thf( H ))]]) ).

thf(2285,plain,
    ! [B: $i,A: $i] :
      ( ( B @ not @ not @ not @ not @ ( A @ not @ not @ not @ not @ or ) @ not @ not @ not @ not )
      = ( B @ ( A @ or ) ) ),
    inference(simp,[status(thm)],[2222]) ).

thf(44,axiom,
    ( cn3
  <=> ! [A: $i] : ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn3) ).

thf(173,plain,
    ( ( ! [A: $i] : ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
     => cn3 )
    & ( cn3
     => ! [A: $i] : ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[44]) ).

thf(41,axiom,
    ( kn3
  <=> ! [A: $i,B: $i,C: $i] : ( A @ ( C @ and ) @ not @ ( C @ ( B @ and ) @ not @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn3) ).

thf(161,plain,
    ( ( ! [A: $i,B: $i,C: $i] : ( A @ ( C @ and ) @ not @ ( C @ ( B @ and ) @ not @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem )
     => kn3 )
    & ( kn3
     => ! [A: $i,B: $i,C: $i] : ( A @ ( C @ and ) @ not @ ( C @ ( B @ and ) @ not @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[41]) ).

thf(38,axiom,
    ( cn1
  <=> ! [A: $i,B: $i,C: $i] : ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn1) ).

thf(149,plain,
    ( ( ! [A: $i,B: $i,C: $i] : ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem )
     => cn1 )
    & ( cn1
     => ! [A: $i,B: $i,C: $i] : ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[38]) ).

thf(9,axiom,
    r3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r3) ).

thf(54,plain,
    r3,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(46,axiom,
    ( equivalence_3
  <=> ! [A: $i,B: $i] : ( B @ ( A @ equiv ) @ ( A @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalence_3) ).

thf(181,plain,
    ( ( ! [A: $i,B: $i] : ( B @ ( A @ equiv ) @ ( A @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem )
     => equivalence_3 )
    & ( equivalence_3
     => ! [A: $i,B: $i] : ( B @ ( A @ equiv ) @ ( A @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[46]) ).

thf(29,axiom,
    ( equivalence_2
  <=> ! [A: $i,B: $i] : ( A @ ( B @ implies ) @ ( B @ ( A @ equiv ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalence_2) ).

thf(108,plain,
    ( ( ! [A: $i,B: $i] : ( A @ ( B @ implies ) @ ( B @ ( A @ equiv ) @ implies ) @ is_a_theorem )
     => equivalence_2 )
    & ( equivalence_2
     => ! [A: $i,B: $i] : ( A @ ( B @ implies ) @ ( B @ ( A @ equiv ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[29]) ).

thf(22,axiom,
    ( modus_tollens
  <=> ! [A: $i,B: $i] : ( B @ ( A @ implies ) @ ( A @ not @ ( B @ not @ implies ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_tollens) ).

thf(80,plain,
    ( ( ! [A: $i,B: $i] : ( B @ ( A @ implies ) @ ( A @ not @ ( B @ not @ implies ) @ implies ) @ is_a_theorem )
     => modus_tollens )
    & ( modus_tollens
     => ! [A: $i,B: $i] : ( B @ ( A @ implies ) @ ( A @ not @ ( B @ not @ implies ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[22]) ).

thf(207,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ( A
       != ( D @ ( C @ implies ) ) )
      | ( ( B @ is_a_theorem )
       != ( C @ is_a_theorem ) )
      | ~ ( C @ is_a_theorem )
      | ~ modus_ponens
      | ( D @ is_a_theorem )
      | ~ ( B @ ( A @ equiv ) @ is_a_theorem ) ),
    inference(paramod_ordered,[status(thm)],[194,186]) ).

thf(208,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( ( A @ is_a_theorem )
       != ( B @ is_a_theorem ) )
      | ~ ( B @ is_a_theorem )
      | ~ modus_ponens
      | ( C @ is_a_theorem )
      | ~ ( A @ ( C @ ( B @ implies ) @ equiv ) @ is_a_theorem ) ),
    inference(pattern_uni,[status(thm)],[207:[bind(A,$thf( F @ ( E @ implies ) )),bind(B,$thf( B )),bind(C,$thf( E )),bind(D,$thf( F ))]]) ).

thf(211,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( ( A @ is_a_theorem )
       != ( B @ is_a_theorem ) )
      | ~ ( B @ is_a_theorem )
      | ~ modus_ponens
      | ( C @ is_a_theorem )
      | ~ ( A @ ( C @ ( B @ implies ) @ equiv ) @ is_a_theorem ) ),
    inference(simp,[status(thm)],[208]) ).

thf(1872,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( ( A @ is_a_theorem )
       != ( B @ is_a_theorem ) )
      | ~ ( B @ is_a_theorem )
      | ~ $true
      | ( C @ is_a_theorem )
      | ~ ( A @ ( C @ ( B @ not @ or ) @ equiv ) @ is_a_theorem ) ),
    inference(rewrite,[status(thm)],[211,899,59]) ).

thf(1873,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( ( A @ is_a_theorem )
       != ( B @ is_a_theorem ) )
      | ~ ( B @ is_a_theorem )
      | ( C @ is_a_theorem )
      | ~ ( A @ ( C @ ( B @ not @ or ) @ equiv ) @ is_a_theorem ) ),
    inference(simp,[status(thm)],[1872]) ).

thf(30,axiom,
    ( and_1
  <=> ! [A: $i,B: $i] : ( A @ ( B @ ( A @ and ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_1) ).

thf(112,plain,
    ( ( ! [A: $i,B: $i] : ( A @ ( B @ ( A @ and ) @ implies ) @ is_a_theorem )
     => and_1 )
    & ( and_1
     => ! [A: $i,B: $i] : ( A @ ( B @ ( A @ and ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[30]) ).

thf(37,axiom,
    ( implies_1
  <=> ! [A: $i,B: $i] : ( A @ ( B @ implies ) @ ( A @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_1) ).

thf(145,plain,
    ( ( ! [A: $i,B: $i] : ( A @ ( B @ implies ) @ ( A @ implies ) @ is_a_theorem )
     => implies_1 )
    & ( implies_1
     => ! [A: $i,B: $i] : ( A @ ( B @ implies ) @ ( A @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[37]) ).

thf(5,axiom,
    op_implies_and,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_implies_and) ).

thf(50,plain,
    op_implies_and,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(45,axiom,
    ( r5
  <=> ! [A: $i,B: $i,C: $i] : ( C @ ( A @ or ) @ ( B @ ( A @ or ) @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r5) ).

thf(177,plain,
    ( ( ! [A: $i,B: $i,C: $i] : ( C @ ( A @ or ) @ ( B @ ( A @ or ) @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ is_a_theorem )
     => r5 )
    & ( r5
     => ! [A: $i,B: $i,C: $i] : ( C @ ( A @ or ) @ ( B @ ( A @ or ) @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[45]) ).

thf(13,axiom,
    r1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r1) ).

thf(58,plain,
    r1,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).

thf(34,axiom,
    ( r3
  <=> ! [A: $i,B: $i] : ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r3) ).

thf(131,plain,
    ( ( ! [A: $i,B: $i] : ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ implies ) @ is_a_theorem )
     => r3 )
    & ( r3
     => ! [A: $i,B: $i] : ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ implies ) @ is_a_theorem ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[34]) ).

thf(1,conjecture,
    equivalence_3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_equivalence_3) ).

thf(2,negated_conjecture,
    ~ equivalence_3,
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(47,plain,
    ~ equivalence_3,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(7418,plain,
    $false,
    inference(e,[status(thm)],[120,1967,57,84,116,73,59,76,104,55,51,100,69,88,56,153,52,157,60,2204,70,165,92,2200,53,169,141,124,96,2285,173,161,149,54,49,181,66,108,135,80,1873,112,194,145,48,63,50,177,58,899,131,47]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL495+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.08  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.13/0.40  % Computer : n018.cluster.edu
% 0.13/0.40  % Model    : x86_64 x86_64
% 0.13/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40  % Memory   : 8046.5625MB
% 0.13/0.40  % OS       : Linux 6.8.0-71-generic
% 0.13/0.40  % CPULimit : 300
% 0.13/0.40  % WCLimit  : 300
% 0.13/0.40  % DateTime : Fri Sep 25 22:41:51 UTC 2026
% 0.13/0.41  % CPUTime  : 
% 0.13/0.41  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.85/0.98  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.43/1.21  % [INFO] 	 Parsing done (226ms). 
% 1.43/1.22  % [INFO] 	 Running in sequential loop mode. 
% 2.08/1.62  % [INFO] 	 eprover registered as external prover. 
% 2.08/1.63  % [INFO] 	 Scanning for conjecture ... 
% 2.26/1.72  % [INFO] 	 Found a conjecture (or negated_conjecture) and 44 axioms. Running axiom selection ... 
% 2.26/1.79  % [INFO] 	 Axiom selection finished. Selected 44 axioms (removed 0 axioms). 
% 2.45/1.87  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.45/1.88  % [INFO] 	 Type checking passed. 
% 2.45/1.88  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 67.04/24.43  % External prover 'e' found a proof!
% 67.04/24.43  % [INFO] 	 Killing All external provers ... 
% 67.04/24.43  % Time passed: 23884ms (effective reasoning time: 23205ms)
% 67.04/24.43  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 67.04/24.43  % Axioms used in derivation (44): or_3, and_1, cn1, op_equiv, kn1, op_and, r5, principia_r5, implies_3, principia_r4, op_implies_and, cn3, substitution_of_equivalents, principia_r2, principia_op_and, principia_r3, equivalence_2, principia_modus_ponens, kn2, cn2, hilbert_op_implies_and, equivalence_3, modus_tollens, kn3, and_3, or_1, principia_op_equiv, use_substitution_of_equivalents, r4, modus_ponens, hilbert_op_or, r1, r2, equivalence_1, or_2, implies_1, r3, and_2, principia_r1, op_or, op_implies_or, hilbert_op_equiv, implies_2, principia_op_implies_or
% 67.04/24.43  % No. of inferences in proof: 127
% 67.04/24.44  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 23884 ms resp. 23205 ms w/o parsing
% 67.43/24.52  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 67.43/24.52  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------