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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : LCL664+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 15:04:49 EST 2010

% Result   : Theorem 1.04s
% Output   : Solution 1.04s
% 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/SystemOnTPTP15144/LCL664+1.001.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP15144/LCL664+1.001.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15144/LCL664+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 15240
% 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(2, conjecture,~(?[X1]:~((((((((~(![X2]:(~(r1(X1,X2))|p16(X2)))|~(![X2]:(~(r1(X1,X2))|p12(X2))))|~(![X2]:(~(r1(X1,X2))|p14(X2))))|~(![X2]:(~(r1(X1,X2))|p12(X2))))|![X2]:(~(r1(X1,X2))|p15(X2)))|![X2]:(~(r1(X1,X2))|p13(X2)))|![X2]:(~(r1(X1,X2))|p12(X2)))|![X2]:(~(r1(X1,X2))|p11(X2))))),file('/tmp/SRASS.s.p', main)).
% fof(3, negated_conjecture,~(~(?[X1]:~((((((((~(![X2]:(~(r1(X1,X2))|p16(X2)))|~(![X2]:(~(r1(X1,X2))|p12(X2))))|~(![X2]:(~(r1(X1,X2))|p14(X2))))|~(![X2]:(~(r1(X1,X2))|p12(X2))))|![X2]:(~(r1(X1,X2))|p15(X2)))|![X2]:(~(r1(X1,X2))|p13(X2)))|![X2]:(~(r1(X1,X2))|p12(X2)))|![X2]:(~(r1(X1,X2))|p11(X2)))))),inference(assume_negation,[status(cth)],[2])).
% fof(4, negated_conjecture,~(~(?[X1]:~((((((((~(![X2]:(~(r1(X1,X2))|p16(X2)))|~(![X2]:(~(r1(X1,X2))|p12(X2))))|~(![X2]:(~(r1(X1,X2))|p14(X2))))|~(![X2]:(~(r1(X1,X2))|p12(X2))))|![X2]:(~(r1(X1,X2))|p15(X2)))|![X2]:(~(r1(X1,X2))|p13(X2)))|![X2]:(~(r1(X1,X2))|p12(X2)))|![X2]:(~(r1(X1,X2))|p11(X2)))))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(7, negated_conjecture,?[X1]:(((((((![X2]:(~(r1(X1,X2))|p16(X2))&![X2]:(~(r1(X1,X2))|p12(X2)))&![X2]:(~(r1(X1,X2))|p14(X2)))&![X2]:(~(r1(X1,X2))|p12(X2)))&?[X2]:(r1(X1,X2)&~(p15(X2))))&?[X2]:(r1(X1,X2)&~(p13(X2))))&?[X2]:(r1(X1,X2)&~(p12(X2))))&?[X2]:(r1(X1,X2)&~(p11(X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(8, negated_conjecture,?[X3]:(((((((![X4]:(~(r1(X3,X4))|p16(X4))&![X5]:(~(r1(X3,X5))|p12(X5)))&![X6]:(~(r1(X3,X6))|p14(X6)))&![X7]:(~(r1(X3,X7))|p12(X7)))&?[X8]:(r1(X3,X8)&~(p15(X8))))&?[X9]:(r1(X3,X9)&~(p13(X9))))&?[X10]:(r1(X3,X10)&~(p12(X10))))&?[X11]:(r1(X3,X11)&~(p11(X11)))),inference(variable_rename,[status(thm)],[7])).
% fof(9, negated_conjecture,(((((((![X4]:(~(r1(esk1_0,X4))|p16(X4))&![X5]:(~(r1(esk1_0,X5))|p12(X5)))&![X6]:(~(r1(esk1_0,X6))|p14(X6)))&![X7]:(~(r1(esk1_0,X7))|p12(X7)))&(r1(esk1_0,esk2_0)&~(p15(esk2_0))))&(r1(esk1_0,esk3_0)&~(p13(esk3_0))))&(r1(esk1_0,esk4_0)&~(p12(esk4_0))))&(r1(esk1_0,esk5_0)&~(p11(esk5_0)))),inference(skolemize,[status(esa)],[8])).
% fof(10, negated_conjecture,![X4]:![X5]:![X6]:![X7]:((((((~(r1(esk1_0,X7))|p12(X7))&((~(r1(esk1_0,X6))|p14(X6))&((~(r1(esk1_0,X5))|p12(X5))&(~(r1(esk1_0,X4))|p16(X4)))))&(r1(esk1_0,esk2_0)&~(p15(esk2_0))))&(r1(esk1_0,esk3_0)&~(p13(esk3_0))))&(r1(esk1_0,esk4_0)&~(p12(esk4_0))))&(r1(esk1_0,esk5_0)&~(p11(esk5_0)))),inference(shift_quantors,[status(thm)],[9])).
% cnf(13,negated_conjecture,(~p12(esk4_0)),inference(split_conjunct,[status(thm)],[10])).
% cnf(14,negated_conjecture,(r1(esk1_0,esk4_0)),inference(split_conjunct,[status(thm)],[10])).
% cnf(20,negated_conjecture,(p12(X1)|~r1(esk1_0,X1)),inference(split_conjunct,[status(thm)],[10])).
% cnf(23,negated_conjecture,(~r1(esk1_0,esk4_0)),inference(spm,[status(thm)],[13,20,theory(equality)])).
% cnf(24,negated_conjecture,($false),inference(rw,[status(thm)],[23,14,theory(equality)])).
% cnf(25,negated_conjecture,($false),inference(cn,[status(thm)],[24,theory(equality)])).
% cnf(26,negated_conjecture,($false),25,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 24
% # ...of these trivial                : 0
% # ...subsumed                        : 1
% # ...remaining for further processing: 23
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 1
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 11
% #    Positive orientable unit clauses: 5
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 4
% #    Non-unit-clauses                : 2
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 2
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 8
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    18 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:            7 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           16 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.007 s
% # System time            : 0.005 s
% # Total time             : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.20 WC
% FINAL PrfWatch: 0.10 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP15144/LCL664+1.001.tptp
% 
%------------------------------------------------------------------------------