TSTP Solution File: BOO022-1 by Leo-III---1.7.7

View Problem - Process Solution

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

% Computer : n002.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:11:58 EDT 2023

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

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

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

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

thf(c_type,type,
    c: $i ).

thf(add_type,type,
    add: $i > $i > $i ).

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

thf(n1_type,type,
    n1: $i ).

thf(n0_type,type,
    n0: $i ).

thf(7,axiom,
    ! [A: $i] :
      ( ( multiply @ A @ ( inverse @ A ) )
      = n0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_inverse) ).

thf(21,plain,
    ! [A: $i] :
      ( ( multiply @ A @ ( inverse @ A ) )
      = n0 ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(3,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ( multiply @ A @ ( add @ B @ C ) )
      = ( add @ ( multiply @ B @ A ) @ ( multiply @ C @ A ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_add_property) ).

thf(13,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( multiply @ A @ ( add @ B @ C ) )
      = ( add @ ( multiply @ B @ A ) @ ( multiply @ C @ A ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

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

thf(17,plain,
    ! [B: $i,A: $i] :
      ( ( add @ ( multiply @ A @ B ) @ B )
      = B ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(2,axiom,
    ! [B: $i,A: $i] :
      ( ( multiply @ ( add @ A @ B ) @ B )
      = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_add) ).

thf(11,plain,
    ! [B: $i,A: $i] :
      ( ( multiply @ ( add @ A @ B ) @ B )
      = B ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

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

thf(6,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ( add @ A @ ( multiply @ B @ C ) )
      = ( multiply @ ( add @ B @ A ) @ ( add @ C @ A ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_multiply_property) ).

thf(19,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( add @ A @ ( multiply @ B @ C ) )
      = ( multiply @ ( add @ B @ A ) @ ( add @ C @ A ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(4,axiom,
    ! [A: $i] :
      ( ( add @ A @ ( inverse @ A ) )
      = n1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_inverse) ).

thf(15,plain,
    ! [A: $i] :
      ( ( add @ A @ ( inverse @ A ) )
      = n1 ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(72,plain,
    $false,
    inference(e,[status(thm)],[21,13,17,11,8,19,15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : BOO022-1 : TPTP v8.1.2. Released v2.2.0.
% 0.06/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.36  % Computer : n002.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 : Thu May 18 21:20:35 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 1.00/0.90  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.30/1.04  % [INFO] 	 Parsing done (138ms). 
% 1.30/1.05  % [INFO] 	 Running in sequential loop mode. 
% 1.66/1.28  % [INFO] 	 eprover registered as external prover. 
% 1.66/1.28  % [INFO] 	 cvc4 registered as external prover. 
% 1.66/1.29  % [INFO] 	 Scanning for conjecture ... 
% 1.86/1.34  % [INFO] 	 Found a conjecture and 6 axioms. Running axiom selection ... 
% 1.86/1.36  % [INFO] 	 Axiom selection finished. Selected 6 axioms (removed 0 axioms). 
% 2.03/1.37  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 2.03/1.38  % [INFO] 	 Type checking passed. 
% 2.03/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.89/1.91  % External prover 'e' found a proof!
% 3.89/1.92  % [INFO] 	 Killing All external provers ... 
% 3.89/1.92  % Time passed: 1397ms (effective reasoning time: 863ms)
% 3.89/1.92  % 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.89/1.92  % Axioms used in derivation (6): multiply_add, additive_inverse, multiply_add_property, add_multiply, add_multiply_property, multiplicative_inverse
% 3.89/1.92  % No. of inferences in proof: 15
% 3.89/1.92  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1397 ms resp. 863 ms w/o parsing
% 3.89/1.94  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.89/1.94  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------