TSTP Solution File: GEO241+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO241+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:21:45 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP16965/GEO241+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16965/GEO241+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16965/GEO241+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 17061
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X4]:![X5]:~((left_convergent_lines(X4,X5)|left_convergent_lines(X4,reverse_line(X5)))),file('/tmp/SRASS.s.p', ax11_basics)).
% fof(37, conjecture,![X1]:![X2]:![X4]:(((incident_point_and_line(X1,X4)&distinct_points(X1,X2))&left_convergent_lines(X4,line_connecting(X1,X2)))=>left_apart_point(X2,X4)),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X1]:![X2]:![X4]:(((incident_point_and_line(X1,X4)&distinct_points(X1,X2))&left_convergent_lines(X4,line_connecting(X1,X2)))=>left_apart_point(X2,X4))),inference(assume_negation,[status(cth)],[37])).
% fof(63, plain,![X4]:![X5]:(~(left_convergent_lines(X4,X5))&~(left_convergent_lines(X4,reverse_line(X5)))),inference(fof_nnf,[status(thm)],[6])).
% fof(64, plain,![X6]:![X7]:(~(left_convergent_lines(X6,X7))&~(left_convergent_lines(X6,reverse_line(X7)))),inference(variable_rename,[status(thm)],[63])).
% cnf(66,plain,(~left_convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[64])).
% fof(186, negated_conjecture,?[X1]:?[X2]:?[X4]:(((incident_point_and_line(X1,X4)&distinct_points(X1,X2))&left_convergent_lines(X4,line_connecting(X1,X2)))&~(left_apart_point(X2,X4))),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X5]:?[X6]:?[X7]:(((incident_point_and_line(X5,X7)&distinct_points(X5,X6))&left_convergent_lines(X7,line_connecting(X5,X6)))&~(left_apart_point(X6,X7))),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,(((incident_point_and_line(esk1_0,esk3_0)&distinct_points(esk1_0,esk2_0))&left_convergent_lines(esk3_0,line_connecting(esk1_0,esk2_0)))&~(left_apart_point(esk2_0,esk3_0))),inference(skolemize,[status(esa)],[187])).
% cnf(190,negated_conjecture,(left_convergent_lines(esk3_0,line_connecting(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[188])).
% cnf(193,negated_conjecture,($false),inference(sr,[status(thm)],[190,66,theory(equality)])).
% cnf(194,negated_conjecture,($false),193,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 10
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 10
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 9
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 60
% # ...number of literals in the above : 166
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 15 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 13 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.002 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP16965/GEO241+3.tptp
%
%------------------------------------------------------------------------------