↑ 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  : SYO257^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 : n009.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:29 AM UTC 2026

% Result   : Theorem 3.35s 2.13s
% Output   : Refutation 3.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (   5 unt;   0 typ;   1 def)
%            Number of atoms       :   29 (   3 equ;   0 cnn)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :  106 (   9   ~;   1   |;   7   &;  84   @)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   35 (   1   ^;  29   !;   4   ?;  35   :)
%                                         (   0  !>;   0  ?*;   0  @-;   1  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(h_decl,type,
    h: $i > $i ).

thf(g_decl,type,
    g: $i > $i ).

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

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

thf(sk1_def,definition,
    ( sk1
    = ( ^ [A: $i] :
        @+[B: $i] :
          ~ ( ( ! [C: $i > $i,D: $i] : ( cP @ D @ ( C @ A ) )
              & ( cP @ A @ B ) )
           => ( cP @ B @ ( g @ ( h @ B ) ) ) ) ) ) ).

thf(1,conjecture,
    ? [A: $i] :
    ! [B: $i] :
      ( ! [C: $i > $i,D: $i] :
          ( ( cP @ D @ ( C @ A ) )
          & ( cP @ A @ B ) )
     => ( cP @ B @ ( g @ ( h @ B ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM84) ).

thf(2,negated_conjecture,
    ~ ? [A: $i] :
      ! [B: $i] :
        ( ! [C: $i > $i,D: $i] :
            ( ( cP @ D @ ( C @ A ) )
            & ( cP @ A @ B ) )
       => ( cP @ B @ ( g @ ( h @ B ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ? [A: $i] :
      ! [B: $i] :
        ( ! [C: $i > $i,D: $i] :
            ( ( cP @ D @ ( C @ A ) )
            & ( cP @ A @ B ) )
       => ( cP @ B @ ( g @ ( h @ B ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ~ ? [A: $i] :
      ! [B: $i] :
        ( ( ! [C: $i > $i,D: $i] : ( cP @ D @ ( C @ A ) )
          & ( cP @ A @ B ) )
       => ( cP @ B @ ( g @ ( h @ B ) ) ) ),
    inference(miniscope,[status(thm)],[3]) ).

thf(5,plain,
    ! [C: $i,B: $i > $i,A: $i] :
      ( ( cP @ C @ ( B @ A ) )
      & ( cP @ A @ ( sk1 @ A ) )
      & ~ ( cP @ ( sk1 @ A ) @ ( g @ ( h @ ( sk1 @ A ) ) ) ) ),
    inference(cnf,[status(esa)],[4]) ).

thf(6,plain,
    ! [C: $i,B: $i > $i,A: $i] : ( cP @ C @ ( B @ A ) ),
    inference(cnfConj,[status(thm)],[5]) ).

thf(8,plain,
    ! [A: $i] :
      ~ ( cP @ ( sk1 @ A ) @ ( g @ ( h @ ( sk1 @ A ) ) ) ),
    inference(cnfConj,[status(thm)],[5]) ).

thf(10,plain,
    ! [D: $i,C: $i,B: $i > $i,A: $i] :
      ( ~ $true
      | ( ( cP @ C @ ( B @ A ) )
       != ( cP @ ( sk1 @ D ) @ ( g @ ( h @ ( sk1 @ D ) ) ) ) ) ),
    inference(paramod_ordered,[status(thm)],[6,8]) ).

thf(11,plain,
    ! [D: $i,C: $i,B: $i > $i,A: $i] :
      ( ( cP @ C @ ( B @ A ) )
     != ( cP @ ( sk1 @ D ) @ ( g @ ( h @ ( sk1 @ D ) ) ) ) ),
    inference(simp,[status(thm)],[10]) ).

thf(12,plain,
    $false,
    inference(pre_uni,[status(thm)],[11:[bind(A,$thf( g @ ( h @ ( sk1 @ D ) ) )),bind(B,$thf( ^ [E: $i] : E )),bind(C,$thf( sk1 @ D ))]]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO257^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.22  % Computer : n009.cluster.edu
% 0.09/0.22  % Model    : x86_64 x86_64
% 0.09/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22  % Memory   : 8046.5625MB
% 0.09/0.22  % OS       : Linux 6.8.0-71-generic
% 0.09/0.22  % CPULimit : 300
% 0.09/0.22  % WCLimit  : 300
% 0.09/0.22  % DateTime : Tue Sep 29 16:41:45 UTC 2026
% 0.09/0.22  % CPUTime  : 
% 0.09/0.22  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.79  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.18/0.98  % [INFO] 	 Parsing done (185ms). 
% 1.18/0.99  % [INFO] 	 Running in sequential loop mode. 
% 1.74/1.39  % [INFO] 	 eprover registered as external prover. 
% 1.90/1.40  % [INFO] 	 Scanning for conjecture ... 
% 1.90/1.48  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.07/1.52  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.07/1.52  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.07/1.52  % [INFO] 	 Type checking passed. 
% 2.07/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 ... 
% 3.10/2.12  % [INFO] 	 Killing All external provers ... 
% 3.10/2.13  % Time passed: 1761ms (effective reasoning time: 1121ms)
% 3.10/2.13  % 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.10/2.13  % Axioms used in derivation (0): 
% 3.10/2.13  % No. of inferences in proof: 10
% 3.35/2.13  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1761 ms resp. 1121 ms w/o parsing
% 3.35/2.18  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.35/2.18  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------