TSTP Solution File: CSR254+1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : CSR254+1 : TPTP v8.2.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n023.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 : Mon May 20 19:17:00 EDT 2024

% Result   : Theorem 284.12s 36.55s
% Output   : CNFRefutation 284.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   38 (  13 unt;   0 def)
%            Number of atoms       :   81 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   79 (  36   ~;  28   |;  10   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-1 aty)
%            Number of variables   :   48 (   2 sgn  22   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(resultRelation0646,conjecture,
    ? [X1,X2] :
      ( p__d__instance(X1,c__Process)
      & p__d__instance(X1,c__Manufacture)
      & p__d__instance(X2,c__Object)
      & p__result(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',resultRelation0646) ).

fof(predefinitionsA8,axiom,
    ! [X1,X2,X3] :
      ( ( p__d__subclass(X1,X2)
        & p__d__subclass(X2,X3) )
     => p__d__subclass(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',predefinitionsA8) ).

fof(typeA437,axiom,
    ! [X1038,X1039] :
      ( p__result(X1038,X1039)
     => p__d__instance(X1038,c__Process) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',typeA437) ).

fof(mergeA3134,axiom,
    p__d__subclass(c__Artifact,c__Object),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA3134) ).

fof(mergeA3137,axiom,
    ! [X452] :
      ( p__d__instance(X452,c__Product)
     => ? [X453] :
          ( p__d__instance(X453,c__Manufacture)
          & p__result(X453,X452) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA3137) ).

fof(predefinitionsA12,axiom,
    ! [X1,X2,X3] :
      ( ( p__d__instance(X1,X2)
        & p__d__subclass(X2,X3) )
     => p__d__instance(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',predefinitionsA12) ).

fof(mergeA3136,axiom,
    p__d__subclass(c__Product,c__Artifact),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA3136) ).

fof(mergeA176,axiom,
    ! [X7] :
      ( p__d__subclass(X7,c__Entity)
     => ? [X35] : p__d__instance(X35,X7) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA176) ).

fof(mergeA178,axiom,
    p__d__subclass(c__Physical,c__Entity),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA178) ).

fof(mergeA181,axiom,
    p__d__subclass(c__Object,c__Physical),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA181) ).

fof(c_0_10,negated_conjecture,
    ~ ? [X1,X2] :
        ( p__d__instance(X1,c__Process)
        & p__d__instance(X1,c__Manufacture)
        & p__d__instance(X2,c__Object)
        & p__result(X1,X2) ),
    inference(assume_negation,[status(cth)],[resultRelation0646]) ).

fof(c_0_11,plain,
    ! [X1045,X1046,X1047] :
      ( ~ p__d__subclass(X1045,X1046)
      | ~ p__d__subclass(X1046,X1047)
      | p__d__subclass(X1045,X1047) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[predefinitionsA8])])]) ).

fof(c_0_12,negated_conjecture,
    ! [X7881,X7882] :
      ( ~ p__d__instance(X7881,c__Process)
      | ~ p__d__instance(X7881,c__Manufacture)
      | ~ p__d__instance(X7882,c__Object)
      | ~ p__result(X7881,X7882) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).

fof(c_0_13,plain,
    ! [X7481,X7482] :
      ( ~ p__result(X7481,X7482)
      | p__d__instance(X7481,c__Process) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[typeA437])])]) ).

cnf(c_0_14,plain,
    ( p__d__subclass(X1,X3)
    | ~ p__d__subclass(X1,X2)
    | ~ p__d__subclass(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_15,plain,
    p__d__subclass(c__Artifact,c__Object),
    inference(split_conjunct,[status(thm)],[mergeA3134]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ p__d__instance(X1,c__Process)
    | ~ p__d__instance(X1,c__Manufacture)
    | ~ p__d__instance(X2,c__Object)
    | ~ p__result(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    ( p__d__instance(X1,c__Process)
    | ~ p__result(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_18,plain,
    ! [X2702] :
      ( ( p__d__instance(esk325_1(X2702),c__Manufacture)
        | ~ p__d__instance(X2702,c__Product) )
      & ( p__result(esk325_1(X2702),X2702)
        | ~ p__d__instance(X2702,c__Product) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mergeA3137])])])])]) ).

fof(c_0_19,plain,
    ! [X1050,X1051,X1052] :
      ( ~ p__d__instance(X1050,X1051)
      | ~ p__d__subclass(X1051,X1052)
      | p__d__instance(X1050,X1052) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[predefinitionsA12])])]) ).

