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

View Problem - Process Solution

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

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

% Result   : Theorem 5.76s 2.32s
% Output   : Refutation 6.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   46 (   2 equ;   0 cnn)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   90 (  11   ~;  15   |;   3   &;  55   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    7 (   7   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   20 (  10   ^   7   !;   3   ?;  20   :)

% Comments : 
%------------------------------------------------------------------------------
thf(cA_type,type,
    cA: $i > $o ).

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

thf(cB_type,type,
    cB: $i > $o ).

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

thf(1,conjecture,
    ( ( cP
      @ ^ [A: $i] :
          ( ( cA @ A )
          | ( cB @ A ) ) )
   => ? [A: $i > $o] :
        ( ( cP @ A )
        & ! [B: $i] :
            ( ( cA @ B )
           => ( A @ B ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cSV1_pme) ).

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

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

thf(6,plain,
    ( cP
    @ ^ [A: $i] :
        ( ( cA @ A )
        | ( cB @ A ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(5,plain,
    ! [A: $i > $o] :
      ( ~ ( cP @ A )
      | ~ ( A @ ( sk1 @ A ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(10,plain,
    ! [A: $i > $o] :
      ( ~ ( A @ ( sk1 @ A ) )
      | ( ( cP
          @ ^ [B: $i] :
              ( ( cA @ B )
              | ( cB @ B ) ) )
       != ( cP @ A ) ) ),
    inference(paramod_ordered,[status(thm)],[6,5]) ).

thf(11,plain,
    ~ ( ( cA
        @ ( sk1
          @ ^ [A: $i] :
              ( ( cA @ A )
              | ( cB @ A ) ) ) )
      | ( cB
        @ ( sk1
          @ ^ [A: $i] :
              ( ( cA @ A )
              | ( cB @ A ) ) ) ) ),
    inference(pattern_uni,[status(thm)],[10:[bind(A,$thf( ^ [B: $i] : ( ( cA @ B ) | ( cB @ B ) ) ))]]) ).

thf(30,plain,
    ~ ( cA
      @ ( sk1
        @ ^ [A: $i] :
            ( ( cA @ A )
            | ( cB @ A ) ) ) ),
    inference(cnf,[status(esa)],[11]) ).

thf(4,plain,
    ! [A: $i > $o] :
      ( ~ ( cP @ A )
      | ( cA @ ( sk1 @ A ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(7,plain,
    ! [A: $i > $o] :
      ( ( cA @ ( sk1 @ A ) )
      | ( ( cP
          @ ^ [B: $i] :
              ( ( cA @ B )
              | ( cB @ B ) ) )
       != ( cP @ A ) ) ),
    inference(paramod_ordered,[status(thm)],[6,4]) ).

thf(8,plain,
    ( cA
    @ ( sk1
      @ ^ [A: $i] :
          ( ( cA @ A )
          | ( cB @ A ) ) ) ),
    inference(pattern_uni,[status(thm)],[7:[bind(A,$thf( ^ [B: $i] : ( ( cA @ B ) | ( cB @ B ) ) ))]]) ).

thf(272,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[30,8]) ).

thf(273,plain,
    $false,
    inference(simp,[status(thm)],[272]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SEV410^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.12  % Command  : run_Leo-III %s %d SAT
% 0.12/0.33  % Computer : n024.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Fri Jun 21 18:31:25 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 1.01/0.92  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.27/1.03  % [INFO] 	 Parsing done (111ms). 
% 1.27/1.04  % [INFO] 	 Running in sequential loop mode. 
% 1.69/1.25  % [INFO] 	 nitpick registered as external prover. 
% 1.69/1.25  % [INFO] 	 Scanning for conjecture ... 
% 1.69/1.30  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.94/1.32  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.94/1.32  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.94/1.33  % [INFO] 	 Type checking passed. 
% 1.94/1.33  % [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 ... 
% 5.76/2.32  % [INFO] 	 Killing All external provers ... 
% 5.76/2.32  % Time passed: 1785ms (effective reasoning time: 1277ms)
% 5.76/2.32  % 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)>
% 5.76/2.32  % Axioms used in derivation (0): 
% 5.76/2.32  % No. of inferences in proof: 13
% 5.76/2.32  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1785 ms resp. 1277 ms w/o parsing
% 6.44/2.35  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.44/2.35  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------