TSTP Solution File: GEO175+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO175+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 : 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:00:34 EST 2010
% Result : Theorem 4.03s
% Output : Solution 4.03s
% 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/SystemOnTPTP11006/GEO175+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11006/GEO175+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11006/GEO175+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 11102
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(5, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),file('/tmp/SRASS.s.p', ci3)).
% fof(6, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),file('/tmp/SRASS.s.p', ci4)).
% fof(8, axiom,![X1]:![X2]:![X4]:![X5]:((distinct_points(X1,X2)&distinct_lines(X4,X5))=>(((apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))|apart_point_and_line(X2,X4))|apart_point_and_line(X2,X5))),file('/tmp/SRASS.s.p', cu1)).
% fof(17, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(distinct_lines(X2,X3)|convergent_lines(X1,X3))),file('/tmp/SRASS.s.p', ceq3)).
% fof(36, conjecture,![X1]:![X2]:![X4]:![X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&distinct_points(X1,intersection_point(X4,X5)))=>(apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:![X4]:![X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&distinct_points(X1,intersection_point(X4,X5)))=>(apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5)))),inference(assume_negation,[status(cth)],[36])).
% fof(39, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(40, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(41, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(59, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[39])).
% cnf(60,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(67, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[40])).
% fof(68, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X3))),inference(variable_rename,[status(thm)],[67])).
% cnf(69,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[68])).
% fof(70, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_nnf,[status(thm)],[41])).
% fof(71, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X4))),inference(variable_rename,[status(thm)],[70])).
% cnf(72,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[71])).
% fof(76, plain,![X1]:![X2]:![X4]:![X5]:((~(distinct_points(X1,X2))|~(distinct_lines(X4,X5)))|(((apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))|apart_point_and_line(X2,X4))|apart_point_and_line(X2,X5))),inference(fof_nnf,[status(thm)],[8])).
% fof(77, plain,![X6]:![X7]:![X8]:![X9]:((~(distinct_points(X6,X7))|~(distinct_lines(X8,X9)))|(((apart_point_and_line(X6,X8)|apart_point_and_line(X6,X9))|apart_point_and_line(X7,X8))|apart_point_and_line(X7,X9))),inference(variable_rename,[status(thm)],[76])).
% cnf(78,plain,(apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3)|apart_point_and_line(X4,X2)|apart_point_and_line(X4,X3)|~distinct_lines(X3,X2)|~distinct_points(X4,X1)),inference(split_conjunct,[status(thm)],[77])).
% fof(103, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(distinct_lines(X2,X3)|convergent_lines(X1,X3))),inference(fof_nnf,[status(thm)],[17])).
% fof(104, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(distinct_lines(X5,X6)|convergent_lines(X4,X6))),inference(variable_rename,[status(thm)],[103])).
% cnf(105,plain,(convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(split_conjunct,[status(thm)],[104])).
% fof(167, negated_conjecture,?[X1]:?[X2]:?[X4]:?[X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&distinct_points(X1,intersection_point(X4,X5)))&(~(apart_point_and_line(X1,X4))&~(apart_point_and_line(X1,X5)))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:(((distinct_points(X6,X7)&convergent_lines(X8,X9))&distinct_points(X6,intersection_point(X8,X9)))&(~(apart_point_and_line(X6,X8))&~(apart_point_and_line(X6,X9)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,(((distinct_points(esk1_0,esk2_0)&convergent_lines(esk3_0,esk4_0))&distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)))&(~(apart_point_and_line(esk1_0,esk3_0))&~(apart_point_and_line(esk1_0,esk4_0)))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~apart_point_and_line(esk1_0,esk4_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(~apart_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(distinct_points(esk1_0,intersection_point(esk3_0,esk4_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(173,negated_conjecture,(convergent_lines(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(182,negated_conjecture,(distinct_lines(esk4_0,X1)|convergent_lines(esk3_0,X1)),inference(spm,[status(thm)],[105,173,theory(equality)])).
% cnf(208,negated_conjecture,(apart_point_and_line(X1,X2)|apart_point_and_line(X1,esk4_0)|apart_point_and_line(X3,X2)|apart_point_and_line(X3,esk4_0)|convergent_lines(esk3_0,X2)|~distinct_points(X3,X1)),inference(spm,[status(thm)],[78,182,theory(equality)])).
% cnf(659,negated_conjecture,(apart_point_and_line(esk1_0,esk4_0)|apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0)|apart_point_and_line(esk1_0,X1)|apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)|convergent_lines(esk3_0,X1)),inference(spm,[status(thm)],[208,172,theory(equality)])).
% cnf(662,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0)|apart_point_and_line(esk1_0,X1)|apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)|convergent_lines(esk3_0,X1)),inference(sr,[status(thm)],[659,170,theory(equality)])).
% cnf(34601,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)|apart_point_and_line(esk1_0,X1)|convergent_lines(esk3_0,X1)|~convergent_lines(esk3_0,esk4_0)),inference(spm,[status(thm)],[72,662,theory(equality)])).
% cnf(34604,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)|apart_point_and_line(esk1_0,X1)|convergent_lines(esk3_0,X1)|$false),inference(rw,[status(thm)],[34601,173,theory(equality)])).
% cnf(34605,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)|apart_point_and_line(esk1_0,X1)|convergent_lines(esk3_0,X1)),inference(cn,[status(thm)],[34604,theory(equality)])).
% cnf(34613,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)|convergent_lines(esk3_0,esk3_0)|~convergent_lines(esk3_0,esk4_0)),inference(spm,[status(thm)],[69,34605,theory(equality)])).
% cnf(34617,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)|convergent_lines(esk3_0,esk3_0)|$false),inference(rw,[status(thm)],[34613,173,theory(equality)])).
% cnf(34618,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)|convergent_lines(esk3_0,esk3_0)),inference(cn,[status(thm)],[34617,theory(equality)])).
% cnf(34619,negated_conjecture,(convergent_lines(esk3_0,esk3_0)),inference(sr,[status(thm)],[34618,171,theory(equality)])).
% cnf(34620,negated_conjecture,($false),inference(sr,[status(thm)],[34619,60,theory(equality)])).
% cnf(34621,negated_conjecture,($false),34620,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2126
% # ...of these trivial : 29
% # ...subsumed : 1100
% # ...remaining for further processing: 997
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 20
% # Backward-rewritten : 5
% # Generated clauses : 32439
% # ...of the previous two non-trivial : 30979
% # Contextual simplify-reflections : 190
% # Paramodulations : 31459
% # Factorizations : 980
% # Equation resolutions : 0
% # Current number of processed clauses: 972
% # Positive orientable unit clauses: 108
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 855
% # Current number of unprocessed clauses: 28064
% # ...number of literals in the above : 155694
% # Clause-clause subsumption calls (NU) : 58245
% # Rec. Clause-clause subsumption calls : 27449
% # Unit Clause-clause subsumption calls : 1812
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 366
% # Indexed BW rewrite successes : 13
% # Backwards rewriting index: 192 leaves, 4.15+/-5.294 terms/leaf
% # Paramod-from index: 145 leaves, 3.90+/-4.912 terms/leaf
% # Paramod-into index: 180 leaves, 4.04+/-4.980 terms/leaf
% # -------------------------------------------------
% # User time : 2.650 s
% # System time : 0.047 s
% # Total time : 2.697 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.20 CPU 3.30 WC
% FINAL PrfWatch: 3.20 CPU 3.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP11006/GEO175+3.tptp
%
%------------------------------------------------------------------------------