%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : AGT014+2 : TPTP v5.0.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Tue Dec 28 20:27:07 EST 2010
% Result : Theorem 65.90s
% Output : Solution 65.90s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP12970/AGT014+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12970/AGT014+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12970/AGT014+2.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 13162
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.052 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(265, axiom,~(accept_city(muslimcountrybhumanitarianorganization,towna)),file('/tmp/SRASS.s.p', deduced_366)).
% fof(370, axiom,![X1]:(((((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))<=>accept_city(X1,towna)),file('/tmp/SRASS.s.p', a2_9)).
% fof(923, conjecture,?[X5]:?[X6]:?[X7]:~(accept_population(X5,X6,X7)),file('/tmp/SRASS.s.p', query_14)).
% fof(924, negated_conjecture,~(?[X5]:?[X6]:?[X7]:~(accept_population(X5,X6,X7))),inference(assume_negation,[status(cth)],[923])).
% fof(935, plain,~(accept_city(muslimcountrybhumanitarianorganization,towna)),inference(fof_simplification,[status(thm)],[265,theory(equality)])).
% fof(971, negated_conjecture,~(?[X5]:?[X6]:?[X7]:~(accept_population(X5,X6,X7))),inference(fof_simplification,[status(thm)],[924,theory(equality)])).
% cnf(1256,plain,(~accept_city(muslimcountrybhumanitarianorganization,towna)),inference(split_conjunct,[status(thm)],[935])).
% fof(1415, plain,![X1]:((((((~(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)))|accept_city(X1,towna))&(~(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)))),inference(fof_nnf,[status(thm)],[370])).
% fof(1416, plain,![X2]:((((((~(accept_population(X2,atheist,n75))|~(accept_population(X2,christian,n24)))|~(accept_population(X2,muslim,n1)))|~(accept_population(X2,native,n0)))|~(accept_population(X2,other,n0)))|accept_city(X2,towna))&(~(accept_city(X2,towna))|((((accept_population(X2,atheist,n75)&accept_population(X2,christian,n24))&accept_population(X2,muslim,n1))&accept_population(X2,native,n0))&accept_population(X2,other,n0)))),inference(variable_rename,[status(thm)],[1415])).
% fof(1417, plain,![X2]:((((((~(accept_population(X2,atheist,n75))|~(accept_population(X2,christian,n24)))|~(accept_population(X2,muslim,n1)))|~(accept_population(X2,native,n0)))|~(accept_population(X2,other,n0)))|accept_city(X2,towna))&(((((accept_population(X2,atheist,n75)|~(accept_city(X2,towna)))&(accept_population(X2,christian,n24)|~(accept_city(X2,towna))))&(accept_population(X2,muslim,n1)|~(accept_city(X2,towna))))&(accept_population(X2,native,n0)|~(accept_city(X2,towna))))&(accept_population(X2,other,n0)|~(accept_city(X2,towna))))),inference(distribute,[status(thm)],[1416])).
% cnf(1423,plain,(accept_city(X1,towna)|~accept_population(X1,other,n0)|~accept_population(X1,native,n0)|~accept_population(X1,muslim,n1)|~accept_population(X1,christian,n24)|~accept_population(X1,atheist,n75)),inference(split_conjunct,[status(thm)],[1417])).
% fof(2048, negated_conjecture,![X5]:![X6]:![X7]:accept_population(X5,X6,X7),inference(fof_nnf,[status(thm)],[971])).
% fof(2049, negated_conjecture,![X8]:![X9]:![X10]:accept_population(X8,X9,X10),inference(variable_rename,[status(thm)],[2048])).
% cnf(2050,negated_conjecture,(accept_population(X1,X2,X3)),inference(split_conjunct,[status(thm)],[2049])).
% cnf(2288,plain,(accept_city(X1,towna)|$false|$false|$false|$false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1423,2050,theory(equality)]),2050,theory(equality)]),2050,theory(equality)]),2050,theory(equality)]),2050,theory(equality)]),['unfolding']).
% cnf(2382,plain,($false),inference(rw,[status(thm)],[1256,2288,theory(equality)])).
% cnf(2383,plain,($false),inference(cn,[status(thm)],[2382,theory(equality)])).
% cnf(2384,plain,($false),2383,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 256
% # ...of these trivial : 79
% # ...subsumed : 0
% # ...remaining for further processing: 177
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 2
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 174
% # Positive orientable unit clauses: 171
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 504
% # ...number of literals in the above : 542
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 218 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 171 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 217 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.049 s
% # System time : 0.008 s
% # Total time : 0.057 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.29 WC
% FINAL PrfWatch: 0.17 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP12970/AGT014+2.tptp
%
%------------------------------------------------------------------------------