TSTP Solution File: AGT016+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : AGT016+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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 7.33s 2.36s
% Output : CNFRefutation 7.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 9 unt; 0 nHn; 14 RR)
% Number of literals : 33 ( 0 equ; 21 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 12 con; 0-0 aty)
% Number of variables : 18 ( 6 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-08ard6ud/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-08ard6ud/input.p',i_0_110) ).
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-08ard6ud/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-08ard6ud/input.p',i_0_121) ).
cnf(i_0_88,plain,
( accept_city(X1,towna)
| ~ accept_population(X1,atheist,n75)
| ~ accept_population(X1,christian,n24)
| ~ accept_population(X1,muslim,n1)
| ~ accept_population(X1,native,n0)
| ~ accept_population(X1,other,n0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-08ard6ud/input.p',i_0_88) ).
cnf(i_0_348,negated_conjecture,
accept_population(muslimcountrybhumanitarianorganization,X1,X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-08ard6ud/input.p',i_0_348) ).
cnf(c_0_355,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_356,plain,
the_agent_not_in_any_proposed_teams(muslimcountrybhumanitarianorganization,countryacivilorganization,towna),
i_0_110 ).
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)
| ~ accept_city(muslimcountrybhumanitarianorganization,towna) ),
inference(spm,[status(thm)],[c_0_355,c_0_356]) ).
cnf(c_0_360,plain,
accept_leader(muslimcountrybhumanitarianorganization,countryacivilorganization),
inference(spm,[status(thm)],[c_0_357,c_0_358]) ).
cnf(c_0_361,plain,
~ accept_city(muslimcountrybhumanitarianorganization,towna),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_359,c_0_360])]) ).
cnf(c_0_362,plain,
( accept_city(X1,towna)
| ~ accept_population(X1,atheist,n75)
| ~ accept_population(X1,christian,n24)
| ~ accept_population(X1,muslim,n1)
| ~ accept_population(X1,native,n0)
| ~ accept_population(X1,other,n0) ),
i_0_88 ).
cnf(c_0_363,negated_conjecture,
accept_population(muslimcountrybhumanitarianorganization,X1,X2),
i_0_348 ).
cnf(c_0_364,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_361,c_0_362]),c_0_363]),c_0_363]),c_0_363]),c_0_363]),c_0_363])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : AGT016+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.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 07:02:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.33/2.36 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.33/2.36 # Version: 2.1pre011
% 7.33/2.36 # Preprocessing time : 0.020 s
% 7.33/2.36
% 7.33/2.36 # Proof found!
% 7.33/2.36 # SZS status Theorem
% 7.33/2.36 # SZS output start CNFRefutation
% See solution above
% 7.33/2.36 # Proof object total steps : 16
% 7.33/2.36 # Proof object clause steps : 10
% 7.33/2.36 # Proof object formula steps : 6
% 7.33/2.36 # Proof object conjectures : 2
% 7.33/2.36 # Proof object clause conjectures : 1
% 7.33/2.36 # Proof object formula conjectures : 1
% 7.33/2.36 # Proof object initial clauses used : 6
% 7.33/2.36 # Proof object initial formulas used : 6
% 7.33/2.36 # Proof object generating inferences : 3
% 7.33/2.36 # Proof object simplifying inferences : 8
% 7.33/2.36 # Training examples: 0 positive, 0 negative
% 7.33/2.36 # Parsed axioms : 402
% 7.33/2.36 # Removed by relevancy pruning/SinE : 0
% 7.33/2.36 # Initial clauses : 402
% 7.33/2.36 # Removed in clause preprocessing : 0
% 7.33/2.36 # Initial clauses in saturation : 402
% 7.33/2.36 # Processed clauses : 460
% 7.33/2.36 # ...of these trivial : 18
% 7.33/2.36 # ...subsumed : 1
% 7.33/2.36 # ...remaining for further processing : 441
% 7.33/2.36 # Other redundant clauses eliminated : 2
% 7.33/2.36 # Clauses deleted for lack of memory : 0
% 7.33/2.36 # Backward-subsumed : 0
% 7.33/2.36 # Backward-rewritten : 1
% 7.33/2.36 # Generated clauses : 769
% 7.33/2.36 # ...of the previous two non-trivial : 588
% 7.33/2.36 # Contextual simplify-reflections : 0
% 7.33/2.36 # Paramodulations : 765
% 7.33/2.36 # Factorizations : 2
% 7.33/2.36 # Equation resolutions : 2
% 7.33/2.36 # Propositional unsat checks : 0
% 7.33/2.36 # Propositional unsat check successes : 0
% 7.33/2.36 # Current number of processed clauses : 438
% 7.33/2.36 # Positive orientable unit clauses : 281
% 7.33/2.36 # Positive unorientable unit clauses: 0
% 7.33/2.36 # Negative unit clauses : 42
% 7.33/2.36 # Non-unit-clauses : 115
% 7.33/2.36 # Current number of unprocessed clauses: 530
% 7.33/2.36 # ...number of literals in the above : 817
% 7.33/2.36 # Current number of archived formulas : 0
% 7.33/2.36 # Current number of archived clauses : 1
% 7.33/2.36 # Clause-clause subsumption calls (NU) : 2474
% 7.33/2.36 # Rec. Clause-clause subsumption calls : 1947
% 7.33/2.36 # Non-unit clause-clause subsumptions : 1
% 7.33/2.36 # Unit Clause-clause subsumption calls : 1122
% 7.33/2.36 # Rewrite failures with RHS unbound : 0
% 7.33/2.36 # BW rewrite match attempts : 187
% 7.33/2.36 # BW rewrite match successes : 1
% 7.33/2.36 # Condensation attempts : 0
% 7.33/2.36 # Condensation successes : 0
% 7.33/2.36 # Termbank termtop insertions : 13247
% 7.33/2.36
% 7.33/2.36 # -------------------------------------------------
% 7.33/2.36 # User time : 0.030 s
% 7.33/2.36 # System time : 0.002 s
% 7.33/2.36 # Total time : 0.032 s
% 7.33/2.36 # ...preprocessing : 0.020 s
% 7.33/2.36 # ...main loop : 0.012 s
% 7.33/2.36 # Maximum resident set size: 7132 pages
% 7.33/2.36
%------------------------------------------------------------------------------