↑ 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  : NUM680^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:17:57 AM UTC 2026

% Result   : Theorem 6.16s 3.06s
% Output   : Refutation 6.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   41 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :  105 (  29 equ;   0 cnn)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  324 (  64   ~;  28   |;   2   &; 208   @)
%                                         (   0 <=>;  22  =>;   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     :    9 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   61 (   0   ^;  61   !;   0   ?;  61   :)

% Comments : 
%------------------------------------------------------------------------------
thf(nat_type,type,
    nat: $tType ).

thf(x_decl,type,
    x: nat ).

thf(y_decl,type,
    y: nat ).

thf(z_decl,type,
    z: nat ).

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

thf(pl_decl,type,
    pl: nat > nat > nat ).

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

thf(7,axiom,
    ! [A: nat,B: nat,C: nat] :
      ( ( less @ A @ B )
     => ( less @ ( pl @ A @ C ) @ ( pl @ B @ C ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19c) ).

thf(28,plain,
    ! [A: nat,B: nat,C: nat] :
      ( ( less @ A @ B )
     => ( less @ ( pl @ A @ C ) @ ( pl @ B @ C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(29,plain,
    ! [A: nat,B: nat] :
      ( ( less @ A @ B )
     => ! [C: nat] : ( less @ ( pl @ A @ C ) @ ( pl @ B @ C ) ) ),
    inference(miniscope,[status(thm)],[28]) ).

thf(30,plain,
    ! [C: nat,B: nat,A: nat] :
      ( ~ ( less @ A @ B )
      | ( less @ ( pl @ A @ C ) @ ( pl @ B @ C ) ) ),
    inference(cnf,[status(esa)],[29]) ).

thf(3,axiom,
    more @ ( pl @ x @ z ) @ ( pl @ y @ z ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).

thf(10,plain,
    more @ ( pl @ x @ z ) @ ( pl @ y @ z ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

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

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

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

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

thf(16,plain,
    ! [B: nat,A: nat] :
      ( ~ ( more @ A @ B )
      | ~ ( less @ A @ B ) ),
    inference(cnfConj,[status(thm)],[14]) ).

thf(20,plain,
    ! [B: nat,A: nat] :
      ( ~ ( more @ A @ B )
      | ~ ( less @ A @ B ) ),
    inference(simp,[status(thm)],[16]) ).

thf(169,plain,
    ! [B: nat,A: nat] :
      ( ~ $true
      | ~ ( less @ A @ B )
      | ( ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) )
       != ( more @ A @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[10,20]) ).

thf(170,plain,
    ! [B: nat,A: nat] :
      ( ~ ( less @ A @ B )
      | ( ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) )
       != ( more @ A @ B ) ) ),
    inference(simp,[status(thm)],[169]) ).

thf(171,plain,
    ~ ( less @ ( pl @ x @ z ) @ ( pl @ y @ z ) ),
    inference(pattern_uni,[status(thm)],[170:[bind(A,$thf( pl @ x @ z )),bind(B,$thf( pl @ y @ z ))]]) ).

thf(377,plain,
    ! [C: nat,B: nat,A: nat] :
      ( ~ ( less @ A @ B )
      | ~ $true
      | ( ( less @ ( pl @ A @ C ) @ ( pl @ B @ C ) )
       != ( less @ ( pl @ x @ z ) @ ( pl @ y @ z ) ) ) ),
    inference(paramod_ordered,[status(thm)],[30,171]) ).

thf(378,plain,
    ! [C: nat,B: nat,A: nat] :
      ( ~ ( less @ A @ B )
      | ( ( less @ ( pl @ A @ C ) @ ( pl @ B @ C ) )
       != ( less @ ( pl @ x @ z ) @ ( pl @ y @ z ) ) ) ),
    inference(simp,[status(thm)],[377]) ).

thf(379,plain,
    ~ ( less @ x @ y ),
    inference(pattern_uni,[status(thm)],[378:[bind(A,$thf( x )),bind(B,$thf( y )),bind(C,$thf( z ))]]) ).

thf(8,axiom,
    ! [A: nat,B: nat] :
      ( ( A != B )
     => ( ~ ( more @ A @ B )
       => ( less @ A @ B ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10a) ).

thf(31,plain,
    ! [A: nat,B: nat] :
      ( ( A != B )
     => ( ~ ( more @ A @ B )
       => ( less @ A @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(32,plain,
    ! [B: nat,A: nat] :
      ( ( A = B )
      | ( more @ A @ B )
      | ( less @ A @ B ) ),
    inference(cnf,[status(esa)],[31]) ).

thf(33,plain,
    ! [B: nat,A: nat] :
      ( ( A = B )
      | ( more @ A @ B )
      | ( less @ A @ B ) ),
    inference(lifteq,[status(thm)],[32]) ).

thf(15,plain,
    ! [B: nat,A: nat] :
      ( ( A != B )
      | ~ ( more @ A @ B ) ),
    inference(cnfConj,[status(thm)],[14]) ).

thf(18,plain,
    ! [B: nat,A: nat] :
      ( ( A != B )
      | ~ ( more @ A @ B ) ),
    inference(lifteq,[status(thm)],[15]) ).

thf(19,plain,
    ! [A: nat] :
      ~ ( more @ A @ A ),
    inference(simp,[status(thm)],[18]) ).

thf(37,plain,
    ! [A: nat] :
      ( ~ $true
      | ( ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) )
       != ( more @ A @ A ) ) ),
    inference(paramod_ordered,[status(thm)],[10,19]) ).

thf(38,plain,
    ! [A: nat] :
      ( ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) )
     != ( more @ A @ A ) ),
    inference(simp,[status(thm)],[37]) ).

thf(39,plain,
    ! [A: nat] :
      ( ( ( pl @ x @ z )
       != A )
      | ( ( pl @ y @ z )
       != A ) ),
    inference(simp,[status(thm)],[38]) ).

thf(40,plain,
    ( ( pl @ y @ z )
   != ( pl @ x @ z ) ),
    inference(simp,[status(thm)],[39]) ).

thf(41,plain,
    ( ( y != x )
    | ( z != z ) ),
    inference(simp,[status(thm)],[40]) ).

thf(42,plain,
    y != x,
    inference(simp,[status(thm)],[41]) ).

thf(69,plain,
    ! [B: nat,A: nat] :
      ( ( more @ A @ B )
      | ( less @ A @ B )
      | ( A != x )
      | ( B != y ) ),
    inference(paramod_ordered,[status(thm)],[33,42]) ).

thf(70,plain,
    ! [A: nat] :
      ( ( more @ A @ y )
      | ( less @ A @ y )
      | ( A != x ) ),
    inference(pattern_uni,[status(thm)],[69:[bind(A,$thf( A )),bind(B,$thf( y ))]]) ).

thf(116,plain,
    ( ( more @ x @ y )
    | ( less @ x @ y ) ),
    inference(simp,[status(thm)],[70]) ).

thf(1,conjecture,
    more @ x @ y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz20a) ).

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

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

thf(322,plain,
    ( $false
    | ( less @ x @ y ) ),
    inference(rewrite,[status(thm)],[116,9]) ).

thf(323,plain,
    less @ x @ y,
    inference(simp,[status(thm)],[322]) ).

thf(395,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[379,323]) ).

thf(396,plain,
    $false,
    inference(simp,[status(thm)],[395]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM680^1 : TPTP v9.3.1. Released v3.7.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.09/0.21  % Computer : n011.cluster.edu
% 0.09/0.21  % Model    : x86_64 x86_64
% 0.09/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21  % Memory   : 8046.5625MB
% 0.09/0.21  % OS       : Linux 6.8.0-71-generic
% 0.09/0.21  % CPULimit : 300
% 0.09/0.21  % WCLimit  : 300
% 0.09/0.21  % DateTime : Tue Sep 29 12:36:01 UTC 2026
% 0.09/0.22  % CPUTime  : 
% 0.09/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.85/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.15/0.98  % [INFO] 	 Parsing done (185ms). 
% 1.15/1.00  % [INFO] 	 Running in sequential loop mode. 
% 1.74/1.39  % [INFO] 	 eprover registered as external prover. 
% 1.92/1.40  % [INFO] 	 Scanning for conjecture ... 
% 1.92/1.48  % [INFO] 	 Found a conjecture (or negated_conjecture) and 6 axioms. Running axiom selection ... 
% 2.07/1.51  % [INFO] 	 Axiom selection finished. Selected 6 axioms (removed 0 axioms). 
% 2.07/1.55  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.07/1.55  % [INFO] 	 Type checking passed. 
% 2.07/1.56  % [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.16/3.05  % [INFO] 	 Killing All external provers ... 
% 6.16/3.06  % Time passed: 2696ms (effective reasoning time: 2052ms)
% 6.16/3.06  % 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.16/3.06  % Axioms used in derivation (4): satz19c, m, satz10b, satz10a
% 6.16/3.06  % No. of inferences in proof: 41
% 6.16/3.06  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2696 ms resp. 2052 ms w/o parsing
% 6.16/3.10  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.16/3.10  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------