TSTP Solution File: GEO258+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO258+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 : art05.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:24:42 EST 2010
% Result : Theorem 0.95s
% Output : Solution 0.95s
% 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/SystemOnTPTP20697/GEO258+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20697/GEO258+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20697/GEO258+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 20793
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:(between_on_line(X1,X2,X3,X4)<=>((before_on_line(X1,X2,X3)&before_on_line(X1,X3,X4))|(before_on_line(X1,X4,X3)&before_on_line(X1,X3,X2)))),file('/tmp/SRASS.s.p', a9_defns)).
% fof(37, conjecture,![X1]:![X2]:![X3]:![X4]:(between_on_line(X1,X2,X3,X4)=>between_on_line(X1,X4,X3,X2)),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(between_on_line(X1,X2,X3,X4)=>between_on_line(X1,X4,X3,X2))),inference(assume_negation,[status(cth)],[37])).
% fof(47, plain,![X1]:![X2]:![X3]:![X4]:((~(between_on_line(X1,X2,X3,X4))|((before_on_line(X1,X2,X3)&before_on_line(X1,X3,X4))|(before_on_line(X1,X4,X3)&before_on_line(X1,X3,X2))))&(((~(before_on_line(X1,X2,X3))|~(before_on_line(X1,X3,X4)))&(~(before_on_line(X1,X4,X3))|~(before_on_line(X1,X3,X2))))|between_on_line(X1,X2,X3,X4))),inference(fof_nnf,[status(thm)],[1])).
% fof(48, plain,![X5]:![X6]:![X7]:![X8]:((~(between_on_line(X5,X6,X7,X8))|((before_on_line(X5,X6,X7)&before_on_line(X5,X7,X8))|(before_on_line(X5,X8,X7)&before_on_line(X5,X7,X6))))&(((~(before_on_line(X5,X6,X7))|~(before_on_line(X5,X7,X8)))&(~(before_on_line(X5,X8,X7))|~(before_on_line(X5,X7,X6))))|between_on_line(X5,X6,X7,X8))),inference(variable_rename,[status(thm)],[47])).
% fof(49, plain,![X5]:![X6]:![X7]:![X8]:(((((before_on_line(X5,X8,X7)|before_on_line(X5,X6,X7))|~(between_on_line(X5,X6,X7,X8)))&((before_on_line(X5,X7,X6)|before_on_line(X5,X6,X7))|~(between_on_line(X5,X6,X7,X8))))&(((before_on_line(X5,X8,X7)|before_on_line(X5,X7,X8))|~(between_on_line(X5,X6,X7,X8)))&((before_on_line(X5,X7,X6)|before_on_line(X5,X7,X8))|~(between_on_line(X5,X6,X7,X8)))))&(((~(before_on_line(X5,X6,X7))|~(before_on_line(X5,X7,X8)))|between_on_line(X5,X6,X7,X8))&((~(before_on_line(X5,X8,X7))|~(before_on_line(X5,X7,X6)))|between_on_line(X5,X6,X7,X8)))),inference(distribute,[status(thm)],[48])).
% cnf(50,plain,(between_on_line(X1,X2,X3,X4)|~before_on_line(X1,X3,X2)|~before_on_line(X1,X4,X3)),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,plain,(between_on_line(X1,X2,X3,X4)|~before_on_line(X1,X3,X4)|~before_on_line(X1,X2,X3)),inference(split_conjunct,[status(thm)],[49])).
% cnf(52,plain,(before_on_line(X1,X3,X4)|before_on_line(X1,X3,X2)|~between_on_line(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[49])).
% cnf(53,plain,(before_on_line(X1,X3,X4)|before_on_line(X1,X4,X3)|~between_on_line(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[49])).
% cnf(54,plain,(before_on_line(X1,X2,X3)|before_on_line(X1,X3,X2)|~between_on_line(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[49])).
% cnf(55,plain,(before_on_line(X1,X2,X3)|before_on_line(X1,X4,X3)|~between_on_line(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[49])).
% fof(186, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:(between_on_line(X1,X2,X3,X4)&~(between_on_line(X1,X4,X3,X2))),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:(between_on_line(X5,X6,X7,X8)&~(between_on_line(X5,X8,X7,X6))),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,(between_on_line(esk1_0,esk2_0,esk3_0,esk4_0)&~(between_on_line(esk1_0,esk4_0,esk3_0,esk2_0))),inference(skolemize,[status(esa)],[187])).
% cnf(189,negated_conjecture,(~between_on_line(esk1_0,esk4_0,esk3_0,esk2_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(190,negated_conjecture,(between_on_line(esk1_0,esk2_0,esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(236,negated_conjecture,(~before_on_line(esk1_0,esk2_0,esk3_0)|~before_on_line(esk1_0,esk3_0,esk4_0)),inference(spm,[status(thm)],[189,50,theory(equality)])).
% cnf(237,negated_conjecture,(~before_on_line(esk1_0,esk3_0,esk2_0)|~before_on_line(esk1_0,esk4_0,esk3_0)),inference(spm,[status(thm)],[189,51,theory(equality)])).
% cnf(238,negated_conjecture,(before_on_line(esk1_0,esk4_0,esk3_0)|before_on_line(esk1_0,esk3_0,esk4_0)),inference(spm,[status(thm)],[53,190,theory(equality)])).
% cnf(241,negated_conjecture,(before_on_line(esk1_0,esk4_0,esk3_0)|before_on_line(esk1_0,esk2_0,esk3_0)),inference(spm,[status(thm)],[55,190,theory(equality)])).
% cnf(249,negated_conjecture,(before_on_line(esk1_0,esk3_0,esk4_0)|before_on_line(esk1_0,esk3_0,esk2_0)),inference(spm,[status(thm)],[52,190,theory(equality)])).
% cnf(252,negated_conjecture,(before_on_line(esk1_0,esk3_0,esk2_0)|before_on_line(esk1_0,esk2_0,esk3_0)),inference(spm,[status(thm)],[54,190,theory(equality)])).
% cnf(278,negated_conjecture,(before_on_line(esk1_0,esk3_0,esk4_0)|~before_on_line(esk1_0,esk3_0,esk2_0)),inference(spm,[status(thm)],[237,238,theory(equality)])).
% cnf(282,negated_conjecture,(~before_on_line(esk1_0,esk2_0,esk3_0)|~before_on_line(esk1_0,esk3_0,esk2_0)),inference(spm,[status(thm)],[236,278,theory(equality)])).
% cnf(291,negated_conjecture,(before_on_line(esk1_0,esk2_0,esk3_0)|~before_on_line(esk1_0,esk3_0,esk2_0)),inference(spm,[status(thm)],[237,241,theory(equality)])).
% cnf(294,negated_conjecture,(~before_on_line(esk1_0,esk3_0,esk2_0)),inference(csr,[status(thm)],[291,282])).
% cnf(297,negated_conjecture,(before_on_line(esk1_0,esk3_0,esk4_0)),inference(sr,[status(thm)],[249,294,theory(equality)])).
% cnf(302,negated_conjecture,(~before_on_line(esk1_0,esk2_0,esk3_0)|$false),inference(rw,[status(thm)],[236,297,theory(equality)])).
% cnf(303,negated_conjecture,(~before_on_line(esk1_0,esk2_0,esk3_0)),inference(cn,[status(thm)],[302,theory(equality)])).
% cnf(322,negated_conjecture,(before_on_line(esk1_0,esk2_0,esk3_0)),inference(sr,[status(thm)],[252,294,theory(equality)])).
% cnf(323,negated_conjecture,($false),inference(sr,[status(thm)],[322,303,theory(equality)])).
% cnf(324,negated_conjecture,($false),323,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 149
% # ...of these trivial : 2
% # ...subsumed : 25
% # ...remaining for further processing: 122
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 7
% # Generated clauses : 68
% # ...of the previous two non-trivial : 49
% # Contextual simplify-reflections : 9
% # Paramodulations : 63
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 59
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 16
% # Non-unit-clauses : 32
% # Current number of unprocessed clauses: 11
% # ...number of literals in the above : 29
% # Clause-clause subsumption calls (NU) : 183
% # Rec. Clause-clause subsumption calls : 162
% # Unit Clause-clause subsumption calls : 110
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 52 leaves, 1.54+/-1.308 terms/leaf
% # Paramod-from index: 22 leaves, 1.05+/-0.208 terms/leaf
% # Paramod-into index: 47 leaves, 1.30+/-0.682 terms/leaf
% # -------------------------------------------------
% # User time : 0.021 s
% # System time : 0.006 s
% # Total time : 0.027 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP20697/GEO258+3.tptp
%
%------------------------------------------------------------------------------