%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV378+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 : 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 : Thu Dec 30 08:49:56 EST 2010
% Result : Theorem 0.97s
% Output : Solution 0.97s
% 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/SystemOnTPTP18504/SWV378+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18504/SWV378+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18504/SWV378+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 18600
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>X3=bad),file('/tmp/SRASS.s.p', ax41)).
% fof(4, axiom,![X1]:![X2]:(ok(triple(X1,X2,bad))<=>~($true)),file('/tmp/SRASS.s.p', ax40)).
% fof(5, axiom,![X1]:![X2]:![X3]:![X4]:(~(contains_slb(X2,X4))=>remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)),file('/tmp/SRASS.s.p', ax43)).
% fof(7, axiom,![X1]:![X2]:(less_than(X1,X2)|less_than(X2,X1)),file('/tmp/SRASS.s.p', totality)).
% fof(13, axiom,![X1]:![X2]:![X3]:![X4]:((contains_slb(X2,X4)&strictly_less_than(X4,lookup_slb(X2,X4)))=>remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)),file('/tmp/SRASS.s.p', ax45)).
% fof(18, axiom,![X1]:![X2]:![X3]:![X4]:((contains_slb(X2,X4)&less_than(lookup_slb(X2,X4),X4))=>remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)),file('/tmp/SRASS.s.p', ax44)).
% fof(32, 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(42, conjecture,![X1]:![X2]:![X3]:![X4]:(~(ok(triple(X1,X2,X3)))=>~(ok(remove_cpq(triple(X1,X2,X3),X4)))),file('/tmp/SRASS.s.p', l14_co)).
% fof(43, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(~(ok(triple(X1,X2,X3)))=>~(ok(remove_cpq(triple(X1,X2,X3),X4))))),inference(assume_negation,[status(cth)],[42])).
% fof(44, plain,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>X3=bad),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(45, plain,![X1]:![X2]:~(ok(triple(X1,X2,bad))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(46, plain,![X1]:![X2]:![X3]:![X4]:(~(contains_slb(X2,X4))=>remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(49, plain,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),inference(fof_simplification,[status(thm)],[32,theory(equality)])).
% fof(53, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(~(ok(triple(X1,X2,X3)))=>~(ok(remove_cpq(triple(X1,X2,X3),X4))))),inference(fof_simplification,[status(thm)],[43,theory(equality)])).
% fof(54, plain,![X1]:![X2]:![X3]:(ok(triple(X1,X2,X3))|X3=bad),inference(fof_nnf,[status(thm)],[44])).
% fof(55, plain,![X4]:![X5]:![X6]:(ok(triple(X4,X5,X6))|X6=bad),inference(variable_rename,[status(thm)],[54])).
% cnf(56,plain,(X1=bad|ok(triple(X2,X3,X1))),inference(split_conjunct,[status(thm)],[55])).
% fof(62, plain,![X3]:![X4]:~(ok(triple(X3,X4,bad))),inference(variable_rename,[status(thm)],[45])).
% cnf(63,plain,(~ok(triple(X1,X2,bad))),inference(split_conjunct,[status(thm)],[62])).
% fof(64, plain,![X1]:![X2]:![X3]:![X4]:(contains_slb(X2,X4)|remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)),inference(fof_nnf,[status(thm)],[46])).
% fof(65, plain,![X5]:![X6]:![X7]:![X8]:(contains_slb(X6,X8)|remove_cpq(triple(X5,X6,X7),X8)=triple(X5,X6,bad)),inference(variable_rename,[status(thm)],[64])).
% cnf(66,plain,(remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)|contains_slb(X2,X4)),inference(split_conjunct,[status(thm)],[65])).
% fof(70, plain,![X3]:![X4]:(less_than(X3,X4)|less_than(X4,X3)),inference(variable_rename,[status(thm)],[7])).
% cnf(71,plain,(less_than(X1,X2)|less_than(X2,X1)),inference(split_conjunct,[status(thm)],[70])).
% fof(85, plain,![X1]:![X2]:![X3]:![X4]:((~(contains_slb(X2,X4))|~(strictly_less_than(X4,lookup_slb(X2,X4))))|remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)),inference(fof_nnf,[status(thm)],[13])).
% fof(86, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_slb(X6,X8))|~(strictly_less_than(X8,lookup_slb(X6,X8))))|remove_cpq(triple(X5,X6,X7),X8)=triple(remove_pqp(X5,X8),remove_slb(X6,X8),bad)),inference(variable_rename,[status(thm)],[85])).
% cnf(87,plain,(remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)|~strictly_less_than(X4,lookup_slb(X2,X4))|~contains_slb(X2,X4)),inference(split_conjunct,[status(thm)],[86])).
% fof(107, plain,![X1]:![X2]:![X3]:![X4]:((~(contains_slb(X2,X4))|~(less_than(lookup_slb(X2,X4),X4)))|remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)),inference(fof_nnf,[status(thm)],[18])).
% fof(108, plain,![X5]:![X6]:![X7]:![X8]:((~(contains_slb(X6,X8))|~(less_than(lookup_slb(X6,X8),X8)))|remove_cpq(triple(X5,X6,X7),X8)=triple(remove_pqp(X5,X8),remove_slb(X6,X8),X7)),inference(variable_rename,[status(thm)],[107])).
% cnf(109,plain,(remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)|~less_than(lookup_slb(X2,X4),X4)|~contains_slb(X2,X4)),inference(split_conjunct,[status(thm)],[108])).
% fof(144, 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)],[49])).
% fof(145, 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)],[144])).
% fof(146, 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)],[145])).
% cnf(147,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[146])).
% fof(171, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:(~(ok(triple(X1,X2,X3)))&ok(remove_cpq(triple(X1,X2,X3),X4))),inference(fof_nnf,[status(thm)],[53])).
% fof(172, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:(~(ok(triple(X5,X6,X7)))&ok(remove_cpq(triple(X5,X6,X7),X8))),inference(variable_rename,[status(thm)],[171])).
% fof(173, negated_conjecture,(~(ok(triple(esk1_0,esk2_0,esk3_0)))&ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))),inference(skolemize,[status(esa)],[172])).
% cnf(174,negated_conjecture,(ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))),inference(split_conjunct,[status(thm)],[173])).
% cnf(175,negated_conjecture,(~ok(triple(esk1_0,esk2_0,esk3_0))),inference(split_conjunct,[status(thm)],[173])).
% cnf(177,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)),inference(csr,[status(thm)],[147,71])).
% cnf(182,negated_conjecture,(bad=esk3_0),inference(spm,[status(thm)],[175,56,theory(equality)])).
% cnf(237,plain,(~ok(remove_cpq(triple(X1,X3,bad),X2))|~less_than(lookup_slb(X3,X2),X2)|~contains_slb(X3,X2)),inference(spm,[status(thm)],[63,109,theory(equality)])).
% cnf(272,plain,(~ok(remove_cpq(triple(X1,X3,X4),X2))|~strictly_less_than(X2,lookup_slb(X3,X2))|~contains_slb(X3,X2)),inference(spm,[status(thm)],[63,87,theory(equality)])).
% cnf(292,negated_conjecture,(ok(remove_cpq(triple(esk1_0,esk2_0,bad),esk4_0))),inference(rw,[status(thm)],[174,182,theory(equality)])).
% cnf(294,negated_conjecture,(ok(triple(esk1_0,esk2_0,bad))|contains_slb(esk2_0,esk4_0)),inference(spm,[status(thm)],[292,66,theory(equality)])).
% cnf(295,negated_conjecture,(contains_slb(esk2_0,esk4_0)),inference(sr,[status(thm)],[294,63,theory(equality)])).
% cnf(395,negated_conjecture,(~strictly_less_than(esk4_0,lookup_slb(esk2_0,esk4_0))|~contains_slb(esk2_0,esk4_0)),inference(spm,[status(thm)],[272,292,theory(equality)])).
% cnf(396,negated_conjecture,(~strictly_less_than(esk4_0,lookup_slb(esk2_0,esk4_0))|$false),inference(rw,[status(thm)],[395,295,theory(equality)])).
% cnf(397,negated_conjecture,(~strictly_less_than(esk4_0,lookup_slb(esk2_0,esk4_0))),inference(cn,[status(thm)],[396,theory(equality)])).
% cnf(440,negated_conjecture,(less_than(lookup_slb(esk2_0,esk4_0),esk4_0)),inference(spm,[status(thm)],[397,177,theory(equality)])).
% cnf(651,negated_conjecture,(~less_than(lookup_slb(esk2_0,esk4_0),esk4_0)|~contains_slb(esk2_0,esk4_0)),inference(spm,[status(thm)],[237,292,theory(equality)])).
% cnf(652,negated_conjecture,($false|~contains_slb(esk2_0,esk4_0)),inference(rw,[status(thm)],[651,440,theory(equality)])).
% cnf(653,negated_conjecture,($false|$false),inference(rw,[status(thm)],[652,295,theory(equality)])).
% cnf(654,negated_conjecture,($false),inference(cn,[status(thm)],[653,theory(equality)])).
% cnf(655,negated_conjecture,($false),654,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 193
% # ...of these trivial : 1
% # ...subsumed : 42
% # ...remaining for further processing: 150
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 371
% # ...of the previous two non-trivial : 295
% # Contextual simplify-reflections : 8
% # Paramodulations : 337
% # Factorizations : 32
% # Equation resolutions : 3
% # Current number of processed clauses: 96
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 66
% # Current number of unprocessed clauses: 201
% # ...number of literals in the above : 816
% # Clause-clause subsumption calls (NU) : 804
% # Rec. Clause-clause subsumption calls : 669
% # Unit Clause-clause subsumption calls : 29
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 111 leaves, 2.02+/-1.811 terms/leaf
% # Paramod-from index: 48 leaves, 1.31+/-1.175 terms/leaf
% # Paramod-into index: 100 leaves, 1.72+/-1.613 terms/leaf
% # -------------------------------------------------
% # User time : 0.038 s
% # System time : 0.003 s
% # Total time : 0.041 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP18504/SWV378+1.tptp
%
%------------------------------------------------------------------------------