↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SET629+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n007.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:43:39 PM UTC 2026

% Result   : Theorem 4.57s 1.17s
% Output   : Proof 4.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   28 (  11 unt;   0 def)
%            Number of atoms       :   76 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   82 (  34   ~;  27   |;  17   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   52 (   2 sgn  36   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [B,C] :
      ( intersect(B,C)
    <=> ? [D] :
          ( member(D,C)
          & member(D,B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).

fof(f2_nnf,plain,
    ! [B,C] :
      ( ( ! [D] :
            ( ~ member(D,C)
            | ~ member(D,B) )
        | intersect(B,C) )
      & ( ? [D] :
            ( member(D,C)
            & member(D,B) )
        | ~ intersect(B,C) ) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [B,C,D] :
      ( ( ~ member(D,C)
        | ~ member(D,B)
        | intersect(B,C) )
      & ( ( member(sk0(B,C),C)
          & member(sk0(B,C),B) )
        | ~ intersect(B,C) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f2_nnf]) ).

cnf(c7,plain,
    ( member(sk0(X0,X1),X1)
    | ~ intersect(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

fof(f7,conjecture,
    ! [B,C] : disjoint(intersection(B,C),difference(B,C)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_intersection_and_difference_disjoint) ).

fof(f7_neg,negated_conjecture,
    ~ ! [B,C] : disjoint(intersection(B,C),difference(B,C)),
    inference(negated_conjecture,[status(cth)],[f7]) ).

fof(f7_nnf,plain,
    ? [B,C] : ~ disjoint(intersection(B,C),difference(B,C)),
    inference(nnf_transformation,[status(thm)],[f7_neg]) ).

fof(f7_sk,plain,
    ~ disjoint(intersection(sk2,sk3),difference(sk2,sk3)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk2,sk3])],[f7_nnf]) ).

cnf(c19,plain,
    ~ disjoint(intersection(sk2,sk3),difference(sk2,sk3)),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

fof(f3,axiom,
    ! [B,C] :
      ( disjoint(B,C)
    <=> ~ intersect(B,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn) ).

fof(f3_nnf,plain,
    ! [B,C] :
      ( ( intersect(B,C)
        | disjoint(B,C) )
      & ( ~ intersect(B,C)
        | ~ disjoint(B,C) ) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [B,C] :
      ( ( intersect(B,C)
        | disjoint(B,C) )
      & ( ~ intersect(B,C)
        | ~ disjoint(B,C) ) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c10,plain,
    ( intersect(X0,X1)
    | disjoint(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(p20,plain,
    intersect(intersection(sk2,sk3),difference(sk2,sk3)),
    inference(resolution,[status(thm)],[c19,c10]) ).

cnf(p39,plain,
    member(sk0(intersection(sk2,sk3),difference(sk2,sk3)),difference(sk2,sk3)),
    inference(resolution,[status(thm)],[c7,p20]) ).

fof(f1,axiom,
    ! [B,C,D] :
      ( member(D,difference(B,C))
    <=> ( ~ member(D,C)
        & member(D,B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).

fof(f1_nnf,plain,
    ! [B,C,D] :
      ( ( member(D,C)
        | ~ member(D,B)
        | member(D,difference(B,C)) )
      & ( ( ~ member(D,C)
          & member(D,B) )
        | ~ member(D,difference(B,C)) ) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [D,B,C] :
      ( ( member(D,C)
        | ~ member(D,B)
        | member(D,difference(B,C)) )
      & ( ( ~ member(D,C)
          & member(D,B) )
        | ~ member(D,difference(B,C)) ) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c4,plain,
    ( ~ member(X2,X1)
    | ~ member(X2,difference(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p42,plain,
    ~ member(sk0(intersection(sk2,sk3),difference(sk2,sk3)),sk3),
    inference(resolution,[status(thm)],[p39,c4]) ).

cnf(c6,plain,
    ( member(sk0(X0,X1),X0)
    | ~ intersect(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p23,plain,
    member(sk0(intersection(sk2,sk3),difference(sk2,sk3)),intersection(sk2,sk3)),
    inference(resolution,[status(thm)],[c6,p20]) ).

fof(f0,axiom,
    ! [B,C,D] :
      ( member(D,intersection(B,C))
    <=> ( member(D,C)
        & member(D,B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).

fof(f0_nnf,plain,
    ! [B,C,D] :
      ( ( ~ member(D,C)
        | ~ member(D,B)
        | member(D,intersection(B,C)) )
      & ( ( member(D,C)
          & member(D,B) )
        | ~ member(D,intersection(B,C)) ) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [D,B,C] :
      ( ( ~ member(D,C)
        | ~ member(D,B)
        | member(D,intersection(B,C)) )
      & ( ( member(D,C)
          & member(D,B) )
        | ~ member(D,intersection(B,C)) ) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c1,plain,
    ( member(X2,X1)
    | ~ member(X2,intersection(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p26,plain,
    member(sk0(intersection(sk2,sk3),difference(sk2,sk3)),sk3),
    inference(resolution,[status(thm)],[p23,c1]) ).

cnf(p44,plain,
    $false,
    inference(resolution,[status(thm)],[p42,p26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET629+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.37  % Computer : n007.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Thu Sep 24 11:28:23 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.57/1.17  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.57/1.17  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------