TSTP Solution File: GEO225+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO225+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 : art06.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:17:37 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/SystemOnTPTP22764/GEO225+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22764/GEO225+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22764/GEO225+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 22860
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X1]:![X2]:(incident_point_and_line(X1,X2)<=>~(apart_point_and_line(X1,X2))),file('/tmp/SRASS.s.p', a4)).
% fof(19, axiom,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),file('/tmp/SRASS.s.p', cp1)).
% fof(20, axiom,![X1]:![X2]:~(apart_point_and_line(X1,parallel_through_point(X2,X1))),file('/tmp/SRASS.s.p', cp2)).
% fof(21, axiom,![X4]:![X6]:~(apart_point_and_line(X4,orthogonal_through_point(X6,X4))),file('/tmp/SRASS.s.p', ooc2)).
% fof(23, axiom,![X1]:![X2]:![X3]:(apart_point_and_line(X1,X2)=>(distinct_lines(X2,X3)|apart_point_and_line(X1,X3))),file('/tmp/SRASS.s.p', ceq2)).
% fof(25, axiom,![X1]:![X2]:(distinct_lines(X1,X2)=>convergent_lines(X1,X2)),file('/tmp/SRASS.s.p', p1)).
% fof(36, conjecture,![X4]:![X5]:(((point(X4)&point(X5))&distinct_points(X4,X5))=>?[X1]:(line(X1)=>(incident_point_and_line(X4,X1)&incident_point_and_line(X5,X1)))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X4]:![X5]:(((point(X4)&point(X5))&distinct_points(X4,X5))=>?[X1]:(line(X1)=>(incident_point_and_line(X4,X1)&incident_point_and_line(X5,X1))))),inference(assume_negation,[status(cth)],[36])).
% fof(39, plain,![X1]:![X2]:(incident_point_and_line(X1,X2)<=>~(apart_point_and_line(X1,X2))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(47, plain,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),inference(fof_simplification,[status(thm)],[19,theory(equality)])).
% fof(48, plain,![X1]:![X2]:~(apart_point_and_line(X1,parallel_through_point(X2,X1))),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% fof(49, plain,![X4]:![X6]:~(apart_point_and_line(X4,orthogonal_through_point(X6,X4))),inference(fof_simplification,[status(thm)],[21,theory(equality)])).
% fof(71, plain,![X1]:![X2]:((~(incident_point_and_line(X1,X2))|~(apart_point_and_line(X1,X2)))&(apart_point_and_line(X1,X2)|incident_point_and_line(X1,X2))),inference(fof_nnf,[status(thm)],[39])).
% fof(72, plain,![X3]:![X4]:((~(incident_point_and_line(X3,X4))|~(apart_point_and_line(X3,X4)))&(apart_point_and_line(X3,X4)|incident_point_and_line(X3,X4))),inference(variable_rename,[status(thm)],[71])).
% cnf(73,plain,(incident_point_and_line(X1,X2)|apart_point_and_line(X1,X2)),inference(split_conjunct,[status(thm)],[72])).
% fof(110, plain,![X3]:![X4]:~(convergent_lines(parallel_through_point(X4,X3),X4)),inference(variable_rename,[status(thm)],[47])).
% cnf(111,plain,(~convergent_lines(parallel_through_point(X1,X2),X1)),inference(split_conjunct,[status(thm)],[110])).
% fof(112, plain,![X3]:![X4]:~(apart_point_and_line(X3,parallel_through_point(X4,X3))),inference(variable_rename,[status(thm)],[48])).
% cnf(113,plain,(~apart_point_and_line(X1,parallel_through_point(X2,X1))),inference(split_conjunct,[status(thm)],[112])).
% fof(114, plain,![X7]:![X8]:~(apart_point_and_line(X7,orthogonal_through_point(X8,X7))),inference(variable_rename,[status(thm)],[49])).
% cnf(115,plain,(~apart_point_and_line(X1,orthogonal_through_point(X2,X1))),inference(split_conjunct,[status(thm)],[114])).
% fof(118, plain,![X1]:![X2]:![X3]:(~(apart_point_and_line(X1,X2))|(distinct_lines(X2,X3)|apart_point_and_line(X1,X3))),inference(fof_nnf,[status(thm)],[23])).
% fof(119, plain,![X4]:![X5]:![X6]:(~(apart_point_and_line(X4,X5))|(distinct_lines(X5,X6)|apart_point_and_line(X4,X6))),inference(variable_rename,[status(thm)],[118])).
% cnf(120,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[119])).
% fof(124, plain,![X1]:![X2]:(~(distinct_lines(X1,X2))|convergent_lines(X1,X2)),inference(fof_nnf,[status(thm)],[25])).
% fof(125, plain,![X3]:![X4]:(~(distinct_lines(X3,X4))|convergent_lines(X3,X4)),inference(variable_rename,[status(thm)],[124])).
% cnf(126,plain,(convergent_lines(X1,X2)|~distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[125])).
% fof(167, negated_conjecture,?[X4]:?[X5]:(((point(X4)&point(X5))&distinct_points(X4,X5))&![X1]:(line(X1)&(~(incident_point_and_line(X4,X1))|~(incident_point_and_line(X5,X1))))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X6]:?[X7]:(((point(X6)&point(X7))&distinct_points(X6,X7))&![X8]:(line(X8)&(~(incident_point_and_line(X6,X8))|~(incident_point_and_line(X7,X8))))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,(((point(esk1_0)&point(esk2_0))&distinct_points(esk1_0,esk2_0))&![X8]:(line(X8)&(~(incident_point_and_line(esk1_0,X8))|~(incident_point_and_line(esk2_0,X8))))),inference(skolemize,[status(esa)],[168])).
% fof(170, negated_conjecture,![X8]:((line(X8)&(~(incident_point_and_line(esk1_0,X8))|~(incident_point_and_line(esk2_0,X8))))&((point(esk1_0)&point(esk2_0))&distinct_points(esk1_0,esk2_0))),inference(shift_quantors,[status(thm)],[169])).
% cnf(174,negated_conjecture,(~incident_point_and_line(esk2_0,X1)|~incident_point_and_line(esk1_0,X1)),inference(split_conjunct,[status(thm)],[170])).
% cnf(181,negated_conjecture,(apart_point_and_line(esk1_0,X1)|~incident_point_and_line(esk2_0,X1)),inference(spm,[status(thm)],[174,73,theory(equality)])).
% cnf(201,negated_conjecture,(apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk2_0,X1)),inference(spm,[status(thm)],[181,73,theory(equality)])).
% cnf(203,negated_conjecture,(apart_point_and_line(esk2_0,parallel_through_point(X1,esk1_0))),inference(spm,[status(thm)],[113,201,theory(equality)])).
% cnf(211,negated_conjecture,(distinct_lines(parallel_through_point(X1,esk1_0),X2)|apart_point_and_line(esk2_0,X2)),inference(spm,[status(thm)],[120,203,theory(equality)])).
% cnf(235,negated_conjecture,(convergent_lines(parallel_through_point(X1,esk1_0),X2)|apart_point_and_line(esk2_0,X2)),inference(spm,[status(thm)],[126,211,theory(equality)])).
% cnf(277,negated_conjecture,(apart_point_and_line(esk2_0,X1)),inference(spm,[status(thm)],[111,235,theory(equality)])).
% cnf(279,negated_conjecture,($false),inference(spm,[status(thm)],[115,277,theory(equality)])).
% cnf(292,negated_conjecture,($false),279,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 69
% # ...of these trivial : 0
% # ...subsumed : 6
% # ...remaining for further processing: 63
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 94
% # ...of the previous two non-trivial : 70
% # Contextual simplify-reflections : 4
% # Paramodulations : 94
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 56
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 40
% # Current number of unprocessed clauses: 32
% # ...number of literals in the above : 98
% # Clause-clause subsumption calls (NU) : 67
% # Rec. Clause-clause subsumption calls : 66
% # Unit Clause-clause subsumption calls : 43
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 44 leaves, 1.73+/-1.543 terms/leaf
% # Paramod-from index: 20 leaves, 1.10+/-0.436 terms/leaf
% # Paramod-into index: 41 leaves, 1.49+/-0.966 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.003 s
% # Total time : 0.021 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/SystemOnTPTP22764/GEO225+3.tptp
%
%------------------------------------------------------------------------------