TSTP Solution File: AGT004+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : AGT004+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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 7.66s 2.47s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 9 unt; 0 nHn; 17 RR)
% Number of literals : 30 ( 0 equ; 15 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 : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 27 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( accept_leader(X1,X2)
| ~ accept_team(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_n5_uy31/input.p',i_0_3) ).
cnf(i_0_348,negated_conjecture,
accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_n5_uy31/input.p',i_0_348) ).
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/sandbox2/tmp/enigma-theBenchmark.p-_n5_uy31/input.p',i_0_1) ).
cnf(i_0_4,plain,
( accept_city(X1,X2)
| ~ accept_team(X1,X3,X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_n5_uy31/input.p',i_0_4) ).
cnf(i_0_151,plain,
accept_number(countryamedicalorganization,n6),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_n5_uy31/input.p',i_0_151) ).
cnf(i_0_265,plain,
~ accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n6),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_n5_uy31/input.p',i_0_265) ).
cnf(c_0_355,plain,
( accept_leader(X1,X2)
| ~ accept_team(X1,X2,X3,X4) ),
i_0_3 ).
cnf(c_0_356,negated_conjecture,
accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
i_0_348 ).
cnf(c_0_357,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_358,negated_conjecture,
accept_leader(countryamedicalorganization,countryahumanitarianorganization),
inference(spm,[status(thm)],[c_0_355,c_0_356]) ).
cnf(c_0_359,plain,
( accept_city(X1,X2)
| ~ accept_team(X1,X3,X2,X4) ),
i_0_4 ).
cnf(c_0_360,plain,
( accept_team(countryamedicalorganization,countryahumanitarianorganization,X1,X2)
| ~ accept_city(countryamedicalorganization,X1)
| ~ accept_number(countryamedicalorganization,X2) ),
inference(spm,[status(thm)],[c_0_357,c_0_358]) ).
cnf(c_0_361,negated_conjecture,
accept_city(countryamedicalorganization,coastvillage),
inference(spm,[status(thm)],[c_0_359,c_0_356]) ).
cnf(c_0_362,negated_conjecture,
( accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,X1)
| ~ accept_number(countryamedicalorganization,X1) ),
inference(spm,[status(thm)],[c_0_360,c_0_361]) ).
cnf(c_0_363,plain,
accept_number(countryamedicalorganization,n6),
i_0_151 ).
cnf(c_0_364,plain,
~ accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n6),
i_0_265 ).
cnf(c_0_365,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_362,c_0_363]),c_0_364]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : AGT004+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 4 05:33:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.66/2.47 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.66/2.47 # Version: 2.1pre011
% 7.66/2.47 # Preprocessing time : 0.025 s
% 7.66/2.47
% 7.66/2.47 # Proof found!
% 7.66/2.47 # SZS status Theorem
% 7.66/2.47 # SZS output start CNFRefutation
% See solution above
% 7.66/2.47 # Proof object total steps : 17
% 7.66/2.47 # Proof object clause steps : 11
% 7.66/2.47 # Proof object formula steps : 6
% 7.66/2.47 # Proof object conjectures : 5
% 7.66/2.47 # Proof object clause conjectures : 4
% 7.66/2.47 # Proof object formula conjectures : 1
% 7.66/2.47 # Proof object initial clauses used : 6
% 7.66/2.47 # Proof object initial formulas used : 6
% 7.66/2.47 # Proof object generating inferences : 5
% 7.66/2.47 # Proof object simplifying inferences : 1
% 7.66/2.47 # Training examples: 0 positive, 0 negative
% 7.66/2.47 # Parsed axioms : 402
% 7.66/2.47 # Removed by relevancy pruning/SinE : 0
% 7.66/2.47 # Initial clauses : 402
% 7.66/2.47 # Removed in clause preprocessing : 0
% 7.66/2.47 # Initial clauses in saturation : 402
% 7.66/2.47 # Processed clauses : 422
% 7.66/2.47 # ...of these trivial : 3
% 7.66/2.47 # ...subsumed : 0
% 7.66/2.47 # ...remaining for further processing : 419
% 7.66/2.47 # Other redundant clauses eliminated : 2
% 7.66/2.47 # Clauses deleted for lack of memory : 0
% 7.66/2.47 # Backward-subsumed : 0
% 7.66/2.47 # Backward-rewritten : 1
% 7.66/2.47 # Generated clauses : 607
% 7.66/2.47 # ...of the previous two non-trivial : 447
% 7.66/2.47 # Contextual simplify-reflections : 0
% 7.66/2.47 # Paramodulations : 603
% 7.66/2.47 # Factorizations : 2
% 7.66/2.47 # Equation resolutions : 2
% 7.66/2.47 # Propositional unsat checks : 0
% 7.66/2.47 # Propositional unsat check successes : 0
% 7.66/2.47 # Current number of processed clauses : 416
% 7.66/2.47 # Positive orientable unit clauses : 267
% 7.66/2.47 # Positive unorientable unit clauses: 0
% 7.66/2.47 # Negative unit clauses : 42
% 7.66/2.47 # Non-unit-clauses : 107
% 7.66/2.47 # Current number of unprocessed clauses: 427
% 7.66/2.47 # ...number of literals in the above : 609
% 7.66/2.47 # Current number of archived formulas : 0
% 7.66/2.47 # Current number of archived clauses : 1
% 7.66/2.47 # Clause-clause subsumption calls (NU) : 3315
% 7.66/2.47 # Rec. Clause-clause subsumption calls : 1382
% 7.66/2.47 # Non-unit clause-clause subsumptions : 0
% 7.66/2.47 # Unit Clause-clause subsumption calls : 959
% 7.66/2.47 # Rewrite failures with RHS unbound : 0
% 7.66/2.47 # BW rewrite match attempts : 167
% 7.66/2.47 # BW rewrite match successes : 1
% 7.66/2.47 # Condensation attempts : 0
% 7.66/2.47 # Condensation successes : 0
% 7.66/2.47 # Termbank termtop insertions : 11289
% 7.66/2.47
% 7.66/2.47 # -------------------------------------------------
% 7.66/2.47 # User time : 0.035 s
% 7.66/2.47 # System time : 0.007 s
% 7.66/2.47 # Total time : 0.042 s
% 7.66/2.47 # ...preprocessing : 0.025 s
% 7.66/2.47 # ...main loop : 0.017 s
% 7.66/2.47 # Maximum resident set size: 7128 pages
% 7.66/2.47
%------------------------------------------------------------------------------