%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV399+1 : TPTP v5.0.0. Released v3.3.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 : Thu Dec 30 08:54:24 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP10962/SWV399+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10962/SWV399+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10962/SWV399+1.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 11058
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:((pair_in_list(X1,X2,X3)&strictly_less_than(X3,X4))=>pair_in_list(update_slb(X1,X4),X2,X4)),file('/tmp/SRASS.s.p', l35_li3839)).
% fof(2, axiom,![X1]:![X2]:![X3]:![X4]:((pair_in_list(X1,X2,X3)&less_than(X4,X3))=>pair_in_list(update_slb(X1,X4),X2,X3)),file('/tmp/SRASS.s.p', l35_li3637)).
% fof(3, axiom,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),file('/tmp/SRASS.s.p', stricly_smaller_definition)).
% fof(4, axiom,![X1]:![X2]:![X3]:((less_than(X1,X2)&less_than(X2,X3))=>less_than(X1,X3)),file('/tmp/SRASS.s.p', transitivity)).
% fof(5, axiom,![X1]:![X2]:(less_than(X1,X2)|less_than(X2,X1)),file('/tmp/SRASS.s.p', totality)).
% fof(21, conjecture,![X1]:(?[X2]:?[X3]:(pair_in_list(X1,X2,X3)&strictly_less_than(X2,X3))=>![X4]:?[X5]:?[X6]:(pair_in_list(update_slb(X1,X4),X5,X6)&strictly_less_than(X5,X6))),file('/tmp/SRASS.s.p', l35_co)).
% fof(22, negated_conjecture,~(![X1]:(?[X2]:?[X3]:(pair_in_list(X1,X2,X3)&strictly_less_than(X2,X3))=>![X4]:?[X5]:?[X6]:(pair_in_list(update_slb(X1,X4),X5,X6)&strictly_less_than(X5,X6)))),inference(assume_negation,[status(cth)],[21])).
% fof(23, plain,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(27, plain,![X1]:![X2]:![X3]:![X4]:((~(pair_in_list(X1,X2,X3))|~(strictly_less_than(X3,X4)))|pair_in_list(update_slb(X1,X4),X2,X4)),inference(fof_nnf,[status(thm)],[1])).
% fof(28, plain,![X5]:![X6]:![X7]:![X8]:((~(pair_in_list(X5,X6,X7))|~(strictly_less_than(X7,X8)))|pair_in_list(update_slb(X5,X8),X6,X8)),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(pair_in_list(update_slb(X1,X2),X3,X2)|~strictly_less_than(X4,X2)|~pair_in_list(X1,X3,X4)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X1]:![X2]:![X3]:![X4]:((~(pair_in_list(X1,X2,X3))|~(less_than(X4,X3)))|pair_in_list(update_slb(X1,X4),X2,X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(31, plain,![X5]:![X6]:![X7]:![X8]:((~(pair_in_list(X5,X6,X7))|~(less_than(X8,X7)))|pair_in_list(update_slb(X5,X8),X6,X7)),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(pair_in_list(update_slb(X1,X2),X3,X4)|~less_than(X2,X4)|~pair_in_list(X1,X3,X4)),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X1]:![X2]:((~(strictly_less_than(X1,X2))|(less_than(X1,X2)&~(less_than(X2,X1))))&((~(less_than(X1,X2))|less_than(X2,X1))|strictly_less_than(X1,X2))),inference(fof_nnf,[status(thm)],[23])).
% fof(34, plain,![X3]:![X4]:((~(strictly_less_than(X3,X4))|(less_than(X3,X4)&~(less_than(X4,X3))))&((~(less_than(X3,X4))|less_than(X4,X3))|strictly_less_than(X3,X4))),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X3]:![X4]:(((less_than(X3,X4)|~(strictly_less_than(X3,X4)))&(~(less_than(X4,X3))|~(strictly_less_than(X3,X4))))&((~(less_than(X3,X4))|less_than(X4,X3))|strictly_less_than(X3,X4))),inference(distribute,[status(thm)],[34])).
% cnf(36,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[35])).
% cnf(38,plain,(less_than(X1,X2)|~strictly_less_than(X1,X2)),inference(split_conjunct,[status(thm)],[35])).
% fof(39, plain,![X1]:![X2]:![X3]:((~(less_than(X1,X2))|~(less_than(X2,X3)))|less_than(X1,X3)),inference(fof_nnf,[status(thm)],[4])).
% fof(40, plain,![X4]:![X5]:![X6]:((~(less_than(X4,X5))|~(less_than(X5,X6)))|less_than(X4,X6)),inference(variable_rename,[status(thm)],[39])).
% cnf(41,plain,(less_than(X1,X2)|~less_than(X3,X2)|~less_than(X1,X3)),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X3]:![X4]:(less_than(X3,X4)|less_than(X4,X3)),inference(variable_rename,[status(thm)],[5])).
% cnf(43,plain,(less_than(X1,X2)|less_than(X2,X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(86, negated_conjecture,?[X1]:(?[X2]:?[X3]:(pair_in_list(X1,X2,X3)&strictly_less_than(X2,X3))&?[X4]:![X5]:![X6]:(~(pair_in_list(update_slb(X1,X4),X5,X6))|~(strictly_less_than(X5,X6)))),inference(fof_nnf,[status(thm)],[22])).
% fof(87, negated_conjecture,?[X7]:(?[X8]:?[X9]:(pair_in_list(X7,X8,X9)&strictly_less_than(X8,X9))&?[X10]:![X11]:![X12]:(~(pair_in_list(update_slb(X7,X10),X11,X12))|~(strictly_less_than(X11,X12)))),inference(variable_rename,[status(thm)],[86])).
% fof(88, negated_conjecture,((pair_in_list(esk1_0,esk2_0,esk3_0)&strictly_less_than(esk2_0,esk3_0))&![X11]:![X12]:(~(pair_in_list(update_slb(esk1_0,esk4_0),X11,X12))|~(strictly_less_than(X11,X12)))),inference(skolemize,[status(esa)],[87])).
% fof(89, negated_conjecture,![X11]:![X12]:((~(pair_in_list(update_slb(esk1_0,esk4_0),X11,X12))|~(strictly_less_than(X11,X12)))&(pair_in_list(esk1_0,esk2_0,esk3_0)&strictly_less_than(esk2_0,esk3_0))),inference(shift_quantors,[status(thm)],[88])).
% cnf(90,negated_conjecture,(strictly_less_than(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[89])).
% cnf(91,negated_conjecture,(pair_in_list(esk1_0,esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[89])).
% cnf(92,negated_conjecture,(~strictly_less_than(X1,X2)|~pair_in_list(update_slb(esk1_0,esk4_0),X1,X2)),inference(split_conjunct,[status(thm)],[89])).
% cnf(94,plain,(less_than(X2,X1)|strictly_less_than(X1,X2)),inference(csr,[status(thm)],[36,43])).
% cnf(101,negated_conjecture,(less_than(esk2_0,esk3_0)),inference(spm,[status(thm)],[38,90,theory(equality)])).
% cnf(109,negated_conjecture,(~strictly_less_than(X1,X2)|~less_than(esk4_0,X2)|~pair_in_list(esk1_0,X1,X2)),inference(spm,[status(thm)],[92,32,theory(equality)])).
% cnf(115,negated_conjecture,(pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)|~strictly_less_than(esk3_0,X1)),inference(spm,[status(thm)],[29,91,theory(equality)])).
% cnf(139,negated_conjecture,(less_than(X1,esk3_0)|~less_than(X1,esk2_0)),inference(spm,[status(thm)],[41,101,theory(equality)])).
% cnf(146,negated_conjecture,(~strictly_less_than(esk2_0,esk4_0)|~strictly_less_than(esk3_0,esk4_0)),inference(spm,[status(thm)],[92,115,theory(equality)])).
% cnf(147,negated_conjecture,(less_than(esk4_0,esk3_0)|~strictly_less_than(esk2_0,esk4_0)),inference(spm,[status(thm)],[146,94,theory(equality)])).
% cnf(148,negated_conjecture,(less_than(esk4_0,esk3_0)|less_than(esk4_0,esk2_0)),inference(spm,[status(thm)],[147,94,theory(equality)])).
% cnf(149,negated_conjecture,(less_than(esk4_0,esk3_0)),inference(csr,[status(thm)],[148,139])).
% cnf(192,negated_conjecture,(~less_than(esk4_0,esk3_0)|~pair_in_list(esk1_0,esk2_0,esk3_0)),inference(spm,[status(thm)],[109,90,theory(equality)])).
% cnf(194,negated_conjecture,($false|~pair_in_list(esk1_0,esk2_0,esk3_0)),inference(rw,[status(thm)],[192,149,theory(equality)])).
% cnf(195,negated_conjecture,($false|$false),inference(rw,[status(thm)],[194,91,theory(equality)])).
% cnf(196,negated_conjecture,($false),inference(cn,[status(thm)],[195,theory(equality)])).
% cnf(197,negated_conjecture,($false),196,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 82
% # ...of these trivial : 0
% # ...subsumed : 6
% # ...remaining for further processing: 76
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 83
% # ...of the previous two non-trivial : 61
% # Contextual simplify-reflections : 2
% # Paramodulations : 79
% # Factorizations : 2
% # Equation resolutions : 3
% # Current number of processed clauses: 43
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 27
% # Current number of unprocessed clauses: 39
% # ...number of literals in the above : 118
% # Clause-clause subsumption calls (NU) : 54
% # Rec. Clause-clause subsumption calls : 54
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 49 leaves, 1.65+/-1.364 terms/leaf
% # Paramod-from index: 20 leaves, 1.30+/-0.557 terms/leaf
% # Paramod-into index: 41 leaves, 1.46+/-1.014 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.005 s
% # Total time : 0.019 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP10962/SWV399+1.tptp
%
%------------------------------------------------------------------------------