TSTP Solution File: PUZ132+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PUZ132+1 : TPTP v5.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 21:37:58 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP20665/PUZ132+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20665/PUZ132+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20665/PUZ132+1.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 20797
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,capital(washington),file('/tmp/SRASS.s.p', washington_type)).
% fof(2, axiom,![X1]:(city(X1)=>has_crime(X1)),file('/tmp/SRASS.s.p', crime_axiom)).
% fof(6, axiom,![X1]:(country(X1)=>beautiful(capital_city(X1))),file('/tmp/SRASS.s.p', beautiful_capital_axiom)).
% fof(8, axiom,![X2]:(capital(X2)=>city(X2)),file('/tmp/SRASS.s.p', capital_city_type)).
% fof(9, axiom,capital_city(usa)=washington,file('/tmp/SRASS.s.p', usa_capital_axiom)).
% fof(10, axiom,country(usa),file('/tmp/SRASS.s.p', usa_type)).
% fof(11, conjecture,(beautiful(washington)&has_crime(washington)),file('/tmp/SRASS.s.p', washington_conjecture)).
% fof(12, negated_conjecture,~((beautiful(washington)&has_crime(washington))),inference(assume_negation,[status(cth)],[11])).
% cnf(13,plain,(capital(washington)),inference(split_conjunct,[status(thm)],[1])).
% fof(14, plain,![X1]:(~(city(X1))|has_crime(X1)),inference(fof_nnf,[status(thm)],[2])).
% fof(15, plain,![X2]:(~(city(X2))|has_crime(X2)),inference(variable_rename,[status(thm)],[14])).
% cnf(16,plain,(has_crime(X1)|~city(X1)),inference(split_conjunct,[status(thm)],[15])).
% fof(26, plain,![X1]:(~(country(X1))|beautiful(capital_city(X1))),inference(fof_nnf,[status(thm)],[6])).
% fof(27, plain,![X2]:(~(country(X2))|beautiful(capital_city(X2))),inference(variable_rename,[status(thm)],[26])).
% cnf(28,plain,(beautiful(capital_city(X1))|~country(X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(32, plain,![X2]:(~(capital(X2))|city(X2)),inference(fof_nnf,[status(thm)],[8])).
% fof(33, plain,![X3]:(~(capital(X3))|city(X3)),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(city(X1)|~capital(X1)),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,plain,(capital_city(usa)=washington),inference(split_conjunct,[status(thm)],[9])).
% cnf(36,plain,(country(usa)),inference(split_conjunct,[status(thm)],[10])).
% fof(37, negated_conjecture,(~(beautiful(washington))|~(has_crime(washington))),inference(fof_nnf,[status(thm)],[12])).
% cnf(38,negated_conjecture,(~has_crime(washington)|~beautiful(washington)),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,plain,(beautiful(washington)|~country(usa)),inference(spm,[status(thm)],[28,35,theory(equality)])).
% cnf(40,plain,(beautiful(washington)|$false),inference(rw,[status(thm)],[39,36,theory(equality)])).
% cnf(41,plain,(beautiful(washington)),inference(cn,[status(thm)],[40,theory(equality)])).
% cnf(46,negated_conjecture,($false|~has_crime(washington)),inference(rw,[status(thm)],[38,41,theory(equality)])).
% cnf(47,negated_conjecture,(~has_crime(washington)),inference(cn,[status(thm)],[46,theory(equality)])).
% cnf(48,negated_conjecture,(~city(washington)),inference(spm,[status(thm)],[47,16,theory(equality)])).
% cnf(49,negated_conjecture,(~capital(washington)),inference(spm,[status(thm)],[48,34,theory(equality)])).
% cnf(50,negated_conjecture,($false),inference(rw,[status(thm)],[49,13,theory(equality)])).
% cnf(51,negated_conjecture,($false),inference(cn,[status(thm)],[50,theory(equality)])).
% cnf(52,negated_conjecture,($false),51,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 25
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 25
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 4
% # ...of the previous two non-trivial : 3
% # Contextual simplify-reflections : 0
% # Paramodulations : 4
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 13
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # 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 : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 22 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 11 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 19 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.004 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP20665/PUZ132+1.tptp
%
%------------------------------------------------------------------------------