↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n029.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:09:19 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_54,negated_conjecture,
    ( unordered_pair(X1,X1) != esk5_0
    | ~ member(X1,universal_class) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qcx3cwkm/input.p',i_0_54) ).

cnf(i_0_51,plain,
    ( member_of(X1) = X1
    | member(member_of(X1),universal_class) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qcx3cwkm/input.p',i_0_51) ).

cnf(i_0_52,negated_conjecture,
    member_of(esk5_0) != esk6_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qcx3cwkm/input.p',i_0_52) ).

cnf(i_0_53,negated_conjecture,
    esk6_0 = esk5_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qcx3cwkm/input.p',i_0_53) ).

cnf(i_0_71,plain,
    ( member_of(X1) = X1
    | unordered_pair(member_of(X1),member_of(X1)) = X1 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qcx3cwkm/input.p',i_0_71) ).

cnf(c_0_77,negated_conjecture,
    ( unordered_pair(X1,X1) != esk5_0
    | ~ member(X1,universal_class) ),
    i_0_54 ).

cnf(c_0_78,plain,
    ( member_of(X1) = X1
    | member(member_of(X1),universal_class) ),
    i_0_51 ).

cnf(c_0_79,negated_conjecture,
    member_of(esk5_0) != esk6_0,
    i_0_52 ).

cnf(c_0_80,negated_conjecture,
    esk6_0 = esk5_0,
    i_0_53 ).

cnf(c_0_81,negated_conjecture,
    ( member_of(X1) = X1
    | unordered_pair(member_of(X1),member_of(X1)) != esk5_0 ),
    inference(spm,[status(thm)],[c_0_77,c_0_78]) ).

cnf(c_0_82,plain,
    ( member_of(X1) = X1
    | unordered_pair(member_of(X1),member_of(X1)) = X1 ),
    i_0_71 ).

cnf(c_0_83,negated_conjecture,
    member_of(esk5_0) != esk5_0,
    inference(rw,[status(thm)],[c_0_79,c_0_80]) ).

cnf(c_0_84,plain,
    ( member_of(X1) = X1
    | X1 != esk5_0 ),
    inference(spm,[status(thm)],[c_0_81,c_0_82]) ).

cnf(c_0_85,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_83,c_0_84]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET091+1 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n029.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 : Sun Jul 10 09:47:33 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.46  # 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
% 7.47/2.34  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.47/2.34  # Version: 2.1pre011
% 7.47/2.34  # Preprocessing time       : 0.020 s
% 7.47/2.34  
% 7.47/2.34  # Proof found!
% 7.47/2.34  # SZS status Theorem
% 7.47/2.34  # SZS output start CNFRefutation
% See solution above
% 7.47/2.34  # Proof object total steps             : 14
% 7.47/2.34  # Proof object clause steps            : 9
% 7.47/2.34  # Proof object formula steps           : 5
% 7.47/2.34  # Proof object conjectures             : 9
% 7.47/2.34  # Proof object clause conjectures      : 6
% 7.47/2.34  # Proof object formula conjectures     : 3
% 7.47/2.34  # Proof object initial clauses used    : 5
% 7.47/2.34  # Proof object initial formulas used   : 5
% 7.47/2.34  # Proof object generating inferences   : 3
% 7.47/2.34  # Proof object simplifying inferences  : 1
% 7.47/2.34  # Training examples: 0 positive, 0 negative
% 7.47/2.34  # Parsed axioms                        : 85
% 7.47/2.34  # Removed by relevancy pruning/SinE    : 0
% 7.47/2.34  # Initial clauses                      : 85
% 7.47/2.34  # Removed in clause preprocessing      : 0
% 7.47/2.34  # Initial clauses in saturation        : 85
% 7.47/2.34  # Processed clauses                    : 105
% 7.47/2.34  # ...of these trivial                  : 1
% 7.47/2.34  # ...subsumed                          : 2
% 7.47/2.34  # ...remaining for further processing  : 102
% 7.47/2.34  # Other redundant clauses eliminated   : 7
% 7.47/2.34  # Clauses deleted for lack of memory   : 0
% 7.47/2.34  # Backward-subsumed                    : 3
% 7.47/2.34  # Backward-rewritten                   : 3
% 7.47/2.34  # Generated clauses                    : 421
% 7.47/2.34  # ...of the previous two non-trivial   : 388
% 7.47/2.34  # Contextual simplify-reflections      : 0
% 7.47/2.34  # Paramodulations                      : 410
% 7.47/2.34  # Factorizations                       : 2
% 7.47/2.34  # Equation resolutions                 : 9
% 7.47/2.34  # Propositional unsat checks           : 0
% 7.47/2.34  # Propositional unsat check successes  : 0
% 7.47/2.34  # Current number of processed clauses  : 92
% 7.47/2.34  #    Positive orientable unit clauses  : 17
% 7.47/2.34  #    Positive unorientable unit clauses: 0
% 7.47/2.34  #    Negative unit clauses             : 4
% 7.47/2.34  #    Non-unit-clauses                  : 71
% 7.47/2.34  # Current number of unprocessed clauses: 346
% 7.47/2.34  # ...number of literals in the above   : 1045
% 7.47/2.34  # Current number of archived formulas  : 0
% 7.47/2.34  # Current number of archived clauses   : 6
% 7.47/2.34  # Clause-clause subsumption calls (NU) : 1015
% 7.47/2.34  # Rec. Clause-clause subsumption calls : 912
% 7.47/2.34  # Non-unit clause-clause subsumptions  : 5
% 7.47/2.34  # Unit Clause-clause subsumption calls : 162
% 7.47/2.34  # Rewrite failures with RHS unbound    : 0
% 7.47/2.34  # BW rewrite match attempts            : 17
% 7.47/2.34  # BW rewrite match successes           : 3
% 7.47/2.34  # Condensation attempts                : 0
% 7.47/2.34  # Condensation successes               : 0
% 7.47/2.34  # Termbank termtop insertions          : 12566
% 7.47/2.34  
% 7.47/2.34  # -------------------------------------------------
% 7.47/2.34  # User time                : 0.026 s
% 7.47/2.34  # System time              : 0.007 s
% 7.47/2.34  # Total time               : 0.033 s
% 7.47/2.34  # ...preprocessing         : 0.020 s
% 7.47/2.34  # ...main loop             : 0.013 s
% 7.47/2.34  # Maximum resident set size: 7132 pages
% 7.47/2.34  
%------------------------------------------------------------------------------