↑ 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  : SYO369_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39

% Computer : n004.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 09:44:22 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(cB_decl,type,
    cB: $o ).

thf(cA_decl,type,
    cA: $o ).

thf(cP_decl,type,
    cP: $o > $o ).

thf(1,conjecture,
    ( ( ( cA
       => cB )
      @ cP )
   => ( ( cB
        | ~ cA )
      @ cP ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTRIVEXT5) ).

thf(2,negated_conjecture,
    ~ ( ( ( cA
         => cB )
        @ cP )
     => ( ( cB
          | ~ cA )
        @ cP ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ( ( cA
         => cB )
        @ cP )
     => ( ( cB
          | ~ cA )
        @ cP ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ( ~ ( ( cB
          | ~ cA )
        @ cP )
    & ( ( cA
       => cB )
      @ cP ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(5,plain,
    ( ( cA
     => cB )
    @ cP ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(6,plain,
    ~ ( ( cB
        | ~ cA )
      @ cP ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(7,plain,
    ( ( ( ( cA
         => cB )
        @ cP )
     != ( ( cB
          | ~ cA )
        @ cP ) )
    | ~ $true ),
    inference(paramod_ordered,[status(thm)],[5,6]) ).

thf(8,plain,
    ( ( ( cA
       => cB )
      @ cP )
   != ( ( cB
        | ~ cA )
      @ cP ) ),
    inference(simp,[status(thm)],[7]) ).

thf(9,plain,
    ( ( cA
     => cB )
   != ( cB
      | ~ cA ) ),
    inference(simp,[status(thm)],[8]) ).

thf(10,plain,
    ( ~ ( cB
        | ~ cA )
    | ~ ( cA
       => cB ) ),
    inference(bool_ext,[status(thm)],[9]) ).

thf(12,plain,
    ( ( ~ cB
      | ~ cB )
    & ( cA
      | ~ cB )
    & ( ~ cB
      | cA )
    & ( cA
      | cA ) ),
    inference(cnf,[status(esa)],[10]) ).

thf(13,plain,
    ( cA
    | cA ),
    inference(cnfConj,[status(thm)],[12]) ).

thf(16,plain,
    cA,
    inference(simp,[status(thm)],[13]) ).

thf(24,plain,
    ( ( $true
     => cB )
   != ( cB
      | ~ $true ) ),
    inference(rewrite,[status(thm)],[9,16]) ).

thf(25,plain,
    $false,
    inference(simp,[status(thm)],[24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO369_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.08  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.14/0.41  % Computer : n004.cluster.edu
% 0.14/0.41  % Model    : x86_64 x86_64
% 0.14/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41  % Memory   : 8046.5625MB
% 0.14/0.41  % OS       : Linux 6.8.0-71-generic
% 0.14/0.41  % CPULimit : 300
% 0.14/0.41  % WCLimit  : 300
% 0.14/0.41  % DateTime : Sat Sep 26 19:12:06 UTC 2026
% 0.14/0.41  % CPUTime  : 
% 0.14/0.41  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.91/0.98  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.32/1.16  % [INFO] 	 Parsing done (170ms). 
% 1.32/1.17  % [INFO] 	 Running in sequential loop mode. 
% 1.89/1.57  % [INFO] 	 eprover registered as external prover. 
% 1.89/1.58  % [INFO] 	 Scanning for conjecture ... 
% 2.11/1.66  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.11/1.69  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.11/1.69  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 2.11/1.69  % [INFO] 	 Type checking passed. 
% 2.30/1.70  % [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.47/2.25  % [INFO] 	 Killing All external provers ... 
% 3.47/2.26  % Time passed: 1702ms (effective reasoning time: 1079ms)
% 3.47/2.26  % 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.47/2.26  % Axioms used in derivation (0): 
% 3.47/2.26  % No. of inferences in proof: 15
% 3.47/2.26  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1702 ms resp. 1079 ms w/o parsing
% 3.74/2.30  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.74/2.30  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------