↑ 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  : SET583+3 : TPTP v9.3.1. Released v2.2.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 : n020.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:30:19 AM UTC 2026

% Result   : Theorem 3.48s 2.33s
% Output   : Refutation 3.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   10 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   30 (   6 equ;   0 cnn)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   68 (   2   ~;   0   |;   8   &;  46   @)
%                                         (   2 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :   19 (   0   ^;  19   !;   0   ?;  19   :)

% Comments : 
%------------------------------------------------------------------------------
thf(subset_decl,type,
    subset: $i > $i > $o ).

thf(member_decl,type,
    member: $i > $i > $o ).

thf(1,conjecture,
    ! [A: $i,B: $i] :
      ( ( ( A @ ( B @ subset ) )
        & ( B @ ( A @ subset ) ) )
     => ( A = B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_extensionality) ).

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

thf(6,plain,
    ~ ! [A: $i,B: $i] :
        ( ( ( A @ ( B @ subset ) )
          & ( B @ ( A @ subset ) ) )
       => ( A = B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
    ! [A: $i,B: $i] :
      ( ( A = B )
    <=> ( ( A @ ( B @ subset ) )
        & ( B @ ( A @ subset ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).

thf(12,plain,
    ! [A: $i,B: $i] :
      ( ( ( ( A @ ( B @ subset ) )
          & ( B @ ( A @ subset ) ) )
       => ( A = B ) )
      & ( ( A = B )
       => ( ( A @ ( B @ subset ) )
          & ( B @ ( A @ subset ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(4,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ subset ) )
    <=> ! [C: $i] :
          ( ( A @ ( C @ member ) )
         => ( B @ ( C @ member ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).

thf(24,plain,
    ! [A: $i,B: $i] :
      ( ( ! [C: $i] :
            ( ( A @ ( C @ member ) )
           => ( B @ ( C @ member ) ) )
       => ( B @ ( A @ subset ) ) )
      & ( ( B @ ( A @ subset ) )
       => ! [C: $i] :
            ( ( A @ ( C @ member ) )
           => ( B @ ( C @ member ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(5,axiom,
    ! [A: $i] : ( A @ ( A @ subset ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_of_subset) ).

thf(32,plain,
    ! [A: $i] : ( A @ ( A @ subset ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(34,plain,
    $false,
    inference(e,[status(thm)],[6,12,24,32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET583+3 : TPTP v9.3.1. Released v2.2.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.14/0.40  % Computer : n020.cluster.edu
% 0.14/0.40  % Model    : x86_64 x86_64
% 0.14/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40  % Memory   : 8046.5625MB
% 0.14/0.40  % OS       : Linux 6.8.0-71-generic
% 0.14/0.40  % CPULimit : 300
% 0.14/0.40  % WCLimit  : 300
% 0.14/0.40  % DateTime : Sat Sep 26 07:58:19 UTC 2026
% 0.14/0.40  % CPUTime  : 
% 0.14/0.40  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.87/0.98  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.27/1.17  % [INFO] 	 Parsing done (182ms). 
% 1.27/1.18  % [INFO] 	 Running in sequential loop mode. 
% 2.02/1.60  % [INFO] 	 eprover registered as external prover. 
% 2.02/1.61  % [INFO] 	 Scanning for conjecture ... 
% 2.19/1.70  % [INFO] 	 Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ... 
% 2.19/1.74  % [INFO] 	 Axiom selection finished. Selected 3 axioms (removed 0 axioms). 
% 2.19/1.74  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.19/1.75  % [INFO] 	 Type checking passed. 
% 2.19/1.75  % [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.48/2.33  % External prover 'e' found a proof!
% 3.48/2.33  % [INFO] 	 Killing All external provers ... 
% 3.48/2.33  % Time passed: 1794ms (effective reasoning time: 1142ms)
% 3.48/2.33  % 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.48/2.33  % Axioms used in derivation (3): equal_defn, subset_defn, reflexivity_of_subset
% 3.48/2.33  % No. of inferences in proof: 10
% 3.48/2.33  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1794 ms resp. 1142 ms w/o parsing
% 3.48/2.37  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.48/2.37  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------