↑ 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  : NUM658_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 : 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 : Sun Sep 27 08:09:29 AM UTC 2026

% Result   : Theorem 4.83s 2.80s
% Output   : Refutation 4.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   43 (  17 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   85 (  20   ~;  11   |;   1   &;  46   @)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   4 usr;   4 con; 0-2 aty)
%            Number of variables   :   12 (   0   ^;  12   !;   0   ?;  12   :)

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

thf(x_decl,type,
    x: nat ).

thf(y_decl,type,
    y: nat ).

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

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

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

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

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

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

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

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

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

thf(25,plain,
    ! [B: nat,A: nat] :
      ( ( ( B @ ( A @ less ) )
       != ( y @ ( x @ less ) ) )
      | ~ $true
      | ( B @ ( A @ more ) )
      | ( A = B ) ),
    inference(paramod_ordered,[status(thm)],[15,6]) ).

thf(26,plain,
    ! [B: nat,A: nat] :
      ( ( ( B @ ( A @ less ) )
       != ( y @ ( x @ less ) ) )
      | ( B @ ( A @ more ) )
      | ( A = B ) ),
    inference(simp,[status(thm)],[25]) ).

thf(27,plain,
    ( ( y @ ( x @ more ) )
    | ( y = x ) ),
    inference(pattern_uni,[status(thm)],[26:[bind(A,$thf( x )),bind(B,$thf( y ))]]) ).

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

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

thf(8,plain,
    ~ ( ~ ( y @ ( x @ more ) )
     => ( x = y ) ),
    inference(polarity_switch,[status(thm)],[7]) ).

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

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

thf(80,plain,
    ( $false
    | ( y = x ) ),
    inference(rewrite,[status(thm)],[27,10]) ).

thf(81,plain,
    y = x,
    inference(simp,[status(thm)],[80]) ).

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

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

thf(82,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[81,12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM658_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.14/0.41  % Computer : n015.cluster.edu
% 0.14/0.41  % Model    : x86_64 x86_64
% 0.14/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41  % Memory   : 8046.5625MB
% 0.14/0.41  % OS       : Linux 6.8.0-71-generic
% 0.14/0.41  % CPULimit : 300
% 0.14/0.41  % WCLimit  : 300
% 0.14/0.41  % DateTime : Sat Sep 26 03:41:28 UTC 2026
% 0.14/0.42  % CPUTime  : 
% 0.14/0.42  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.89/1.01  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.28/1.19  % [INFO] 	 Parsing done (181ms). 
% 1.41/1.21  % [INFO] 	 Running in sequential loop mode. 
% 2.00/1.62  % [INFO] 	 eprover registered as external prover. 
% 2.00/1.63  % [INFO] 	 Scanning for conjecture ... 
% 2.19/1.72  % [INFO] 	 Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ... 
% 2.19/1.75  % [INFO] 	 Axiom selection finished. Selected 3 axioms (removed 0 axioms). 
% 2.19/1.78  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 2.19/1.78  % [INFO] 	 Type checking passed. 
% 2.19/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 ... 
% 4.47/2.79  % [INFO] 	 Killing All external provers ... 
% 4.47/2.80  % Time passed: 2231ms (effective reasoning time: 1579ms)
% 4.83/2.80  % 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)>
% 4.83/2.80  % Axioms used in derivation (2): satz10a, n
% 4.83/2.80  % No. of inferences in proof: 20
% 4.83/2.80  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2231 ms resp. 1579 ms w/o parsing
% 4.83/2.85  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.83/2.85  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------