↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : AGT017+1 : TPTP v8.1.0. Bugfixed v3.1.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 : Thu Jul 14 11:57:04 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
    ( ~ accept_city(X1,X2)
    | ~ accept_leader(X1,X3)
    | ~ the_agent_not_in_any_proposed_teams(X1,X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qxbkry8/input.p',i_0_10) ).

cnf(i_0_110,plain,
    the_agent_not_in_any_proposed_teams(muslimcountrybhumanitarianorganization,countryacivilorganization,towna),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qxbkry8/input.p',i_0_110) ).

cnf(i_0_348,negated_conjecture,
    accept_city(muslimcountrybhumanitarianorganization,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qxbkry8/input.p',i_0_348) ).

cnf(i_0_9,plain,
    ( accept_leader(X1,X2)
    | ~ any_agent_in_all_proposed_teams(X1,X2,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qxbkry8/input.p',i_0_9) ).

cnf(i_0_121,plain,
    any_agent_in_all_proposed_teams(muslimcountrybhumanitarianorganization,countryacivilorganization,towna),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6qxbkry8/input.p',i_0_121) ).

cnf(c_0_354,plain,
    ( ~ accept_city(X1,X2)
    | ~ accept_leader(X1,X3)
    | ~ the_agent_not_in_any_proposed_teams(X1,X3,X2) ),
    i_0_10 ).

cnf(c_0_355,plain,
    the_agent_not_in_any_proposed_teams(muslimcountrybhumanitarianorganization,countryacivilorganization,towna),
    i_0_110 ).

cnf(c_0_356,negated_conjecture,
    accept_city(muslimcountrybhumanitarianorganization,X1),
    i_0_348 ).

cnf(c_0_357,plain,
    ( accept_leader(X1,X2)
    | ~ any_agent_in_all_proposed_teams(X1,X2,X3) ),
    i_0_9 ).

cnf(c_0_358,plain,
    any_agent_in_all_proposed_teams(muslimcountrybhumanitarianorganization,countryacivilorganization,towna),
    i_0_121 ).

cnf(c_0_359,plain,
    ~ accept_leader(muslimcountrybhumanitarianorganization,countryacivilorganization),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_354,c_0_355]),c_0_356])]) ).

cnf(c_0_360,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_357,c_0_358]),c_0_359]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : AGT017+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n021.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jun  4 05:41:05 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 0.20/0.47  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 9.28/2.76  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 9.28/2.76  # Version: 2.1pre011
% 9.28/2.76  # Preprocessing time       : 0.016 s
% 9.28/2.76  
% 9.28/2.76  # Proof found!
% 9.28/2.76  # SZS status Theorem
% 9.28/2.76  # SZS output start CNFRefutation
% See solution above
% 9.28/2.76  # Proof object total steps             : 12
% 9.28/2.76  # Proof object clause steps            : 7
% 9.28/2.76  # Proof object formula steps           : 5
% 9.28/2.76  # Proof object conjectures             : 2
% 9.28/2.76  # Proof object clause conjectures      : 1
% 9.28/2.76  # Proof object formula conjectures     : 1
% 9.28/2.76  # Proof object initial clauses used    : 5
% 9.28/2.76  # Proof object initial formulas used   : 5
% 9.28/2.76  # Proof object generating inferences   : 2
% 9.28/2.76  # Proof object simplifying inferences  : 3
% 9.28/2.76  # Training examples: 0 positive, 0 negative
% 9.28/2.76  # Parsed axioms                        : 402
% 9.28/2.76  # Removed by relevancy pruning/SinE    : 0
% 9.28/2.76  # Initial clauses                      : 402
% 9.28/2.76  # Removed in clause preprocessing      : 0
% 9.28/2.76  # Initial clauses in saturation        : 402
% 9.28/2.76  # Processed clauses                    : 439
% 9.28/2.76  # ...of these trivial                  : 11
% 9.28/2.76  # ...subsumed                          : 1
% 9.28/2.76  # ...remaining for further processing  : 426
% 9.28/2.76  # Other redundant clauses eliminated   : 2
% 9.28/2.76  # Clauses deleted for lack of memory   : 0
% 9.28/2.76  # Backward-subsumed                    : 0
% 9.28/2.76  # Backward-rewritten                   : 0
% 9.28/2.76  # Generated clauses                    : 718
% 9.28/2.76  # ...of the previous two non-trivial   : 546
% 9.28/2.76  # Contextual simplify-reflections      : 0
% 9.28/2.76  # Paramodulations                      : 714
% 9.28/2.76  # Factorizations                       : 2
% 9.28/2.76  # Equation resolutions                 : 2
% 9.28/2.76  # Propositional unsat checks           : 0
% 9.28/2.76  # Propositional unsat check successes  : 0
% 9.28/2.76  # Current number of processed clauses  : 424
% 9.28/2.76  #    Positive orientable unit clauses  : 272
% 9.28/2.76  #    Positive unorientable unit clauses: 0
% 9.28/2.76  #    Negative unit clauses             : 43
% 9.28/2.76  #    Non-unit-clauses                  : 109
% 9.28/2.76  # Current number of unprocessed clauses: 509
% 9.28/2.76  # ...number of literals in the above   : 689
% 9.28/2.76  # Current number of archived formulas  : 0
% 9.28/2.76  # Current number of archived clauses   : 0
% 9.28/2.76  # Clause-clause subsumption calls (NU) : 4561
% 9.28/2.76  # Rec. Clause-clause subsumption calls : 2006
% 9.28/2.76  # Non-unit clause-clause subsumptions  : 1
% 9.28/2.76  # Unit Clause-clause subsumption calls : 1056
% 9.28/2.76  # Rewrite failures with RHS unbound    : 0
% 9.28/2.76  # BW rewrite match attempts            : 169
% 9.28/2.76  # BW rewrite match successes           : 0
% 9.28/2.76  # Condensation attempts                : 0
% 9.28/2.76  # Condensation successes               : 0
% 9.28/2.76  # Termbank termtop insertions          : 12081
% 9.28/2.76  
% 9.28/2.76  # -------------------------------------------------
% 9.28/2.76  # User time                : 0.022 s
% 9.28/2.76  # System time              : 0.004 s
% 9.28/2.76  # Total time               : 0.026 s
% 9.28/2.76  # ...preprocessing         : 0.016 s
% 9.28/2.76  # ...main loop             : 0.010 s
% 9.28/2.76  # Maximum resident set size: 7132 pages
% 9.28/2.76  
%------------------------------------------------------------------------------