TSTP Solution File: SWV394+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV394+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 : art05.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:53:39 EST 2010
% Result : Theorem 1.19s
% Output : Solution 1.19s
% 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/SystemOnTPTP30623/SWV394+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30623/SWV394+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30623/SWV394+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 30719
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(less_than(X1,X2)|less_than(X2,X1)),file('/tmp/SRASS.s.p', totality)).
% fof(4, axiom,![X1]:![X2]:![X3]:(check_cpq(triple(X1,X2,X3))<=>![X4]:![X5]:(pair_in_list(X2,X4,X5)=>less_than(X5,X4))),file('/tmp/SRASS.s.p', l30_li4142)).
% fof(6, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:(((pair_in_list(X2,X4,X5)&strictly_less_than(X4,X5))&ok(remove_cpq(triple(X1,X2,X3),X4)))=>pair_in_list(remove_slb(X2,X4),X4,X5)),file('/tmp/SRASS.s.p', l30_li3132)).
% fof(12, 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(13, axiom,![X1]:![X2]:(ok(triple(X1,X2,bad))<=>~($true)),file('/tmp/SRASS.s.p', ax40)).
% fof(15, 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(16, 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]:![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(44, conjecture,![X1]:![X2]:![X3]:![X4]:((check_cpq(remove_cpq(triple(X1,X2,X3),X4))&ok(remove_cpq(triple(X1,X2,X3),X4)))=>![X5]:(pair_in_list(X2,X4,X5)=>less_than(X5,X4))),file('/tmp/SRASS.s.p', l30_co)).
% fof(45, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:((check_cpq(remove_cpq(triple(X1,X2,X3),X4))&ok(remove_cpq(triple(X1,X2,X3),X4)))=>![X5]:(pair_in_list(X2,X4,X5)=>less_than(X5,X4)))),inference(assume_negation,[status(cth)],[44])).
% fof(48, plain,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(49, plain,![X1]:![X2]:~(ok(triple(X1,X2,bad))),inference(fof_simplification,[status(thm)],[13,theory(equality)])).
% fof(50, 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)],[15,theory(equality)])).
% fof(58, plain,![X3]:![X4]:(less_than(X3,X4)|less_than(X4,X3)),inference(variable_rename,[status(thm)],[2])).
% cnf(59,plain,(less_than(X1,X2)|less_than(X2,X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(62, plain,![X1]:![X2]:![X3]:((~(check_cpq(triple(X1,X2,X3)))|![X4]:![X5]:(~(pair_in_list(X2,X4,X5))|less_than(X5,X4)))&(?[X4]:?[X5]:(pair_in_list(X2,X4,X5)&~(less_than(X5,X4)))|check_cpq(triple(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[4])).
% fof(63, plain,![X6]:![X7]:![X8]:((~(check_cpq(triple(X6,X7,X8)))|![X9]:![X10]:(~(pair_in_list(X7,X9,X10))|less_than(X10,X9)))&(?[X11]:?[X12]:(pair_in_list(X7,X11,X12)&~(less_than(X12,X11)))|check_cpq(triple(X6,X7,X8)))),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X6]:![X7]:![X8]:((~(check_cpq(triple(X6,X7,X8)))|![X9]:![X10]:(~(pair_in_list(X7,X9,X10))|less_than(X10,X9)))&((pair_in_list(X7,esk1_3(X6,X7,X8),esk2_3(X6,X7,X8))&~(less_than(esk2_3(X6,X7,X8),esk1_3(X6,X7,X8))))|check_cpq(triple(X6,X7,X8)))),inference(skolemize,[status(esa)],[63])).
% fof(65, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(pair_in_list(X7,X9,X10))|less_than(X10,X9))|~(check_cpq(triple(X6,X7,X8))))&((pair_in_list(X7,esk1_3(X6,X7,X8),esk2_3(X6,X7,X8))&~(less_than(esk2_3(X6,X7,X8),esk1_3(X6,X7,X8))))|check_cpq(triple(X6,X7,X8)))),inference(shift_quantors,[status(thm)],[64])).
% fof(66, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(pair_in_list(X7,X9,X10))|less_than(X10,X9))|~(check_cpq(triple(X6,X7,X8))))&((pair_in_list(X7,esk1_3(X6,X7,X8),esk2_3(X6,X7,X8))|check_cpq(triple(X6,X7,X8)))&(~(less_than(esk2_3(X6,X7,X8),esk1_3(X6,X7,X8)))|check_cpq(triple(X6,X7,X8))))),inference(distribute,[status(thm)],[65])).
% cnf(69,plain,(less_than(X4,X5)|~check_cpq(triple(X1,X2,X3))|~pair_in_list(X2,X5,X4)),inference(split_conjunct,[status(thm)],[66])).
% fof(72, plain,![X1]:![X2]:![X3]:![X4]:![X5]:(((~(pair_in_list(X2,X4,X5))|~(strictly_less_than(X4,X5)))|~(ok(remove_cpq(triple(X1,X2,X3),X4))))|pair_in_list(remove_slb(X2,X4),X4,X5)),inference(fof_nnf,[status(thm)],[6])).
% fof(73, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(pair_in_list(X7,X9,X10))|~(strictly_less_than(X9,X10)))|~(ok(remove_cpq(triple(X6,X7,X8),X9))))|pair_in_list(remove_slb(X7,X9),X9,X10)),inference(variable_rename,[status(thm)],[72])).
% cnf(74,plain,(pair_in_list(remove_slb(X1,X2),X2,X3)|~ok(remove_cpq(triple(X4,X1,X5),X2))|~strictly_less_than(X2,X3)|~pair_in_list(X1,X2,X3)),inference(split_conjunct,[status(thm)],[73])).
% fof(90, 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)],[48])).
% fof(91, 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)],[90])).
% fof(92, 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)],[91])).
% cnf(93,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[92])).
% fof(96, plain,![X3]:![X4]:~(ok(triple(X3,X4,bad))),inference(variable_rename,[status(thm)],[49])).
% cnf(97,plain,(~ok(triple(X1,X2,bad))),inference(split_conjunct,[status(thm)],[96])).
% fof(100, 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)],[50])).
% fof(101, 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)],[100])).
% cnf(102,plain,(remove_cpq(triple(X1,X2,X3),X4)=triple(X1,X2,bad)|contains_slb(X2,X4)),inference(split_conjunct,[status(thm)],[101])).
% fof(103, 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)],[16])).
% fof(104, 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)],[103])).
% cnf(105,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)],[104])).
% fof(154, 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)],[32])).
% fof(155, 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)],[154])).
% cnf(156,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)],[155])).
% fof(183, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((check_cpq(remove_cpq(triple(X1,X2,X3),X4))&ok(remove_cpq(triple(X1,X2,X3),X4)))&?[X5]:(pair_in_list(X2,X4,X5)&~(less_than(X5,X4)))),inference(fof_nnf,[status(thm)],[45])).
% fof(184, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:((check_cpq(remove_cpq(triple(X6,X7,X8),X9))&ok(remove_cpq(triple(X6,X7,X8),X9)))&?[X10]:(pair_in_list(X7,X9,X10)&~(less_than(X10,X9)))),inference(variable_rename,[status(thm)],[183])).
% fof(185, negated_conjecture,((check_cpq(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0))&ok(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0)))&(pair_in_list(esk4_0,esk6_0,esk7_0)&~(less_than(esk7_0,esk6_0)))),inference(skolemize,[status(esa)],[184])).
% cnf(186,negated_conjecture,(~less_than(esk7_0,esk6_0)),inference(split_conjunct,[status(thm)],[185])).
% cnf(187,negated_conjecture,(pair_in_list(esk4_0,esk6_0,esk7_0)),inference(split_conjunct,[status(thm)],[185])).
% cnf(188,negated_conjecture,(ok(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0))),inference(split_conjunct,[status(thm)],[185])).
% cnf(189,negated_conjecture,(check_cpq(remove_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0))),inference(split_conjunct,[status(thm)],[185])).
% cnf(191,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)),inference(csr,[status(thm)],[93,59])).
% cnf(230,negated_conjecture,(ok(triple(esk3_0,esk4_0,bad))|contains_slb(esk4_0,esk6_0)),inference(spm,[status(thm)],[188,102,theory(equality)])).
% cnf(232,negated_conjecture,(contains_slb(esk4_0,esk6_0)),inference(sr,[status(thm)],[230,97,theory(equality)])).
% cnf(273,negated_conjecture,(pair_in_list(remove_slb(esk4_0,esk6_0),esk6_0,X1)|~strictly_less_than(esk6_0,X1)|~pair_in_list(esk4_0,esk6_0,X1)),inference(spm,[status(thm)],[74,188,theory(equality)])).
% cnf(294,negated_conjecture,(check_cpq(triple(remove_pqp(esk3_0,esk6_0),remove_slb(esk4_0,esk6_0),esk5_0))|~contains_slb(esk4_0,esk6_0)|~less_than(lookup_slb(esk4_0,esk6_0),esk6_0)),inference(spm,[status(thm)],[189,105,theory(equality)])).
% cnf(303,negated_conjecture,(ok(triple(remove_pqp(esk3_0,esk6_0),remove_slb(esk4_0,esk6_0),bad))|~contains_slb(esk4_0,esk6_0)|~strictly_less_than(esk6_0,lookup_slb(esk4_0,esk6_0))),inference(spm,[status(thm)],[188,156,theory(equality)])).
% cnf(310,negated_conjecture,(~contains_slb(esk4_0,esk6_0)|~strictly_less_than(esk6_0,lookup_slb(esk4_0,esk6_0))),inference(sr,[status(thm)],[303,97,theory(equality)])).
% cnf(687,negated_conjecture,($false|~strictly_less_than(esk6_0,lookup_slb(esk4_0,esk6_0))),inference(rw,[status(thm)],[310,232,theory(equality)])).
% cnf(688,negated_conjecture,(~strictly_less_than(esk6_0,lookup_slb(esk4_0,esk6_0))),inference(cn,[status(thm)],[687,theory(equality)])).
% cnf(3481,negated_conjecture,(check_cpq(triple(remove_pqp(esk3_0,esk6_0),remove_slb(esk4_0,esk6_0),esk5_0))|$false|~less_than(lookup_slb(esk4_0,esk6_0),esk6_0)),inference(rw,[status(thm)],[294,232,theory(equality)])).
% cnf(3482,negated_conjecture,(check_cpq(triple(remove_pqp(esk3_0,esk6_0),remove_slb(esk4_0,esk6_0),esk5_0))|~less_than(lookup_slb(esk4_0,esk6_0),esk6_0)),inference(cn,[status(thm)],[3481,theory(equality)])).
% cnf(3483,negated_conjecture,(less_than(X1,X2)|~pair_in_list(remove_slb(esk4_0,esk6_0),X2,X1)|~less_than(lookup_slb(esk4_0,esk6_0),esk6_0)),inference(spm,[status(thm)],[69,3482,theory(equality)])).
% cnf(4599,negated_conjecture,(less_than(X1,esk6_0)|~less_than(lookup_slb(esk4_0,esk6_0),esk6_0)|~strictly_less_than(esk6_0,X1)|~pair_in_list(esk4_0,esk6_0,X1)),inference(spm,[status(thm)],[3483,273,theory(equality)])).
% cnf(4600,negated_conjecture,(less_than(X1,esk6_0)|~pair_in_list(esk4_0,esk6_0,X1)|~less_than(lookup_slb(esk4_0,esk6_0),esk6_0)),inference(csr,[status(thm)],[4599,191])).
% cnf(4601,negated_conjecture,(less_than(esk7_0,esk6_0)|~less_than(lookup_slb(esk4_0,esk6_0),esk6_0)),inference(spm,[status(thm)],[4600,187,theory(equality)])).
% cnf(4602,negated_conjecture,(~less_than(lookup_slb(esk4_0,esk6_0),esk6_0)),inference(sr,[status(thm)],[4601,186,theory(equality)])).
% cnf(4610,negated_conjecture,(strictly_less_than(esk6_0,lookup_slb(esk4_0,esk6_0))),inference(spm,[status(thm)],[4602,191,theory(equality)])).
% cnf(4636,negated_conjecture,($false),inference(sr,[status(thm)],[4610,688,theory(equality)])).
% cnf(4637,negated_conjecture,($false),4636,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 845
% # ...of these trivial : 12
% # ...subsumed : 540
% # ...remaining for further processing: 293
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 3
% # Generated clauses : 3406
% # ...of the previous two non-trivial : 2695
% # Contextual simplify-reflections : 250
% # Paramodulations : 3292
% # Factorizations : 112
% # Equation resolutions : 3
% # Current number of processed clauses: 230
% # Positive orientable unit clauses: 37
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 22
% # Non-unit-clauses : 168
% # Current number of unprocessed clauses: 1927
% # ...number of literals in the above : 8833
% # Clause-clause subsumption calls (NU) : 27425
% # Rec. Clause-clause subsumption calls : 13900
% # Unit Clause-clause subsumption calls : 50
% # Rewrite failures with RHS unbound : 19
% # Indexed BW rewrite attempts : 31
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 191 leaves, 2.10+/-2.062 terms/leaf
% # Paramod-from index: 69 leaves, 1.59+/-1.563 terms/leaf
% # Paramod-into index: 152 leaves, 1.91+/-1.858 terms/leaf
% # -------------------------------------------------
% # User time : 0.186 s
% # System time : 0.008 s
% # Total time : 0.194 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.33 CPU 0.42 WC
% FINAL PrfWatch: 0.33 CPU 0.42 WC
% SZS output end Solution for /tmp/SystemOnTPTP30623/SWV394+1.tptp
%
%------------------------------------------------------------------------------