TSTP Solution File: GEO224+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO224+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:17:15 EST 2010
% Result : Theorem 1.11s
% Output : Solution 1.11s
% 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/SystemOnTPTP14027/GEO224+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14027/GEO224+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14027/GEO224+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 14123
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X3]:![X4]:(incident_point_and_line(X3,X4)<=>~(apart_point_and_line(X3,X4))),file('/tmp/SRASS.s.p', a4)).
% fof(7, axiom,![X3]:~(convergent_lines(X3,X3)),file('/tmp/SRASS.s.p', apart3)).
% fof(9, axiom,![X3]:![X4]:![X7]:(convergent_lines(X3,X4)=>(convergent_lines(X3,X7)|convergent_lines(X4,X7))),file('/tmp/SRASS.s.p', ax6)).
% fof(16, axiom,![X3]:![X4]:~(convergent_lines(parallel_through_point(X4,X3),X4)),file('/tmp/SRASS.s.p', cp1)).
% fof(17, axiom,![X3]:![X4]:~(apart_point_and_line(X3,parallel_through_point(X4,X3))),file('/tmp/SRASS.s.p', cp2)).
% fof(21, axiom,![X3]:![X4]:![X7]:(apart_point_and_line(X3,X4)=>(distinct_lines(X4,X7)|apart_point_and_line(X3,X7))),file('/tmp/SRASS.s.p', ceq2)).
% fof(24, axiom,![X3]:![X4]:(distinct_lines(X3,X4)=>convergent_lines(X3,X4)),file('/tmp/SRASS.s.p', p1)).
% fof(36, conjecture,![X3]:![X4]:((point(X3)&line(X4))=>?[X7]:(point(X7)&incident_point_and_line(X7,X4))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X3]:![X4]:((point(X3)&line(X4))=>?[X7]:(point(X7)&incident_point_and_line(X7,X4)))),inference(assume_negation,[status(cth)],[36])).
% fof(38, plain,![X3]:![X4]:(incident_point_and_line(X3,X4)<=>~(apart_point_and_line(X3,X4))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(40, plain,![X3]:~(convergent_lines(X3,X3)),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(46, plain,![X3]:![X4]:~(convergent_lines(parallel_through_point(X4,X3),X4)),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(47, plain,![X3]:![X4]:~(apart_point_and_line(X3,parallel_through_point(X4,X3))),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% fof(63, 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(fof_nnf,[status(thm)],[38])).
% fof(64, plain,![X5]:![X6]:((~(incident_point_and_line(X5,X6))|~(apart_point_and_line(X5,X6)))&(apart_point_and_line(X5,X6)|incident_point_and_line(X5,X6))),inference(variable_rename,[status(thm)],[63])).
% cnf(65,plain,(incident_point_and_line(X1,X2)|apart_point_and_line(X1,X2)),inference(split_conjunct,[status(thm)],[64])).
% fof(75, plain,![X4]:~(convergent_lines(X4,X4)),inference(variable_rename,[status(thm)],[40])).
% cnf(76,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[75])).
% fof(80, plain,![X3]:![X4]:![X7]:(~(convergent_lines(X3,X4))|(convergent_lines(X3,X7)|convergent_lines(X4,X7))),inference(fof_nnf,[status(thm)],[9])).
% fof(81, plain,![X8]:![X9]:![X10]:(~(convergent_lines(X8,X9))|(convergent_lines(X8,X10)|convergent_lines(X9,X10))),inference(variable_rename,[status(thm)],[80])).
% cnf(82,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[81])).
% fof(100, plain,![X5]:![X6]:~(convergent_lines(parallel_through_point(X6,X5),X6)),inference(variable_rename,[status(thm)],[46])).
% cnf(101,plain,(~convergent_lines(parallel_through_point(X1,X2),X1)),inference(split_conjunct,[status(thm)],[100])).
% fof(102, plain,![X5]:![X6]:~(apart_point_and_line(X5,parallel_through_point(X6,X5))),inference(variable_rename,[status(thm)],[47])).
% cnf(103,plain,(~apart_point_and_line(X1,parallel_through_point(X2,X1))),inference(split_conjunct,[status(thm)],[102])).
% fof(111, plain,![X3]:![X4]:![X7]:(~(apart_point_and_line(X3,X4))|(distinct_lines(X4,X7)|apart_point_and_line(X3,X7))),inference(fof_nnf,[status(thm)],[21])).
% fof(112, plain,![X8]:![X9]:![X10]:(~(apart_point_and_line(X8,X9))|(distinct_lines(X9,X10)|apart_point_and_line(X8,X10))),inference(variable_rename,[status(thm)],[111])).
% cnf(113,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[112])).
% fof(120, plain,![X3]:![X4]:(~(distinct_lines(X3,X4))|convergent_lines(X3,X4)),inference(fof_nnf,[status(thm)],[24])).
% fof(121, plain,![X5]:![X6]:(~(distinct_lines(X5,X6))|convergent_lines(X5,X6)),inference(variable_rename,[status(thm)],[120])).
% cnf(122,plain,(convergent_lines(X1,X2)|~distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[121])).
% fof(167, negated_conjecture,?[X3]:?[X4]:((point(X3)&line(X4))&![X7]:(~(point(X7))|~(incident_point_and_line(X7,X4)))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X8]:?[X9]:((point(X8)&line(X9))&![X10]:(~(point(X10))|~(incident_point_and_line(X10,X9)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,((point(esk1_0)&line(esk2_0))&![X10]:(~(point(X10))|~(incident_point_and_line(X10,esk2_0)))),inference(skolemize,[status(esa)],[168])).
% fof(170, negated_conjecture,![X10]:((~(point(X10))|~(incident_point_and_line(X10,esk2_0)))&(point(esk1_0)&line(esk2_0))),inference(shift_quantors,[status(thm)],[169])).
% cnf(172,negated_conjecture,(point(esk1_0)),inference(split_conjunct,[status(thm)],[170])).
% cnf(173,negated_conjecture,(~incident_point_and_line(X1,esk2_0)|~point(X1)),inference(split_conjunct,[status(thm)],[170])).
% cnf(175,negated_conjecture,(apart_point_and_line(X1,esk2_0)|~point(X1)),inference(spm,[status(thm)],[173,65,theory(equality)])).
% cnf(201,negated_conjecture,(apart_point_and_line(esk1_0,esk2_0)),inference(spm,[status(thm)],[175,172,theory(equality)])).
% cnf(208,negated_conjecture,(distinct_lines(esk2_0,X1)|apart_point_and_line(esk1_0,X1)),inference(spm,[status(thm)],[113,201,theory(equality)])).
% cnf(218,negated_conjecture,(convergent_lines(esk2_0,X1)|apart_point_and_line(esk1_0,X1)),inference(spm,[status(thm)],[122,208,theory(equality)])).
% cnf(226,negated_conjecture,(convergent_lines(esk2_0,parallel_through_point(X1,esk1_0))),inference(spm,[status(thm)],[103,218,theory(equality)])).
% cnf(232,negated_conjecture,(convergent_lines(parallel_through_point(X1,esk1_0),X2)|convergent_lines(esk2_0,X2)),inference(spm,[status(thm)],[82,226,theory(equality)])).
% cnf(320,negated_conjecture,(convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[101,232,theory(equality)])).
% cnf(322,negated_conjecture,($false),inference(spm,[status(thm)],[76,320,theory(equality)])).
% cnf(332,negated_conjecture,($false),322,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 75
% # ...of these trivial : 0
% # ...subsumed : 6
% # ...remaining for further processing: 69
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 138
% # ...of the previous two non-trivial : 113
% # Contextual simplify-reflections : 4
% # Paramodulations : 136
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 63
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 47
% # Current number of unprocessed clauses: 71
% # ...number of literals in the above : 256
% # Clause-clause subsumption calls (NU) : 76
% # Rec. Clause-clause subsumption calls : 75
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 50 leaves, 1.78+/-1.712 terms/leaf
% # Paramod-from index: 26 leaves, 1.19+/-0.680 terms/leaf
% # Paramod-into index: 45 leaves, 1.53+/-1.147 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.003 s
% # Total time : 0.022 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/SystemOnTPTP14027/GEO224+3.tptp
%
%------------------------------------------------------------------------------