TSTP Solution File: CSR071+3 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR071+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n024.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:47:24 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2471,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-27of0eqj/input.p',i_0_2471) ).

cnf(i_0_813,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member1672_mt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-27of0eqj/input.p',i_0_813) ).

cnf(i_0_2561,negated_conjecture,
    mtvisible(c_tptp_spindlecollectormt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-27of0eqj/input.p',i_0_2561) ).

cnf(i_0_2560,negated_conjecture,
    ~ tptpofobject(c_tptpnavypersonnel_3,f_tptpquantityfn_6(n_414)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-27of0eqj/input.p',i_0_2560) ).

cnf(i_0_672,plain,
    ( tptpofobject(X1,f_tptpquantityfn_6(n_414))
    | ~ militaryperson(X1)
    | ~ mtvisible(c_tptp_member698_mt) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-27of0eqj/input.p',i_0_672) ).

cnf(i_0_150,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member698_mt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-27of0eqj/input.p',i_0_150) ).

cnf(i_0_216,plain,
    ( navypersonnel(c_tptpnavypersonnel_3)
    | ~ mtvisible(c_tptp_member1672_mt) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-27of0eqj/input.p',i_0_216) ).

cnf(i_0_204,plain,
    ( militaryperson(X1)
    | ~ navypersonnel(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-27of0eqj/input.p',i_0_204) ).

cnf(c_0_2570,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    i_0_2471 ).

cnf(c_0_2571,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member1672_mt),
    i_0_813 ).

cnf(c_0_2572,negated_conjecture,
    mtvisible(c_tptp_spindlecollectormt),
    i_0_2561 ).

cnf(c_0_2573,negated_conjecture,
    ~ tptpofobject(c_tptpnavypersonnel_3,f_tptpquantityfn_6(n_414)),
    i_0_2560 ).

cnf(c_0_2574,plain,
    ( tptpofobject(X1,f_tptpquantityfn_6(n_414))
    | ~ militaryperson(X1)
    | ~ mtvisible(c_tptp_member698_mt) ),
    i_0_672 ).

cnf(c_0_2575,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member698_mt),
    i_0_150 ).

cnf(c_0_2576,plain,
    ( navypersonnel(c_tptpnavypersonnel_3)
    | ~ mtvisible(c_tptp_member1672_mt) ),
    i_0_216 ).

cnf(c_0_2577,plain,
    mtvisible(c_tptp_member1672_mt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2570,c_0_2571]),c_0_2572])]) ).

cnf(c_0_2578,negated_conjecture,
    ( ~ militaryperson(c_tptpnavypersonnel_3)
    | ~ mtvisible(c_tptp_member698_mt) ),
    inference(spm,[status(thm)],[c_0_2573,c_0_2574]) ).

cnf(c_0_2579,plain,
    mtvisible(c_tptp_member698_mt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2570,c_0_2575]),c_0_2572])]) ).

cnf(c_0_2580,plain,
    ( militaryperson(X1)
    | ~ navypersonnel(X1) ),
    i_0_204 ).

cnf(c_0_2581,plain,
    navypersonnel(c_tptpnavypersonnel_3),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2576,c_0_2577])]) ).

cnf(c_0_2582,negated_conjecture,
    ~ militaryperson(c_tptpnavypersonnel_3),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2578,c_0_2579])]) ).

