TSTP Solution File: GEO238+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO238+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:21:01 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP18366/GEO238+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18366/GEO238+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18366/GEO238+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 18462
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(right_apart_point(X1,X2)<=>left_apart_point(X1,reverse_line(X2))),file('/tmp/SRASS.s.p', a2_defns)).
% fof(2, axiom,![X3]:![X4]:![X5]:(divides_points(X5,X3,X4)<=>((left_apart_point(X3,X5)&right_apart_point(X4,X5))|(right_apart_point(X3,X5)&left_apart_point(X4,X5)))),file('/tmp/SRASS.s.p', a8_defns)).
% fof(6, axiom,![X3]:![X5]:~((left_apart_point(X3,X5)|left_apart_point(X3,reverse_line(X5)))),file('/tmp/SRASS.s.p', ax10_basics)).
% fof(37, conjecture,![X3]:![X4]:![X6]:![X5]:((divides_points(X5,X3,X4)÷s_points(X5,X3,X6))=>~(divides_points(X5,X4,X6))),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X3]:![X4]:![X6]:![X5]:((divides_points(X5,X3,X4)÷s_points(X5,X3,X6))=>~(divides_points(X5,X4,X6)))),inference(assume_negation,[status(cth)],[37])).
% fof(47, negated_conjecture,~(![X3]:![X4]:![X6]:![X5]:((divides_points(X5,X3,X4)÷s_points(X5,X3,X6))=>~(divides_points(X5,X4,X6)))),inference(fof_simplification,[status(thm)],[38,theory(equality)])).
% fof(48, plain,![X1]:![X2]:((~(right_apart_point(X1,X2))|left_apart_point(X1,reverse_line(X2)))&(~(left_apart_point(X1,reverse_line(X2)))|right_apart_point(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,![X3]:![X4]:((~(right_apart_point(X3,X4))|left_apart_point(X3,reverse_line(X4)))&(~(left_apart_point(X3,reverse_line(X4)))|right_apart_point(X3,X4))),inference(variable_rename,[status(thm)],[48])).
% cnf(51,plain,(left_apart_point(X1,reverse_line(X2))|~right_apart_point(X1,X2)),inference(split_conjunct,[status(thm)],[49])).
% fof(52, plain,![X3]:![X4]:![X5]:((~(divides_points(X5,X3,X4))|((left_apart_point(X3,X5)&right_apart_point(X4,X5))|(right_apart_point(X3,X5)&left_apart_point(X4,X5))))&(((~(left_apart_point(X3,X5))|~(right_apart_point(X4,X5)))&(~(right_apart_point(X3,X5))|~(left_apart_point(X4,X5))))|divides_points(X5,X3,X4))),inference(fof_nnf,[status(thm)],[2])).
% fof(53, plain,![X6]:![X7]:![X8]:((~(divides_points(X8,X6,X7))|((left_apart_point(X6,X8)&right_apart_point(X7,X8))|(right_apart_point(X6,X8)&left_apart_point(X7,X8))))&(((~(left_apart_point(X6,X8))|~(right_apart_point(X7,X8)))&(~(right_apart_point(X6,X8))|~(left_apart_point(X7,X8))))|divides_points(X8,X6,X7))),inference(variable_rename,[status(thm)],[52])).
% fof(54, plain,![X6]:![X7]:![X8]:(((((right_apart_point(X6,X8)|left_apart_point(X6,X8))|~(divides_points(X8,X6,X7)))&((left_apart_point(X7,X8)|left_apart_point(X6,X8))|~(divides_points(X8,X6,X7))))&(((right_apart_point(X6,X8)|right_apart_point(X7,X8))|~(divides_points(X8,X6,X7)))&((left_apart_point(X7,X8)|right_apart_point(X7,X8))|~(divides_points(X8,X6,X7)))))&(((~(left_apart_point(X6,X8))|~(right_apart_point(X7,X8)))|divides_points(X8,X6,X7))&((~(right_apart_point(X6,X8))|~(left_apart_point(X7,X8)))|divides_points(X8,X6,X7)))),inference(distribute,[status(thm)],[53])).
% cnf(58,plain,(right_apart_point(X3,X1)|right_apart_point(X2,X1)|~divides_points(X1,X2,X3)),inference(split_conjunct,[status(thm)],[54])).
% fof(72, plain,![X3]:![X5]:(~(left_apart_point(X3,X5))&~(left_apart_point(X3,reverse_line(X5)))),inference(fof_nnf,[status(thm)],[6])).
% fof(73, plain,![X6]:![X7]:(~(left_apart_point(X6,X7))&~(left_apart_point(X6,reverse_line(X7)))),inference(variable_rename,[status(thm)],[72])).
% cnf(75,plain,(~left_apart_point(X1,X2)),inference(split_conjunct,[status(thm)],[73])).
% fof(187, negated_conjecture,?[X3]:?[X4]:?[X6]:?[X5]:((divides_points(X5,X3,X4)÷s_points(X5,X3,X6))÷s_points(X5,X4,X6)),inference(fof_nnf,[status(thm)],[47])).
% fof(188, negated_conjecture,?[X7]:?[X8]:?[X9]:?[X10]:((divides_points(X10,X7,X8)÷s_points(X10,X7,X9))÷s_points(X10,X8,X9)),inference(variable_rename,[status(thm)],[187])).
% fof(189, negated_conjecture,((divides_points(esk4_0,esk1_0,esk2_0)÷s_points(esk4_0,esk1_0,esk3_0))÷s_points(esk4_0,esk2_0,esk3_0)),inference(skolemize,[status(esa)],[188])).
% cnf(192,negated_conjecture,(divides_points(esk4_0,esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[189])).
% cnf(193,plain,(~right_apart_point(X1,X2)),inference(sr,[status(thm)],[51,75,theory(equality)])).
% cnf(195,plain,(right_apart_point(X2,X1)|~divides_points(X1,X2,X3)),inference(sr,[status(thm)],[58,193,theory(equality)])).
% cnf(196,plain,(~divides_points(X1,X2,X3)),inference(sr,[status(thm)],[195,193,theory(equality)])).
% cnf(197,negated_conjecture,($false),inference(sr,[status(thm)],[192,196,theory(equality)])).
% cnf(198,negated_conjecture,($false),197,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 29
% # ...of these trivial : 0
% # ...subsumed : 6
% # ...remaining for further processing: 23
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 3
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 20
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 10
% # Current number of unprocessed clauses: 40
% # ...number of literals in the above : 129
% # Clause-clause subsumption calls (NU) : 2
% # Rec. Clause-clause subsumption calls : 2
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 22 leaves, 1.18+/-0.386 terms/leaf
% # Paramod-from index: 7 leaves, 1.14+/-0.350 terms/leaf
% # Paramod-into index: 19 leaves, 1.21+/-0.408 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.004 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/SystemOnTPTP18366/GEO238+3.tptp
%
%------------------------------------------------------------------------------