TSTP Solution File: SEU924^5 by Leo-III---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.12
% Problem  : SEU924^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n006.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 : Tue May 21 03:40:27 EDT 2024

% Result   : Theorem 2.56s 1.62s
% Output   : Refutation 2.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (  10 unt;   3 typ;   0 def)
%            Number of atoms       :   16 (  15 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   60 (  12   ~;   6   |;   4   &;  26   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   19 (  19   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   4 con; 0-2 aty)
%            Number of variables   :   43 (  21   ^  21   !;   1   ?;  43   :)

% Comments : 
%------------------------------------------------------------------------------
thf(sk1_type,type,
    sk1: $i ).

thf(sk2_type,type,
    sk2: $i > $i ).

thf(sk4_type,type,
    sk4: $i ).

thf(1,conjecture,
    ! [A: $i,B: $i > $i] :
      ( ! [C: ( $i > $i ) > $o] :
          ( ( ( C
              @ ^ [D: $i] : A )
            & ! [D: $i > $i] :
                ( ( C @ D )
               => ( C
                  @ ^ [E: $i] : A ) ) )
         => ( C @ B ) )
     => ! [C: $i] :
          ( ( B @ C )
          = A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM134_pme) ).

thf(2,negated_conjecture,
    ~ ! [A: $i,B: $i > $i] :
        ( ! [C: ( $i > $i ) > $o] :
            ( ( ( C
                @ ^ [D: $i] : A )
              & ! [D: $i > $i] :
                  ( ( C @ D )
                 => ( C
                    @ ^ [E: $i] : A ) ) )
           => ( C @ B ) )
       => ! [C: $i] :
            ( ( B @ C )
            = A ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: $i,B: $i > $i] :
        ( ! [C: ( $i > $i ) > $o] :
            ( ( ( C
                @ ^ [D: $i] : A )
              & ! [D: $i > $i] :
                  ( ( C @ D )
                 => ( C
                    @ ^ [E: $i] : A ) ) )
           => ( C @ B ) )
       => ! [C: $i] :
            ( ( B @ C )
            = A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ~ ! [A: $i,B: $i > $i] :
        ( ! [C: ( $i > $i ) > $o] :
            ( ( ( C
                @ ^ [D: $i] : A )
              & ( ? [D: $i > $i] : ( C @ D )
               => ( C
                  @ ^ [D: $i] : A ) ) )
           => ( C @ B ) )
       => ! [C: $i] :
            ( ( B @ C )
            = A ) ),
    inference(miniscope,[status(thm)],[3]) ).

thf(5,plain,
    ( ( sk2 @ sk4 )
   != sk1 ),
    inference(cnf,[status(esa)],[4]) ).

thf(10,plain,
    ( ( sk2 @ sk4 )
   != sk1 ),
    inference(lifteq,[status(thm)],[5]) ).

thf(6,plain,
    ! [A: ( $i > $i ) > $o] :
      ( ~ ( A
          @ ^ [B: $i] : sk1 )
      | ~ ( A
          @ ^ [B: $i] : sk1 )
      | ( A @ sk2 ) ),
    inference(cnf,[status(esa)],[4]) ).

thf(8,plain,
    ( ( ( ^ [A: $i] : sk1 )
     != ( ^ [A: $i] : sk1 ) )
    | ( ( ^ [A: $i] : sk1 )
     != ( ^ [A: $i] : sk1 ) )
    | ( ( ^ [A: $i] : sk1 )
      = sk2 ) ),
    inference(replace_leibeq,[status(thm)],[6:[bind(A,$thf( (=) @ ( $i > $i ) @ ^ [B: $i] : sk1 ))]]) ).

thf(14,plain,
    ( ( ( ^ [A: $i] : sk1 )
     != ( ^ [A: $i] : sk1 ) )
    | ( ( ^ [A: $i] : sk1 )
     != ( ^ [A: $i] : sk1 ) )
    | ( sk2
      = ( ^ [A: $i] : sk1 ) ) ),
    inference(lifteq,[status(thm)],[8]) ).

thf(15,plain,
    ( sk2
    = ( ^ [A: $i] : sk1 ) ),
    inference(simp,[status(thm)],[14]) ).

thf(16,plain,
    ! [A: $i] :
      ( ( sk2 @ A )
      = sk1 ),
    inference(func_ext,[status(esa)],[15]) ).

thf(17,plain,
    sk1 != sk1,
    inference(rewrite,[status(thm)],[10,16]) ).

thf(18,plain,
    $false,
    inference(simp,[status(thm)],[17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SEU924^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.36  % Computer : n006.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit : 300
% 0.16/0.36  % WCLimit  : 300
% 0.16/0.36  % DateTime : Sun May 19 16:57:39 EDT 2024
% 0.16/0.36  % CPUTime  : 
% 0.84/0.86  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.17/0.96  % [INFO] 	 Parsing done (102ms). 
% 1.17/0.97  % [INFO] 	 Running in sequential loop mode. 
% 1.47/1.18  % [INFO] 	 eprover registered as external prover. 
% 1.68/1.18  % [INFO] 	 cvc4 registered as external prover. 
% 1.68/1.19  % [INFO] 	 Scanning for conjecture ... 
% 1.82/1.24  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.82/1.26  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.82/1.26  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.82/1.26  % [INFO] 	 Type checking passed. 
% 1.82/1.26  % [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 ... 
% 2.56/1.62  % [INFO] 	 Killing All external provers ... 
% 2.56/1.62  % Time passed: 1089ms (effective reasoning time: 643ms)
% 2.56/1.62  % 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)>
% 2.56/1.62  % Axioms used in derivation (0): 
% 2.56/1.62  % No. of inferences in proof: 13
% 2.56/1.62  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1089 ms resp. 643 ms w/o parsing
% 2.88/1.65  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.88/1.65  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------