↑ 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  : ALG276^5 : TPTP v9.3.1. Bugfixed v5.3.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 07:45:07 AM UTC 2026

% Result   : Theorem 3.82s 2.25s
% Output   : Refutation 4.02s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   10 (  10 unt;   0 typ;   6 def)
%            Number of atoms       :   40 (  24 equ;   0 cnn)
%            Maximal formula atoms :    1 (   4 avg)
%            Number of connectives :   75 (   2   ~;   0   |;  12   &;  61   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   18 (  18   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   1 con; 0-2 aty)
%            Number of variables   :   38 (   9   ^;  20   !;   9   ?;  38   :)

% Comments : 
%------------------------------------------------------------------------------
thf(g_type,type,
    g: $tType ).

thf(cGROUP1_decl,type,
    cGROUP1: ( g > g > g ) > g > $o ).

thf(cGROUP4_decl,type,
    cGROUP4: ( g > g > g ) > $o ).

thf(cGRP_ASSOC_decl,type,
    cGRP_ASSOC: ( g > g > g ) > $o ).

thf(cGRP_DIVISORS_decl,type,
    cGRP_DIVISORS: ( g > g > g ) > $o ).

thf(cGRP_INVERSE_decl,type,
    cGRP_INVERSE: ( g > g > g ) > g > $o ).

thf(cGRP_UNIT_decl,type,
    cGRP_UNIT: ( g > g > g ) > g > $o ).

thf(cGROUP1_def,definition,
    ( cGROUP1
    = ( ^ [A: g > g > g,B: g] :
          ( ( cGRP_ASSOC @ A )
          & ( cGRP_UNIT @ A @ B )
          & ( cGRP_INVERSE @ A @ B ) ) ) ) ).

thf(cGROUP4_def,definition,
    ( cGROUP4
    = ( ^ [A: g > g > g] :
          ( ( cGRP_ASSOC @ A )
          & ( cGRP_DIVISORS @ A ) ) ) ) ).

thf(cGRP_ASSOC_def,definition,
    ( cGRP_ASSOC
    = ( ^ [A: g > g > g] :
        ! [B: g,C: g,D: g] :
          ( ( A @ ( A @ B @ C ) @ D )
          = ( A @ B @ ( A @ C @ D ) ) ) ) ) ).

thf(cGRP_DIVISORS_def,definition,
    ( cGRP_DIVISORS
    = ( ^ [A: g > g > g] :
        ! [B: g,C: g] :
          ( ? [D: g] :
              ( ( A @ B @ D )
              = C )
          & ? [D: g] :
              ( ( A @ D @ B )
              = C ) ) ) ) ).

thf(cGRP_INVERSE_def,definition,
    ( cGRP_INVERSE
    = ( ^ [A: g > g > g,B: g] :
        ! [C: g] :
        ? [D: g] :
          ( ( ( A @ C @ D )
            = B )
          & ( ( A @ D @ C )
            = B ) ) ) ) ).

thf(cGRP_UNIT_def,definition,
    ( cGRP_UNIT
    = ( ^ [A: g > g > g,B: g] :
        ! [C: g] :
          ( ( ( A @ B @ C )
            = C )
          & ( ( A @ C @ B )
            = C ) ) ) ) ).

thf(1,conjecture,
    ! [A: g > g > g] :
      ( ( ? [B: g] : ( cGROUP1 @ A @ B ) )
      = ( cGROUP4 @ A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEQUIV_01_04) ).

thf(2,negated_conjecture,
    ~ ! [A: g > g > g] :
        ( ( ? [B: g] : ( cGROUP1 @ A @ B ) )
        = ( cGROUP4 @ A ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: g > g > g] :
        ( ( ? [B: g] :
              ( ! [C: g,D: g,E: g] :
                  ( ( A @ ( A @ C @ D ) @ E )
                  = ( A @ C @ ( A @ D @ E ) ) )
              & ! [C: g] :
                  ( ( ( A @ B @ C )
                    = C )
                  & ( ( A @ C @ B )
                    = C ) )
              & ! [C: g] :
                ? [D: g] :
                  ( ( ( A @ C @ D )
                    = B )
                  & ( ( A @ D @ C )
                    = B ) ) ) )
        = ( ! [B: g,C: g,D: g] :
              ( ( A @ ( A @ B @ C ) @ D )
              = ( A @ B @ ( A @ C @ D ) ) )
          & ! [B: g,C: g] :
              ( ? [D: g] :
                  ( ( A @ B @ D )
                  = C )
              & ? [D: g] :
                  ( ( A @ D @ B )
                  = C ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ALG276^5 : TPTP v9.3.1. Bugfixed v5.3.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.09/0.21  % Computer : n002.cluster.edu
% 0.09/0.21  % Model    : x86_64 x86_64
% 0.09/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21  % Memory   : 8046.5625MB
% 0.09/0.21  % OS       : Linux 6.8.0-71-generic
% 0.09/0.21  % CPULimit : 300
% 0.09/0.21  % WCLimit  : 300
% 0.09/0.21  % DateTime : Tue Sep 29 17:38:52 UTC 2026
% 0.09/0.21  % CPUTime  : 
% 0.09/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.84/0.78  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.16/0.98  % [INFO] 	 Parsing done (194ms). 
% 1.16/0.99  % [INFO] 	 Running in sequential loop mode. 
% 1.81/1.38  % [INFO] 	 eprover registered as external prover. 
% 1.81/1.39  % [INFO] 	 Scanning for conjecture ... 
% 2.17/1.51  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.17/1.54  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.17/1.54  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.17/1.54  % [INFO] 	 Type checking passed. 
% 2.17/1.55  % [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.82/2.24  % External prover 'e' found a proof!
% 3.82/2.24  % [INFO] 	 Killing All external provers ... 
% 3.82/2.24  % Time passed: 1891ms (effective reasoning time: 1243ms)
% 3.82/2.24  % 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.82/2.24  % Axioms used in derivation (0): 
% 3.82/2.24  % No. of inferences in proof: 4
% 3.82/2.25  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1891 ms resp. 1243 ms w/o parsing
% 4.02/2.30  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.02/2.30  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------