↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SET199-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

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

% Result   : Unsatisfiable 29.19s 4.91s
% Output   : Proof 29.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   36 (  12 unt;   0 def)
%            Number of atoms       :   70 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   61 (  27   ~;  34   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   48 (   0 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f22,axiom,
    ( member(Z,intersection(X,Y))
    | ~ member(Z,Y)
    | ~ member(Z,X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection3) ).

fof(f22_nnf,plain,
    ! [Z,X,Y] :
      ( member(Z,intersection(X,Y))
      | ~ member(Z,Y)
      | ~ member(Z,X) ),
    inference(nnf_transformation,[status(thm)],[f22]) ).

fof(f22_sk,plain,
    ! [Z,X,Y] :
      ( member(Z,intersection(X,Y))
      | ~ member(Z,Y)
      | ~ member(Z,X) ),
    inference(skolemisation,[status(esa)],[f22_nnf]) ).

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

cnf(f1,axiom,
    ( subclass(X,Y)
    | member(not_subclass_element(X,Y),X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_subclass_members1) ).

fof(f1_nnf,plain,
    ! [X,Y] :
      ( subclass(X,Y)
      | member(not_subclass_element(X,Y),X) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X,Y] :
      ( subclass(X,Y)
      | member(not_subclass_element(X,Y),X) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ( subclass(X0,X1)
    | member(not_subclass_element(X0,X1),X0) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(f0,axiom,
    ( member(U,Y)
    | ~ member(U,X)
    | ~ subclass(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subclass_members) ).

fof(f0_nnf,plain,
    ! [X,Y,U] :
      ( member(U,Y)
      | ~ member(U,X)
      | ~ subclass(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X,Y,U] :
      ( member(U,Y)
      | ~ member(U,X)
      | ~ subclass(X,Y) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

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

cnf(f112,negated_conjecture,
    subclass(z,x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_greatest_lower_bound_1) ).

fof(f112_nnf,plain,
    subclass(z,x),
    inference(nnf_transformation,[status(thm)],[f112]) ).

cnf(c112,plain,
    subclass(z,x),
    inference(cnf_transformation,[status(esa)],[f112_nnf]) ).

cnf(p116,plain,
    ( member(X0,x)
    | ~ member(X0,z) ),
    inference(resolution,[status(thm)],[c0,c112]) ).

cnf(p118,plain,
    ( member(not_subclass_element(z,X0),x)
    | subclass(z,X0) ),
    inference(resolution,[status(thm)],[c1,p116]) ).

cnf(p303,plain,
    ( subclass(z,X0)
    | member(not_subclass_element(z,X0),intersection(x,X1))
    | ~ member(not_subclass_element(z,X0),X1) ),
    inference(resolution,[status(thm)],[c22,p118]) ).

cnf(f113,negated_conjecture,
    subclass(z,y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_greatest_lower_bound_2) ).

fof(f113_nnf,plain,
    subclass(z,y),
    inference(nnf_transformation,[status(thm)],[f113]) ).

cnf(c113,plain,
    subclass(z,y),
    inference(cnf_transformation,[status(esa)],[f113_nnf]) ).

cnf(p117,plain,
    ( member(X0,y)
    | ~ member(X0,z) ),
    inference(resolution,[status(thm)],[c113,c0]) ).

cnf(p119,plain,
    ( member(not_subclass_element(z,X0),y)
    | subclass(z,X0) ),
    inference(resolution,[status(thm)],[c1,p117]) ).

cnf(p392,plain,
    ( subclass(z,X0)
    | subclass(z,X0)
    | member(not_subclass_element(z,X0),intersection(x,y)) ),
    inference(resolution,[status(thm)],[p303,p119]) ).

cnf(p428,plain,
    ( subclass(z,X0)
    | member(not_subclass_element(z,X0),intersection(x,y)) ),
    inference(factoring,[status(thm)],[p392]) ).

cnf(f2,axiom,
    ( subclass(X,Y)
    | ~ member(not_subclass_element(X,Y),Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_subclass_members2) ).

fof(f2_nnf,plain,
    ! [X,Y] :
      ( subclass(X,Y)
      | ~ member(not_subclass_element(X,Y),Y) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X,Y] :
      ( subclass(X,Y)
      | ~ member(not_subclass_element(X,Y),Y) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ( subclass(X0,X1)
    | ~ member(not_subclass_element(X0,X1),X1) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p429,plain,
    ( subclass(z,intersection(x,y))
    | subclass(z,intersection(x,y)) ),
    inference(resolution,[status(thm)],[p428,c2]) ).

cnf(p435,plain,
    subclass(z,intersection(x,y)),
    inference(factoring,[status(thm)],[p429]) ).

cnf(f114,negated_conjecture,
    ~ subclass(z,intersection(x,y)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_greatest_lower_bound_3) ).

fof(f114_nnf,plain,
    ~ subclass(z,intersection(x,y)),
    inference(nnf_transformation,[status(thm)],[f114]) ).

fof(f114_sk,plain,
    ~ subclass(z,intersection(x,y)),
    inference(skolemisation,[status(esa)],[f114_nnf]) ).

cnf(c114,plain,
    ~ subclass(z,intersection(x,y)),
    inference(cnf_transformation,[status(esa)],[f114_sk]) ).

cnf(p437,plain,
    $false,
    inference(resolution,[status(thm)],[p435,c114]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET199-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.35  % Computer : n014.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Thu Sep 24 10:13:48 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 29.19/4.91  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 29.19/4.91  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------