cnf(c_0_20,plain,
    ( p__d__subclass(X1,c__Object)
    | ~ p__d__subclass(X1,c__Artifact) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_21,plain,
    p__d__subclass(c__Product,c__Artifact),
    inference(split_conjunct,[status(thm)],[mergeA3136]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ p__result(X1,X2)
    | ~ p__d__instance(X2,c__Object)
    | ~ p__d__instance(X1,c__Manufacture) ),
    inference(csr,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_23,plain,
    ( p__result(esk325_1(X1),X1)
    | ~ p__d__instance(X1,c__Product) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_24,plain,
    ( p__d__instance(esk325_1(X1),c__Manufacture)
    | ~ p__d__instance(X1,c__Product) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_25,plain,
    ( p__d__instance(X1,X3)
    | ~ p__d__instance(X1,X2)
    | ~ p__d__subclass(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_26,plain,
    p__d__subclass(c__Product,c__Object),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ p__d__instance(X1,c__Object)
    | ~ p__d__instance(X1,c__Product) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).

fof(c_0_28,plain,
    ! [X1279] :
      ( ~ p__d__subclass(X1279,c__Entity)
      | p__d__instance(esk13_1(X1279),X1279) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mergeA176])])])]) ).

cnf(c_0_29,plain,
    ~ p__d__instance(X1,c__Product),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).

