↑ 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  : SEU121+2 : TPTP v9.3.1. Released v3.3.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 : n012.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:37:38 AM UTC 2026

% Result   : Theorem 3.01s 1.93s
% Output   : Refutation 3.01s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   38 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :  103 (  17 equ;   0 cnn)
%            Maximal formula atoms :   14 (   2 avg)
%            Number of connectives :  284 (  31   ~;   0   |;  36   &; 188   @)
%                                         (   5 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   82 (   0   ^;  74   !;   8   ?;  82   :)

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

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

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

thf(set_intersection2_decl,type,
    set_intersection2: $i > $i > $i ).

thf(disjoint_decl,type,
    disjoint: $i > $i > $o ).

thf(in_decl,type,
    in: $i > $i > $o ).

thf(3,axiom,
    ! [A: $i,B: $i] :
      ~ ( ( B @ empty )
        & ( A != B )
        & ( A @ empty ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_boole) ).

thf(25,plain,
    ! [A: $i,B: $i] :
      ~ ( ( B @ empty )
        & ( A != B )
        & ( A @ empty ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(8,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ disjoint ) )
     => ( A @ ( B @ disjoint ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).

thf(38,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ disjoint ) )
     => ( A @ ( B @ disjoint ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(15,axiom,
    ! [A: $i] :
      ( ( A = empty_set )
    <=> ! [B: $i] :
          ~ ( A @ ( B @ in ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).

thf(65,plain,
    ! [A: $i] :
      ( ( ! [B: $i] :
            ~ ( A @ ( B @ in ) )
       => ( A = empty_set ) )
      & ( ( A = empty_set )
       => ! [B: $i] :
            ~ ( A @ ( B @ in ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).

thf(6,axiom,
    empty_set @ empty,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).

thf(34,plain,
    empty_set @ empty,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(12,axiom,
    ! [A: $i,B: $i] :
      ~ ( ( B @ empty )
        & ( B @ ( A @ in ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).

thf(54,plain,
    ! [A: $i,B: $i] :
      ~ ( ( B @ empty )
        & ( B @ ( A @ in ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).

thf(17,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( C
        = ( B @ ( A @ set_intersection2 ) ) )
    <=> ! [D: $i] :
          ( ( C @ ( D @ in ) )
        <=> ( ( B @ ( D @ in ) )
            & ( A @ ( D @ in ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).

thf(81,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( ! [D: $i] :
            ( ( ( ( B @ ( D @ in ) )
                & ( A @ ( D @ in ) ) )
             => ( C @ ( D @ in ) ) )
            & ( ( C @ ( D @ in ) )
             => ( ( B @ ( D @ in ) )
                & ( A @ ( D @ in ) ) ) ) )
       => ( C
          = ( B @ ( A @ set_intersection2 ) ) ) )
      & ( ( C
          = ( B @ ( A @ set_intersection2 ) ) )
       => ! [D: $i] :
            ( ( ( ( B @ ( D @ in ) )
                & ( A @ ( D @ in ) ) )
             => ( C @ ( D @ in ) ) )
            & ( ( C @ ( D @ in ) )
             => ( ( B @ ( D @ in ) )
                & ( A @ ( D @ in ) ) ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).

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

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

thf(7,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ set_intersection2 ) )
      = ( A @ ( B @ set_intersection2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).

thf(35,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ set_intersection2 ) )
      = ( A @ ( B @ set_intersection2 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(14,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ in ) )
     => ~ ( A @ ( B @ in ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).

thf(63,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ in ) )
     => ~ ( A @ ( B @ in ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).

thf(5,axiom,
    ? [A: $i] :
      ~ ( A @ empty ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_xboole_0) ).

thf(31,plain,
    ? [A: $i] :
      ~ ( A @ empty ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(10,axiom,
    ! [A: $i] :
      ( ( A @ empty )
     => ( A = empty_set ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).

thf(43,plain,
    ! [A: $i] :
      ( ( A @ empty )
     => ( A = empty_set ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).

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

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

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

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

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

thf(11,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ disjoint ) )
    <=> ( ( B @ ( A @ set_intersection2 ) )
        = empty_set ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).

thf(46,plain,
    ! [A: $i,B: $i] :
      ( ( ( ( B @ ( A @ set_intersection2 ) )
          = empty_set )
       => ( B @ ( A @ disjoint ) ) )
      & ( ( B @ ( A @ disjoint ) )
       => ( ( B @ ( A @ set_intersection2 ) )
          = empty_set ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).

thf(13,axiom,
    ! [A: $i,B: $i] :
      ( ~ ( ( B @ ( A @ disjoint ) )
          & ? [C: $i] : ( B @ ( A @ set_intersection2 ) @ ( C @ in ) ) )
      & ~ ( ! [C: $i] :
              ~ ( B @ ( A @ set_intersection2 ) @ ( C @ in ) )
          & ~ ( B @ ( A @ disjoint ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).

thf(57,plain,
    ! [A: $i,B: $i] :
      ( ~ ( ( B @ ( A @ disjoint ) )
          & ? [C: $i] : ( B @ ( A @ set_intersection2 ) @ ( C @ in ) ) )
      & ~ ( ! [C: $i] :
              ~ ( B @ ( A @ set_intersection2 ) @ ( C @ in ) )
          & ~ ( B @ ( A @ disjoint ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).

thf(4,axiom,
    ? [A: $i] : ( A @ empty ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc1_xboole_0) ).

thf(29,plain,
    ? [A: $i] : ( A @ empty ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

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

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

thf(16,axiom,
    ! [A: $i,B: $i] :
      ( ~ ( ( B @ ( A @ disjoint ) )
          & ? [C: $i] :
              ( ( B @ ( C @ in ) )
              & ( A @ ( C @ in ) ) ) )
      & ~ ( ! [C: $i] :
              ~ ( ( B @ ( C @ in ) )
                & ( A @ ( C @ in ) ) )
          & ~ ( B @ ( A @ disjoint ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_0) ).

thf(74,plain,
    ! [A: $i,B: $i] :
      ( ~ ( ( B @ ( A @ disjoint ) )
          & ? [C: $i] :
              ( ( B @ ( C @ in ) )
              & ( A @ ( C @ in ) ) ) )
      & ~ ( ! [C: $i] :
              ~ ( ( B @ ( C @ in ) )
                & ( A @ ( C @ in ) ) )
          & ~ ( B @ ( A @ disjoint ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).

thf(124,plain,
    $false,
    inference(e,[status(thm)],[25,38,65,34,54,81,108,35,63,31,43,40,20,46,57,29,116,74]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SEU121+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % 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.05/0.31  % Computer : n012.cluster.edu
% 0.05/0.31  % Model    : x86_64 x86_64
% 0.05/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.31  % Memory   : 8046.5625MB
% 0.05/0.31  % OS       : Linux 6.8.0-71-generic
% 0.05/0.31  % CPULimit : 300
% 0.05/0.31  % WCLimit  : 300
% 0.05/0.31  % DateTime : Sat Sep 26 08:37:20 UTC 2026
% 0.05/0.32  % CPUTime  : 
% 0.05/0.32  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.79/0.80  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 0.96/0.97  % [INFO] 	 Parsing done (164ms). 
% 0.96/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.69/1.32  % [INFO] 	 eprover registered as external prover. 
% 1.69/1.33  % [INFO] 	 Scanning for conjecture ... 
% 1.89/1.41  % [INFO] 	 Found a conjecture (or negated_conjecture) and 19 axioms. Running axiom selection ... 
% 1.89/1.46  % [INFO] 	 Axiom selection finished. Selected 17 axioms (removed 2 axioms). 
% 1.89/1.50  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.09/1.50  % [INFO] 	 Type checking passed. 
% 2.09/1.51  % [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.01/1.93  % External prover 'e' found a proof!
% 3.01/1.93  % [INFO] 	 Killing All external provers ... 
% 3.01/1.93  % Time passed: 1485ms (effective reasoning time: 943ms)
% 3.01/1.93  % 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.01/1.93  % Axioms used in derivation (17): idempotence_k3_xboole_0, fc1_xboole_0, commutativity_k3_xboole_0, d1_xboole_0, t6_boole, t4_xboole_0, t7_boole, d7_xboole_0, symmetry_r1_xboole_0, t3_xboole_0, rc2_xboole_0, d3_tarski, reflexivity_r1_tarski, t8_boole, rc1_xboole_0, d3_xboole_0, antisymmetry_r2_hidden
% 3.01/1.93  % No. of inferences in proof: 38
% 3.01/1.93  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1485 ms resp. 943 ms w/o parsing
% 3.01/1.96  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.01/1.96  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------