TSTP Solution File: GEO147+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO147+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 : art05.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:51:04 EST 2010
% Result : Theorem 0.98s
% Output : Solution 0.98s
% 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/SystemOnTPTP580/GEO147+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP580/GEO147+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP580/GEO147+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 676
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X3]:(once(at(X1,X3))<=>incident_o(X3,trajectory_of(X1))),file('/tmp/SRASS.s.p', at_on_trajectory)).
% fof(16, axiom,![X5]:![X14]:(once(at_the_same_time(X5,X14))=>(once(X5)&once(X14))),file('/tmp/SRASS.s.p', conjunction_at_the_same_time)).
% fof(17, axiom,![X1]:![X11]:![X3]:(connect(X1,X11,X3)<=>once(at_the_same_time(at(X1,X3),at(X11,X3)))),file('/tmp/SRASS.s.p', connect_defn)).
% fof(37, conjecture,![X3]:![X1]:![X11]:(connect(X1,X11,X3)=>(incident_o(X3,trajectory_of(X1))&incident_o(X3,trajectory_of(X11)))),file('/tmp/SRASS.s.p', t13)).
% fof(38, negated_conjecture,~(![X3]:![X1]:![X11]:(connect(X1,X11,X3)=>(incident_o(X3,trajectory_of(X1))&incident_o(X3,trajectory_of(X11))))),inference(assume_negation,[status(cth)],[37])).
% fof(43, plain,![X1]:![X3]:((~(once(at(X1,X3)))|incident_o(X3,trajectory_of(X1)))&(~(incident_o(X3,trajectory_of(X1)))|once(at(X1,X3)))),inference(fof_nnf,[status(thm)],[2])).
% fof(44, plain,![X4]:![X5]:((~(once(at(X4,X5)))|incident_o(X5,trajectory_of(X4)))&(~(incident_o(X5,trajectory_of(X4)))|once(at(X4,X5)))),inference(variable_rename,[status(thm)],[43])).
% cnf(46,plain,(incident_o(X1,trajectory_of(X2))|~once(at(X2,X1))),inference(split_conjunct,[status(thm)],[44])).
% fof(119, plain,![X5]:![X14]:(~(once(at_the_same_time(X5,X14)))|(once(X5)&once(X14))),inference(fof_nnf,[status(thm)],[16])).
% fof(120, plain,![X15]:![X16]:(~(once(at_the_same_time(X15,X16)))|(once(X15)&once(X16))),inference(variable_rename,[status(thm)],[119])).
% fof(121, plain,![X15]:![X16]:((once(X15)|~(once(at_the_same_time(X15,X16))))&(once(X16)|~(once(at_the_same_time(X15,X16))))),inference(distribute,[status(thm)],[120])).
% cnf(122,plain,(once(X2)|~once(at_the_same_time(X1,X2))),inference(split_conjunct,[status(thm)],[121])).
% cnf(123,plain,(once(X1)|~once(at_the_same_time(X1,X2))),inference(split_conjunct,[status(thm)],[121])).
% fof(124, plain,![X1]:![X11]:![X3]:((~(connect(X1,X11,X3))|once(at_the_same_time(at(X1,X3),at(X11,X3))))&(~(once(at_the_same_time(at(X1,X3),at(X11,X3))))|connect(X1,X11,X3))),inference(fof_nnf,[status(thm)],[17])).
% fof(125, plain,![X12]:![X13]:![X14]:((~(connect(X12,X13,X14))|once(at_the_same_time(at(X12,X14),at(X13,X14))))&(~(once(at_the_same_time(at(X12,X14),at(X13,X14))))|connect(X12,X13,X14))),inference(variable_rename,[status(thm)],[124])).
% cnf(127,plain,(once(at_the_same_time(at(X1,X2),at(X3,X2)))|~connect(X1,X3,X2)),inference(split_conjunct,[status(thm)],[125])).
% fof(265, negated_conjecture,?[X3]:?[X1]:?[X11]:(connect(X1,X11,X3)&(~(incident_o(X3,trajectory_of(X1)))|~(incident_o(X3,trajectory_of(X11))))),inference(fof_nnf,[status(thm)],[38])).
% fof(266, negated_conjecture,?[X12]:?[X13]:?[X14]:(connect(X13,X14,X12)&(~(incident_o(X12,trajectory_of(X13)))|~(incident_o(X12,trajectory_of(X14))))),inference(variable_rename,[status(thm)],[265])).
% fof(267, negated_conjecture,(connect(esk28_0,esk29_0,esk27_0)&(~(incident_o(esk27_0,trajectory_of(esk28_0)))|~(incident_o(esk27_0,trajectory_of(esk29_0))))),inference(skolemize,[status(esa)],[266])).
% cnf(268,negated_conjecture,(~incident_o(esk27_0,trajectory_of(esk29_0))|~incident_o(esk27_0,trajectory_of(esk28_0))),inference(split_conjunct,[status(thm)],[267])).
% cnf(269,negated_conjecture,(connect(esk28_0,esk29_0,esk27_0)),inference(split_conjunct,[status(thm)],[267])).
% cnf(283,negated_conjecture,(~incident_o(esk27_0,trajectory_of(esk28_0))|~once(at(esk29_0,esk27_0))),inference(spm,[status(thm)],[268,46,theory(equality)])).
% cnf(353,plain,(once(at(X1,X2))|~connect(X1,X3,X2)),inference(spm,[status(thm)],[123,127,theory(equality)])).
% cnf(354,plain,(once(at(X1,X2))|~connect(X3,X1,X2)),inference(spm,[status(thm)],[122,127,theory(equality)])).
% cnf(447,negated_conjecture,(once(at(esk28_0,esk27_0))),inference(spm,[status(thm)],[353,269,theory(equality)])).
% cnf(448,negated_conjecture,(once(at(esk29_0,esk27_0))),inference(spm,[status(thm)],[354,269,theory(equality)])).
% cnf(463,negated_conjecture,(~once(at(esk29_0,esk27_0))|~once(at(esk28_0,esk27_0))),inference(spm,[status(thm)],[283,46,theory(equality)])).
% cnf(510,negated_conjecture,(~once(at(esk29_0,esk27_0))|$false),inference(rw,[status(thm)],[463,447,theory(equality)])).
% cnf(511,negated_conjecture,(~once(at(esk29_0,esk27_0))),inference(cn,[status(thm)],[510,theory(equality)])).
% cnf(554,negated_conjecture,($false),inference(sr,[status(thm)],[448,511,theory(equality)])).
% cnf(555,negated_conjecture,($false),554,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 153
% # ...of these trivial : 0
% # ...subsumed : 10
% # ...remaining for further processing: 143
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 278
% # ...of the previous two non-trivial : 242
% # Contextual simplify-reflections : 2
% # Paramodulations : 257
% # Factorizations : 10
% # Equation resolutions : 11
% # Current number of processed clauses: 140
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 124
% # Current number of unprocessed clauses: 189
% # ...number of literals in the above : 753
% # Clause-clause subsumption calls (NU) : 367
% # Rec. Clause-clause subsumption calls : 253
% # Unit Clause-clause subsumption calls : 104
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 16
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 125 leaves, 2.10+/-2.185 terms/leaf
% # Paramod-from index: 47 leaves, 1.13+/-0.392 terms/leaf
% # Paramod-into index: 115 leaves, 1.66+/-1.285 terms/leaf
% # -------------------------------------------------
% # User time : 0.038 s
% # System time : 0.005 s
% # Total time : 0.043 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.21 WC
% FINAL PrfWatch: 0.14 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP580/GEO147+1.tptp
%
%------------------------------------------------------------------------------