↑ 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  : GRP665+1 : 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 : 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 : Sun Sep 27 07:21:41 AM UTC 2026

% Result   : Theorem 5.48s 3.22s
% Output   : Refutation 5.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   22 (  19 unt;   0 typ;   0 def)
%            Number of atoms       :   28 (  27 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  176 (   2   ~;   0   |;   6   &; 168   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   40 (   0   ^;  40   !;   0   ?;  40   :)

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

thf(op_c_decl,type,
    op_c: $i ).

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

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

thf(unit_decl,type,
    unit: $i ).

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

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

thf(9,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( A @ ( B @ mult ) @ ( C @ mult ) )
      = ( A @ ( C @ mult ) @ ( C @ ( B @ ( C @ mult ) @ rd ) @ mult ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).

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

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

thf(22,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] :
      ( ( ( op_c @ ( B @ ( A @ mult ) @ mult ) )
        = ( op_c @ ( B @ mult ) @ ( A @ mult ) ) )
      & ( ( B @ ( op_c @ ( A @ mult ) @ mult ) )
        = ( B @ ( op_c @ mult ) @ ( A @ mult ) ) )
      & ( ( B @ ( A @ mult ) @ ( op_c @ mult ) )
        = ( B @ ( A @ ( op_c @ mult ) @ mult ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

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

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

thf(11,axiom,
    ! [A: $i] :
      ( ( A @ ( op_c @ mult ) )
      = ( op_c @ ( A @ mult ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).

thf(40,plain,
    ! [A: $i] :
      ( ( A @ ( op_c @ mult ) )
      = ( op_c @ ( A @ mult ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).

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

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

thf(10,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( A @ ( B @ ( C @ mult ) @ mult ) )
      = ( A @ ( B @ mult ) @ ( A @ ld ) @ ( A @ ( C @ mult ) @ mult ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).

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

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

thf(25,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/sandbox/benchmark/theBenchmark.p',f01) ).

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

thf(8,axiom,
    ! [A: $i] :
      ( ( A @ ( unit @ mult ) )
      = A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).

thf(31,plain,
    ! [A: $i] :
      ( ( A @ ( unit @ mult ) )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(47,plain,
    $false,
    inference(e,[status(thm)],[28,34,22,12,40,19,37,25,16,31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : GRP665+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.11  % 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.26/0.50  % Computer : n017.cluster.edu
% 0.26/0.50  % Model    : x86_64 x86_64
% 0.26/0.50  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.26/0.50  % Memory   : 8046.5625MB
% 0.26/0.50  % OS       : Linux 6.8.0-71-generic
% 0.26/0.50  % CPULimit : 300
% 0.26/0.50  % WCLimit  : 300
% 0.26/0.50  % DateTime : Fri Sep 25 15:28:49 UTC 2026
% 0.26/0.51  % CPUTime  : 
% 0.26/0.51  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.30/1.21  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.72/1.42  % [INFO] 	 Parsing done (196ms). 
% 1.72/1.44  % [INFO] 	 Running in sequential loop mode. 
% 2.76/2.08  % [INFO] 	 eprover registered as external prover. 
% 2.76/2.10  % [INFO] 	 Scanning for conjecture ... 
% 3.02/2.25  % [INFO] 	 Found a conjecture (or negated_conjecture) and 9 axioms. Running axiom selection ... 
% 3.17/2.31  % [INFO] 	 Axiom selection finished. Selected 9 axioms (removed 0 axioms). 
% 3.17/2.34  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 3.17/2.35  % [INFO] 	 Type checking passed. 
% 3.17/2.36  % [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 ... 
% 5.48/3.21  % External prover 'e' found a proof!
% 5.48/3.21  % [INFO] 	 Killing All external provers ... 
% 5.48/3.22  % Time passed: 2489ms (effective reasoning time: 1768ms)
% 5.48/3.22  % 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)>
% 5.48/3.22  % Axioms used in derivation (9): f08, f03, f02, f07, f06, f05, f01, f04, f09
% 5.48/3.22  % No. of inferences in proof: 22
% 5.48/3.22  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2489 ms resp. 1768 ms w/o parsing
% 5.48/3.28  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.48/3.28  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------