↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SEU123+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% 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 : Fri Sep 25 02:51:00 PM UTC 2026

% Result   : Theorem 7.51s 1.53s
% Output   : Proof 7.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   48 (  20 unt;   0 def)
%            Number of atoms       :  109 (  26 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  123 (  62   ~;  32   |;  24   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-4 aty)
%            Number of variables   :   73 (   5 sgn  47   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [A,B] :
      ( A = B
    <=> ( subset(B,A)
        & subset(A,B) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).

fof(f2_nnf,plain,
    ! [A,B] :
      ( ( ~ subset(B,A)
        | ~ subset(A,B)
        | A = B )
      & ( ( subset(B,A)
          & subset(A,B) )
        | A != B ) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [A,B] :
      ( ( ~ subset(B,A)
        | ~ subset(A,B)
        | A = B )
      & ( ( subset(B,A)
          & subset(A,B) )
        | A != B ) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c4,plain,
    ( ~ subset(X1,X0)
    | ~ subset(X0,X1)
    | X0 = X1 ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi3,axiom,
    ifeq(subset(X0,X1),true,ifeq(subset(X1,X0),true,X0,X1),X1) = X1,
    inference(equality_encoding,[status(esa)],[c4]) ).

fof(f16,lemma,
    ! [A] : subset(empty_set,A),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).

fof(f16_nnf,plain,
    ! [A] : subset(empty_set,A),
    inference(nnf_transformation,[status(thm)],[f16]) ).

fof(f16_sk,plain,
    ! [A] : subset(empty_set,A),
    inference(skolemisation,[status(esa)],[f16_nnf]) ).

cnf(c30,plain,
    subset(empty_set,X0),
    inference(cnf_transformation,[status(esa)],[f16_sk]) ).

cnf(hi22,axiom,
    subset(empty_set,X0) = true,
    inference(equality_encoding,[status(esa)],[c30]) ).

fof(f18,conjecture,
    ! [A] :
      ( subset(A,empty_set)
     => A = empty_set ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_1) ).

fof(f18_neg,negated_conjecture,
    ~ ! [A] :
        ( subset(A,empty_set)
       => A = empty_set ),
    inference(negated_conjecture,[status(cth)],[f18]) ).

fof(f18_nnf,plain,
    ? [A] :
      ( A != empty_set
      & subset(A,empty_set) ),
    inference(nnf_transformation,[status(thm)],[f18_neg]) ).

fof(f18_sk,plain,
    ( sk6 != empty_set
    & subset(sk6,empty_set) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk6])],[f18_nnf]) ).

cnf(c34,plain,
    subset(sk6,empty_set),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(hi25,negated_conjecture,
    subset(sk6,empty_set) = true,
    inference(equality_encoding,[status(esa)],[c34]) ).

cnf(h20,plain,
    empty_set = sk6,
    inference(hyper_resolution,[status(thm)],[hi3,hi22,hi25]) ).

cnf(c35,plain,
    sk6 != empty_set,
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(hi33,negated_conjecture,
    ifeq(sk6,empty_set,false,true) = true,
    inference(equality_encoding,[status(esa)],[c35]) ).

cnf(t2,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi33,h20]) ).

cnf(t293,plain,
    false = true,
    inference(orient,[status(thm)],[t2]) ).

fof(f0,axiom,
    ! [A,B] :
      ( in(A,B)
     => ~ in(B,A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).

fof(f0_nnf,plain,
    ! [A,B] :
      ( ~ in(B,A)
      | ~ in(A,B) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [A,B] :
      ( ~ in(B,A)
      | ~ in(A,B) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( ~ in(X1,X0)
    | ~ in(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

fof(f3,axiom,
    ! [A] :
      ( A = empty_set
    <=> ! [B] : ~ in(B,A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).

fof(f3_nnf,plain,
    ! [A] :
      ( ( ? [B] : in(B,A)
        | A = empty_set )
      & ( ! [B] : ~ in(B,A)
        | A != empty_set ) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [A,B] :
      ( ( in(sk0(A),A)
        | A = empty_set )
      & ( ~ in(B,A)
        | A != empty_set ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f3_nnf]) ).

cnf(c5,plain,
    ( ~ in(X1,X0)
    | X0 != empty_set ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

fof(f12,axiom,
    ? [A] : ~ empty(A),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).

fof(f12_nnf,plain,
    ? [A] : ~ empty(A),
    inference(nnf_transformation,[status(thm)],[f12]) ).

fof(f12_sk,plain,
    ~ empty(sk4),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk4])],[f12_nnf]) ).

cnf(c26,plain,
    ~ empty(sk4),
    inference(cnf_transformation,[status(esa)],[f12_sk]) ).

fof(f17,lemma,
    ! [A,B] :
      ( ~ ( disjoint(A,B)
          & ? [C] :
              ( in(C,B)
              & in(C,A) ) )
      & ~ ( ! [C] :
              ~ ( in(C,B)
                & in(C,A) )
          & ~ disjoint(A,B) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_0) ).

fof(f17_nnf,plain,
    ! [A,B] :
      ( ( ~ disjoint(A,B)
        | ! [C] :
            ( ~ in(C,B)
            | ~ in(C,A) ) )
      & ( ? [C] :
            ( in(C,B)
            & in(C,A) )
        | disjoint(A,B) ) ),
    inference(nnf_transformation,[status(thm)],[f17]) ).

fof(f17_sk,plain,
    ! [A,B,C] :
      ( ( ~ disjoint(A,B)
        | ~ in(C,B)
        | ~ in(C,A) )
      & ( ( in(sk5(A,B),B)
          & in(sk5(A,B),A) )
        | disjoint(A,B) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk5])],[f17_nnf]) ).

cnf(c33,plain,
    ( ~ disjoint(X0,X1)
    | ~ in(X2,X1)
    | ~ in(X2,X0) ),
    inference(cnf_transformation,[status(esa)],[f17_sk]) ).

fof(f19,lemma,
    ! [A,B] :
      ( ~ ( disjoint(A,B)
          & ? [C] : in(C,set_intersection2(A,B)) )
      & ~ ( ! [C] : ~ in(C,set_intersection2(A,B))
          & ~ disjoint(A,B) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).

fof(f19_nnf,plain,
    ! [A,B] :
      ( ( ~ disjoint(A,B)
        | ! [C] : ~ in(C,set_intersection2(A,B)) )
      & ( ? [C] : in(C,set_intersection2(A,B))
        | disjoint(A,B) ) ),
    inference(nnf_transformation,[status(thm)],[f19]) ).

fof(f19_sk,plain,
    ! [A,B,C] :
      ( ( ~ disjoint(A,B)
        | ~ in(C,set_intersection2(A,B)) )
      & ( in(sk7(A,B),set_intersection2(A,B))
        | disjoint(A,B) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk7])],[f19_nnf]) ).

cnf(c37,plain,
    ( ~ disjoint(X0,X1)
    | ~ in(X2,set_intersection2(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f19_sk]) ).

fof(f21,axiom,
    ! [A,B] :
      ~ ( empty(B)
        & in(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).

fof(f21_nnf,plain,
    ! [A,B] :
      ( ~ empty(B)
      | ~ in(A,B) ),
    inference(nnf_transformation,[status(thm)],[f21]) ).

fof(f21_sk,plain,
    ! [A,B] :
      ( ~ empty(B)
      | ~ in(A,B) ),
    inference(skolemisation,[status(esa)],[f21_nnf]) ).

cnf(c39,plain,
    ( ~ empty(X1)
    | ~ in(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f21_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c0,c5,c26,c33,c35,c37,c39]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t293]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU123+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/0.37  % Computer : n016.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Thu Sep 24 12:53:42 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.51/1.53  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.51/1.53  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------