TSTP Solution File: CSR027+3 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR027+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n016.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  : 600s
% DateTime : Fri Jul 15 02:46:37 EDT 2022

% Result   : Theorem 10.47s 3.42s
% Output   : CNFRefutation 10.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   24 (  10 unt;   0 nHn;  24 RR)
%            Number of literals    :   44 (   0 equ;  24 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-4 aty)
%            Number of variables   :   20 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2446,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-57xl5qu5/input.p',i_0_2446) ).

cnf(i_0_318,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member2610_mt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-57xl5qu5/input.p',i_0_318) ).

cnf(i_0_2560,negated_conjecture,
    mtvisible(c_tptp_spindlecollectormt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-57xl5qu5/input.p',i_0_2560) ).

cnf(i_0_2559,negated_conjecture,
    ( ~ tptpcol_16_31868(X1)
    | ~ tptp_8_875(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-57xl5qu5/input.p',i_0_2559) ).

cnf(i_0_2115,plain,
    ( tptpcol_16_31868(X1)
    | ~ isa(X1,c_tptpcol_16_31868) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-57xl5qu5/input.p',i_0_2115) ).

cnf(i_0_260,plain,
    ( tptp_8_875(X1,f_relationallexistsfn(X1,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868))
    | ~ mtvisible(c_tptp_member2610_mt)
    | ~ isa(X1,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-57xl5qu5/input.p',i_0_260) ).

cnf(i_0_154,plain,
    isa(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-57xl5qu5/input.p',i_0_154) ).

cnf(i_0_261,plain,
    ( relationallexists(c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)
    | ~ mtvisible(c_tptp_member2610_mt) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-57xl5qu5/input.p',i_0_261) ).

cnf(i_0_772,plain,
    ( isa(f_relationallexistsfn(X1,X2,X3,X4),X4)
    | ~ isa(X1,X3)
    | ~ relationallexists(X2,X3,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-57xl5qu5/input.p',i_0_772) ).

cnf(c_0_2570,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    i_0_2446 ).

cnf(c_0_2571,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member2610_mt),
    i_0_318 ).

cnf(c_0_2572,negated_conjecture,
    mtvisible(c_tptp_spindlecollectormt),
    i_0_2560 ).

cnf(c_0_2573,negated_conjecture,
    ( ~ tptpcol_16_31868(X1)
    | ~ tptp_8_875(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,X1) ),
    i_0_2559 ).

cnf(c_0_2574,plain,
    ( tptpcol_16_31868(X1)
    | ~ isa(X1,c_tptpcol_16_31868) ),
    i_0_2115 ).

cnf(c_0_2575,plain,
    ( tptp_8_875(X1,f_relationallexistsfn(X1,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868))
    | ~ mtvisible(c_tptp_member2610_mt)
    | ~ isa(X1,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) ),
    i_0_260 ).

cnf(c_0_2576,plain,
    mtvisible(c_tptp_member2610_mt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2570,c_0_2571]),c_0_2572])]) ).

cnf(c_0_2577,negated_conjecture,
    ( ~ tptp_8_875(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,X1)
    | ~ isa(X1,c_tptpcol_16_31868) ),
    inference(spm,[status(thm)],[c_0_2573,c_0_2574]) ).

cnf(c_0_2578,plain,
    ( tptp_8_875(X1,f_relationallexistsfn(X1,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868))
    | ~ isa(X1,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2575,c_0_2576])]) ).

cnf(c_0_2579,plain,
    isa(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)),
    i_0_154 ).

cnf(c_0_2580,plain,
    ( relationallexists(c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)
    | ~ mtvisible(c_tptp_member2610_mt) ),
    i_0_261 ).

cnf(c_0_2581,negated_conjecture,
    ~ isa(f_relationallexistsfn(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868),c_tptpcol_16_31868),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2577,c_0_2578]),c_0_2579])]) ).

cnf(c_0_2582,plain,
    ( isa(f_relationallexistsfn(X1,X2,X3,X4),X4)
    | ~ isa(X1,X3)
    | ~ relationallexists(X2,X3,X4) ),
    i_0_772 ).

cnf(c_0_2583,plain,
    relationallexists(c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2580,c_0_2576])]) ).

