↑ 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  : SYO090^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 : n015.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:12 AM UTC 2026

% Result   : Theorem 3.13s 2.00s
% Output   : Refutation 3.13s
% 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       :   79 (   0 equ;   0 cnn)
%            Maximal formula atoms :   26 (  19 avg)
%            Number of connectives :  131 (  56   ~;  30   |;  42   &;   0   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (  12 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   4 usr;   5 con; 0-0 aty)
%            Number of variables   :    0 (   0   ^;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
thf(t_decl,type,
    t: $o ).

thf(s_decl,type,
    s: $o ).

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

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

thf(1,conjecture,
    ( ( ~ ( ~ ( ( ~ ( ( ~ ( p
                          & q )
                      | ~ ( s
                          & t ) )
                    & q )
                | ~ ( s
                    & t ) )
              & q )
          | ~ ( s
              & t ) )
      | ~ q
      | ~ s
      | ~ t )
   => ( ~ ( ( ~ ( ( ~ ( ( ~ ( p
                            & q )
                        | ~ ( s
                            & t ) )
                      & q )
                  | ~ ( s
                      & t ) )
                & q )
            | ~ ( s
                & t ) )
          & q )
      | ~ ( s
          & t ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cDMG8) ).

thf(2,negated_conjecture,
    ~ ( ( ~ ( ~ ( ( ~ ( ( ~ ( p
                            & q )
                        | ~ ( s
                            & t ) )
                      & q )
                  | ~ ( s
                      & t ) )
                & q )
            | ~ ( s
                & t ) )
        | ~ q
        | ~ s
        | ~ t )
     => ( ~ ( ( ~ ( ( ~ ( ( ~ ( p
                              & q )
                          | ~ ( s
                              & t ) )
                        & q )
                    | ~ ( s
                        & t ) )
                  & q )
              | ~ ( s
                  & t ) )
            & q )
        | ~ ( s
            & t ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ( ~ ( ~ ( ( ~ ( ( ~ ( p
                            & q )
                        | ~ ( s
                            & t ) )
                      & q )
                  | ~ ( s
                      & t ) )
                & q )
            | ~ ( s
                & t ) )
        | ~ q
        | ~ s
        | ~ t )
     => ( ~ ( ( ~ ( ( ~ ( ( ~ ( p
                              & q )
                          | ~ ( s
                              & t ) )
                        & q )
                    | ~ ( s
                        & t ) )
                  & q )
              | ~ ( s
                  & t ) )
            & q )
        | ~ ( s
            & t ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO090^5 : TPTP v9.3.1. Released v4.0.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.08/0.19  % Computer : n015.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 16:36:48 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/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.89/0.78  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.23/0.96  % [INFO] 	 Parsing done (181ms). 
% 1.23/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.82/1.38  % [INFO] 	 eprover registered as external prover. 
% 1.82/1.39  % [INFO] 	 Scanning for conjecture ... 
% 2.02/1.47  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.21/1.51  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.21/1.51  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.21/1.51  % [INFO] 	 Type checking passed. 
% 2.21/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 ... 
% 3.13/1.99  % External prover 'e' found a proof!
% 3.13/1.99  % [INFO] 	 Killing All external provers ... 
% 3.13/2.00  % Time passed: 1662ms (effective reasoning time: 1012ms)
% 3.13/2.00  % 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.13/2.00  % Axioms used in derivation (0): 
% 3.13/2.00  % No. of inferences in proof: 4
% 3.13/2.00  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1662 ms resp. 1012 ms w/o parsing
% 3.13/2.02  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.13/2.02  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------