TSTP Solution File: LCL650+1.001 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL650+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 : art07.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:36:45 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP17994/LCL650+1.001.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP17994/LCL650+1.001.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17994/LCL650+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 18090
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 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))|![X1]:(~(r1(X2,X1))|(((~(p8(X1))&~(p6(X1)))&~(p4(X1)))&~(p2(X1)))))))|![X2]:(~(r1(X1,X2))|p5(X2)))|~(![X2]:(~(r1(X1,X2))|~(((~(![X1]:(~(r1(X2,X1))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|~(((~(p3(X1))&~(p1(X1)))|(p1(X1)&p3(X1))))))))|![X1]:(~(r1(X2,X1))|p4(X1)))|~(![X1]:(~(r1(X2,X1))|~(((~(![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|~(((~(p2(X1))&~(p3(X1)))|(p3(X1)&p2(X1)))))))|![X2]:(~(r1(X1,X2))|p3(X2)))|~(![X2]:(~(r1(X1,X2))|~(~(![X1]:(~(r1(X2,X1))|~(((~(p1(X1))&~(p2(X1)))|(p2(X1)&p1(X1))))))))))))))))))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|(((p4(X1)&p3(X1))&p2(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))|![X1]:(~(r1(X2,X1))|(((~(p8(X1))&~(p6(X1)))&~(p4(X1)))&~(p2(X1)))))))|![X2]:(~(r1(X1,X2))|p5(X2)))|~(![X2]:(~(r1(X1,X2))|~(((~(![X1]:(~(r1(X2,X1))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|~(((~(p3(X1))&~(p1(X1)))|(p1(X1)&p3(X1))))))))|![X1]:(~(r1(X2,X1))|p4(X1)))|~(![X1]:(~(r1(X2,X1))|~(((~(![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|~(((~(p2(X1))&~(p3(X1)))|(p3(X1)&p2(X1)))))))|![X2]:(~(r1(X1,X2))|p3(X2)))|~(![X2]:(~(r1(X1,X2))|~(~(![X1]:(~(r1(X2,X1))|~(((~(p1(X1))&~(p2(X1)))|(p2(X1)&p1(X1))))))))))))))))))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|(((p4(X1)&p3(X1))&p2(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))|![X1]:(~(r1(X2,X1))|(((~(p8(X1))&~(p6(X1)))&~(p4(X1)))&~(p2(X1)))))))|![X2]:(~(r1(X1,X2))|p5(X2)))|~(![X2]:(~(r1(X1,X2))|~(((~(![X1]:(~(r1(X2,X1))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|~(((~(p3(X1))&~(p1(X1)))|(p1(X1)&p3(X1))))))))|![X1]:(~(r1(X2,X1))|p4(X1)))|~(![X1]:(~(r1(X2,X1))|~(((~(![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|~(((~(p2(X1))&~(p3(X1)))|(p3(X1)&p2(X1)))))))|![X2]:(~(r1(X1,X2))|p3(X2)))|~(![X2]:(~(r1(X1,X2))|~(~(![X1]:(~(r1(X2,X1))|~(((~(p1(X1))&~(p2(X1)))|(p2(X1)&p1(X1))))))))))))))))))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|(((p4(X1)&p3(X1))&p2(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)&?[X1]:(r1(X2,X1)&(((p8(X1)|p6(X1))|p4(X1))|p2(X1))))))&?[X2]:(r1(X1,X2)&~(p5(X2))))&![X2]:(~(r1(X1,X2))|((![X1]:(~(r1(X2,X1))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|((p3(X1)|p1(X1))&(~(p1(X1))|~(p3(X1)))))))&?[X1]:(r1(X2,X1)&~(p4(X1))))&![X1]:(~(r1(X2,X1))|((![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|((p2(X1)|p3(X1))&(~(p3(X1))|~(p2(X1))))))&?[X2]:(r1(X1,X2)&~(p3(X2))))&![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|((p1(X1)|p2(X1))&(~(p2(X1))|~(p1(X1)))))))))))&?[X2]:(r1(X1,X2)&?[X1]:(r1(X2,X1)&?[X2]:(r1(X1,X2)&?[X1]:(r1(X2,X1)&(((~(p4(X1))|~(p3(X1)))|~(p2(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)&?[X7]:(r1(X6,X7)&(((p8(X7)|p6(X7))|p4(X7))|p2(X7))))))&?[X8]:(r1(X3,X8)&~(p5(X8))))&![X9]:(~(r1(X3,X9))|((![X10]:(~(r1(X9,X10))|![X11]:(~(r1(X10,X11))|![X12]:(~(r1(X11,X12))|((p3(X12)|p1(X12))&(~(p1(X12))|~(p3(X12)))))))&?[X13]:(r1(X9,X13)&~(p4(X13))))&![X14]:(~(r1(X9,X14))|((![X15]:(~(r1(X14,X15))|![X16]:(~(r1(X15,X16))|((p2(X16)|p3(X16))&(~(p3(X16))|~(p2(X16))))))&?[X17]:(r1(X14,X17)&~(p3(X17))))&![X18]:(~(r1(X14,X18))|![X19]:(~(r1(X18,X19))|((p1(X19)|p2(X19))&(~(p2(X19))|~(p1(X19)))))))))))&?[X20]:(r1(X3,X20)&?[X21]:(r1(X20,X21)&?[X22]:(r1(X21,X22)&?[X23]:(r1(X22,X23)&(((~(p4(X23))|~(p3(X23)))|~(p2(X23)))|~(p1(X23)))))))),inference(variable_rename,[status(thm)],[4])).
% fof(6, negated_conjecture,((((r1(esk1_0,esk2_0)&(r1(esk2_0,esk3_0)&(r1(esk3_0,esk4_0)&(r1(esk4_0,esk5_0)&(((p8(esk5_0)|p6(esk5_0))|p4(esk5_0))|p2(esk5_0))))))&(r1(esk1_0,esk6_0)&~(p5(esk6_0))))&![X9]:(~(r1(esk1_0,X9))|((![X10]:(~(r1(X9,X10))|![X11]:(~(r1(X10,X11))|![X12]:(~(r1(X11,X12))|((p3(X12)|p1(X12))&(~(p1(X12))|~(p3(X12)))))))&(r1(X9,esk7_1(X9))&~(p4(esk7_1(X9)))))&![X14]:(~(r1(X9,X14))|((![X15]:(~(r1(X14,X15))|![X16]:(~(r1(X15,X16))|((p2(X16)|p3(X16))&(~(p3(X16))|~(p2(X16))))))&(r1(X14,esk8_2(X9,X14))&~(p3(esk8_2(X9,X14)))))&![X18]:(~(r1(X14,X18))|![X19]:(~(r1(X18,X19))|((p1(X19)|p2(X19))&(~(p2(X19))|~(p1(X19)))))))))))&(r1(esk1_0,esk9_0)&(r1(esk9_0,esk10_0)&(r1(esk10_0,esk11_0)&(r1(esk11_0,esk12_0)&(((~(p4(esk12_0))|~(p3(esk12_0)))|~(p2(esk12_0)))|~(p1(esk12_0)))))))),inference(skolemize,[status(esa)],[5])).
% fof(7, negated_conjecture,![X9]:![X10]:![X11]:![X12]:![X14]:![X15]:![X16]:![X18]:![X19]:((((((((~(r1(X18,X19))|((p1(X19)|p2(X19))&(~(p2(X19))|~(p1(X19)))))|~(r1(X14,X18)))&(((~(r1(X15,X16))|((p2(X16)|p3(X16))&(~(p3(X16))|~(p2(X16)))))|~(r1(X14,X15)))&(r1(X14,esk8_2(X9,X14))&~(p3(esk8_2(X9,X14))))))|~(r1(X9,X14)))&((((~(r1(X11,X12))|((p3(X12)|p1(X12))&(~(p1(X12))|~(p3(X12)))))|~(r1(X10,X11)))|~(r1(X9,X10)))&(r1(X9,esk7_1(X9))&~(p4(esk7_1(X9))))))|~(r1(esk1_0,X9)))&((r1(esk1_0,esk2_0)&(r1(esk2_0,esk3_0)&(r1(esk3_0,esk4_0)&(r1(esk4_0,esk5_0)&(((p8(esk5_0)|p6(esk5_0))|p4(esk5_0))|p2(esk5_0))))))&(r1(esk1_0,esk6_0)&~(p5(esk6_0)))))&(r1(esk1_0,esk9_0)&(r1(esk9_0,esk10_0)&(r1(esk10_0,esk11_0)&(r1(esk11_0,esk12_0)&(((~(p4(esk12_0))|~(p3(esk12_0)))|~(p2(esk12_0)))|~(p1(esk12_0)))))))),inference(shift_quantors,[status(thm)],[6])).
% fof(8, negated_conjecture,![X9]:![X10]:![X11]:![X12]:![X14]:![X15]:![X16]:![X18]:![X19]:((((((((((p1(X19)|p2(X19))|~(r1(X18,X19)))|~(r1(X14,X18)))|~(r1(X9,X14)))|~(r1(esk1_0,X9)))&(((((~(p2(X19))|~(p1(X19)))|~(r1(X18,X19)))|~(r1(X14,X18)))|~(r1(X9,X14)))|~(r1(esk1_0,X9))))&(((((((p2(X16)|p3(X16))|~(r1(X15,X16)))|~(r1(X14,X15)))|~(r1(X9,X14)))|~(r1(esk1_0,X9)))&(((((~(p3(X16))|~(p2(X16)))|~(r1(X15,X16)))|~(r1(X14,X15)))|~(r1(X9,X14)))|~(r1(esk1_0,X9))))&(((r1(X14,esk8_2(X9,X14))|~(r1(X9,X14)))|~(r1(esk1_0,X9)))&((~(p3(esk8_2(X9,X14)))|~(r1(X9,X14)))|~(r1(esk1_0,X9))))))&(((((((p3(X12)|p1(X12))|~(r1(X11,X12)))|~(r1(X10,X11)))|~(r1(X9,X10)))|~(r1(esk1_0,X9)))&(((((~(p1(X12))|~(p3(X12)))|~(r1(X11,X12)))|~(r1(X10,X11)))|~(r1(X9,X10)))|~(r1(esk1_0,X9))))&((r1(X9,esk7_1(X9))|~(r1(esk1_0,X9)))&(~(p4(esk7_1(X9)))|~(r1(esk1_0,X9))))))&((r1(esk1_0,esk2_0)&(r1(esk2_0,esk3_0)&(r1(esk3_0,esk4_0)&(r1(esk4_0,esk5_0)&(((p8(esk5_0)|p6(esk5_0))|p4(esk5_0))|p2(esk5_0))))))&(r1(esk1_0,esk6_0)&~(p5(esk6_0)))))&(r1(esk1_0,esk9_0)&(r1(esk9_0,esk10_0)&(r1(esk10_0,esk11_0)&(r1(esk11_0,esk12_0)&(((~(p4(esk12_0))|~(p3(esk12_0)))|~(p2(esk12_0)))|~(p1(esk12_0)))))))),inference(distribute,[status(thm)],[7])).
% cnf(10,negated_conjecture,(r1(esk11_0,esk12_0)),inference(split_conjunct,[status(thm)],[8])).
% cnf(11,negated_conjecture,(r1(esk10_0,esk11_0)),inference(split_conjunct,[status(thm)],[8])).
% cnf(12,negated_conjecture,(r1(esk9_0,esk10_0)),inference(split_conjunct,[status(thm)],[8])).
% cnf(13,negated_conjecture,(r1(esk1_0,esk9_0)),inference(split_conjunct,[status(thm)],[8])).
% cnf(23,negated_conjecture,(~r1(esk1_0,X1)|~r1(X1,X2)|~r1(X2,X3)|~r1(X3,X4)|~p3(X4)|~p1(X4)),inference(split_conjunct,[status(thm)],[8])).
% cnf(24,negated_conjecture,(p1(X4)|p3(X4)|~r1(esk1_0,X1)|~r1(X1,X2)|~r1(X2,X3)|~r1(X3,X4)),inference(split_conjunct,[status(thm)],[8])).
% cnf(27,negated_conjecture,(~r1(esk1_0,X1)|~r1(X1,X2)|~r1(X2,X3)|~r1(X3,X4)|~p2(X4)|~p3(X4)),inference(split_conjunct,[status(thm)],[8])).
% cnf(28,negated_conjecture,(p3(X4)|p2(X4)|~r1(esk1_0,X1)|~r1(X1,X2)|~r1(X2,X3)|~r1(X3,X4)),inference(split_conjunct,[status(thm)],[8])).
% cnf(29,negated_conjecture,(~r1(esk1_0,X1)|~r1(X1,X2)|~r1(X2,X3)|~r1(X3,X4)|~p1(X4)|~p2(X4)),inference(split_conjunct,[status(thm)],[8])).
% cnf(30,negated_conjecture,(p2(X4)|p1(X4)|~r1(esk1_0,X1)|~r1(X1,X2)|~r1(X2,X3)|~r1(X3,X4)),inference(split_conjunct,[status(thm)],[8])).
% cnf(33,negated_conjecture,(p3(X1)|p2(X1)|~r1(X2,X1)|~r1(X3,X2)|~r1(esk9_0,X3)),inference(spm,[status(thm)],[28,13,theory(equality)])).
% cnf(38,negated_conjecture,(p1(X1)|p2(X1)|~r1(X2,X1)|~r1(X3,X2)|~r1(esk9_0,X3)),inference(spm,[status(thm)],[30,13,theory(equality)])).
% cnf(43,negated_conjecture,(p1(X1)|p3(X1)|~r1(X2,X1)|~r1(X3,X2)|~r1(esk9_0,X3)),inference(spm,[status(thm)],[24,13,theory(equality)])).
% cnf(48,negated_conjecture,(~p3(X1)|~p2(X1)|~r1(X2,X1)|~r1(X3,X2)|~r1(esk9_0,X3)),inference(spm,[status(thm)],[27,13,theory(equality)])).
% cnf(53,negated_conjecture,(~p1(X1)|~p2(X1)|~r1(X2,X1)|~r1(X3,X2)|~r1(esk9_0,X3)),inference(spm,[status(thm)],[29,13,theory(equality)])).
% cnf(58,negated_conjecture,(~p1(X1)|~p3(X1)|~r1(X2,X1)|~r1(X3,X2)|~r1(esk9_0,X3)),inference(spm,[status(thm)],[23,13,theory(equality)])).
% cnf(65,negated_conjecture,(~p3(X1)|~p2(X1)|~r1(X2,X1)|~r1(esk10_0,X2)),inference(spm,[status(thm)],[48,12,theory(equality)])).
% cnf(70,negated_conjecture,(~p3(X1)|~p2(X1)|~r1(esk11_0,X1)),inference(spm,[status(thm)],[65,11,theory(equality)])).
% cnf(75,negated_conjecture,(p3(X1)|p2(X1)|~r1(X2,X1)|~r1(esk10_0,X2)),inference(spm,[status(thm)],[33,12,theory(equality)])).
% cnf(80,negated_conjecture,(p3(X1)|p2(X1)|~r1(esk11_0,X1)),inference(spm,[status(thm)],[75,11,theory(equality)])).
% cnf(170,negated_conjecture,(p1(X1)|p2(X1)|~r1(X2,X1)|~r1(esk10_0,X2)),inference(spm,[status(thm)],[38,12,theory(equality)])).
% cnf(184,negated_conjecture,(p1(X1)|p2(X1)|~r1(esk11_0,X1)),inference(spm,[status(thm)],[170,11,theory(equality)])).
% cnf(197,negated_conjecture,(~p1(X1)|~p2(X1)|~r1(X2,X1)|~r1(esk10_0,X2)),inference(spm,[status(thm)],[53,12,theory(equality)])).
% cnf(202,negated_conjecture,(~p1(X1)|~p2(X1)|~r1(esk11_0,X1)),inference(spm,[status(thm)],[197,11,theory(equality)])).
% cnf(276,negated_conjecture,(p1(X1)|p3(X1)|~r1(X2,X1)|~r1(esk10_0,X2)),inference(spm,[status(thm)],[43,12,theory(equality)])).
% cnf(295,negated_conjecture,(p1(X1)|p3(X1)|~r1(esk11_0,X1)),inference(spm,[status(thm)],[276,11,theory(equality)])).
% cnf(300,negated_conjecture,(p3(X1)|~p2(X1)|~r1(esk11_0,X1)),inference(spm,[status(thm)],[202,295,theory(equality)])).
% cnf(302,negated_conjecture,(p3(X1)|~r1(esk11_0,X1)),inference(csr,[status(thm)],[300,80])).
% cnf(309,negated_conjecture,(~p2(X1)|~r1(esk11_0,X1)),inference(spm,[status(thm)],[70,302,theory(equality)])).
% cnf(406,negated_conjecture,(~p1(X1)|~p3(X1)|~r1(X2,X1)|~r1(esk10_0,X2)),inference(spm,[status(thm)],[58,12,theory(equality)])).
% cnf(413,negated_conjecture,(~p1(X1)|~p3(X1)|~r1(esk11_0,X1)),inference(spm,[status(thm)],[406,11,theory(equality)])).
% cnf(414,negated_conjecture,(~p1(X1)|~r1(esk11_0,X1)),inference(csr,[status(thm)],[413,302])).
% cnf(420,negated_conjecture,(p2(X1)|~r1(esk11_0,X1)),inference(spm,[status(thm)],[414,184,theory(equality)])).
% cnf(422,negated_conjecture,(~r1(esk11_0,X1)),inference(csr,[status(thm)],[420,309])).
% cnf(425,negated_conjecture,($false),inference(sr,[status(thm)],[10,422,theory(equality)])).
% cnf(426,negated_conjecture,($false),425,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 202
% # ...of these trivial : 0
% # ...subsumed : 3
% # ...remaining for further processing: 199
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 30
% # Backward-rewritten : 0
% # Generated clauses : 349
% # ...of the previous two non-trivial : 288
% # Contextual simplify-reflections : 14
% # Paramodulations : 348
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 146
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 130
% # Current number of unprocessed clauses: 110
% # ...number of literals in the above : 613
% # Clause-clause subsumption calls (NU) : 2608
% # Rec. Clause-clause subsumption calls : 710
% # Unit Clause-clause subsumption calls : 624
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 107 leaves, 1.29+/-1.005 terms/leaf
% # Paramod-from index: 15 leaves, 1.53+/-1.360 terms/leaf
% # Paramod-into index: 81 leaves, 1.26+/-0.843 terms/leaf
% # -------------------------------------------------
% # User time : 0.036 s
% # System time : 0.002 s
% # Total time : 0.038 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP17994/LCL650+1.001.tptp
%
%------------------------------------------------------------------------------