↑ 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  : GRP657+1 : 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 : n003.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 : Sun Sep 27 07:21:38 AM UTC 2026

% Result   : Theorem 3.21s 2.25s
% Output   : Refutation 3.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   14 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   17 (  16 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   73 (   2   ~;   0   |;   3   &;  68   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   28 (   0   ^;  25   !;   3   ?;  28   :)

% Comments : 
%------------------------------------------------------------------------------
thf(mult_decl,type,
    mult: $i > $i > $i ).

thf(ld_decl,type,
    ld: $i > $i > $i ).

thf(rd_decl,type,
    rd: $i > $i > $i ).

thf(7,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( A @ mult ) @ ( B @ ( C @ mult ) @ mult ) )
      = ( C @ ( A @ ( B @ mult ) @ mult ) @ ( C @ mult ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).

thf(24,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( A @ mult ) @ ( B @ ( C @ mult ) @ mult ) )
      = ( C @ ( A @ ( B @ mult ) @ mult ) @ ( C @ mult ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(6,axiom,
    ! [A: $i,B: $i] :
      ( ( A @ ( A @ ( B @ mult ) @ rd ) )
      = B ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).

thf(21,plain,
    ! [A: $i,B: $i] :
      ( ( A @ ( A @ ( B @ mult ) @ rd ) )
      = B ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(3,axiom,
    ! [A: $i,B: $i] :
      ( ( A @ ( B @ ld ) @ ( B @ mult ) )
      = A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).

thf(12,plain,
    ! [A: $i,B: $i] :
      ( ( A @ ( B @ ld ) @ ( B @ mult ) )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(5,axiom,
    ! [A: $i,B: $i] :
      ( ( A @ ( A @ ( B @ rd ) @ mult ) )
      = B ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).

thf(18,plain,
    ! [A: $i,B: $i] :
      ( ( A @ ( A @ ( B @ rd ) @ mult ) )
      = B ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(1,conjecture,
    ? [A: $i] :
    ! [B: $i] :
      ( ( ( B @ ( A @ mult ) )
        = B )
      & ( ( A @ ( B @ mult ) )
        = B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

thf(2,negated_conjecture,
    ~ ? [A: $i] :
      ! [B: $i] :
        ( ( ( B @ ( A @ mult ) )
          = B )
        & ( ( A @ ( B @ mult ) )
          = B ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(8,plain,
    ~ ? [A: $i] :
      ! [B: $i] :
        ( ( ( B @ ( A @ mult ) )
          = B )
        & ( ( A @ ( B @ mult ) )
          = B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,axiom,
    ! [A: $i,B: $i] :
      ( ( A @ ( B @ mult ) @ ( B @ ld ) )
      = A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).

thf(15,plain,
    ! [A: $i,B: $i] :
      ( ( A @ ( B @ mult ) @ ( B @ ld ) )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(31,plain,
    $false,
    inference(e,[status(thm)],[24,21,12,18,8,15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP657+1 : 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.15/0.41  % Computer : n003.cluster.edu
% 0.15/0.41  % Model    : x86_64 x86_64
% 0.15/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41  % Memory   : 8046.5625MB
% 0.15/0.41  % OS       : Linux 6.8.0-71-generic
% 0.15/0.41  % CPULimit : 300
% 0.15/0.41  % WCLimit  : 300
% 0.15/0.41  % DateTime : Fri Sep 25 15:33:07 UTC 2026
% 0.15/0.41  % CPUTime  : 
% 0.15/0.41  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.87/1.00  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.23/1.19  % [INFO] 	 Parsing done (187ms). 
% 1.35/1.20  % [INFO] 	 Running in sequential loop mode. 
% 1.96/1.60  % [INFO] 	 eprover registered as external prover. 
% 1.96/1.61  % [INFO] 	 Scanning for conjecture ... 
% 2.12/1.70  % [INFO] 	 Found a conjecture (or negated_conjecture) and 5 axioms. Running axiom selection ... 
% 2.12/1.73  % [INFO] 	 Axiom selection finished. Selected 5 axioms (removed 0 axioms). 
% 2.12/1.75  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.12/1.75  % [INFO] 	 Type checking passed. 
% 2.12/1.76  % [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.21/2.25  % External prover 'e' found a proof!
% 3.21/2.25  % [INFO] 	 Killing All external provers ... 
% 3.21/2.25  % Time passed: 1699ms (effective reasoning time: 1036ms)
% 3.21/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.21/2.25  % Axioms used in derivation (5): f03, f02, f05, f04, f01
% 3.21/2.25  % No. of inferences in proof: 14
% 3.21/2.25  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1699 ms resp. 1036 ms w/o parsing
% 3.21/2.27  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.21/2.27  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------