↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n002.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:45 PM UTC 2026

% Result   : Unsatisfiable 8.00s 1.47s
% Output   : Proof 8.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   47 (  39 unt;   0 def)
%            Number of atoms       :   55 (  34 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   39 (  31   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   8 con; 0-4 aty)
%            Number of variables   :   20 (   0 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(t101,axiom,
    sF1 = ifeq(x,y,false,true),
    introduced(definition) ).

cnf(t100,axiom,
    sF0 = eq(x,y),
    introduced(definition) ).

cnf(f97,negated_conjecture,
    x != y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equality1_1) ).

fof(f97_nnf,plain,
    x != y,
    inference(nnf_transformation,[status(thm)],[f97]) ).

fof(f97_sk,plain,
    x != y,
    inference(skolemisation,[status(esa)],[f97_nnf]) ).

cnf(c97,plain,
    x != y,
    inference(cnf_transformation,[status(esa)],[f97_sk]) ).

cnf(t5,plain,
    eq(x,y) = false,
    inference(equality_encoding,[status(esa)],[c97]) ).

cnf(t113,plain,
    eq(x,y) = false,
    inference(orient,[status(thm)],[t5]) ).

cnf(t524,plain,
    sF0 = false,
    inference(step,[status(thm)],[t100,t113]) ).

cnf(t121,plain,
    false = sF0,
    inference(orient,[status(thm)],[t524]) ).

cnf(t537,plain,
    sF1 = ifeq(x,y,sF0,true),
    inference(step,[status(thm)],[t101,t121]) ).

cnf(t14,plain,
    ifeq(x,y,false,true) = true,
    inference(equality_encoding,[status(esa)],[c97]) ).

cnf(t532,plain,
    ifeq(x,y,sF0,true) = true,
    inference(step,[status(thm)],[t14,t121]) ).

cnf(t135,plain,
    ifeq(x,y,sF0,true) = true,
    inference(orient,[status(thm)],[t532]) ).

cnf(t538,plain,
    sF1 = true,
    inference(step,[status(thm)],[t537,t135]) ).

cnf(t141,plain,
    true = sF1,
    inference(orient,[status(thm)],[t538]) ).

cnf(t528,plain,
    eq(x,y) = sF0,
    inference(step,[status(thm)],[t113,t121]) ).

cnf(t125,plain,
    eq(x,y) = sF0,
    inference(orient,[status(thm)],[t528]) ).

cnf(t389,plain,
    eq(y,y) = sF0,
    inference(rw,[status(thm)],[t125]) ).

cnf(t4,plain,
    eq(X1,X1) = true,
    introduced(definition) ).

cnf(t112,plain,
    eq(X1,X1) = true,
    inference(orient,[status(thm)],[t4]) ).

cnf(t544,plain,
    eq(X1,X1) = sF1,
    inference(step,[status(thm)],[t112,t141]) ).

cnf(t147,plain,
    eq(X1,X1) = sF1,
    inference(orient,[status(thm)],[t544]) ).

cnf(t687,plain,
    sF1 = sF0,
    inference(step,[status(thm)],[t389,t147]) ).

cnf(t402,plain,
    sF1 = sF0,
    inference(orient,[status(thm)],[t687]) ).

cnf(t708,plain,
    true = sF0,
    inference(step,[status(thm)],[t141,t402]) ).

cnf(t423,plain,
    true = sF0,
    inference(orient,[status(thm)],[t708]) ).

cnf(f23,axiom,
    ( ~ member(Z,X)
    | ~ member(Z,complement(X)) ),
    file('/export/starexec/sandbox/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(f29,axiom,
    ( ~ member(Z,domain_of(X))
    | restrict(X,singleton(Z),universal_class) != null_class ),
    file('/export/starexec/sandbox/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(f98,negated_conjecture,
    ~ member(not_subclass_element(x,y),x),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equality1_2) ).

fof(f98_nnf,plain,
    ~ member(not_subclass_element(x,y),x),
    inference(nnf_transformation,[status(thm)],[f98]) ).

fof(f98_sk,plain,
    ~ member(not_subclass_element(x,y),x),
    inference(skolemisation,[status(esa)],[f98_nnf]) ).

cnf(c98,plain,
    ~ member(not_subclass_element(x,y),x),
    inference(cnf_transformation,[status(esa)],[f98_sk]) ).

cnf(f99,negated_conjecture,
    ~ member(not_subclass_element(y,x),y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equality1_3) ).

fof(f99_nnf,plain,
    ~ member(not_subclass_element(y,x),y),
    inference(nnf_transformation,[status(thm)],[f99]) ).

fof(f99_sk,plain,
    ~ member(not_subclass_element(y,x),y),
    inference(skolemisation,[status(esa)],[f99_nnf]) ).

cnf(c99,plain,
    ~ member(not_subclass_element(y,x),y),
    inference(cnf_transformation,[status(esa)],[f99_sk]) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET056-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n002.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Thu Sep 24 09:30:48 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 8.00/1.47  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.00/1.47  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------