TSTP Solution File: CSR115+24 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR115+24 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n019.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:49:14 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_731,negated_conjecture,
    ( ~ obj(X1,X2)
    | ~ attr(X3,X4)
    | ~ attr(X5,X6)
    | ~ sub(X2,firma_1_1)
    | ~ sub(X6,name_1_1)
    | ~ val(X6,bmw_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uxi492c5/input.p',i_0_731) ).

cnf(i_0_234,hypothesis,
    val(c865,bmw_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uxi492c5/input.p',i_0_234) ).

cnf(i_0_235,hypothesis,
    sub(c865,name_1_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uxi492c5/input.p',i_0_235) ).

cnf(i_0_237,hypothesis,
    attr(c864,c865),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uxi492c5/input.p',i_0_237) ).

cnf(i_0_240,hypothesis,
    obj(c797,c801),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uxi492c5/input.p',i_0_240) ).

cnf(i_0_238,hypothesis,
    sub(c801,firma_1_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uxi492c5/input.p',i_0_238) ).

cnf(c_0_738,negated_conjecture,
    ( ~ obj(X1,X2)
    | ~ attr(X3,X4)
    | ~ attr(X5,X6)
    | ~ sub(X2,firma_1_1)
    | ~ sub(X6,name_1_1)
    | ~ val(X6,bmw_0) ),
    i_0_731 ).

cnf(c_0_739,hypothesis,
    val(c865,bmw_0),
    i_0_234 ).

cnf(c_0_740,hypothesis,
    sub(c865,name_1_1),
    i_0_235 ).

cnf(c_0_741,negated_conjecture,
    ( ~ attr(X1,c865)
    | ~ attr(X2,X3)
    | ~ obj(X4,X5)
    | ~ sub(X5,firma_1_1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_738,c_0_739]),c_0_740])]) ).

cnf(c_0_742,hypothesis,
    attr(c864,c865),
    i_0_237 ).

cnf(c_0_743,hypothesis,
    ( ~ attr(X1,X2)
    | ~ obj(X3,X4)
    | ~ sub(X4,firma_1_1) ),
    inference(spm,[status(thm)],[c_0_741,c_0_742]) ).

cnf(c_0_744,hypothesis,
    ( ~ obj(X1,X2)
    | ~ sub(X2,firma_1_1) ),
    inference(spm,[status(thm)],[c_0_743,c_0_742]) ).

cnf(c_0_745,hypothesis,
    obj(c797,c801),
    i_0_240 ).

cnf(c_0_746,hypothesis,
    sub(c801,firma_1_1),
    i_0_238 ).

cnf(c_0_747,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_744,c_0_745]),c_0_746])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : CSR115+24 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n019.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sat Jun 11 00:35:41 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 0.38/0.59  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.59  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.38/0.59  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.38/0.59  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.04/2.63  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.04/2.63  # Version: 2.1pre011
% 7.04/2.63  # Preprocessing time       : 0.023 s
% 7.04/2.63  
% 7.04/2.63  # Proof found!
% 7.04/2.63  # SZS status Theorem
% 7.04/2.63  # SZS output start CNFRefutation
% See solution above
% 7.04/2.63  # Proof object total steps             : 16
% 7.04/2.63  # Proof object clause steps            : 10
% 7.04/2.63  # Proof object formula steps           : 6
% 7.04/2.63  # Proof object conjectures             : 3
% 7.04/2.63  # Proof object clause conjectures      : 2
% 7.04/2.63  # Proof object formula conjectures     : 1
% 7.04/2.63  # Proof object initial clauses used    : 6
% 7.04/2.63  # Proof object initial formulas used   : 6
% 7.04/2.63  # Proof object generating inferences   : 4
% 7.04/2.63  # Proof object simplifying inferences  : 4
% 7.04/2.63  # Training examples: 0 positive, 0 negative
% 7.04/2.63  # Parsed axioms                        : 751
% 7.04/2.63  # Removed by relevancy pruning/SinE    : 0
% 7.04/2.63  # Initial clauses                      : 751
% 7.04/2.63  # Removed in clause preprocessing      : 0
% 7.04/2.63  # Initial clauses in saturation        : 751
% 7.04/2.63  # Processed clauses                    : 760
% 7.04/2.63  # ...of these trivial                  : 0
% 7.04/2.63  # ...subsumed                          : 0
% 7.04/2.63  # ...remaining for further processing  : 760
% 7.04/2.63  # Other redundant clauses eliminated   : 0
% 7.04/2.63  # Clauses deleted for lack of memory   : 0
% 7.04/2.63  # Backward-subsumed                    : 3
% 7.04/2.63  # Backward-rewritten                   : 0
% 7.04/2.63  # Generated clauses                    : 1719
% 7.04/2.63  # ...of the previous two non-trivial   : 1718
% 7.04/2.63  # Contextual simplify-reflections      : 0
% 7.04/2.63  # Paramodulations                      : 1719
% 7.04/2.63  # Factorizations                       : 0
% 7.04/2.63  # Equation resolutions                 : 0
% 7.04/2.63  # Propositional unsat checks           : 0
% 7.04/2.63  # Propositional unsat check successes  : 0
% 7.04/2.63  # Current number of processed clauses  : 757
% 7.04/2.63  #    Positive orientable unit clauses  : 444
% 7.04/2.63  #    Positive unorientable unit clauses: 0
% 7.04/2.63  #    Negative unit clauses             : 0
% 7.04/2.63  #    Non-unit-clauses                  : 313
% 7.04/2.63  # Current number of unprocessed clauses: 1685
% 7.04/2.63  # ...number of literals in the above   : 5425
% 7.04/2.63  # Current number of archived formulas  : 0
% 7.04/2.63  # Current number of archived clauses   : 3
% 7.04/2.63  # Clause-clause subsumption calls (NU) : 25030
% 7.04/2.63  # Rec. Clause-clause subsumption calls : 7907
% 7.04/2.63  # Non-unit clause-clause subsumptions  : 3
% 7.04/2.63  # Unit Clause-clause subsumption calls : 1068
% 7.04/2.63  # Rewrite failures with RHS unbound    : 0
% 7.04/2.63  # BW rewrite match attempts            : 0
% 7.04/2.63  # BW rewrite match successes           : 0
% 7.04/2.63  # Condensation attempts                : 0
% 7.04/2.63  # Condensation successes               : 0
% 7.04/2.63  # Termbank termtop insertions          : 32984
% 7.04/2.63  
% 7.04/2.63  # -------------------------------------------------
% 7.04/2.63  # User time                : 0.053 s
% 7.04/2.63  # System time              : 0.006 s
% 7.04/2.63  # Total time               : 0.059 s
% 7.04/2.63  # ...preprocessing         : 0.023 s
% 7.04/2.63  # ...main loop             : 0.037 s
% 7.04/2.63  # Maximum resident set size: 9708 pages
% 7.04/2.63  
%------------------------------------------------------------------------------