TSTP Solution File: CSR231+1 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n013.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:20:48 EDT 2024

% Result   : Theorem 2.94s 1.42s
% Output   : CNFRefutation 2.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   32 (  20 unt;   0 def)
%            Number of atoms       :   47 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   29 (  14   ~;  11   |;   3   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   8 con; 0-0 aty)
%            Number of variables   :   18 (   0 sgn   7   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
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(mergeA2505,axiom,
    p__d__subclass(c__Translocation,c__Motion),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2505) ).

fof(mergeA2472,axiom,
    p__d__subclass(c__Transfer,c__Translocation),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2472) ).

fof(mergeA2481,axiom,
    p__d__subclass(c__Putting,c__Transfer),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2481) ).

fof(mergeA2483,axiom,
    p__d__subclass(c__Covering,c__Putting),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2483) ).

fof(miloA528,axiom,
    p__d__subclass(c__Painting,c__Covering),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',miloA528) ).

fof(commonSubclassEvent0382,conjecture,
    ? [X1] :
      ( p__d__subclass(X1,c__ContentDevelopment)
      & p__d__subclass(X1,c__Motion) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commonSubclassEvent0382) ).

fof(miloA542,axiom,
    p__d__subclass(c__ArtPainting,c__Painting),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',miloA542) ).

fof(miloA541,axiom,
    p__d__subclass(c__ArtPainting,c__ContentDevelopment),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',miloA541) ).

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

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

cnf(c_0_11,plain,
    p__d__subclass(c__Translocation,c__Motion),
    inference(split_conjunct,[status(thm)],[mergeA2505]) ).

cnf(c_0_12,plain,
    ( p__d__subclass(X1,c__Motion)
    | ~ p__d__subclass(X1,c__Translocation) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,plain,
    p__d__subclass(c__Transfer,c__Translocation),
    inference(split_conjunct,[status(thm)],[mergeA2472]) ).

cnf(c_0_14,plain,
    p__d__subclass(c__Transfer,c__Motion),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,plain,
    ( p__d__subclass(X1,c__Motion)
    | ~ p__d__subclass(X1,c__Transfer) ),
    inference(spm,[status(thm)],[c_0_10,c_0_14]) ).

cnf(c_0_16,plain,
    p__d__subclass(c__Putting,c__Transfer),
    inference(split_conjunct,[status(thm)],[mergeA2481]) ).

cnf(c_0_17,plain,
    p__d__subclass(c__Putting,c__Motion),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_18,plain,
    ( p__d__subclass(X1,c__Motion)
    | ~ p__d__subclass(X1,c__Putting) ),
    inference(spm,[status(thm)],[c_0_10,c_0_17]) ).

cnf(c_0_19,plain,
    p__d__subclass(c__Covering,c__Putting),
    inference(split_conjunct,[status(thm)],[mergeA2483]) ).

cnf(c_0_20,plain,
    p__d__subclass(c__Covering,c__Motion),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_21,plain,
    ( p__d__subclass(X1,c__Motion)
    | ~ p__d__subclass(X1,c__Covering) ),
    inference(spm,[status(thm)],[c_0_10,c_0_20]) ).

cnf(c_0_22,plain,
    p__d__subclass(c__Painting,c__Covering),
    inference(split_conjunct,[status(thm)],[miloA528]) ).

fof(c_0_23,negated_conjecture,
    ~ ? [X1] :
        ( p__d__subclass(X1,c__ContentDevelopment)
        & p__d__subclass(X1,c__Motion) ),
    inference(assume_negation,[status(cth)],[commonSubclassEvent0382]) ).

cnf(c_0_24,plain,
    p__d__subclass(c__Painting,c__Motion),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

fof(c_0_25,negated_conjecture,
    ! [X7881] :
      ( ~ p__d__subclass(X7881,c__ContentDevelopment)
      | ~ p__d__subclass(X7881,c__Motion) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).

cnf(c_0_26,plain,
    ( p__d__subclass(X1,c__Motion)
    | ~ p__d__subclass(X1,c__Painting) ),
    inference(spm,[status(thm)],[c_0_10,c_0_24]) ).

cnf(c_0_27,plain,
    p__d__subclass(c__ArtPainting,c__Painting),
    inference(split_conjunct,[status(thm)],[miloA542]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ p__d__subclass(X1,c__ContentDevelopment)
    | ~ p__d__subclass(X1,c__Motion) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_29,plain,
    p__d__subclass(c__ArtPainting,c__Motion),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,plain,
    p__d__subclass(c__ArtPainting,c__ContentDevelopment),
    inference(split_conjunct,[status(thm)],[miloA541]) ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : CSR231+1 : TPTP v8.2.0. Released v7.3.0.
% 0.08/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n013.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Sun May 19 01:07:23 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.21/0.49  Running first-order model finding
% 0.21/0.49  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.94/1.42  # Version: 3.1.0
% 2.94/1.42  # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.94/1.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.94/1.42  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.94/1.42  # Starting new_bool_3 with 300s (1) cores
% 2.94/1.42  # Starting new_bool_1 with 300s (1) cores
% 2.94/1.42  # Starting sh5l with 300s (1) cores
% 2.94/1.42  # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 22090 completed with status 0
% 2.94/1.42  # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 2.94/1.42  # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.94/1.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.94/1.42  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.94/1.42  # No SInE strategy applied
% 2.94/1.42  # Search class: FGHSS-SMLM31-MFFFFFNN
% 2.94/1.42  # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 2.94/1.42  # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 2.94/1.42  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 2.94/1.42  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 113s (1) cores
% 2.94/1.42  # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 113s (1) cores
% 2.94/1.42  # Starting G-E--_012_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 113s (1) cores
% 2.94/1.42  # G----_0021_C18_F1_SE_CS_SP_S4S with pid 22133 completed with status 0
% 2.94/1.42  # Result found by G----_0021_C18_F1_SE_CS_SP_S4S
% 2.94/1.42  # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.94/1.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.94/1.42  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.94/1.42  # No SInE strategy applied
% 2.94/1.42  # Search class: FGHSS-SMLM31-MFFFFFNN
% 2.94/1.42  # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 2.94/1.42  # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 2.94/1.42  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 2.94/1.42  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 113s (1) cores
% 2.94/1.42  # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 113s (1) cores
% 2.94/1.42  # Preprocessing time       : 0.105 s
% 2.94/1.42  
% 2.94/1.42  # Proof found!
% 2.94/1.42  # SZS status Theorem
% 2.94/1.42  # SZS output start CNFRefutation
% See solution above
% 2.94/1.42  # Parsed axioms                        : 7433
% 2.94/1.42  # Removed by relevancy pruning/SinE    : 0
% 2.94/1.42  # Initial clauses                      : 10860
% 2.94/1.42  # Removed in clause preprocessing      : 20
% 2.94/1.42  # Initial clauses in saturation        : 10840
% 2.94/1.42  # Processed clauses                    : 1281
% 2.94/1.42  # ...of these trivial                  : 0
% 2.94/1.42  # ...subsumed                          : 0
% 2.94/1.42  # ...remaining for further processing  : 1281
% 2.94/1.42  # Other redundant clauses eliminated   : 0
% 2.94/1.42  # Clauses deleted for lack of memory   : 0
% 2.94/1.42  # Backward-subsumed                    : 0
% 2.94/1.42  # Backward-rewritten                   : 0
% 2.94/1.42  # Generated clauses                    : 2541
% 2.94/1.42  # ...of the previous two non-redundant : 2435
% 2.94/1.42  # ...aggressively subsumed             : 0
% 2.94/1.42  # Contextual simplify-reflections      : 0
% 2.94/1.42  # Paramodulations                      : 2541
% 2.94/1.42  # Factorizations                       : 0
% 2.94/1.42  # NegExts                              : 0
% 2.94/1.42  # Equation resolutions                 : 0
% 2.94/1.42  # Disequality decompositions           : 0
% 2.94/1.42  # Total rewrite steps                  : 105
% 2.94/1.42  # ...of those cached                   : 11
% 2.94/1.42  # Propositional unsat checks           : 0
% 2.94/1.42  #    Propositional check models        : 0
% 2.94/1.42  #    Propositional check unsatisfiable : 0
% 2.94/1.42  #    Propositional clauses             : 0
% 2.94/1.42  #    Propositional clauses after purity: 0
% 2.94/1.42  #    Propositional unsat core size     : 0
% 2.94/1.42  #    Propositional preprocessing time  : 0.000
% 2.94/1.42  #    Propositional encoding time       : 0.000
% 2.94/1.42  #    Propositional solver time         : 0.000
% 2.94/1.42  #    Success case prop preproc time    : 0.000
% 2.94/1.42  #    Success case prop encoding time   : 0.000
% 2.94/1.42  #    Success case prop solver time     : 0.000
% 2.94/1.42  # Current number of processed clauses  : 1281
% 2.94/1.42  #    Positive orientable unit clauses  : 1101
% 2.94/1.42  #    Positive unorientable unit clauses: 0
% 2.94/1.42  #    Negative unit clauses             : 81
% 2.94/1.42  #    Non-unit-clauses                  : 99
% 2.94/1.42  # Current number of unprocessed clauses: 11991
% 2.94/1.42  # ...number of literals in the above   : 28056
% 2.94/1.42  # Current number of archived formulas  : 0
% 2.94/1.42  # Current number of archived clauses   : 0
% 2.94/1.42  # Clause-clause subsumption calls (NU) : 3770
% 2.94/1.42  # Rec. Clause-clause subsumption calls : 3769
% 2.94/1.42  # Non-unit clause-clause subsumptions  : 0
% 2.94/1.42  # Unit Clause-clause subsumption calls : 29997
% 2.94/1.42  # Rewrite failures with RHS unbound    : 0
% 2.94/1.42  # BW rewrite match attempts            : 0
% 2.94/1.42  # BW rewrite match successes           : 0
% 2.94/1.42  # Condensation attempts                : 0
% 2.94/1.42  # Condensation successes               : 0
% 2.94/1.42  # Termbank termtop insertions          : 524546
% 2.94/1.42  # Search garbage collected termcells   : 89336
% 2.94/1.42  
% 2.94/1.42  # -------------------------------------------------
% 2.94/1.42  # User time                : 0.646 s
% 2.94/1.42  # System time              : 0.068 s
% 2.94/1.42  # Total time               : 0.714 s
% 2.94/1.42  # Maximum resident set size: 31004 pages
% 2.94/1.42  
% 2.94/1.42  # -------------------------------------------------
% 2.94/1.42  # User time                : 1.361 s
% 2.94/1.42  # System time              : 0.219 s
% 2.94/1.42  # Total time               : 1.581 s
% 2.94/1.42  # Maximum resident set size: 9660 pages
% 2.94/1.42  % E---3.1 exiting
%------------------------------------------------------------------------------