↑ 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  : SET062^6 : TPTP v9.3.1. Released v5.1.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 : n011.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:22:53 AM UTC 2026

% Result   : Theorem 2.39s 1.66s
% Output   : Refutation 2.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    4 (   2 unt;   0 typ;   0 def)
%            Number of atoms       :    6 (   0 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    6 (   2   ~;   0   |;   0   &;   2   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    3 (   1 usr;   2 con; 0-1 aty)
%            Number of variables   :    2 (   0   ^;   2   !;   0   ?;   2   :)

% Comments : 
%------------------------------------------------------------------------------
thf(cA_decl,type,
    cA: $i > $o ).

thf(1,conjecture,
    ! [A: $i] :
      ( $false
     => ( cA @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cSET76_pme) ).

thf(2,negated_conjecture,
    ~ ! [A: $i] :
        ( $false
       => ( cA @ A ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ $true,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    $false,
    inference(simp,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET062^6 : TPTP v9.3.1. Released v5.1.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 : n011.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.21  % DateTime : Tue Sep 29 13:36:46 UTC 2026
% 0.11/0.21  % CPUTime  : 
% 0.11/0.21  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.79  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.24/0.97  % [INFO] 	 Parsing done (179ms). 
% 1.24/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.85/1.39  % [INFO] 	 eprover registered as external prover. 
% 2.04/1.40  % [INFO] 	 Scanning for conjecture ... 
% 2.04/1.47  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.22/1.50  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.22/1.51  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.22/1.51  % [INFO] 	 Type checking passed. 
% 2.22/1.52  % [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 ... 
% 2.39/1.66  % [INFO] 	 Killing All external provers ... 
% 2.39/1.66  % Time passed: 1298ms (effective reasoning time: 668ms)
% 2.39/1.66  % 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)>
% 2.39/1.66  % Axioms used in derivation (0): 
% 2.39/1.66  % No. of inferences in proof: 4
% 2.39/1.66  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1298 ms resp. 668 ms w/o parsing
% 2.61/1.70  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.61/1.70  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------