↑ 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  : SEU355+1 : TPTP v9.3.1. Released v3.3.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 : n014.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:38:33 AM UTC 2026

% Result   : Theorem 3.52s 2.62s
% Output   : Refutation 3.52s
% 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       :   97 (   4 equ;   0 cnn)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  249 (  14   ~;   2   |;  13   &; 176   @)
%                                         (   2 <=>;  42  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  11 usr;   2 con; 0-3 aty)
%            Number of variables   :   64 (   0   ^;  52   !;  12   ?;  64   :)

% Comments : 
%------------------------------------------------------------------------------
thf(rel_str_decl,type,
    rel_str: $i > $o ).

thf(element_decl,type,
    element: $i > $i > $o ).

thf(the_carrier_decl,type,
    the_carrier: $i > $i ).

thf(relstr_set_smaller_decl,type,
    relstr_set_smaller: $i > $i > $i > $o ).

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

thf(relstr_element_smaller_decl,type,
    relstr_element_smaller: $i > $i > $i > $o ).

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

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

thf(finite_decl,type,
    finite: $i > $o ).

thf(one_sorted_str_decl,type,
    one_sorted_str: $i > $o ).

thf(related_decl,type,
    related: $i > $i > $i > $o ).

thf(14,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ element ) )
     => ( ( B @ ( A @ in ) )
        | ( B @ empty ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).

thf(56,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ element ) )
     => ( ( B @ ( A @ in ) )
        | ( B @ empty ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).

thf(16,axiom,
    ! [A: $i] :
      ( ( A @ rel_str )
     => ( A @ one_sorted_str ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l1_orders_2) ).

thf(60,plain,
    ! [A: $i] :
      ( ( A @ rel_str )
     => ( A @ one_sorted_str ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).

thf(18,axiom,
    ! [A: $i] :
    ? [B: $i] : ( A @ ( B @ element ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).

thf(65,plain,
    ! [A: $i] :
    ? [B: $i] : ( A @ ( B @ element ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).

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

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

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

thf(49,plain,
    empty_set @ empty,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).

thf(9,axiom,
    ? [A: $i] : ( A @ one_sorted_str ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_l1_struct_0) ).

thf(43,plain,
    ? [A: $i] : ( A @ one_sorted_str ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(15,axiom,
    ? [A: $i] : ( A @ rel_str ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_l1_orders_2) ).

thf(58,plain,
    ? [A: $i] : ( A @ rel_str ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).

thf(7,axiom,
    ? [A: $i] :
      ( ( A @ finite )
      & ~ ( A @ empty ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_finset_1) ).

thf(37,plain,
    ? [A: $i] :
      ( ( A @ finite )
      & ~ ( A @ empty ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(3,axiom,
    ! [A: $i,B: $i] :
      ~ ( ( B @ empty )
        & ( A != B )
        & ( A @ empty ) ),
    file('/export/starexec/sandbox/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(1,conjecture,
    ! [A: $i] :
      ( ( A @ rel_str )
     => ! [B: $i] :
          ( ( A @ the_carrier @ ( B @ element ) )
         => ( ( B @ ( empty_set @ ( A @ relstr_element_smaller ) ) )
            & ( B @ ( empty_set @ ( A @ relstr_set_smaller ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_yellow_0) ).

thf(2,negated_conjecture,
    ~ ! [A: $i] :
        ( ( A @ rel_str )
       => ! [B: $i] :
            ( ( A @ the_carrier @ ( B @ element ) )
           => ( ( B @ ( empty_set @ ( A @ relstr_element_smaller ) ) )
              & ( B @ ( empty_set @ ( A @ relstr_set_smaller ) ) ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(20,plain,
    ~ ! [A: $i] :
        ( ( A @ rel_str )
       => ! [B: $i] :
            ( ( A @ the_carrier @ ( B @ element ) )
           => ( ( B @ ( empty_set @ ( A @ relstr_element_smaller ) ) )
              & ( B @ ( empty_set @ ( A @ relstr_set_smaller ) ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

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

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

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

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

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

thf(13,axiom,
    ! [A: $i] :
      ( ( A @ rel_str )
     => ! [B: $i,C: $i] :
          ( ( A @ the_carrier @ ( C @ element ) )
         => ( ( C @ ( B @ ( A @ relstr_element_smaller ) ) )
          <=> ! [D: $i] :
                ( ( A @ the_carrier @ ( D @ element ) )
               => ( ( B @ ( D @ in ) )
                 => ( D @ ( C @ ( A @ related ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_lattice3) ).

thf(50,plain,
    ! [A: $i] :
      ( ( A @ rel_str )
     => ! [B: $i,C: $i] :
          ( ( A @ the_carrier @ ( C @ element ) )
         => ( ( ! [D: $i] :
                  ( ( A @ the_carrier @ ( D @ element ) )
                 => ( ( B @ ( D @ in ) )
                   => ( D @ ( C @ ( A @ related ) ) ) ) )
             => ( C @ ( B @ ( A @ relstr_element_smaller ) ) ) )
            & ( ( C @ ( B @ ( A @ relstr_element_smaller ) ) )
             => ! [D: $i] :
                  ( ( A @ the_carrier @ ( D @ element ) )
                 => ( ( B @ ( D @ in ) )
                   => ( D @ ( C @ ( A @ related ) ) ) ) ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).

thf(19,axiom,
    ! [A: $i] :
      ( ( A @ rel_str )
     => ! [B: $i,C: $i] :
          ( ( A @ the_carrier @ ( C @ element ) )
         => ( ( C @ ( B @ ( A @ relstr_set_smaller ) ) )
          <=> ! [D: $i] :
                ( ( A @ the_carrier @ ( D @ element ) )
               => ( ( B @ ( D @ in ) )
                 => ( C @ ( D @ ( A @ related ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_lattice3) ).

thf(67,plain,
    ! [A: $i] :
      ( ( A @ rel_str )
     => ! [B: $i,C: $i] :
          ( ( A @ the_carrier @ ( C @ element ) )
         => ( ( ! [D: $i] :
                  ( ( A @ the_carrier @ ( D @ element ) )
                 => ( ( B @ ( D @ in ) )
                   => ( C @ ( D @ ( A @ related ) ) ) ) )
             => ( C @ ( B @ ( A @ relstr_set_smaller ) ) ) )
            & ( ( C @ ( B @ ( A @ relstr_set_smaller ) ) )
             => ! [D: $i] :
                  ( ( A @ the_carrier @ ( D @ element ) )
                 => ( ( B @ ( D @ in ) )
                   => ( C @ ( D @ ( A @ related ) ) ) ) ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[19]) ).

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

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

thf(11,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ in ) )
     => ( B @ ( A @ element ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_subset) ).

thf(47,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ in ) )
     => ( B @ ( A @ element ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).

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

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

thf(76,plain,
    $false,
    inference(e,[status(thm)],[56,60,65,41,49,43,58,37,25,20,29,34,45,50,67,31,47,62]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU355+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.11  % 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.10/0.45  % Computer : n014.cluster.edu
% 0.10/0.45  % Model    : x86_64 x86_64
% 0.10/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.45  % Memory   : 8046.5625MB
% 0.10/0.45  % OS       : Linux 6.8.0-71-generic
% 0.10/0.45  % CPULimit : 300
% 0.10/0.45  % WCLimit  : 300
% 0.10/0.46  % DateTime : Sat Sep 26 09:18:01 UTC 2026
% 0.10/0.46  % CPUTime  : 
% 0.10/0.46  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.88/1.21  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.06/1.36  % [INFO] 	 Parsing done (149ms). 
% 1.06/1.37  % [INFO] 	 Running in sequential loop mode. 
% 1.54/1.65  % [INFO] 	 eprover registered as external prover. 
% 1.54/1.66  % [INFO] 	 Scanning for conjecture ... 
% 1.75/1.74  % [INFO] 	 Found a conjecture (or negated_conjecture) and 21 axioms. Running axiom selection ... 
% 1.89/1.85  % [INFO] 	 Axiom selection finished. Selected 17 axioms (removed 4 axioms). 
% 1.89/1.90  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.04/1.91  % [INFO] 	 Type checking passed. 
% 2.04/1.91  % [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.52/2.61  % External prover 'e' found a proof!
% 3.52/2.62  % [INFO] 	 Killing All external provers ... 
% 3.52/2.62  % Time passed: 1904ms (effective reasoning time: 1246ms)
% 3.52/2.62  % 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.52/2.62  % Axioms used in derivation (17): t6_boole, existence_m1_subset_1, dt_l1_orders_2, existence_l1_struct_0, antisymmetry_r2_hidden, fc1_xboole_0, t1_subset, t7_boole, existence_l1_orders_2, rc1_finset_1, cc1_finset_1, t8_boole, rc1_xboole_0, t2_subset, d8_lattice3, d9_lattice3, rc2_xboole_0
% 3.52/2.62  % No. of inferences in proof: 38
% 3.52/2.62  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1904 ms resp. 1246 ms w/o parsing
% 3.52/2.70  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.52/2.70  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------