↑ 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  : SET920+1 : TPTP v9.3.1. Released v3.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 : n001.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:31:20 AM UTC 2026

% Result   : Theorem 4.13s 2.13s
% Output   : Refutation 4.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   20 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   57 (  25 equ;   0 cnn)
%            Maximal formula atoms :   14 (   2 avg)
%            Number of connectives :  151 (   6   ~;   5   |;  11   &; 108   @)
%                                         (   4 <=>;  17  =>;   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     :    6 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   46 (   0   ^;  42   !;   4   ?;  46   :)

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

thf(unordered_pair_decl,type,
    unordered_pair: $i > $i > $i ).

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

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

thf(6,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( C
        = ( B @ ( A @ unordered_pair ) ) )
    <=> ! [D: $i] :
          ( ( C @ ( D @ in ) )
        <=> ( ( D = B )
            | ( D = A ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).

thf(24,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( ! [D: $i] :
            ( ( ( ( D = B )
                | ( D = A ) )
             => ( C @ ( D @ in ) ) )
            & ( ( C @ ( D @ in ) )
             => ( ( D = B )
                | ( D = A ) ) ) )
       => ( C
          = ( B @ ( A @ unordered_pair ) ) ) )
      & ( ( C
          = ( B @ ( A @ unordered_pair ) ) )
       => ! [D: $i] :
            ( ( ( ( D = B )
                | ( D = A ) )
             => ( C @ ( D @ in ) ) )
            & ( ( C @ ( D @ in ) )
             => ( ( D = B )
                | ( D = A ) ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

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

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

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

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

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

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

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

thf(18,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ unordered_pair ) )
      = ( A @ ( B @ unordered_pair ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

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

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

thf(1,conjecture,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( C @ ( B @ ( A @ unordered_pair ) @ set_intersection2 ) )
        = ( B @ ( A @ unordered_pair ) ) )
     => ( C @ ( A @ in ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t63_zfmisc_1) ).

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

thf(11,plain,
    ~ ! [A: $i,B: $i,C: $i] :
        ( ( ( C @ ( B @ ( A @ unordered_pair ) @ set_intersection2 ) )
          = ( B @ ( A @ unordered_pair ) ) )
       => ( C @ ( A @ in ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(7,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/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).

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

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

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

thf(92,plain,
    $false,
    inference(e,[status(thm)],[24,78,21,81,18,16,11,51,83]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET920+1 : TPTP v9.3.1. Released v3.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 : n001.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:31:28 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.69/0.76  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 0.92/0.89  % [INFO] 	 Parsing done (125ms). 
% 1.15/0.90  % [INFO] 	 Running in sequential loop mode. 
% 1.43/1.15  % [INFO] 	 eprover registered as external prover. 
% 1.70/1.15  % [INFO] 	 Scanning for conjecture ... 
% 1.81/1.23  % [INFO] 	 Found a conjecture (or negated_conjecture) and 8 axioms. Running axiom selection ... 
% 1.81/1.26  % [INFO] 	 Axiom selection finished. Selected 8 axioms (removed 0 axioms). 
% 1.81/1.28  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.81/1.28  % [INFO] 	 Type checking passed. 
% 1.81/1.29  % [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 ... 
% 4.13/2.12  % External prover 'e' found a proof!
% 4.13/2.12  % [INFO] 	 Killing All external provers ... 
% 4.13/2.13  % Time passed: 1629ms (effective reasoning time: 1219ms)
% 4.13/2.13  % 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)>
% 4.13/2.13  % Axioms used in derivation (8): idempotence_k3_xboole_0, commutativity_k3_xboole_0, d2_tarski, commutativity_k2_tarski, rc1_xboole_0, rc2_xboole_0, d3_xboole_0, antisymmetry_r2_hidden
% 4.13/2.13  % No. of inferences in proof: 20
% 4.13/2.13  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1629 ms resp. 1219 ms w/o parsing
% 4.55/2.15  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.55/2.15  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------