↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n004.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 : Tue Jul 19 00:08:48 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_50,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1d14hub3/input.p',i_0_50) ).

cnf(i_0_69,negated_conjecture,
    member(esk7_0,intersection(complement(esk6_0),esk6_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1d14hub3/input.p',i_0_69) ).

cnf(i_0_6,plain,
    ( ~ member(X1,X2)
    | ~ member(X1,complement(X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1d14hub3/input.p',i_0_6) ).

cnf(i_0_49,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X3,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1d14hub3/input.p',i_0_49) ).

cnf(c_0_74,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    i_0_50 ).

cnf(c_0_75,negated_conjecture,
    member(esk7_0,intersection(complement(esk6_0),esk6_0)),
    i_0_69 ).

cnf(c_0_76,plain,
    ( ~ member(X1,X2)
    | ~ member(X1,complement(X2)) ),
    i_0_6 ).

cnf(c_0_77,negated_conjecture,
    member(esk7_0,complement(esk6_0)),
    inference(spm,[status(thm)],[c_0_74,c_0_75]) ).

cnf(c_0_78,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X3,X2)) ),
    i_0_49 ).

cnf(c_0_79,plain,
    ~ member(esk7_0,esk6_0),
    inference(spm,[status(thm)],[c_0_76,c_0_77]) ).

cnf(c_0_80,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_75]),c_0_79]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET060+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n004.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sat Jul  9 15:57:39 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 6.60/2.20  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 6.60/2.20  # Version: 2.1pre011
% 6.60/2.20  # Preprocessing time       : 0.013 s
% 6.60/2.20  
% 6.60/2.20  # Proof found!
% 6.60/2.20  # SZS status Theorem
% 6.60/2.20  # SZS output start CNFRefutation
% See solution above
% 6.60/2.20  # Proof object total steps             : 11
% 6.60/2.20  # Proof object clause steps            : 7
% 6.60/2.20  # Proof object formula steps           : 4
% 6.60/2.20  # Proof object conjectures             : 4
% 6.60/2.20  # Proof object clause conjectures      : 3
% 6.60/2.20  # Proof object formula conjectures     : 1
% 6.60/2.20  # Proof object initial clauses used    : 4
% 6.60/2.20  # Proof object initial formulas used   : 4
% 6.60/2.20  # Proof object generating inferences   : 3
% 6.60/2.20  # Proof object simplifying inferences  : 1
% 6.60/2.20  # Training examples: 0 positive, 0 negative
% 6.60/2.20  # Parsed axioms                        : 82
% 6.60/2.20  # Removed by relevancy pruning/SinE    : 0
% 6.60/2.20  # Initial clauses                      : 82
% 6.60/2.20  # Removed in clause preprocessing      : 0
% 6.60/2.20  # Initial clauses in saturation        : 82
% 6.60/2.20  # Processed clauses                    : 86
% 6.60/2.20  # ...of these trivial                  : 0
% 6.60/2.20  # ...subsumed                          : 0
% 6.60/2.20  # ...remaining for further processing  : 85
% 6.60/2.20  # Other redundant clauses eliminated   : 5
% 6.60/2.20  # Clauses deleted for lack of memory   : 0
% 6.60/2.20  # Backward-subsumed                    : 0
% 6.60/2.20  # Backward-rewritten                   : 0
% 6.60/2.20  # Generated clauses                    : 207
% 6.60/2.20  # ...of the previous two non-trivial   : 190
% 6.60/2.20  # Contextual simplify-reflections      : 0
% 6.60/2.20  # Paramodulations                      : 200
% 6.60/2.20  # Factorizations                       : 0
% 6.60/2.20  # Equation resolutions                 : 7
% 6.60/2.20  # Propositional unsat checks           : 0
% 6.60/2.20  # Propositional unsat check successes  : 0
% 6.60/2.20  # Current number of processed clauses  : 81
% 6.60/2.20  #    Positive orientable unit clauses  : 13
% 6.60/2.20  #    Positive unorientable unit clauses: 0
% 6.60/2.20  #    Negative unit clauses             : 2
% 6.60/2.20  #    Non-unit-clauses                  : 66
% 6.60/2.20  # Current number of unprocessed clauses: 186
% 6.60/2.20  # ...number of literals in the above   : 498
% 6.60/2.20  # Current number of archived formulas  : 0
% 6.60/2.20  # Current number of archived clauses   : 0
% 6.60/2.20  # Clause-clause subsumption calls (NU) : 887
% 6.60/2.20  # Rec. Clause-clause subsumption calls : 822
% 6.60/2.20  # Non-unit clause-clause subsumptions  : 0
% 6.60/2.20  # Unit Clause-clause subsumption calls : 66
% 6.60/2.20  # Rewrite failures with RHS unbound    : 0
% 6.60/2.20  # BW rewrite match attempts            : 0
% 6.60/2.20  # BW rewrite match successes           : 0
% 6.60/2.20  # Condensation attempts                : 0
% 6.60/2.20  # Condensation successes               : 0
% 6.60/2.20  # Termbank termtop insertions          : 7115
% 6.60/2.20  
% 6.60/2.20  # -------------------------------------------------
% 6.60/2.20  # User time                : 0.015 s
% 6.60/2.20  # System time              : 0.002 s
% 6.60/2.20  # Total time               : 0.017 s
% 6.60/2.20  # ...preprocessing         : 0.013 s
% 6.60/2.20  # ...main loop             : 0.004 s
% 6.60/2.20  # Maximum resident set size: 7128 pages
% 6.60/2.20  
%------------------------------------------------------------------------------