%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : BOO071-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n009.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 10:12:04 EDT 2023

% Result   : Unsatisfiable 3.50s 2.02s
% Output   : Refutation 3.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    6
% Syntax   : Number of formulae    :    9 (   5 unt;   4 typ;   0 def)
%            Number of atoms       :    5 (   4 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   56 (   2   ~;   0   |;   0   &;  54   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   3 con; 0-3 aty)
%            Number of variables   :   14 (   0   ^;  14   !;   0   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
thf(multiply_type,type,
    multiply: $i > $i > $i > $i ).

thf(inverse_type,type,
    inverse: $i > $i ).

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

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

thf(1,negated_conjecture,
    ( ( multiply @ ( inverse @ b ) @ b @ a )
   != a ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_tba_axioms_5) ).

thf(3,plain,
    ( ( multiply @ ( inverse @ b ) @ b @ a )
   != a ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(2,axiom,
    ! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
      ( ( multiply @ ( multiply @ A @ ( inverse @ A ) @ B ) @ ( inverse @ ( multiply @ ( multiply @ C @ D @ E ) @ F @ ( multiply @ C @ D @ G ) ) ) @ ( multiply @ D @ ( multiply @ G @ F @ E ) @ C ) )
      = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).

thf(6,plain,
    ! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
      ( ( multiply @ ( multiply @ A @ ( inverse @ A ) @ B ) @ ( inverse @ ( multiply @ ( multiply @ C @ D @ E ) @ F @ ( multiply @ C @ D @ G ) ) ) @ ( multiply @ D @ ( multiply @ G @ F @ E ) @ C ) )
      = B ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : BOO071-1 : TPTP v8.1.2. Released v2.6.0.
% 0.13/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.37  % Computer : n009.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Thu May 18 21:00:18 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 0.96/0.87  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.30/1.02  % [INFO] 	 Parsing done (147ms). 
% 1.30/1.03  % [INFO] 	 Running in sequential loop mode. 
% 1.65/1.29  % [INFO] 	 eprover registered as external prover. 
% 1.65/1.30  % [INFO] 	 cvc4 registered as external prover. 
% 1.65/1.30  % [INFO] 	 Scanning for conjecture ... 
% 1.86/1.35  % [INFO] 	 Found a conjecture and 1 axioms. Running axiom selection ... 
% 1.86/1.37  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 1.86/1.37  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.86/1.38  % [INFO] 	 Type checking passed. 
% 1.86/1.38  % [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.50/2.02  % External prover 'e' found a proof!
% 3.50/2.02  % [INFO] 	 Killing All external provers ... 
% 3.50/2.02  % Time passed: 1497ms (effective reasoning time: 981ms)
% 3.50/2.02  % 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.50/2.02  % Axioms used in derivation (1): single_axiom
% 3.50/2.02  % No. of inferences in proof: 5
% 3.50/2.02  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1497 ms resp. 981 ms w/o parsing
% 3.50/2.04  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.50/2.04  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------