TSTP Solution File: GEO248+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO248+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 : art07.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:03 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP18777/GEO248+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18777/GEO248+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18777/GEO248+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 18873
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X5]:![X6]:(right_apart_point(X5,X6)<=>left_apart_point(X5,reverse_line(X6))),file('/tmp/SRASS.s.p', a2_defns)).
% fof(6, axiom,![X1]:![X4]:(apart_point_and_line(X1,X4)<=>(left_apart_point(X1,X4)|right_apart_point(X1,X4))),file('/tmp/SRASS.s.p', a6_defns)).
% fof(13, axiom,![X1]:![X4]:~((left_apart_point(X1,X4)|left_apart_point(X1,reverse_line(X4)))),file('/tmp/SRASS.s.p', ax10_basics)).
% fof(37, conjecture,![X1]:![X2]:![X4]:((apart_point_and_line(X1,X4)&incident_point_and_line(X2,parallel_lines(X4,X1)))=>apart_point_and_line(X2,X4)),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X1]:![X2]:![X4]:((apart_point_and_line(X1,X4)&incident_point_and_line(X2,parallel_lines(X4,X1)))=>apart_point_and_line(X2,X4))),inference(assume_negation,[status(cth)],[37])).
% fof(54, 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(fof_nnf,[status(thm)],[4])).
% fof(55, plain,![X7]:![X8]:((~(right_apart_point(X7,X8))|left_apart_point(X7,reverse_line(X8)))&(~(left_apart_point(X7,reverse_line(X8)))|right_apart_point(X7,X8))),inference(variable_rename,[status(thm)],[54])).
% cnf(57,plain,(left_apart_point(X1,reverse_line(X2))|~right_apart_point(X1,X2)),inference(split_conjunct,[status(thm)],[55])).
% fof(63, plain,![X1]:![X4]:((~(apart_point_and_line(X1,X4))|(left_apart_point(X1,X4)|right_apart_point(X1,X4)))&((~(left_apart_point(X1,X4))&~(right_apart_point(X1,X4)))|apart_point_and_line(X1,X4))),inference(fof_nnf,[status(thm)],[6])).
% fof(64, plain,![X5]:![X6]:((~(apart_point_and_line(X5,X6))|(left_apart_point(X5,X6)|right_apart_point(X5,X6)))&((~(left_apart_point(X5,X6))&~(right_apart_point(X5,X6)))|apart_point_and_line(X5,X6))),inference(variable_rename,[status(thm)],[63])).
% fof(65, plain,![X5]:![X6]:((~(apart_point_and_line(X5,X6))|(left_apart_point(X5,X6)|right_apart_point(X5,X6)))&((~(left_apart_point(X5,X6))|apart_point_and_line(X5,X6))&(~(right_apart_point(X5,X6))|apart_point_and_line(X5,X6)))),inference(distribute,[status(thm)],[64])).
% cnf(68,plain,(right_apart_point(X1,X2)|left_apart_point(X1,X2)|~apart_point_and_line(X1,X2)),inference(split_conjunct,[status(thm)],[65])).
% fof(92, plain,![X1]:![X4]:(~(left_apart_point(X1,X4))&~(left_apart_point(X1,reverse_line(X4)))),inference(fof_nnf,[status(thm)],[13])).
% fof(93, plain,![X5]:![X6]:(~(left_apart_point(X5,X6))&~(left_apart_point(X5,reverse_line(X6)))),inference(variable_rename,[status(thm)],[92])).
% cnf(95,plain,(~left_apart_point(X1,X2)),inference(split_conjunct,[status(thm)],[93])).
% fof(186, negated_conjecture,?[X1]:?[X2]:?[X4]:((apart_point_and_line(X1,X4)&incident_point_and_line(X2,parallel_lines(X4,X1)))&~(apart_point_and_line(X2,X4))),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X5]:?[X6]:?[X7]:((apart_point_and_line(X5,X7)&incident_point_and_line(X6,parallel_lines(X7,X5)))&~(apart_point_and_line(X6,X7))),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,((apart_point_and_line(esk1_0,esk3_0)&incident_point_and_line(esk2_0,parallel_lines(esk3_0,esk1_0)))&~(apart_point_and_line(esk2_0,esk3_0))),inference(skolemize,[status(esa)],[187])).
% cnf(191,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(192,plain,(~right_apart_point(X1,X2)),inference(sr,[status(thm)],[57,95,theory(equality)])).
% cnf(194,plain,(left_apart_point(X1,X2)|~apart_point_and_line(X1,X2)),inference(sr,[status(thm)],[68,192,theory(equality)])).
% cnf(195,plain,(~apart_point_and_line(X1,X2)),inference(sr,[status(thm)],[194,95,theory(equality)])).
% cnf(196,negated_conjecture,($false),inference(sr,[status(thm)],[191,195,theory(equality)])).
% cnf(197,negated_conjecture,($false),196,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 31
% # ...of these trivial : 0
% # ...subsumed : 3
% # ...remaining for further processing: 28
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 27
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 15
% # Current number of unprocessed clauses: 38
% # ...number of literals in the above : 127
% # Clause-clause subsumption calls (NU) : 4
% # Rec. Clause-clause subsumption calls : 4
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 30 leaves, 1.30+/-0.586 terms/leaf
% # Paramod-from index: 9 leaves, 1.11+/-0.314 terms/leaf
% # Paramod-into index: 26 leaves, 1.31+/-0.538 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.003 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP18777/GEO248+3.tptp
%
%------------------------------------------------------------------------------