TSTP Solution File: GEO222+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO222+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.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:16:00 EST 2010
% Result : Theorem 1.51s
% Output : Solution 1.51s
% 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/SystemOnTPTP14893/GEO222+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14893/GEO222+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14893/GEO222+1.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 14989
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 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', ax6)).
% fof(4, axiom,![X4]:![X5]:~(unorthogonal_lines(orthogonal_through_point(X5,X4),X5)),file('/tmp/SRASS.s.p', ooc1)).
% fof(7, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(distinct_lines(X2,X3)|convergent_lines(X1,X3))),file('/tmp/SRASS.s.p', ceq3)).
% fof(8, axiom,![X5]:![X6]:(convergent_lines(X5,X6)|unorthogonal_lines(X5,X6)),file('/tmp/SRASS.s.p', occu1)).
% fof(9, axiom,![X5]:![X6]:![X7]:((convergent_lines(X5,X6)&unorthogonal_lines(X5,X6))=>((convergent_lines(X5,X7)&unorthogonal_lines(X5,X7))|(convergent_lines(X6,X7)&unorthogonal_lines(X6,X7)))),file('/tmp/SRASS.s.p', oac1)).
% fof(15, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),file('/tmp/SRASS.s.p', ci3)).
% fof(16, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),file('/tmp/SRASS.s.p', ci4)).
% fof(19, axiom,![X4]:![X5]:![X6]:![X7]:(distinct_lines(X5,X6)=>(((apart_point_and_line(X4,X5)|apart_point_and_line(X4,X6))|unorthogonal_lines(X5,X7))|unorthogonal_lines(X6,X7))),file('/tmp/SRASS.s.p', ouo1)).
% fof(23, conjecture,![X4]:![X5]:~(convergent_lines(X5,orthogonal_through_point(orthogonal_through_point(X5,X4),X4))),file('/tmp/SRASS.s.p', con)).
% fof(24, negated_conjecture,~(![X4]:![X5]:~(convergent_lines(X5,orthogonal_through_point(orthogonal_through_point(X5,X4),X4)))),inference(assume_negation,[status(cth)],[23])).
% fof(25, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(27, plain,![X4]:![X5]:~(unorthogonal_lines(orthogonal_through_point(X5,X4),X5)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(32, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_simplification,[status(thm)],[15,theory(equality)])).
% fof(33, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(36, negated_conjecture,~(![X4]:![X5]:~(convergent_lines(X5,orthogonal_through_point(orthogonal_through_point(X5,X4),X4)))),inference(fof_simplification,[status(thm)],[24,theory(equality)])).
% fof(37, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[25])).
% cnf(38,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(40, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[39])).
% cnf(41,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(44, plain,![X6]:![X7]:~(unorthogonal_lines(orthogonal_through_point(X7,X6),X7)),inference(variable_rename,[status(thm)],[27])).
% cnf(45,plain,(~unorthogonal_lines(orthogonal_through_point(X1,X2),X1)),inference(split_conjunct,[status(thm)],[44])).
% fof(51, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(distinct_lines(X2,X3)|convergent_lines(X1,X3))),inference(fof_nnf,[status(thm)],[7])).
% fof(52, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(distinct_lines(X5,X6)|convergent_lines(X4,X6))),inference(variable_rename,[status(thm)],[51])).
% cnf(53,plain,(convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(split_conjunct,[status(thm)],[52])).
% fof(54, plain,![X7]:![X8]:(convergent_lines(X7,X8)|unorthogonal_lines(X7,X8)),inference(variable_rename,[status(thm)],[8])).
% cnf(55,plain,(unorthogonal_lines(X1,X2)|convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[54])).
% fof(56, plain,![X5]:![X6]:![X7]:((~(convergent_lines(X5,X6))|~(unorthogonal_lines(X5,X6)))|((convergent_lines(X5,X7)&unorthogonal_lines(X5,X7))|(convergent_lines(X6,X7)&unorthogonal_lines(X6,X7)))),inference(fof_nnf,[status(thm)],[9])).
% fof(57, plain,![X8]:![X9]:![X10]:((~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9)))|((convergent_lines(X8,X10)&unorthogonal_lines(X8,X10))|(convergent_lines(X9,X10)&unorthogonal_lines(X9,X10)))),inference(variable_rename,[status(thm)],[56])).
% fof(58, plain,![X8]:![X9]:![X10]:((((convergent_lines(X9,X10)|convergent_lines(X8,X10))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9))))&((unorthogonal_lines(X9,X10)|convergent_lines(X8,X10))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9)))))&(((convergent_lines(X9,X10)|unorthogonal_lines(X8,X10))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9))))&((unorthogonal_lines(X9,X10)|unorthogonal_lines(X8,X10))|(~(convergent_lines(X8,X9))|~(unorthogonal_lines(X8,X9)))))),inference(distribute,[status(thm)],[57])).
% cnf(61,plain,(convergent_lines(X1,X3)|unorthogonal_lines(X2,X3)|~unorthogonal_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% fof(75, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[32])).
% fof(76, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X3))),inference(variable_rename,[status(thm)],[75])).
% cnf(77,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[76])).
% fof(78, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_nnf,[status(thm)],[33])).
% fof(79, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X4))),inference(variable_rename,[status(thm)],[78])).
% cnf(80,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[79])).
% fof(87, plain,![X4]:![X5]:![X6]:![X7]:(~(distinct_lines(X5,X6))|(((apart_point_and_line(X4,X5)|apart_point_and_line(X4,X6))|unorthogonal_lines(X5,X7))|unorthogonal_lines(X6,X7))),inference(fof_nnf,[status(thm)],[19])).
% fof(88, 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)],[87])).
% cnf(89,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)],[88])).
% fof(99, negated_conjecture,?[X4]:?[X5]:convergent_lines(X5,orthogonal_through_point(orthogonal_through_point(X5,X4),X4)),inference(fof_nnf,[status(thm)],[36])).
% fof(100, negated_conjecture,?[X6]:?[X7]:convergent_lines(X7,orthogonal_through_point(orthogonal_through_point(X7,X6),X6)),inference(variable_rename,[status(thm)],[99])).
% fof(101, negated_conjecture,convergent_lines(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0)),inference(skolemize,[status(esa)],[100])).
% cnf(102,negated_conjecture,(convergent_lines(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0))),inference(split_conjunct,[status(thm)],[101])).
% cnf(104,plain,(convergent_lines(orthogonal_through_point(X1,X2),X1)),inference(spm,[status(thm)],[45,55,theory(equality)])).
% cnf(105,negated_conjecture,(distinct_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[53,102,theory(equality)])).
% cnf(114,plain,(convergent_lines(X1,X2)|convergent_lines(orthogonal_through_point(X1,X3),X2)),inference(spm,[status(thm)],[41,104,theory(equality)])).
% cnf(116,plain,(convergent_lines(X1,orthogonal_through_point(X1,X2))),inference(spm,[status(thm)],[38,114,theory(equality)])).
% cnf(123,negated_conjecture,(unorthogonal_lines(X1,X2)|unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X2)|apart_point_and_line(X3,X1)|apart_point_and_line(X3,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0))|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[89,105,theory(equality)])).
% cnf(282,negated_conjecture,(unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X3)|unorthogonal_lines(X1,X3)|apart_point_and_line(intersection_point(X1,X2),orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0))|convergent_lines(esk2_0,X1)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[77,123,theory(equality)])).
% cnf(3941,negated_conjecture,(unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)|unorthogonal_lines(esk2_0,X1)|apart_point_and_line(intersection_point(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0)),orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0))|convergent_lines(esk2_0,esk2_0)),inference(spm,[status(thm)],[282,102,theory(equality)])).
% cnf(4234,negated_conjecture,(unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)|unorthogonal_lines(esk2_0,X1)|apart_point_and_line(intersection_point(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0)),orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0))),inference(sr,[status(thm)],[3941,38,theory(equality)])).
% cnf(4268,negated_conjecture,(unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)|unorthogonal_lines(esk2_0,X1)|~convergent_lines(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0))),inference(spm,[status(thm)],[80,4234,theory(equality)])).
% cnf(4272,negated_conjecture,(unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)|unorthogonal_lines(esk2_0,X1)|$false),inference(rw,[status(thm)],[4268,102,theory(equality)])).
% cnf(4273,negated_conjecture,(unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)|unorthogonal_lines(esk2_0,X1)),inference(cn,[status(thm)],[4272,theory(equality)])).
% cnf(4277,negated_conjecture,(unorthogonal_lines(esk2_0,orthogonal_through_point(esk2_0,esk1_0))),inference(spm,[status(thm)],[45,4273,theory(equality)])).
% cnf(4280,negated_conjecture,(unorthogonal_lines(orthogonal_through_point(esk2_0,esk1_0),X1)|convergent_lines(esk2_0,X1)|~convergent_lines(esk2_0,orthogonal_through_point(esk2_0,esk1_0))),inference(spm,[status(thm)],[61,4277,theory(equality)])).
% cnf(4285,negated_conjecture,(unorthogonal_lines(orthogonal_through_point(esk2_0,esk1_0),X1)|convergent_lines(esk2_0,X1)|$false),inference(rw,[status(thm)],[4280,116,theory(equality)])).
% cnf(4286,negated_conjecture,(unorthogonal_lines(orthogonal_through_point(esk2_0,esk1_0),X1)|convergent_lines(esk2_0,X1)),inference(cn,[status(thm)],[4285,theory(equality)])).
% cnf(4297,negated_conjecture,(convergent_lines(esk2_0,esk2_0)),inference(spm,[status(thm)],[45,4286,theory(equality)])).
% cnf(4298,negated_conjecture,($false),inference(sr,[status(thm)],[4297,38,theory(equality)])).
% cnf(4299,negated_conjecture,($false),4298,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 703
% # ...of these trivial : 3
% # ...subsumed : 380
% # ...remaining for further processing: 320
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 1
% # Generated clauses : 3640
% # ...of the previous two non-trivial : 3210
% # Contextual simplify-reflections : 43
% # Paramodulations : 3230
% # Factorizations : 410
% # Equation resolutions : 0
% # Current number of processed clauses: 317
% # Positive orientable unit clauses: 42
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 268
% # Current number of unprocessed clauses: 2456
% # ...number of literals in the above : 12257
% # Clause-clause subsumption calls (NU) : 31588
% # Rec. Clause-clause subsumption calls : 13415
% # Unit Clause-clause subsumption calls : 3045
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 64
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 82 leaves, 4.11+/-4.971 terms/leaf
% # Paramod-from index: 57 leaves, 4.35+/-5.226 terms/leaf
% # Paramod-into index: 76 leaves, 4.21+/-4.980 terms/leaf
% # -------------------------------------------------
% # User time : 0.569 s
% # System time : 0.005 s
% # Total time : 0.574 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.70 CPU 0.77 WC
% FINAL PrfWatch: 0.70 CPU 0.77 WC
% SZS output end Solution for /tmp/SystemOnTPTP14893/GEO222+1.tptp
%
%------------------------------------------------------------------------------