↑ 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  : SET617+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 : n016.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:30 AM UTC 2026

% Result   : Theorem 3.40s 1.80s
% Output   : Refutation 3.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   28 (  17 unt;   0 typ;   0 def)
%            Number of atoms       :   60 (  24 equ;   0 cnn)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  162 (   7   ~;   0   |;  12   &; 123   @)
%                                         (   5 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   48 (   0   ^;  48   !;   0   ?;  48   :)

% Comments : 
%------------------------------------------------------------------------------
thf(symmetric_difference_decl,type,
    symmetric_difference: $i > $i > $i ).

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

thf(union_decl,type,
    union: $i > $i > $i ).

thf(difference_decl,type,
    difference: $i > $i > $i ).

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

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

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

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

thf(25,plain,
    ! [A: $i] :
      ( ( empty_set @ ( A @ difference ) )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

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

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

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

thf(6,axiom,
    ! [A: $i] :
      ( ( A @ ( empty_set @ difference ) )
      = empty_set ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_difference_with_empty_set2) ).

thf(28,plain,
    ! [A: $i] :
      ( ( A @ ( empty_set @ difference ) )
      = empty_set ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

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

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(34,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(4,axiom,
    ! [A: $i] :
      ( ( empty_set @ ( A @ union ) )
      = A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_empty_set) ).

thf(22,plain,
    ! [A: $i] :
      ( ( empty_set @ ( A @ union ) )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

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

thf(49,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ symmetric_difference ) )
      = ( A @ ( B @ symmetric_difference ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).

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

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

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

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

thf(3,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ symmetric_difference ) )
      = ( A @ ( B @ difference ) @ ( B @ ( A @ difference ) @ union ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetric_difference_defn) ).

thf(19,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ symmetric_difference ) )
      = ( A @ ( B @ difference ) @ ( B @ ( A @ difference ) @ union ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(1,conjecture,
    ! [A: $i] :
      ( ( ( A @ ( empty_set @ symmetric_difference ) )
        = A )
      & ( ( empty_set @ ( A @ symmetric_difference ) )
        = A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th92) ).

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

thf(15,plain,
    ~ ! [A: $i] :
        ( ( ( A @ ( empty_set @ symmetric_difference ) )
          = A )
        & ( ( empty_set @ ( A @ symmetric_difference ) )
          = A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

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

thf(89,plain,
    $false,
    inference(e,[status(thm)],[25,52,46,28,73,34,22,49,81,31,19,15,83]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET617+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.14/0.40  % Computer : n016.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 08:05:30 UTC 2026
% 0.14/0.40  % CPUTime  : 
% 0.14/0.40  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.72/0.71  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 0.95/0.81  % [INFO] 	 Parsing done (99ms). 
% 0.95/0.81  % [INFO] 	 Running in sequential loop mode. 
% 1.19/1.01  % [INFO] 	 eprover registered as external prover. 
% 1.19/1.01  % [INFO] 	 Scanning for conjecture ... 
% 1.53/1.06  % [INFO] 	 Found a conjecture (or negated_conjecture) and 12 axioms. Running axiom selection ... 
% 1.53/1.08  % [INFO] 	 Axiom selection finished. Selected 12 axioms (removed 0 axioms). 
% 1.53/1.10  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.53/1.10  % [INFO] 	 Type checking passed. 
% 1.53/1.10  % [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.40/1.80  % External prover 'e' found a proof!
% 3.40/1.80  % [INFO] 	 Killing All external provers ... 
% 3.40/1.80  % Time passed: 1312ms (effective reasoning time: 980ms)
% 3.40/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.40/1.80  % Axioms used in derivation (12): reflexivity_of_subset, equal_member_defn, empty_set_defn, empty_defn, symmetric_difference_defn, commutativity_of_union, no_difference_with_empty_set1, equal_defn, union_empty_set, commutativity_of_symmetric_difference, subset_defn, no_difference_with_empty_set2
% 3.40/1.80  % No. of inferences in proof: 28
% 3.40/1.80  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1312 ms resp. 980 ms w/o parsing
% 3.40/1.83  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.40/1.83  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------