↑ Up

Leo-III---1.8.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Leo-III---1.8.0
% Problem  : SEV197^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Sep 30 08:36:59 AM UTC 2026

% Result   : Theorem 3.84s 2.25s
% Output   : Refutation 3.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    4 (   1 unt;   0 typ;   0 def)
%            Number of atoms       :   25 (  24 equ;   0 cnn)
%            Maximal formula atoms :    8 (   6 avg)
%            Number of connectives :  101 (   8   ~;   0   |;  21   &;  57   @)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (  10 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   2 usr;   2 con; 0-2 aty)
%            Number of variables   :   48 (   0   ^;  48   !;   0   ?;  48   :)

% Comments : 
%------------------------------------------------------------------------------
thf(iS_type,type,
    iS: $tType ).

thf(c0_decl,type,
    c0: iS ).

thf(cP_decl,type,
    cP: iS > iS > iS ).

thf(1,conjecture,
    ( ( ! [A: iS,B: iS] :
          ( ( cP @ A @ B )
         != c0 )
      & ! [A: iS,B: iS,C: iS,D: iS] :
          ( ( ( cP @ A @ C )
            = ( cP @ B @ D ) )
         => ( ( A = B )
            & ( C = D ) ) )
      & ! [A: iS > $o] :
          ( ( ( A @ c0 )
            & ! [B: iS,C: iS] :
                ( ( ( A @ B )
                  & ( A @ C ) )
               => ( A @ ( cP @ B @ C ) ) ) )
         => ! [B: iS] : ( A @ B ) ) )
   => ( ! [A: iS,B: iS,C: iS,D: iS] :
          ( ( ( cP @ A @ C )
            = ( cP @ B @ D ) )
         => ( ( A = B )
            & ( C = D ) ) )
      & ! [A: iS,B: iS] :
          ( ( cP @ A @ B )
         != c0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cS_ALG02_pme) ).

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

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

thf(38,plain,
    $false,
    inference(e,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV197^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.11/0.22  % Computer : n015.cluster.edu
% 0.11/0.22  % Model    : x86_64 x86_64
% 0.11/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.22  % Memory   : 8046.5625MB
% 0.11/0.22  % OS       : Linux 6.8.0-71-generic
% 0.11/0.22  % CPULimit : 300
% 0.11/0.22  % WCLimit  : 300
% 0.11/0.22  % DateTime : Tue Sep 29 15:23:18 UTC 2026
% 0.11/0.22  % CPUTime  : 
% 0.11/0.22  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 1.03/0.81  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.22/1.00  % [INFO] 	 Parsing done (187ms). 
% 1.22/1.01  % [INFO] 	 Running in sequential loop mode. 
% 2.02/1.42  % [INFO] 	 eprover registered as external prover. 
% 2.02/1.43  % [INFO] 	 Scanning for conjecture ... 
% 2.22/1.53  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.22/1.57  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.22/1.57  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.22/1.58  % [INFO] 	 Type checking passed. 
% 2.22/1.58  % [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.84/2.25  % External prover 'e' found a proof!
% 3.84/2.25  % [INFO] 	 Killing All external provers ... 
% 3.84/2.25  % Time passed: 1876ms (effective reasoning time: 1231ms)
% 3.84/2.25  % 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.84/2.25  % Axioms used in derivation (0): 
% 3.84/2.25  % No. of inferences in proof: 4
% 3.84/2.25  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1876 ms resp. 1231 ms w/o parsing
% 3.84/2.29  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.84/2.29  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------