↑ 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  : SEV196^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 : n014.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.97s 2.21s
% Output   : Refutation 3.97s
% 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       :   24 (  21 equ;   0 cnn)
%            Maximal formula atoms :    8 (   6 avg)
%            Number of connectives :  106 (   2   ~;   6   |;  20   &;  72   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (  16 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   4 usr;   5 con; 0-2 aty)
%            Number of variables   :   30 (   0   ^;  12   !;  18   ?;  30   :)

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

thf(y_decl,type,
    y: a ).

thf(x_decl,type,
    x: a ).

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

thf(c0_decl,type,
    c0: a ).

thf(1,conjecture,
    ! [A: a > a > a > $o] :
      ( ( $true
        & ! [B: a,C: a,D: a] :
            ( ( ( ( B = c0 )
                & ( C = D ) )
              | ( ( C = c0 )
                & ( B = D ) )
              | ? [E: a,F: a,G: a,H: a,I: a,J: a] :
                  ( ( B
                    = ( cP @ E @ F ) )
                  & ( C
                    = ( cP @ G @ H ) )
                  & ( D
                    = ( cP @ I @ J ) )
                  & ( A @ E @ G @ I )
                  & ( A @ F @ H @ J ) ) )
           => ( A @ B @ C @ D ) ) )
     => ( A @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cS_JOIN_LEM2_pme) ).

thf(2,negated_conjecture,
    ~ ! [A: a > a > a > $o] :
        ( ( $true
          & ! [B: a,C: a,D: a] :
              ( ( ( ( B = c0 )
                  & ( C = D ) )
                | ( ( C = c0 )
                  & ( B = D ) )
                | ? [E: a,F: a,G: a,H: a,I: a,J: a] :
                    ( ( B
                      = ( cP @ E @ F ) )
                    & ( C
                      = ( cP @ G @ H ) )
                    & ( D
                      = ( cP @ I @ J ) )
                    & ( A @ E @ G @ I )
                    & ( A @ F @ H @ J ) ) )
             => ( A @ B @ C @ D ) ) )
       => ( A @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: a > a > a > $o] :
        ( ! [B: a,C: a,D: a] :
            ( ( ( ( B = c0 )
                & ( C = D ) )
              | ( ( C = c0 )
                & ( B = D ) )
              | ? [E: a,F: a,G: a,H: a,I: a,J: a] :
                  ( ( B
                    = ( cP @ E @ F ) )
                  & ( C
                    = ( cP @ G @ H ) )
                  & ( D
                    = ( cP @ I @ J ) )
                  & ( A @ E @ G @ I )
                  & ( A @ F @ H @ J ) ) )
           => ( A @ B @ C @ D ) )
       => ( A @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV196^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % 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.10/0.21  % Computer : n014.cluster.edu
% 0.10/0.21  % Model    : x86_64 x86_64
% 0.10/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21  % Memory   : 8046.5625MB
% 0.10/0.21  % OS       : Linux 6.8.0-71-generic
% 0.10/0.21  % CPULimit : 300
% 0.10/0.21  % WCLimit  : 300
% 0.10/0.21  % DateTime : Tue Sep 29 15:20:00 UTC 2026
% 0.10/0.21  % CPUTime  : 
% 0.10/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
% 1.09/0.85  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.53/1.04  % [INFO] 	 Parsing done (184ms). 
% 1.53/1.05  % [INFO] 	 Running in sequential loop mode. 
% 2.11/1.44  % [INFO] 	 eprover registered as external prover. 
% 2.11/1.45  % [INFO] 	 Scanning for conjecture ... 
% 2.32/1.56  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.54/1.60  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.54/1.61  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.54/1.61  % [INFO] 	 Type checking passed. 
% 2.54/1.62  % [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.97/2.21  % External prover 'e' found a proof!
% 3.97/2.21  % [INFO] 	 Killing All external provers ... 
% 3.97/2.21  % Time passed: 1847ms (effective reasoning time: 1154ms)
% 3.97/2.21  % 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.97/2.21  % Axioms used in derivation (0): 
% 3.97/2.21  % No. of inferences in proof: 4
% 3.97/2.21  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1847 ms resp. 1154 ms w/o parsing
% 3.97/2.25  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.97/2.25  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------