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

View Problem - Process Solution

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

% Computer : n021.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:35:27 EDT 2023

% Result   : Theorem 3.03s 1.70s
% Output   : Refutation 3.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   25 (   1 unt;   7 typ;   0 def)
%            Number of atoms       :   65 (   8 equ;   0 cnn)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  174 (   7   ~;  10   |;  14   &; 120   @)
%                                         (   7 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   8 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   14 (  14   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   1 con; 0-3 aty)
%            Number of variables   :   41 (   0   ^;  41   !;   0   ?;  41   :)

% Comments : 
%------------------------------------------------------------------------------
thf(dissimilar_type,type,
    dissimilar: $i > $i > $i > $o ).

thf(smaller_or_equal_type,type,
    smaller_or_equal: $i > $i > $o ).

thf(smaller_type,type,
    smaller: $i > $i > $o ).

thf(greater_or_equal_type,type,
    greater_or_equal: $i > $i > $o ).

thf(greater_type,type,
    greater: $i > $i > $o ).

thf(organization_type,type,
    organization: $i > $o ).

thf(is_aligned_type,type,
    is_aligned: $i > $i > $o ).

thf(1,conjecture,
    ! [A: $i,B: $i,C: $i] :
      ( ( dissimilar @ A @ B @ C )
    <=> ( dissimilar @ A @ C @ B ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_7) ).

thf(2,negated_conjecture,
    ~ ! [A: $i,B: $i,C: $i] :
        ( ( dissimilar @ A @ B @ C )
      <=> ( dissimilar @ A @ C @ B ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(10,plain,
    ~ ! [A: $i,B: $i,C: $i] :
        ( ( ( dissimilar @ A @ B @ C )
         => ( dissimilar @ A @ C @ B ) )
        & ( ( dissimilar @ A @ C @ B )
         => ( dissimilar @ A @ B @ C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(5,axiom,
    ! [A: $i,B: $i] :
      ( ( smaller @ A @ B )
    <=> ( greater @ B @ A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_smaller) ).

thf(34,plain,
    ! [A: $i,B: $i] :
      ( ( ( smaller @ A @ B )
       => ( greater @ B @ A ) )
      & ( ( greater @ B @ A )
       => ( smaller @ A @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(8,axiom,
    ! [A: $i,B: $i] :
      ( ( smaller @ A @ B )
      | ( A = B )
      | ( greater @ A @ B ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',meaning_postulate_greater_comparable) ).

thf(44,plain,
    ! [A: $i,B: $i] :
      ( ( smaller @ A @ B )
      | ( A = B )
      | ( greater @ A @ B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(6,axiom,
    ! [A: $i,B: $i] :
      ~ ( ( greater @ A @ B )
        & ( greater @ B @ A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',meaning_postulate_greater_strict) ).

thf(39,plain,
    ! [A: $i,B: $i] :
      ~ ( ( greater @ A @ B )
        & ( greater @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(3,axiom,
    ! [A: $i,B: $i] :
      ( ( smaller_or_equal @ A @ B )
    <=> ( ( smaller @ A @ B )
        | ( A = B ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_smaller_or_equal) ).

thf(16,plain,
    ! [A: $i,B: $i] :
      ( ( ( smaller_or_equal @ A @ B )
       => ( ( smaller @ A @ B )
          | ( A = B ) ) )
      & ( ( ( smaller @ A @ B )
          | ( A = B ) )
       => ( smaller_or_equal @ A @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(9,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( dissimilar @ A @ B @ C )
    <=> ( ( organization @ A )
        & ~ ( ( is_aligned @ A @ B )
          <=> ( is_aligned @ A @ C ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_2) ).

thf(47,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( dissimilar @ A @ B @ C )
       => ( ( organization @ A )
          & ~ ( ( ( is_aligned @ A @ B )
               => ( is_aligned @ A @ C ) )
              & ( ( is_aligned @ A @ C )
               => ( is_aligned @ A @ B ) ) ) ) )
      & ( ( ( organization @ A )
          & ~ ( ( ( is_aligned @ A @ B )
               => ( is_aligned @ A @ C ) )
              & ( ( is_aligned @ A @ C )
               => ( is_aligned @ A @ B ) ) ) )
       => ( dissimilar @ A @ B @ C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(7,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( greater @ A @ B )
        & ( greater @ B @ C ) )
     => ( greater @ A @ C ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',meaning_postulate_greater_transitive) ).

thf(42,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( greater @ A @ B )
        & ( greater @ B @ C ) )
     => ( greater @ A @ C ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(4,axiom,
    ! [A: $i,B: $i] :
      ( ( greater_or_equal @ A @ B )
    <=> ( ( greater @ A @ B )
        | ( A = B ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_greater_or_equal) ).

thf(25,plain,
    ! [A: $i,B: $i] :
      ( ( ( greater_or_equal @ A @ B )
       => ( ( greater @ A @ B )
          | ( A = B ) ) )
      & ( ( ( greater @ A @ B )
          | ( A = B ) )
       => ( greater_or_equal @ A @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(58,plain,
    $false,
    inference(e,[status(thm)],[10,34,44,39,16,47,42,25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : MGT053+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.36  % Computer : n021.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 23:39:58 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.97/0.89  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.13/1.02  % [INFO] 	 Parsing done (131ms). 
% 1.39/1.03  % [INFO] 	 Running in sequential loop mode. 
% 1.67/1.22  % [INFO] 	 eprover registered as external prover. 
% 1.67/1.22  % [INFO] 	 cvc4 registered as external prover. 
% 1.67/1.22  % [INFO] 	 Scanning for conjecture ... 
% 1.82/1.27  % [INFO] 	 Found a conjecture and 7 axioms. Running axiom selection ... 
% 1.82/1.29  % [INFO] 	 Axiom selection finished. Selected 7 axioms (removed 0 axioms). 
% 1.82/1.30  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.82/1.31  % [INFO] 	 Type checking passed. 
% 2.04/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.03/1.70  % External prover 'e' found a proof!
% 3.03/1.70  % [INFO] 	 Killing All external provers ... 
% 3.03/1.70  % Time passed: 1170ms (effective reasoning time: 667ms)
% 3.03/1.70  % 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.03/1.70  % Axioms used in derivation (7): definition_2, definition_smaller_or_equal, definition_smaller, meaning_postulate_greater_comparable, meaning_postulate_greater_transitive, meaning_postulate_greater_strict, definition_greater_or_equal
% 3.03/1.70  % No. of inferences in proof: 18
% 3.03/1.70  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1170 ms resp. 667 ms w/o parsing
% 3.03/1.78  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.03/1.78  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------