↑ Up

Leo-III---1.8.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Leo-III---1.8.0
% Problem  : MGT060+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 08:00:48 AM UTC 2026

% Result   : Theorem 5.92s 3.50s
% Output   : Refutation 6.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   28 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   95 (  18 equ;   0 cnn)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  263 (  17   ~;  10   |;  29   &; 179   @)
%                                         (   3 <=>;  25  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  14 usr;   6 con; 0-2 aty)
%            Number of variables   :   39 (   0   ^;  39   !;   0   ?;  39   :)

% Comments : 
%------------------------------------------------------------------------------
thf(organization_decl,type,
    organization: $i > $o ).

thf(has_immunity_decl,type,
    has_immunity: $i > $i > $o ).

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

thf(hazard_of_mortality_decl,type,
    hazard_of_mortality: $i > $i > $i ).

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

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

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

thf(very_low_decl,type,
    very_low: $i ).

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

thf(positional_advantage_decl,type,
    positional_advantage: $i > $i > $o ).

thf(low_decl,type,
    low: $i ).

thf(mod1_decl,type,
    mod1: $i ).

thf(mod2_decl,type,
    mod2: $i ).

thf(high_decl,type,
    high: $i ).

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

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

thf(12,axiom,
    very_low @ ( low @ greater ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_18c) ).

