TSTP Solution File: LCL656+1.001 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : LCL656+1.001 : TPTP v5.0.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art01.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 14:48:50 EST 2010

% Result   : Theorem 1.05s
% Output   : Solution 1.05s
% 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/SystemOnTPTP11199/LCL656+1.001.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP11199/LCL656+1.001.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11199/LCL656+1.001.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 11295
% 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]:r1(X1,X1),file('/tmp/SRASS.s.p', reflexivity)).
% fof(2, conjecture,~(?[X1]:~((~(![X2]:(~(r1(X1,X2))|p2(X2)))|~(((![X2]:(~(r1(X1,X2))|((((((~(![X1]:(~(r1(X2,X1))|~(((~(p2(X1))&~(p102(X1)))&p101(X1)))))&~(![X1]:(~(r1(X2,X1))|~(((p2(X1)&~(p102(X1)))&p101(X1))))))|~((~(p101(X2))&p100(X2))))&(((![X1]:((~(r1(X2,X1))|~(p2(X1)))|~(p101(X1)))|p2(X2))&(![X1]:((~(r1(X2,X1))|p2(X1))|~(p101(X1)))|~(p2(X2))))|~(p101(X2))))&(((![X1]:((~(r1(X2,X1))|~(p1(X1)))|~(p100(X1)))|p1(X2))&(![X1]:((~(r1(X2,X1))|p1(X1))|~(p100(X1)))|~(p1(X2))))|~(p100(X2))))&(p101(X2)|~(p102(X2))))&(p100(X2)|~(p101(X2)))))&~(p101(X1)))&p100(X1)))))),file('/tmp/SRASS.s.p', main)).
% fof(3, negated_conjecture,~(~(?[X1]:~((~(![X2]:(~(r1(X1,X2))|p2(X2)))|~(((![X2]:(~(r1(X1,X2))|((((((~(![X1]:(~(r1(X2,X1))|~(((~(p2(X1))&~(p102(X1)))&p101(X1)))))&~(![X1]:(~(r1(X2,X1))|~(((p2(X1)&~(p102(X1)))&p101(X1))))))|~((~(p101(X2))&p100(X2))))&(((![X1]:((~(r1(X2,X1))|~(p2(X1)))|~(p101(X1)))|p2(X2))&(![X1]:((~(r1(X2,X1))|p2(X1))|~(p101(X1)))|~(p2(X2))))|~(p101(X2))))&(((![X1]:((~(r1(X2,X1))|~(p1(X1)))|~(p100(X1)))|p1(X2))&(![X1]:((~(r1(X2,X1))|p1(X1))|~(p100(X1)))|~(p1(X2))))|~(p100(X2))))&(p101(X2)|~(p102(X2))))&(p100(X2)|~(p101(X2)))))&~(p101(X1)))&p100(X1))))))),inference(assume_negation,[status(cth)],[2])).
% fof(4, negated_conjecture,~(~(?[X1]:~((~(![X2]:(~(r1(X1,X2))|p2(X2)))|~(((![X2]:(~(r1(X1,X2))|((((((~(![X1]:(~(r1(X2,X1))|~(((~(p2(X1))&~(p102(X1)))&p101(X1)))))&~(![X1]:(~(r1(X2,X1))|~(((p2(X1)&~(p102(X1)))&p101(X1))))))|~((~(p101(X2))&p100(X2))))&(((![X1]:((~(r1(X2,X1))|~(p2(X1)))|~(p101(X1)))|p2(X2))&(![X1]:((~(r1(X2,X1))|p2(X1))|~(p101(X1)))|~(p2(X2))))|~(p101(X2))))&(((![X1]:((~(r1(X2,X1))|~(p1(X1)))|~(p100(X1)))|p1(X2))&(![X1]:((~(r1(X2,X1))|p1(X1))|~(p100(X1)))|~(p1(X2))))|~(p100(X2))))&(p101(X2)|~(p102(X2))))&(p100(X2)|~(p101(X2)))))&~(p101(X1)))&p100(X1))))))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(5, plain,![X2]:r1(X2,X2),inference(variable_rename,[status(thm)],[1])).
% cnf(6,plain,(r1(X1,X1)),inference(split_conjunct,[status(thm)],[5])).
% fof(7, negated_conjecture,?[X1]:(![X2]:(~(r1(X1,X2))|p2(X2))&((![X2]:(~(r1(X1,X2))|((((((?[X1]:(r1(X2,X1)&((~(p2(X1))&~(p102(X1)))&p101(X1)))&?[X1]:(r1(X2,X1)&((p2(X1)&~(p102(X1)))&p101(X1))))|(p101(X2)|~(p100(X2))))&(((![X1]:((~(r1(X2,X1))|~(p2(X1)))|~(p101(X1)))|p2(X2))&(![X1]:((~(r1(X2,X1))|p2(X1))|~(p101(X1)))|~(p2(X2))))|~(p101(X2))))&(((![X1]:((~(r1(X2,X1))|~(p1(X1)))|~(p100(X1)))|p1(X2))&(![X1]:((~(r1(X2,X1))|p1(X1))|~(p100(X1)))|~(p1(X2))))|~(p100(X2))))&(p101(X2)|~(p102(X2))))&(p100(X2)|~(p101(X2)))))&~(p101(X1)))&p100(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(8, negated_conjecture,?[X3]:(![X4]:(~(r1(X3,X4))|p2(X4))&((![X5]:(~(r1(X3,X5))|((((((?[X6]:(r1(X5,X6)&((~(p2(X6))&~(p102(X6)))&p101(X6)))&?[X7]:(r1(X5,X7)&((p2(X7)&~(p102(X7)))&p101(X7))))|(p101(X5)|~(p100(X5))))&(((![X8]:((~(r1(X5,X8))|~(p2(X8)))|~(p101(X8)))|p2(X5))&(![X9]:((~(r1(X5,X9))|p2(X9))|~(p101(X9)))|~(p2(X5))))|~(p101(X5))))&(((![X10]:((~(r1(X5,X10))|~(p1(X10)))|~(p100(X10)))|p1(X5))&(![X11]:((~(r1(X5,X11))|p1(X11))|~(p100(X11)))|~(p1(X5))))|~(p100(X5))))&(p101(X5)|~(p102(X5))))&(p100(X5)|~(p101(X5)))))&~(p101(X3)))&p100(X3))),inference(variable_rename,[status(thm)],[7])).
% fof(9, negated_conjecture,(![X4]:(~(r1(esk1_0,X4))|p2(X4))&((![X5]:(~(r1(esk1_0,X5))|(((((((r1(X5,esk2_1(X5))&((~(p2(esk2_1(X5)))&~(p102(esk2_1(X5))))&p101(esk2_1(X5))))&(r1(X5,esk3_1(X5))&((p2(esk3_1(X5))&~(p102(esk3_1(X5))))&p101(esk3_1(X5)))))|(p101(X5)|~(p100(X5))))&(((![X8]:((~(r1(X5,X8))|~(p2(X8)))|~(p101(X8)))|p2(X5))&(![X9]:((~(r1(X5,X9))|p2(X9))|~(p101(X9)))|~(p2(X5))))|~(p101(X5))))&(((![X10]:((~(r1(X5,X10))|~(p1(X10)))|~(p100(X10)))|p1(X5))&(![X11]:((~(r1(X5,X11))|p1(X11))|~(p100(X11)))|~(p1(X5))))|~(p100(X5))))&(p101(X5)|~(p102(X5))))&(p100(X5)|~(p101(X5)))))&~(p101(esk1_0)))&p100(esk1_0))),inference(skolemize,[status(esa)],[8])).
% fof(10, negated_conjecture,![X4]:![X5]:![X8]:![X9]:![X10]:![X11]:((((((((((((~(r1(X5,X11))|p1(X11))|~(p100(X11)))|~(p1(X5)))&(((~(r1(X5,X10))|~(p1(X10)))|~(p100(X10)))|p1(X5)))|~(p100(X5)))&((((((~(r1(X5,X9))|p2(X9))|~(p101(X9)))|~(p2(X5)))&(((~(r1(X5,X8))|~(p2(X8)))|~(p101(X8)))|p2(X5)))|~(p101(X5)))&(((r1(X5,esk2_1(X5))&((~(p2(esk2_1(X5)))&~(p102(esk2_1(X5))))&p101(esk2_1(X5))))&(r1(X5,esk3_1(X5))&((p2(esk3_1(X5))&~(p102(esk3_1(X5))))&p101(esk3_1(X5)))))|(p101(X5)|~(p100(X5))))))&(p101(X5)|~(p102(X5))))&(p100(X5)|~(p101(X5))))|~(r1(esk1_0,X5)))&~(p101(esk1_0)))&p100(esk1_0))&(~(r1(esk1_0,X4))|p2(X4))),inference(shift_quantors,[status(thm)],[9])).
% fof(11, negated_conjecture,![X4]:![X5]:![X8]:![X9]:![X10]:![X11]:((((((((((((~(r1(X5,X11))|p1(X11))|~(p100(X11)))|~(p1(X5)))|~(p100(X5)))|~(r1(esk1_0,X5)))&(((((~(r1(X5,X10))|~(p1(X10)))|~(p100(X10)))|p1(X5))|~(p100(X5)))|~(r1(esk1_0,X5))))&(((((((~(r1(X5,X9))|p2(X9))|~(p101(X9)))|~(p2(X5)))|~(p101(X5)))|~(r1(esk1_0,X5)))&(((((~(r1(X5,X8))|~(p2(X8)))|~(p101(X8)))|p2(X5))|~(p101(X5)))|~(r1(esk1_0,X5))))&((((r1(X5,esk2_1(X5))|(p101(X5)|~(p100(X5))))|~(r1(esk1_0,X5)))&((((~(p2(esk2_1(X5)))|(p101(X5)|~(p100(X5))))|~(r1(esk1_0,X5)))&((~(p102(esk2_1(X5)))|(p101(X5)|~(p100(X5))))|~(r1(esk1_0,X5))))&((p101(esk2_1(X5))|(p101(X5)|~(p100(X5))))|~(r1(esk1_0,X5)))))&(((r1(X5,esk3_1(X5))|(p101(X5)|~(p100(X5))))|~(r1(esk1_0,X5)))&((((p2(esk3_1(X5))|(p101(X5)|~(p100(X5))))|~(r1(esk1_0,X5)))&((~(p102(esk3_1(X5)))|(p101(X5)|~(p100(X5))))|~(r1(esk1_0,X5))))&((p101(esk3_1(X5))|(p101(X5)|~(p100(X5))))|~(r1(esk1_0,X5))))))))&((p101(X5)|~(p102(X5)))|~(r1(esk1_0,X5))))&((p100(X5)|~(p101(X5)))|~(r1(esk1_0,X5))))&~(p101(esk1_0)))&p100(esk1_0))&(~(r1(esk1_0,X4))|p2(X4))),inference(distribute,[status(thm)],[10])).
% cnf(12,negated_conjecture,(p2(X1)|~r1(esk1_0,X1)),inference(split_conjunct,[status(thm)],[11])).
% cnf(13,negated_conjecture,(p100(esk1_0)),inference(split_conjunct,[status(thm)],[11])).
% cnf(14,negated_conjecture,(~p101(esk1_0)),inference(split_conjunct,[status(thm)],[11])).
% cnf(23,negated_conjecture,(p101(X1)|~r1(esk1_0,X1)|~p100(X1)|~p2(esk2_1(X1))),inference(split_conjunct,[status(thm)],[11])).
% cnf(24,negated_conjecture,(p101(X1)|r1(X1,esk2_1(X1))|~r1(esk1_0,X1)|~p100(X1)),inference(split_conjunct,[status(thm)],[11])).
% cnf(34,negated_conjecture,(p101(X1)|~p100(X1)|~r1(esk1_0,X1)|~r1(esk1_0,esk2_1(X1))),inference(spm,[status(thm)],[23,12,theory(equality)])).
% cnf(44,negated_conjecture,(p101(esk1_0)|~p100(esk1_0)|~r1(esk1_0,esk1_0)),inference(spm,[status(thm)],[34,24,theory(equality)])).
% cnf(45,negated_conjecture,(p101(esk1_0)|$false|~r1(esk1_0,esk1_0)),inference(rw,[status(thm)],[44,13,theory(equality)])).
% cnf(46,negated_conjecture,(p101(esk1_0)|$false|$false),inference(rw,[status(thm)],[45,6,theory(equality)])).
% cnf(47,negated_conjecture,(p101(esk1_0)),inference(cn,[status(thm)],[46,theory(equality)])).
% cnf(48,negated_conjecture,($false),inference(sr,[status(thm)],[47,14,theory(equality)])).
% cnf(49,negated_conjecture,($false),48,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 36
% # ...of these trivial                : 0
% # ...subsumed                        : 1
% # ...remaining for further processing: 35
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 11
% # ...of the previous two non-trivial : 6
% # Contextual simplify-reflections    : 5
% # Paramodulations                    : 11
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 18
% #    Positive orientable unit clauses: 2
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 15
% # Current number of unprocessed clauses: 5
% # ...number of literals in the above : 27
% # Clause-clause subsumption calls (NU) : 35
% # Rec. Clause-clause subsumption calls : 35
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    22 leaves,   1.27+/-0.538 terms/leaf
% # Paramod-from index:            9 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           18 leaves,   1.11+/-0.458 terms/leaf
% # -------------------------------------------------
% # User time              : 0.010 s
% # System time            : 0.004 s
% # Total time             : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP11199/LCL656+1.001.tptp
% 
%------------------------------------------------------------------------------