TSTP Solution File: GEO253+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO253+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:36 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/SystemOnTPTP19813/GEO253+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19813/GEO253+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19813/GEO253+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 19909
% 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(6, axiom,![X5]:![X6]:(right_apart_point(X5,X6)<=>left_apart_point(X5,reverse_line(X6))),file('/tmp/SRASS.s.p', a2_defns)).
% fof(8, axiom,![X1]:![X2]:(apart_point_and_line(X1,X2)<=>(left_apart_point(X1,X2)|right_apart_point(X1,X2))),file('/tmp/SRASS.s.p', a6_defns)).
% fof(15, axiom,![X1]:![X2]:~((left_apart_point(X1,X2)|left_apart_point(X1,reverse_line(X2)))),file('/tmp/SRASS.s.p', ax10_basics)).
% fof(37, conjecture,![X1]:![X3]:![X2]:((apart_point_and_line(X1,X2)&incident_point_and_line(X3,parallel_through_point(X2,X1)))=>apart_point_and_line(X3,X2)),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X1]:![X3]:![X2]:((apart_point_and_line(X1,X2)&incident_point_and_line(X3,parallel_through_point(X2,X1)))=>apart_point_and_line(X3,X2))),inference(assume_negation,[status(cth)],[37])).
% 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(fof_nnf,[status(thm)],[6])).
% fof(59, 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)],[58])).
% cnf(61,plain,(left_apart_point(X1,reverse_line(X2))|~right_apart_point(X1,X2)),inference(split_conjunct,[status(thm)],[59])).
% fof(67, plain,![X1]:![X2]:((~(apart_point_and_line(X1,X2))|(left_apart_point(X1,X2)|right_apart_point(X1,X2)))&((~(left_apart_point(X1,X2))&~(right_apart_point(X1,X2)))|apart_point_and_line(X1,X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(68, plain,![X3]:![X4]:((~(apart_point_and_line(X3,X4))|(left_apart_point(X3,X4)|right_apart_point(X3,X4)))&((~(left_apart_point(X3,X4))&~(right_apart_point(X3,X4)))|apart_point_and_line(X3,X4))),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,![X3]:![X4]:((~(apart_point_and_line(X3,X4))|(left_apart_point(X3,X4)|right_apart_point(X3,X4)))&((~(left_apart_point(X3,X4))|apart_point_and_line(X3,X4))&(~(right_apart_point(X3,X4))|apart_point_and_line(X3,X4)))),inference(distribute,[status(thm)],[68])).
% cnf(72,plain,(right_apart_point(X1,X2)|left_apart_point(X1,X2)|~apart_point_and_line(X1,X2)),inference(split_conjunct,[status(thm)],[69])).
% fof(96, plain,![X1]:![X2]:(~(left_apart_point(X1,X2))&~(left_apart_point(X1,reverse_line(X2)))),inference(fof_nnf,[status(thm)],[15])).
% fof(97, plain,![X3]:![X4]:(~(left_apart_point(X3,X4))&~(left_apart_point(X3,reverse_line(X4)))),inference(variable_rename,[status(thm)],[96])).
% cnf(99,plain,(~left_apart_point(X1,X2)),inference(split_conjunct,[status(thm)],[97])).
% fof(186, negated_conjecture,?[X1]:?[X3]:?[X2]:((apart_point_and_line(X1,X2)&incident_point_and_line(X3,parallel_through_point(X2,X1)))&~(apart_point_and_line(X3,X2))),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X4]:?[X5]:?[X6]:((apart_point_and_line(X4,X6)&incident_point_and_line(X5,parallel_through_point(X6,X4)))&~(apart_point_and_line(X5,X6))),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_through_point(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)],[61,99,theory(equality)])).
% cnf(196,plain,(left_apart_point(X1,X2)|~apart_point_and_line(X1,X2)),inference(sr,[status(thm)],[72,192,theory(equality)])).
% cnf(197,plain,(~apart_point_and_line(X1,X2)),inference(sr,[status(thm)],[196,99,theory(equality)])).
% cnf(198,negated_conjecture,($false),inference(sr,[status(thm)],[191,197,theory(equality)])).
% cnf(199,negated_conjecture,($false),198,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 37
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 33
% # 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: 32
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 19
% # Current number of unprocessed clauses: 32
% # ...number of literals in the above : 113
% # Clause-clause subsumption calls (NU) : 7
% # Rec. Clause-clause subsumption calls : 7
% # 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: 33 leaves, 1.27+/-0.664 terms/leaf
% # Paramod-from index: 11 leaves, 1.18+/-0.386 terms/leaf
% # Paramod-into index: 29 leaves, 1.31+/-0.700 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.004 s
% # Total time : 0.019 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP19813/GEO253+3.tptp
%
%------------------------------------------------------------------------------