↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : MGT071+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep  8 06:08:02 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
    ( ~ in_closed(X1,X2,X3)
    | ~ in_closed(X1,X4,X5)
    | ~ axis_conflict(X4,X5,X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ipt_z3dl/input.p',i_0_6) ).

cnf(i_0_16,hypothesis,
    axis_conflict(n0,n5,n10,n15),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ipt_z3dl/input.p',i_0_16) ).

cnf(i_0_46,negated_conjecture,
    in_closed(esk4_0,n0,n5),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ipt_z3dl/input.p',i_0_46) ).

cnf(i_0_45,negated_conjecture,
    in_closed(esk4_0,n10,n15),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ipt_z3dl/input.p',i_0_45) ).

cnf(c_0_51,plain,
    ( ~ in_closed(X1,X2,X3)
    | ~ in_closed(X1,X4,X5)
    | ~ axis_conflict(X4,X5,X2,X3) ),
    i_0_6 ).

cnf(c_0_52,hypothesis,
    axis_conflict(n0,n5,n10,n15),
    i_0_16 ).

cnf(c_0_53,hypothesis,
    ( ~ in_closed(X1,n0,n5)
    | ~ in_closed(X1,n10,n15) ),
    inference(spm,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_54,negated_conjecture,
    in_closed(esk4_0,n0,n5),
    i_0_46 ).

cnf(c_0_55,negated_conjecture,
    in_closed(esk4_0,n10,n15),
    i_0_45 ).

cnf(c_0_56,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT071+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.36  % Computer : n011.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep  7 13:54:47 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.46  # ENIGMATIC: Selected SinE mode:
% 0.22/0.46  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.22/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.22/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 10.68/3.80  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 10.68/3.80  # Version: 2.1pre011
% 10.68/3.80  # Preprocessing time       : 0.015 s
% 10.68/3.80  
% 10.68/3.80  # Proof found!
% 10.68/3.80  # SZS status Theorem
% 10.68/3.80  # SZS output start CNFRefutation
% See solution above
% 10.68/3.80  # Proof object total steps             : 10
% 10.68/3.80  # Proof object clause steps            : 6
% 10.68/3.80  # Proof object formula steps           : 4
% 10.68/3.80  # Proof object conjectures             : 5
% 10.68/3.80  # Proof object clause conjectures      : 3
% 10.68/3.80  # Proof object formula conjectures     : 2
% 10.68/3.80  # Proof object initial clauses used    : 4
% 10.68/3.80  # Proof object initial formulas used   : 4
% 10.68/3.80  # Proof object generating inferences   : 2
% 10.68/3.80  # Proof object simplifying inferences  : 2
% 10.68/3.80  # Training examples: 0 positive, 0 negative
% 10.68/3.80  # Parsed axioms                        : 65
% 10.68/3.80  # Removed by relevancy pruning/SinE    : 0
% 10.68/3.80  # Initial clauses                      : 65
% 10.68/3.80  # Removed in clause preprocessing      : 0
% 10.68/3.80  # Initial clauses in saturation        : 65
% 10.68/3.80  # Processed clauses                    : 66
% 10.68/3.80  # ...of these trivial                  : 0
% 10.68/3.80  # ...subsumed                          : 13
% 10.68/3.80  # ...remaining for further processing  : 53
% 10.68/3.80  # Other redundant clauses eliminated   : 2
% 10.68/3.80  # Clauses deleted for lack of memory   : 0
% 10.68/3.80  # Backward-subsumed                    : 0
% 10.68/3.80  # Backward-rewritten                   : 0
% 10.68/3.80  # Generated clauses                    : 64
% 10.68/3.80  # ...of the previous two non-trivial   : 45
% 10.68/3.80  # Contextual simplify-reflections      : 0
% 10.68/3.80  # Paramodulations                      : 60
% 10.68/3.80  # Factorizations                       : 2
% 10.68/3.80  # Equation resolutions                 : 2
% 10.68/3.80  # Propositional unsat checks           : 0
% 10.68/3.80  # Propositional unsat check successes  : 0
% 10.68/3.80  # Current number of processed clauses  : 51
% 10.68/3.80  #    Positive orientable unit clauses  : 6
% 10.68/3.80  #    Positive unorientable unit clauses: 0
% 10.68/3.80  #    Negative unit clauses             : 1
% 10.68/3.80  #    Non-unit-clauses                  : 44
% 10.68/3.80  # Current number of unprocessed clauses: 39
% 10.68/3.80  # ...number of literals in the above   : 85
% 10.68/3.80  # Current number of archived formulas  : 0
% 10.68/3.80  # Current number of archived clauses   : 0
% 10.68/3.80  # Clause-clause subsumption calls (NU) : 250
% 10.68/3.80  # Rec. Clause-clause subsumption calls : 198
% 10.68/3.80  # Non-unit clause-clause subsumptions  : 13
% 10.68/3.80  # Unit Clause-clause subsumption calls : 0
% 10.68/3.80  # Rewrite failures with RHS unbound    : 0
% 10.68/3.80  # BW rewrite match attempts            : 0
% 10.68/3.80  # BW rewrite match successes           : 0
% 10.68/3.80  # Condensation attempts                : 0
% 10.68/3.80  # Condensation successes               : 0
% 10.68/3.80  # Termbank termtop insertions          : 1515
% 10.68/3.80  
% 10.68/3.80  # -------------------------------------------------
% 10.68/3.80  # User time                : 0.016 s
% 10.68/3.80  # System time              : 0.002 s
% 10.68/3.80  # Total time               : 0.018 s
% 10.68/3.80  # ...preprocessing         : 0.015 s
% 10.68/3.80  # ...main loop             : 0.002 s
% 10.68/3.80  # Maximum resident set size: 6400 pages
% 10.68/3.80  
%------------------------------------------------------------------------------