↑ Up

SRASS---0.1.THM-Sol.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO171+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 : art02.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 04:59:05 EST 2010

% Result   : Theorem 0.88s
% Output   : Solution 0.88s
% 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/SystemOnTPTP28449/GEO171+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP28449/GEO171+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28449/GEO171+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 28545
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(2, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% 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]:![X3]:(convergent_lines(X1,X2)=>(distinct_lines(X2,X3)|convergent_lines(X1,X3))),file('/tmp/SRASS.s.p', ceq3)).
% fof(15, conjecture,![X1]:![X2]:(convergent_lines(X1,X2)=>distinct_lines(X1,X2)),file('/tmp/SRASS.s.p', con)).
% fof(16, negated_conjecture,~(![X1]:![X2]:(convergent_lines(X1,X2)=>distinct_lines(X1,X2))),inference(assume_negation,[status(cth)],[15])).
% fof(17, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(18, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[2,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(26, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[18])).
% cnf(27,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[26])).
% 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]:![X3]:(~(convergent_lines(X1,X2))|(distinct_lines(X2,X3)|convergent_lines(X1,X3))),inference(fof_nnf,[status(thm)],[5])).
% fof(35, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(distinct_lines(X5,X6)|convergent_lines(X4,X6))),inference(variable_rename,[status(thm)],[34])).
% cnf(36,plain,(convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(split_conjunct,[status(thm)],[35])).
% fof(63, negated_conjecture,?[X1]:?[X2]:(convergent_lines(X1,X2)&~(distinct_lines(X1,X2))),inference(fof_nnf,[status(thm)],[16])).
% fof(64, negated_conjecture,?[X3]:?[X4]:(convergent_lines(X3,X4)&~(distinct_lines(X3,X4))),inference(variable_rename,[status(thm)],[63])).
% fof(65, negated_conjecture,(convergent_lines(esk1_0,esk2_0)&~(distinct_lines(esk1_0,esk2_0))),inference(skolemize,[status(esa)],[64])).
% cnf(66,negated_conjecture,(~distinct_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(67,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(68,negated_conjecture,(convergent_lines(esk1_0,X1)|distinct_lines(esk2_0,X1)),inference(spm,[status(thm)],[36,67,theory(equality)])).
% cnf(71,negated_conjecture,(distinct_lines(esk2_0,X1)|distinct_lines(X2,X1)|convergent_lines(esk1_0,X2)),inference(spm,[status(thm)],[30,68,theory(equality)])).
% cnf(80,negated_conjecture,(convergent_lines(esk1_0,esk1_0)|distinct_lines(esk2_0,esk2_0)),inference(spm,[status(thm)],[66,71,theory(equality)])).
% cnf(87,negated_conjecture,(distinct_lines(esk2_0,esk2_0)),inference(sr,[status(thm)],[80,27,theory(equality)])).
% cnf(88,negated_conjecture,($false),inference(sr,[status(thm)],[87,25,theory(equality)])).
% cnf(89,negated_conjecture,($false),88,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 36
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 36
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 16
% # ...of the previous two non-trivial : 8
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 14
% # Factorizations                     : 2
% # Equation resolutions               : 0
% # Current number of processed clauses: 20
% #    Positive orientable unit clauses: 2
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 4
% #    Non-unit-clauses                : 14
% # Current number of unprocessed clauses: 4
% # ...number of literals in the above : 10
% # Clause-clause subsumption calls (NU) : 10
% # Rec. Clause-clause subsumption calls : 10
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    17 leaves,   2.06+/-1.552 terms/leaf
% # Paramod-from index:            5 leaves,   1.20+/-0.400 terms/leaf
% # Paramod-into index:           15 leaves,   1.53+/-0.718 terms/leaf
% # -------------------------------------------------
% # User time              : 0.011 s
% # System time            : 0.002 s
% # Total time             : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.16 WC
% FINAL PrfWatch: 0.10 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP28449/GEO171+1.tptp
% 
%------------------------------------------------------------------------------