↑ 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  : PUZ093^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39

% Computer : n002.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:20:46 AM UTC 2026

% Result   : Theorem 4.64s 2.05s
% Output   : Refutation 4.64s
% 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       :   97 (  96 equ;   0 cnn)
%            Maximal formula atoms :   32 (  24 avg)
%            Number of connectives :  323 (  38   ~;  15   |;  57   &; 192   @)
%                                         (   0 <=>;  21  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   24 (  18 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    2 (   0 usr;   1 con; 0-2 aty)
%            Number of variables   :   39 (   0   ^;   3   !;  36   ?;  39   :)

% Comments : 
%------------------------------------------------------------------------------
thf(1,conjecture,
    ? [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,G: $i,H: $i,I: $i,J: $i,K: $i,L: $i] :
    ! [M: $i > $i] :
      ( ( ( ( ( ( M @ A )
              = ( M @ B ) )
            & ( ( M @ C )
              = ( M @ D ) )
            & ( ( M @ I )
              = ( M @ L ) ) )
         => ( ( M @ E )
            = ( M @ H ) ) )
        & ( ( ( ( M @ A )
              = ( M @ B ) )
            & ( ( M @ K )
              = ( M @ L ) )
            & ( ( M @ C )
              = ( M @ F ) ) )
         => ( ( M @ G )
           != ( M @ J ) ) )
        & ( ( ( ( M @ E )
              = ( M @ F ) )
            & ( ( M @ F )
              = ( M @ G ) )
            & ( ( M @ G )
              = ( M @ H ) )
            & ( ( M @ A )
             != ( M @ D ) ) )
         => ( ( M @ I )
           != ( M @ L ) ) )
        & ( ( ( ( M @ A )
              = ( M @ B ) )
            & ( ( M @ G )
              = ( M @ H ) )
            & ( ( M @ C )
             != ( M @ F ) ) )
         => ( ( M @ I )
            = ( M @ L ) ) )
        & ( ( ( ( M @ I )
              = ( M @ J ) )
            & ( ( M @ K )
              = ( M @ L ) )
            & ( ( M @ E )
              = ( M @ H ) ) )
         => ( ( M @ A )
           != ( M @ D ) ) )
        & ( ( ( ( M @ C )
              = ( M @ D ) )
            & ( ( M @ D )
              = ( M @ E ) )
            & ( ( M @ E )
              = ( M @ F ) )
            & ( ( M @ I )
             != ( M @ L ) ) )
         => ( ( M @ G )
            = ( M @ J ) ) ) )
     => ( ( ( M @ A )
         != ( M @ B ) )
        | ( ( M @ C )
         != ( M @ D ) )
        | ( ( M @ E )
         != ( M @ F ) )
        | ( ( M @ G )
         != ( M @ H ) )
        | ( ( M @ I )
         != ( M @ J ) )
        | ( ( M @ K )
         != ( M @ L ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cSIXFRIENDS_PTH) ).

thf(2,negated_conjecture,
    ~ ? [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,G: $i,H: $i,I: $i,J: $i,K: $i,L: $i] :
      ! [M: $i > $i] :
        ( ( ( ( ( ( M @ A )
                = ( M @ B ) )
              & ( ( M @ C )
                = ( M @ D ) )
              & ( ( M @ I )
                = ( M @ L ) ) )
           => ( ( M @ E )
              = ( M @ H ) ) )
          & ( ( ( ( M @ A )
                = ( M @ B ) )
              & ( ( M @ K )
                = ( M @ L ) )
              & ( ( M @ C )
                = ( M @ F ) ) )
           => ( ( M @ G )
             != ( M @ J ) ) )
          & ( ( ( ( M @ E )
                = ( M @ F ) )
              & ( ( M @ F )
                = ( M @ G ) )
              & ( ( M @ G )
                = ( M @ H ) )
              & ( ( M @ A )
               != ( M @ D ) ) )
           => ( ( M @ I )
             != ( M @ L ) ) )
          & ( ( ( ( M @ A )
                = ( M @ B ) )
              & ( ( M @ G )
                = ( M @ H ) )
              & ( ( M @ C )
               != ( M @ F ) ) )
           => ( ( M @ I )
              = ( M @ L ) ) )
          & ( ( ( ( M @ I )
                = ( M @ J ) )
              & ( ( M @ K )
                = ( M @ L ) )
              & ( ( M @ E )
                = ( M @ H ) ) )
           => ( ( M @ A )
             != ( M @ D ) ) )
          & ( ( ( ( M @ C )
                = ( M @ D ) )
              & ( ( M @ D )
                = ( M @ E ) )
              & ( ( M @ E )
                = ( M @ F ) )
              & ( ( M @ I )
               != ( M @ L ) ) )
           => ( ( M @ G )
              = ( M @ J ) ) ) )
       => ( ( ( M @ A )
           != ( M @ B ) )
          | ( ( M @ C )
           != ( M @ D ) )
          | ( ( M @ E )
           != ( M @ F ) )
          | ( ( M @ G )
           != ( M @ H ) )
          | ( ( M @ I )
           != ( M @ J ) )
          | ( ( M @ K )
           != ( M @ L ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ? [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,G: $i,H: $i,I: $i,J: $i,K: $i,L: $i] :
      ! [M: $i > $i] :
        ( ( ( ( ( ( M @ A )
                = ( M @ B ) )
              & ( ( M @ C )
                = ( M @ D ) )
              & ( ( M @ I )
                = ( M @ L ) ) )
           => ( ( M @ E )
              = ( M @ H ) ) )
          & ( ( ( ( M @ A )
                = ( M @ B ) )
              & ( ( M @ K )
                = ( M @ L ) )
              & ( ( M @ C )
                = ( M @ F ) ) )
           => ( ( M @ G )
             != ( M @ J ) ) )
          & ( ( ( ( M @ E )
                = ( M @ F ) )
              & ( ( M @ F )
                = ( M @ G ) )
              & ( ( M @ G )
                = ( M @ H ) )
              & ( ( M @ A )
               != ( M @ D ) ) )
           => ( ( M @ I )
             != ( M @ L ) ) )
          & ( ( ( ( M @ A )
                = ( M @ B ) )
              & ( ( M @ G )
                = ( M @ H ) )
              & ( ( M @ C )
               != ( M @ F ) ) )
           => ( ( M @ I )
              = ( M @ L ) ) )
          & ( ( ( ( M @ I )
                = ( M @ J ) )
              & ( ( M @ K )
                = ( M @ L ) )
              & ( ( M @ E )
                = ( M @ H ) ) )
           => ( ( M @ A )
             != ( M @ D ) ) )
          & ( ( ( ( M @ C )
                = ( M @ D ) )
              & ( ( M @ D )
                = ( M @ E ) )
              & ( ( M @ E )
                = ( M @ F ) )
              & ( ( M @ I )
               != ( M @ L ) ) )
           => ( ( M @ G )
              = ( M @ J ) ) ) )
       => ( ( ( M @ A )
           != ( M @ B ) )
          | ( ( M @ C )
           != ( M @ D ) )
          | ( ( M @ E )
           != ( M @ F ) )
          | ( ( M @ G )
           != ( M @ H ) )
          | ( ( M @ I )
           != ( M @ J ) )
          | ( ( M @ K )
           != ( M @ L ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ093^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.11/0.21  % Computer : n002.cluster.edu
% 0.11/0.21  % Model    : x86_64 x86_64
% 0.11/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.21  % Memory   : 8046.5625MB
% 0.11/0.21  % OS       : Linux 6.8.0-71-generic
% 0.11/0.21  % CPULimit : 300
% 0.11/0.21  % WCLimit  : 300
% 0.11/0.21  % DateTime : Tue Sep 29 13:24:22 UTC 2026
% 0.11/0.21  % CPUTime  : 
% 0.11/0.21  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.64/0.55  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 0.98/0.65  % [INFO] 	 Parsing done (105ms). 
% 0.98/0.66  % [INFO] 	 Running in sequential loop mode. 
% 1.37/0.88  % [INFO] 	 eprover registered as external prover. 
% 1.37/0.88  % [INFO] 	 Scanning for conjecture ... 
% 1.60/0.95  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.60/1.00  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.60/1.00  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.60/1.01  % [INFO] 	 Type checking passed. 
% 1.60/1.02  % [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 ... 
% 4.64/2.04  % External prover 'e' found a proof!
% 4.64/2.04  % [INFO] 	 Killing All external provers ... 
% 4.64/2.04  % Time passed: 1722ms (effective reasoning time: 1379ms)
% 4.64/2.04  % 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)>
% 4.64/2.05  % Axioms used in derivation (0): 
% 4.64/2.05  % No. of inferences in proof: 4
% 4.64/2.05  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1722 ms resp. 1379 ms w/o parsing
% 4.64/2.09  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.64/2.09  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------