↑ 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  : NUM730_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 : n004.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:47 AM UTC 2026

% Result   : Theorem 3.61s 2.37s
% Output   : Refutation 3.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    6 (   1 unt;   0 typ;   0 def)
%            Number of atoms       :   21 (   5 equ;   0 cnn)
%            Maximal formula atoms :    4 (   3 avg)
%            Number of connectives :  109 (   2   ~;   0   |;   0   &; 107   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   7 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (  10 usr;   3 con; 0-3 aty)
%            Number of variables   :    4 (   0   ^;   4   !;   0   ?;   4   :)

% Comments : 
%------------------------------------------------------------------------------
thf(frac_type,type,
    frac: $tType ).

thf(nat_type,type,
    nat: $tType ).

thf(x_decl,type,
    x: frac ).

thf(y_decl,type,
    y: frac ).

thf(orec3_decl,type,
    orec3: $o > $o > $o > $o ).

thf(ts_decl,type,
    ts: nat > nat > nat ).

thf(c1x_decl,type,
    c1x: frac > nat ).

thf(c2y_decl,type,
    c2y: frac > nat ).

thf(c1y_decl,type,
    c1y: frac > nat ).

thf(c2x_decl,type,
    c2x: frac > nat ).

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

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

thf(1,conjecture,
    ( x @ c2x @ ( y @ c1y @ ts ) @ ( y @ c2y @ ( x @ c1x @ ts ) @ less )
    @ ( x @ c2x @ ( y @ c1y @ ts ) @ ( y @ c2y @ ( x @ c1x @ ts ) @ more )
      @ ( ( ( y @ c2y @ ( x @ c1x @ ts ) )
          = ( x @ c2x @ ( y @ c1y @ ts ) ) )
        @ orec3 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz41) ).

thf(2,negated_conjecture,
    ~ ( x @ c2x @ ( y @ c1y @ ts ) @ ( y @ c2y @ ( x @ c1x @ ts ) @ less )
      @ ( x @ c2x @ ( y @ c1y @ ts ) @ ( y @ c2y @ ( x @ c1x @ ts ) @ more )
        @ ( ( ( y @ c2y @ ( x @ c1x @ ts ) )
            = ( x @ c2x @ ( y @ c1y @ ts ) ) )
          @ orec3 ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(4,plain,
    ~ ( x @ c2x @ ( y @ c1y @ ts ) @ ( y @ c2y @ ( x @ c1x @ ts ) @ less )
      @ ( x @ c2x @ ( y @ c1y @ ts ) @ ( y @ c2y @ ( x @ c1x @ ts ) @ more )
        @ ( ( ( y @ c2y @ ( x @ c1x @ ts ) )
            = ( x @ c2x @ ( y @ c1y @ ts ) ) )
          @ orec3 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
    ! [A: nat,B: nat] : ( B @ ( A @ less ) @ ( B @ ( A @ more ) @ ( ( A = B ) @ orec3 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10) ).

thf(5,plain,
    ! [A: nat,B: nat] : ( B @ ( A @ less ) @ ( B @ ( A @ more ) @ ( ( A = B ) @ orec3 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(7,plain,
    $false,
    inference(e,[status(thm)],[4,5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM730_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.16/0.42  % Computer : n004.cluster.edu
% 0.16/0.42  % Model    : x86_64 x86_64
% 0.16/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42  % Memory   : 8046.5625MB
% 0.16/0.42  % OS       : Linux 6.8.0-71-generic
% 0.16/0.42  % CPULimit : 300
% 0.16/0.42  % WCLimit  : 300
% 0.16/0.42  % DateTime : Sat Sep 26 03:54:51 UTC 2026
% 0.16/0.43  % CPUTime  : 
% 0.16/0.43  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.92/1.01  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.36/1.20  % [INFO] 	 Parsing done (186ms). 
% 1.50/1.21  % [INFO] 	 Running in sequential loop mode. 
% 2.16/1.61  % [INFO] 	 eprover registered as external prover. 
% 2.16/1.62  % [INFO] 	 Scanning for conjecture ... 
% 2.36/1.73  % [INFO] 	 Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ... 
% 2.36/1.76  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 2.36/1.78  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 2.36/1.78  % [INFO] 	 Type checking passed. 
% 2.36/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 ... 
% 3.61/2.36  % External prover 'e' found a proof!
% 3.61/2.36  % [INFO] 	 Killing All external provers ... 
% 3.61/2.36  % Time passed: 1796ms (effective reasoning time: 1146ms)
% 3.61/2.36  % 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.61/2.37  % Axioms used in derivation (1): satz10
% 3.61/2.37  % No. of inferences in proof: 6
% 3.61/2.37  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1796 ms resp. 1146 ms w/o parsing
% 3.90/2.41  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.90/2.41  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------