↑ 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  : RNG101+2 : 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 : n011.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 08:25:27 AM UTC 2026

% Result   : Theorem 11.55s 5.30s
% Output   : Refutation 11.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (   7 unt;   0 typ;   2 def)
%            Number of atoms       :   51 (  22 equ;   0 cnn)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :  115 (  12   ~;   5   |;  23   &;  75   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   13 (   0   ^;   4   !;   7   ?;  13   :)
%                                         (   0  !>;   0  ?*;   0  @-;   2  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(aElementOf0_decl,type,
    aElementOf0: $i > $i > $o ).

thf(aElement0_decl,type,
    aElement0: $i > $o ).

thf(sdtasdt0_decl,type,
    sdtasdt0: $i > $i > $i ).

thf(slsdtgt0_decl,type,
    slsdtgt0: $i > $i ).

thf(xc_decl,type,
    xc: $i ).

thf(xx_decl,type,
    xx: $i ).

thf(xy_decl,type,
    xy: $i ).

thf(xz_decl,type,
    xz: $i ).

thf(sk19_decl,type,
    sk19: $i ).

thf(sk20_decl,type,
    sk20: $i ).

thf(sk19_def,definition,
    ( sk19
    = ( @+[A: $i] :
          ( ( ( A @ ( xc @ sdtasdt0 ) )
            = xx )
          & ( A @ aElement0 ) ) ) ) ).

thf(sk20_def,definition,
    ( sk20
    = ( @+[A: $i] :
          ( ( ( A @ ( xc @ sdtasdt0 ) )
            = xy )
          & ( A @ aElement0 ) ) ) ) ).

thf(29,axiom,
    ( ( xz @ aElement0 )
    & ( xc @ slsdtgt0 @ ( xy @ aElementOf0 ) )
    & ? [A: $i] :
        ( ( ( A @ ( xc @ sdtasdt0 ) )
          = xy )
        & ( A @ aElement0 ) )
    & ( xc @ slsdtgt0 @ ( xx @ aElementOf0 ) )
    & ? [A: $i] :
        ( ( ( A @ ( xc @ sdtasdt0 ) )
          = xx )
        & ( A @ aElement0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1933) ).

thf(220,plain,
    ( ( xz @ aElement0 )
    & ( xc @ slsdtgt0 @ ( xy @ aElementOf0 ) )
    & ? [A: $i] :
        ( ( ( A @ ( xc @ sdtasdt0 ) )
          = xy )
        & ( A @ aElement0 ) )
    & ( xc @ slsdtgt0 @ ( xx @ aElementOf0 ) )
    & ? [A: $i] :
        ( ( ( A @ ( xc @ sdtasdt0 ) )
          = xx )
        & ( A @ aElement0 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[29]) ).

thf(221,plain,
    ( ( xz @ aElement0 )
    & ( xc @ slsdtgt0 @ ( xy @ aElementOf0 ) )
    & ( ( sk20 @ ( xc @ sdtasdt0 ) )
      = xy )
    & ( sk20 @ aElement0 )
    & ( xc @ slsdtgt0 @ ( xx @ aElementOf0 ) )
    & ( ( sk19 @ ( xc @ sdtasdt0 ) )
      = xx )
    & ( sk19 @ aElement0 ) ),
    inference(cnf,[status(esa)],[220]) ).

thf(222,plain,
    ( ( sk19 @ ( xc @ sdtasdt0 ) )
    = xx ),
    inference(cnfConj,[status(thm)],[221]) ).

thf(230,plain,
    ( ( sk19 @ ( xc @ sdtasdt0 ) )
    = xx ),
    inference(lifteq,[status(thm)],[222]) ).

thf(226,plain,
    sk19 @ aElement0,
    inference(cnfConj,[status(thm)],[221]) ).

thf(1,conjecture,
    ? [A: $i] :
      ( ( ( A @ ( xc @ sdtasdt0 ) )
        = xx )
      & ( A @ aElement0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

thf(2,negated_conjecture,
    ~ ? [A: $i] :
        ( ( ( A @ ( xc @ sdtasdt0 ) )
          = xx )
        & ( A @ aElement0 ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(42,plain,
    ~ ? [A: $i] :
        ( ( ( A @ ( xc @ sdtasdt0 ) )
          = xx )
        & ( A @ aElement0 ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(43,plain,
    ! [A: $i] :
      ( ( ( A @ ( xc @ sdtasdt0 ) )
       != xx )
      | ~ ( A @ aElement0 ) ),
    inference(cnf,[status(esa)],[42]) ).

thf(44,plain,
    ! [A: $i] :
      ( ~ ( A @ aElement0 )
      | ( ( A @ ( xc @ sdtasdt0 ) )
       != xx ) ),
    inference(lifteq,[status(thm)],[43]) ).

thf(328,plain,
    ! [A: $i] :
      ( ( ( sk19 @ aElement0 )
       != ( A @ aElement0 ) )
      | ~ $true
      | ( ( A @ ( xc @ sdtasdt0 ) )
       != xx ) ),
    inference(paramod_ordered,[status(thm)],[226,44]) ).

thf(329,plain,
    ! [A: $i] :
      ( ( ( sk19 @ aElement0 )
       != ( A @ aElement0 ) )
      | ( ( A @ ( xc @ sdtasdt0 ) )
       != xx ) ),
    inference(simp,[status(thm)],[328]) ).

thf(330,plain,
    ( ( sk19 @ ( xc @ sdtasdt0 ) )
   != xx ),
    inference(pattern_uni,[status(thm)],[329:[bind(A,$thf( sk19 ))]]) ).

thf(376,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[230,330]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : RNG101+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.13  % 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.23/0.49  % Computer : n011.cluster.edu
% 0.23/0.49  % Model    : x86_64 x86_64
% 0.23/0.49  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.49  % Memory   : 8046.5625MB
% 0.23/0.49  % OS       : Linux 6.8.0-71-generic
% 0.23/0.49  % CPULimit : 300
% 0.23/0.49  % WCLimit  : 300
% 0.23/0.49  % DateTime : Sat Sep 26 06:05:59 UTC 2026
% 0.23/0.49  % CPUTime  : 
% 0.23/0.49  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
% 1.38/1.38  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 2.13/1.70  % [INFO] 	 Parsing done (324ms). 
% 2.13/1.73  % [INFO] 	 Running in sequential loop mode. 
% 3.07/2.39  % [INFO] 	 eprover registered as external prover. 
% 3.28/2.40  % [INFO] 	 Scanning for conjecture ... 
% 3.46/2.54  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.46/2.55  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.46/2.56  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.46/2.57  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.46/2.58  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.46/2.58  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.46/2.59  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.46/2.59  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.67/2.60  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.67/2.64  % [INFO] 	 Found a conjecture (or negated_conjecture) and 39 axioms. Running axiom selection ... 
% 3.82/2.76  % [INFO] 	 Axiom selection finished. Selected 39 axioms (removed 0 axioms). 
% 3.82/2.78  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.82/2.78  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.82/2.79  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.82/2.79  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 4.04/2.81  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 4.04/2.81  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 4.04/2.83  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 4.04/2.83  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 4.04/2.84  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 4.04/2.84  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 4.04/2.86  % [INFO] 	 Type checking passed. 
% 4.04/2.87  % [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 ... 
% 11.11/5.29  % [INFO] 	 Killing All external provers ... 
% 11.55/5.30  % Time passed: 4590ms (effective reasoning time: 3554ms)
% 11.55/5.30  % 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)>
% 11.55/5.30  % Axioms used in derivation (1): m__1933
% 11.55/5.30  % No. of inferences in proof: 15
% 11.55/5.30  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 4590 ms resp. 3554 ms w/o parsing
% 11.55/5.35  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 11.55/5.35  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------