↑ 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  : LCL732^5 : TPTP v9.3.1. Released v4.0.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 : n005.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:14:13 AM UTC 2026

% Result   : Theorem 2.16s 1.68s
% Output   : Refutation 2.34s
% 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       :   10 (   0 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   16 (   2   ~;   0   |;   0   &;   8   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   2 usr;   3 con; 0-1 aty)
%            Number of variables   :   12 (   0   ^;   4   !;   8   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
thf(b_type,type,
    b: $tType ).

thf(y_decl,type,
    y: $i ).

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

thf(1,conjecture,
    ( ! [A: b > $o] :
      ? [B: b] :
        ( ? [C: $i] : ( p @ C )
       => ( p @ y ) )
   => ? [A: ( b > $o ) > b] :
      ! [B: b > $o] :
        ( ? [C: $i] : ( p @ C )
       => ( p @ y ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX5310_SUB3) ).

thf(2,negated_conjecture,
    ~ ( ! [A: b > $o] :
        ? [B: b] :
          ( ? [C: $i] : ( p @ C )
         => ( p @ y ) )
     => ? [A: ( b > $o ) > b] :
        ! [B: b > $o] :
          ( ? [C: $i] : ( p @ C )
         => ( p @ y ) ) ),
    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  : LCL732^5 : TPTP v9.3.1. Released v4.0.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.12/0.23  % Computer : n005.cluster.edu
% 0.12/0.23  % Model    : x86_64 x86_64
% 0.12/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.23  % Memory   : 8046.5625MB
% 0.12/0.23  % OS       : Linux 6.8.0-71-generic
% 0.12/0.24  % CPULimit : 300
% 0.12/0.24  % WCLimit  : 300
% 0.12/0.24  % DateTime : Tue Sep 29 10:03:01 UTC 2026
% 0.12/0.24  % CPUTime  : 
% 0.12/0.24  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.97/0.81  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.14/0.98  % [INFO] 	 Parsing done (174ms). 
% 1.14/1.00  % [INFO] 	 Running in sequential loop mode. 
% 1.87/1.40  % [INFO] 	 eprover registered as external prover. 
% 1.87/1.41  % [INFO] 	 Scanning for conjecture ... 
% 1.87/1.49  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.02/1.52  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.02/1.52  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.02/1.53  % [INFO] 	 Type checking passed. 
% 2.02/1.53  % [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.16/1.68  % [INFO] 	 Killing All external provers ... 
% 2.16/1.68  % Time passed: 1300ms (effective reasoning time: 673ms)
% 2.16/1.68  % 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.16/1.68  % Axioms used in derivation (0): 
% 2.16/1.68  % No. of inferences in proof: 4
% 2.16/1.68  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1300 ms resp. 673 ms w/o parsing
% 2.34/1.73  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.34/1.73  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------