↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SET060-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:41:46 PM UTC 2026

% Result   : Unsatisfiable 4.61s 1.28s
% Output   : Proof 4.61s
% Verified : 

% Comments : 
%------------------------------------------------------------------------------
cnf(t91,axiom,
    sF2 = member(y,intersection(complement(x),x)),
    introduced(definition) ).

cnf(t89,axiom,
    sF0 = complement(x),
    introduced(definition) ).

cnf(t96,plain,
    complement(x) = sF0,
    inference(orient,[status(thm)],[t89]) ).

cnf(t327,plain,
    sF2 = member(y,intersection(sF0,x)),
    inference(step,[status(thm)],[t91,t96]) ).

cnf(t90,axiom,
    sF1 = intersection(complement(x),x),
    introduced(definition) ).

cnf(t324,plain,
    sF1 = intersection(sF0,x),
    inference(step,[status(thm)],[t90,t96]) ).

cnf(t104,plain,
    intersection(sF0,x) = sF1,
    inference(orient,[status(thm)],[t324]) ).

cnf(t328,plain,
    sF2 = member(y,sF1),
    inference(step,[status(thm)],[t327,t104]) ).

cnf(f91,negated_conjecture,
    member(y,intersection(complement(x),x)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_special_classes_lemma_1) ).

fof(f91_nnf,plain,
    member(y,intersection(complement(x),x)),
    inference(nnf_transformation,[status(thm)],[f91]) ).

cnf(c91,plain,
    member(y,intersection(complement(x),x)),
    inference(cnf_transformation,[status(esa)],[f91_nnf]) ).

cnf(t16,plain,
    member(y,intersection(complement(x),x)) = true,
    inference(equality_encoding,[status(esa)],[c91]) ).

cnf(t325,plain,
    member(y,intersection(sF0,x)) = true,
    inference(step,[status(thm)],[t16,t96]) ).

cnf(t326,plain,
    member(y,sF1) = true,
    inference(step,[status(thm)],[t325,t104]) ).

cnf(t112,plain,
    member(y,sF1) = true,
    inference(orient,[status(thm)],[t326]) ).

cnf(t329,plain,
    sF2 = true,
    inference(step,[status(thm)],[t328,t112]) ).

cnf(t113,plain,
    true = sF2,
    inference(orient,[status(thm)],[t329]) ).

