↑ 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  : NUM691_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 : n026.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:39 AM UTC 2026

% Result   : Theorem 10.74s 4.06s
% Output   : Refutation 10.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   59 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :  173 (  53 equ;   0 cnn)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  577 (  87   ~;  66   |;   3   &; 396   @)
%                                         (   0 <=>;  25  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   7 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   6 usr;   6 con; 0-2 aty)
%            Number of variables   :   78 (   0   ^;  78   !;   0   ?;  78   :)

% 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(u_decl,type,
    u: nat ).

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

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

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

thf(27,plain,
    ! [A: nat,B: nat,C: nat,D: nat] :
      ( ( B @ ( A @ more ) )
     => ( ( ~ ( D @ ( C @ more ) )
         => ( C = D ) )
       => ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(28,plain,
    ! [A: nat,B: nat] :
      ( ( B @ ( A @ more ) )
     => ! [C: nat,D: nat] :
          ( ( ~ ( D @ ( C @ more ) )
           => ( C = D ) )
         => ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) ) ) ),
    inference(miniscope,[status(thm)],[27]) ).

thf(29,plain,
    ! [D: nat,C: nat,B: nat,A: nat] :
      ( ( ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) )
        | ( C != D )
        | ~ ( B @ ( A @ more ) ) )
      & ( ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) )
        | ~ ( D @ ( C @ more ) )
        | ~ ( B @ ( A @ more ) ) ) ),
    inference(cnf,[status(esa)],[28]) ).

thf(31,plain,
    ! [D: nat,C: nat,B: nat,A: nat] :
      ( ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) )
      | ( C != D )
      | ~ ( B @ ( A @ more ) ) ),
    inference(cnfConj,[status(thm)],[29]) ).

thf(32,plain,
    ! [D: nat,C: nat,B: nat,A: nat] :
      ( ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) )
      | ~ ( B @ ( A @ more ) )
      | ( C != D ) ),
    inference(lifteq,[status(thm)],[31]) ).

thf(33,plain,
    ! [C: nat,B: nat,A: nat] :
      ( ( C @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) )
      | ~ ( B @ ( A @ more ) ) ),
    inference(simp,[status(thm)],[32]) ).

