↑ 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  : SYO204_8 : TPTP v9.3.1. Released v8.0.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 : n007.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 09:44:03 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(1,conjecture,
    ? [A: $o,B: $o] :
    ! [C: $o] :
      ( B
     => C ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cCT313) ).

thf(2,negated_conjecture,
    ~ ? [A: $o,B: $o] :
      ! [C: $o] :
        ( B
       => C ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ? [A: $o] :
      ! [B: $o] :
        ( A
       => B ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(6,plain,
    ~ ! [A: $o] :
        ( $false
       => A ),
    inference(instance,[status(thm)],[3]) ).

thf(7,plain,
    $false,
    inference(simp,[status(thm)],[6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO204_8 : TPTP v9.3.1. Released v8.0.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.13/0.40  % Computer : n007.cluster.edu
% 0.13/0.40  % Model    : x86_64 x86_64
% 0.13/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40  % Memory   : 8046.5625MB
% 0.13/0.40  % OS       : Linux 6.8.0-71-generic
% 0.13/0.40  % CPULimit : 300
% 0.13/0.40  % WCLimit  : 300
% 0.13/0.40  % DateTime : Sat Sep 26 19:03:39 UTC 2026
% 0.13/0.40  % CPUTime  : 
% 0.13/0.40  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.88/0.98  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.12/1.14  % [INFO] 	 Parsing done (161ms). 
% 1.31/1.15  % [INFO] 	 Running in sequential loop mode. 
% 1.80/1.56  % [INFO] 	 eprover registered as external prover. 
% 1.80/1.57  % [INFO] 	 Scanning for conjecture ... 
% 2.01/1.65  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.01/1.68  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.01/1.68  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 2.01/1.69  % [INFO] 	 Type checking passed. 
% 2.01/1.69  % [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 ... 
% 2.37/1.89  % [INFO] 	 Killing All external provers ... 
% 2.37/1.90  % Time passed: 1347ms (effective reasoning time: 731ms)
% 2.37/1.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)>
% 2.58/1.90  % Axioms used in derivation (0): 
% 2.58/1.90  % No. of inferences in proof: 5
% 2.58/1.90  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1347 ms resp. 731 ms w/o parsing
% 2.58/1.93  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.58/1.93  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------