↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SET062+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p

% 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 : Sun Sep 27 08:35:33 AM UTC 2026

% Result   : Theorem 0.18s 0.51s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (   9 unt;   0 def)
%            Number of atoms       :   33 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   34 (  15   ~;  11   |;   6   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   24 (   1 sgn  19   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(subclass_defn,axiom,
    ! [X,Y] :
      ( subclass(X,Y)
    <=> ! [U] :
          ( member(U,X)
         => member(U,Y) ) ),
    file('theBenchmark.p',subclass_defn) ).

fof(null_class_defn,axiom,
    ! [X] : ~ member(X,null_class),
    file('theBenchmark.p',null_class_defn) ).

fof(null_class_is_subclass,conjecture,
    ! [X] : subclass(null_class,X),
    file('theBenchmark.p',null_class_is_subclass) ).

fof(null_class_is_subclass_neg,negated_conjecture,
    ~ ! [X] : subclass(null_class,X),
    inference(assume_negation,[status(cth)],[null_class_is_subclass]) ).

fof(nnf_42,plain,
    ? [X] : ~ subclass(null_class,X),
    inference(fof_nnf,[status(thm)],[null_class_is_subclass_neg]) ).

fof(sk_null_class_is_subclass_neg,plain,
    ~ subclass(null_class,sK0),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X,sK0)],[nnf_42]) ).

cnf(c_64,negated_conjecture,
    ~ subclass(null_class,sK0),
    inference(split_conjunct,[status(thm)],[sk_null_class_is_subclass_neg]) ).

cnf(c_108,plain,
    ~ member(A,null_class),
    inference(clausify,[status(thm)],[null_class_defn]) ).

fof(nnf_1,plain,
    ! [X,Y] :
      ( ( ? [U] :
            ( ~ member(U,Y)
            & member(U,X) )
        | subclass(X,Y) )
      & ( ! [X0] :
            ( member(X0,Y)
            | ~ member(X0,X) )
        | ~ subclass(X,Y) ) ),
    inference(fof_nnf,[status(thm)],[subclass_defn]) ).

fof(sk_subclass_defn_sk,plain,
    ! [X,Y] :
      ( ( ( ~ member(sK1(X,Y),Y)
          & member(sK1(X,Y),X) )
        | subclass(X,Y) )
      & ( ! [X0] :
            ( member(X0,Y)
            | ~ member(X0,X) )
        | ~ subclass(X,Y) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U,sK1(X,Y))],[nnf_1]) ).

fof(sk_subclass_defn,plain,
    ( ! [VAR_0,VAR_1] :
        ( ~ member(sK1(VAR_0,VAR_1),VAR_1)
        | subclass(VAR_0,VAR_1) )
    & ! [VAR_0,VAR_1] :
        ( member(sK1(VAR_0,VAR_1),VAR_0)
        | subclass(VAR_0,VAR_1) )
    & ! [VAR_0,VAR_1,VAR_2] :
        ( member(VAR_2,VAR_1)
        | ~ member(VAR_2,VAR_0)
        | ~ subclass(VAR_0,VAR_1) ) ),
    inference(cnf_transformation,[status(thm)],[sk_subclass_defn_sk]) ).

cnf(c_138,plain,
    ( member(sK1(A,B),A)
    | subclass(A,B) ),
    inference(split_conjunct,[status(thm)],[sk_subclass_defn]) ).

cnf(c_335,negated_conjecture,
    member(sK1(null_class,sK0),null_class),
    inference(resolve,[status(thm)],[c_138,c_64]) ).

cnf(c_334,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_108,c_335]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SET062+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44  % Computer : n015.cluster.edu
% 0.18/0.44  % Model    : x86_64 x86_64
% 0.18/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44  % Memory   : 8046.5625MB
% 0.18/0.44  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Sat Sep 26 07:04:29 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.45  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.45  % Process 3388120 was started by sandbox2 on n015,
% 0.18/0.45  % Sat Sep 26 07:04:29 2026
% 0.18/0.45  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.18/0.47  
% 0.18/0.47  % From the command line: assign(max_seconds, 300).
% 0.18/0.51  
% 0.18/0.51  % SZS status Theorem for theBenchmark
% 0.18/0.51  
% 0.18/0.51  % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.18/0.51  % Length of proof is 7.
% 0.18/0.51  % Level of proof is 2.
% 0.18/0.51  % Maximum clause weight is 18.000.
% 0.18/0.51  % Given clauses 48.
% 0.18/0.51  
% 0.18/0.51  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------