↑ 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  : NUM785_8 : TPTP v9.3.1. Released v8.0.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 : n008.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:09:59 AM UTC 2026

% Result   : Theorem 6.03s 13.61s
% Output   : Refutation 6.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   24 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   65 (   4 equ;   0 cnn)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  193 (  48   ~;  14   |;   2   &; 112   @)
%                                         (   0 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 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   :   30 (   0   ^;  30   !;   0   ?;  30   :)

% 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(is_decl,type,
    is: rat > rat > $o ).

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

thf(3,axiom,
    ( ~ ( y0 @ ( x0 @ less ) )
   => ( y0 @ ( x0 @ is ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).

thf(8,plain,
    ( ~ ( y0 @ ( x0 @ less ) )
   => ( y0 @ ( x0 @ is ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(9,plain,
    ( ( y0 @ ( x0 @ is ) )
    | ( y0 @ ( x0 @ less ) ) ),
    inference(cnf,[status(esa)],[8]) ).

thf(1,conjecture,
    ~ ( y0 @ ( x0 @ more ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81d) ).

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

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

thf(7,plain,
    y0 @ ( x0 @ more ),
    inference(polarity_switch,[status(thm)],[6]) ).

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

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

thf(12,plain,
    ~ ( ! [A: rat,B: rat] :
          ( ( B @ ( A @ is ) )
         => ~ ( B @ ( A @ more ) ) )
     => ( ! [A: rat,B: rat] :
            ( ( B @ ( A @ more ) )
           => ~ ( B @ ( A @ less ) ) )
       => ~ ! [A: rat,B: rat] :
              ( ( B @ ( A @ less ) )
             => ~ ( B @ ( A @ is ) ) ) ) ),
    inference(miniscope,[status(thm)],[11]) ).

thf(13,plain,
    ! [F: rat,E: rat,D: rat,C: rat,B: rat,A: rat] :
      ( ( ~ ( F @ ( E @ is ) )
        | ~ ( F @ ( E @ less ) ) )
      & ( ~ ( D @ ( C @ less ) )
        | ~ ( D @ ( C @ more ) ) )
      & ( ~ ( B @ ( A @ more ) )
        | ~ ( B @ ( A @ is ) ) ) ),
    inference(cnf,[status(esa)],[12]) ).

thf(14,plain,
    ! [B: rat,A: rat] :
      ( ~ ( B @ ( A @ more ) )
      | ~ ( B @ ( A @ is ) ) ),
    inference(cnfConj,[status(thm)],[13]) ).

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

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

thf(21,plain,
    ~ ( y0 @ ( x0 @ is ) ),
    inference(pattern_uni,[status(thm)],[20:[bind(A,$thf( x0 )),bind(B,$thf( y0 ))]]) ).

thf(25,plain,
    ( $false
    | ( y0 @ ( x0 @ less ) ) ),
    inference(rewrite,[status(thm)],[9,21]) ).

thf(26,plain,
    y0 @ ( x0 @ less ),
    inference(simp,[status(thm)],[25]) ).

thf(15,plain,
    ! [B: rat,A: rat] :
      ( ~ ( B @ ( A @ less ) )
      | ~ ( B @ ( A @ more ) ) ),
    inference(cnfConj,[status(thm)],[13]) ).

thf(17,plain,
    ! [B: rat,A: rat] :
      ( ~ ( B @ ( A @ less ) )
      | ~ ( B @ ( A @ more ) ) ),
    inference(simp,[status(thm)],[15]) ).

thf(27,plain,
    ! [B: rat,A: rat] :
      ( ( ( y0 @ ( x0 @ more ) )
       != ( B @ ( A @ more ) ) )
      | ~ ( B @ ( A @ less ) )
      | ~ $true ),
    inference(paramod_ordered,[status(thm)],[7,17]) ).

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

thf(29,plain,
    ~ ( y0 @ ( x0 @ less ) ),
    inference(pattern_uni,[status(thm)],[28:[bind(A,$thf( x0 )),bind(B,$thf( y0 ))]]) ).

thf(30,plain,
    $false,
    inference(rewrite,[status(thm)],[26,29]) ).

thf(31,plain,
    $false,
    inference(simp,[status(thm)],[30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM785_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.07  % 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.17/10.45  % Computer : n008.cluster.edu
% 0.17/10.45  % Model    : x86_64 x86_64
% 0.17/10.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/10.45  % Memory   : 8046.5625MB
% 0.17/10.45  % OS       : Linux 6.8.0-71-generic
% 0.17/10.45  % CPULimit : 300
% 0.17/10.45  % WCLimit  : 300
% 0.17/10.45  % DateTime : Sat Sep 26 04:06:39 UTC 2026
% 0.17/10.45  % CPUTime  : 
% 0.17/10.46  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
% 1.41/11.39  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.92/11.65  % [INFO] 	 Parsing done (259ms). 
% 1.92/11.68  % [INFO] 	 Running in sequential loop mode. 
% 2.87/12.29  % [INFO] 	 eprover registered as external prover. 
% 3.09/12.31  % [INFO] 	 Scanning for conjecture ... 
% 3.25/12.44  % [INFO] 	 Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ... 
% 3.25/12.49  % [INFO] 	 Axiom selection finished. Selected 3 axioms (removed 0 axioms). 
% 3.43/12.53  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 3.43/12.54  % [INFO] 	 Type checking passed. 
% 3.43/12.54  % [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 ... 
% 6.03/13.60  % [INFO] 	 Killing All external provers ... 
% 6.03/13.61  % Time passed: 2913ms (effective reasoning time: 1913ms)
% 6.03/13.61  % 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)>
% 6.03/13.61  % Axioms used in derivation (2): l, satz81b
% 6.03/13.61  % No. of inferences in proof: 24
% 6.03/13.61  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2913 ms resp. 1913 ms w/o parsing
% 6.03/13.69  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.03/13.69  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------