↑ 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  : SYN726+1 : TPTP v9.3.1. Released v2.5.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 : n026.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:18:15 AM UTC 2026

% Result   : Theorem 3.54s 7.37s
% Output   : Refutation 3.75s
% 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       :   37 (   0 equ;   0 cnn)
%            Maximal formula atoms :   12 (   9 avg)
%            Number of connectives :  107 (   2   ~;   6   |;  15   &;  72   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (  10 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    3 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :   42 (   0   ^;  42   !;   0   ?;  42   :)

% Comments : 
%------------------------------------------------------------------------------
thf(p_decl,type,
    p: $i > $i > $o ).

thf(q_decl,type,
    q: $i > $i > $o ).

thf(1,conjecture,
    ( ! [A: $i,B: $i] : ( B @ ( A @ q ) )
    | ( ( ! [A: $i,B: $i] :
            ( ( B @ ( A @ q ) )
            | ( B @ ( A @ p ) ) )
        & ! [A: $i,B: $i] :
            ( ( B @ ( A @ q ) )
           => ( A @ ( B @ q ) ) )
        & ! [A: $i,B: $i,C: $i] :
            ( ( ( C @ ( B @ q ) )
              & ( B @ ( A @ q ) ) )
           => ( C @ ( A @ q ) ) )
        & ! [A: $i,B: $i,C: $i] :
            ( ( ( C @ ( B @ p ) )
              & ( B @ ( A @ p ) ) )
           => ( C @ ( A @ p ) ) ) )
     => ! [A: $i,B: $i] : ( B @ ( A @ p ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm400) ).

thf(2,negated_conjecture,
    ~ ( ! [A: $i,B: $i] : ( B @ ( A @ q ) )
      | ( ( ! [A: $i,B: $i] :
              ( ( B @ ( A @ q ) )
              | ( B @ ( A @ p ) ) )
          & ! [A: $i,B: $i] :
              ( ( B @ ( A @ q ) )
             => ( A @ ( B @ q ) ) )
          & ! [A: $i,B: $i,C: $i] :
              ( ( ( C @ ( B @ q ) )
                & ( B @ ( A @ q ) ) )
             => ( C @ ( A @ q ) ) )
          & ! [A: $i,B: $i,C: $i] :
              ( ( ( C @ ( B @ p ) )
                & ( B @ ( A @ p ) ) )
             => ( C @ ( A @ p ) ) ) )
       => ! [A: $i,B: $i] : ( B @ ( A @ p ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ! [A: $i,B: $i] : ( B @ ( A @ q ) )
      | ( ( ! [A: $i,B: $i] :
              ( ( B @ ( A @ q ) )
              | ( B @ ( A @ p ) ) )
          & ! [A: $i,B: $i] :
              ( ( B @ ( A @ q ) )
             => ( A @ ( B @ q ) ) )
          & ! [A: $i,B: $i,C: $i] :
              ( ( ( C @ ( B @ q ) )
                & ( B @ ( A @ q ) ) )
             => ( C @ ( A @ q ) ) )
          & ! [A: $i,B: $i,C: $i] :
              ( ( ( C @ ( B @ p ) )
                & ( B @ ( A @ p ) ) )
             => ( C @ ( A @ p ) ) ) )
       => ! [A: $i,B: $i] : ( B @ ( A @ p ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN726+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.07  % 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.13/5.41  % Computer : n026.cluster.edu
% 0.13/5.41  % Model    : x86_64 x86_64
% 0.13/5.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.41  % Memory   : 8046.5625MB
% 0.13/5.41  % OS       : Linux 6.8.0-71-generic
% 0.13/5.41  % CPULimit : 300
% 0.13/5.41  % WCLimit  : 300
% 0.13/5.41  % DateTime : Sat Sep 26 18:24:47 UTC 2026
% 0.13/5.41  % CPUTime  : 
% 0.13/5.41  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.17/6.00  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.26/6.19  % [INFO] 	 Parsing done (182ms). 
% 1.39/6.20  % [INFO] 	 Running in sequential loop mode. 
% 2.01/6.62  % [INFO] 	 eprover registered as external prover. 
% 2.01/6.62  % [INFO] 	 Scanning for conjecture ... 
% 2.20/6.72  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.20/6.76  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.20/6.76  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.20/6.77  % [INFO] 	 Type checking passed. 
% 2.20/6.77  % [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.54/7.37  % External prover 'e' found a proof!
% 3.54/7.37  % [INFO] 	 Killing All external provers ... 
% 3.54/7.37  % Time passed: 1815ms (effective reasoning time: 1163ms)
% 3.54/7.37  % 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.54/7.37  % Axioms used in derivation (0): 
% 3.54/7.37  % No. of inferences in proof: 4
% 3.54/7.37  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1815 ms resp. 1163 ms w/o parsing
% 3.75/7.41  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.75/7.41  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------