TSTP Solution File: GEO192+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO192+1 : TPTP v5.0.0. Released v3.3.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:10:07 EST 2010
% Result : Theorem 1.12s
% Output : Solution 1.12s
% 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/SystemOnTPTP9726/GEO192+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9726/GEO192+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9726/GEO192+1.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 9858
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(3, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% 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_lines(X2,X3)|apart_point_and_line(X1,X3))),file('/tmp/SRASS.s.p', ceq2)).
% fof(15, conjecture,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(apart_point_and_line(intersection_point(X1,X2),X3)=>(distinct_lines(X1,X3)&distinct_lines(X2,X3)))),file('/tmp/SRASS.s.p', con)).
% fof(16, negated_conjecture,~(![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(apart_point_and_line(intersection_point(X1,X2),X3)=>(distinct_lines(X1,X3)&distinct_lines(X2,X3))))),inference(assume_negation,[status(cth)],[15])).
% fof(17, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(19, 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(20, 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(24, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[17])).
% cnf(25,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(28, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(29, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[28])).
% cnf(30,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(34, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[19])).
% fof(35, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X3))),inference(variable_rename,[status(thm)],[34])).
% cnf(36,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_nnf,[status(thm)],[20])).
% fof(38, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X4))),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X1]:![X2]:![X3]:(~(apart_point_and_line(X1,X2))|(distinct_lines(X2,X3)|apart_point_and_line(X1,X3))),inference(fof_nnf,[status(thm)],[7])).
% fof(41, plain,![X4]:![X5]:![X6]:(~(apart_point_and_line(X4,X5))|(distinct_lines(X5,X6)|apart_point_and_line(X4,X6))),inference(variable_rename,[status(thm)],[40])).
% cnf(42,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[41])).
% fof(63, negated_conjecture,?[X1]:?[X2]:?[X3]:(convergent_lines(X1,X2)&(apart_point_and_line(intersection_point(X1,X2),X3)&(~(distinct_lines(X1,X3))|~(distinct_lines(X2,X3))))),inference(fof_nnf,[status(thm)],[16])).
% fof(64, negated_conjecture,?[X4]:?[X5]:?[X6]:(convergent_lines(X4,X5)&(apart_point_and_line(intersection_point(X4,X5),X6)&(~(distinct_lines(X4,X6))|~(distinct_lines(X5,X6))))),inference(variable_rename,[status(thm)],[63])).
% fof(65, negated_conjecture,(convergent_lines(esk1_0,esk2_0)&(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)&(~(distinct_lines(esk1_0,esk3_0))|~(distinct_lines(esk2_0,esk3_0))))),inference(skolemize,[status(esa)],[64])).
% cnf(66,negated_conjecture,(~distinct_lines(esk2_0,esk3_0)|~distinct_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(67,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(68,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(70,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)|distinct_lines(esk3_0,X1)),inference(spm,[status(thm)],[42,67,theory(equality)])).
% cnf(80,negated_conjecture,(distinct_lines(esk3_0,esk2_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[39,70,theory(equality)])).
% cnf(81,negated_conjecture,(distinct_lines(esk3_0,esk1_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[36,70,theory(equality)])).
% cnf(82,negated_conjecture,(distinct_lines(esk3_0,esk2_0)|$false),inference(rw,[status(thm)],[80,68,theory(equality)])).
% cnf(83,negated_conjecture,(distinct_lines(esk3_0,esk2_0)),inference(cn,[status(thm)],[82,theory(equality)])).
% cnf(84,negated_conjecture,(distinct_lines(esk3_0,esk1_0)|$false),inference(rw,[status(thm)],[81,68,theory(equality)])).
% cnf(85,negated_conjecture,(distinct_lines(esk3_0,esk1_0)),inference(cn,[status(thm)],[84,theory(equality)])).
% cnf(86,negated_conjecture,(distinct_lines(esk3_0,X1)|distinct_lines(esk2_0,X1)),inference(spm,[status(thm)],[30,83,theory(equality)])).
% cnf(87,negated_conjecture,(distinct_lines(esk3_0,X1)|distinct_lines(esk1_0,X1)),inference(spm,[status(thm)],[30,85,theory(equality)])).
% cnf(88,negated_conjecture,(distinct_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[25,86,theory(equality)])).
% cnf(91,negated_conjecture,(~distinct_lines(esk1_0,esk3_0)|$false),inference(rw,[status(thm)],[66,88,theory(equality)])).
% cnf(92,negated_conjecture,(~distinct_lines(esk1_0,esk3_0)),inference(cn,[status(thm)],[91,theory(equality)])).
% cnf(98,negated_conjecture,(distinct_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[25,87,theory(equality)])).
% cnf(104,negated_conjecture,($false),inference(sr,[status(thm)],[98,92,theory(equality)])).
% cnf(105,negated_conjecture,($false),104,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 46
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 46
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 27
% # ...of the previous two non-trivial : 26
% # Contextual simplify-reflections : 0
% # Paramodulations : 27
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 27
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 17
% # Current number of unprocessed clauses: 14
% # ...number of literals in the above : 40
% # Clause-clause subsumption calls (NU) : 8
% # Rec. Clause-clause subsumption calls : 8
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 28 leaves, 1.61+/-1.319 terms/leaf
% # Paramod-from index: 11 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 24 leaves, 1.25+/-0.520 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.002 s
% # Total time : 0.014 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/SystemOnTPTP9726/GEO192+1.tptp
%
%------------------------------------------------------------------------------