↑ 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  : SYO306^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 : n019.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:45:34 AM UTC 2026

% Result   : Theorem 2.21s 1.67s
% Output   : Refutation 2.39s
% 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 :   24 (   2   ~;   0   |;   4   &;  12   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   2 usr;   2 con; 0-1 aty)
%            Number of variables   :   10 (   0   ^;  10   !;   0   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
thf(cT_decl,type,
    cT: $i > $o ).

thf(cS_decl,type,
    cS: $i > $o ).

thf(1,conjecture,
    ( ! [A: $i > $o] :
        ( ! [B: $i] : ( A @ B )
       => ! [B: $i] : ( A @ B ) )
   => ( ! [A: $i] :
          ( ( cS @ A )
          & ( cT @ A ) )
     => ! [A: $i] :
          ( ( cS @ A )
          & ( cT @ A ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cDUP_BUG_2) ).

thf(2,negated_conjecture,
    ~ ( ! [A: $i > $o] :
          ( ! [B: $i] : ( A @ B )
         => ! [B: $i] : ( A @ B ) )
     => ( ! [A: $i] :
            ( ( cS @ A )
            & ( cT @ A ) )
       => ! [A: $i] :
            ( ( cS @ A )
            & ( cT @ 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  : SYO306^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.09/0.20  % Computer : n019.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Tue Sep 29 16:44:48 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  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.86/0.78  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.18/0.96  % [INFO] 	 Parsing done (179ms). 
% 1.18/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.73/1.38  % [INFO] 	 eprover registered as external prover. 
% 1.73/1.39  % [INFO] 	 Scanning for conjecture ... 
% 1.91/1.47  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.06/1.50  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.06/1.50  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.06/1.51  % [INFO] 	 Type checking passed. 
% 2.06/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.21/1.66  % [INFO] 	 Killing All external provers ... 
% 2.21/1.66  % Time passed: 1321ms (effective reasoning time: 679ms)
% 2.21/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.21/1.67  % Axioms used in derivation (0): 
% 2.21/1.67  % No. of inferences in proof: 4
% 2.21/1.67  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1321 ms resp. 679 ms w/o parsing
% 2.39/1.71  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.39/1.71  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------