↑ 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  : NUM651^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:17:53 AM UTC 2026

% Result   : Theorem 15.59s 4.94s
% Output   : Refutation 15.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   68 (  29 unt;   0 typ;   4 def)
%            Number of atoms       :  163 ( 135 equ;   0 cnn)
%            Maximal formula atoms :   16 (   2 avg)
%            Number of connectives :  446 ( 111   ~;  61   |;   5   &; 244   @)
%                                         (   0 <=>;  25  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   9 con; 0-2 aty)
%            Number of variables   :   98 (   0   ^;  88   !;   6   ?;  98   :)
%                                         (   0  !>;   0  ?*;   0  @-;   4  @+)

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

thf(x_decl,type,
    x: nat ).

thf(y_decl,type,
    y: nat ).

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

thf(sk1_decl,type,
    sk1: $o ).

thf(sk2_decl,type,
    sk2: nat ).

thf(sk3_decl,type,
    sk3: nat ).

thf(sk4_decl,type,
    sk4: nat ).

thf(sk5_decl,type,
    sk5: nat ).

thf(sk2_def,definition,
    ( sk2
    = ( @+[A: nat] :
          ( x
          = ( pl @ y @ A ) ) ) ) ).

thf(sk3_def,definition,
    ( sk3
    = ( @+[A: nat] :
          ( x
          = ( pl @ y @ A ) ) ) ) ).

thf(sk4_def,definition,
    ( sk4
    = ( @+[A: nat] :
          ( y
          = ( pl @ x @ A ) ) ) ) ).

thf(sk5_def,definition,
    ( sk5
    = ( @+[A: nat] :
          ( y
          = ( pl @ x @ A ) ) ) ) ).