thf(1,conjecture,
    ( ~ ( u @ ( y @ pl ) @ ( z @ ( x @ pl ) @ more ) )
   => ( ( z @ ( x @ pl ) )
      = ( u @ ( y @ pl ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz23) ).

thf(2,negated_conjecture,
    ~ ( ~ ( u @ ( y @ pl ) @ ( z @ ( x @ pl ) @ more ) )
     => ( ( z @ ( x @ pl ) )
        = ( u @ ( y @ pl ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(8,plain,
    ~ ( ~ ( u @ ( y @ pl ) @ ( z @ ( x @ pl ) @ more ) )
     => ( ( z @ ( x @ pl ) )
        = ( u @ ( y @ pl ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(9,plain,
    ( ( ( z @ ( x @ pl ) )
     != ( u @ ( y @ pl ) ) )
    & ~ ( u @ ( y @ pl ) @ ( z @ ( x @ pl ) @ more ) ) ),
    inference(cnf,[status(esa)],[8]) ).

thf(10,plain,
    ~ ( u @ ( y @ pl ) @ ( z @ ( x @ pl ) @ more ) ),
    inference(cnfConj,[status(thm)],[9]) ).

thf(4,axiom,
    ( ~ ( u @ ( z @ more ) )
   => ( z = u ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n) ).

thf(16,plain,
    ( ~ ( u @ ( z @ more ) )
   => ( z = u ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(17,plain,
    ( ( z = u )
    | ( u @ ( z @ more ) ) ),
    inference(cnf,[status(esa)],[16]) ).

thf(18,plain,
    ( ( u @ ( z @ more ) )
    | ( u = z ) ),
    inference(lifteq,[status(thm)],[17]) ).

thf(6,axiom,
    ! [A: nat,B: nat,C: nat,D: nat] :
      ( ( ~ ( B @ ( A @ more ) )
       => ( A = B ) )
     => ( ( D @ ( C @ more ) )
       => ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz22a) ).

thf(20,plain,
    ! [A: nat,B: nat,C: nat,D: nat] :
      ( ( ~ ( B @ ( A @ more ) )
       => ( A = B ) )
     => ( ( D @ ( C @ more ) )
       => ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(21,plain,
    ! [A: nat,B: nat] :
      ( ( ~ ( B @ ( A @ more ) )
       => ( A = B ) )
     => ! [C: nat,D: nat] :
          ( ( D @ ( C @ more ) )
         => ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) ) ) ),
    inference(miniscope,[status(thm)],[20]) ).

thf(22,plain,
    ! [D: nat,C: nat,B: nat,A: nat] :
      ( ( ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) )
        | ~ ( D @ ( C @ more ) )
        | ( A != B ) )
      & ( ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) )
        | ~ ( D @ ( C @ more ) )
        | ~ ( B @ ( A @ more ) ) ) ),
    inference(cnf,[status(esa)],[21]) ).

thf(23,plain,
    ! [D: nat,C: nat,B: nat,A: nat] :
      ( ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) )
      | ~ ( D @ ( C @ more ) )
      | ~ ( B @ ( A @ more ) ) ),
    inference(cnfConj,[status(thm)],[22]) ).

thf(49,plain,
    ! [D: nat,C: nat,B: nat,A: nat] :
      ( ( ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) )
       != ( u @ ( y @ pl ) @ ( z @ ( x @ pl ) @ more ) ) )
      | ~ $true
      | ~ ( D @ ( C @ more ) )
      | ~ ( B @ ( A @ more ) ) ),
    inference(paramod_ordered,[status(thm)],[23,10]) ).

thf(50,plain,
    ! [D: nat,C: nat,B: nat,A: nat] :
      ( ( ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) )
       != ( u @ ( y @ pl ) @ ( z @ ( x @ pl ) @ more ) ) )
      | ~ ( D @ ( C @ more ) )
      | ~ ( B @ ( A @ more ) ) ),
    inference(simp,[status(thm)],[49]) ).

thf(51,plain,
    ( ~ ( u @ ( z @ more ) )
    | ~ ( y @ ( x @ more ) ) ),
    inference(pattern_uni,[status(thm)],[50:[bind(A,$thf( x )),bind(B,$thf( y )),bind(C,$thf( z )),bind(D,$thf( u ))]]) ).

thf(158,plain,
    ( ( ( u @ ( z @ more ) )
     != ( u @ ( z @ more ) ) )
    | ~ $true
    | ~ ( y @ ( x @ more ) )
    | ( u = z ) ),
    inference(paramod_ordered,[status(thm)],[18,51]) ).

thf(159,plain,
    ( ( ( u @ ( z @ more ) )
     != ( u @ ( z @ more ) ) )
    | ~ ( y @ ( x @ more ) )
    | ( u = z ) ),
    inference(simp,[status(thm)],[158]) ).

thf(160,plain,
    ( ~ ( y @ ( x @ more ) )
    | ( u = z ) ),
    inference(pattern_uni,[status(thm)],[159:[]]) ).

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

thf(13,plain,
    ( ~ ( y @ ( x @ more ) )
   => ( x = y ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(14,plain,
    ( ( x = y )
    | ( y @ ( x @ more ) ) ),
    inference(cnf,[status(esa)],[13]) ).

thf(15,plain,
    ( ( y @ ( x @ more ) )
    | ( y = x ) ),
    inference(lifteq,[status(thm)],[14]) ).

thf(11,plain,
    ( ( z @ ( x @ pl ) )
   != ( u @ ( y @ pl ) ) ),
    inference(cnfConj,[status(thm)],[9]) ).

thf(12,plain,
    ( ( u @ ( y @ pl ) )
   != ( z @ ( x @ pl ) ) ),
    inference(lifteq,[status(thm)],[11]) ).

thf(34,plain,
    ( ( u != z )
    | ( y != x ) ),
    inference(simp,[status(thm)],[12]) ).

thf(35,plain,
    ( ( y != y )
    | ( u != z )
    | ( x != x )
    | ( y @ ( x @ more ) ) ),
    inference(paramod_ordered,[status(thm)],[15,34]) ).

thf(36,plain,
    ( ( y != y )
    | ( u != z )
    | ( y @ ( x @ more ) ) ),
    inference(simp,[status(thm)],[35]) ).

thf(37,plain,
    ( ( u != z )
    | ( y @ ( x @ more ) ) ),
    inference(pattern_uni,[status(thm)],[36:[]]) ).

thf(90,plain,
    ( ( u != u )
    | ( z != z )
    | ( y @ ( x @ more ) )
    | ( u @ ( z @ more ) ) ),
    inference(paramod_ordered,[status(thm)],[18,37]) ).

thf(91,plain,
    ( ( u != u )
    | ( y @ ( x @ more ) )
    | ( u @ ( z @ more ) ) ),
    inference(simp,[status(thm)],[90]) ).

thf(92,plain,
    ( ( y @ ( x @ more ) )
    | ( u @ ( z @ more ) ) ),
    inference(pattern_uni,[status(thm)],[91:[]]) ).

thf(24,plain,
    ! [D: nat,C: nat,B: nat,A: nat] :
      ( ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) )
      | ~ ( D @ ( C @ more ) )
      | ( A != B ) ),
    inference(cnfConj,[status(thm)],[22]) ).

thf(25,plain,
    ! [D: nat,C: nat,B: nat,A: nat] :
      ( ( D @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) )
      | ~ ( D @ ( C @ more ) )
      | ( A != B ) ),
    inference(lifteq,[status(thm)],[24]) ).

thf(26,plain,
    ! [C: nat,B: nat,A: nat] :
      ( ( C @ ( A @ pl ) @ ( B @ ( A @ pl ) @ more ) )
      | ~ ( C @ ( B @ more ) ) ),
    inference(simp,[status(thm)],[25]) ).

thf(38,plain,
    ( ( y != y )
    | ~ ( u @ ( x @ pl ) @ ( z @ ( x @ pl ) @ more ) )
    | ( y @ ( x @ more ) ) ),
    inference(paramod_ordered,[status(thm)],[15,10]) ).

thf(39,plain,
    ( ~ ( u @ ( x @ pl ) @ ( z @ ( x @ pl ) @ more ) )
    | ( y @ ( x @ more ) ) ),
    inference(pattern_uni,[status(thm)],[38:[]]) ).

thf(995,plain,
    ! [C: nat,B: nat,A: nat] :
      ( ( ( C @ ( A @ pl ) @ ( B @ ( A @ pl ) @ more ) )
       != ( u @ ( x @ pl ) @ ( z @ ( x @ pl ) @ more ) ) )
      | ~ $true
      | ( y @ ( x @ more ) )
      | ~ ( C @ ( B @ more ) ) ),
    inference(paramod_ordered,[status(thm)],[26,39]) ).

thf(996,plain,
    ! [C: nat,B: nat,A: nat] :
      ( ( ( C @ ( A @ pl ) @ ( B @ ( A @ pl ) @ more ) )
       != ( u @ ( x @ pl ) @ ( z @ ( x @ pl ) @ more ) ) )
      | ( y @ ( x @ more ) )
      | ~ ( C @ ( B @ more ) ) ),
    inference(simp,[status(thm)],[995]) ).

thf(997,plain,
    ( ( y @ ( x @ more ) )
    | ~ ( u @ ( z @ more ) ) ),
    inference(pattern_uni,[status(thm)],[996:[bind(A,$thf( x )),bind(B,$thf( z )),bind(C,$thf( u ))]]) ).

thf(1274,plain,
    ( ( ( u @ ( z @ more ) )
     != ( u @ ( z @ more ) ) )
    | ( y @ ( x @ more ) )
    | ~ $true
    | ( y @ ( x @ more ) ) ),
    inference(paramod_ordered,[status(thm)],[92,997]) ).

thf(1275,plain,
    ( ( ( u @ ( z @ more ) )
     != ( u @ ( z @ more ) ) )
    | ( y @ ( x @ more ) ) ),
    inference(simp,[status(thm)],[1274]) ).

thf(1276,plain,
    y @ ( x @ more ),
    inference(pattern_uni,[status(thm)],[1275:[]]) ).

thf(1312,plain,
    ( ~ $true
    | ( u = z ) ),
    inference(rewrite,[status(thm)],[160,1276]) ).

thf(1313,plain,
    u = z,
    inference(simp,[status(thm)],[1312]) ).

thf(1380,plain,
    ~ ( z @ ( y @ pl ) @ ( z @ ( x @ pl ) @ more ) ),
    inference(rewrite,[status(thm)],[10,1313]) ).

thf(1602,plain,
    ! [C: nat,B: nat,A: nat] :
      ( ( ( C @ ( B @ pl ) @ ( C @ ( A @ pl ) @ more ) )
       != ( z @ ( y @ pl ) @ ( z @ ( x @ pl ) @ more ) ) )
      | ~ $true
      | ~ ( B @ ( A @ more ) ) ),
    inference(paramod_ordered,[status(thm)],[33,1380]) ).

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

thf(1604,plain,
    ~ ( y @ ( x @ more ) ),
    inference(pattern_uni,[status(thm)],[1603:[bind(A,$thf( x )),bind(B,$thf( y )),bind(C,$thf( z ))]]) ).

thf(1621,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[1604,1276]) ).

thf(1622,plain,
    $false,
    inference(simp,[status(thm)],[1621]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM691_8 : TPTP v9.3.1. Released v8.0.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.13/0.40  % Computer : n026.cluster.edu
% 0.13/0.40  % Model    : x86_64 x86_64
% 0.13/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40  % Memory   : 8046.5625MB
% 0.13/0.40  % OS       : Linux 6.8.0-71-generic
% 0.13/0.40  % CPULimit : 300
% 0.13/0.40  % WCLimit  : 300
% 0.13/0.40  % DateTime : Sat Sep 26 03:49:10 UTC 2026
% 0.13/0.40  % CPUTime  : 
% 0.13/0.40  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.88/0.99  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.27/1.18  % [INFO] 	 Parsing done (189ms). 
% 1.27/1.19  % [INFO] 	 Running in sequential loop mode. 
% 2.00/1.60  % [INFO] 	 eprover registered as external prover. 
% 2.00/1.61  % [INFO] 	 Scanning for conjecture ... 
% 2.18/1.71  % [INFO] 	 Found a conjecture (or negated_conjecture) and 5 axioms. Running axiom selection ... 
% 2.18/1.75  % [INFO] 	 Axiom selection finished. Selected 5 axioms (removed 0 axioms). 
% 2.18/1.78  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 2.18/1.78  % [INFO] 	 Type checking passed. 
% 2.18/1.79  % [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 ... 
% 10.74/4.05  % [INFO] 	 Killing All external provers ... 
% 10.74/4.06  % Time passed: 3508ms (effective reasoning time: 2852ms)
% 10.74/4.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)>
% 10.74/4.06  % Axioms used in derivation (4): satz22b, n, satz22a, m
% 10.74/4.06  % No. of inferences in proof: 59
% 10.74/4.06  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3508 ms resp. 2852 ms w/o parsing
% 10.74/4.10  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 10.74/4.10  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------