↑ 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  : SEV406^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 : n003.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:37:15 AM UTC 2026

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

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

thf(cB_decl,type,
    cB: $i > $o ).

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

thf(sk1_decl,type,
    sk1: $i ).

thf(1,conjecture,
    ( ( cP
      @ ^ [A: $i] :
          ( ( cA @ A )
          | ( cB @ A ) ) )
   => ( cP
      @ ^ [A: $i] :
          ( ( cB @ A )
          | ( cA @ A ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTRIVEXT2_pme) ).

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

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

thf(4,plain,
    ( ( cP
      @ ^ [A: $i] :
          ( ( cA @ A )
          | ( cB @ A ) ) )
    & ~ ( cP
        @ ^ [A: $i] :
            ( ( cB @ A )
            | ( cA @ A ) ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(5,plain,
    ( cP
    @ ^ [A: $i] :
        ( ( cA @ A )
        | ( cB @ A ) ) ),
    inference(cnfConj,[status(thm)],[4]) ).

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

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

thf(8,plain,
    ( ( cP
      @ ^ [A: $i] :
          ( ( cA @ A )
          | ( cB @ A ) ) )
   != ( cP
      @ ^ [A: $i] :
          ( ( cB @ A )
          | ( cA @ A ) ) ) ),
    inference(simp,[status(thm)],[7]) ).

thf(9,plain,
    ( ( ^ [A: $i] :
          ( ( cA @ A )
          | ( cB @ A ) ) )
   != ( ^ [A: $i] :
          ( ( cB @ A )
          | ( cA @ A ) ) ) ),
    inference(simp,[status(thm)],[8]) ).

thf(11,plain,
    ( ( ( cA @ sk1 )
      | ( cB @ sk1 ) )
   != ( ( cB @ sk1 )
      | ( cA @ sk1 ) ) ),
    inference(func_ext,[status(esa)],[9]) ).

thf(22,plain,
    ( ~ ( ( cA @ sk1 )
        | ( cB @ sk1 ) )
    | ~ ( ( cB @ sk1 )
        | ( cA @ sk1 ) ) ),
    inference(bool_ext,[status(thm)],[11]) ).

thf(31,plain,
    ( ( ~ ( cA @ sk1 )
      | ~ ( cB @ sk1 ) )
    & ( ~ ( cA @ sk1 )
      | ~ ( cA @ sk1 ) )
    & ( ~ ( cB @ sk1 )
      | ~ ( cB @ sk1 ) )
    & ( ~ ( cB @ sk1 )
      | ~ ( cA @ sk1 ) ) ),
    inference(cnf,[status(esa)],[22]) ).

thf(33,plain,
    ( ~ ( cA @ sk1 )
    | ~ ( cA @ sk1 ) ),
    inference(cnfConj,[status(thm)],[31]) ).

thf(35,plain,
    ~ ( cA @ sk1 ),
    inference(simp,[status(thm)],[33]) ).

thf(45,plain,
    ( ( $false
      | ( cB @ sk1 ) )
   != ( ( cB @ sk1 )
      | $false ) ),
    inference(rewrite,[status(thm)],[11,35]) ).

thf(46,plain,
    $false,
    inference(simp,[status(thm)],[45]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEV406^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.09/0.19  % Computer : n003.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Tue Sep 29 15:46:43 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.90/0.78  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.25/0.96  % [INFO] 	 Parsing done (186ms). 
% 1.25/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.86/1.39  % [INFO] 	 eprover registered as external prover. 
% 1.86/1.39  % [INFO] 	 Scanning for conjecture ... 
% 2.06/1.47  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.23/1.50  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.23/1.51  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.23/1.51  % [INFO] 	 Type checking passed. 
% 2.23/1.51  % [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.96/2.23  % [INFO] 	 Killing All external provers ... 
% 3.96/2.23  % Time passed: 1898ms (effective reasoning time: 1245ms)
% 3.96/2.23  % 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.96/2.23  % Axioms used in derivation (0): 
% 3.96/2.23  % No. of inferences in proof: 16
% 3.96/2.24  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1898 ms resp. 1245 ms w/o parsing
% 3.96/2.28  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.96/2.28  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------