%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : CSR032+2 : TPTP v5.0.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art04.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 22:58:07 EST 2010

% Result   : Theorem 114.28s
% Output   : Solution 114.28s
% 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/SystemOnTPTP23907/CSR032+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP23907/CSR032+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23907/CSR032+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 24111
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.080 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,individual(f_citynamedfn(s_agen,c_france)),file('/tmp/SRASS.s.p', ax1_318)).
% fof(714, axiom,![X5]:(individual(X5)=>isa(X5,c_individual)),file('/tmp/SRASS.s.p', ax1_1014)).
% fof(1132, conjecture,?[X22]:(mtvisible(c_reasoningaboutpossibleantecedentsmt)=>isa(f_citynamedfn(s_agen,c_france),X22)),file('/tmp/SRASS.s.p', query82)).
% fof(1133, negated_conjecture,~(?[X22]:(mtvisible(c_reasoningaboutpossibleantecedentsmt)=>isa(f_citynamedfn(s_agen,c_france),X22))),inference(assume_negation,[status(cth)],[1132])).
% cnf(1137,plain,(individual(f_citynamedfn(s_agen,c_france))),inference(split_conjunct,[status(thm)],[1])).
% fof(3168, plain,![X5]:(~(individual(X5))|isa(X5,c_individual)),inference(fof_nnf,[status(thm)],[714])).
% fof(3169, plain,![X6]:(~(individual(X6))|isa(X6,c_individual)),inference(variable_rename,[status(thm)],[3168])).
% cnf(3170,plain,(isa(X1,c_individual)|~individual(X1)),inference(split_conjunct,[status(thm)],[3169])).
% fof(3864, negated_conjecture,![X22]:(mtvisible(c_reasoningaboutpossibleantecedentsmt)&~(isa(f_citynamedfn(s_agen,c_france),X22))),inference(fof_nnf,[status(thm)],[1133])).
% fof(3865, negated_conjecture,![X23]:(mtvisible(c_reasoningaboutpossibleantecedentsmt)&~(isa(f_citynamedfn(s_agen,c_france),X23))),inference(variable_rename,[status(thm)],[3864])).
% cnf(3866,negated_conjecture,(~isa(f_citynamedfn(s_agen,c_france),X1)),inference(split_conjunct,[status(thm)],[3865])).
% cnf(4455,plain,(isa(f_citynamedfn(s_agen,c_france),c_individual)),inference(spm,[status(thm)],[3170,1137,theory(equality)])).
% cnf(4456,plain,($false),inference(sr,[status(thm)],[4455,3866,theory(equality)])).
% cnf(4457,plain,($false),4456,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 689
% # ...of these trivial                : 0
% # ...subsumed                        : 10
% # ...remaining for further processing: 679
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 586
% # ...of the previous two non-trivial : 583
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 586
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 679
% #    Positive orientable unit clauses: 281
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 395
% # Current number of unprocessed clauses: 1027
% # ...number of literals in the above : 1573
% # Clause-clause subsumption calls (NU) : 93562
% # Rec. Clause-clause subsumption calls : 91215
% # Unit Clause-clause subsumption calls : 60
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:  1069 leaves,   1.02+/-0.164 terms/leaf
% # Paramod-from index:          359 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:          827 leaves,   1.02+/-0.142 terms/leaf
% # -------------------------------------------------
% # User time              : 0.128 s
% # System time            : 0.009 s
% # Total time             : 0.137 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.31 CPU 0.38 WC
% FINAL PrfWatch: 0.31 CPU 0.38 WC
% SZS output end Solution for /tmp/SystemOnTPTP23907/CSR032+2.tptp
% 
%------------------------------------------------------------------------------