cnf(f21,axiom,
    ( member(Z,Y)
    | ~ member(Z,intersection(X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection2) ).

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

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

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

cnf(t39,plain,
    ifeq(member(X1,intersection(X2,X3)),true,member(X1,X3),true) = true,
    inference(equality_encoding,[status(esa)],[c21]) ).

cnf(t412,plain,
    ifeq(member(X1,intersection(X2,X3)),sF2,member(X1,X3),true) = true,
    inference(step,[status(thm)],[t39,t113]) ).

cnf(t413,plain,
    ifeq(member(X1,intersection(X2,X3)),sF2,member(X1,X3),sF2) = true,
    inference(step,[status(thm)],[t412,t113]) ).

cnf(t414,plain,
    ifeq(member(X1,intersection(X2,X3)),sF2,member(X1,X3),sF2) = sF2,
    inference(step,[status(thm)],[t413,t113]) ).

cnf(t252,plain,
    ifeq(member(X1,intersection(X2,X3)),sF2,member(X1,X3),sF2) = sF2,
    inference(orient,[status(thm)],[t414]) ).

cnf(t254,plain,
    sF2 = ifeq(member(X1,sF1),sF2,member(X1,x),sF2),
    inference(cp,[status(thm)],[t252,t104]) ).

cnf(t299,plain,
    ifeq(member(X1,sF1),sF2,member(X1,x),sF2) = sF2,
    inference(orient,[status(thm)],[t254]) ).

cnf(t352,plain,
    member(y,sF1) = sF2,
    inference(step,[status(thm)],[t112,t113]) ).

cnf(t137,plain,
    member(y,sF1) = sF2,
    inference(orient,[status(thm)],[t352]) ).

cnf(t300,plain,
    sF2 = ifeq(sF2,sF2,member(y,x),sF2),
    inference(cp,[status(thm)],[t299,t137]) ).

cnf(t11,plain,
    ifeq(X1,X1,X2,X3) = X2,
    introduced(definition) ).

cnf(t105,plain,
    ifeq(X1,X1,X2,X3) = X2,
    inference(orient,[status(thm)],[t11]) ).

cnf(t429,plain,
    sF2 = member(y,x),
    inference(step,[status(thm)],[t300,t105]) ).

cnf(t15,plain,
    ifeq(not(X1),true,X1,false) = false,
    introduced(definition) ).

cnf(t109,plain,
    ifeq(not(X1),true,X1,false) = false,
    inference(orient,[status(thm)],[t15]) ).

cnf(t349,plain,
    ifeq(not(X1),sF2,X1,false) = false,
    inference(step,[status(thm)],[t109,t113]) ).

cnf(t135,plain,
    ifeq(not(X1),sF2,X1,false) = false,
    inference(rw,[status(thm)],[t349]) ).

cnf(t150,plain,
    ifeq(not(X1),sF2,X1,false) = false,
    inference(orient,[status(thm)],[t135]) ).

cnf(f23,axiom,
    ( ~ member(Z,X)
    | ~ member(Z,complement(X)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement1) ).

fof(f23_nnf,plain,
    ! [Z,X] :
      ( ~ member(Z,X)
      | ~ member(Z,complement(X)) ),
    inference(nnf_transformation,[status(thm)],[f23]) ).

fof(f23_sk,plain,
    ! [Z,X] :
      ( ~ member(Z,X)
      | ~ member(Z,complement(X)) ),
    inference(skolemisation,[status(esa)],[f23_nnf]) ).

cnf(c23,plain,
    ( ~ member(X0,X1)
    | ~ member(X0,complement(X1)) ),
    inference(cnf_transformation,[status(esa)],[f23_sk]) ).

cnf(t36,plain,
    or(not(member(X1,complement(X2))),not(member(X1,X2))) = true,
    inference(equality_encoding,[status(esa)],[c23]) ).

cnf(t393,plain,
    or(not(member(X1,complement(X2))),not(member(X1,X2))) = sF2,
    inference(step,[status(thm)],[t36,t113]) ).

cnf(t210,plain,
    or(not(member(X1,complement(X2))),not(member(X1,X2))) = sF2,
    inference(orient,[status(thm)],[t393]) ).

cnf(t211,plain,
    sF2 = or(not(member(X1,sF0)),not(member(X1,x))),
    inference(cp,[status(thm)],[t210,t96]) ).

cnf(t235,plain,
    or(not(member(X1,sF0)),not(member(X1,x))) = sF2,
    inference(orient,[status(thm)],[t211]) ).

cnf(f20,axiom,
    ( member(Z,X)
    | ~ member(Z,intersection(X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection1) ).

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

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

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

cnf(t38,plain,
    ifeq(member(X1,intersection(X2,X3)),true,member(X1,X2),true) = true,
    inference(equality_encoding,[status(esa)],[c20]) ).

cnf(t409,plain,
    ifeq(member(X1,intersection(X2,X3)),sF2,member(X1,X2),true) = true,
    inference(step,[status(thm)],[t38,t113]) ).

cnf(t410,plain,
    ifeq(member(X1,intersection(X2,X3)),sF2,member(X1,X2),sF2) = true,
    inference(step,[status(thm)],[t409,t113]) ).

cnf(t411,plain,
    ifeq(member(X1,intersection(X2,X3)),sF2,member(X1,X2),sF2) = sF2,
    inference(step,[status(thm)],[t410,t113]) ).

cnf(t240,plain,
    ifeq(member(X1,intersection(X2,X3)),sF2,member(X1,X2),sF2) = sF2,
    inference(orient,[status(thm)],[t411]) ).

cnf(t242,plain,
    sF2 = ifeq(member(X1,sF1),sF2,member(X1,sF0),sF2),
    inference(cp,[status(thm)],[t240,t104]) ).

cnf(t264,plain,
    ifeq(member(X1,sF1),sF2,member(X1,sF0),sF2) = sF2,
    inference(orient,[status(thm)],[t242]) ).

cnf(t265,plain,
    sF2 = ifeq(sF2,sF2,member(y,sF0),sF2),
    inference(cp,[status(thm)],[t264,t137]) ).

cnf(t415,plain,
    sF2 = member(y,sF0),
    inference(step,[status(thm)],[t265,t105]) ).

cnf(t266,plain,
    member(y,sF0) = sF2,
    inference(orient,[status(thm)],[t415]) ).

cnf(t268,plain,
    sF2 = or(not(sF2),not(member(y,x))),
    inference(cp,[status(thm)],[t235,t266]) ).

cnf(t3,plain,
    not(true) = false,
    introduced(definition) ).

cnf(t95,plain,
    not(true) = false,
    inference(orient,[status(thm)],[t3]) ).

cnf(t336,plain,
    not(sF2) = false,
    inference(step,[status(thm)],[t95,t113]) ).

cnf(t120,plain,
    not(sF2) = false,
    inference(rw,[status(thm)],[t336]) ).

cnf(t144,plain,
    not(sF2) = false,
    inference(orient,[status(thm)],[t120]) ).

cnf(t416,plain,
    sF2 = or(false,not(member(y,x))),
    inference(step,[status(thm)],[t268,t144]) ).

cnf(t8,plain,
    or(false,X1) = X1,
    introduced(definition) ).

cnf(t101,plain,
    or(false,X1) = X1,
    inference(orient,[status(thm)],[t8]) ).

cnf(t417,plain,
    sF2 = not(member(y,x)),
    inference(step,[status(thm)],[t416,t101]) ).

cnf(t271,plain,
    not(member(y,x)) = sF2,
    inference(orient,[status(thm)],[t417]) ).

cnf(t272,plain,
    false = ifeq(sF2,sF2,member(y,x),false),
    inference(cp,[status(thm)],[t150,t271]) ).

cnf(t418,plain,
    false = member(y,x),
    inference(step,[status(thm)],[t272,t105]) ).

cnf(t273,plain,
    member(y,x) = false,
    inference(orient,[status(thm)],[t418]) ).

cnf(t430,plain,
    sF2 = false,
    inference(step,[status(thm)],[t429,t273]) ).

cnf(t301,plain,
    false = sF2,
    inference(orient,[status(thm)],[t430]) ).

cnf(f29,axiom,
    ( ~ member(Z,domain_of(X))
    | restrict(X,singleton(Z),universal_class) != null_class ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain1) ).

fof(f29_nnf,plain,
    ! [X,Z] :
      ( ~ member(Z,domain_of(X))
      | restrict(X,singleton(Z),universal_class) != null_class ),
    inference(nnf_transformation,[status(thm)],[f29]) ).

fof(f29_sk,plain,
    ! [X,Z] :
      ( ~ member(Z,domain_of(X))
      | restrict(X,singleton(Z),universal_class) != null_class ),
    inference(skolemisation,[status(esa)],[f29_nnf]) ).

cnf(c29,plain,
    ( ~ member(X1,domain_of(X0))
    | restrict(X0,singleton(X1),universal_class) != null_class ),
    inference(cnf_transformation,[status(esa)],[f29_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c23,c29]) ).

cnf(g0_0,plain,
    sF2 != false,
    inference(rw,[status(thm)],[goal_0,t113]) ).

cnf(g0_1,plain,
    sF2 != sF2,
    inference(rw,[status(thm)],[g0_0,t301]) ).

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

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