TSTP Solution File: GEO148+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO148+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:13 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/SystemOnTPTP839/GEO148+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP839/GEO148+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP839/GEO148+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 935
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.023 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(connect(X1,X2,X3)<=>once(at_the_same_time(at(X1,X3),at(X2,X3)))),file('/tmp/SRASS.s.p', connect_defn)).
% fof(6, axiom,![X7]:![X8]:![X9]:![X10]:![X1]:![X2]:((once(at_the_same_time(at(X1,X7),at(X2,X8)))&once(at_the_same_time(at(X1,X9),at(X2,X10))))=>~((ordered_by(trajectory_of(X1),X7,X9)&ordered_by(trajectory_of(X2),X10,X8)))),file('/tmp/SRASS.s.p', homogeneous_behaviour)).
% fof(37, conjecture,![X3]:![X1]:![X2]:(connect(X1,X2,X3)=>![X9]:![X10]:((ordered_by(trajectory_of(X2),X10,X3)&ordered_by(trajectory_of(X1),X3,X9))=>~(once(at_the_same_time(at(X1,X9),at(X2,X10)))))),file('/tmp/SRASS.s.p', t14)).
% fof(38, negated_conjecture,~(![X3]:![X1]:![X2]:(connect(X1,X2,X3)=>![X9]:![X10]:((ordered_by(trajectory_of(X2),X10,X3)&ordered_by(trajectory_of(X1),X3,X9))=>~(once(at_the_same_time(at(X1,X9),at(X2,X10))))))),inference(assume_negation,[status(cth)],[37])).
% fof(40, negated_conjecture,~(![X3]:![X1]:![X2]:(connect(X1,X2,X3)=>![X9]:![X10]:((ordered_by(trajectory_of(X2),X10,X3)&ordered_by(trajectory_of(X1),X3,X9))=>~(once(at_the_same_time(at(X1,X9),at(X2,X10))))))),inference(fof_simplification,[status(thm)],[38,theory(equality)])).
% fof(41, plain,![X1]:![X2]:![X3]:((~(connect(X1,X2,X3))|once(at_the_same_time(at(X1,X3),at(X2,X3))))&(~(once(at_the_same_time(at(X1,X3),at(X2,X3))))|connect(X1,X2,X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(42, plain,![X4]:![X5]:![X6]:((~(connect(X4,X5,X6))|once(at_the_same_time(at(X4,X6),at(X5,X6))))&(~(once(at_the_same_time(at(X4,X6),at(X5,X6))))|connect(X4,X5,X6))),inference(variable_rename,[status(thm)],[41])).
% cnf(44,plain,(once(at_the_same_time(at(X1,X2),at(X3,X2)))|~connect(X1,X3,X2)),inference(split_conjunct,[status(thm)],[42])).
% fof(61, plain,![X7]:![X8]:![X9]:![X10]:![X1]:![X2]:((~(once(at_the_same_time(at(X1,X7),at(X2,X8))))|~(once(at_the_same_time(at(X1,X9),at(X2,X10)))))|(~(ordered_by(trajectory_of(X1),X7,X9))|~(ordered_by(trajectory_of(X2),X10,X8)))),inference(fof_nnf,[status(thm)],[6])).
% fof(62, plain,![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:((~(once(at_the_same_time(at(X15,X11),at(X16,X12))))|~(once(at_the_same_time(at(X15,X13),at(X16,X14)))))|(~(ordered_by(trajectory_of(X15),X11,X13))|~(ordered_by(trajectory_of(X16),X14,X12)))),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(~ordered_by(trajectory_of(X1),X2,X3)|~ordered_by(trajectory_of(X4),X5,X6)|~once(at_the_same_time(at(X4,X6),at(X1,X2)))|~once(at_the_same_time(at(X4,X5),at(X1,X3)))),inference(split_conjunct,[status(thm)],[62])).
% fof(266, negated_conjecture,?[X3]:?[X1]:?[X2]:(connect(X1,X2,X3)&?[X9]:?[X10]:((ordered_by(trajectory_of(X2),X10,X3)&ordered_by(trajectory_of(X1),X3,X9))&once(at_the_same_time(at(X1,X9),at(X2,X10))))),inference(fof_nnf,[status(thm)],[40])).
% fof(267, negated_conjecture,?[X11]:?[X12]:?[X13]:(connect(X12,X13,X11)&?[X14]:?[X15]:((ordered_by(trajectory_of(X13),X15,X11)&ordered_by(trajectory_of(X12),X11,X14))&once(at_the_same_time(at(X12,X14),at(X13,X15))))),inference(variable_rename,[status(thm)],[266])).
% fof(268, negated_conjecture,(connect(esk28_0,esk29_0,esk27_0)&((ordered_by(trajectory_of(esk29_0),esk31_0,esk27_0)&ordered_by(trajectory_of(esk28_0),esk27_0,esk30_0))&once(at_the_same_time(at(esk28_0,esk30_0),at(esk29_0,esk31_0))))),inference(skolemize,[status(esa)],[267])).
% cnf(269,negated_conjecture,(once(at_the_same_time(at(esk28_0,esk30_0),at(esk29_0,esk31_0)))),inference(split_conjunct,[status(thm)],[268])).
% cnf(270,negated_conjecture,(ordered_by(trajectory_of(esk28_0),esk27_0,esk30_0)),inference(split_conjunct,[status(thm)],[268])).
% cnf(271,negated_conjecture,(ordered_by(trajectory_of(esk29_0),esk31_0,esk27_0)),inference(split_conjunct,[status(thm)],[268])).
% cnf(272,negated_conjecture,(connect(esk28_0,esk29_0,esk27_0)),inference(split_conjunct,[status(thm)],[268])).
% cnf(305,negated_conjecture,(once(at_the_same_time(at(esk28_0,esk27_0),at(esk29_0,esk27_0)))),inference(spm,[status(thm)],[44,272,theory(equality)])).
% cnf(431,negated_conjecture,(~ordered_by(trajectory_of(esk28_0),X1,esk30_0)|~ordered_by(trajectory_of(esk29_0),esk31_0,X2)|~once(at_the_same_time(at(esk28_0,X1),at(esk29_0,X2)))),inference(spm,[status(thm)],[63,269,theory(equality)])).
% cnf(492,negated_conjecture,(~ordered_by(trajectory_of(esk28_0),esk27_0,esk30_0)|~ordered_by(trajectory_of(esk29_0),esk31_0,esk27_0)),inference(spm,[status(thm)],[431,305,theory(equality)])).
% cnf(496,negated_conjecture,($false|~ordered_by(trajectory_of(esk29_0),esk31_0,esk27_0)),inference(rw,[status(thm)],[492,270,theory(equality)])).
% cnf(497,negated_conjecture,($false|$false),inference(rw,[status(thm)],[496,271,theory(equality)])).
% cnf(498,negated_conjecture,($false),inference(cn,[status(thm)],[497,theory(equality)])).
% cnf(499,negated_conjecture,($false),498,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 223
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 221
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 213
% # ...of the previous two non-trivial : 171
% # Contextual simplify-reflections : 2
% # Paramodulations : 196
% # Factorizations : 10
% # Equation resolutions : 7
% # Current number of processed clauses: 119
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 96
% # Current number of unprocessed clauses: 151
% # ...number of literals in the above : 627
% # Clause-clause subsumption calls (NU) : 470
% # Rec. Clause-clause subsumption calls : 294
% # Unit Clause-clause subsumption calls : 33
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 27
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 126 leaves, 1.94+/-2.033 terms/leaf
% # Paramod-from index: 48 leaves, 1.17+/-0.471 terms/leaf
% # Paramod-into index: 115 leaves, 1.47+/-0.981 terms/leaf
% # -------------------------------------------------
% # User time : 0.041 s
% # System time : 0.006 s
% # Total time : 0.047 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/SystemOnTPTP839/GEO148+1.tptp
%
%------------------------------------------------------------------------------