TSTP Solution File: GEO249+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO249+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 05:23:09 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/SystemOnTPTP21873/GEO249+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21873/GEO249+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21873/GEO249+3.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 21969
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:~((left_apart_point(X1,X2)|left_apart_point(X1,reverse_line(X2)))),file('/tmp/SRASS.s.p', ax10_basics)).
% fof(5, axiom,![X3]:![X4]:(right_apart_point(X3,X4)<=>left_apart_point(X3,reverse_line(X4))),file('/tmp/SRASS.s.p', a2_defns)).
% fof(37, conjecture,![X1]:![X5]:![X2]:((right_apart_point(X1,X2)&right_apart_point(X5,parallel_through_point(X2,X1)))=>right_apart_point(X5,X2)),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X1]:![X5]:![X2]:((right_apart_point(X1,X2)&right_apart_point(X5,parallel_through_point(X2,X1)))=>right_apart_point(X5,X2))),inference(assume_negation,[status(cth)],[37])).
% fof(53, plain,![X1]:![X2]:(~(left_apart_point(X1,X2))&~(left_apart_point(X1,reverse_line(X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(54, plain,![X3]:![X4]:(~(left_apart_point(X3,X4))&~(left_apart_point(X3,reverse_line(X4)))),inference(variable_rename,[status(thm)],[53])).
% cnf(56,plain,(~left_apart_point(X1,X2)),inference(split_conjunct,[status(thm)],[54])).
% fof(57, plain,![X3]:![X4]:((~(right_apart_point(X3,X4))|left_apart_point(X3,reverse_line(X4)))&(~(left_apart_point(X3,reverse_line(X4)))|right_apart_point(X3,X4))),inference(fof_nnf,[status(thm)],[5])).
% fof(58, plain,![X5]:![X6]:((~(right_apart_point(X5,X6))|left_apart_point(X5,reverse_line(X6)))&(~(left_apart_point(X5,reverse_line(X6)))|right_apart_point(X5,X6))),inference(variable_rename,[status(thm)],[57])).
% cnf(60,plain,(left_apart_point(X1,reverse_line(X2))|~right_apart_point(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% fof(186, negated_conjecture,?[X1]:?[X5]:?[X2]:((right_apart_point(X1,X2)&right_apart_point(X5,parallel_through_point(X2,X1)))&~(right_apart_point(X5,X2))),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X6]:?[X7]:?[X8]:((right_apart_point(X6,X8)&right_apart_point(X7,parallel_through_point(X8,X6)))&~(right_apart_point(X7,X8))),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,((right_apart_point(esk1_0,esk3_0)&right_apart_point(esk2_0,parallel_through_point(esk3_0,esk1_0)))&~(right_apart_point(esk2_0,esk3_0))),inference(skolemize,[status(esa)],[187])).
% cnf(191,negated_conjecture,(right_apart_point(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(192,plain,(~right_apart_point(X1,X2)),inference(sr,[status(thm)],[60,56,theory(equality)])).
% cnf(193,negated_conjecture,($false),inference(sr,[status(thm)],[191,192,theory(equality)])).
% cnf(194,negated_conjecture,($false),193,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 19
% # ...of these trivial : 0
% # ...subsumed : 3
% # ...remaining for further processing: 16
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 2
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 14
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 50
% # ...number of literals in the above : 152
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 21 leaves, 1.10+/-0.294 terms/leaf
% # Paramod-from index: 5 leaves, 1.20+/-0.400 terms/leaf
% # Paramod-into index: 17 leaves, 1.12+/-0.322 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.004 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP21873/GEO249+3.tptp
%
%------------------------------------------------------------------------------