TSTP Solution File: SEV177^5 by Leo-III-SAT---1.7.15

View Problem - Process Solution

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

% Computer : n032.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:59:41 EDT 2024

% Result   : Theorem 4.24s 1.71s
% Output   : Refutation 4.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   32 (  16 equ;   0 cnn)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :   82 (  14   ~;   7   |;   7   &;  51   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   20 (  20   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :   26 (   5   ^  14   !;   7   ?;  26   :)

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

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

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

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

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

thf(5,plain,
    ( sk2
    = ( ^ [A: $i] :
        ? [B: $i > $o] :
          ( ~ ( B @ ( sk1 @ B ) )
          & ( A
            = ( sk1 @ B ) ) ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(6,plain,
    ( sk2
    = ( ^ [A: $i] :
        ? [B: $i > $o] :
          ( ~ ( B @ ( sk1 @ B ) )
          & ( A
            = ( sk1 @ B ) ) ) ) ),
    inference(lifteq,[status(thm)],[5]) ).

thf(7,plain,
    ! [A: $i] :
      ( ( sk2 @ A )
      = ( ? [B: $i > $o] :
            ( ~ ( B @ ( sk1 @ B ) )
            & ( A
              = ( sk1 @ B ) ) ) ) ),
    inference(func_ext,[status(esa)],[6]) ).

thf(13,plain,
    ! [A: $i] :
      ( ( sk2 @ A )
      | ~ ? [B: $i > $o] :
            ( ~ ( B @ ( sk1 @ B ) )
            & ( A
              = ( sk1 @ B ) ) ) ),
    inference(bool_ext,[status(thm)],[7]) ).

thf(23,plain,
    ! [B: $i > $o,A: $i] :
      ( ( B @ ( sk1 @ B ) )
      | ( A
       != ( sk1 @ B ) )
      | ( sk2 @ A ) ),
    inference(cnf,[status(esa)],[13]) ).

thf(24,plain,
    ! [B: $i > $o,A: $i] :
      ( ( A
       != ( sk1 @ B ) )
      | ( B @ ( sk1 @ B ) )
      | ( sk2 @ A ) ),
    inference(lifteq,[status(thm)],[23]) ).

thf(25,plain,
    ! [A: $i > $o] :
      ( ( A @ ( sk1 @ A ) )
      | ( sk2 @ ( sk1 @ A ) ) ),
    inference(simp,[status(thm)],[24]) ).

thf(4,plain,
    ~ ( sk2 @ ( sk1 @ sk2 ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(76,plain,
    ! [A: $i > $o] :
      ( ( A @ ( sk1 @ A ) )
      | ( ( sk2 @ ( sk1 @ A ) )
       != ( sk2 @ ( sk1 @ sk2 ) ) ) ),
    inference(paramod_ordered,[status(thm)],[25,4]) ).

thf(77,plain,
    sk2 @ ( sk1 @ sk2 ),
    inference(pattern_uni,[status(thm)],[76:[bind(A,$thf( sk2 ))]]) ).

thf(135,plain,
    $false,
    inference(rewrite,[status(thm)],[77,4]) ).

thf(136,plain,
    $false,
    inference(simp,[status(thm)],[135]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SEV177^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.09  % Command  : run_Leo-III %s %d SAT
% 0.08/0.28  % Computer : n032.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit : 300
% 0.08/0.28  % WCLimit  : 300
% 0.08/0.28  % DateTime : Fri Jun 21 19:29:25 EDT 2024
% 0.13/0.28  % CPUTime  : 
% 0.65/0.66  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 0.77/0.75  % [INFO] 	 Parsing done (92ms). 
% 0.77/0.76  % [INFO] 	 Running in sequential loop mode. 
% 1.23/0.95  % [INFO] 	 nitpick registered as external prover. 
% 1.23/0.96  % [INFO] 	 Scanning for conjecture ... 
% 1.41/1.00  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.41/1.02  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.41/1.02  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.41/1.02  % [INFO] 	 Type checking passed. 
% 1.41/1.02  % [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 ... 
% 4.24/1.70  % [INFO] 	 Killing All external provers ... 
% 4.24/1.71  % Time passed: 1302ms (effective reasoning time: 939ms)
% 4.24/1.71  % 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)>
% 4.24/1.71  % Axioms used in derivation (0): 
% 4.24/1.71  % No. of inferences in proof: 15
% 4.24/1.71  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1302 ms resp. 939 ms w/o parsing
% 4.24/1.73  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.24/1.73  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------