TSTP Solution File: GEO216+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO216+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 : art03.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:13:44 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/SystemOnTPTP25187/GEO216+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25187/GEO216+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25187/GEO216+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 25283
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(orthogonal_lines(X1,X2)<=>~(unorthogonal_lines(X1,X2))),file('/tmp/SRASS.s.p', a5)).
% fof(3, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(6, axiom,![X4]:![X5]:(convergent_lines(X4,X5)|unorthogonal_lines(X4,X5)),file('/tmp/SRASS.s.p', occu1)).
% fof(36, conjecture,![X4]:~(orthogonal_lines(X4,X4)),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X4]:~(orthogonal_lines(X4,X4))),inference(assume_negation,[status(cth)],[36])).
% fof(38, plain,![X1]:![X2]:(orthogonal_lines(X1,X2)<=>~(unorthogonal_lines(X1,X2))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(40, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(57, negated_conjecture,~(![X4]:~(orthogonal_lines(X4,X4))),inference(fof_simplification,[status(thm)],[37,theory(equality)])).
% fof(58, plain,![X1]:![X2]:((~(orthogonal_lines(X1,X2))|~(unorthogonal_lines(X1,X2)))&(unorthogonal_lines(X1,X2)|orthogonal_lines(X1,X2))),inference(fof_nnf,[status(thm)],[38])).
% fof(59, plain,![X3]:![X4]:((~(orthogonal_lines(X3,X4))|~(unorthogonal_lines(X3,X4)))&(unorthogonal_lines(X3,X4)|orthogonal_lines(X3,X4))),inference(variable_rename,[status(thm)],[58])).
% cnf(61,plain,(~unorthogonal_lines(X1,X2)|~orthogonal_lines(X1,X2)),inference(split_conjunct,[status(thm)],[59])).
% fof(64, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[40])).
% cnf(65,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[64])).
% fof(72, plain,![X6]:![X7]:(convergent_lines(X6,X7)|unorthogonal_lines(X6,X7)),inference(variable_rename,[status(thm)],[6])).
% cnf(73,plain,(unorthogonal_lines(X1,X2)|convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[72])).
% fof(168, negated_conjecture,?[X4]:orthogonal_lines(X4,X4),inference(fof_nnf,[status(thm)],[57])).
% fof(169, negated_conjecture,?[X5]:orthogonal_lines(X5,X5),inference(variable_rename,[status(thm)],[168])).
% fof(170, negated_conjecture,orthogonal_lines(esk1_0,esk1_0),inference(skolemize,[status(esa)],[169])).
% cnf(171,negated_conjecture,(orthogonal_lines(esk1_0,esk1_0)),inference(split_conjunct,[status(thm)],[170])).
% cnf(173,negated_conjecture,(~unorthogonal_lines(esk1_0,esk1_0)),inference(spm,[status(thm)],[61,171,theory(equality)])).
% cnf(189,negated_conjecture,(convergent_lines(esk1_0,esk1_0)),inference(spm,[status(thm)],[173,73,theory(equality)])).
% cnf(190,negated_conjecture,($false),inference(sr,[status(thm)],[189,65,theory(equality)])).
% cnf(191,negated_conjecture,($false),190,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 48
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 44
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 14
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 4
% # Paramodulations : 14
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 44
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 35
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 1
% # Clause-clause subsumption calls (NU) : 50
% # Rec. Clause-clause subsumption calls : 50
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 30 leaves, 1.93+/-1.652 terms/leaf
% # Paramod-from index: 11 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 27 leaves, 1.59+/-1.097 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.006 s
% # Total time : 0.019 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP25187/GEO216+3.tptp
%
%------------------------------------------------------------------------------