↑ 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  : NUM787^1 : TPTP v9.3.1. Released v3.7.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 : n018.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:11 AM UTC 2026

% Result   : Theorem 3.16s 2.09s
% Output   : Refutation 3.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   17 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   38 (   2 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  100 (  19   ~;   9   |;   1   &;  64   @)
%                                         (   0 <=>;   7  =>;   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 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   10 (   0   ^;  10   !;   0   ?;  10   :)

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

thf(x0_decl,type,
    x0: rat ).

thf(y0_decl,type,
    y0: rat ).

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

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

thf(is_decl,type,
    is: rat > rat > $o ).

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

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

thf(14,plain,
    ! [B: rat,A: rat] :
      ( ( is @ A @ B )
      | ( more @ A @ B )
      | ( less @ A @ B ) ),
    inference(cnf,[status(esa)],[13]) ).

thf(1,conjecture,
    ( ~ ( more @ x0 @ y0 )
   => ( is @ x0 @ y0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81f) ).

thf(2,negated_conjecture,
    ~ ( ~ ( more @ x0 @ y0 )
     => ( is @ x0 @ y0 ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(6,plain,
    ~ ( ~ ( more @ x0 @ y0 )
     => ( is @ x0 @ y0 ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(7,plain,
    ( ~ ( more @ x0 @ y0 )
    & ~ ( is @ x0 @ y0 ) ),
    inference(cnf,[status(esa)],[6]) ).

thf(9,plain,
    ~ ( is @ x0 @ y0 ),
    inference(cnfConj,[status(thm)],[7]) ).

thf(15,plain,
    ! [B: rat,A: rat] :
      ( ( more @ A @ B )
      | ( less @ A @ B )
      | ~ $true
      | ( ( is @ A @ B )
       != ( is @ x0 @ y0 ) ) ),
    inference(paramod_ordered,[status(thm)],[14,9]) ).

thf(16,plain,
    ! [B: rat,A: rat] :
      ( ( more @ A @ B )
      | ( less @ A @ B )
      | ( ( is @ A @ B )
       != ( is @ x0 @ y0 ) ) ),
    inference(simp,[status(thm)],[15]) ).

thf(17,plain,
    ( ( more @ x0 @ y0 )
    | ( less @ x0 @ y0 ) ),
    inference(pattern_uni,[status(thm)],[16:[bind(A,$thf( x0 )),bind(B,$thf( y0 ))]]) ).

thf(8,plain,
    ~ ( more @ x0 @ y0 ),
    inference(cnfConj,[status(thm)],[7]) ).

thf(3,axiom,
    ~ ( less @ x0 @ y0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).

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

thf(11,plain,
    ~ ( less @ x0 @ y0 ),
    inference(polarity_switch,[status(thm)],[10]) ).

thf(18,plain,
    ( $false
    | $false ),
    inference(rewrite,[status(thm)],[17,8,11]) ).

thf(19,plain,
    $false,
    inference(simp,[status(thm)],[18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM787^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07  % 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.09/0.18  % Computer : n018.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Tue Sep 29 12:58:55 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  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
% 0.87/0.77  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.17/0.95  % [INFO] 	 Parsing done (177ms). 
% 1.17/0.97  % [INFO] 	 Running in sequential loop mode. 
% 1.75/1.36  % [INFO] 	 eprover registered as external prover. 
% 1.75/1.37  % [INFO] 	 Scanning for conjecture ... 
% 1.93/1.45  % [INFO] 	 Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ... 
% 1.93/1.48  % [INFO] 	 Axiom selection finished. Selected 3 axioms (removed 0 axioms). 
% 2.08/1.50  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.08/1.51  % [INFO] 	 Type checking passed. 
% 2.08/1.51  % [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.16/2.09  % [INFO] 	 Killing All external provers ... 
% 3.16/2.09  % Time passed: 1755ms (effective reasoning time: 1114ms)
% 3.16/2.09  % 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.16/2.09  % Axioms used in derivation (2): satz81a, n
% 3.16/2.09  % No. of inferences in proof: 17
% 3.16/2.09  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1755 ms resp. 1114 ms w/o parsing
% 3.16/2.13  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.16/2.13  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------