↑ 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  : PUZ060+1 : TPTP v9.3.1. Released v3.1.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 08:21:15 AM UTC 2026

% Result   : Theorem 2.90s 1.60s
% Output   : Refutation 2.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    4 (   1 unt;   0 typ;   0 def)
%            Number of atoms       :   43 (   0 equ;   0 cnn)
%            Maximal formula atoms :   14 (  10 avg)
%            Number of connectives :  107 (   2   ~;   0   |;  24   &;  66   @)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (  16 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   36 (   0   ^;  33   !;   3   ?;  36   :)

% Comments : 
%------------------------------------------------------------------------------
thf(food_decl,type,
    food: $i > $o ).

thf(likes_decl,type,
    likes: $i > $i > $o ).

thf(eats_decl,type,
    eats: $i > $i > $o ).

thf(not_killed_by_decl,type,
    not_killed_by: $i > $i > $o ).

thf(alive_decl,type,
    alive: $i > $o ).

thf(1,conjecture,
    ! [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i] :
      ( ( ! [G: $i] :
            ( ( G @ alive )
           => ! [H: $i] : ( H @ ( G @ not_killed_by ) ) )
        & ! [G: $i] :
            ( ( G @ ( C @ eats ) )
           => ( G @ ( D @ eats ) ) )
        & ( C @ alive )
        & ( A @ ( C @ eats ) )
        & ! [G: $i] :
            ( ? [H: $i] :
                ( ( G @ ( H @ not_killed_by ) )
                & ( G @ ( H @ eats ) ) )
           => ( G @ food ) )
        & ( F @ food )
        & ( E @ food )
        & ! [G: $i] :
            ( ( G @ food )
           => ( G @ ( B @ likes ) ) ) )
     => ( A @ ( B @ likes ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

thf(2,negated_conjecture,
    ~ ! [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i] :
        ( ( ! [G: $i] :
              ( ( G @ alive )
             => ! [H: $i] : ( H @ ( G @ not_killed_by ) ) )
          & ! [G: $i] :
              ( ( G @ ( C @ eats ) )
             => ( G @ ( D @ eats ) ) )
          & ( C @ alive )
          & ( A @ ( C @ eats ) )
          & ! [G: $i] :
              ( ? [H: $i] :
                  ( ( G @ ( H @ not_killed_by ) )
                  & ( G @ ( H @ eats ) ) )
             => ( G @ food ) )
          & ( F @ food )
          & ( E @ food )
          & ! [G: $i] :
              ( ( G @ food )
             => ( G @ ( B @ likes ) ) ) )
       => ( A @ ( B @ likes ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i] :
        ( ( ! [G: $i] :
              ( ( G @ alive )
             => ! [H: $i] : ( H @ ( G @ not_killed_by ) ) )
          & ! [G: $i] :
              ( ( G @ ( C @ eats ) )
             => ( G @ ( D @ eats ) ) )
          & ( C @ alive )
          & ( A @ ( C @ eats ) )
          & ! [G: $i] :
              ( ? [H: $i] :
                  ( ( G @ ( H @ not_killed_by ) )
                  & ( G @ ( H @ eats ) ) )
             => ( G @ food ) )
          & ( F @ food )
          & ( E @ food )
          & ! [G: $i] :
              ( ( G @ food )
             => ( G @ ( B @ likes ) ) ) )
       => ( A @ ( B @ likes ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(18,plain,
    $false,
    inference(e,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ060+1 : TPTP v9.3.1. Released v3.1.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.11/0.38  % Computer : n007.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sat Sep 26 05:08:53 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  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.59/0.70  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 0.71/0.79  % [INFO] 	 Parsing done (91ms). 
% 0.71/0.80  % [INFO] 	 Running in sequential loop mode. 
% 1.15/0.99  % [INFO] 	 eprover registered as external prover. 
% 1.15/0.99  % [INFO] 	 Scanning for conjecture ... 
% 1.44/1.05  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.44/1.08  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.44/1.08  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.44/1.08  % [INFO] 	 Type checking passed. 
% 1.44/1.08  % [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.61/1.59  % External prover 'e' found a proof!
% 2.61/1.59  % [INFO] 	 Killing All external provers ... 
% 2.61/1.59  % Time passed: 1114ms (effective reasoning time: 796ms)
% 2.61/1.59  % 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.61/1.60  % Axioms used in derivation (0): 
% 2.61/1.60  % No. of inferences in proof: 4
% 2.90/1.60  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1114 ms resp. 796 ms w/o parsing
% 2.90/1.64  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.90/1.64  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------