↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : CSR086+2 : 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 : n010.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:08 PM UTC 2026

% Result   : Theorem 7.01s 7.43s
% Output   : CNFRefutation 7.01s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (  10 unt;   0 def)
%            Number of atoms       :   58 (   0 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   64 (  28   ~;  24   |;   7   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :   30 (   2 sgn  14   !;   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+1.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+1.ax',kb_SUMO_26) ).

fof(prove_from_SUMO_MILO,conjecture,
    ? [X1223] : s__links(X1223,X1223,s__Arc13_1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).

fof(kb_SUMO_4789,axiom,
    ! [X185] :
      ( s__instance(X185,s__GraphArc)
     => ( s__instance(X185,s__GraphLoop)
      <=> ? [X186] :
            ( s__instance(X186,s__GraphNode)
            & s__links(X186,X186,X185) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_4789) ).

fof(kb_SUMO_4786,axiom,
    s__subclass(s__GraphLoop,s__GraphArc),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_4786) ).

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

fof(c_0_6,plain,
    ! [X1575,X1576,X1577] :
      ( ~ s__instance(X1576,s__SetOrClass)
      | ~ s__instance(X1575,s__SetOrClass)
      | ~ s__subclass(X1575,X1576)
      | ~ s__instance(X1577,X1575)
      | s__instance(X1577,X1576) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])]) ).

fof(c_0_7,plain,
    ! [X1573,X1574] :
      ( ( s__instance(X1573,s__SetOrClass)
        | ~ s__subclass(X1573,X1574) )
      & ( s__instance(X1574,s__SetOrClass)
        | ~ s__subclass(X1573,X1574) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])]) ).

fof(c_0_8,negated_conjecture,
    ~ ? [X1223] : s__links(X1223,X1223,s__Arc13_1),
    inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).

cnf(c_0_9,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_6]) ).

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

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

fof(c_0_12,negated_conjecture,
    ! [X1443] : ~ s__links(X1443,X1443,s__Arc13_1),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).

fof(c_0_13,plain,
    ! [X1468,X1470] :
      ( ( s__instance(esk10_1(X1468),s__GraphNode)
        | ~ s__instance(X1468,s__GraphLoop)
        | ~ s__instance(X1468,s__GraphArc) )
      & ( s__links(esk10_1(X1468),esk10_1(X1468),X1468)
        | ~ s__instance(X1468,s__GraphLoop)
        | ~ s__instance(X1468,s__GraphArc) )
      & ( ~ s__instance(X1470,s__GraphNode)
        | ~ s__links(X1470,X1470,X1468)
        | s__instance(X1468,s__GraphLoop)
        | ~ s__instance(X1468,s__GraphArc) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_4789])])])])]) ).

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

cnf(c_0_15,plain,
    s__subclass(s__GraphLoop,s__GraphArc),
    inference(split_conjunct,[status(thm)],[kb_SUMO_4786]) ).

cnf(c_0_16,negated_conjecture,
    ~ s__links(X1,X1,s__Arc13_1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    ( s__links(esk10_1(X1),esk10_1(X1),X1)
    | ~ s__instance(X1,s__GraphLoop)
    | ~ s__instance(X1,s__GraphArc) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_18,plain,
    s__instance(s__Arc13_1,s__GraphLoop),
    inference(split_conjunct,[status(thm)],[local_1]) ).

cnf(c_0_19,plain,
    ( s__instance(X1,s__GraphArc)
    | ~ s__instance(X1,s__GraphLoop) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    ~ s__instance(s__Arc13_1,s__GraphArc),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).

cnf(c_0_21,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : CSR086+2 : 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 : n010.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:50:21 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 7.01/7.43  % Version  : CSE_E---1.7
% 7.01/7.43  % Problem  : theBenchmark.p
% 7.01/7.43  % SZS status Theorem for theBenchmark.p
% 7.01/7.43  % SZS output start CNFRefutation
% See solution above
% 7.01/7.43  % Total time : 7.061s
%------------------------------------------------------------------------------