TSTP Solution File: SYO276^5 by Leo-III-SAT---1.7.12

View Problem - Process Solution

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

% Computer : n007.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 08:59:46 EDT 2024

% Result   : Theorem 3.80s 1.85s
% Output   : Refutation 3.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   25 (   7 unt;   7 typ;   0 def)
%            Number of atoms       :   44 (  33 equ;  14 cnn)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :  148 (  17   ~;  16   |;   6   &; 100   @)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   20 (  20   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   12 (   0   ^  12   !;   0   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
thf(m_type,type,
    m: $i ).

thf(cP_type,type,
    cP: $i > $o ).

thf(n_type,type,
    n: $i ).

thf(s_type,type,
    s: $i > $i ).

thf(cO_type,type,
    cO: $i ).

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

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

thf(1,conjecture,
    ( ( ! [A: $i > $i > $o] :
          ( ( ( A @ cO @ cO )
            & ! [B: $i,C: $i] :
                ( ( A @ B @ C )
               => ( A @ ( s @ B ) @ ( s @ C ) ) ) )
         => ( A @ n @ m ) )
      & ( cP @ n ) )
   => ( cP @ m ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE_FENG_SV_I2) ).

thf(2,negated_conjecture,
    ~ ( ( ! [A: $i > $i > $o] :
            ( ( ( A @ cO @ cO )
              & ! [B: $i,C: $i] :
                  ( ( A @ B @ C )
                 => ( A @ ( s @ B ) @ ( s @ C ) ) ) )
           => ( A @ n @ m ) )
        & ( cP @ n ) )
     => ( cP @ m ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ( ! [A: $i > $i > $o] :
            ( ( ( A @ cO @ cO )
              & ! [B: $i,C: $i] :
                  ( ( A @ B @ C )
                 => ( A @ ( s @ B ) @ ( s @ C ) ) ) )
           => ( A @ n @ m ) )
        & ( cP @ n ) )
     => ( cP @ m ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(7,plain,
    ! [A: $i > $i > $o] :
      ( ~ ( A @ cO @ cO )
      | ( A @ ( sk1 @ A ) @ ( sk2 @ A ) )
      | ( A @ n @ m ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(9,plain,
    ( ( cO != cO )
    | ( ( sk1 @ ( (=) @ $i ) )
      = ( sk2 @ ( (=) @ $i ) ) )
    | ( n = m ) ),
    inference(replace_andrewseq,[status(thm)],[7:[bind(A,$thf( (=) @ $i ))]]) ).

thf(10,plain,
    ( ( cO != cO )
    | ( ( sk2 @ ( (=) @ $i ) )
      = ( sk1 @ ( (=) @ $i ) ) )
    | ( n = m ) ),
    inference(lifteq,[status(thm)],[9]) ).

thf(11,plain,
    ( ( ( sk2 @ ( (=) @ $i ) )
      = ( sk1 @ ( (=) @ $i ) ) )
    | ( n = m ) ),
    inference(simp,[status(thm)],[10]) ).

thf(5,plain,
    cP @ n,
    inference(cnf,[status(esa)],[3]) ).

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

thf(14,plain,
    ( ( cP @ n )
   != ( cP @ m ) ),
    inference(paramod_ordered,[status(thm)],[5,4]) ).

thf(15,plain,
    n != m,
    inference(simp,[status(thm)],[14]) ).

thf(16,plain,
    ( ( sk2 @ ( (=) @ $i ) )
    = ( sk1 @ ( (=) @ $i ) ) ),
    inference(simplifyReflect,[status(thm)],[11,15]) ).

thf(6,plain,
    ! [A: $i > $i > $o] :
      ( ~ ( A @ cO @ cO )
      | ~ ( A @ ( s @ ( sk1 @ A ) ) @ ( s @ ( sk2 @ A ) ) )
      | ( A @ n @ m ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(19,plain,
    ! [A: $i > $i > $o] :
      ( ~ ( A @ cO @ cO )
      | ~ ( A @ ( s @ ( sk1 @ A ) ) @ ( s @ ( sk1 @ ( (=) @ $i ) ) ) )
      | ( A @ n @ m )
      | ( ( sk2 @ ( (=) @ $i ) )
       != ( sk2 @ A ) ) ),
    inference(paramod_ordered,[status(thm)],[16,6]) ).

thf(20,plain,
    ( ( cO != cO )
    | ( ( s @ ( sk1 @ ( (=) @ $i ) ) )
     != ( s @ ( sk1 @ ( (=) @ $i ) ) ) )
    | ( n = m ) ),
    inference(pattern_uni,[status(thm)],[19:[bind(A,$thf( (=) @ $i ))]]) ).

thf(35,plain,
    ( ( cO != cO )
    | ( ( s @ ( sk1 @ ( (=) @ $i ) ) )
     != ( s @ ( sk1 @ ( (=) @ $i ) ) ) )
    | ( n = m ) ),
    inference(lifteq,[status(thm)],[20]) ).

thf(46,plain,
    n = m,
    inference(simp,[status(thm)],[35]) ).

thf(74,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[46,15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYO276^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.16  % Command  : run_Leo-III %s %d
% 0.17/0.37  % Computer : n007.cluster.edu
% 0.17/0.37  % Model    : x86_64 x86_64
% 0.17/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37  % Memory   : 8042.1875MB
% 0.17/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37  % CPULimit : 300
% 0.17/0.37  % WCLimit  : 300
% 0.17/0.37  % DateTime : Mon May 20 09:07:24 EDT 2024
% 0.17/0.37  % CPUTime  : 
% 0.99/0.87  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.17/0.97  % [INFO] 	 Parsing done (102ms). 
% 1.17/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.67/1.20  % [INFO] 	 nitpick registered as external prover. 
% 1.67/1.20  % [INFO] 	 Scanning for conjecture ... 
% 1.81/1.26  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.81/1.28  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.81/1.28  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.81/1.29  % [INFO] 	 Type checking passed. 
% 1.81/1.29  % [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.80/1.84  % [INFO] 	 Killing All external provers ... 
% 3.80/1.84  % Time passed: 1319ms (effective reasoning time: 862ms)
% 3.80/1.84  % 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.80/1.85  % Axioms used in derivation (0): 
% 3.80/1.85  % No. of inferences in proof: 18
% 3.80/1.85  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1319 ms resp. 862 ms w/o parsing
% 3.80/1.88  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.80/1.88  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------