TSTP Solution File: SEV385^5 by Leo-III---1.7.15

View Problem - Process Solution

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

% Computer : n017.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 : Mon Jun 24 15:58:53 EDT 2024

% Result   : Theorem 3.36s 1.91s
% Output   : Refutation 3.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   12 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   56 (  50 equ;   9 cnn)
%            Maximal formula atoms :    4 (   4 avg)
%            Number of connectives :   81 (  14   ~;   7   |;  10   &;  44   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Number of types       :    2 (   2 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   4 usr;   5 con; 0-2 aty)
%            Number of variables   :   31 (   9   ^  16   !;   6   ?;  31   :)

% Comments : 
%------------------------------------------------------------------------------
thf(b_type,type,
    b: $tType ).

thf(a_type,type,
    a: $tType ).

thf(x_type,type,
    x: b ).

thf(y_type,type,
    y: a ).

thf(sk2_type,type,
    sk2: ( b > a ) > a ).

thf(1,conjecture,
    ? [A: b > a] :
      ( ! [B: b] :
          ( ( x = B )
         => ( y
            = ( A @ B ) ) )
      & ! [B: a] :
          ( ( y = B )
         => ? [C: b] :
              ( ( ^ [D: b] :
                    ( ( x = D )
                    & ( B
                      = ( A @ D ) ) ) )
              = ( (=) @ b @ C ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX6004_pme) ).

thf(2,negated_conjecture,
    ~ ? [A: b > a] :
        ( ! [B: b] :
            ( ( x = B )
           => ( y
              = ( A @ B ) ) )
        & ! [B: a] :
            ( ( y = B )
           => ? [C: b] :
                ( ( ^ [D: b] :
                      ( ( x = D )
                      & ( B
                        = ( A @ D ) ) ) )
                = ( (=) @ b @ C ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ? [A: b > a] :
        ( ! [B: b] :
            ( ( x = B )
           => ( y
              = ( A @ B ) ) )
        & ! [B: a] :
            ( ( y = B )
           => ? [C: b] :
                ( ( ^ [D: b] :
                      ( ( x = D )
                      & ( B
                        = ( A @ D ) ) ) )
                = ( (=) @ b @ C ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(6,plain,
    ! [A: b > a] :
      ( ( y
       != ( A @ ( sk1 @ A ) ) )
      | ( y
        = ( sk2 @ A ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(10,plain,
    ! [A: b > a] :
      ( ( y
       != ( A @ ( sk1 @ A ) ) )
      | ( ( sk2 @ A )
        = y ) ),
    inference(lifteq,[status(thm)],[6]) ).

thf(12,plain,
    ( ( sk2
      @ ^ [A: b] : y )
    = y ),
    inference(pre_uni,[status(thm)],[10:[bind(A,$thf( ^ [B: b] : y ))]]) ).

thf(7,plain,
    ! [B: b,A: b > a] :
      ( ( y
       != ( A @ ( sk1 @ A ) ) )
      | ( ( ^ [C: b] :
              ( ( x = C )
              & ( ( sk2 @ A )
                = ( A @ C ) ) ) )
       != ( (=) @ b @ B ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(11,plain,
    ! [B: b,A: b > a] :
      ( ( y
       != ( A @ ( sk1 @ A ) ) )
      | ( ( ^ [C: b] :
              ( ( x = C )
              & ( ( sk2 @ A )
                = ( A @ C ) ) ) )
       != ( (=) @ b @ B ) ) ),
    inference(lifteq,[status(thm)],[7]) ).

thf(42,plain,
    ! [B: b,A: b > a] :
      ( ( y
       != ( A @ ( sk1 @ A ) ) )
      | ( ( ^ [C: b] :
              ( ( x = C )
              & ( y
                = ( A @ C ) ) ) )
       != ( (=) @ b @ B ) )
      | ( ( sk2
          @ ^ [C: b] : y )
       != ( sk2 @ A ) ) ),
    inference(paramod_ordered,[status(thm)],[12,11]) ).

thf(43,plain,
    ! [A: b] :
      ( ( y != y )
      | ( ( ^ [B: b] :
              ( ( x = B )
              & ( y = y ) ) )
       != ( (=) @ b @ A ) ) ),
    inference(pattern_uni,[status(thm)],[42:[bind(A,$thf( ^ [C: b] : y ))]]) ).

thf(49,plain,
    ! [A: b] :
      ( ( (=) @ b @ x )
     != ( (=) @ b @ A ) ),
    inference(simp,[status(thm)],[43]) ).

thf(54,plain,
    $false,
    inference(pattern_uni,[status(thm)],[49:[bind(A,$thf( x ))]]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem  : SEV385^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.13  % Command  : run_Leo-III %s %d THM
% 0.13/0.35  % Computer : n017.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Fri Jun 21 18:25:25 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.99/0.91  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.13/1.02  % [INFO] 	 Parsing done (112ms). 
% 1.33/1.03  % [INFO] 	 Running in sequential loop mode. 
% 1.69/1.25  % [INFO] 	 eprover registered as external prover. 
% 1.69/1.26  % [INFO] 	 Scanning for conjecture ... 
% 1.89/1.32  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.89/1.34  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.89/1.34  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.89/1.34  % [INFO] 	 Type checking passed. 
% 1.89/1.35  % [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 ... 
% 3.36/1.91  % [INFO] 	 Killing All external provers ... 
% 3.36/1.91  % Time passed: 1352ms (effective reasoning time: 877ms)
% 3.36/1.91  % 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)>
% 3.36/1.91  % Axioms used in derivation (0): 
% 3.36/1.91  % No. of inferences in proof: 12
% 3.36/1.91  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1352 ms resp. 877 ms w/o parsing
% 3.36/1.96  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.36/1.96  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------