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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR056+6 : TPTP v8.1.0. Bugfixed v5.3.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 76.88s 69.56s
% Output   : CNFRefutation 76.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   22 (  12 unt;   0 nHn;  22 RR)
%            Number of literals    :   36 (   0 equ;  18 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   :   12 (   2 sgn)

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

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

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

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

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

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

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

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

cnf(c_0_3591,plain,
    ( tptpofobject(X1,f_tptpquantityfn_17(n_385))
    | ~ supplies(X1)
    | ~ mtvisible(c_tptp_member3717_mt) ),
    i_0_93 ).

cnf(c_0_3592,negated_conjecture,
    mtvisible(c_tptp_member3717_mt),
    i_0_3582 ).

cnf(c_0_3593,plain,
    ( tptpofobject(X1,f_tptpquantityfn_17(n_385))
    | ~ supplies(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3591,c_0_3592])]) ).

cnf(c_0_3594,plain,
    ( supplies(X1)
    | ~ artsupplies(X1) ),
    i_0_26 ).

cnf(c_0_3595,negated_conjecture,
    ~ tptpofobject(c_tptpartsupplies,X1),
    i_0_3581 ).

cnf(c_0_3596,plain,
    ( tptpofobject(X1,f_tptpquantityfn_17(n_385))
    | ~ artsupplies(X1) ),
    inference(spm,[status(thm)],[c_0_3593,c_0_3594]) ).

cnf(c_0_3597,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    i_0_2729 ).

cnf(c_0_3598,plain,
    genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
    i_0_289 ).

cnf(c_0_3599,negated_conjecture,
    ~ artsupplies(c_tptpartsupplies),
    inference(spm,[status(thm)],[c_0_3595,c_0_3596]) ).

cnf(c_0_3600,plain,
    ( artsupplies(c_tptpartsupplies)
    | ~ mtvisible(c_cyclistsmt) ),
    i_0_1843 ).

cnf(c_0_3601,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    i_0_1284 ).

cnf(c_0_3602,plain,
    mtvisible(c_tptp_spindleheadmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3597,c_0_3598]),c_0_3592])]) ).

cnf(c_0_3603,plain,
    ~ mtvisible(c_cyclistsmt),
    inference(spm,[status(thm)],[c_0_3599,c_0_3600]) ).

cnf(c_0_3604,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3597,c_0_3601]),c_0_3602])]),c_0_3603]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : CSR056+6 : TPTP v8.1.0. Bugfixed v5.3.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n025.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jun  9 18:11:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 65.90/66.09  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 65.90/66.09  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 65.90/66.09  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 65.90/66.09  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 76.88/69.56  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 76.88/69.56  # Version: 2.1pre011
% 76.88/69.56  # Preprocessing time       : 0.075 s
% 76.88/69.56  
% 76.88/69.56  # Proof found!
% 76.88/69.56  # SZS status Theorem
% 76.88/69.56  # SZS output start CNFRefutation
% See solution above
% 76.88/69.56  # Proof object total steps             : 22
% 76.88/69.56  # Proof object clause steps            : 14
% 76.88/69.56  # Proof object formula steps           : 8
% 76.88/69.56  # Proof object conjectures             : 5
% 76.88/69.56  # Proof object clause conjectures      : 3
% 76.88/69.56  # Proof object formula conjectures     : 2
% 76.88/69.56  # Proof object initial clauses used    : 8
% 76.88/69.56  # Proof object initial formulas used   : 8
% 76.88/69.56  # Proof object generating inferences   : 5
% 76.88/69.56  # Proof object simplifying inferences  : 7
% 76.88/69.56  # Training examples: 0 positive, 0 negative
% 76.88/69.56  # Parsed axioms                        : 3580
% 76.88/69.56  # Removed by relevancy pruning/SinE    : 0
% 76.88/69.56  # Initial clauses                      : 3580
% 76.88/69.56  # Removed in clause preprocessing      : 0
% 76.88/69.56  # Initial clauses in saturation        : 3580
% 76.88/69.56  # Processed clauses                    : 4276
% 76.88/69.56  # ...of these trivial                  : 407
% 76.88/69.56  # ...subsumed                          : 80
% 76.88/69.56  # ...remaining for further processing  : 3788
% 76.88/69.56  # Other redundant clauses eliminated   : 9
% 76.88/69.56  # Clauses deleted for lack of memory   : 0
% 76.88/69.56  # Backward-subsumed                    : 3
% 76.88/69.56  # Backward-rewritten                   : 163
% 76.88/69.56  # Generated clauses                    : 7636
% 76.88/69.56  # ...of the previous two non-trivial   : 6829
% 76.88/69.56  # Contextual simplify-reflections      : 11
% 76.88/69.56  # Paramodulations                      : 7627
% 76.88/69.56  # Factorizations                       : 0
% 76.88/69.56  # Equation resolutions                 : 9
% 76.88/69.56  # Propositional unsat checks           : 0
% 76.88/69.56  # Propositional unsat check successes  : 0
% 76.88/69.56  # Current number of processed clauses  : 3613
% 76.88/69.56  #    Positive orientable unit clauses  : 1835
% 76.88/69.56  #    Positive unorientable unit clauses: 0
% 76.88/69.56  #    Negative unit clauses             : 313
% 76.88/69.56  #    Non-unit-clauses                  : 1465
% 76.88/69.56  # Current number of unprocessed clauses: 5535
% 76.88/69.56  # ...number of literals in the above   : 9815
% 76.88/69.56  # Current number of archived formulas  : 0
% 76.88/69.56  # Current number of archived clauses   : 166
% 76.88/69.56  # Clause-clause subsumption calls (NU) : 214200
% 76.88/69.56  # Rec. Clause-clause subsumption calls : 196381
% 76.88/69.56  # Non-unit clause-clause subsumptions  : 75
% 76.88/69.56  # Unit Clause-clause subsumption calls : 148539
% 76.88/69.56  # Rewrite failures with RHS unbound    : 0
% 76.88/69.56  # BW rewrite match attempts            : 1683
% 76.88/69.56  # BW rewrite match successes           : 103
% 76.88/69.56  # Condensation attempts                : 0
% 76.88/69.56  # Condensation successes               : 0
% 76.88/69.56  # Termbank termtop insertions          : 115031
% 76.88/69.56  
% 76.88/69.56  # -------------------------------------------------
% 76.88/69.56  # User time                : 0.359 s
% 76.88/69.56  # System time              : 0.015 s
% 76.88/69.56  # Total time               : 0.374 s
% 76.88/69.56  # ...preprocessing         : 0.075 s
% 76.88/69.56  # ...main loop             : 0.299 s
% 76.88/69.56  # Maximum resident set size: 29684 pages
% 76.88/69.56  
%------------------------------------------------------------------------------