↑ 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  : PUZ082_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 : n003.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:19 AM UTC 2026

% Result   : Theorem 3.47s 2.34s
% Output   : Refutation 3.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   9 unt;   0 typ;   1 def)
%            Number of atoms       :   46 (   8 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   90 (  28   ~;   6   |;   1   &;  44   @)
%                                         (   0 <=>;  11  =>;   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     :    6 (   3 usr;   4 con; 0-2 aty)
%            Number of variables   :   10 (   0   ^;   9   !;   0   ?;  10   :)
%                                         (   0  !>;   0  ?*;   0  @-;   1  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(peter_decl,type,
    peter: $i ).

thf(says_decl,type,
    says: $i > $o > $o ).

thf(sk1_decl,type,
    sk1: $o ).

thf(sk1_def,definition,
    ( sk1
    = ( @+[A: $o] :
          ~ ( ( A @ ( peter @ says ) )
           => ~ A ) ) ) ).

thf(1,conjecture,
    ~ ! [A: $o] :
        ( ( A @ ( peter @ says ) )
       => ~ A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).

thf(2,negated_conjecture,
    ~ ~ ! [A: $o] :
          ( ( A @ ( peter @ says ) )
         => ~ A ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(4,plain,
    ~ ~ ! [A: $o] :
          ( ( A @ ( peter @ says ) )
         => ~ A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(5,plain,
    ! [A: $o] :
      ( ( A @ ( peter @ says ) )
     => ~ A ),
    inference(polarity_switch,[status(thm)],[4]) ).

thf(6,plain,
    ( ( $true @ ( peter @ says ) )
   => ~ $true ),
    inference(instance,[status(thm)],[5]) ).

thf(7,plain,
    ~ ( $true @ ( peter @ says ) ),
    inference(simp,[status(thm)],[6]) ).

thf(3,axiom,
    ( ! [A: $o] :
        ( ( A @ ( peter @ says ) )
       => ~ A )
    @ ( peter @ says ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).

thf(10,plain,
    ( ! [A: $o] :
        ( ( A @ ( peter @ says ) )
       => ~ A )
    @ ( peter @ says ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(11,plain,
    ( ( ( ! [A: $o] :
            ( ( A @ ( peter @ says ) )
           => ~ A )
        @ ( peter @ says ) )
     != ( $true @ ( peter @ says ) ) )
    | ~ $true ),
    inference(paramod_ordered,[status(thm)],[10,7]) ).

thf(12,plain,
    ( ( ! [A: $o] :
          ( ( A @ ( peter @ says ) )
         => ~ A )
      @ ( peter @ says ) )
   != ( $true @ ( peter @ says ) ) ),
    inference(simp,[status(thm)],[11]) ).

thf(13,plain,
    ( ~ ! [A: $o] :
          ( ( A @ ( peter @ says ) )
         => ~ A )
    | ( peter != peter ) ),
    inference(simp,[status(thm)],[12]) ).

thf(14,plain,
    ( ( sk1
      | ( peter != peter ) )
    & ( ( sk1 @ ( peter @ says ) )
      | ( peter != peter ) ) ),
    inference(cnf,[status(esa)],[13]) ).

thf(15,plain,
    ( ( sk1 @ ( peter @ says ) )
    | ( peter != peter ) ),
    inference(cnfConj,[status(thm)],[14]) ).

thf(17,plain,
    sk1 @ ( peter @ says ),
    inference(simp,[status(thm)],[15]) ).

thf(16,plain,
    ( sk1
    | ( peter != peter ) ),
    inference(cnfConj,[status(thm)],[14]) ).

thf(18,plain,
    sk1,
    inference(simp,[status(thm)],[16]) ).

thf(19,plain,
    $true @ ( peter @ says ),
    inference(rewrite,[status(thm)],[17,18]) ).

thf(20,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[7,19]) ).

thf(21,plain,
    $false,
    inference(simp,[status(thm)],[20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ082_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.08  % 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.15/0.39  % Computer : n003.cluster.edu
% 0.15/0.39  % Model    : x86_64 x86_64
% 0.15/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39  % Memory   : 8046.5625MB
% 0.15/0.39  % OS       : Linux 6.8.0-71-generic
% 0.15/0.39  % CPULimit : 300
% 0.15/0.39  % WCLimit  : 300
% 0.15/0.39  % DateTime : Sat Sep 26 05:17:08 UTC 2026
% 0.15/0.39  % CPUTime  : 
% 0.15/0.39  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.89/0.97  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.30/1.15  % [INFO] 	 Parsing done (178ms). 
% 1.30/1.17  % [INFO] 	 Running in sequential loop mode. 
% 1.82/1.58  % [INFO] 	 eprover registered as external prover. 
% 1.82/1.59  % [INFO] 	 Scanning for conjecture ... 
% 2.01/1.68  % [INFO] 	 Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ... 
% 2.20/1.71  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 2.20/1.72  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 2.20/1.73  % [INFO] 	 Type checking passed. 
% 2.20/1.73  % [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.47/2.33  % [INFO] 	 Killing All external provers ... 
% 3.47/2.34  % Time passed: 1801ms (effective reasoning time: 1162ms)
% 3.47/2.34  % 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.47/2.34  % Axioms used in derivation (1): ax1
% 3.47/2.34  % No. of inferences in proof: 19
% 3.47/2.34  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1801 ms resp. 1162 ms w/o parsing
% 3.47/2.39  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.47/2.39  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------