cnf(c_0_30,plain,
    ( p__d__instance(esk13_1(X1),X1)
    | ~ p__d__subclass(X1,c__Entity) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_31,plain,
    p__d__subclass(c__Physical,c__Entity),
    inference(split_conjunct,[status(thm)],[mergeA178]) ).

cnf(c_0_32,plain,
    ~ p__d__subclass(c__Product,c__Entity),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,plain,
    ( p__d__subclass(X1,c__Entity)
    | ~ p__d__subclass(X1,c__Physical) ),
    inference(spm,[status(thm)],[c_0_14,c_0_31]) ).

cnf(c_0_34,plain,
    p__d__subclass(c__Object,c__Physical),
    inference(split_conjunct,[status(thm)],[mergeA181]) ).

cnf(c_0_35,plain,
    ~ p__d__subclass(c__Product,c__Physical),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_36,plain,
    ( p__d__subclass(X1,c__Physical)
    | ~ p__d__subclass(X1,c__Object) ),
    inference(spm,[status(thm)],[c_0_14,c_0_34]) ).

cnf(c_0_37,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_26])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : CSR254+1 : TPTP v8.2.0. Released v7.3.0.
% 0.00/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n023.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Sun May 19 01:22:08 EDT 2024
% 0.10/0.31  % CPUTime    : 
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 284.12/36.55  # Version: 3.1.0
% 284.12/36.55  # Preprocessing class: FMLLSMSLSSSNFFN.
% 284.12/36.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 284.12/36.55  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 284.12/36.55  # Starting new_bool_3 with 300s (1) cores
% 284.12/36.55  # Starting new_bool_1 with 300s (1) cores
% 284.12/36.55  # Starting sh5l with 300s (1) cores
% 284.12/36.55  # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 9786 completed with status 0
% 284.12/36.55  # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 284.12/36.55  # Preprocessing class: FMLLSMSLSSSNFFN.
% 284.12/36.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 284.12/36.55  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 284.12/36.55  # No SInE strategy applied
% 284.12/36.55  # Search class: FGHSS-SMLM31-MFFFFFNN
% 284.12/36.55  # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 284.12/36.55  # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 284.12/36.55  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 284.12/36.55  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 113s (1) cores
% 284.12/36.55  # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 113s (1) cores
% 284.12/36.55  # Starting G-E--_012_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 113s (1) cores
% 284.12/36.55  # G-E--_012_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 9874 completed with status 0
% 284.12/36.55  # Result found by G-E--_012_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 284.12/36.55  # Preprocessing class: FMLLSMSLSSSNFFN.
% 284.12/36.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 284.12/36.55  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 284.12/36.55  # No SInE strategy applied
% 284.12/36.55  # Search class: FGHSS-SMLM31-MFFFFFNN
% 284.12/36.55  # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 284.12/36.55  # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 284.12/36.55  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 284.12/36.55  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 113s (1) cores
% 284.12/36.55  # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 113s (1) cores
% 284.12/36.55  # Starting G-E--_012_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 113s (1) cores
% 284.12/36.55  # Preprocessing time       : 0.098 s
% 284.12/36.55  # Presaturation interreduction done
% 284.12/36.55  
% 284.12/36.55  # Proof found!
% 284.12/36.55  # SZS status Theorem
% 284.12/36.55  # SZS output start CNFRefutation
% See solution above
% 284.12/36.55  # Parsed axioms                        : 7433
% 284.12/36.55  # Removed by relevancy pruning/SinE    : 0
% 284.12/36.55  # Initial clauses                      : 10860
% 284.12/36.55  # Removed in clause preprocessing      : 20
% 284.12/36.55  # Initial clauses in saturation        : 10840
% 284.12/36.55  # Processed clauses                    : 47340
% 284.12/36.55  # ...of these trivial                  : 305
% 284.12/36.55  # ...subsumed                          : 1675
% 284.12/36.55  # ...remaining for further processing  : 45360
% 284.12/36.55  # Other redundant clauses eliminated   : 40
% 284.12/36.55  # Clauses deleted for lack of memory   : 0
% 284.12/36.55  # Backward-subsumed                    : 25
% 284.12/36.55  # Backward-rewritten                   : 51
% 284.12/36.55  # Generated clauses                    : 519280
% 284.12/36.55  # ...of the previous two non-redundant : 513512
% 284.12/36.55  # ...aggressively subsumed             : 0
% 284.12/36.55  # Contextual simplify-reflections      : 3226
% 284.12/36.55  # Paramodulations                      : 519181
% 284.12/36.55  # Factorizations                       : 1
% 284.12/36.55  # NegExts                              : 0
% 284.12/36.55  # Equation resolutions                 : 98
% 284.12/36.55  # Disequality decompositions           : 0
% 284.12/36.55  # Total rewrite steps                  : 5669
% 284.12/36.55  # ...of those cached                   : 2711
% 284.12/36.55  # Propositional unsat checks           : 0
% 284.12/36.55  #    Propositional check models        : 0
% 284.12/36.55  #    Propositional check unsatisfiable : 0
% 284.12/36.55  #    Propositional clauses             : 0
% 284.12/36.55  #    Propositional clauses after purity: 0
% 284.12/36.55  #    Propositional unsat core size     : 0
% 284.12/36.55  #    Propositional preprocessing time  : 0.000
% 284.12/36.55  #    Propositional encoding time       : 0.000
% 284.12/36.55  #    Propositional solver time         : 0.000
% 284.12/36.55  #    Success case prop preproc time    : 0.000
% 284.12/36.55  #    Success case prop encoding time   : 0.000
% 284.12/36.55  #    Success case prop solver time     : 0.000
% 284.12/36.55  # Current number of processed clauses  : 34463
% 284.12/36.55  #    Positive orientable unit clauses  : 9693
% 284.12/36.55  #    Positive unorientable unit clauses: 0
% 284.12/36.55  #    Negative unit clauses             : 89
% 284.12/36.55  #    Non-unit-clauses                  : 24681
% 284.12/36.55  # Current number of unprocessed clauses: 487644
% 284.12/36.55  # ...number of literals in the above   : 1197475
% 284.12/36.55  # Current number of archived formulas  : 0
% 284.12/36.55  # Current number of archived clauses   : 10890
% 284.12/36.55  # Clause-clause subsumption calls (NU) : 92215569
% 284.12/36.55  # Rec. Clause-clause subsumption calls : 67893881
% 284.12/36.55  # Non-unit clause-clause subsumptions  : 4907
% 284.12/36.55  # Unit Clause-clause subsumption calls : 23448134
% 284.12/36.55  # Rewrite failures with RHS unbound    : 0
% 284.12/36.55  # BW rewrite match attempts            : 208
% 284.12/36.55  # BW rewrite match successes           : 33
% 284.12/36.55  # Condensation attempts                : 0
% 284.12/36.55  # Condensation successes               : 0
% 284.12/36.55  # Termbank termtop insertions          : 4521458
% 284.12/36.55  # Search garbage collected termcells   : 89356
% 284.12/36.55  
% 284.12/36.55  # -------------------------------------------------
% 284.12/36.55  # User time                : 35.183 s
% 284.12/36.55  # System time              : 0.417 s
% 284.12/36.55  # Total time               : 35.600 s
% 284.12/36.55  # Maximum resident set size: 31004 pages
% 284.12/36.55  
% 284.12/36.55  # -------------------------------------------------
% 284.12/36.55  # User time                : 174.969 s
% 284.12/36.55  # System time              : 1.633 s
% 284.12/36.55  # Total time               : 176.601 s
% 284.12/36.55  # Maximum resident set size: 9660 pages
% 284.12/36.55  % E---3.1 exiting
% 284.12/36.55  % E exiting
%------------------------------------------------------------------------------