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

View Problem - Process Solution

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

% Computer : n014.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 00:11:02 EDT 2024

% Result   : Theorem 3.27s 1.86s
% Output   : Refutation 3.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   17 (   5 unt;   4 typ;   0 def)
%            Number of atoms       :   22 (   2 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   91 (   8   ~;   3   |;   0   &;  65   @)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   63 (  63   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   38 (   0   ^  26   !;  12   ?;  38   :)

% Comments : 
%------------------------------------------------------------------------------
thf(a_type,type,
    a: $tType ).

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

thf(sk3_type,type,
    sk3: ( a > $o ) > a ).

thf(sk4_type,type,
    sk4: ( ( a > $o ) > a ) > a > $o ).

thf(1,conjecture,
    ( ! [A: ( a > $o ) > a > $o] :
      ? [B: ( a > $o ) > a] :
      ! [C: a > $o] :
        ( ? [D: a] : ( A @ C @ D )
       => ( A @ C @ ( B @ C ) ) )
   => ! [A: ( a > $o ) > $o] :
        ( ! [B: a > $o] :
            ( ( A @ B )
           => ? [C: a] : ( B @ C ) )
       => ? [B: ( a > $o ) > a] :
          ! [C: a > $o] :
            ( ( A @ C )
           => ( C @ ( B @ C ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM533) ).

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

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

thf(5,plain,
    ! [A: ( a > $o ) > a] : ( sk2 @ ( sk4 @ A ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(9,plain,
    ! [A: ( a > $o ) > a] : ( sk2 @ ( sk4 @ A ) ),
    inference(simp,[status(thm)],[5]) ).

thf(6,plain,
    ! [A: a > $o] :
      ( ~ ( sk2 @ A )
      | ( A @ ( sk3 @ A ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(10,plain,
    ! [A: a > $o] :
      ( ~ ( sk2 @ A )
      | ( A @ ( sk3 @ A ) ) ),
    inference(simp,[status(thm)],[6]) ).

thf(14,plain,
    ! [B: a > $o,A: ( a > $o ) > a] :
      ( ( B @ ( sk3 @ B ) )
      | ( ( sk2 @ ( sk4 @ A ) )
       != ( sk2 @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[9,10]) ).

thf(15,plain,
    ! [A: ( a > $o ) > a] : ( sk4 @ A @ ( sk3 @ ( sk4 @ A ) ) ),
    inference(pattern_uni,[status(thm)],[14:[bind(A,$thf( A )),bind(B,$thf( sk4 @ A ))]]) ).

thf(4,plain,
    ! [A: ( a > $o ) > a] :
      ~ ( sk4 @ A @ ( A @ ( sk4 @ A ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(8,plain,
    ! [A: ( a > $o ) > a] :
      ~ ( sk4 @ A @ ( A @ ( sk4 @ A ) ) ),
    inference(simp,[status(thm)],[4]) ).

thf(45,plain,
    ! [B: ( a > $o ) > a,A: ( a > $o ) > a] :
      ( ( sk4 @ A @ ( sk3 @ ( sk4 @ A ) ) )
     != ( sk4 @ B @ ( B @ ( sk4 @ B ) ) ) ),
    inference(paramod_ordered,[status(thm)],[15,8]) ).

thf(46,plain,
    $false,
    inference(pre_uni,[status(thm)],[45:[bind(A,$thf( sk3 )),bind(B,$thf( sk3 ))]]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL727^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.16  % Command  : run_Leo-III %s %d
% 0.15/0.37  % Computer : n014.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Mon May 20 01:56:09 EDT 2024
% 0.15/0.37  % CPUTime  : 
% 0.98/0.88  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.19/0.99  % [INFO] 	 Parsing done (109ms). 
% 1.19/1.00  % [INFO] 	 Running in sequential loop mode. 
% 1.60/1.23  % [INFO] 	 nitpick registered as external prover. 
% 1.71/1.23  % [INFO] 	 Scanning for conjecture ... 
% 1.74/1.29  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.94/1.31  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.94/1.31  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.94/1.31  % [INFO] 	 Type checking passed. 
% 1.94/1.32  % [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.27/1.86  % [INFO] 	 Killing All external provers ... 
% 3.27/1.86  % Time passed: 1326ms (effective reasoning time: 851ms)
% 3.27/1.86  % 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.27/1.86  % Axioms used in derivation (0): 
% 3.27/1.86  % No. of inferences in proof: 13
% 3.27/1.86  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1326 ms resp. 851 ms w/o parsing
% 3.27/1.90  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.27/1.90  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------