↑ 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  : LCL414+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 : n020.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 07:51:44 AM UTC 2026

% Result   : Theorem 3.27s 2.25s
% Output   : Refutation 3.27s
% 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       :   22 (   0 equ;   0 cnn)
%            Maximal formula atoms :    7 (   5 avg)
%            Number of connectives :  137 (  14   ~;   6   |;  12   &; 105   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (  11 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   30 (   0   ^;  27   !;   3   ?;  30   :)

% Comments : 
%------------------------------------------------------------------------------
thf(a_truth_decl,type,
    a_truth: $i > $o ).

thf(implies_decl,type,
    implies: $i > $i > $i ).

thf(not_decl,type,
    not: $i > $i ).

thf(1,conjecture,
    ~ ( ? [A: $i] :
          ~ ( A @ ( A @ implies ) @ a_truth )
      & ! [A: $i,B: $i] : ( A @ ( B @ implies ) @ ( B @ not @ ( A @ not @ implies ) @ implies ) @ a_truth )
      & ! [A: $i,B: $i,C: $i] : ( C @ ( A @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ ( C @ ( B @ implies ) @ ( A @ implies ) @ implies ) @ a_truth )
      & ! [A: $i,B: $i] : ( A @ ( B @ implies ) @ ( A @ implies ) @ a_truth )
      & ! [A: $i,B: $i] :
          ( ( B @ a_truth )
          | ~ ( A @ a_truth )
          | ~ ( B @ ( A @ implies ) @ a_truth ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm147) ).

thf(2,negated_conjecture,
    ~ ~ ( ? [A: $i] :
            ~ ( A @ ( A @ implies ) @ a_truth )
        & ! [A: $i,B: $i] : ( A @ ( B @ implies ) @ ( B @ not @ ( A @ not @ implies ) @ implies ) @ a_truth )
        & ! [A: $i,B: $i,C: $i] : ( C @ ( A @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ ( C @ ( B @ implies ) @ ( A @ implies ) @ implies ) @ a_truth )
        & ! [A: $i,B: $i] : ( A @ ( B @ implies ) @ ( A @ implies ) @ a_truth )
        & ! [A: $i,B: $i] :
            ( ( B @ a_truth )
            | ~ ( A @ a_truth )
            | ~ ( B @ ( A @ implies ) @ a_truth ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ~ ( ? [A: $i] :
            ~ ( A @ ( A @ implies ) @ a_truth )
        & ! [A: $i,B: $i] : ( A @ ( B @ implies ) @ ( B @ not @ ( A @ not @ implies ) @ implies ) @ a_truth )
        & ! [A: $i,B: $i,C: $i] : ( C @ ( A @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ ( C @ ( B @ implies ) @ ( A @ implies ) @ implies ) @ a_truth )
        & ! [A: $i,B: $i] : ( A @ ( B @ implies ) @ ( A @ implies ) @ a_truth )
        & ! [A: $i,B: $i] :
            ( ( B @ a_truth )
            | ~ ( A @ a_truth )
            | ~ ( B @ ( A @ implies ) @ a_truth ) ) ),
    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  : LCL414+1 : TPTP v9.3.1. Released v2.5.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.16/0.42  % Computer : n020.cluster.edu
% 0.16/0.42  % Model    : x86_64 x86_64
% 0.16/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42  % Memory   : 8046.5625MB
% 0.16/0.42  % OS       : Linux 6.8.0-71-generic
% 0.16/0.42  % CPULimit : 300
% 0.16/0.42  % WCLimit  : 300
% 0.16/0.42  % DateTime : Fri Sep 25 22:29:03 UTC 2026
% 0.16/0.43  % CPUTime  : 
% 0.16/0.43  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.90/0.90  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.11/1.08  % [INFO] 	 Parsing done (175ms). 
% 1.11/1.09  % [INFO] 	 Running in sequential loop mode. 
% 1.66/1.48  % [INFO] 	 eprover registered as external prover. 
% 1.66/1.49  % [INFO] 	 Scanning for conjecture ... 
% 2.02/1.60  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.02/1.64  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.02/1.64  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.02/1.64  % [INFO] 	 Type checking passed. 
% 2.02/1.65  % [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.27/2.25  % External prover 'e' found a proof!
% 3.27/2.25  % [INFO] 	 Killing All external provers ... 
% 3.27/2.25  % Time passed: 1694ms (effective reasoning time: 1152ms)
% 3.27/2.25  % 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.27/2.25  % Axioms used in derivation (0): 
% 3.27/2.25  % No. of inferences in proof: 4
% 3.27/2.25  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1694 ms resp. 1152 ms w/o parsing
% 3.27/2.29  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.27/2.29  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------