TSTP Solution File: CSR056+5 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR056+5 : TPTP v8.1.0. Bugfixed v3.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n025.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:47:08 EDT 2022

% Result   : Theorem 20.29s 12.84s
% Output   : CNFRefutation 20.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   21 (  12 unt;   0 nHn;  21 RR)
%            Number of literals    :   34 (   0 equ;  17 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :   11 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2473,plain,
    ( tptpofobject(X1,f_tptpquantityfn_17(n_385))
    | ~ supplies(X1)
    | ~ mtvisible(c_tptp_member3717_mt) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rqu3ljju/input.p',i_0_2473) ).

cnf(i_0_2864,negated_conjecture,
    mtvisible(c_tptp_member3717_mt),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rqu3ljju/input.p',i_0_2864) ).

cnf(i_0_2863,negated_conjecture,
    ~ tptpofobject(c_tptpartsupplies,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rqu3ljju/input.p',i_0_2863) ).

cnf(i_0_2430,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rqu3ljju/input.p',i_0_2430) ).

cnf(i_0_25,plain,
    genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rqu3ljju/input.p',i_0_25) ).

cnf(i_0_1295,plain,
    ( supplies(X1)
    | ~ artsupplies(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rqu3ljju/input.p',i_0_1295) ).

cnf(i_0_867,plain,
    ( artsupplies(c_tptpartsupplies)
    | ~ mtvisible(c_cyclistsmt) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rqu3ljju/input.p',i_0_867) ).

cnf(i_0_614,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rqu3ljju/input.p',i_0_614) ).

cnf(c_0_2873,plain,
    ( tptpofobject(X1,f_tptpquantityfn_17(n_385))
    | ~ supplies(X1)
    | ~ mtvisible(c_tptp_member3717_mt) ),
    i_0_2473 ).

cnf(c_0_2874,negated_conjecture,
    mtvisible(c_tptp_member3717_mt),
    i_0_2864 ).

cnf(c_0_2875,negated_conjecture,
    ~ tptpofobject(c_tptpartsupplies,X1),
    i_0_2863 ).

cnf(c_0_2876,plain,
    ( tptpofobject(X1,f_tptpquantityfn_17(n_385))
    | ~ supplies(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2873,c_0_2874])]) ).

cnf(c_0_2877,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    i_0_2430 ).

cnf(c_0_2878,plain,
    genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
    i_0_25 ).

cnf(c_0_2879,plain,
    ( supplies(X1)
    | ~ artsupplies(X1) ),
    i_0_1295 ).

cnf(c_0_2880,plain,
    ( artsupplies(c_tptpartsupplies)
    | ~ mtvisible(c_cyclistsmt) ),
    i_0_867 ).

cnf(c_0_2881,negated_conjecture,
    ~ supplies(c_tptpartsupplies),
    inference(spm,[status(thm)],[c_0_2875,c_0_2876]) ).

cnf(c_0_2882,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    i_0_614 ).

cnf(c_0_2883,plain,
    mtvisible(c_tptp_spindleheadmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2877,c_0_2878]),c_0_2874])]) ).

cnf(c_0_2884,plain,
    ~ mtvisible(c_cyclistsmt),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2879,c_0_2880]),c_0_2881]) ).

cnf(c_0_2885,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2877,c_0_2882]),c_0_2883])]),c_0_2884]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR056+5 : TPTP v8.1.0. Bugfixed v3.5.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n025.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Fri Jun 10 07:08:23 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 9.43/9.59  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.43/9.59  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 9.43/9.59  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 9.43/9.59  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 20.29/12.84  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 20.29/12.84  # Version: 2.1pre011
% 20.29/12.84  # Preprocessing time       : 0.074 s
% 20.29/12.84  
% 20.29/12.84  # Proof found!
% 20.29/12.84  # SZS status Theorem
% 20.29/12.84  # SZS output start CNFRefutation
% See solution above
% 20.29/12.84  # Proof object total steps             : 21
% 20.29/12.84  # Proof object clause steps            : 13
% 20.29/12.84  # Proof object formula steps           : 8
% 20.29/12.84  # Proof object conjectures             : 5
% 20.29/12.84  # Proof object clause conjectures      : 3
% 20.29/12.84  # Proof object formula conjectures     : 2
% 20.29/12.84  # Proof object initial clauses used    : 8
% 20.29/12.84  # Proof object initial formulas used   : 8
% 20.29/12.84  # Proof object generating inferences   : 4
% 20.29/12.84  # Proof object simplifying inferences  : 8
% 20.29/12.84  # Training examples: 0 positive, 0 negative
% 20.29/12.84  # Parsed axioms                        : 2862
% 20.29/12.84  # Removed by relevancy pruning/SinE    : 0
% 20.29/12.84  # Initial clauses                      : 2862
% 20.29/12.84  # Removed in clause preprocessing      : 0
% 20.29/12.84  # Initial clauses in saturation        : 2862
% 20.29/12.84  # Processed clauses                    : 3251
% 20.29/12.84  # ...of these trivial                  : 179
% 20.29/12.84  # ...subsumed                          : 79
% 20.29/12.84  # ...remaining for further processing  : 2992
% 20.29/12.84  # Other redundant clauses eliminated   : 5
% 20.29/12.84  # Clauses deleted for lack of memory   : 0
% 20.29/12.84  # Backward-subsumed                    : 6
% 20.29/12.84  # Backward-rewritten                   : 187
% 20.29/12.84  # Generated clauses                    : 5535
% 20.29/12.84  # ...of the previous two non-trivial   : 5132
% 20.29/12.84  # Contextual simplify-reflections      : 3
% 20.29/12.84  # Paramodulations                      : 5530
% 20.29/12.84  # Factorizations                       : 0
% 20.29/12.84  # Equation resolutions                 : 5
% 20.29/12.84  # Propositional unsat checks           : 0
% 20.29/12.84  # Propositional unsat check successes  : 0
% 20.29/12.84  # Current number of processed clauses  : 2794
% 20.29/12.84  #    Positive orientable unit clauses  : 1347
% 20.29/12.84  #    Positive unorientable unit clauses: 0
% 20.29/12.84  #    Negative unit clauses             : 149
% 20.29/12.84  #    Non-unit-clauses                  : 1298
% 20.29/12.84  # Current number of unprocessed clauses: 4325
% 20.29/12.84  # ...number of literals in the above   : 6895
% 20.29/12.84  # Current number of archived formulas  : 0
% 20.29/12.84  # Current number of archived clauses   : 193
% 20.29/12.84  # Clause-clause subsumption calls (NU) : 268206
% 20.29/12.84  # Rec. Clause-clause subsumption calls : 204981
% 20.29/12.84  # Non-unit clause-clause subsumptions  : 68
% 20.29/12.84  # Unit Clause-clause subsumption calls : 130727
% 20.29/12.84  # Rewrite failures with RHS unbound    : 0
% 20.29/12.84  # BW rewrite match attempts            : 285
% 20.29/12.84  # BW rewrite match successes           : 113
% 20.29/12.84  # Condensation attempts                : 0
% 20.29/12.84  # Condensation successes               : 0
% 20.29/12.84  # Termbank termtop insertions          : 87060
% 20.29/12.84  
% 20.29/12.84  # -------------------------------------------------
% 20.29/12.84  # User time                : 0.298 s
% 20.29/12.84  # System time              : 0.017 s
% 20.29/12.84  # Total time               : 0.315 s
% 20.29/12.84  # ...preprocessing         : 0.074 s
% 20.29/12.84  # ...main loop             : 0.241 s
% 20.29/12.84  # Maximum resident set size: 25312 pages
% 20.29/12.84  
%------------------------------------------------------------------------------