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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : LCL638+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 : art06.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:24:29 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/SystemOnTPTP8162/LCL638+1.001.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP8162/LCL638+1.001.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8162/LCL638+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 8259
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,~(?[X1]:~((((((~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|p1(X2)))))&~(p1(X2))))))|~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|~(p1(X2))))))&p1(X2))))))|~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|~(p1(X1)))))))&![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|~(p1(X2))))))))))|~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|![X2]:(~(r1(X1,X2))|p1(X2))))&![X1]:(~(r1(X2,X1))|p1(X1)))))))|~(![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|~($true))))))|![X2]:((~(r1(X1,X2))|p1(X2))|~(![X1]:(~(r1(X2,X1))|p1(X1))))))),file('/tmp/SRASS.s.p', main)).
% fof(2, negated_conjecture,~(~(?[X1]:~((((((~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|p1(X2)))))&~(p1(X2))))))|~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|~(p1(X2))))))&p1(X2))))))|~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|~(p1(X1)))))))&![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|~(p1(X2))))))))))|~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|![X2]:(~(r1(X1,X2))|p1(X2))))&![X1]:(~(r1(X2,X1))|p1(X1)))))))|~(![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|~($true))))))|![X2]:((~(r1(X1,X2))|p1(X2))|~(![X1]:(~(r1(X2,X1))|p1(X1)))))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,~(~(?[X1]:~((((((~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|p1(X2)))))&~(p1(X2))))))|~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|~(p1(X2))))))&p1(X2))))))|~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|~(p1(X1)))))))&![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|~(p1(X2))))))))))|~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|![X2]:(~(r1(X1,X2))|p1(X2))))&![X1]:(~(r1(X2,X1))|p1(X1)))))))|~(![X2]:(~(r1(X1,X2))|~(![X1]:~(r1(X2,X1))))))|![X2]:((~(r1(X1,X2))|p1(X2))|~(![X1]:(~(r1(X2,X1))|p1(X1)))))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(4, negated_conjecture,?[X1]:(((((![X2]:(~(r1(X1,X2))|(![X1]:(~(r1(X2,X1))|?[X2]:(r1(X1,X2)&~(p1(X2))))|p1(X2)))&![X2]:(~(r1(X1,X2))|(![X1]:(~(r1(X2,X1))|?[X2]:(r1(X1,X2)&p1(X2)))|~(p1(X2)))))&![X2]:(~(r1(X1,X2))|(![X1]:(~(r1(X2,X1))|![X2]:(~(r1(X1,X2))|?[X1]:(r1(X2,X1)&p1(X1))))|?[X1]:(r1(X2,X1)&![X2]:(~(r1(X1,X2))|~(p1(X2)))))))&![X2]:(~(r1(X1,X2))|(![X1]:(~(r1(X2,X1))|![X2]:(~(r1(X1,X2))|p1(X2)))|?[X1]:(r1(X2,X1)&~(p1(X1))))))&![X2]:(~(r1(X1,X2))|?[X1]:r1(X2,X1)))&?[X2]:((r1(X1,X2)&~(p1(X2)))&![X1]:(~(r1(X2,X1))|p1(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(5, negated_conjecture,?[X3]:(((((![X4]:(~(r1(X3,X4))|(![X5]:(~(r1(X4,X5))|?[X6]:(r1(X5,X6)&~(p1(X6))))|p1(X4)))&![X7]:(~(r1(X3,X7))|(![X8]:(~(r1(X7,X8))|?[X9]:(r1(X8,X9)&p1(X9)))|~(p1(X7)))))&![X10]:(~(r1(X3,X10))|(![X11]:(~(r1(X10,X11))|![X12]:(~(r1(X11,X12))|?[X13]:(r1(X12,X13)&p1(X13))))|?[X14]:(r1(X10,X14)&![X15]:(~(r1(X14,X15))|~(p1(X15)))))))&![X16]:(~(r1(X3,X16))|(![X17]:(~(r1(X16,X17))|![X18]:(~(r1(X17,X18))|p1(X18)))|?[X19]:(r1(X16,X19)&~(p1(X19))))))&![X20]:(~(r1(X3,X20))|?[X21]:r1(X20,X21)))&?[X22]:((r1(X3,X22)&~(p1(X22)))&![X23]:(~(r1(X22,X23))|p1(X23)))),inference(variable_rename,[status(thm)],[4])).
% fof(6, negated_conjecture,(((((![X4]:(~(r1(esk1_0,X4))|(![X5]:(~(r1(X4,X5))|(r1(X5,esk2_2(X4,X5))&~(p1(esk2_2(X4,X5)))))|p1(X4)))&![X7]:(~(r1(esk1_0,X7))|(![X8]:(~(r1(X7,X8))|(r1(X8,esk3_2(X7,X8))&p1(esk3_2(X7,X8))))|~(p1(X7)))))&![X10]:(~(r1(esk1_0,X10))|(![X11]:(~(r1(X10,X11))|![X12]:(~(r1(X11,X12))|(r1(X12,esk4_3(X10,X11,X12))&p1(esk4_3(X10,X11,X12)))))|(r1(X10,esk5_1(X10))&![X15]:(~(r1(esk5_1(X10),X15))|~(p1(X15)))))))&![X16]:(~(r1(esk1_0,X16))|(![X17]:(~(r1(X16,X17))|![X18]:(~(r1(X17,X18))|p1(X18)))|(r1(X16,esk6_1(X16))&~(p1(esk6_1(X16)))))))&![X20]:(~(r1(esk1_0,X20))|r1(X20,esk7_1(X20))))&((r1(esk1_0,esk8_0)&~(p1(esk8_0)))&![X23]:(~(r1(esk8_0,X23))|p1(X23)))),inference(skolemize,[status(esa)],[5])).
% fof(7, negated_conjecture,![X4]:![X5]:![X7]:![X8]:![X10]:![X11]:![X12]:![X15]:![X16]:![X17]:![X18]:![X20]:![X23]:(((~(r1(esk8_0,X23))|p1(X23))&(r1(esk1_0,esk8_0)&~(p1(esk8_0))))&((~(r1(esk1_0,X20))|r1(X20,esk7_1(X20)))&(((((~(r1(X17,X18))|p1(X18))|~(r1(X16,X17)))|(r1(X16,esk6_1(X16))&~(p1(esk6_1(X16)))))|~(r1(esk1_0,X16)))&(((((~(r1(esk5_1(X10),X15))|~(p1(X15)))&r1(X10,esk5_1(X10)))|((~(r1(X11,X12))|(r1(X12,esk4_3(X10,X11,X12))&p1(esk4_3(X10,X11,X12))))|~(r1(X10,X11))))|~(r1(esk1_0,X10)))&((((~(r1(X7,X8))|(r1(X8,esk3_2(X7,X8))&p1(esk3_2(X7,X8))))|~(p1(X7)))|~(r1(esk1_0,X7)))&(((~(r1(X4,X5))|(r1(X5,esk2_2(X4,X5))&~(p1(esk2_2(X4,X5)))))|p1(X4))|~(r1(esk1_0,X4)))))))),inference(shift_quantors,[status(thm)],[6])).
% fof(8, negated_conjecture,![X4]:![X5]:![X7]:![X8]:![X10]:![X11]:![X12]:![X15]:![X16]:![X17]:![X18]:![X20]:![X23]:(((~(r1(esk8_0,X23))|p1(X23))&(r1(esk1_0,esk8_0)&~(p1(esk8_0))))&((~(r1(esk1_0,X20))|r1(X20,esk7_1(X20)))&((((r1(X16,esk6_1(X16))|((~(r1(X17,X18))|p1(X18))|~(r1(X16,X17))))|~(r1(esk1_0,X16)))&((~(p1(esk6_1(X16)))|((~(r1(X17,X18))|p1(X18))|~(r1(X16,X17))))|~(r1(esk1_0,X16))))&(((((((r1(X12,esk4_3(X10,X11,X12))|~(r1(X11,X12)))|~(r1(X10,X11)))|(~(r1(esk5_1(X10),X15))|~(p1(X15))))|~(r1(esk1_0,X10)))&((((p1(esk4_3(X10,X11,X12))|~(r1(X11,X12)))|~(r1(X10,X11)))|(~(r1(esk5_1(X10),X15))|~(p1(X15))))|~(r1(esk1_0,X10))))&(((((r1(X12,esk4_3(X10,X11,X12))|~(r1(X11,X12)))|~(r1(X10,X11)))|r1(X10,esk5_1(X10)))|~(r1(esk1_0,X10)))&((((p1(esk4_3(X10,X11,X12))|~(r1(X11,X12)))|~(r1(X10,X11)))|r1(X10,esk5_1(X10)))|~(r1(esk1_0,X10)))))&(((((r1(X8,esk3_2(X7,X8))|~(r1(X7,X8)))|~(p1(X7)))|~(r1(esk1_0,X7)))&(((p1(esk3_2(X7,X8))|~(r1(X7,X8)))|~(p1(X7)))|~(r1(esk1_0,X7))))&((((r1(X5,esk2_2(X4,X5))|~(r1(X4,X5)))|p1(X4))|~(r1(esk1_0,X4)))&(((~(p1(esk2_2(X4,X5)))|~(r1(X4,X5)))|p1(X4))|~(r1(esk1_0,X4))))))))),inference(distribute,[status(thm)],[7])).
% cnf(9,negated_conjecture,(p1(X1)|~r1(esk1_0,X1)|~r1(X1,X2)|~p1(esk2_2(X1,X2))),inference(split_conjunct,[status(thm)],[8])).
% cnf(10,negated_conjecture,(p1(X1)|r1(X2,esk2_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2)),inference(split_conjunct,[status(thm)],[8])).
% cnf(17,negated_conjecture,(p1(X3)|~r1(esk1_0,X1)|~r1(X1,X2)|~r1(X2,X3)|~p1(esk6_1(X1))),inference(split_conjunct,[status(thm)],[8])).
% cnf(18,negated_conjecture,(p1(X3)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1)|~r1(X1,X2)|~r1(X2,X3)),inference(split_conjunct,[status(thm)],[8])).
% cnf(19,negated_conjecture,(r1(X1,esk7_1(X1))|~r1(esk1_0,X1)),inference(split_conjunct,[status(thm)],[8])).
% cnf(20,negated_conjecture,(~p1(esk8_0)),inference(split_conjunct,[status(thm)],[8])).
% cnf(21,negated_conjecture,(r1(esk1_0,esk8_0)),inference(split_conjunct,[status(thm)],[8])).
% cnf(22,negated_conjecture,(p1(X1)|~r1(esk8_0,X1)),inference(split_conjunct,[status(thm)],[8])).
% cnf(25,negated_conjecture,(p1(X1)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3)|~r1(esk8_0,esk6_1(X2))),inference(spm,[status(thm)],[17,22,theory(equality)])).
% cnf(29,negated_conjecture,(p1(esk2_2(X1,X2))|r1(X3,esk6_1(X3))|p1(X1)|~r1(esk1_0,X3)|~r1(X3,X2)|~r1(esk1_0,X1)|~r1(X1,X2)),inference(spm,[status(thm)],[18,10,theory(equality)])).
% cnf(127,negated_conjecture,(p1(X1)|r1(X3,esk6_1(X3))|~r1(esk1_0,X3)|~r1(esk1_0,X1)|~r1(X3,X2)|~r1(X1,X2)),inference(csr,[status(thm)],[29,9])).
% cnf(129,negated_conjecture,(p1(X1)|r1(X2,esk6_1(X2))|~r1(esk1_0,X2)|~r1(esk1_0,X1)|~r1(X1,esk7_1(X2))),inference(spm,[status(thm)],[127,19,theory(equality)])).
% cnf(143,negated_conjecture,(p1(X1)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1)),inference(spm,[status(thm)],[129,19,theory(equality)])).
% cnf(145,negated_conjecture,(p1(X1)|p1(esk8_0)|~r1(esk1_0,esk8_0)|~r1(X2,X1)|~r1(esk8_0,X2)),inference(spm,[status(thm)],[25,143,theory(equality)])).
% cnf(159,negated_conjecture,(p1(X1)|p1(esk8_0)|$false|~r1(X2,X1)|~r1(esk8_0,X2)),inference(rw,[status(thm)],[145,21,theory(equality)])).
% cnf(160,negated_conjecture,(p1(X1)|p1(esk8_0)|~r1(X2,X1)|~r1(esk8_0,X2)),inference(cn,[status(thm)],[159,theory(equality)])).
% cnf(161,negated_conjecture,(p1(X1)|~r1(X2,X1)|~r1(esk8_0,X2)),inference(sr,[status(thm)],[160,20,theory(equality)])).
% cnf(162,negated_conjecture,(p1(X1)|~r1(esk7_1(esk8_0),X1)|~r1(esk1_0,esk8_0)),inference(spm,[status(thm)],[161,19,theory(equality)])).
% cnf(168,negated_conjecture,(p1(X1)|~r1(esk7_1(esk8_0),X1)|$false),inference(rw,[status(thm)],[162,21,theory(equality)])).
% cnf(169,negated_conjecture,(p1(X1)|~r1(esk7_1(esk8_0),X1)),inference(cn,[status(thm)],[168,theory(equality)])).
% cnf(180,negated_conjecture,(p1(esk2_2(X1,esk7_1(esk8_0)))|p1(X1)|~r1(esk1_0,X1)|~r1(X1,esk7_1(esk8_0))),inference(spm,[status(thm)],[169,10,theory(equality)])).
% cnf(198,negated_conjecture,(p1(X1)|~r1(X1,esk7_1(esk8_0))|~r1(esk1_0,X1)),inference(csr,[status(thm)],[180,9])).
% cnf(199,negated_conjecture,(p1(esk8_0)|~r1(esk1_0,esk8_0)),inference(spm,[status(thm)],[198,19,theory(equality)])).
% cnf(200,negated_conjecture,(p1(esk8_0)|$false),inference(rw,[status(thm)],[199,21,theory(equality)])).
% cnf(201,negated_conjecture,(p1(esk8_0)),inference(cn,[status(thm)],[200,theory(equality)])).
% cnf(202,negated_conjecture,($false),inference(sr,[status(thm)],[201,20,theory(equality)])).
% cnf(203,negated_conjecture,($false),202,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 84
% # ...of these trivial                : 0
% # ...subsumed                        : 17
% # ...remaining for further processing: 67
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 8
% # Backward-rewritten                 : 0
% # Generated clauses                  : 118
% # ...of the previous two non-trivial : 117
% # Contextual simplify-reflections    : 28
% # Paramodulations                    : 118
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 45
% #    Positive orientable unit clauses: 1
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 41
% # Current number of unprocessed clauses: 56
% # ...number of literals in the above : 368
% # Clause-clause subsumption calls (NU) : 531
% # Rec. Clause-clause subsumption calls : 338
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    79 leaves,   1.29+/-0.659 terms/leaf
% # Paramod-from index:           15 leaves,   1.13+/-0.340 terms/leaf
% # Paramod-into index:           50 leaves,   1.24+/-0.472 terms/leaf
% # -------------------------------------------------
% # User time              : 0.019 s
% # System time            : 0.003 s
% # Total time             : 0.022 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/SystemOnTPTP8162/LCL638+1.001.tptp
% 
%------------------------------------------------------------------------------