↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : CSR075+1 : TPTP v9.2.1. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n003.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 04:15:01 PM UTC 2026

% Result   : Theorem 6.03s 7.09s
% Output   : CNFRefutation 6.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   25 (  12 unt;   0 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   52 (  23   ~;  19   |;   6   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-1 aty)
%            Number of variables   :   30 (   3 sgn  13   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(kb_SUMO_27,axiom,
    ! [X6,X7,X8] :
      ( ( s__instance(X7,s__SetOrClass)
        & s__instance(X6,s__SetOrClass) )
     => ( ( s__subclass(X6,X7)
          & s__instance(X8,X6) )
       => s__instance(X8,X7) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_27) ).

fof(kb_SUMO_26,axiom,
    ! [X6,X7] :
      ( s__subclass(X6,X7)
     => ( s__instance(X6,s__SetOrClass)
        & s__instance(X7,s__SetOrClass) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_26) ).

fof(prove_from_SUMO,conjecture,
    ? [X591] : s__member(X591,s__Org1_1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO) ).

fof(kb_SUMO_630,axiom,
    ! [X85] :
      ( s__instance(X85,s__Collection)
     => ? [X51] :
          ( s__instance(X51,s__SelfConnectedObject)
          & s__member(X51,X85) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_630) ).

fof(kb_SUMO_6696,axiom,
    s__subclass(s__Organization,s__Group),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_6696) ).

fof(kb_SUMO_6547,axiom,
    s__subclass(s__Group,s__Collection),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_6547) ).

fof(local_1,axiom,
    s__instance(s__Org1_1,s__Organization),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).

fof(c_0_7,plain,
    ! [X6233,X6234,X6235] :
      ( ~ s__instance(X6234,s__SetOrClass)
      | ~ s__instance(X6233,s__SetOrClass)
      | ~ s__subclass(X6233,X6234)
      | ~ s__instance(X6235,X6233)
      | s__instance(X6235,X6234) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])]) ).

fof(c_0_8,plain,
    ! [X6231,X6232] :
      ( ( s__instance(X6231,s__SetOrClass)
        | ~ s__subclass(X6231,X6232) )
      & ( s__instance(X6232,s__SetOrClass)
        | ~ s__subclass(X6231,X6232) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])]) ).

fof(c_0_9,negated_conjecture,
    ~ ? [X591] : s__member(X591,s__Org1_1),
    inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).

cnf(c_0_10,plain,
    ( s__instance(X3,X1)
    | ~ s__instance(X1,s__SetOrClass)
    | ~ s__instance(X2,s__SetOrClass)
    | ~ s__subclass(X2,X1)
    | ~ s__instance(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_13,negated_conjecture,
    ! [X6156] : ~ s__member(X6156,s__Org1_1),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).

fof(c_0_14,plain,
    ! [X6159] :
      ( ( s__instance(esk1_1(X6159),s__SelfConnectedObject)
        | ~ s__instance(X6159,s__Collection) )
      & ( s__member(esk1_1(X6159),X6159)
        | ~ s__instance(X6159,s__Collection) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_630])])])]) ).

cnf(c_0_15,plain,
    ( s__instance(X1,X2)
    | ~ s__subclass(X3,X2)
    | ~ s__instance(X1,X3) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).

cnf(c_0_16,plain,
    s__subclass(s__Organization,s__Group),
    inference(split_conjunct,[status(thm)],[kb_SUMO_6696]) ).

cnf(c_0_17,plain,
    s__subclass(s__Group,s__Collection),
    inference(split_conjunct,[status(thm)],[kb_SUMO_6547]) ).

cnf(c_0_18,negated_conjecture,
    ~ s__member(X1,s__Org1_1),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,plain,
    ( s__member(esk1_1(X1),X1)
    | ~ s__instance(X1,s__Collection) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,plain,
    ( s__instance(X1,s__Group)
    | ~ s__instance(X1,s__Organization) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    ( s__instance(X1,s__Collection)
    | ~ s__instance(X1,s__Group) ),
    inference(spm,[status(thm)],[c_0_15,c_0_17]) ).

cnf(c_0_22,negated_conjecture,
    ~ s__instance(s__Org1_1,s__Collection),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,plain,
    s__instance(s__Org1_1,s__Organization),
    inference(split_conjunct,[status(thm)],[local_1]) ).

cnf(c_0_24,plain,
    $false,
    inference(cdclpropres,[status(thm)],[c_0_20,c_0_21,c_0_22,c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : CSR075+1 : TPTP v9.2.1. Bugfixed v7.3.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33  % Computer : n003.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Mon May  4 16:44:26 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 6.03/7.09  % Version  : CSE_E---1.7
% 6.03/7.09  % Problem  : theBenchmark.p
% 6.03/7.09  % SZS status Theorem for theBenchmark.p
% 6.03/7.09  % SZS output start CNFRefutation
% See solution above
% 6.03/7.11  % Total time : 6.063s
%------------------------------------------------------------------------------