↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n021.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:25 EDT 2022

% Result   : Theorem 74.84s 66.91s
% Output   : CNFRefutation 74.84s
% 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_2855,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0ugouild/input.p',i_0_2855) ).

cnf(i_0_3076,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member1672_mt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0ugouild/input.p',i_0_3076) ).

cnf(i_0_3861,negated_conjecture,
    mtvisible(c_tptp_spindlecollectormt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0ugouild/input.p',i_0_3861) ).

cnf(i_0_3860,negated_conjecture,
    ~ tptpofobject(c_tptpnavypersonnel_3,f_tptpquantityfn_6(n_414)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0ugouild/input.p',i_0_3860) ).

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

cnf(i_0_559,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member698_mt),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0ugouild/input.p',i_0_559) ).

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

cnf(i_0_1967,plain,
    ( militaryperson(X1)
    | ~ navypersonnel(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0ugouild/input.p',i_0_1967) ).

cnf(c_0_3870,plain,
    ( mtvisible(X1)
    | ~ mtvisible(X2)
    | ~ genlmt(X2,X1) ),
    i_0_2855 ).

cnf(c_0_3871,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member1672_mt),
    i_0_3076 ).

cnf(c_0_3872,negated_conjecture,
    mtvisible(c_tptp_spindlecollectormt),
    i_0_3861 ).

cnf(c_0_3873,negated_conjecture,
    ~ tptpofobject(c_tptpnavypersonnel_3,f_tptpquantityfn_6(n_414)),
    i_0_3860 ).

cnf(c_0_3874,plain,
    ( tptpofobject(X1,f_tptpquantityfn_6(n_414))
    | ~ militaryperson(X1)
    | ~ mtvisible(c_tptp_member698_mt) ),
    i_0_2214 ).

cnf(c_0_3875,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member698_mt),
    i_0_559 ).

cnf(c_0_3876,plain,
    ( navypersonnel(c_tptpnavypersonnel_3)
    | ~ mtvisible(c_tptp_member1672_mt) ),
    i_0_190 ).

cnf(c_0_3877,plain,
    mtvisible(c_tptp_member1672_mt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3870,c_0_3871]),c_0_3872])]) ).

cnf(c_0_3878,negated_conjecture,
    ( ~ militaryperson(c_tptpnavypersonnel_3)
    | ~ mtvisible(c_tptp_member698_mt) ),
    inference(spm,[status(thm)],[c_0_3873,c_0_3874]) ).

cnf(c_0_3879,plain,
    mtvisible(c_tptp_member698_mt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3870,c_0_3875]),c_0_3872])]) ).

cnf(c_0_3880,plain,
    ( militaryperson(X1)
    | ~ navypersonnel(X1) ),
    i_0_1967 ).

cnf(c_0_3881,plain,
    navypersonnel(c_tptpnavypersonnel_3),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3876,c_0_3877])]) ).

cnf(c_0_3882,negated_conjecture,
    ~ militaryperson(c_tptpnavypersonnel_3),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3878,c_0_3879])]) ).

cnf(c_0_3883,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_3880,c_0_3881]),c_0_3882]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : CSR071+6 : TPTP v8.1.0. Bugfixed v5.3.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n021.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sat Jun 11 04:28:11 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected SinE mode:
% 63.17/63.40  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 63.17/63.40  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 63.17/63.40  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 63.17/63.40  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 74.84/66.91  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 74.84/66.91  # Version: 2.1pre011
% 74.84/66.91  # Preprocessing time       : 0.102 s
% 74.84/66.91  
% 74.84/66.91  # Proof found!
% 74.84/66.91  # SZS status Theorem
% 74.84/66.91  # SZS output start CNFRefutation
% See solution above
% 74.84/66.91  # Proof object total steps             : 22
% 74.84/66.91  # Proof object clause steps            : 14
% 74.84/66.91  # Proof object formula steps           : 8
% 74.84/66.91  # Proof object conjectures             : 6
% 74.84/66.91  # Proof object clause conjectures      : 4
% 74.84/66.91  # Proof object formula conjectures     : 2
% 74.84/66.91  # Proof object initial clauses used    : 8
% 74.84/66.91  # Proof object initial formulas used   : 8
% 74.84/66.91  # Proof object generating inferences   : 4
% 74.84/66.91  # Proof object simplifying inferences  : 9
% 74.84/66.91  # Training examples: 0 positive, 0 negative
% 74.84/66.91  # Parsed axioms                        : 3859
% 74.84/66.91  # Removed by relevancy pruning/SinE    : 0
% 74.84/66.91  # Initial clauses                      : 3859
% 74.84/66.91  # Removed in clause preprocessing      : 0
% 74.84/66.91  # Initial clauses in saturation        : 3859
% 74.84/66.91  # Processed clauses                    : 4264
% 74.84/66.91  # ...of these trivial                  : 385
% 74.84/66.91  # ...subsumed                          : 75
% 74.84/66.91  # ...remaining for further processing  : 3804
% 74.84/66.91  # Other redundant clauses eliminated   : 9
% 74.84/66.91  # Clauses deleted for lack of memory   : 0
% 74.84/66.91  # Backward-subsumed                    : 6
% 74.84/66.91  # Backward-rewritten                   : 185
% 74.84/66.91  # Generated clauses                    : 4171
% 74.84/66.91  # ...of the previous two non-trivial   : 3602
% 74.84/66.91  # Contextual simplify-reflections      : 16
% 74.84/66.91  # Paramodulations                      : 4162
% 74.84/66.91  # Factorizations                       : 0
% 74.84/66.91  # Equation resolutions                 : 9
% 74.84/66.91  # Propositional unsat checks           : 0
% 74.84/66.91  # Propositional unsat check successes  : 0
% 74.84/66.91  # Current number of processed clauses  : 3604
% 74.84/66.91  #    Positive orientable unit clauses  : 2026
% 74.84/66.91  #    Positive unorientable unit clauses: 0
% 74.84/66.91  #    Negative unit clauses             : 176
% 74.84/66.91  #    Non-unit-clauses                  : 1402
% 74.84/66.91  # Current number of unprocessed clauses: 2692
% 74.84/66.91  # ...number of literals in the above   : 4961
% 74.84/66.91  # Current number of archived formulas  : 0
% 74.84/66.91  # Current number of archived clauses   : 191
% 74.84/66.91  # Clause-clause subsumption calls (NU) : 216820
% 74.84/66.91  # Rec. Clause-clause subsumption calls : 179673
% 74.84/66.91  # Non-unit clause-clause subsumptions  : 90
% 74.84/66.91  # Unit Clause-clause subsumption calls : 245071
% 74.84/66.91  # Rewrite failures with RHS unbound    : 0
% 74.84/66.91  # BW rewrite match attempts            : 1738
% 74.84/66.91  # BW rewrite match successes           : 135
% 74.84/66.91  # Condensation attempts                : 0
% 74.84/66.91  # Condensation successes               : 0
% 74.84/66.91  # Termbank termtop insertions          : 92717
% 74.84/66.91  
% 74.84/66.91  # -------------------------------------------------
% 74.84/66.91  # User time                : 0.332 s
% 74.84/66.91  # System time              : 0.010 s
% 74.84/66.91  # Total time               : 0.342 s
% 74.84/66.91  # ...preprocessing         : 0.102 s
% 74.84/66.91  # ...main loop             : 0.240 s
% 74.84/66.91  # Maximum resident set size: 25976 pages
% 74.84/66.91  
%------------------------------------------------------------------------------