TSTP Solution File: GEO176+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO176+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 : 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:05:28 EST 2010
% Result : Theorem 1.16s
% Output : Solution 1.16s
% 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/SystemOnTPTP7980/GEO176+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7980/GEO176+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7980/GEO176+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 8112
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% 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(7, axiom,![X1]:![X2]:![X3]:(apart_point_and_line(X1,X2)=>(distinct_points(X1,X3)|apart_point_and_line(X3,X2))),file('/tmp/SRASS.s.p', ceq1)).
% fof(36, conjecture,![X1]:![X2]:![X4]:![X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&(apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5)))=>distinct_points(X1,intersection_point(X4,X5))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:![X4]:![X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&(apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5)))=>distinct_points(X1,intersection_point(X4,X5)))),inference(assume_negation,[status(cth)],[36])).
% 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(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(73, plain,![X1]:![X2]:![X3]:(~(apart_point_and_line(X1,X2))|(distinct_points(X1,X3)|apart_point_and_line(X3,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(74, plain,![X4]:![X5]:![X6]:(~(apart_point_and_line(X4,X5))|(distinct_points(X4,X6)|apart_point_and_line(X6,X5))),inference(variable_rename,[status(thm)],[73])).
% cnf(75,plain,(apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[74])).
% fof(167, negated_conjecture,?[X1]:?[X2]:?[X4]:?[X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&(apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5)))&~(distinct_points(X1,intersection_point(X4,X5)))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:(((distinct_points(X6,X7)&convergent_lines(X8,X9))&(apart_point_and_line(X6,X8)|apart_point_and_line(X6,X9)))&~(distinct_points(X6,intersection_point(X8,X9)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,(((distinct_points(esk1_0,esk2_0)&convergent_lines(esk3_0,esk4_0))&(apart_point_and_line(esk1_0,esk3_0)|apart_point_and_line(esk1_0,esk4_0)))&~(distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~distinct_points(esk1_0,intersection_point(esk3_0,esk4_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(apart_point_and_line(esk1_0,esk4_0)|apart_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(convergent_lines(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(184,negated_conjecture,(apart_point_and_line(X1,esk4_0)|distinct_points(esk1_0,X1)|apart_point_and_line(esk1_0,esk3_0)),inference(spm,[status(thm)],[75,171,theory(equality)])).
% cnf(297,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)|apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0)),inference(spm,[status(thm)],[170,184,theory(equality)])).
% cnf(300,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)|~convergent_lines(esk3_0,esk4_0)),inference(spm,[status(thm)],[72,297,theory(equality)])).
% cnf(301,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)|$false),inference(rw,[status(thm)],[300,172,theory(equality)])).
% cnf(302,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)),inference(cn,[status(thm)],[301,theory(equality)])).
% cnf(303,negated_conjecture,(apart_point_and_line(X1,esk3_0)|distinct_points(esk1_0,X1)),inference(spm,[status(thm)],[75,302,theory(equality)])).
% cnf(311,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk4_0),esk3_0)),inference(spm,[status(thm)],[170,303,theory(equality)])).
% cnf(315,negated_conjecture,(~convergent_lines(esk3_0,esk4_0)),inference(spm,[status(thm)],[69,311,theory(equality)])).
% cnf(316,negated_conjecture,($false),inference(rw,[status(thm)],[315,172,theory(equality)])).
% cnf(317,negated_conjecture,($false),inference(cn,[status(thm)],[316,theory(equality)])).
% cnf(318,negated_conjecture,($false),317,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 77
% # ...of these trivial : 0
% # ...subsumed : 10
% # ...remaining for further processing: 67
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 123
% # ...of the previous two non-trivial : 102
% # Contextual simplify-reflections : 4
% # Paramodulations : 121
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 63
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 46
% # Current number of unprocessed clauses: 68
% # ...number of literals in the above : 259
% # Clause-clause subsumption calls (NU) : 71
% # Rec. Clause-clause subsumption calls : 69
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 54 leaves, 1.69+/-1.549 terms/leaf
% # Paramod-from index: 27 leaves, 1.11+/-0.416 terms/leaf
% # Paramod-into index: 48 leaves, 1.46+/-1.060 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.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP7980/GEO176+3.tptp
%
%------------------------------------------------------------------------------