↑ Up

FindProof---0.1.UNS-Prf.s

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

% Result   : Unsatisfiable 7.56s 6.59s
% Output   : Proof 7.56s
% Verified : 

% Comments : 
%------------------------------------------------------------------------------
cnf(t109,axiom,
    sF0 = member(y,x),
    introduced(definition) ).

cnf(f114,negated_conjecture,
    y = z,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_complement_axiom_3) ).

fof(f114_nnf,plain,
    y = z,
    inference(nnf_transformation,[status(thm)],[f114]) ).

cnf(c114,plain,
    y = z,
    inference(cnf_transformation,[status(esa)],[f114_nnf]) ).

cnf(t0,plain,
    z = y,
    inference(equality_encoding,[status(esa)],[c114]) ).

cnf(t112,plain,
    y = z,
    inference(orient,[status(thm)],[t0]) ).

cnf(t267,plain,
    sF0 = member(z,x),
    inference(step,[status(thm)],[t109,t112]) ).

cnf(f112,negated_conjecture,
    member(y,x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_complement_axiom_1) ).

fof(f112_nnf,plain,
    member(y,x),
    inference(nnf_transformation,[status(thm)],[f112]) ).

cnf(c112,plain,
    member(y,x),
    inference(cnf_transformation,[status(esa)],[f112_nnf]) ).

cnf(t7,plain,
    member(y,x) = true,
    inference(equality_encoding,[status(esa)],[c112]) ).

cnf(t266,plain,
    member(z,x) = true,
    inference(step,[status(thm)],[t7,t112]) ).

cnf(t120,plain,
    member(z,x) = true,
    inference(orient,[status(thm)],[t266]) ).

cnf(t268,plain,
    sF0 = true,
    inference(step,[status(thm)],[t267,t120]) ).

cnf(t126,plain,
    true = sF0,
    inference(orient,[status(thm)],[t268]) ).

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(t45,plain,
    or(not(member(X1,complement(X2))),not(member(X1,X2))) = true,
    inference(equality_encoding,[status(esa)],[c23]) ).

cnf(t339,plain,
    or(not(member(X1,complement(X2))),not(member(X1,X2))) = sF0,
    inference(step,[status(thm)],[t45,t126]) ).

cnf(t251,plain,
    or(not(member(X1,complement(X2))),not(member(X1,X2))) = sF0,
    inference(orient,[status(thm)],[t339]) ).

cnf(t280,plain,
    member(z,x) = sF0,
    inference(step,[status(thm)],[t120,t126]) ).

cnf(t138,plain,
    member(z,x) = sF0,
    inference(orient,[status(thm)],[t280]) ).

cnf(t254,plain,
    sF0 = or(not(member(z,complement(x))),not(sF0)),
    inference(cp,[status(thm)],[t251,t138]) ).

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

cnf(t117,plain,
    complement(x) = sF1,
    inference(orient,[status(thm)],[t110]) ).

cnf(t340,plain,
    sF0 = or(not(member(z,sF1)),not(sF0)),
    inference(step,[status(thm)],[t254,t117]) ).

cnf(f113,negated_conjecture,
    member(z,complement(x)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_complement_axiom_2) ).

fof(f113_nnf,plain,
    member(z,complement(x)),
    inference(nnf_transformation,[status(thm)],[f113]) ).

cnf(c113,plain,
    member(z,complement(x)),
    inference(cnf_transformation,[status(esa)],[f113_nnf]) ).

cnf(t13,plain,
    member(z,complement(x)) = true,
    inference(equality_encoding,[status(esa)],[c113]) ).

cnf(t286,plain,
    member(z,sF1) = true,
    inference(step,[status(thm)],[t13,t117]) ).

cnf(t287,plain,
    member(z,sF1) = sF0,
    inference(step,[status(thm)],[t286,t126]) ).

cnf(t147,plain,
    member(z,sF1) = sF0,
    inference(orient,[status(thm)],[t287]) ).

cnf(t341,plain,
    sF0 = or(not(sF0),not(sF0)),
    inference(step,[status(thm)],[t340,t147]) ).

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

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

cnf(t275,plain,
    not(sF0) = false,
    inference(step,[status(thm)],[t116,t126]) ).

cnf(t133,plain,
    not(sF0) = false,
    inference(rw,[status(thm)],[t275]) ).

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

cnf(t342,plain,
    sF0 = or(false,not(sF0)),
    inference(step,[status(thm)],[t341,t144]) ).

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

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

cnf(t343,plain,
    sF0 = not(sF0),
    inference(step,[status(thm)],[t342,t123]) ).

cnf(t344,plain,
    sF0 = false,
    inference(step,[status(thm)],[t343,t144]) ).

cnf(t258,plain,
    false = sF0,
    inference(orient,[status(thm)],[t344]) ).

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,
    sF0 != false,
    inference(rw,[status(thm)],[goal_0,t126]) ).

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

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

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