TSTP Solution File: LCL682+1.001 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL682+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 15:41:44 EST 2010
% Result : Theorem 0.86s
% Output : Solution 0.86s
% 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/SystemOnTPTP23700/LCL682+1.001.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP23700/LCL682+1.001.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23700/LCL682+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 23796
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, conjecture,~(?[X1]:~(((((~(![X2]:(~(r1(X1,X2))|~((((~(![X1]:(~(r1(X2,X1))|p16(X1)))|~(![X1]:(~(r1(X2,X1))|p12(X1))))|~(![X1]:(~(r1(X2,X1))|p14(X1))))|~(![X1]:(~(r1(X2,X1))|p12(X1)))))))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|p15(X1))))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|p13(X1))))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|p12(X1))))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|p11(X1)))))),file('/tmp/SRASS.s.p', main)).
% fof(4, negated_conjecture,~(~(?[X1]:~(((((~(![X2]:(~(r1(X1,X2))|~((((~(![X1]:(~(r1(X2,X1))|p16(X1)))|~(![X1]:(~(r1(X2,X1))|p12(X1))))|~(![X1]:(~(r1(X2,X1))|p14(X1))))|~(![X1]:(~(r1(X2,X1))|p12(X1)))))))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|p15(X1))))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|p13(X1))))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|p12(X1))))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|p11(X1))))))),inference(assume_negation,[status(cth)],[3])).
% fof(5, negated_conjecture,~(~(?[X1]:~(((((~(![X2]:(~(r1(X1,X2))|~((((~(![X1]:(~(r1(X2,X1))|p16(X1)))|~(![X1]:(~(r1(X2,X1))|p12(X1))))|~(![X1]:(~(r1(X2,X1))|p14(X1))))|~(![X1]:(~(r1(X2,X1))|p12(X1)))))))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|p15(X1))))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|p13(X1))))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|p12(X1))))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|p11(X1))))))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(11, negated_conjecture,?[X1]:((((![X2]:(~(r1(X1,X2))|(((![X1]:(~(r1(X2,X1))|p16(X1))&![X1]:(~(r1(X2,X1))|p12(X1)))&![X1]:(~(r1(X2,X1))|p14(X1)))&![X1]:(~(r1(X2,X1))|p12(X1))))&?[X2]:(r1(X1,X2)&?[X1]:(r1(X2,X1)&~(p15(X1)))))&?[X2]:(r1(X1,X2)&?[X1]:(r1(X2,X1)&~(p13(X1)))))&?[X2]:(r1(X1,X2)&?[X1]:(r1(X2,X1)&~(p12(X1)))))&?[X2]:(r1(X1,X2)&?[X1]:(r1(X2,X1)&~(p11(X1))))),inference(fof_nnf,[status(thm)],[5])).
% fof(12, negated_conjecture,?[X3]:((((![X4]:(~(r1(X3,X4))|(((![X5]:(~(r1(X4,X5))|p16(X5))&![X6]:(~(r1(X4,X6))|p12(X6)))&![X7]:(~(r1(X4,X7))|p14(X7)))&![X8]:(~(r1(X4,X8))|p12(X8))))&?[X9]:(r1(X3,X9)&?[X10]:(r1(X9,X10)&~(p15(X10)))))&?[X11]:(r1(X3,X11)&?[X12]:(r1(X11,X12)&~(p13(X12)))))&?[X13]:(r1(X3,X13)&?[X14]:(r1(X13,X14)&~(p12(X14)))))&?[X15]:(r1(X3,X15)&?[X16]:(r1(X15,X16)&~(p11(X16))))),inference(variable_rename,[status(thm)],[11])).
% fof(13, negated_conjecture,((((![X4]:(~(r1(esk1_0,X4))|(((![X5]:(~(r1(X4,X5))|p16(X5))&![X6]:(~(r1(X4,X6))|p12(X6)))&![X7]:(~(r1(X4,X7))|p14(X7)))&![X8]:(~(r1(X4,X8))|p12(X8))))&(r1(esk1_0,esk2_0)&(r1(esk2_0,esk3_0)&~(p15(esk3_0)))))&(r1(esk1_0,esk4_0)&(r1(esk4_0,esk5_0)&~(p13(esk5_0)))))&(r1(esk1_0,esk6_0)&(r1(esk6_0,esk7_0)&~(p12(esk7_0)))))&(r1(esk1_0,esk8_0)&(r1(esk8_0,esk9_0)&~(p11(esk9_0))))),inference(skolemize,[status(esa)],[12])).
% fof(14, negated_conjecture,![X4]:![X5]:![X6]:![X7]:![X8]:(((((((~(r1(X4,X8))|p12(X8))&((~(r1(X4,X7))|p14(X7))&((~(r1(X4,X6))|p12(X6))&(~(r1(X4,X5))|p16(X5)))))|~(r1(esk1_0,X4)))&(r1(esk1_0,esk2_0)&(r1(esk2_0,esk3_0)&~(p15(esk3_0)))))&(r1(esk1_0,esk4_0)&(r1(esk4_0,esk5_0)&~(p13(esk5_0)))))&(r1(esk1_0,esk6_0)&(r1(esk6_0,esk7_0)&~(p12(esk7_0)))))&(r1(esk1_0,esk8_0)&(r1(esk8_0,esk9_0)&~(p11(esk9_0))))),inference(shift_quantors,[status(thm)],[13])).
% fof(15, negated_conjecture,![X4]:![X5]:![X6]:![X7]:![X8]:(((((((~(r1(X4,X8))|p12(X8))|~(r1(esk1_0,X4)))&(((~(r1(X4,X7))|p14(X7))|~(r1(esk1_0,X4)))&(((~(r1(X4,X6))|p12(X6))|~(r1(esk1_0,X4)))&((~(r1(X4,X5))|p16(X5))|~(r1(esk1_0,X4))))))&(r1(esk1_0,esk2_0)&(r1(esk2_0,esk3_0)&~(p15(esk3_0)))))&(r1(esk1_0,esk4_0)&(r1(esk4_0,esk5_0)&~(p13(esk5_0)))))&(r1(esk1_0,esk6_0)&(r1(esk6_0,esk7_0)&~(p12(esk7_0)))))&(r1(esk1_0,esk8_0)&(r1(esk8_0,esk9_0)&~(p11(esk9_0))))),inference(distribute,[status(thm)],[14])).
% cnf(19,negated_conjecture,(~p12(esk7_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(20,negated_conjecture,(r1(esk6_0,esk7_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(21,negated_conjecture,(r1(esk1_0,esk6_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(29,negated_conjecture,(p12(X2)|~r1(esk1_0,X1)|~r1(X1,X2)),inference(split_conjunct,[status(thm)],[15])).
% cnf(39,negated_conjecture,(p12(X1)|~r1(esk6_0,X1)),inference(spm,[status(thm)],[29,21,theory(equality)])).
% cnf(58,negated_conjecture,(~r1(esk6_0,esk7_0)),inference(spm,[status(thm)],[19,39,theory(equality)])).
% cnf(59,negated_conjecture,($false),inference(rw,[status(thm)],[58,20,theory(equality)])).
% cnf(60,negated_conjecture,($false),inference(cn,[status(thm)],[59,theory(equality)])).
% cnf(61,negated_conjecture,($false),60,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 43
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 42
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 27
% # ...of the previous two non-trivial : 25
% # Contextual simplify-reflections : 0
% # Paramodulations : 27
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 25
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 17
% # ...number of literals in the above : 32
% # Clause-clause subsumption calls (NU) : 3
% # Rec. Clause-clause subsumption calls : 3
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 16
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 31 leaves, 1.16+/-0.723 terms/leaf
% # Paramod-from index: 11 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 25 leaves, 1.04+/-0.196 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.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP23700/LCL682+1.001.tptp
%
%------------------------------------------------------------------------------