thf(74,plain,
    very_low @ ( low @ greater ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).

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

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

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

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

thf(11,axiom,
    low @ ( mod1 @ greater ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_18b) ).

thf(73,plain,
    low @ ( mod1 @ greater ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).

thf(14,axiom,
    low @ ( mod2 @ greater ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_18e) ).

thf(76,plain,
    low @ ( mod2 @ greater ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).

thf(10,axiom,
    mod1 @ ( high @ greater ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_18a) ).

thf(72,plain,
    mod1 @ ( high @ greater ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).

thf(9,axiom,
    ! [A: $i,B: $i] :
      ( ( A @ organization )
     => ( ( ~ ( B @ ( A @ has_immunity ) )
         => ( ( ( ~ ( B @ ( A @ positional_advantage ) )
                & ~ ( B @ ( A @ is_aligned ) ) )
             => ( ( B @ ( A @ hazard_of_mortality ) )
                = high ) )
            & ( ( ~ ( B @ ( A @ positional_advantage ) )
                & ( B @ ( A @ is_aligned ) ) )
             => ( ( B @ ( A @ hazard_of_mortality ) )
                = mod2 ) )
            & ( ( ( B @ ( A @ positional_advantage ) )
                & ~ ( B @ ( A @ is_aligned ) ) )
             => ( ( B @ ( A @ hazard_of_mortality ) )
                = mod1 ) )
            & ( ( ( B @ ( A @ positional_advantage ) )
                & ( B @ ( A @ is_aligned ) ) )
             => ( ( B @ ( A @ hazard_of_mortality ) )
                = low ) ) ) )
        & ( ( B @ ( A @ has_immunity ) )
         => ( ( B @ ( A @ hazard_of_mortality ) )
            = very_low ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_17) ).

thf(55,plain,
    ! [A: $i,B: $i] :
      ( ( A @ organization )
     => ( ( ~ ( B @ ( A @ has_immunity ) )
         => ( ( ( ~ ( B @ ( A @ positional_advantage ) )
                & ~ ( B @ ( A @ is_aligned ) ) )
             => ( ( B @ ( A @ hazard_of_mortality ) )
                = high ) )
            & ( ( ~ ( B @ ( A @ positional_advantage ) )
                & ( B @ ( A @ is_aligned ) ) )
             => ( ( B @ ( A @ hazard_of_mortality ) )
                = mod2 ) )
            & ( ( ( B @ ( A @ positional_advantage ) )
                & ~ ( B @ ( A @ is_aligned ) ) )
             => ( ( B @ ( A @ hazard_of_mortality ) )
                = mod1 ) )
            & ( ( ( B @ ( A @ positional_advantage ) )
                & ( B @ ( A @ is_aligned ) ) )
             => ( ( B @ ( A @ hazard_of_mortality ) )
                = low ) ) ) )
        & ( ( B @ ( A @ has_immunity ) )
         => ( ( B @ ( A @ hazard_of_mortality ) )
            = very_low ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(13,axiom,
    mod2 @ ( high @ greater ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_18d) ).

thf(75,plain,
    mod2 @ ( high @ greater ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).

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

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

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

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

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

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

thf(1,conjecture,
    ! [A: $i,B: $i,C: $i] :
      ( ( ~ ( C @ ( A @ has_immunity ) )
        & ( B @ ( A @ has_immunity ) )
        & ( A @ organization ) )
     => ( B @ ( A @ hazard_of_mortality ) @ ( C @ ( A @ hazard_of_mortality ) @ greater ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_3) ).

thf(2,negated_conjecture,
    ~ ! [A: $i,B: $i,C: $i] :
        ( ( ~ ( C @ ( A @ has_immunity ) )
          & ( B @ ( A @ has_immunity ) )
          & ( A @ organization ) )
       => ( B @ ( A @ hazard_of_mortality ) @ ( C @ ( A @ hazard_of_mortality ) @ greater ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(15,plain,
    ~ ! [A: $i,B: $i,C: $i] :
        ( ( ~ ( C @ ( A @ has_immunity ) )
          & ( B @ ( A @ has_immunity ) )
          & ( A @ organization ) )
       => ( B @ ( A @ hazard_of_mortality ) @ ( C @ ( A @ hazard_of_mortality ) @ greater ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(93,plain,
    $false,
    inference(e,[status(thm)],[52,74,21,41,73,76,72,55,75,50,31,47,15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : MGT060+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.12  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.24/0.50  % Computer : n015.cluster.edu
% 0.24/0.50  % Model    : x86_64 x86_64
% 0.24/0.50  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.50  % Memory   : 8046.5625MB
% 0.24/0.50  % OS       : Linux 6.8.0-71-generic
% 0.24/0.50  % CPULimit : 300
% 0.24/0.50  % WCLimit  : 300
% 0.24/0.50  % DateTime : Sat Sep 26 00:13:58 UTC 2026
% 0.24/0.50  % CPUTime  : 
% 0.28/0.50  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 1.44/1.34  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 2.00/1.64  % [INFO] 	 Parsing done (297ms). 
% 2.00/1.66  % [INFO] 	 Running in sequential loop mode. 
% 3.08/2.25  % [INFO] 	 eprover registered as external prover. 
% 3.08/2.26  % [INFO] 	 Scanning for conjecture ... 
% 3.50/2.41  % [INFO] 	 Found a conjecture (or negated_conjecture) and 12 axioms. Running axiom selection ... 
% 3.50/2.47  % [INFO] 	 Axiom selection finished. Selected 12 axioms (removed 0 axioms). 
% 3.73/2.51  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 3.73/2.52  % [INFO] 	 Type checking passed. 
% 3.73/2.53  % [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 ... 
% 5.92/3.49  % External prover 'e' found a proof!
% 5.92/3.49  % [INFO] 	 Killing All external provers ... 
% 5.92/3.49  % Time passed: 2784ms (effective reasoning time: 1821ms)
% 5.92/3.49  % 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)>
% 5.92/3.50  % Axioms used in derivation (12): assumption_18c, assumption_17, assumption_18b, assumption_18d, definition_smaller, assumption_18e, meaning_postulate_greater_comparable, meaning_postulate_greater_transitive, meaning_postulate_greater_strict, definition_greater_or_equal, assumption_18a, definition_smaller_or_equal
% 5.92/3.50  % No. of inferences in proof: 28
% 5.92/3.50  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2784 ms resp. 1821 ms w/o parsing
% 6.38/3.54  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.38/3.54  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------