cnf(c_0_2584,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2581,c_0_2582]),c_0_2579]),c_0_2583])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR027+3 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n016.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jun 11 04:02:12 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.59  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.59  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.59  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.59  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 10.47/3.42  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 10.47/3.42  # Version: 2.1pre011
% 10.47/3.42  # Preprocessing time       : 0.055 s
% 10.47/3.42  
% 10.47/3.42  # Proof found!
% 10.47/3.42  # SZS status Theorem
% 10.47/3.42  # SZS output start CNFRefutation
% See solution above
% 10.47/3.42  # Proof object total steps             : 24
% 10.47/3.42  # Proof object clause steps            : 15
% 10.47/3.42  # Proof object formula steps           : 9
% 10.47/3.42  # Proof object conjectures             : 6
% 10.47/3.42  # Proof object clause conjectures      : 4
% 10.47/3.42  # Proof object formula conjectures     : 2
% 10.47/3.42  # Proof object initial clauses used    : 9
% 10.47/3.42  # Proof object initial formulas used   : 9
% 10.47/3.42  # Proof object generating inferences   : 4
% 10.47/3.42  # Proof object simplifying inferences  : 11
% 10.47/3.42  # Training examples: 0 positive, 0 negative
% 10.47/3.42  # Parsed axioms                        : 2560
% 10.47/3.42  # Removed by relevancy pruning/SinE    : 0
% 10.47/3.42  # Initial clauses                      : 2560
% 10.47/3.42  # Removed in clause preprocessing      : 0
% 10.47/3.42  # Initial clauses in saturation        : 2560
% 10.47/3.42  # Processed clauses                    : 3209
% 10.47/3.42  # ...of these trivial                  : 272
% 10.47/3.42  # ...subsumed                          : 206
% 10.47/3.42  # ...remaining for further processing  : 2731
% 10.47/3.42  # Other redundant clauses eliminated   : 0
% 10.47/3.42  # Clauses deleted for lack of memory   : 0
% 10.47/3.42  # Backward-subsumed                    : 1
% 10.47/3.42  # Backward-rewritten                   : 68
% 10.47/3.42  # Generated clauses                    : 6603
% 10.47/3.42  # ...of the previous two non-trivial   : 6297
% 10.47/3.42  # Contextual simplify-reflections      : 12
% 10.47/3.42  # Paramodulations                      : 6603
% 10.47/3.42  # Factorizations                       : 0
% 10.47/3.42  # Equation resolutions                 : 0
% 10.47/3.42  # Propositional unsat checks           : 0
% 10.47/3.42  # Propositional unsat check successes  : 0
% 10.47/3.42  # Current number of processed clauses  : 2662
% 10.47/3.42  #    Positive orientable unit clauses  : 1145
% 10.47/3.42  #    Positive unorientable unit clauses: 0
% 10.47/3.42  #    Negative unit clauses             : 257
% 10.47/3.42  #    Non-unit-clauses                  : 1260
% 10.47/3.42  # Current number of unprocessed clauses: 5493
% 10.47/3.42  # ...number of literals in the above   : 9410
% 10.47/3.42  # Current number of archived formulas  : 0
% 10.47/3.42  # Current number of archived clauses   : 69
% 10.47/3.42  # Clause-clause subsumption calls (NU) : 292001
% 10.47/3.42  # Rec. Clause-clause subsumption calls : 265657
% 10.47/3.42  # Non-unit clause-clause subsumptions  : 218
% 10.47/3.42  # Unit Clause-clause subsumption calls : 122312
% 10.47/3.42  # Rewrite failures with RHS unbound    : 0
% 10.47/3.42  # BW rewrite match attempts            : 104
% 10.47/3.42  # BW rewrite match successes           : 14
% 10.47/3.42  # Condensation attempts                : 0
% 10.47/3.42  # Condensation successes               : 0
% 10.47/3.42  # Termbank termtop insertions          : 86122
% 10.47/3.42  
% 10.47/3.42  # -------------------------------------------------
% 10.47/3.42  # User time                : 0.235 s
% 10.47/3.42  # System time              : 0.023 s
% 10.47/3.42  # Total time               : 0.258 s
% 10.47/3.42  # ...preprocessing         : 0.055 s
% 10.47/3.42  # ...main loop             : 0.204 s
% 10.47/3.42  # Maximum resident set size: 23656 pages
% 10.47/3.42  
%------------------------------------------------------------------------------