↑ 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  : NUM531+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 : n010.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:09:04 AM UTC 2026

% Result   : Theorem 5.77s 3.56s
% Output   : Refutation 6.01s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   27 (  10 unt;   0 typ;   2 def)
%            Number of atoms       :   81 (  21 equ;   0 cnn)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :  157 (  39   ~;  15   |;  22   &;  70   @)
%                                         (   1 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   30 (   1   ^;  18   !;   9   ?;  30   :)
%                                         (   0  !>;   0  ?*;   0  @-;   2  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(slcrc0_decl,type,
    slcrc0: $i ).

thf(aSet0_decl,type,
    aSet0: $i > $o ).

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

thf(isCountable0_decl,type,
    isCountable0: $i > $o ).

thf(isFinite0_decl,type,
    isFinite0: $i > $o ).

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

thf(sk2_decl,type,
    sk2: $i > $i ).

thf(sk1_def,definition,
    ( sk1
    = ( @+[A: $i] :
          ~ ( ( ( A @ isCountable0 )
              & ( A @ aSet0 ) )
           => ~ ( ( A = slcrc0 )
                & ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) ) ) ) ) ) ).

thf(sk2_def,definition,
    ( sk2
    = ( ^ [A: $i] :
        @+[B: $i] : ( A @ ( B @ aElementOf0 ) ) ) ) ).

thf(3,axiom,
    ! [A: $i] :
      ( ( A = slcrc0 )
    <=> ( ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) )
        & ( A @ aSet0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).

thf(18,plain,
    ! [A: $i] :
      ( ( ( ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) )
          & ( A @ aSet0 ) )
       => ( A = slcrc0 ) )
      & ( ( A = slcrc0 )
       => ( ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) )
          & ( A @ aSet0 ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(19,plain,
    ( ! [A: $i] :
        ( ( ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) )
          & ( A @ aSet0 ) )
       => ( A = slcrc0 ) )
    & ! [A: $i] :
        ( ( A = slcrc0 )
       => ( ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) )
          & ( A @ aSet0 ) ) ) ),
    inference(miniscope,[status(thm)],[18]) ).

thf(20,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( ( C = slcrc0 )
        | ( C @ ( C @ sk2 @ aElementOf0 ) )
        | ~ ( C @ aSet0 ) )
      & ( ~ ( A @ ( B @ aElementOf0 ) )
        | ( A != slcrc0 ) )
      & ( ( A @ aSet0 )
        | ( A != slcrc0 ) ) ),
    inference(cnf,[status(esa)],[19]) ).

thf(21,plain,
    ! [A: $i] :
      ( ( A @ aSet0 )
      | ( A != slcrc0 ) ),
    inference(cnfConj,[status(thm)],[20]) ).

thf(24,plain,
    ! [A: $i] :
      ( ( A @ aSet0 )
      | ( A != slcrc0 ) ),
    inference(lifteq,[status(thm)],[21]) ).

thf(25,plain,
    slcrc0 @ aSet0,
    inference(simp,[status(thm)],[24]) ).

