↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n027.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:46:45 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2211,plain,
    ( isa(X1,c_individual)
    | ~ individual(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-do6psnz0/input.p',i_0_2211) ).

cnf(i_0_2517,plain,
    individual(c_wanica_districtsuriname),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-do6psnz0/input.p',i_0_2517) ).

cnf(i_0_2584,negated_conjecture,
    ~ isa(c_wanica_districtsuriname,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-do6psnz0/input.p',i_0_2584) ).

cnf(c_0_2588,plain,
    ( isa(X1,c_individual)
    | ~ individual(X1) ),
    i_0_2211 ).

cnf(c_0_2589,plain,
    individual(c_wanica_districtsuriname),
    i_0_2517 ).

cnf(c_0_2590,negated_conjecture,
    ~ isa(c_wanica_districtsuriname,X1),
    i_0_2584 ).

cnf(c_0_2591,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2588,c_0_2589]),c_0_2590]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : CSR034+4 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n027.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 : Sat Jun 11 04:49:01 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.84/1.06  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.84/1.06  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.84/1.06  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.84/1.06  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 10.03/3.85  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 10.03/3.85  # Version: 2.1pre011
% 10.03/3.85  # Preprocessing time       : 0.063 s
% 10.03/3.85  
% 10.03/3.85  # Proof found!
% 10.03/3.85  # SZS status Theorem
% 10.03/3.85  # SZS output start CNFRefutation
% See solution above
% 10.03/3.85  # Proof object total steps             : 7
% 10.03/3.85  # Proof object clause steps            : 4
% 10.03/3.85  # Proof object formula steps           : 3
% 10.03/3.85  # Proof object conjectures             : 2
% 10.03/3.85  # Proof object clause conjectures      : 1
% 10.03/3.85  # Proof object formula conjectures     : 1
% 10.03/3.85  # Proof object initial clauses used    : 3
% 10.03/3.85  # Proof object initial formulas used   : 3
% 10.03/3.85  # Proof object generating inferences   : 1
% 10.03/3.85  # Proof object simplifying inferences  : 1
% 10.03/3.85  # Training examples: 0 positive, 0 negative
% 10.03/3.85  # Parsed axioms                        : 2584
% 10.03/3.85  # Removed by relevancy pruning/SinE    : 0
% 10.03/3.85  # Initial clauses                      : 2584
% 10.03/3.85  # Removed in clause preprocessing      : 0
% 10.03/3.85  # Initial clauses in saturation        : 2584
% 10.03/3.85  # Processed clauses                    : 121
% 10.03/3.85  # ...of these trivial                  : 10
% 10.03/3.85  # ...subsumed                          : 10
% 10.03/3.85  # ...remaining for further processing  : 101
% 10.03/3.85  # Other redundant clauses eliminated   : 0
% 10.03/3.85  # Clauses deleted for lack of memory   : 0
% 10.03/3.85  # Backward-subsumed                    : 0
% 10.03/3.85  # Backward-rewritten                   : 0
% 10.03/3.85  # Generated clauses                    : 9
% 10.03/3.85  # ...of the previous two non-trivial   : 2
% 10.03/3.85  # Contextual simplify-reflections      : 0
% 10.03/3.85  # Paramodulations                      : 9
% 10.03/3.85  # Factorizations                       : 0
% 10.03/3.85  # Equation resolutions                 : 0
% 10.03/3.85  # Propositional unsat checks           : 0
% 10.03/3.85  # Propositional unsat check successes  : 0
% 10.03/3.85  # Current number of processed clauses  : 101
% 10.03/3.85  #    Positive orientable unit clauses  : 49
% 10.03/3.85  #    Positive unorientable unit clauses: 0
% 10.03/3.85  #    Negative unit clauses             : 11
% 10.03/3.85  #    Non-unit-clauses                  : 41
% 10.03/3.85  # Current number of unprocessed clauses: 2465
% 10.03/3.85  # ...number of literals in the above   : 4019
% 10.03/3.85  # Current number of archived formulas  : 0
% 10.03/3.85  # Current number of archived clauses   : 0
% 10.03/3.85  # Clause-clause subsumption calls (NU) : 367
% 10.03/3.85  # Rec. Clause-clause subsumption calls : 321
% 10.03/3.85  # Non-unit clause-clause subsumptions  : 10
% 10.03/3.85  # Unit Clause-clause subsumption calls : 103
% 10.03/3.85  # Rewrite failures with RHS unbound    : 0
% 10.03/3.85  # BW rewrite match attempts            : 0
% 10.03/3.85  # BW rewrite match successes           : 0
% 10.03/3.85  # Condensation attempts                : 0
% 10.03/3.85  # Condensation successes               : 0
% 10.03/3.85  # Termbank termtop insertions          : 35179
% 10.03/3.85  
% 10.03/3.85  # -------------------------------------------------
% 10.03/3.85  # User time                : 0.058 s
% 10.03/3.85  # System time              : 0.008 s
% 10.03/3.85  # Total time               : 0.066 s
% 10.03/3.85  # ...preprocessing         : 0.063 s
% 10.03/3.85  # ...main loop             : 0.003 s
% 10.03/3.85  # Maximum resident set size: 10464 pages
% 10.03/3.85  
%------------------------------------------------------------------------------