TSTP Solution File: GRP655+1 by Leo-III---1.7.7

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : GRP655+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n031.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri May 19 11:15:00 EDT 2023

% Result   : Theorem 67.74s 12.14s
% Output   : Refutation 67.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   17 (  11 unt;   3 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  :    6 (   6   >;   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_type,type,
    mult: $i > $i > $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GRP655+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.36  % Computer : n031.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Fri May 19 02:00:26 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.85/0.85  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.15/0.96  % [INFO] 	 Parsing done (113ms). 
% 1.15/0.97  % [INFO] 	 Running in sequential loop mode. 
% 1.47/1.16  % [INFO] 	 eprover registered as external prover. 
% 1.47/1.17  % [INFO] 	 cvc4 registered as external prover. 
% 1.47/1.17  % [INFO] 	 Scanning for conjecture ... 
% 1.72/1.22  % [INFO] 	 Found a conjecture and 5 axioms. Running axiom selection ... 
% 1.82/1.24  % [INFO] 	 Axiom selection finished. Selected 5 axioms (removed 0 axioms). 
% 1.82/1.25  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.82/1.26  % [INFO] 	 Type checking passed. 
% 1.82/1.26  % [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 ... 
% 67.74/12.14  % External prover 'e' found a proof!
% 67.74/12.14  % [INFO] 	 Killing All external provers ... 
% 67.74/12.14  % Time passed: 11614ms (effective reasoning time: 11171ms)
% 67.74/12.14  % 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)>
% 67.74/12.14  % Axioms used in derivation (5): f03, f02, f05, f04, f01
% 67.74/12.14  % No. of inferences in proof: 14
% 67.74/12.14  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 11614 ms resp. 11171 ms w/o parsing
% 67.74/12.17  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 67.74/12.17  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------