↑ 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  : NUM695^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 : n014.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:18:00 AM UTC 2026

% Result   : Theorem 3.26s 2.10s
% Output   : Refutation 3.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   17 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   23 (  11 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   67 (  10   ~;   2   |;   0   &;  55   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 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   :   19 (   0   ^;  19   !;   0   ?;  19   :)

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

thf(x_decl,type,
    x: nat ).

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

thf(suc_decl,type,
    suc: nat > nat ).

thf(n_1_decl,type,
    n_1: nat ).

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

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

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

thf(19,plain,
    ! [B: nat,A: nat] : ( more @ ( pl @ A @ B ) @ A ),
    inference(cnf,[status(esa)],[18]) ).

thf(1,conjecture,
    more @ ( suc @ x ) @ n_1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz24b) ).

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

thf(8,plain,
    ~ ( more @ ( suc @ x ) @ n_1 ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(25,plain,
    ! [B: nat,A: nat] :
      ( ~ $true
      | ( ( more @ ( pl @ A @ B ) @ A )
       != ( more @ ( suc @ x ) @ n_1 ) ) ),
    inference(paramod_ordered,[status(thm)],[19,8]) ).

thf(26,plain,
    ! [B: nat,A: nat] :
      ( ( more @ ( pl @ A @ B ) @ A )
     != ( more @ ( suc @ x ) @ n_1 ) ),
    inference(simp,[status(thm)],[25]) ).

thf(27,plain,
    ! [B: nat,A: nat] :
      ( ( ( pl @ A @ B )
       != ( suc @ x ) )
      | ( A != n_1 ) ),
    inference(simp,[status(thm)],[26]) ).

thf(28,plain,
    ! [A: nat] :
      ( ( pl @ n_1 @ A )
     != ( suc @ x ) ),
    inference(simp,[status(thm)],[27]) ).

thf(7,axiom,
    ! [A: nat] :
      ( ( suc @ A )
      = ( pl @ n_1 @ A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz4g) ).

thf(20,plain,
    ! [A: nat] :
      ( ( suc @ A )
      = ( pl @ n_1 @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(21,plain,
    ! [A: nat] :
      ( ( suc @ A )
      = ( pl @ n_1 @ A ) ),
    inference(cnf,[status(esa)],[20]) ).

thf(22,plain,
    ! [A: nat] :
      ( ( pl @ n_1 @ A )
      = ( suc @ A ) ),
    inference(lifteq,[status(thm)],[21]) ).

thf(29,plain,
    ! [A: nat] :
      ( ( suc @ A )
     != ( suc @ x ) ),
    inference(rewrite,[status(thm)],[28,22]) ).

thf(30,plain,
    ! [A: nat] : ( A != x ),
    inference(simp,[status(thm)],[29]) ).

thf(32,plain,
    $false,
    inference(pattern_uni,[status(thm)],[30:[bind(A,$thf( x ))]]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM695^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07  % 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.08/0.20  % Computer : n014.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Tue Sep 29 12:40:30 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  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
% 0.84/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.16/0.97  % [INFO] 	 Parsing done (184ms). 
% 1.16/0.99  % [INFO] 	 Running in sequential loop mode. 
% 1.75/1.38  % [INFO] 	 eprover registered as external prover. 
% 1.75/1.38  % [INFO] 	 Scanning for conjecture ... 
% 1.94/1.46  % [INFO] 	 Found a conjecture (or negated_conjecture) and 5 axioms. Running axiom selection ... 
% 1.94/1.49  % [INFO] 	 Axiom selection finished. Selected 5 axioms (removed 0 axioms). 
% 2.08/1.51  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.08/1.52  % [INFO] 	 Type checking passed. 
% 2.08/1.52  % [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 ... 
% 3.26/2.10  % [INFO] 	 Killing All external provers ... 
% 3.26/2.10  % Time passed: 1754ms (effective reasoning time: 1102ms)
% 3.26/2.10  % 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)>
% 3.26/2.10  % Axioms used in derivation (2): satz18, satz4g
% 3.26/2.10  % No. of inferences in proof: 17
% 3.26/2.10  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1754 ms resp. 1102 ms w/o parsing
% 3.26/2.12  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.26/2.12  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------