↑ 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  : NUM662^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 : n015.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:55 AM UTC 2026

% Result   : Theorem 6.04s 2.91s
% Output   : Refutation 6.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   31 (  29 unt;   0 typ;   2 def)
%            Number of atoms       :   35 (  34 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :  140 (  30   ~;   2   |;   0   &; 108   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   6 con; 0-2 aty)
%            Number of variables   :   35 (   0   ^;  30   !;   3   ?;  35   :)
%                                         (   0  !>;   0  ?*;   0  @-;   2  @+)

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

thf(sk1_decl,type,
    sk1: nat ).

thf(sk2_decl,type,
    sk2: nat ).

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

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

thf(3,axiom,
    ~ ! [A: nat] :
        ( y
       != ( pl @ x @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).

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

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

thf(14,plain,
    ~ ~ ? [A: nat] :
          ( y
          = ( pl @ x @ A ) ),
    inference(miniscope,[status(thm)],[13]) ).

thf(15,plain,
    ( y
    = ( pl @ x @ sk1 ) ),
    inference(cnf,[status(esa)],[14]) ).

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

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

thf(23,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(24,plain,
    ! [C: nat,B: nat,A: nat] :
      ( ( pl @ ( pl @ A @ B ) @ C )
      = ( pl @ A @ ( pl @ B @ C ) ) ),
    inference(cnf,[status(esa)],[23]) ).

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

thf(45,plain,
    ! [C: nat,B: nat,A: nat] :
      ( ( ( pl @ y @ C )
        = ( pl @ A @ ( pl @ B @ C ) ) )
      | ( ( pl @ x @ sk1 )
       != ( pl @ A @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[16,25]) ).

thf(46,plain,
    ! [A: nat] :
      ( ( pl @ y @ A )
      = ( pl @ x @ ( pl @ sk1 @ A ) ) ),
    inference(pattern_uni,[status(thm)],[45:[bind(A,$thf( x )),bind(B,$thf( sk1 ))]]) ).

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

thf(4,axiom,
    ~ ! [A: nat] :
        ( z
       != ( pl @ y @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k) ).

thf(17,plain,
    ~ ! [A: nat] :
        ( z
       != ( pl @ y @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(18,plain,
    ~ ! [A: nat] :
        ( z
       != ( pl @ y @ A ) ),
    inference(polarity_switch,[status(thm)],[17]) ).

thf(19,plain,
    ~ ~ ? [A: nat] :
          ( z
          = ( pl @ y @ A ) ),
    inference(miniscope,[status(thm)],[18]) ).

thf(20,plain,
    ( z
    = ( pl @ y @ sk2 ) ),
    inference(cnf,[status(esa)],[19]) ).

thf(21,plain,
    ( ( pl @ y @ sk2 )
    = z ),
    inference(lifteq,[status(thm)],[20]) ).

thf(217,plain,
    ! [A: nat] :
      ( ( ( pl @ x @ ( pl @ sk1 @ A ) )
        = z )
      | ( ( pl @ y @ A )
       != ( pl @ y @ sk2 ) ) ),
    inference(paramod_ordered,[status(thm)],[60,21]) ).

thf(218,plain,
    ( ( pl @ x @ ( pl @ sk1 @ sk2 ) )
    = z ),
    inference(pattern_uni,[status(thm)],[217:[bind(A,$thf( sk2 ))]]) ).

thf(1,conjecture,
    ~ ! [A: nat] :
        ( z
       != ( pl @ x @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz15) ).

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

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

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

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

thf(10,plain,
    ! [A: nat] :
      ( z
     != ( pl @ x @ A ) ),
    inference(cnf,[status(esa)],[9]) ).

thf(11,plain,
    ! [A: nat] :
      ( ( pl @ x @ A )
     != z ),
    inference(lifteq,[status(thm)],[10]) ).

thf(314,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[218,11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM662^1 : TPTP v9.3.1. Released v3.7.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.10/0.21  % Computer : n015.cluster.edu
% 0.10/0.21  % Model    : x86_64 x86_64
% 0.10/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21  % Memory   : 8046.5625MB
% 0.10/0.21  % OS       : Linux 6.8.0-71-generic
% 0.10/0.21  % CPULimit : 300
% 0.10/0.21  % WCLimit  : 300
% 0.10/0.21  % DateTime : Tue Sep 29 12:36:17 UTC 2026
% 0.10/0.22  % CPUTime  : 
% 0.10/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
% 1.04/0.81  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.23/1.00  % [INFO] 	 Parsing done (188ms). 
% 1.23/1.01  % [INFO] 	 Running in sequential loop mode. 
% 2.02/1.42  % [INFO] 	 eprover registered as external prover. 
% 2.02/1.43  % [INFO] 	 Scanning for conjecture ... 
% 2.21/1.51  % [INFO] 	 Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ... 
% 2.21/1.55  % [INFO] 	 Axiom selection finished. Selected 4 axioms (removed 0 axioms). 
% 2.21/1.56  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.21/1.57  % [INFO] 	 Type checking passed. 
% 2.21/1.57  % [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.04/2.90  % [INFO] 	 Killing All external provers ... 
% 6.04/2.90  % Time passed: 2537ms (effective reasoning time: 1879ms)
% 6.04/2.90  % 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.04/2.90  % Axioms used in derivation (3): l, satz5, k
% 6.04/2.90  % No. of inferences in proof: 29
% 6.04/2.91  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2537 ms resp. 1879 ms w/o parsing
% 6.04/2.95  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.04/2.95  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------