↑ 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  : ALG298^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 : n017.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 07:45:09 AM UTC 2026

% Result   : Theorem 3.72s 2.16s
% Output   : Refutation 3.89s
% 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       :   16 (  15 equ;   0 cnn)
%            Maximal formula atoms :    5 (   4 avg)
%            Number of connectives :   89 (   2   ~;   0   |;   9   &;  75   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   8 avg)
%            Number of types       :    3 (   3 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   36 (   0   ^;  33   !;   3   ?;  36   :)

% Comments : 
%------------------------------------------------------------------------------
thf(c_type,type,
    c: $tType ).

thf(b_type,type,
    b: $tType ).

thf(a_type,type,
    a: $tType ).

thf(c_starc_decl,type,
    c_starc: c > c > c ).

thf(c_starb_decl,type,
    c_starb: b > b > b ).

thf(c_stara_decl,type,
    c_stara: a > a > a ).

thf(1,conjecture,
    ! [A: a > b,B: a > c,C: b > c] :
      ( ( ! [D: a] :
            ( ( C @ ( A @ D ) )
            = ( B @ D ) )
        & ! [D: b] :
          ? [E: a] :
            ( ( A @ E )
            = D )
        & ! [D: a,E: a] :
            ( ( A @ ( c_stara @ D @ E ) )
            = ( c_starb @ ( A @ D ) @ ( A @ E ) ) )
        & ! [D: a,E: a] :
            ( ( B @ ( c_stara @ D @ E ) )
            = ( c_starc @ ( B @ D ) @ ( B @ E ) ) ) )
     => ! [D: b,E: b] :
          ( ( C @ ( c_starb @ D @ E ) )
          = ( c_starc @ ( C @ D ) @ ( C @ E ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM270_pme) ).

thf(2,negated_conjecture,
    ~ ! [A: a > b,B: a > c,C: b > c] :
        ( ( ! [D: a] :
              ( ( C @ ( A @ D ) )
              = ( B @ D ) )
          & ! [D: b] :
            ? [E: a] :
              ( ( A @ E )
              = D )
          & ! [D: a,E: a] :
              ( ( A @ ( c_stara @ D @ E ) )
              = ( c_starb @ ( A @ D ) @ ( A @ E ) ) )
          & ! [D: a,E: a] :
              ( ( B @ ( c_stara @ D @ E ) )
              = ( c_starc @ ( B @ D ) @ ( B @ E ) ) ) )
       => ! [D: b,E: b] :
            ( ( C @ ( c_starb @ D @ E ) )
            = ( c_starc @ ( C @ D ) @ ( C @ E ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: a > b,B: a > c,C: b > c] :
        ( ( ! [D: a] :
              ( ( C @ ( A @ D ) )
              = ( B @ D ) )
          & ! [D: b] :
            ? [E: a] :
              ( ( A @ E )
              = D )
          & ! [D: a,E: a] :
              ( ( A @ ( c_stara @ D @ E ) )
              = ( c_starb @ ( A @ D ) @ ( A @ E ) ) )
          & ! [D: a,E: a] :
              ( ( B @ ( c_stara @ D @ E ) )
              = ( c_starc @ ( B @ D ) @ ( B @ E ) ) ) )
       => ! [D: b,E: b] :
            ( ( C @ ( c_starb @ D @ E ) )
            = ( c_starc @ ( C @ D ) @ ( C @ E ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ALG298^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % 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.09/0.20  % Computer : n017.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Tue Sep 29 17:33:22 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  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
% 0.89/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.25/0.99  % [INFO] 	 Parsing done (191ms). 
% 1.25/1.00  % [INFO] 	 Running in sequential loop mode. 
% 2.03/1.41  % [INFO] 	 eprover registered as external prover. 
% 2.03/1.42  % [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.57  % [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.72/2.16  % External prover 'e' found a proof!
% 3.72/2.16  % [INFO] 	 Killing All external provers ... 
% 3.72/2.16  % Time passed: 1806ms (effective reasoning time: 1153ms)
% 3.72/2.16  % 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.72/2.16  % Axioms used in derivation (0): 
% 3.72/2.16  % No. of inferences in proof: 4
% 3.72/2.16  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1806 ms resp. 1153 ms w/o parsing
% 3.89/2.20  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.89/2.20  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------