TSTP Solution File: GEO215+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO215+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 05:17:52 EST 2010
% Result : Theorem 1.26s
% Output : Solution 1.26s
% 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/SystemOnTPTP13270/GEO215+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13270/GEO215+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13270/GEO215+2.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 13404
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(2, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', apart6)).
% fof(5, axiom,![X1]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(6, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% fof(7, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>distinct_lines(X1,X2)),file('/tmp/SRASS.s.p', ceq3)).
% fof(10, axiom,![X7]:![X4]:![X5]:![X6]:(distinct_lines(X4,X5)=>(((apart_point_and_line(X7,X4)|apart_point_and_line(X7,X5))|unorthogonal_lines(X4,X6))|unorthogonal_lines(X5,X6))),file('/tmp/SRASS.s.p', ouo1)).
% fof(11, axiom,![X1]:~(distinct_points(X1,X1)),file('/tmp/SRASS.s.p', apart1)).
% fof(19, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>((apart_point_and_line(X3,X1)|apart_point_and_line(X3,X2))=>distinct_points(X3,intersection_point(X1,X2)))),file('/tmp/SRASS.s.p', con2)).
% fof(21, conjecture,![X4]:![X5]:![X6]:(convergent_lines(X4,X5)=>(unorthogonal_lines(X4,X6)|unorthogonal_lines(X5,X6))),file('/tmp/SRASS.s.p', con)).
% fof(22, negated_conjecture,~(![X4]:![X5]:![X6]:(convergent_lines(X4,X5)=>(unorthogonal_lines(X4,X6)|unorthogonal_lines(X5,X6)))),inference(assume_negation,[status(cth)],[21])).
% fof(23, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(24, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(27, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[11,theory(equality)])).
% fof(30, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[23])).
% cnf(31,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(33, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(44, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[24])).
% cnf(45,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[44])).
% fof(46, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(47, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|distinct_lines(X1,X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(50, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|distinct_lines(X3,X4)),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(distinct_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[50])).
% fof(56, plain,![X7]:![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(((apart_point_and_line(X7,X4)|apart_point_and_line(X7,X5))|unorthogonal_lines(X4,X6))|unorthogonal_lines(X5,X6))),inference(fof_nnf,[status(thm)],[10])).
% fof(57, plain,![X8]:![X9]:![X10]:![X11]:(~(distinct_lines(X9,X10))|(((apart_point_and_line(X8,X9)|apart_point_and_line(X8,X10))|unorthogonal_lines(X9,X11))|unorthogonal_lines(X10,X11))),inference(variable_rename,[status(thm)],[56])).
% cnf(58,plain,(unorthogonal_lines(X1,X2)|unorthogonal_lines(X3,X2)|apart_point_and_line(X4,X1)|apart_point_and_line(X4,X3)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(59, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[27])).
% cnf(60,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(80, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|((~(apart_point_and_line(X3,X1))&~(apart_point_and_line(X3,X2)))|distinct_points(X3,intersection_point(X1,X2)))),inference(fof_nnf,[status(thm)],[19])).
% fof(81, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|((~(apart_point_and_line(X6,X4))&~(apart_point_and_line(X6,X5)))|distinct_points(X6,intersection_point(X4,X5)))),inference(variable_rename,[status(thm)],[80])).
% fof(82, plain,![X4]:![X5]:![X6]:(((~(apart_point_and_line(X6,X4))|distinct_points(X6,intersection_point(X4,X5)))|~(convergent_lines(X4,X5)))&((~(apart_point_and_line(X6,X5))|distinct_points(X6,intersection_point(X4,X5)))|~(convergent_lines(X4,X5)))),inference(distribute,[status(thm)],[81])).
% cnf(83,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X1)),inference(split_conjunct,[status(thm)],[82])).
% fof(90, negated_conjecture,?[X4]:?[X5]:?[X6]:(convergent_lines(X4,X5)&(~(unorthogonal_lines(X4,X6))&~(unorthogonal_lines(X5,X6)))),inference(fof_nnf,[status(thm)],[22])).
% fof(91, negated_conjecture,?[X7]:?[X8]:?[X9]:(convergent_lines(X7,X8)&(~(unorthogonal_lines(X7,X9))&~(unorthogonal_lines(X8,X9)))),inference(variable_rename,[status(thm)],[90])).
% fof(92, negated_conjecture,(convergent_lines(esk1_0,esk2_0)&(~(unorthogonal_lines(esk1_0,esk3_0))&~(unorthogonal_lines(esk2_0,esk3_0)))),inference(skolemize,[status(esa)],[91])).
% cnf(93,negated_conjecture,(~unorthogonal_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[92])).
% cnf(94,negated_conjecture,(~unorthogonal_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[92])).
% cnf(95,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[92])).
% cnf(96,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X3,X1)),inference(spm,[status(thm)],[48,51,theory(equality)])).
% cnf(101,negated_conjecture,(convergent_lines(esk2_0,X1)|convergent_lines(esk1_0,X1)),inference(spm,[status(thm)],[34,95,theory(equality)])).
% cnf(106,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[60,83,theory(equality)])).
% cnf(108,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[60,84,theory(equality)])).
% cnf(117,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[31,101,theory(equality)])).
% cnf(125,negated_conjecture,(distinct_lines(esk2_0,X1)|distinct_lines(esk1_0,X1)),inference(spm,[status(thm)],[96,117,theory(equality)])).
% cnf(142,negated_conjecture,(distinct_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[45,125,theory(equality)])).
% cnf(146,negated_conjecture,(apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,esk2_0)|unorthogonal_lines(esk1_0,X2)|unorthogonal_lines(esk2_0,X2)),inference(spm,[status(thm)],[58,142,theory(equality)])).
% cnf(1144,negated_conjecture,(apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)|unorthogonal_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[94,146,theory(equality)])).
% cnf(1151,negated_conjecture,(apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)),inference(sr,[status(thm)],[1144,93,theory(equality)])).
% cnf(1152,negated_conjecture,(apart_point_and_line(intersection_point(X1,esk1_0),esk2_0)|~convergent_lines(X1,esk1_0)),inference(spm,[status(thm)],[106,1151,theory(equality)])).
% cnf(2373,negated_conjecture,(~convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[108,1152,theory(equality)])).
% cnf(2374,negated_conjecture,($false),inference(rw,[status(thm)],[2373,117,theory(equality)])).
% cnf(2375,negated_conjecture,($false),inference(cn,[status(thm)],[2374,theory(equality)])).
% cnf(2376,negated_conjecture,($false),2375,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 366
% # ...of these trivial : 0
% # ...subsumed : 150
% # ...remaining for further processing: 216
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 1
% # Generated clauses : 1989
% # ...of the previous two non-trivial : 1718
% # Contextual simplify-reflections : 5
% # Paramodulations : 1765
% # Factorizations : 224
% # Equation resolutions : 0
% # Current number of processed clauses: 213
% # Positive orientable unit clauses: 30
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 174
% # Current number of unprocessed clauses: 1333
% # ...number of literals in the above : 7265
% # Clause-clause subsumption calls (NU) : 6792
% # Rec. Clause-clause subsumption calls : 3471
% # Unit Clause-clause subsumption calls : 275
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 95 leaves, 1.81+/-1.871 terms/leaf
% # Paramod-from index: 76 leaves, 1.42+/-1.055 terms/leaf
% # Paramod-into index: 92 leaves, 1.63+/-1.412 terms/leaf
% # -------------------------------------------------
% # User time : 0.111 s
% # System time : 0.005 s
% # Total time : 0.116 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.23 CPU 0.31 WC
% FINAL PrfWatch: 0.23 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP13270/GEO215+2.tptp
%
%------------------------------------------------------------------------------