TSTP Solution File: AGT004+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : AGT004+2 : 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:01 EDT 2022
% Result : Theorem 4.35s 2.28s
% Output : CNFRefutation 4.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 8 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( accept_city(X1,X2)
| ~ accept_team(X1,X3,X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g0o05xb3/input.p',i_0_4) ).
cnf(i_0_703,negated_conjecture,
accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g0o05xb3/input.p',i_0_703) ).
cnf(i_0_120,plain,
~ accept_city(countryamedicalorganization,coastvillage),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g0o05xb3/input.p',i_0_120) ).
cnf(c_0_707,plain,
( accept_city(X1,X2)
| ~ accept_team(X1,X3,X2,X4) ),
i_0_4 ).
cnf(c_0_708,negated_conjecture,
accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
i_0_703 ).
cnf(c_0_709,plain,
~ accept_city(countryamedicalorganization,coastvillage),
i_0_120 ).
cnf(c_0_710,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_707,c_0_708]),c_0_709]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : AGT004+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.09/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Sat Jun 4 04:47:19 EDT 2022
% 0.14/0.30 % CPUTime :
% 0.14/0.38 # ENIGMATIC: Selected SinE mode:
% 0.14/0.39 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.39 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.14/0.39 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.14/0.39 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.35/2.28 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 4.35/2.28 # Version: 2.1pre011
% 4.35/2.28 # Preprocessing time : 0.019 s
% 4.35/2.28
% 4.35/2.28 # Proof found!
% 4.35/2.28 # SZS status Theorem
% 4.35/2.28 # SZS output start CNFRefutation
% See solution above
% 4.35/2.28 # Proof object total steps : 7
% 4.35/2.28 # Proof object clause steps : 4
% 4.35/2.28 # Proof object formula steps : 3
% 4.35/2.28 # Proof object conjectures : 3
% 4.35/2.28 # Proof object clause conjectures : 2
% 4.35/2.28 # Proof object formula conjectures : 1
% 4.35/2.28 # Proof object initial clauses used : 3
% 4.35/2.28 # Proof object initial formulas used : 3
% 4.35/2.28 # Proof object generating inferences : 1
% 4.35/2.28 # Proof object simplifying inferences : 1
% 4.35/2.28 # Training examples: 0 positive, 0 negative
% 4.35/2.28 # Parsed axioms : 754
% 4.35/2.28 # Removed by relevancy pruning/SinE : 0
% 4.35/2.28 # Initial clauses : 754
% 4.35/2.28 # Removed in clause preprocessing : 0
% 4.35/2.28 # Initial clauses in saturation : 754
% 4.35/2.28 # Processed clauses : 105
% 4.35/2.28 # ...of these trivial : 1
% 4.35/2.28 # ...subsumed : 0
% 4.35/2.28 # ...remaining for further processing : 104
% 4.35/2.28 # Other redundant clauses eliminated : 2
% 4.35/2.28 # Clauses deleted for lack of memory : 0
% 4.35/2.28 # Backward-subsumed : 0
% 4.35/2.28 # Backward-rewritten : 0
% 4.35/2.28 # Generated clauses : 17
% 4.35/2.28 # ...of the previous two non-trivial : 2
% 4.35/2.28 # Contextual simplify-reflections : 0
% 4.35/2.28 # Paramodulations : 13
% 4.35/2.28 # Factorizations : 2
% 4.35/2.28 # Equation resolutions : 2
% 4.35/2.28 # Propositional unsat checks : 0
% 4.35/2.28 # Propositional unsat check successes : 0
% 4.35/2.28 # Current number of processed clauses : 102
% 4.35/2.28 # Positive orientable unit clauses : 49
% 4.35/2.28 # Positive unorientable unit clauses: 0
% 4.35/2.28 # Negative unit clauses : 44
% 4.35/2.28 # Non-unit-clauses : 9
% 4.35/2.28 # Current number of unprocessed clauses: 651
% 4.35/2.28 # ...number of literals in the above : 788
% 4.35/2.28 # Current number of archived formulas : 0
% 4.35/2.28 # Current number of archived clauses : 0
% 4.35/2.28 # Clause-clause subsumption calls (NU) : 17
% 4.35/2.28 # Rec. Clause-clause subsumption calls : 13
% 4.35/2.28 # Non-unit clause-clause subsumptions : 0
% 4.35/2.28 # Unit Clause-clause subsumption calls : 588
% 4.35/2.28 # Rewrite failures with RHS unbound : 0
% 4.35/2.28 # BW rewrite match attempts : 10
% 4.35/2.28 # BW rewrite match successes : 0
% 4.35/2.28 # Condensation attempts : 0
% 4.35/2.28 # Condensation successes : 0
% 4.35/2.28 # Termbank termtop insertions : 8652
% 4.35/2.28
% 4.35/2.28 # -------------------------------------------------
% 4.35/2.28 # User time : 0.017 s
% 4.35/2.28 # System time : 0.004 s
% 4.35/2.28 # Total time : 0.021 s
% 4.35/2.28 # ...preprocessing : 0.019 s
% 4.35/2.28 # ...main loop : 0.002 s
% 4.35/2.28 # Maximum resident set size: 7128 pages
% 4.35/2.28
%------------------------------------------------------------------------------