TSTP Solution File: GEO082+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO082+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:08 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP9628/GEO082+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9628/GEO082+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9628/GEO082+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 9724
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(part_of(X2,X1)<=>![X5]:(incident_c(X5,X2)=>incident_c(X5,X1))),file('/tmp/SRASS.s.p', part_of_defn)).
% fof(6, axiom,![X1]:![X2]:(![X5]:(incident_c(X5,X1)<=>incident_c(X5,X2))=>X1=X2),file('/tmp/SRASS.s.p', c9)).
% fof(17, conjecture,![X2]:![X3]:((part_of(X2,X3)&part_of(X3,X2))=>X2=X3),file('/tmp/SRASS.s.p', part_of_antisymmetry)).
% fof(18, negated_conjecture,~(![X2]:![X3]:((part_of(X2,X3)&part_of(X3,X2))=>X2=X3)),inference(assume_negation,[status(cth)],[17])).
% fof(27, plain,![X1]:![X2]:((~(part_of(X2,X1))|![X5]:(~(incident_c(X5,X2))|incident_c(X5,X1)))&(?[X5]:(incident_c(X5,X2)&~(incident_c(X5,X1)))|part_of(X2,X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(28, plain,![X6]:![X7]:((~(part_of(X7,X6))|![X8]:(~(incident_c(X8,X7))|incident_c(X8,X6)))&(?[X9]:(incident_c(X9,X7)&~(incident_c(X9,X6)))|part_of(X7,X6))),inference(variable_rename,[status(thm)],[27])).
% fof(29, plain,![X6]:![X7]:((~(part_of(X7,X6))|![X8]:(~(incident_c(X8,X7))|incident_c(X8,X6)))&((incident_c(esk1_2(X6,X7),X7)&~(incident_c(esk1_2(X6,X7),X6)))|part_of(X7,X6))),inference(skolemize,[status(esa)],[28])).
% fof(30, plain,![X6]:![X7]:![X8]:(((~(incident_c(X8,X7))|incident_c(X8,X6))|~(part_of(X7,X6)))&((incident_c(esk1_2(X6,X7),X7)&~(incident_c(esk1_2(X6,X7),X6)))|part_of(X7,X6))),inference(shift_quantors,[status(thm)],[29])).
% fof(31, plain,![X6]:![X7]:![X8]:(((~(incident_c(X8,X7))|incident_c(X8,X6))|~(part_of(X7,X6)))&((incident_c(esk1_2(X6,X7),X7)|part_of(X7,X6))&(~(incident_c(esk1_2(X6,X7),X6))|part_of(X7,X6)))),inference(distribute,[status(thm)],[30])).
% cnf(34,plain,(incident_c(X3,X2)|~part_of(X1,X2)|~incident_c(X3,X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(44, plain,![X1]:![X2]:(?[X5]:((~(incident_c(X5,X1))|~(incident_c(X5,X2)))&(incident_c(X5,X1)|incident_c(X5,X2)))|X1=X2),inference(fof_nnf,[status(thm)],[6])).
% fof(45, plain,![X6]:![X7]:(?[X8]:((~(incident_c(X8,X6))|~(incident_c(X8,X7)))&(incident_c(X8,X6)|incident_c(X8,X7)))|X6=X7),inference(variable_rename,[status(thm)],[44])).
% fof(46, plain,![X6]:![X7]:(((~(incident_c(esk3_2(X6,X7),X6))|~(incident_c(esk3_2(X6,X7),X7)))&(incident_c(esk3_2(X6,X7),X6)|incident_c(esk3_2(X6,X7),X7)))|X6=X7),inference(skolemize,[status(esa)],[45])).
% fof(47, plain,![X6]:![X7]:(((~(incident_c(esk3_2(X6,X7),X6))|~(incident_c(esk3_2(X6,X7),X7)))|X6=X7)&((incident_c(esk3_2(X6,X7),X6)|incident_c(esk3_2(X6,X7),X7))|X6=X7)),inference(distribute,[status(thm)],[46])).
% cnf(48,plain,(X1=X2|incident_c(esk3_2(X1,X2),X2)|incident_c(esk3_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[47])).
% cnf(49,plain,(X1=X2|~incident_c(esk3_2(X1,X2),X2)|~incident_c(esk3_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(122, negated_conjecture,?[X2]:?[X3]:((part_of(X2,X3)&part_of(X3,X2))&~(X2=X3)),inference(fof_nnf,[status(thm)],[18])).
% fof(123, negated_conjecture,?[X4]:?[X5]:((part_of(X4,X5)&part_of(X5,X4))&~(X4=X5)),inference(variable_rename,[status(thm)],[122])).
% fof(124, negated_conjecture,((part_of(esk14_0,esk15_0)&part_of(esk15_0,esk14_0))&~(esk14_0=esk15_0)),inference(skolemize,[status(esa)],[123])).
% cnf(125,negated_conjecture,(esk14_0!=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,(part_of(esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[124])).
% cnf(144,negated_conjecture,(incident_c(X1,esk14_0)|~incident_c(X1,esk15_0)),inference(spm,[status(thm)],[34,126,theory(equality)])).
% cnf(145,negated_conjecture,(incident_c(X1,esk15_0)|~incident_c(X1,esk14_0)),inference(spm,[status(thm)],[34,127,theory(equality)])).
% cnf(219,negated_conjecture,(incident_c(esk3_2(esk14_0,X1),esk15_0)|esk14_0=X1|incident_c(esk3_2(esk14_0,X1),X1)),inference(spm,[status(thm)],[145,48,theory(equality)])).
% cnf(527,negated_conjecture,(esk14_0=esk15_0|incident_c(esk3_2(esk14_0,esk15_0),esk15_0)),inference(ef,[status(thm)],[219,theory(equality)])).
% cnf(536,negated_conjecture,(incident_c(esk3_2(esk14_0,esk15_0),esk15_0)),inference(sr,[status(thm)],[527,125,theory(equality)])).
% cnf(540,negated_conjecture,(esk14_0=esk15_0|~incident_c(esk3_2(esk14_0,esk15_0),esk14_0)),inference(spm,[status(thm)],[49,536,theory(equality)])).
% cnf(541,negated_conjecture,(~incident_c(esk3_2(esk14_0,esk15_0),esk14_0)),inference(sr,[status(thm)],[540,125,theory(equality)])).
% cnf(543,negated_conjecture,(~incident_c(esk3_2(esk14_0,esk15_0),esk15_0)),inference(spm,[status(thm)],[541,144,theory(equality)])).
% cnf(545,negated_conjecture,($false),inference(rw,[status(thm)],[543,536,theory(equality)])).
% cnf(546,negated_conjecture,($false),inference(cn,[status(thm)],[545,theory(equality)])).
% cnf(547,negated_conjecture,($false),546,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 161
% # ...of these trivial : 2
% # ...subsumed : 8
% # ...remaining for further processing: 151
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 0
% # Generated clauses : 335
% # ...of the previous two non-trivial : 282
% # Contextual simplify-reflections : 4
% # Paramodulations : 313
% # Factorizations : 16
% # Equation resolutions : 6
% # Current number of processed clauses: 103
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 86
% # Current number of unprocessed clauses: 213
% # ...number of literals in the above : 1075
% # Clause-clause subsumption calls (NU) : 318
% # Rec. Clause-clause subsumption calls : 242
% # Unit Clause-clause subsumption calls : 19
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 17
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 102 leaves, 1.58+/-1.562 terms/leaf
% # Paramod-from index: 51 leaves, 1.25+/-0.589 terms/leaf
% # Paramod-into index: 91 leaves, 1.41+/-0.902 terms/leaf
% # -------------------------------------------------
% # User time : 0.036 s
% # System time : 0.005 s
% # Total time : 0.041 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP9628/GEO082+1.tptp
%
%------------------------------------------------------------------------------