↑ 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  : SET596+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/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:23 AM UTC 2026

% Result   : Theorem 3.51s 1.80s
% Output   : Refutation 3.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   24 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   70 (  16 equ;   0 cnn)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  190 (   7   ~;   0   |;  16   &; 137   @)
%                                         (   6 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   54 (   0   ^;  54   !;   0   ?;  54   :)

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

thf(intersection_decl,type,
    intersection: $i > $i > $i ).

thf(empty_set_decl,type,
    empty_set: $i ).

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

thf(empty_decl,type,
    empty: $i > $o ).

thf(9,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ intersection ) )
      = ( A @ ( B @ intersection ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).

thf(56,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ intersection ) )
      = ( A @ ( B @ intersection ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(11,axiom,
    ! [A: $i] :
      ( ( A @ empty )
    <=> ! [B: $i] :
          ~ ( A @ ( B @ member ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_defn) ).

thf(61,plain,
    ! [A: $i] :
      ( ( ! [B: $i] :
            ~ ( A @ ( B @ member ) )
       => ( A @ empty ) )
      & ( ( A @ empty )
       => ! [B: $i] :
            ~ ( A @ ( B @ member ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).

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

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

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

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

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

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

thf(36,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)],[7]) ).

thf(3,axiom,
    ! [A: $i] :
      ( ( empty_set @ ( A @ subset ) )
     => ( A = empty_set ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_of_empty_set_is_empty_set) ).

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

thf(6,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( B @ ( A @ intersection ) @ ( C @ member ) )
    <=> ( ( B @ ( C @ member ) )
        & ( A @ ( C @ member ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).

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

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

thf(44,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)],[8]) ).

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

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

thf(5,axiom,
    ! [A: $i] :
      ~ ( empty_set @ ( A @ member ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).

thf(26,plain,
    ! [A: $i] :
      ~ ( empty_set @ ( A @ member ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

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

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

thf(92,plain,
    $false,
    inference(e,[status(thm)],[56,61,13,67,36,20,29,44,59,26,23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET596+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.08  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.16/0.41  % Computer : n020.cluster.edu
% 0.16/0.41  % Model    : x86_64 x86_64
% 0.16/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41  % Memory   : 8046.5625MB
% 0.16/0.41  % OS       : Linux 6.8.0-71-generic
% 0.16/0.41  % CPULimit : 300
% 0.16/0.41  % WCLimit  : 300
% 0.16/0.41  % DateTime : Sat Sep 26 07:59:19 UTC 2026
% 0.16/0.42  % CPUTime  : 
% 0.16/0.42  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.68/0.74  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 0.91/0.84  % [INFO] 	 Parsing done (98ms). 
% 0.91/0.85  % [INFO] 	 Running in sequential loop mode. 
% 1.46/1.05  % [INFO] 	 eprover registered as external prover. 
% 1.46/1.05  % [INFO] 	 Scanning for conjecture ... 
% 1.46/1.10  % [INFO] 	 Found a conjecture (or negated_conjecture) and 10 axioms. Running axiom selection ... 
% 1.46/1.12  % [INFO] 	 Axiom selection finished. Selected 10 axioms (removed 0 axioms). 
% 1.72/1.14  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.72/1.14  % [INFO] 	 Type checking passed. 
% 1.72/1.14  % [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.14/1.80  % External prover 'e' found a proof!
% 3.14/1.80  % [INFO] 	 Killing All external provers ... 
% 3.14/1.80  % Time passed: 1274ms (effective reasoning time: 942ms)
% 3.14/1.80  % 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.51/1.80  % Axioms used in derivation (10): reflexivity_of_subset, intersection_of_subset, equal_member_defn, subset_of_empty_set_is_empty_set, empty_set_defn, empty_defn, commutativity_of_intersection, equal_defn, subset_defn, intersection_defn
% 3.51/1.80  % No. of inferences in proof: 24
% 3.51/1.80  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1274 ms resp. 942 ms w/o parsing
% 3.51/1.83  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.51/1.83  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------