TSTP Solution File: SYO538^1 by Leo-III-SAT---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.12
% Problem  : SYO538^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n026.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 09:00:51 EDT 2024

% Result   : Theorem 2.38s 1.53s
% Output   : Refutation 2.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   22 (   6 unt;   4 typ;   1 def)
%            Number of atoms       :   50 (  45 equ;   0 cnn)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :   63 (  16   ~;   8   |;   6   &;  32   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   4 usr;   4 con; 0-3 aty)
%            Number of variables   :   35 (  20   ^  13   !;   2   ?;  35   :)

% Comments : 
%------------------------------------------------------------------------------
thf(eps_type,type,
    eps: ( $i > $o ) > $i ).

thf(if_type,type,
    if: $o > $i > $i > $i ).

thf(if_def,definition,
    ( if
    = ( ^ [A: $o,B: $i,C: $i] :
          ( eps
          @ ^ [D: $i] :
              ( ( A
                & ( D = B ) )
              | ( ~ A
                & ( D = C ) ) ) ) ) ) ).

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

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

thf(1,conjecture,
    ! [A: $i,B: $i] :
      ( ( ( if @ $true @ A @ B )
        = A )
      & ( ( if @ $false @ A @ B )
        = B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

thf(2,negated_conjecture,
    ~ ! [A: $i,B: $i] :
        ( ( ( if @ $true @ A @ B )
          = A )
        & ( ( if @ $false @ A @ B )
          = B ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(4,plain,
    ~ ! [A: $i,B: $i] :
        ( ( ( eps
            @ ^ [C: $i] : ( C = A ) )
          = A )
        & ( ( eps
            @ ^ [C: $i] : ( C = B ) )
          = B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(5,plain,
    ~ ( ! [A: $i] :
          ( ( eps
            @ ^ [B: $i] : ( B = A ) )
          = A )
      & ! [A: $i] :
          ( ( eps
            @ ^ [B: $i] : ( B = A ) )
          = A ) ),
    inference(miniscope,[status(thm)],[4]) ).

thf(6,plain,
    ( ( ( eps
        @ ^ [A: $i] : ( A = sk1 ) )
     != sk1 )
    | ( ( eps
        @ ^ [A: $i] : ( A = sk2 ) )
     != sk2 ) ),
    inference(cnf,[status(esa)],[5]) ).

thf(7,plain,
    ( ( ( eps
        @ ^ [A: $i] : ( A = sk1 ) )
     != sk1 )
    | ( ( eps
        @ ^ [A: $i] : ( A = sk2 ) )
     != sk2 ) ),
    inference(lifteq,[status(thm)],[6]) ).

thf(11,axiom,
    ? [A: ( $i > $o ) > $i] :
    ! [B: $i > $o] :
      ( ? [C: $i] : ( B @ C )
     => ( B @ ( A @ B ) ) ),
    introduced(axiom_of_choice) ).

thf(12,plain,
    ! [A: $i] :
      ( ( A != sk1 )
      | ( ( eps
          @ ^ [B: $i] : ( B = sk1 ) )
        = sk1 ) ),
    inference(choice,[status(esa)],[11]) ).

thf(14,plain,
    ! [A: $i] :
      ( ( A != sk1 )
      | ( ( eps
          @ ^ [B: $i] : ( B = sk1 ) )
        = sk1 ) ),
    inference(lifteq,[status(thm)],[12]) ).

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

thf(18,plain,
    ( ( sk1 != sk1 )
    | ( ( eps
        @ ^ [A: $i] : ( A = sk2 ) )
     != sk2 ) ),
    inference(rewrite,[status(thm)],[7,15]) ).

thf(19,plain,
    ( ( eps
      @ ^ [A: $i] : ( A = sk2 ) )
   != sk2 ),
    inference(simp,[status(thm)],[18]) ).

thf(13,plain,
    ! [A: $i] :
      ( ( A != sk2 )
      | ( ( eps
          @ ^ [B: $i] : ( B = sk2 ) )
        = sk2 ) ),
    inference(choice,[status(esa)],[11]) ).

thf(16,plain,
    ! [A: $i] :
      ( ( A != sk2 )
      | ( ( eps
          @ ^ [B: $i] : ( B = sk2 ) )
        = sk2 ) ),
    inference(lifteq,[status(thm)],[13]) ).

thf(17,plain,
    ( ( eps
      @ ^ [A: $i] : ( A = sk2 ) )
    = sk2 ),
    inference(simp,[status(thm)],[16]) ).

thf(24,plain,
    sk2 != sk2,
    inference(rewrite,[status(thm)],[19,17]) ).

thf(25,plain,
    $false,
    inference(simp,[status(thm)],[24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10  % Problem  : SYO538^1 : TPTP v8.2.0. Released v5.2.0.
% 0.10/0.13  % Command  : run_Leo-III %s %d
% 0.14/0.34  % Computer : n026.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Mon May 20 11:02:09 EDT 2024
% 0.14/0.34  % CPUTime  : 
% 0.90/0.83  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 0.99/0.94  % [INFO] 	 Parsing done (108ms). 
% 1.23/0.95  % [INFO] 	 Running in sequential loop mode. 
% 1.63/1.17  % [INFO] 	 nitpick registered as external prover. 
% 1.63/1.18  % [INFO] 	 Scanning for conjecture ... 
% 1.63/1.24  % [INFO] 	 Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ... 
% 1.85/1.26  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 1.85/1.26  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.85/1.27  % [INFO] 	 Type checking passed. 
% 1.85/1.27  % [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.38/1.53  % [INFO] 	 Killing All external provers ... 
% 2.38/1.53  % Time passed: 1035ms (effective reasoning time: 577ms)
% 2.38/1.53  % 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.38/1.53  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1035 ms resp. 577 ms w/o parsing
% 2.58/1.57  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.58/1.57  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------