TSTP Solution File: AGT003+1 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n032.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:00 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
    ( accept_leader(X1,X2)
    | ~ accept_team(X1,X2,X3,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1cav_qz4/input.p',i_0_3) ).

cnf(i_0_330,plain,
    accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,coastvillage,n6),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1cav_qz4/input.p',i_0_330) ).

cnf(i_0_1,plain,
    ( accept_team(X1,X2,X3,X4)
    | ~ accept_city(X1,X3)
    | ~ accept_leader(X1,X2)
    | ~ accept_number(X1,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1cav_qz4/input.p',i_0_1) ).

cnf(i_0_4,plain,
    ( accept_city(X1,X2)
    | ~ accept_team(X1,X3,X2,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1cav_qz4/input.p',i_0_4) ).

cnf(i_0_256,plain,
    accept_team(christiansufferterrahumanitarianorganization,countryacivilorganization,towna,n6),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1cav_qz4/input.p',i_0_256) ).

cnf(i_0_2,plain,
    ( accept_number(X1,X2)
    | ~ accept_team(X1,X3,X4,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1cav_qz4/input.p',i_0_2) ).

cnf(i_0_327,plain,
    accept_team(christiansufferterrahumanitarianorganization,countryahumanitarianorganization,coastvillage,n5),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1cav_qz4/input.p',i_0_327) ).

cnf(i_0_348,negated_conjecture,
    ~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1cav_qz4/input.p',i_0_348) ).

cnf(c_0_357,plain,
    ( accept_leader(X1,X2)
    | ~ accept_team(X1,X2,X3,X4) ),
    i_0_3 ).

cnf(c_0_358,plain,
    accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,coastvillage,n6),
    i_0_330 ).

cnf(c_0_359,plain,
    ( accept_team(X1,X2,X3,X4)
    | ~ accept_city(X1,X3)
    | ~ accept_leader(X1,X2)
    | ~ accept_number(X1,X4) ),
    i_0_1 ).

cnf(c_0_360,plain,
    accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
    inference(spm,[status(thm)],[c_0_357,c_0_358]) ).

cnf(c_0_361,plain,
    ( accept_city(X1,X2)
    | ~ accept_team(X1,X3,X2,X4) ),
    i_0_4 ).

cnf(c_0_362,plain,
    accept_team(christiansufferterrahumanitarianorganization,countryacivilorganization,towna,n6),
    i_0_256 ).

cnf(c_0_363,plain,
    ( accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,X1,X2)
    | ~ accept_city(christiansufferterrahumanitarianorganization,X1)
    | ~ accept_number(christiansufferterrahumanitarianorganization,X2) ),
    inference(spm,[status(thm)],[c_0_359,c_0_360]) ).

cnf(c_0_364,plain,
    accept_city(christiansufferterrahumanitarianorganization,towna),
    inference(spm,[status(thm)],[c_0_361,c_0_362]) ).

cnf(c_0_365,plain,
    ( accept_number(X1,X2)
    | ~ accept_team(X1,X3,X4,X2) ),
    i_0_2 ).

cnf(c_0_366,plain,
    accept_team(christiansufferterrahumanitarianorganization,countryahumanitarianorganization,coastvillage,n5),
    i_0_327 ).

cnf(c_0_367,plain,
    ( accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,X1)
    | ~ accept_number(christiansufferterrahumanitarianorganization,X1) ),
    inference(spm,[status(thm)],[c_0_363,c_0_364]) ).

cnf(c_0_368,plain,
    accept_number(christiansufferterrahumanitarianorganization,n5),
    inference(spm,[status(thm)],[c_0_365,c_0_366]) ).

cnf(c_0_369,negated_conjecture,
    ~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
    i_0_348 ).

cnf(c_0_370,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_367,c_0_368]),c_0_369]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem  : AGT003+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.03/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.10/0.30  % Computer : n032.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Sat Jun  4 05:46:49 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.15/0.38  # ENIGMATIC: Selected SinE mode:
% 0.15/0.40  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.40  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.15/0.40  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.15/0.40  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.26/2.28  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.26/2.28  # Version: 2.1pre011
% 7.26/2.28  # Preprocessing time       : 0.013 s
% 7.26/2.28  
% 7.26/2.28  # Proof found!
% 7.26/2.28  # SZS status Theorem
% 7.26/2.28  # SZS output start CNFRefutation
% See solution above
% 7.26/2.28  # Proof object total steps             : 22
% 7.26/2.28  # Proof object clause steps            : 14
% 7.26/2.28  # Proof object formula steps           : 8
% 7.26/2.28  # Proof object conjectures             : 2
% 7.26/2.28  # Proof object clause conjectures      : 1
% 7.26/2.28  # Proof object formula conjectures     : 1
% 7.26/2.28  # Proof object initial clauses used    : 8
% 7.26/2.28  # Proof object initial formulas used   : 8
% 7.26/2.28  # Proof object generating inferences   : 6
% 7.26/2.28  # Proof object simplifying inferences  : 1
% 7.26/2.28  # Training examples: 0 positive, 0 negative
% 7.26/2.28  # Parsed axioms                        : 402
% 7.26/2.28  # Removed by relevancy pruning/SinE    : 0
% 7.26/2.28  # Initial clauses                      : 402
% 7.26/2.28  # Removed in clause preprocessing      : 0
% 7.26/2.28  # Initial clauses in saturation        : 402
% 7.26/2.28  # Processed clauses                    : 445
% 7.26/2.28  # ...of these trivial                  : 13
% 7.26/2.28  # ...subsumed                          : 1
% 7.26/2.28  # ...remaining for further processing  : 431
% 7.26/2.28  # Other redundant clauses eliminated   : 2
% 7.26/2.28  # Clauses deleted for lack of memory   : 0
% 7.26/2.28  # Backward-subsumed                    : 2
% 7.26/2.28  # Backward-rewritten                   : 0
% 7.26/2.28  # Generated clauses                    : 666
% 7.26/2.28  # ...of the previous two non-trivial   : 504
% 7.26/2.28  # Contextual simplify-reflections      : 0
% 7.26/2.28  # Paramodulations                      : 662
% 7.26/2.28  # Factorizations                       : 2
% 7.26/2.28  # Equation resolutions                 : 2
% 7.26/2.28  # Propositional unsat checks           : 0
% 7.26/2.28  # Propositional unsat check successes  : 0
% 7.26/2.28  # Current number of processed clauses  : 427
% 7.26/2.28  #    Positive orientable unit clauses  : 275
% 7.26/2.28  #    Positive unorientable unit clauses: 0
% 7.26/2.28  #    Negative unit clauses             : 42
% 7.26/2.28  #    Non-unit-clauses                  : 110
% 7.26/2.28  # Current number of unprocessed clauses: 459
% 7.26/2.28  # ...number of literals in the above   : 722
% 7.26/2.28  # Current number of archived formulas  : 0
% 7.26/2.28  # Current number of archived clauses   : 2
% 7.26/2.28  # Clause-clause subsumption calls (NU) : 5778
% 7.26/2.28  # Rec. Clause-clause subsumption calls : 2048
% 7.26/2.28  # Non-unit clause-clause subsumptions  : 3
% 7.26/2.28  # Unit Clause-clause subsumption calls : 1081
% 7.26/2.28  # Rewrite failures with RHS unbound    : 0
% 7.26/2.28  # BW rewrite match attempts            : 166
% 7.26/2.28  # BW rewrite match successes           : 0
% 7.26/2.28  # Condensation attempts                : 0
% 7.26/2.28  # Condensation successes               : 0
% 7.26/2.28  # Termbank termtop insertions          : 11937
% 7.26/2.28  
% 7.26/2.28  # -------------------------------------------------
% 7.26/2.28  # User time                : 0.020 s
% 7.26/2.28  # System time              : 0.004 s
% 7.26/2.28  # Total time               : 0.024 s
% 7.26/2.28  # ...preprocessing         : 0.013 s
% 7.26/2.28  # ...main loop             : 0.010 s
% 7.26/2.28  # Maximum resident set size: 7136 pages
% 7.26/2.28  
%------------------------------------------------------------------------------