TSTP Solution File: HEN011-3 by Leo-III---1.7.7

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : HEN011-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n013.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:16:56 EDT 2023

% Result   : Unsatisfiable 3.22s 1.71s
% Output   : Refutation 3.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   37 (  21 unt;  10 typ;   0 def)
%            Number of atoms       :   35 (  18 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  140 (  12   ~;   8   |;   0   &; 120   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (  10 usr;   9 con; 0-2 aty)
%            Number of variables   :   26 (   0   ^;  26   !;   0   ?;  26   :)

% Comments : 
%------------------------------------------------------------------------------
thf(divide_type,type,
    divide: $i > $i > $i ).

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

thf(g_type,type,
    g: $i ).

thf(d_type,type,
    d: $i ).

thf(e_type,type,
    e: $i ).

thf(less_equal_type,type,
    less_equal: $i > $i > $o ).

thf(zero_type,type,
    zero: $i ).

thf(identity_type,type,
    identity: $i ).

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

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

thf(1,negated_conjecture,
    ( ( divide @ c @ g )
   != ( divide @ d @ e ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_commutativity) ).

thf(14,plain,
    ( ( divide @ c @ g )
   != ( divide @ d @ e ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(10,axiom,
    ( ( divide @ identity @ a )
    = c ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_a) ).

thf(33,plain,
    ( ( divide @ identity @ a )
    = c ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).

thf(2,axiom,
    ! [B: $i,A: $i] :
      ( ~ ( less_equal @ A @ B )
      | ( ( divide @ A @ B )
        = zero ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quotient_less_equal1) ).

thf(17,plain,
    ! [B: $i,A: $i] :
      ( ~ ( less_equal @ A @ B )
      | ( ( divide @ A @ B )
        = zero ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(13,axiom,
    ( ( divide @ identity @ d )
    = g ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_d) ).

thf(39,plain,
    ( ( divide @ identity @ d )
    = g ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).

thf(11,axiom,
    ( ( divide @ identity @ b )
    = d ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_b) ).

thf(35,plain,
    ( ( divide @ identity @ b )
    = d ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).

thf(9,axiom,
    ( ( divide @ ( divide @ identity @ a ) @ ( divide @ identity @ ( divide @ identity @ b ) ) )
   != ( divide @ ( divide @ identity @ b ) @ ( divide @ identity @ ( divide @ identity @ a ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',part_of_theorem) ).

thf(30,plain,
    ( ( divide @ ( divide @ identity @ a ) @ ( divide @ identity @ ( divide @ identity @ b ) ) )
   != ( divide @ ( divide @ identity @ b ) @ ( divide @ identity @ ( divide @ identity @ a ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(5,axiom,
    ! [C: $i,B: $i,A: $i] : ( less_equal @ ( divide @ ( divide @ A @ B ) @ ( divide @ C @ B ) ) @ ( divide @ ( divide @ A @ C ) @ B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quotient_property) ).

thf(24,plain,
    ! [C: $i,B: $i,A: $i] : ( less_equal @ ( divide @ ( divide @ A @ B ) @ ( divide @ C @ B ) ) @ ( divide @ ( divide @ A @ C ) @ B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(12,axiom,
    ( ( divide @ identity @ c )
    = e ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_c) ).

thf(37,plain,
    ( ( divide @ identity @ c )
    = e ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).

thf(6,axiom,
    ! [A: $i] : ( less_equal @ zero @ A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zero_is_smallest) ).

thf(25,plain,
    ! [A: $i] : ( less_equal @ zero @ A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(3,axiom,
    ! [B: $i,A: $i] :
      ( ( ( divide @ A @ B )
       != zero )
      | ( less_equal @ A @ B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quotient_less_equal2) ).

thf(20,plain,
    ! [B: $i,A: $i] :
      ( ( ( divide @ A @ B )
       != zero )
      | ( less_equal @ A @ B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(8,axiom,
    ! [A: $i] : ( less_equal @ A @ identity ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_is_largest) ).

thf(29,plain,
    ! [A: $i] : ( less_equal @ A @ identity ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(7,axiom,
    ! [B: $i,A: $i] :
      ( ~ ( less_equal @ A @ B )
      | ~ ( less_equal @ B @ A )
      | ( A = B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_equal_and_equal) ).

thf(26,plain,
    ! [B: $i,A: $i] :
      ( ~ ( less_equal @ A @ B )
      | ~ ( less_equal @ B @ A )
      | ( A = B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(4,axiom,
    ! [B: $i,A: $i] : ( less_equal @ ( divide @ A @ B ) @ A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quotient_smaller_than_numerator) ).

thf(23,plain,
    ! [B: $i,A: $i] : ( less_equal @ ( divide @ A @ B ) @ A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(94,plain,
    $false,
    inference(e,[status(thm)],[14,33,17,39,35,30,24,37,25,20,29,26,23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : HEN011-3 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.35  % Computer : n013.cluster.edu
% 0.16/0.35  % Model    : x86_64 x86_64
% 0.16/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35  % Memory   : 8042.1875MB
% 0.16/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35  % CPULimit : 300
% 0.16/0.35  % WCLimit  : 300
% 0.16/0.35  % DateTime : Thu May 18 15:11:06 EDT 2023
% 0.16/0.36  % CPUTime  : 
% 0.94/0.89  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.28/1.01  % [INFO] 	 Parsing done (125ms). 
% 1.28/1.02  % [INFO] 	 Running in sequential loop mode. 
% 1.60/1.21  % [INFO] 	 eprover registered as external prover. 
% 1.60/1.21  % [INFO] 	 cvc4 registered as external prover. 
% 1.60/1.22  % [INFO] 	 Scanning for conjecture ... 
% 1.78/1.27  % [INFO] 	 Found a conjecture and 12 axioms. Running axiom selection ... 
% 1.91/1.29  % [INFO] 	 Axiom selection finished. Selected 12 axioms (removed 0 axioms). 
% 1.91/1.30  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.91/1.30  % [INFO] 	 Type checking passed. 
% 1.91/1.31  % [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.22/1.71  % External prover 'e' found a proof!
% 3.22/1.71  % [INFO] 	 Killing All external provers ... 
% 3.22/1.71  % Time passed: 1190ms (effective reasoning time: 688ms)
% 3.22/1.71  % 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.22/1.71  % Axioms used in derivation (12): identity_is_largest, identity_divide_a, identity_divide_b, part_of_theorem, identity_divide_c, quotient_less_equal2, less_equal_and_equal, quotient_less_equal1, quotient_smaller_than_numerator, quotient_property, identity_divide_d, zero_is_smallest
% 3.22/1.71  % No. of inferences in proof: 27
% 3.22/1.71  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1190 ms resp. 688 ms w/o parsing
% 3.27/1.79  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.27/1.79  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------