thf(1,conjecture,
    ~ ( ( ( x = y )
       => ~ ~ ! [A: nat] :
                ( x
               != ( pl @ y @ A ) ) )
     => ~ ~ ( ( ~ ! [A: nat] :
                    ( x
                   != ( pl @ y @ A ) )
             => ~ ~ ! [A: nat] :
                      ( y
                     != ( pl @ x @ A ) ) )
           => ~ ( ~ ! [A: nat] :
                      ( y
                     != ( pl @ x @ A ) )
               => ( x != y ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz9b) ).

thf(2,negated_conjecture,
    ~ ~ ( ( ( x = y )
         => ~ ~ ! [A: nat] :
                  ( x
                 != ( pl @ y @ A ) ) )
       => ~ ~ ( ( ~ ! [A: nat] :
                      ( x
                     != ( pl @ y @ A ) )
               => ~ ~ ! [A: nat] :
                        ( y
                       != ( pl @ x @ A ) ) )
             => ~ ( ~ ! [A: nat] :
                        ( y
                       != ( pl @ x @ A ) )
                 => ( x != y ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(7,plain,
    ~ ~ ( ( ( x = y )
         => ! [A: nat] :
              ( x
             != ( pl @ y @ A ) ) )
       => ( ( ~ ! [A: nat] :
                  ( x
                 != ( pl @ y @ A ) )
           => ! [A: nat] :
                ( y
               != ( pl @ x @ A ) ) )
         => ~ ( ~ ! [A: nat] :
                    ( y
                   != ( pl @ x @ A ) )
             => ( x != y ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(8,plain,
    ( ( ( x = y )
     => ! [A: nat] :
          ( x
         != ( pl @ y @ A ) ) )
   => ( ( ~ ! [A: nat] :
              ( x
             != ( pl @ y @ A ) )
       => ! [A: nat] :
            ( y
           != ( pl @ x @ A ) ) )
     => ~ ( ~ ! [A: nat] :
                ( y
               != ( pl @ x @ A ) )
         => ( x != y ) ) ) ),
    inference(polarity_switch,[status(thm)],[7]) ).

thf(9,plain,
    ( ( ( x = y )
     => ~ ? [A: nat] :
            ( x
            = ( pl @ y @ A ) ) )
   => ( ( ~ ~ ? [A: nat] :
                ( x
                = ( pl @ y @ A ) )
       => ~ ? [A: nat] :
              ( y
              = ( pl @ x @ A ) ) )
     => ~ ( ~ ~ ? [A: nat] :
                  ( y
                  = ( pl @ x @ A ) )
         => ( x != y ) ) ) ),
    inference(miniscope,[status(thm)],[8]) ).

thf(10,plain,
    ( ( ( x = y )
      | sk1 )
    & ( ( x
        = ( pl @ y @ sk2 ) )
      | sk1 )
    & ( ~ sk1
      | ( x
        = ( pl @ y @ sk3 ) )
      | ( y
        = ( pl @ x @ sk5 ) ) )
    & ( ~ sk1
      | ( x
        = ( pl @ y @ sk3 ) )
      | ( x = y ) )
    & ( ~ sk1
      | ( y
        = ( pl @ x @ sk4 ) )
      | ( y
        = ( pl @ x @ sk5 ) ) )
    & ( ~ sk1
      | ( y
        = ( pl @ x @ sk4 ) )
      | ( x = y ) ) ),
    inference(cnf,[status(esa)],[9]) ).

thf(11,plain,
    ( ~ sk1
    | ( y
      = ( pl @ x @ sk4 ) )
    | ( x = y ) ),
    inference(cnfConj,[status(thm)],[10]) ).

thf(21,plain,
    ( ( ( pl @ x @ sk4 )
      = y )
    | ( y = x )
    | ~ sk1 ),
    inference(lifteq,[status(thm)],[11]) ).

thf(14,plain,
    ( ( x = y )
    | sk1 ),
    inference(cnfConj,[status(thm)],[10]) ).

thf(17,plain,
    ( ( y = x )
    | sk1 ),
    inference(lifteq,[status(thm)],[14]) ).

thf(16,plain,
    ( ( x
      = ( pl @ y @ sk2 ) )
    | sk1 ),
    inference(cnfConj,[status(thm)],[10]) ).

thf(20,plain,
    ( ( ( pl @ y @ sk2 )
      = x )
    | sk1 ),
    inference(lifteq,[status(thm)],[16]) ).

thf(4,axiom,
    ! [A: nat,B: nat] :
      ( ( pl @ A @ B )
      = ( pl @ B @ A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz6) ).

thf(27,plain,
    ! [A: nat,B: nat] :
      ( ( pl @ A @ B )
      = ( pl @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(28,plain,
    ! [B: nat,A: nat] :
      ( ( pl @ A @ B )
      = ( pl @ B @ A ) ),
    inference(cnf,[status(esa)],[27]) ).

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

thf(3,axiom,
    ! [A: nat,B: nat] :
      ( B
     != ( pl @ A @ B ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz7) ).

thf(23,plain,
    ! [A: nat,B: nat] :
      ( B
     != ( pl @ A @ B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(24,plain,
    ~ ? [A: nat,B: nat] :
        ( B
        = ( pl @ A @ B ) ),
    inference(miniscope,[status(thm)],[23]) ).

thf(25,plain,
    ! [B: nat,A: nat] :
      ( B
     != ( pl @ A @ B ) ),
    inference(cnf,[status(esa)],[24]) ).

thf(26,plain,
    ! [B: nat,A: nat] :
      ( ( pl @ A @ B )
     != B ),
    inference(lifteq,[status(thm)],[25]) ).

thf(36,plain,
    ! [D: nat,C: nat,B: nat,A: nat] :
      ( ( ( pl @ A @ B )
       != D )
      | ( ( pl @ B @ A )
       != ( pl @ C @ D ) ) ),
    inference(paramod_ordered,[status(thm)],[29,26]) ).

thf(37,plain,
    ! [B: nat,A: nat] :
      ( ( pl @ A @ B )
     != A ),
    inference(pattern_uni,[status(thm)],[36:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( B )),bind(D,$thf( A ))]]) ).

thf(50,plain,
    ! [B: nat,A: nat] :
      ( sk1
      | ( x != A )
      | ( ( pl @ y @ sk2 )
       != ( pl @ A @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[20,37]) ).

thf(51,plain,
    ( sk1
    | ( y != x ) ),
    inference(pattern_uni,[status(thm)],[50:[bind(A,$thf( y )),bind(B,$thf( sk2 ))]]) ).

thf(67,plain,
    ( sk1
    | sk1
    | ( x != x )
    | ( y != y ) ),
    inference(paramod_ordered,[status(thm)],[17,51]) ).

thf(68,plain,
    ( sk1
    | ( y != y ) ),
    inference(simp,[status(thm)],[67]) ).

thf(69,plain,
    sk1,
    inference(pattern_uni,[status(thm)],[68:[]]) ).

thf(352,plain,
    ( ( ( pl @ x @ sk4 )
      = y )
    | ( y = x )
    | ~ $true ),
    inference(rewrite,[status(thm)],[21,69]) ).

thf(353,plain,
    ( ( ( pl @ x @ sk4 )
      = y )
    | ( y = x ) ),
    inference(simp,[status(thm)],[352]) ).

thf(359,plain,
    ! [B: nat,A: nat] :
      ( ( y = x )
      | ( ( pl @ B @ A )
        = y )
      | ( ( pl @ x @ sk4 )
       != ( pl @ A @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[353,29]) ).

thf(360,plain,
    ( ( y = x )
    | ( ( pl @ sk4 @ x )
      = y ) ),
    inference(pattern_uni,[status(thm)],[359:[bind(A,$thf( x )),bind(B,$thf( sk4 ))]]) ).

thf(12,plain,
    ( ~ sk1
    | ( y
      = ( pl @ x @ sk4 ) )
    | ( y
      = ( pl @ x @ sk5 ) ) ),
    inference(cnfConj,[status(thm)],[10]) ).

thf(19,plain,
    ( ( ( pl @ x @ sk4 )
      = y )
    | ( ( pl @ x @ sk5 )
      = y )
    | ~ sk1 ),
    inference(lifteq,[status(thm)],[12]) ).

thf(190,plain,
    ( ( ( pl @ x @ sk4 )
      = y )
    | ( ( pl @ x @ sk5 )
      = y )
    | ~ $true ),
    inference(rewrite,[status(thm)],[19,69]) ).

thf(191,plain,
    ( ( ( pl @ x @ sk4 )
      = y )
    | ( ( pl @ x @ sk5 )
      = y ) ),
    inference(simp,[status(thm)],[190]) ).

thf(192,plain,
    ! [B: nat,A: nat] :
      ( ( ( pl @ x @ sk4 )
        = y )
      | ( y != A )
      | ( ( pl @ x @ sk5 )
       != ( pl @ A @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[191,37]) ).

thf(193,plain,
    ( ( ( pl @ x @ sk4 )
      = y )
    | ( y != x ) ),
    inference(pattern_uni,[status(thm)],[192:[bind(A,$thf( x )),bind(B,$thf( sk5 ))]]) ).

thf(836,plain,
    ! [B: nat,A: nat] :
      ( ( y != x )
      | ( y != A )
      | ( ( pl @ x @ sk4 )
       != ( pl @ A @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[193,37]) ).

thf(837,plain,
    ( ( y != x )
    | ( y != x ) ),
    inference(pattern_uni,[status(thm)],[836:[bind(A,$thf( x )),bind(B,$thf( sk4 ))]]) ).

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

thf(1074,plain,
    ( ( pl @ sk4 @ x )
    = y ),
    inference(simplifyReflect,[status(thm)],[360,922]) ).

thf(13,plain,
    ( ~ sk1
    | ( x
      = ( pl @ y @ sk3 ) )
    | ( x = y ) ),
    inference(cnfConj,[status(thm)],[10]) ).

thf(18,plain,
    ( ( ( pl @ y @ sk3 )
      = x )
    | ( y = x )
    | ~ sk1 ),
    inference(lifteq,[status(thm)],[13]) ).

thf(90,plain,
    ! [B: nat,A: nat] :
      ( ( y = x )
      | ~ sk1
      | ( ( pl @ B @ A )
        = x )
      | ( ( pl @ y @ sk3 )
       != ( pl @ A @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[18,29]) ).

thf(91,plain,
    ( ( y = x )
    | ~ sk1
    | ( ( pl @ sk3 @ y )
      = x ) ),
    inference(pattern_uni,[status(thm)],[90:[bind(A,$thf( y )),bind(B,$thf( sk3 ))]]) ).

thf(947,plain,
    ( ( y = x )
    | ~ $true
    | ( ( pl @ sk3 @ y )
      = x ) ),
    inference(rewrite,[status(thm)],[91,69]) ).

thf(948,plain,
    ( ( y = x )
    | ( ( pl @ sk3 @ y )
      = x ) ),
    inference(simp,[status(thm)],[947]) ).

thf(1071,plain,
    ( ( pl @ sk3 @ y )
    = x ),
    inference(simplifyReflect,[status(thm)],[948,922]) ).

thf(6,axiom,
    ! [A: nat,B: nat,C: nat] :
      ( ( pl @ ( pl @ A @ B ) @ C )
      = ( pl @ A @ ( pl @ B @ C ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz5) ).

thf(31,plain,
    ! [A: nat,B: nat,C: nat] :
      ( ( pl @ ( pl @ A @ B ) @ C )
      = ( pl @ A @ ( pl @ B @ C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

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

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

thf(34,plain,
    ! [D: nat,C: nat,B: nat,A: nat] :
      ( ( ( pl @ B @ A )
       != D )
      | ( ( pl @ A @ B )
       != ( pl @ C @ D ) ) ),
    inference(paramod_ordered,[status(thm)],[29,26]) ).

thf(35,plain,
    ! [B: nat,A: nat] :
      ( ( pl @ B @ A )
     != B ),
    inference(pattern_uni,[status(thm)],[34:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A )),bind(D,$thf( B ))]]) ).

thf(38,plain,
    ! [D: nat,C: nat,B: nat,A: nat] :
      ( ( ( pl @ B @ A )
       != D )
      | ( ( pl @ A @ B )
       != ( pl @ D @ C ) ) ),
    inference(paramod_ordered,[status(thm)],[29,35]) ).

thf(39,plain,
    ! [B: nat,A: nat] :
      ( ( pl @ B @ A )
     != A ),
    inference(pattern_uni,[status(thm)],[38:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( B )),bind(D,$thf( A ))]]) ).

thf(114,plain,
    ! [E: nat,D: nat,C: nat,B: nat,A: nat] :
      ( ( ( pl @ A @ ( pl @ B @ C ) )
       != D )
      | ( ( pl @ ( pl @ A @ B ) @ C )
       != ( pl @ E @ D ) ) ),
    inference(paramod_ordered,[status(thm)],[33,39]) ).

thf(115,plain,
    ! [C: nat,B: nat,A: nat] :
      ( ( pl @ B @ ( pl @ C @ A ) )
     != A ),
    inference(pattern_uni,[status(thm)],[114:[bind(A,$thf( F )),bind(B,$thf( G )),bind(C,$thf( C )),bind(D,$thf( C )),bind(E,$thf( pl @ F @ G ))]]) ).

thf(122,plain,
    ! [C: nat,B: nat,A: nat] :
      ( ( pl @ B @ ( pl @ C @ A ) )
     != A ),
    inference(simp,[status(thm)],[115]) ).

thf(1105,plain,
    ! [C: nat,B: nat,A: nat] :
      ( ( ( pl @ B @ x )
       != A )
      | ( ( pl @ sk3 @ y )
       != ( pl @ C @ A ) ) ),
    inference(paramod_ordered,[status(thm)],[1071,122]) ).

thf(1106,plain,
    ! [A: nat] :
      ( ( pl @ A @ x )
     != y ),
    inference(pattern_uni,[status(thm)],[1105:[bind(A,$thf( y )),bind(B,$thf( B )),bind(C,$thf( sk3 ))]]) ).

thf(1155,plain,
    ! [A: nat] :
      ( ( pl @ A @ x )
     != y ),
    inference(simp,[status(thm)],[1106]) ).

thf(1677,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[1074,1155]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM651^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08  % 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.10/0.25  % Computer : n018.cluster.edu
% 0.10/0.25  % Model    : x86_64 x86_64
% 0.10/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.25  % Memory   : 8046.5625MB
% 0.10/0.25  % OS       : Linux 6.8.0-71-generic
% 0.10/0.25  % CPULimit : 300
% 0.10/0.25  % WCLimit  : 300
% 0.10/0.25  % DateTime : Tue Sep 29 12:33:56 UTC 2026
% 0.10/0.25  % CPUTime  : 
% 0.10/0.25  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.16/1.02  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.59/1.18  % [INFO] 	 Parsing done (158ms). 
% 1.59/1.19  % [INFO] 	 Running in sequential loop mode. 
% 2.27/1.53  % [INFO] 	 eprover registered as external prover. 
% 2.27/1.53  % [INFO] 	 Scanning for conjecture ... 
% 2.27/1.59  % [INFO] 	 Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ... 
% 2.52/1.62  % [INFO] 	 Axiom selection finished. Selected 4 axioms (removed 0 axioms). 
% 2.52/1.62  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.52/1.63  % [INFO] 	 Type checking passed. 
% 2.52/1.63  % [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 ... 
% 15.59/4.93  % [INFO] 	 Killing All external provers ... 
% 15.59/4.94  % Time passed: 4480ms (effective reasoning time: 3738ms)
% 15.59/4.94  % 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)>
% 15.59/4.94  % Axioms used in derivation (3): satz6, satz7, satz5
% 15.59/4.94  % No. of inferences in proof: 64
% 15.59/4.94  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 4480 ms resp. 3738 ms w/o parsing
% 15.59/5.02  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 15.59/5.02  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------