↑ 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  : SYN364+1 : TPTP v9.3.1. Released v2.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 09:17:22 AM UTC 2026

% Result   : Theorem 3.52s 2.30s
% Output   : Refutation 3.52s
% 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       :   28 (   0 equ;   0 cnn)
%            Maximal formula atoms :    9 (   7 avg)
%            Number of connectives :   83 (   5   ~;   3   |;  12   &;  54   @)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   9 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   :   24 (   0   ^;  15   !;   9   ?;  24   :)

% Comments : 
%------------------------------------------------------------------------------
thf(big_p_decl,type,
    big_p: $i > $i > $o ).

thf(big_m_decl,type,
    big_m: $i > $o ).

thf(big_q_decl,type,
    big_q: $i > $o ).

thf(f_decl,type,
    f: $i > $i > $i ).

thf(g_decl,type,
    g: $i > $i ).

thf(1,conjecture,
    ( ( ! [A: $i] :
          ( ( A @ big_q )
         => ~ ( A @ g @ big_m ) )
      & ! [A: $i] :
        ? [B: $i] :
          ( ( ( B @ ( A @ f ) @ big_q )
            & ( A @ big_m ) )
          | ( B @ ( A @ big_p ) ) )
      & ! [A: $i] :
          ( ? [B: $i] : ( B @ ( A @ big_p ) )
         => ! [B: $i] : ( B @ ( B @ big_p ) ) ) )
   => ! [A: $i] :
      ? [B: $i] :
        ( ( A @ ( A @ big_p ) )
        & ( B @ ( A @ g @ big_p ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2115) ).

thf(2,negated_conjecture,
    ~ ( ( ! [A: $i] :
            ( ( A @ big_q )
           => ~ ( A @ g @ big_m ) )
        & ! [A: $i] :
          ? [B: $i] :
            ( ( ( B @ ( A @ f ) @ big_q )
              & ( A @ big_m ) )
            | ( B @ ( A @ big_p ) ) )
        & ! [A: $i] :
            ( ? [B: $i] : ( B @ ( A @ big_p ) )
           => ! [B: $i] : ( B @ ( B @ big_p ) ) ) )
     => ! [A: $i] :
        ? [B: $i] :
          ( ( A @ ( A @ big_p ) )
          & ( B @ ( A @ g @ big_p ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ( ! [A: $i] :
            ( ( A @ big_q )
           => ~ ( A @ g @ big_m ) )
        & ! [A: $i] :
          ? [B: $i] :
            ( ( ( B @ ( A @ f ) @ big_q )
              & ( A @ big_m ) )
            | ( B @ ( A @ big_p ) ) )
        & ! [A: $i] :
            ( ? [B: $i] : ( B @ ( A @ big_p ) )
           => ! [B: $i] : ( B @ ( B @ big_p ) ) ) )
     => ! [A: $i] :
        ? [B: $i] :
          ( ( A @ ( A @ big_p ) )
          & ( B @ ( A @ g @ big_p ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN364+1 : TPTP v9.3.1. Released v2.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.14/0.39  % Computer : n003.cluster.edu
% 0.14/0.39  % Model    : x86_64 x86_64
% 0.14/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39  % Memory   : 8046.5625MB
% 0.14/0.39  % OS       : Linux 6.8.0-71-generic
% 0.14/0.40  % CPULimit : 300
% 0.14/0.40  % WCLimit  : 300
% 0.14/0.40  % DateTime : Sat Sep 26 17:39:54 UTC 2026
% 0.14/0.40  % CPUTime  : 
% 0.14/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.85/0.97  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.25/1.16  % [INFO] 	 Parsing done (181ms). 
% 1.25/1.17  % [INFO] 	 Running in sequential loop mode. 
% 1.80/1.58  % [INFO] 	 eprover registered as external prover. 
% 1.80/1.59  % [INFO] 	 Scanning for conjecture ... 
% 2.00/1.70  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.18/1.73  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.18/1.74  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.18/1.74  % [INFO] 	 Type checking passed. 
% 2.18/1.75  % [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.52/2.30  % External prover 'e' found a proof!
% 3.52/2.30  % [INFO] 	 Killing All external provers ... 
% 3.52/2.30  % Time passed: 1760ms (effective reasoning time: 1119ms)
% 3.52/2.30  % 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.52/2.30  % Axioms used in derivation (0): 
% 3.52/2.30  % No. of inferences in proof: 4
% 3.52/2.30  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1760 ms resp. 1119 ms w/o parsing
% 3.52/2.34  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.52/2.34  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------