↑ 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  : NUM792^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39

% Computer : n011.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 : Wed Sep 30 08:18:12 AM UTC 2026

% Result   : Theorem 3.37s 2.05s
% Output   : Refutation 3.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   16 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   26 (   0 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   62 (   2   ~;   0   |;   0   &;  50   @)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   18 (   0   ^;  18   !;   0   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
thf(rat_type,type,
    rat: $tType ).

thf(x0_decl,type,
    x0: rat ).

thf(y0_decl,type,
    y0: rat ).

thf(z0_decl,type,
    z0: rat ).

thf(moreis_decl,type,
    moreis: rat > rat > $o ).

thf(more_decl,type,
    more: rat > rat > $o ).

thf(less_decl,type,
    less: rat > rat > $o ).

thf(lessis_decl,type,
    lessis: rat > rat > $o ).

thf(3,axiom,
    moreis @ x0 @ y0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).

thf(10,plain,
    moreis @ x0 @ y0,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(6,axiom,
    ! [A: rat,B: rat,C: rat] :
      ( ( less @ A @ B )
     => ( ( lessis @ B @ C )
       => ( less @ A @ C ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz87b) ).

thf(14,plain,
    ! [A: rat,B: rat,C: rat] :
      ( ( less @ A @ B )
     => ( ( lessis @ B @ C )
       => ( less @ A @ C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(1,conjecture,
    more @ x0 @ z0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz87c) ).

thf(2,negated_conjecture,
    ~ ( more @ x0 @ z0 ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(9,plain,
    ~ ( more @ x0 @ z0 ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(7,axiom,
    ! [A: rat,B: rat] :
      ( ( more @ A @ B )
     => ( less @ B @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz82) ).

thf(17,plain,
    ! [A: rat,B: rat] :
      ( ( more @ A @ B )
     => ( less @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(5,axiom,
    ! [A: rat,B: rat] :
      ( ( less @ A @ B )
     => ( more @ B @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz83) ).

thf(12,plain,
    ! [A: rat,B: rat] :
      ( ( less @ A @ B )
     => ( more @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(4,axiom,
    more @ y0 @ z0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n) ).

thf(11,plain,
    more @ y0 @ z0,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(8,axiom,
    ! [A: rat,B: rat] :
      ( ( moreis @ A @ B )
     => ( lessis @ B @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz84) ).

thf(19,plain,
    ! [A: rat,B: rat] :
      ( ( moreis @ A @ B )
     => ( lessis @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(21,plain,
    $false,
    inference(e,[status(thm)],[10,14,9,17,12,11,19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM792^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.10/0.22  % Computer : n011.cluster.edu
% 0.10/0.22  % Model    : x86_64 x86_64
% 0.10/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.22  % Memory   : 8046.5625MB
% 0.10/0.22  % OS       : Linux 6.8.0-71-generic
% 0.10/0.22  % CPULimit : 300
% 0.10/0.22  % WCLimit  : 300
% 0.10/0.22  % DateTime : Tue Sep 29 12:58:19 UTC 2026
% 0.10/0.22  % CPUTime  : 
% 0.10/0.22  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.89/0.80  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.23/0.99  % [INFO] 	 Parsing done (193ms). 
% 1.23/1.01  % [INFO] 	 Running in sequential loop mode. 
% 2.02/1.42  % [INFO] 	 eprover registered as external prover. 
% 2.02/1.43  % [INFO] 	 Scanning for conjecture ... 
% 2.19/1.50  % [INFO] 	 Found a conjecture (or negated_conjecture) and 6 axioms. Running axiom selection ... 
% 2.19/1.53  % [INFO] 	 Axiom selection finished. Selected 6 axioms (removed 0 axioms). 
% 2.19/1.56  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.19/1.56  % [INFO] 	 Type checking passed. 
% 2.19/1.57  % [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.37/2.05  % External prover 'e' found a proof!
% 3.37/2.05  % [INFO] 	 Killing All external provers ... 
% 3.37/2.05  % Time passed: 1683ms (effective reasoning time: 1036ms)
% 3.37/2.05  % 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.37/2.05  % Axioms used in derivation (6): n, m, satz83, satz82, satz87b, satz84
% 3.37/2.05  % No. of inferences in proof: 16
% 3.37/2.05  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1683 ms resp. 1036 ms w/o parsing
% 3.37/2.09  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.37/2.09  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------