%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO197+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:11:37 EST 2010
% Result : Theorem 1.43s
% Output : Solution 1.43s
% 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/SystemOnTPTP10128/GEO197+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10128/GEO197+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10128/GEO197+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 10260
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(3, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),file('/tmp/SRASS.s.p', ci3)).
% fof(4, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),file('/tmp/SRASS.s.p', ci4)).
% fof(9, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(distinct_lines(X2,X3)|convergent_lines(X1,X3))),file('/tmp/SRASS.s.p', ceq3)).
% fof(10, axiom,![X1]:![X2]:![X3]:(apart_point_and_line(X1,X2)=>(distinct_points(X1,X3)|apart_point_and_line(X3,X2))),file('/tmp/SRASS.s.p', ceq1)).
% fof(12, axiom,![X1]:![X2]:![X4]:![X5]:((distinct_points(X1,X2)&distinct_lines(X4,X5))=>(((apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))|apart_point_and_line(X2,X4))|apart_point_and_line(X2,X5))),file('/tmp/SRASS.s.p', cu1)).
% fof(15, conjecture,![X1]:![X2]:![X3]:((((convergent_lines(X1,X2)&convergent_lines(X3,X2))&convergent_lines(X1,X3))&~(apart_point_and_line(intersection_point(X1,X2),X3)))=>~(apart_point_and_line(intersection_point(X3,X2),X1))),file('/tmp/SRASS.s.p', con)).
% fof(16, negated_conjecture,~(![X1]:![X2]:![X3]:((((convergent_lines(X1,X2)&convergent_lines(X3,X2))&convergent_lines(X1,X3))&~(apart_point_and_line(intersection_point(X1,X2),X3)))=>~(apart_point_and_line(intersection_point(X3,X2),X1)))),inference(assume_negation,[status(cth)],[15])).
% fof(17, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(18, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(19, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(24, negated_conjecture,~(![X1]:![X2]:![X3]:((((convergent_lines(X1,X2)&convergent_lines(X3,X2))&convergent_lines(X1,X3))&~(apart_point_and_line(intersection_point(X1,X2),X3)))=>~(apart_point_and_line(intersection_point(X3,X2),X1)))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(25, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[17])).
% cnf(26,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(30, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[18])).
% fof(31, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X3))),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_nnf,[status(thm)],[19])).
% fof(34, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X4))),inference(variable_rename,[status(thm)],[33])).
% cnf(35,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[34])).
% fof(46, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(distinct_lines(X2,X3)|convergent_lines(X1,X3))),inference(fof_nnf,[status(thm)],[9])).
% fof(47, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(distinct_lines(X5,X6)|convergent_lines(X4,X6))),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X1]:![X2]:![X3]:(~(apart_point_and_line(X1,X2))|(distinct_points(X1,X3)|apart_point_and_line(X3,X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(50, plain,![X4]:![X5]:![X6]:(~(apart_point_and_line(X4,X5))|(distinct_points(X4,X6)|apart_point_and_line(X6,X5))),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[50])).
% fof(55, plain,![X1]:![X2]:![X4]:![X5]:((~(distinct_points(X1,X2))|~(distinct_lines(X4,X5)))|(((apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))|apart_point_and_line(X2,X4))|apart_point_and_line(X2,X5))),inference(fof_nnf,[status(thm)],[12])).
% fof(56, plain,![X6]:![X7]:![X8]:![X9]:((~(distinct_points(X6,X7))|~(distinct_lines(X8,X9)))|(((apart_point_and_line(X6,X8)|apart_point_and_line(X6,X9))|apart_point_and_line(X7,X8))|apart_point_and_line(X7,X9))),inference(variable_rename,[status(thm)],[55])).
% cnf(57,plain,(apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3)|apart_point_and_line(X4,X2)|apart_point_and_line(X4,X3)|~distinct_lines(X3,X2)|~distinct_points(X4,X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(64, negated_conjecture,?[X1]:?[X2]:?[X3]:((((convergent_lines(X1,X2)&convergent_lines(X3,X2))&convergent_lines(X1,X3))&~(apart_point_and_line(intersection_point(X1,X2),X3)))&apart_point_and_line(intersection_point(X3,X2),X1)),inference(fof_nnf,[status(thm)],[24])).
% fof(65, negated_conjecture,?[X4]:?[X5]:?[X6]:((((convergent_lines(X4,X5)&convergent_lines(X6,X5))&convergent_lines(X4,X6))&~(apart_point_and_line(intersection_point(X4,X5),X6)))&apart_point_and_line(intersection_point(X6,X5),X4)),inference(variable_rename,[status(thm)],[64])).
% fof(66, negated_conjecture,((((convergent_lines(esk1_0,esk2_0)&convergent_lines(esk3_0,esk2_0))&convergent_lines(esk1_0,esk3_0))&~(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)))&apart_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0)),inference(skolemize,[status(esa)],[65])).
% cnf(67,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(68,negated_conjecture,(~apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(70,negated_conjecture,(convergent_lines(esk3_0,esk2_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(71,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(75,negated_conjecture,(distinct_lines(esk2_0,X1)|convergent_lines(esk3_0,X1)),inference(spm,[status(thm)],[48,70,theory(equality)])).
% cnf(78,negated_conjecture,(distinct_points(intersection_point(esk3_0,esk2_0),X1)|apart_point_and_line(X1,esk1_0)),inference(spm,[status(thm)],[51,67,theory(equality)])).
% cnf(96,negated_conjecture,(apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,X2)|apart_point_and_line(X3,esk2_0)|apart_point_and_line(X3,X2)|convergent_lines(esk3_0,X2)|~distinct_points(X1,X3)),inference(spm,[status(thm)],[57,75,theory(equality)])).
% cnf(303,negated_conjecture,(apart_point_and_line(X1,esk2_0)|apart_point_and_line(intersection_point(esk3_0,esk2_0),esk2_0)|apart_point_and_line(X1,X2)|apart_point_and_line(intersection_point(esk3_0,esk2_0),X2)|convergent_lines(esk3_0,X2)|apart_point_and_line(X1,esk1_0)),inference(spm,[status(thm)],[96,78,theory(equality)])).
% cnf(2295,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk2_0),esk2_0)|apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk3_0)|convergent_lines(esk3_0,esk3_0)|~convergent_lines(esk3_0,esk2_0)),inference(spm,[status(thm)],[32,303,theory(equality)])).
% cnf(2315,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk2_0),esk2_0)|apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk3_0)|convergent_lines(esk3_0,esk3_0)|$false),inference(rw,[status(thm)],[2295,70,theory(equality)])).
% cnf(2316,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk2_0),esk2_0)|apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk3_0)|convergent_lines(esk3_0,esk3_0)),inference(cn,[status(thm)],[2315,theory(equality)])).
% cnf(2317,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk2_0),esk2_0)|apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk3_0)),inference(sr,[status(thm)],[2316,26,theory(equality)])).
% cnf(3312,negated_conjecture,(apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)|~convergent_lines(esk3_0,esk2_0)),inference(spm,[status(thm)],[35,2317,theory(equality)])).
% cnf(3313,negated_conjecture,(apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)|$false),inference(rw,[status(thm)],[3312,70,theory(equality)])).
% cnf(3314,negated_conjecture,(apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)),inference(cn,[status(thm)],[3313,theory(equality)])).
% cnf(3317,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)),inference(spm,[status(thm)],[68,3314,theory(equality)])).
% cnf(3322,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[32,3317,theory(equality)])).
% cnf(3323,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|$false),inference(rw,[status(thm)],[3322,71,theory(equality)])).
% cnf(3324,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)),inference(cn,[status(thm)],[3323,theory(equality)])).
% cnf(3327,negated_conjecture,(~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[35,3324,theory(equality)])).
% cnf(3329,negated_conjecture,($false),inference(rw,[status(thm)],[3327,71,theory(equality)])).
% cnf(3330,negated_conjecture,($false),inference(cn,[status(thm)],[3329,theory(equality)])).
% cnf(3331,negated_conjecture,($false),3330,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1025
% # ...of these trivial : 0
% # ...subsumed : 714
% # ...remaining for further processing: 311
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 19
% # Backward-rewritten : 1
% # Generated clauses : 2551
% # ...of the previous two non-trivial : 2180
% # Contextual simplify-reflections : 216
% # Paramodulations : 1865
% # Factorizations : 686
% # Equation resolutions : 0
% # Current number of processed clauses: 272
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 254
% # Current number of unprocessed clauses: 1113
% # ...number of literals in the above : 5886
% # Clause-clause subsumption calls (NU) : 16349
% # Rec. Clause-clause subsumption calls : 7520
% # Unit Clause-clause subsumption calls : 134
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 53 leaves, 2.09+/-2.002 terms/leaf
% # Paramod-from index: 39 leaves, 1.69+/-1.158 terms/leaf
% # Paramod-into index: 51 leaves, 1.78+/-1.486 terms/leaf
% # -------------------------------------------------
% # User time : 0.307 s
% # System time : 0.004 s
% # Total time : 0.311 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.44 CPU 0.51 WC
% FINAL PrfWatch: 0.44 CPU 0.51 WC
% SZS output end Solution for /tmp/SystemOnTPTP10128/GEO197+1.tptp
%
%------------------------------------------------------------------------------