↑ 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  : SWV080+1 : TPTP v9.3.1. Bugfixed v3.3.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 : n016.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:58:05 AM UTC 2026

% Result   : Theorem 8.61s 3.57s
% Output   : Refutation 8.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    4 (   2 unt;   0 typ;   0 def)
%            Number of atoms       :   10 (   0 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   32 (   2   ~;   0   |;   4   &;  24   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0   ^;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
thf(leq_decl,type,
    leq: $i > $i > $o ).

thf(n0_decl,type,
    n0: $i ).

thf(pv56_decl,type,
    pv56: $i ).

thf(minus_decl,type,
    minus: $i > $i > $i ).

thf(n5_decl,type,
    n5: $i ).

thf(n1_decl,type,
    n1: $i ).

thf(1,conjecture,
    ( ( ( n1 @ ( n5 @ minus ) @ ( pv56 @ leq ) )
      & ( pv56 @ ( n0 @ leq ) ) )
   => ( ( n1 @ ( n5 @ minus ) @ ( pv56 @ leq ) )
      & ( pv56 @ ( n0 @ leq ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0021) ).

thf(2,negated_conjecture,
    ~ ( ( ( n1 @ ( n5 @ minus ) @ ( pv56 @ leq ) )
        & ( pv56 @ ( n0 @ leq ) ) )
     => ( ( n1 @ ( n5 @ minus ) @ ( pv56 @ leq ) )
        & ( pv56 @ ( n0 @ leq ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(85,plain,
    ~ $true,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(86,plain,
    $false,
    inference(simp,[status(thm)],[85]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV080+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.07  % 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.12/0.38  % Computer : n016.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sat Sep 26 13:16:00 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  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.91/0.96  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.59/1.22  % [INFO] 	 Parsing done (253ms). 
% 1.59/1.23  % [INFO] 	 Running in sequential loop mode. 
% 2.54/1.69  % [INFO] 	 eprover registered as external prover. 
% 2.77/1.70  % [INFO] 	 Scanning for conjecture ... 
% 2.99/1.81  % [INFO] 	 Found a conjecture (or negated_conjecture) and 84 axioms. Running axiom selection ... 
% 3.19/1.91  % [INFO] 	 Axiom selection finished. Selected 82 axioms (removed 2 axioms). 
% 3.19/2.05  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 3.64/2.07  % [INFO] 	 Type checking passed. 
% 3.64/2.07  % [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 ... 
% 8.61/3.56  % [INFO] 	 Killing All external provers ... 
% 8.61/3.57  % Time passed: 3037ms (effective reasoning time: 2325ms)
% 8.61/3.57  % 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)>
% 8.61/3.57  % Axioms used in derivation (0): 
% 8.61/3.57  % No. of inferences in proof: 4
% 8.61/3.57  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3037 ms resp. 2325 ms w/o parsing
% 8.92/3.62  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.92/3.62  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------