↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR073+5 : TPTP v8.1.0. Bugfixed v3.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n005.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:27 EDT 2022

% Result   : Theorem 22.51s 12.74s
% Output   : CNFRefutation 22.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   10 (   6 unt;   0 nHn;  10 RR)
%            Number of literals    :   14 (   0 equ;   7 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   11 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2654,negated_conjecture,
    ~ tptptypes_5_387(X1,c_pushingababycarriage),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1jantez5/input.p',i_0_2654) ).

cnf(i_0_1343,plain,
    ( tptptypes_5_387(X1,X2)
    | ~ tptptypes_6_388(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1jantez5/input.p',i_0_1343) ).

cnf(i_0_718,plain,
    ( tptptypes_6_388(X1,X2)
    | ~ tptptypes_7_396(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1jantez5/input.p',i_0_718) ).

cnf(i_0_441,plain,
    tptptypes_7_396(c_tptpcol_16_13522,c_pushingababycarriage),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1jantez5/input.p',i_0_441) ).

cnf(c_0_2659,negated_conjecture,
    ~ tptptypes_5_387(X1,c_pushingababycarriage),
    i_0_2654 ).

cnf(c_0_2660,plain,
    ( tptptypes_5_387(X1,X2)
    | ~ tptptypes_6_388(X1,X2) ),
    i_0_1343 ).

cnf(c_0_2661,plain,
    ( tptptypes_6_388(X1,X2)
    | ~ tptptypes_7_396(X1,X2) ),
    i_0_718 ).

cnf(c_0_2662,plain,
    tptptypes_7_396(c_tptpcol_16_13522,c_pushingababycarriage),
    i_0_441 ).

cnf(c_0_2663,negated_conjecture,
    ~ tptptypes_6_388(X1,c_pushingababycarriage),
    inference(spm,[status(thm)],[c_0_2659,c_0_2660]) ).

cnf(c_0_2664,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2661,c_0_2662]),c_0_2663]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : CSR073+5 : TPTP v8.1.0. Bugfixed v3.5.0.
% 0.04/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n005.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jun 11 05:43:41 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.19/0.46  # ENIGMATIC: Selected SinE mode:
% 9.06/9.29  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.06/9.29  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 9.06/9.29  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 9.06/9.29  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 22.51/12.74  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 22.51/12.74  # Version: 2.1pre011
% 22.51/12.74  # Preprocessing time       : 0.052 s
% 22.51/12.74  
% 22.51/12.74  # Proof found!
% 22.51/12.74  # SZS status Theorem
% 22.51/12.74  # SZS output start CNFRefutation
% See solution above
% 22.51/12.74  # Proof object total steps             : 10
% 22.51/12.74  # Proof object clause steps            : 6
% 22.51/12.74  # Proof object formula steps           : 4
% 22.51/12.74  # Proof object conjectures             : 3
% 22.51/12.74  # Proof object clause conjectures      : 2
% 22.51/12.74  # Proof object formula conjectures     : 1
% 22.51/12.74  # Proof object initial clauses used    : 4
% 22.51/12.74  # Proof object initial formulas used   : 4
% 22.51/12.74  # Proof object generating inferences   : 2
% 22.51/12.74  # Proof object simplifying inferences  : 1
% 22.51/12.74  # Training examples: 0 positive, 0 negative
% 22.51/12.74  # Parsed axioms                        : 2653
% 22.51/12.74  # Removed by relevancy pruning/SinE    : 0
% 22.51/12.74  # Initial clauses                      : 2653
% 22.51/12.74  # Removed in clause preprocessing      : 0
% 22.51/12.74  # Initial clauses in saturation        : 2653
% 22.51/12.74  # Processed clauses                    : 4404
% 22.51/12.74  # ...of these trivial                  : 471
% 22.51/12.74  # ...subsumed                          : 269
% 22.51/12.74  # ...remaining for further processing  : 3663
% 22.51/12.74  # Other redundant clauses eliminated   : 5
% 22.51/12.74  # Clauses deleted for lack of memory   : 0
% 22.51/12.74  # Backward-subsumed                    : 2
% 22.51/12.74  # Backward-rewritten                   : 74
% 22.51/12.74  # Generated clauses                    : 8547
% 22.51/12.74  # ...of the previous two non-trivial   : 7902
% 22.51/12.74  # Contextual simplify-reflections      : 0
% 22.51/12.74  # Paramodulations                      : 8542
% 22.51/12.74  # Factorizations                       : 0
% 22.51/12.74  # Equation resolutions                 : 5
% 22.51/12.74  # Propositional unsat checks           : 0
% 22.51/12.74  # Propositional unsat check successes  : 0
% 22.51/12.74  # Current number of processed clauses  : 3582
% 22.51/12.74  #    Positive orientable unit clauses  : 1594
% 22.51/12.74  #    Positive unorientable unit clauses: 0
% 22.51/12.74  #    Negative unit clauses             : 681
% 22.51/12.74  #    Non-unit-clauses                  : 1307
% 22.51/12.74  # Current number of unprocessed clauses: 5844
% 22.51/12.74  # ...number of literals in the above   : 10175
% 22.51/12.74  # Current number of archived formulas  : 0
% 22.51/12.74  # Current number of archived clauses   : 76
% 22.51/12.74  # Clause-clause subsumption calls (NU) : 318549
% 22.51/12.74  # Rec. Clause-clause subsumption calls : 257129
% 22.51/12.74  # Non-unit clause-clause subsumptions  : 92
% 22.51/12.74  # Unit Clause-clause subsumption calls : 364058
% 22.51/12.74  # Rewrite failures with RHS unbound    : 0
% 22.51/12.74  # BW rewrite match attempts            : 322
% 22.51/12.74  # BW rewrite match successes           : 63
% 22.51/12.74  # Condensation attempts                : 0
% 22.51/12.74  # Condensation successes               : 0
% 22.51/12.74  # Termbank termtop insertions          : 106334
% 22.51/12.74  
% 22.51/12.74  # -------------------------------------------------
% 22.51/12.74  # User time                : 0.435 s
% 22.51/12.74  # System time              : 0.022 s
% 22.51/12.74  # Total time               : 0.457 s
% 22.51/12.74  # ...preprocessing         : 0.052 s
% 22.51/12.74  # ...main loop             : 0.405 s
% 22.51/12.74  # Maximum resident set size: 29952 pages
% 22.51/12.74  
%------------------------------------------------------------------------------