TSTP Solution File: GEO086+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO086+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 : Wed Dec 29 04:20:37 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.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/SystemOnTPTP9887/GEO086+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP9887/GEO086+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9887/GEO086+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 9983
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:((part_of(X2,X1)&~(X2=X1))=>open(X2)),file('/tmp/SRASS.s.p', c1)).
% fof(17, conjecture,![X1]:![X8]:((open(X1)&part_of(X8,X1))=>open(X8)),file('/tmp/SRASS.s.p', theorem_2_7_2)).
% fof(18, negated_conjecture,~(![X1]:![X8]:((open(X1)&part_of(X8,X1))=>open(X8))),inference(assume_negation,[status(cth)],[17])).
% fof(20, plain,![X1]:![X2]:((~(part_of(X2,X1))|X2=X1)|open(X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(21, plain,![X3]:![X4]:((~(part_of(X4,X3))|X4=X3)|open(X4)),inference(variable_rename,[status(thm)],[20])).
% cnf(22,plain,(open(X1)|X1=X2|~part_of(X1,X2)),inference(split_conjunct,[status(thm)],[21])).
% fof(122, negated_conjecture,?[X1]:?[X8]:((open(X1)&part_of(X8,X1))&~(open(X8))),inference(fof_nnf,[status(thm)],[18])).
% fof(123, negated_conjecture,?[X9]:?[X10]:((open(X9)&part_of(X10,X9))&~(open(X10))),inference(variable_rename,[status(thm)],[122])).
% fof(124, negated_conjecture,((open(esk14_0)&part_of(esk15_0,esk14_0))&~(open(esk15_0))),inference(skolemize,[status(esa)],[123])).
% cnf(125,negated_conjecture,(~open(esk15_0)),inference(split_conjunct,[status(thm)],[124])).
% cnf(126,negated_conjecture,(part_of(esk15_0,esk14_0)),inference(split_conjunct,[status(thm)],[124])).
% cnf(127,negated_conjecture,(open(esk14_0)),inference(split_conjunct,[status(thm)],[124])).
% cnf(128,negated_conjecture,(esk15_0=esk14_0|open(esk15_0)),inference(spm,[status(thm)],[22,126,theory(equality)])).
% cnf(129,negated_conjecture,(esk14_0=esk15_0),inference(sr,[status(thm)],[128,125,theory(equality)])).
% cnf(192,negated_conjecture,(open(esk15_0)),inference(rw,[status(thm)],[127,129,theory(equality)])).
% cnf(193,negated_conjecture,($false),inference(sr,[status(thm)],[192,125,theory(equality)])).
% cnf(194,negated_conjecture,($false),193,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 93
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 93
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 62
% # ...of the previous two non-trivial : 52
% # Contextual simplify-reflections : 0
% # Paramodulations : 48
% # Factorizations : 8
% # Equation resolutions : 6
% # Current number of processed clauses: 45
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 42
% # Current number of unprocessed clauses: 49
% # ...number of literals in the above : 216
% # Clause-clause subsumption calls (NU) : 116
% # Rec. Clause-clause subsumption calls : 96
% # 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: 42 leaves, 1.95+/-2.035 terms/leaf
% # Paramod-from index: 16 leaves, 1.25+/-0.559 terms/leaf
% # Paramod-into index: 37 leaves, 1.51+/-1.030 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.004 s
% # Total time : 0.024 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.19 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP9887/GEO086+1.tptp
%
%------------------------------------------------------------------------------