thf(10,axiom,
    ! [A: $i] :
      ( ( ( A @ isCountable0 )
        & ( A @ aSet0 ) )
     => ~ ( A @ isFinite0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCountNFin) ).

thf(37,plain,
    ! [A: $i] :
      ( ( ( A @ isCountable0 )
        & ( A @ aSet0 ) )
     => ~ ( A @ isFinite0 ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).

thf(38,plain,
    ! [A: $i] :
      ( ~ ( A @ isFinite0 )
      | ~ ( A @ isCountable0 )
      | ~ ( A @ aSet0 ) ),
    inference(cnf,[status(esa)],[37]) ).

thf(79,plain,
    ! [A: $i] :
      ( ( ( slcrc0 @ aSet0 )
       != ( A @ aSet0 ) )
      | ~ ( A @ isFinite0 )
      | ~ ( A @ isCountable0 )
      | ~ $true ),
    inference(paramod_ordered,[status(thm)],[25,38]) ).

thf(80,plain,
    ! [A: $i] :
      ( ( ( slcrc0 @ aSet0 )
       != ( A @ aSet0 ) )
      | ~ ( A @ isFinite0 )
      | ~ ( A @ isCountable0 ) ),
    inference(simp,[status(thm)],[79]) ).

thf(81,plain,
    ( ~ ( slcrc0 @ isFinite0 )
    | ~ ( slcrc0 @ isCountable0 ) ),
    inference(pattern_uni,[status(thm)],[80:[bind(A,$thf( slcrc0 ))]]) ).

thf(8,axiom,
    slcrc0 @ isFinite0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEmpFin) ).

thf(35,plain,
    slcrc0 @ isFinite0,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(1,conjecture,
    ! [A: $i] :
      ( ( ( A @ isCountable0 )
        & ( A @ aSet0 ) )
     => ~ ( ( A = slcrc0 )
          & ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

thf(2,negated_conjecture,
    ~ ! [A: $i] :
        ( ( ( A @ isCountable0 )
          & ( A @ aSet0 ) )
       => ~ ( ( A = slcrc0 )
            & ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(11,plain,
    ~ ! [A: $i] :
        ( ( ( A @ isCountable0 )
          & ( A @ aSet0 ) )
       => ~ ( ( A = slcrc0 )
            & ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(12,plain,
    ! [A: $i] :
      ( ( sk1 = slcrc0 )
      & ~ ( sk1 @ ( A @ aElementOf0 ) )
      & ( sk1 @ isCountable0 )
      & ( sk1 @ aSet0 ) ),
    inference(cnf,[status(esa)],[11]) ).

thf(14,plain,
    sk1 @ isCountable0,
    inference(cnfConj,[status(thm)],[12]) ).

thf(16,plain,
    sk1 = slcrc0,
    inference(cnfConj,[status(thm)],[12]) ).

thf(17,plain,
    sk1 = slcrc0,
    inference(lifteq,[status(thm)],[16]) ).

thf(40,plain,
    slcrc0 @ isCountable0,
    inference(rewrite,[status(thm)],[14,17]) ).

thf(88,plain,
    ( ~ $true
    | ~ $true ),
    inference(rewrite,[status(thm)],[81,35,40]) ).

thf(89,plain,
    $false,
    inference(simp,[status(thm)],[88]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : NUM531+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.12  % 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.25/0.49  % Computer : n010.cluster.edu
% 0.25/0.49  % Model    : x86_64 x86_64
% 0.25/0.49  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.25/0.49  % Memory   : 8046.5625MB
% 0.25/0.49  % OS       : Linux 6.8.0-71-generic
% 0.25/0.49  % CPULimit : 300
% 0.25/0.49  % WCLimit  : 300
% 0.25/0.49  % DateTime : Sat Sep 26 03:08:15 UTC 2026
% 0.25/0.50  % CPUTime  : 
% 0.25/0.50  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.39/1.36  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.89/1.63  % [INFO] 	 Parsing done (259ms). 
% 1.89/1.65  % [INFO] 	 Running in sequential loop mode. 
% 2.79/2.21  % [INFO] 	 eprover registered as external prover. 
% 2.79/2.22  % [INFO] 	 Scanning for conjecture ... 
% 2.79/2.29  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.97/2.32  % [INFO] 	 Found a conjecture (or negated_conjecture) and 8 axioms. Running axiom selection ... 
% 2.97/2.35  % [INFO] 	 Axiom selection finished. Selected 8 axioms (removed 0 axioms). 
% 2.97/2.36  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.97/2.37  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.97/2.38  % [INFO] 	 Type checking passed. 
% 2.97/2.38  % [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 ... 
% 5.77/3.54  % [INFO] 	 Killing All external provers ... 
% 5.77/3.55  % Time passed: 2816ms (effective reasoning time: 1882ms)
% 5.77/3.55  % 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)>
% 5.77/3.56  % Axioms used in derivation (3): mDefEmp, mCountNFin, mEmpFin
% 5.77/3.56  % No. of inferences in proof: 25
% 5.77/3.56  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2816 ms resp. 1882 ms w/o parsing
% 6.01/3.65  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.01/3.65  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------