TSTP Solution File: SWV409+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV409+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 : art03.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:56:55 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/SystemOnTPTP31741/SWV409+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31741/SWV409+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31741/SWV409+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 31837
% 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(2, axiom,![X1]:![X2]:(less_than(X1,X2)|less_than(X2,X1)),file('/tmp/SRASS.s.p', totality)).
% fof(4, 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(5, axiom,![X1]:![X2]:(contains_slb(X1,X2)=>?[X3]:pair_in_list(X1,X2,X3)),file('/tmp/SRASS.s.p', l45_li4647)).
% fof(6, axiom,![X1]:![X2]:![X3]:![X4]:(((pair_in_list(X1,X2,X3)&strictly_less_than(X2,X4))&strictly_less_than(X3,X4))=>pair_in_list(update_slb(X1,X4),X2,X4)),file('/tmp/SRASS.s.p', l45_l48)).
% fof(7, axiom,![X1]:![X2]:![X3]:![X4]:(((pair_in_list(X1,X2,X3)&strictly_less_than(X2,X4))&less_than(X4,X3))=>?[X5]:(pair_in_list(update_slb(X1,X4),X2,X5)&less_than(X4,X5))),file('/tmp/SRASS.s.p', l45_l49)).
% fof(22, conjecture,![X1]:![X2]:![X3]:((contains_slb(X1,X2)&strictly_less_than(X2,X3))=>(pair_in_list(update_slb(X1,X3),X2,X3)|?[X4]:(pair_in_list(update_slb(X1,X3),X2,X4)&less_than(X3,X4)))),file('/tmp/SRASS.s.p', l45_co)).
% fof(23, negated_conjecture,~(![X1]:![X2]:![X3]:((contains_slb(X1,X2)&strictly_less_than(X2,X3))=>(pair_in_list(update_slb(X1,X3),X2,X3)|?[X4]:(pair_in_list(update_slb(X1,X3),X2,X4)&less_than(X3,X4))))),inference(assume_negation,[status(cth)],[22])).
% fof(24, plain,![X1]:![X2]:(strictly_less_than(X1,X2)<=>(less_than(X1,X2)&~(less_than(X2,X1)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(31, plain,![X3]:![X4]:(less_than(X3,X4)|less_than(X4,X3)),inference(variable_rename,[status(thm)],[2])).
% cnf(32,plain,(less_than(X1,X2)|less_than(X2,X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(35, 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)],[24])).
% fof(36, 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)],[35])).
% fof(37, 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)],[36])).
% cnf(38,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[37])).
% fof(41, plain,![X1]:![X2]:(~(contains_slb(X1,X2))|?[X3]:pair_in_list(X1,X2,X3)),inference(fof_nnf,[status(thm)],[5])).
% fof(42, plain,![X4]:![X5]:(~(contains_slb(X4,X5))|?[X6]:pair_in_list(X4,X5,X6)),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X4]:![X5]:(~(contains_slb(X4,X5))|pair_in_list(X4,X5,esk1_2(X4,X5))),inference(skolemize,[status(esa)],[42])).
% cnf(44,plain,(pair_in_list(X1,X2,esk1_2(X1,X2))|~contains_slb(X1,X2)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X1]:![X2]:![X3]:![X4]:(((~(pair_in_list(X1,X2,X3))|~(strictly_less_than(X2,X4)))|~(strictly_less_than(X3,X4)))|pair_in_list(update_slb(X1,X4),X2,X4)),inference(fof_nnf,[status(thm)],[6])).
% fof(46, plain,![X5]:![X6]:![X7]:![X8]:(((~(pair_in_list(X5,X6,X7))|~(strictly_less_than(X6,X8)))|~(strictly_less_than(X7,X8)))|pair_in_list(update_slb(X5,X8),X6,X8)),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(pair_in_list(update_slb(X1,X2),X3,X2)|~strictly_less_than(X4,X2)|~strictly_less_than(X3,X2)|~pair_in_list(X1,X3,X4)),inference(split_conjunct,[status(thm)],[46])).
% fof(48, plain,![X1]:![X2]:![X3]:![X4]:(((~(pair_in_list(X1,X2,X3))|~(strictly_less_than(X2,X4)))|~(less_than(X4,X3)))|?[X5]:(pair_in_list(update_slb(X1,X4),X2,X5)&less_than(X4,X5))),inference(fof_nnf,[status(thm)],[7])).
% fof(49, plain,![X6]:![X7]:![X8]:![X9]:(((~(pair_in_list(X6,X7,X8))|~(strictly_less_than(X7,X9)))|~(less_than(X9,X8)))|?[X10]:(pair_in_list(update_slb(X6,X9),X7,X10)&less_than(X9,X10))),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,![X6]:![X7]:![X8]:![X9]:(((~(pair_in_list(X6,X7,X8))|~(strictly_less_than(X7,X9)))|~(less_than(X9,X8)))|(pair_in_list(update_slb(X6,X9),X7,esk2_4(X6,X7,X8,X9))&less_than(X9,esk2_4(X6,X7,X8,X9)))),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X6]:![X7]:![X8]:![X9]:((pair_in_list(update_slb(X6,X9),X7,esk2_4(X6,X7,X8,X9))|((~(pair_in_list(X6,X7,X8))|~(strictly_less_than(X7,X9)))|~(less_than(X9,X8))))&(less_than(X9,esk2_4(X6,X7,X8,X9))|((~(pair_in_list(X6,X7,X8))|~(strictly_less_than(X7,X9)))|~(less_than(X9,X8))))),inference(distribute,[status(thm)],[50])).
% cnf(52,plain,(less_than(X1,esk2_4(X4,X3,X2,X1))|~less_than(X1,X2)|~strictly_less_than(X3,X1)|~pair_in_list(X4,X3,X2)),inference(split_conjunct,[status(thm)],[51])).
% cnf(53,plain,(pair_in_list(update_slb(X4,X1),X3,esk2_4(X4,X3,X2,X1))|~less_than(X1,X2)|~strictly_less_than(X3,X1)|~pair_in_list(X4,X3,X2)),inference(split_conjunct,[status(thm)],[51])).
% fof(94, negated_conjecture,?[X1]:?[X2]:?[X3]:((contains_slb(X1,X2)&strictly_less_than(X2,X3))&(~(pair_in_list(update_slb(X1,X3),X2,X3))&![X4]:(~(pair_in_list(update_slb(X1,X3),X2,X4))|~(less_than(X3,X4))))),inference(fof_nnf,[status(thm)],[23])).
% fof(95, negated_conjecture,?[X5]:?[X6]:?[X7]:((contains_slb(X5,X6)&strictly_less_than(X6,X7))&(~(pair_in_list(update_slb(X5,X7),X6,X7))&![X8]:(~(pair_in_list(update_slb(X5,X7),X6,X8))|~(less_than(X7,X8))))),inference(variable_rename,[status(thm)],[94])).
% fof(96, negated_conjecture,((contains_slb(esk3_0,esk4_0)&strictly_less_than(esk4_0,esk5_0))&(~(pair_in_list(update_slb(esk3_0,esk5_0),esk4_0,esk5_0))&![X8]:(~(pair_in_list(update_slb(esk3_0,esk5_0),esk4_0,X8))|~(less_than(esk5_0,X8))))),inference(skolemize,[status(esa)],[95])).
% fof(97, negated_conjecture,![X8]:(((~(pair_in_list(update_slb(esk3_0,esk5_0),esk4_0,X8))|~(less_than(esk5_0,X8)))&~(pair_in_list(update_slb(esk3_0,esk5_0),esk4_0,esk5_0)))&(contains_slb(esk3_0,esk4_0)&strictly_less_than(esk4_0,esk5_0))),inference(shift_quantors,[status(thm)],[96])).
% cnf(98,negated_conjecture,(strictly_less_than(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[97])).
% cnf(99,negated_conjecture,(contains_slb(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[97])).
% cnf(100,negated_conjecture,(~pair_in_list(update_slb(esk3_0,esk5_0),esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[97])).
% cnf(101,negated_conjecture,(~less_than(esk5_0,X1)|~pair_in_list(update_slb(esk3_0,esk5_0),esk4_0,X1)),inference(split_conjunct,[status(thm)],[97])).
% cnf(102,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)),inference(csr,[status(thm)],[38,32])).
% cnf(122,plain,(pair_in_list(update_slb(X1,X2),X3,X2)|~strictly_less_than(esk1_2(X1,X3),X2)|~strictly_less_than(X3,X2)|~contains_slb(X1,X3)),inference(spm,[status(thm)],[47,44,theory(equality)])).
% cnf(130,negated_conjecture,(~less_than(esk5_0,esk2_4(esk3_0,esk4_0,X1,esk5_0))|~pair_in_list(esk3_0,esk4_0,X1)|~strictly_less_than(esk4_0,esk5_0)|~less_than(esk5_0,X1)),inference(spm,[status(thm)],[101,53,theory(equality)])).
% cnf(133,negated_conjecture,(~less_than(esk5_0,esk2_4(esk3_0,esk4_0,X1,esk5_0))|~pair_in_list(esk3_0,esk4_0,X1)|$false|~less_than(esk5_0,X1)),inference(rw,[status(thm)],[130,98,theory(equality)])).
% cnf(134,negated_conjecture,(~less_than(esk5_0,esk2_4(esk3_0,esk4_0,X1,esk5_0))|~pair_in_list(esk3_0,esk4_0,X1)|~less_than(esk5_0,X1)),inference(cn,[status(thm)],[133,theory(equality)])).
% cnf(163,negated_conjecture,(~pair_in_list(esk3_0,esk4_0,X1)|~less_than(esk5_0,X1)|~strictly_less_than(esk4_0,esk5_0)),inference(spm,[status(thm)],[134,52,theory(equality)])).
% cnf(164,negated_conjecture,(~pair_in_list(esk3_0,esk4_0,X1)|~less_than(esk5_0,X1)|$false),inference(rw,[status(thm)],[163,98,theory(equality)])).
% cnf(165,negated_conjecture,(~pair_in_list(esk3_0,esk4_0,X1)|~less_than(esk5_0,X1)),inference(cn,[status(thm)],[164,theory(equality)])).
% cnf(166,negated_conjecture,(~less_than(esk5_0,esk1_2(esk3_0,esk4_0))|~contains_slb(esk3_0,esk4_0)),inference(spm,[status(thm)],[165,44,theory(equality)])).
% cnf(167,negated_conjecture,(~less_than(esk5_0,esk1_2(esk3_0,esk4_0))|$false),inference(rw,[status(thm)],[166,99,theory(equality)])).
% cnf(168,negated_conjecture,(~less_than(esk5_0,esk1_2(esk3_0,esk4_0))),inference(cn,[status(thm)],[167,theory(equality)])).
% cnf(279,plain,(pair_in_list(update_slb(X1,X2),X3,X2)|less_than(X2,esk1_2(X1,X3))|~contains_slb(X1,X3)|~strictly_less_than(X3,X2)),inference(spm,[status(thm)],[122,102,theory(equality)])).
% cnf(2608,negated_conjecture,(pair_in_list(update_slb(esk3_0,X1),esk4_0,X1)|less_than(X1,esk1_2(esk3_0,esk4_0))|~strictly_less_than(esk4_0,X1)),inference(spm,[status(thm)],[279,99,theory(equality)])).
% cnf(2811,negated_conjecture,(pair_in_list(update_slb(esk3_0,esk5_0),esk4_0,esk5_0)|less_than(esk5_0,esk1_2(esk3_0,esk4_0))),inference(spm,[status(thm)],[2608,98,theory(equality)])).
% cnf(2812,negated_conjecture,(less_than(esk5_0,esk1_2(esk3_0,esk4_0))),inference(sr,[status(thm)],[2811,100,theory(equality)])).
% cnf(2813,negated_conjecture,($false),inference(sr,[status(thm)],[2812,168,theory(equality)])).
% cnf(2814,negated_conjecture,($false),2813,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 404
% # ...of these trivial : 0
% # ...subsumed : 229
% # ...remaining for further processing: 175
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 4
% # Generated clauses : 2137
% # ...of the previous two non-trivial : 1929
% # Contextual simplify-reflections : 271
% # Paramodulations : 2073
% # Factorizations : 54
% # Equation resolutions : 3
% # Current number of processed clauses: 128
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 109
% # Current number of unprocessed clauses: 754
% # ...number of literals in the above : 4069
% # Clause-clause subsumption calls (NU) : 8191
% # Rec. Clause-clause subsumption calls : 5728
% # Unit Clause-clause subsumption calls : 152
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 110 leaves, 2.68+/-4.020 terms/leaf
% # Paramod-from index: 38 leaves, 1.97+/-1.828 terms/leaf
% # Paramod-into index: 93 leaves, 2.26+/-2.556 terms/leaf
% # -------------------------------------------------
% # User time : 0.111 s
% # System time : 0.003 s
% # Total time : 0.114 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.32 WC
% FINAL PrfWatch: 0.24 CPU 0.32 WC
% SZS output end Solution for /tmp/SystemOnTPTP31741/SWV409+1.tptp
%
%------------------------------------------------------------------------------