cnf(c_0_2583,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2580,c_0_2581]),c_0_2582]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR071+3 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n024.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 : Fri Jun 10 20:56:06 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 0.39/0.58  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.58  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.39/0.58  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.39/0.58  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.86/3.32  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.86/3.32  # Version: 2.1pre011
% 8.86/3.32  # Preprocessing time       : 0.078 s
% 8.86/3.32  
% 8.86/3.32  # Proof found!
% 8.86/3.32  # SZS status Theorem
% 8.86/3.32  # SZS output start CNFRefutation
% See solution above
% 8.86/3.32  # Proof object total steps             : 22
% 8.86/3.32  # Proof object clause steps            : 14
% 8.86/3.32  # Proof object formula steps           : 8
% 8.86/3.32  # Proof object conjectures             : 6
% 8.86/3.32  # Proof object clause conjectures      : 4
% 8.86/3.32  # Proof object formula conjectures     : 2
% 8.86/3.32  # Proof object initial clauses used    : 8
% 8.86/3.32  # Proof object initial formulas used   : 8
% 8.86/3.32  # Proof object generating inferences   : 4
% 8.86/3.32  # Proof object simplifying inferences  : 9
% 8.86/3.32  # Training examples: 0 positive, 0 negative
% 8.86/3.32  # Parsed axioms                        : 2561
% 8.86/3.32  # Removed by relevancy pruning/SinE    : 0
% 8.86/3.32  # Initial clauses                      : 2561
% 8.86/3.32  # Removed in clause preprocessing      : 0
% 8.86/3.32  # Initial clauses in saturation        : 2561
% 8.86/3.32  # Processed clauses                    : 2704
% 8.86/3.32  # ...of these trivial                  : 148
% 8.86/3.32  # ...subsumed                          : 182
% 8.86/3.32  # ...remaining for further processing  : 2374
% 8.86/3.32  # Other redundant clauses eliminated   : 0
% 8.86/3.32  # Clauses deleted for lack of memory   : 0
% 8.86/3.32  # Backward-subsumed                    : 2
% 8.86/3.32  # Backward-rewritten                   : 28
% 8.86/3.32  # Generated clauses                    : 2956
% 8.86/3.32  # ...of the previous two non-trivial   : 2545
% 8.86/3.32  # Contextual simplify-reflections      : 12
% 8.86/3.32  # Paramodulations                      : 2956
% 8.86/3.32  # Factorizations                       : 0
% 8.86/3.32  # Equation resolutions                 : 0
% 8.86/3.32  # Propositional unsat checks           : 0
% 8.86/3.32  # Propositional unsat check successes  : 0
% 8.86/3.32  # Current number of processed clauses  : 2344
% 8.86/3.32  #    Positive orientable unit clauses  : 837
% 8.86/3.32  #    Positive unorientable unit clauses: 0
% 8.86/3.32  #    Negative unit clauses             : 65
% 8.86/3.32  #    Non-unit-clauses                  : 1442
% 8.86/3.32  # Current number of unprocessed clauses: 2361
% 8.86/3.32  # ...number of literals in the above   : 3857
% 8.86/3.32  # Current number of archived formulas  : 0
% 8.86/3.32  # Current number of archived clauses   : 30
% 8.86/3.32  # Clause-clause subsumption calls (NU) : 304503
% 8.86/3.32  # Rec. Clause-clause subsumption calls : 277428
% 8.86/3.32  # Non-unit clause-clause subsumptions  : 195
% 8.86/3.32  # Unit Clause-clause subsumption calls : 36978
% 8.86/3.32  # Rewrite failures with RHS unbound    : 0
% 8.86/3.32  # BW rewrite match attempts            : 28
% 8.86/3.32  # BW rewrite match successes           : 14
% 8.86/3.32  # Condensation attempts                : 0
% 8.86/3.32  # Condensation successes               : 0
% 8.86/3.32  # Termbank termtop insertions          : 61974
% 8.86/3.32  
% 8.86/3.32  # -------------------------------------------------
% 8.86/3.32  # User time                : 0.205 s
% 8.86/3.32  # System time              : 0.017 s
% 8.86/3.32  # Total time               : 0.222 s
% 8.86/3.32  # ...preprocessing         : 0.078 s
% 8.86/3.32  # ...main loop             : 0.144 s
% 8.86/3.32  # Maximum resident set size: 18372 pages
% 8.86/3.32  
%------------------------------------------------------------------------------