↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SET055-7 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n003.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 6.27s 1.48s
% Output   : Proof 6.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   37 (  25 unt;   0 def)
%            Number of atoms       :   53 (  16 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   46 (  30   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-4 aty)
%            Number of variables   :   40 (   2 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f73,axiom,
    ( equalish(X,Y)
    | ~ subclass(Y,X)
    | ~ subclass(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subclass_implies_equal) ).

fof(f73_nnf,plain,
    ! [X,Y] :
      ( equalish(X,Y)
      | ~ subclass(Y,X)
      | ~ subclass(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f73]) ).

fof(f73_sk,plain,
    ! [X,Y] :
      ( equalish(X,Y)
      | ~ subclass(Y,X)
      | ~ subclass(X,Y) ),
    inference(skolemisation,[status(esa)],[f73_nnf]) ).

cnf(c73,plain,
    ( equalish(X0,X1)
    | ~ subclass(X1,X0)
    | ~ subclass(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f73_sk]) ).

cnf(t147,plain,
    ifeq(subclass(X1,X2),true,ifeq(subclass(X2,X1),true,equalish(X1,X2),true),true) = true,
    inference(equality_encoding,[status(esa)],[c73]) ).

cnf(t300,plain,
    ifeq(subclass(X1,X2),true,ifeq(subclass(X2,X1),true,equalish(X1,X2),true),true) = true,
    inference(orient,[status(thm)],[t147]) ).

cnf(f164,negated_conjecture,
    ~ equalish(x,x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_reflexivity) ).

fof(f164_nnf,plain,
    ~ equalish(x,x),
    inference(nnf_transformation,[status(thm)],[f164]) ).

fof(f164_sk,plain,
    ~ equalish(x,x),
    inference(skolemisation,[status(esa)],[f164_nnf]) ).

cnf(c164,plain,
    ~ equalish(x,x),
    inference(cnf_transformation,[status(esa)],[f164_sk]) ).

cnf(t4,plain,
    equalish(x,x) = false,
    inference(equality_encoding,[status(esa)],[c164]) ).

cnf(t1967,plain,
    equalish(x,x) = false,
    inference(orient,[status(thm)],[t4]) ).

cnf(t1975,plain,
    true = ifeq(subclass(x,x),true,ifeq(subclass(x,x),true,false,true),true),
    inference(cp,[status(thm)],[t300,t1967]) ).

cnf(f162,axiom,
    subclass(X,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subclass_is_reflexive) ).

fof(f162_nnf,plain,
    ! [X] : subclass(X,X),
    inference(nnf_transformation,[status(thm)],[f162]) ).

fof(f162_sk,plain,
    ! [X] : subclass(X,X),
    inference(skolemisation,[status(esa)],[f162_nnf]) ).

cnf(c162,plain,
    subclass(X0,X0),
    inference(cnf_transformation,[status(esa)],[f162_sk]) ).

cnf(t10,plain,
    subclass(X1,X1) = true,
    inference(equality_encoding,[status(esa)],[c162]) ).

cnf(t1829,plain,
    subclass(X1,X1) = true,
    inference(orient,[status(thm)],[t10]) ).

cnf(t2057,plain,
    true = ifeq(true,true,ifeq(subclass(x,x),true,false,true),true),
    inference(step,[status(thm)],[t1975,t1829]) ).

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

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

cnf(t2058,plain,
    true = ifeq(subclass(x,x),true,false,true),
    inference(step,[status(thm)],[t2057,t176]) ).

cnf(t2059,plain,
    true = ifeq(true,true,false,true),
    inference(step,[status(thm)],[t2058,t1829]) ).

cnf(t2060,plain,
    true = false,
    inference(step,[status(thm)],[t2059,t176]) ).

cnf(t2046,plain,
    false = true,
    inference(orient,[status(thm)],[t2060]) ).

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

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

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

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

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

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

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

cnf(c96,plain,
    ( ~ member(X1,domain_of(X0))
    | ~ equalish(restrict(X0,singleton(X1),universal_class),null_class) ),
    inference(cnf_transformation,[status(esa)],[f96_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c90,c96,c164]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t2046]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET055-7 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.36  % Computer : n003.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Thu Sep 24 09:29:05 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.27/1.48  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.27/1.48  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------