↑ 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  : SEU462^1 : TPTP v9.3.1. Released v3.6.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 : n010.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 : Wed Sep 30 08:28:14 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(subrel_decl,type,
    subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).

thf(trans_decl,type,
    trans: ( $i > $i > $o ) > $o ).

thf(tc_decl,type,
    tc: ( $i > $i > $o ) > $i > $i > $o ).

thf(subrel_def,definition,
    ( subrel
    = ( ^ [A: $i > $i > $o,B: $i > $i > $o] :
        ! [C: $i,D: $i] :
          ( ( A @ C @ D )
         => ( B @ C @ D ) ) ) ) ).

thf(trans_def,definition,
    ( trans
    = ( ^ [A: $i > $i > $o] :
        ! [B: $i,C: $i,D: $i] :
          ( ( ( A @ B @ C )
            & ( A @ C @ D ) )
         => ( A @ B @ D ) ) ) ) ).

thf(tc_def,definition,
    ( tc
    = ( ^ [A: $i > $i > $o,B: $i,C: $i] :
        ! [D: $i > $i > $o] :
          ( ( ( trans @ D )
            & ( subrel @ A @ D ) )
         => ( D @ B @ C ) ) ) ) ).

thf(1,conjecture,
    ! [A: $i > $i > $o,B: $i,C: $i,D: $i > $i > $o] :
      ( ( ( trans @ D )
        & ( subrel @ A @ D )
        & ( tc @ A @ B @ C ) )
     => ( D @ B @ C ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitive_closure_is_transitive2) ).

thf(2,negated_conjecture,
    ~ ! [A: $i > $i > $o,B: $i,C: $i,D: $i > $i > $o] :
        ( ( ( trans @ D )
          & ( subrel @ A @ D )
          & ( tc @ A @ B @ C ) )
       => ( D @ B @ C ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU462^1 : TPTP v9.3.1. Released v3.6.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.11/0.21  % Computer : n010.cluster.edu
% 0.11/0.21  % Model    : x86_64 x86_64
% 0.11/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.21  % Memory   : 8046.5625MB
% 0.11/0.21  % OS       : Linux 6.8.0-71-generic
% 0.11/0.21  % CPULimit : 300
% 0.11/0.21  % WCLimit  : 300
% 0.11/0.22  % DateTime : Tue Sep 29 13:42:18 UTC 2026
% 0.11/0.22  % CPUTime  : 
% 0.11/0.22  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.86/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.55/1.08  % [INFO] 	 Parsing done (282ms). 
% 1.55/1.09  % [INFO] 	 Running in sequential loop mode. 
% 2.29/1.49  % [INFO] 	 eprover registered as external prover. 
% 2.50/1.50  % [INFO] 	 Scanning for conjecture ... 
% 2.73/1.67  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.97/1.71  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.97/1.71  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.97/1.71  % [INFO] 	 Type checking passed. 
% 2.97/1.72  % [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 ... 
% 4.42/2.39  % External prover 'e' found a proof!
% 4.42/2.39  % [INFO] 	 Killing All external provers ... 
% 4.42/2.39  % Time passed: 2036ms (effective reasoning time: 1296ms)
% 4.42/2.39  % 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)>
% 4.42/2.39  % Axioms used in derivation (0): 
% 4.42/2.39  % No. of inferences in proof: 4
% 4.42/2.40  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2036 ms resp. 1296 ms w/o parsing
% 4.64/2.44  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.64/2.44  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------