TSTP Solution File: SWV408+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV408+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:56:28 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP12263/SWV408+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12263/SWV408+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12263/SWV408+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 12359
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% 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]:![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', l44_l45)).
% fof(6, axiom,![X1]:![X2]:![X3]:![X4]:(~(X2=create_slb)=>findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)),file('/tmp/SRASS.s.p', ax51)).
% fof(15, axiom,![X1]:less_than(bottom,X1),file('/tmp/SRASS.s.p', bottom_smallest)).
% fof(20, axiom,![X1]:![X2]:findmin_cpq_res(triple(X1,create_slb,X2))=bottom,file('/tmp/SRASS.s.p', ax50)).
% fof(43, conjecture,![X1]:![X2]:![X3]:![X4]:((contains_slb(X2,X4)&strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))))=>(pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1))|?[X5]:(pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5)&less_than(findmin_pqp_res(X1),X5)))),file('/tmp/SRASS.s.p', l44_co)).
% fof(44, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:((contains_slb(X2,X4)&strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))))=>(pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1))|?[X5]:(pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5)&less_than(findmin_pqp_res(X1),X5))))),inference(assume_negation,[status(cth)],[43])).
% fof(45, 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(61, 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)],[45])).
% fof(62, 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)],[61])).
% fof(63, 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)],[62])).
% cnf(65,plain,(~strictly_less_than(X1,X2)|~less_than(X2,X1)),inference(split_conjunct,[status(thm)],[63])).
% fof(67, plain,![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)],[5])).
% fof(68, plain,![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)],[67])).
% fof(69, plain,![X5]:![X6]:![X7]:((~(contains_slb(X5,X6))|~(strictly_less_than(X6,X7)))|(pair_in_list(update_slb(X5,X7),X6,X7)|(pair_in_list(update_slb(X5,X7),X6,esk1_3(X5,X6,X7))&less_than(X7,esk1_3(X5,X6,X7))))),inference(skolemize,[status(esa)],[68])).
% fof(70, plain,![X5]:![X6]:![X7]:(((pair_in_list(update_slb(X5,X7),X6,esk1_3(X5,X6,X7))|pair_in_list(update_slb(X5,X7),X6,X7))|(~(contains_slb(X5,X6))|~(strictly_less_than(X6,X7))))&((less_than(X7,esk1_3(X5,X6,X7))|pair_in_list(update_slb(X5,X7),X6,X7))|(~(contains_slb(X5,X6))|~(strictly_less_than(X6,X7))))),inference(distribute,[status(thm)],[69])).
% cnf(71,plain,(pair_in_list(update_slb(X3,X2),X1,X2)|less_than(X2,esk1_3(X3,X1,X2))|~strictly_less_than(X1,X2)|~contains_slb(X3,X1)),inference(split_conjunct,[status(thm)],[70])).
% cnf(72,plain,(pair_in_list(update_slb(X3,X2),X1,X2)|pair_in_list(update_slb(X3,X2),X1,esk1_3(X3,X1,X2))|~strictly_less_than(X1,X2)|~contains_slb(X3,X1)),inference(split_conjunct,[status(thm)],[70])).
% fof(73, plain,![X1]:![X2]:![X3]:![X4]:(X2=create_slb|findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)),inference(fof_nnf,[status(thm)],[6])).
% fof(74, plain,![X5]:![X6]:![X7]:![X8]:(X6=create_slb|findmin_cpq_res(triple(X5,X6,X7))=findmin_pqp_res(X5)),inference(variable_rename,[status(thm)],[73])).
% cnf(75,plain,(findmin_cpq_res(triple(X1,X2,X3))=findmin_pqp_res(X1)|X2=create_slb),inference(split_conjunct,[status(thm)],[74])).
% fof(99, plain,![X2]:less_than(bottom,X2),inference(variable_rename,[status(thm)],[15])).
% cnf(100,plain,(less_than(bottom,X1)),inference(split_conjunct,[status(thm)],[99])).
% fof(113, plain,![X3]:![X4]:findmin_cpq_res(triple(X3,create_slb,X4))=bottom,inference(variable_rename,[status(thm)],[20])).
% cnf(114,plain,(findmin_cpq_res(triple(X1,create_slb,X2))=bottom),inference(split_conjunct,[status(thm)],[113])).
% fof(177, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((contains_slb(X2,X4)&strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))))&(~(pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1)))&![X5]:(~(pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5))|~(less_than(findmin_pqp_res(X1),X5))))),inference(fof_nnf,[status(thm)],[44])).
% fof(178, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:((contains_slb(X7,X9)&strictly_less_than(X9,findmin_cpq_res(triple(X6,X7,X8))))&(~(pair_in_list(update_slb(X7,findmin_pqp_res(X6)),X9,findmin_pqp_res(X6)))&![X10]:(~(pair_in_list(update_slb(X7,findmin_pqp_res(X6)),X9,X10))|~(less_than(findmin_pqp_res(X6),X10))))),inference(variable_rename,[status(thm)],[177])).
% fof(179, negated_conjecture,((contains_slb(esk3_0,esk5_0)&strictly_less_than(esk5_0,findmin_cpq_res(triple(esk2_0,esk3_0,esk4_0))))&(~(pair_in_list(update_slb(esk3_0,findmin_pqp_res(esk2_0)),esk5_0,findmin_pqp_res(esk2_0)))&![X10]:(~(pair_in_list(update_slb(esk3_0,findmin_pqp_res(esk2_0)),esk5_0,X10))|~(less_than(findmin_pqp_res(esk2_0),X10))))),inference(skolemize,[status(esa)],[178])).
% fof(180, negated_conjecture,![X10]:(((~(pair_in_list(update_slb(esk3_0,findmin_pqp_res(esk2_0)),esk5_0,X10))|~(less_than(findmin_pqp_res(esk2_0),X10)))&~(pair_in_list(update_slb(esk3_0,findmin_pqp_res(esk2_0)),esk5_0,findmin_pqp_res(esk2_0))))&(contains_slb(esk3_0,esk5_0)&strictly_less_than(esk5_0,findmin_cpq_res(triple(esk2_0,esk3_0,esk4_0))))),inference(shift_quantors,[status(thm)],[179])).
% cnf(181,negated_conjecture,(strictly_less_than(esk5_0,findmin_cpq_res(triple(esk2_0,esk3_0,esk4_0)))),inference(split_conjunct,[status(thm)],[180])).
% cnf(182,negated_conjecture,(contains_slb(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[180])).
% cnf(183,negated_conjecture,(~pair_in_list(update_slb(esk3_0,findmin_pqp_res(esk2_0)),esk5_0,findmin_pqp_res(esk2_0))),inference(split_conjunct,[status(thm)],[180])).
% cnf(184,negated_conjecture,(~less_than(findmin_pqp_res(esk2_0),X1)|~pair_in_list(update_slb(esk3_0,findmin_pqp_res(esk2_0)),esk5_0,X1)),inference(split_conjunct,[status(thm)],[180])).
% cnf(192,negated_conjecture,(~less_than(findmin_cpq_res(triple(esk2_0,esk3_0,esk4_0)),esk5_0)),inference(spm,[status(thm)],[65,181,theory(equality)])).
% cnf(199,negated_conjecture,(strictly_less_than(esk5_0,findmin_pqp_res(esk2_0))|create_slb=esk3_0),inference(spm,[status(thm)],[181,75,theory(equality)])).
% cnf(242,negated_conjecture,(pair_in_list(update_slb(esk3_0,findmin_pqp_res(esk2_0)),esk5_0,findmin_pqp_res(esk2_0))|~less_than(findmin_pqp_res(esk2_0),esk1_3(esk3_0,esk5_0,findmin_pqp_res(esk2_0)))|~contains_slb(esk3_0,esk5_0)|~strictly_less_than(esk5_0,findmin_pqp_res(esk2_0))),inference(spm,[status(thm)],[184,72,theory(equality)])).
% cnf(245,negated_conjecture,(pair_in_list(update_slb(esk3_0,findmin_pqp_res(esk2_0)),esk5_0,findmin_pqp_res(esk2_0))|~less_than(findmin_pqp_res(esk2_0),esk1_3(esk3_0,esk5_0,findmin_pqp_res(esk2_0)))|$false|~strictly_less_than(esk5_0,findmin_pqp_res(esk2_0))),inference(rw,[status(thm)],[242,182,theory(equality)])).
% cnf(246,negated_conjecture,(pair_in_list(update_slb(esk3_0,findmin_pqp_res(esk2_0)),esk5_0,findmin_pqp_res(esk2_0))|~less_than(findmin_pqp_res(esk2_0),esk1_3(esk3_0,esk5_0,findmin_pqp_res(esk2_0)))|~strictly_less_than(esk5_0,findmin_pqp_res(esk2_0))),inference(cn,[status(thm)],[245,theory(equality)])).
% cnf(247,negated_conjecture,(~less_than(findmin_pqp_res(esk2_0),esk1_3(esk3_0,esk5_0,findmin_pqp_res(esk2_0)))|~strictly_less_than(esk5_0,findmin_pqp_res(esk2_0))),inference(sr,[status(thm)],[246,183,theory(equality)])).
% cnf(343,negated_conjecture,(pair_in_list(update_slb(esk3_0,findmin_pqp_res(esk2_0)),esk5_0,findmin_pqp_res(esk2_0))|~strictly_less_than(esk5_0,findmin_pqp_res(esk2_0))|~contains_slb(esk3_0,esk5_0)),inference(spm,[status(thm)],[247,71,theory(equality)])).
% cnf(344,negated_conjecture,(pair_in_list(update_slb(esk3_0,findmin_pqp_res(esk2_0)),esk5_0,findmin_pqp_res(esk2_0))|~strictly_less_than(esk5_0,findmin_pqp_res(esk2_0))|$false),inference(rw,[status(thm)],[343,182,theory(equality)])).
% cnf(345,negated_conjecture,(pair_in_list(update_slb(esk3_0,findmin_pqp_res(esk2_0)),esk5_0,findmin_pqp_res(esk2_0))|~strictly_less_than(esk5_0,findmin_pqp_res(esk2_0))),inference(cn,[status(thm)],[344,theory(equality)])).
% cnf(346,negated_conjecture,(~strictly_less_than(esk5_0,findmin_pqp_res(esk2_0))),inference(sr,[status(thm)],[345,183,theory(equality)])).
% cnf(348,negated_conjecture,(esk3_0=create_slb),inference(sr,[status(thm)],[199,346,theory(equality)])).
% cnf(352,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[192,348,theory(equality)]),114,theory(equality)]),100,theory(equality)])).
% cnf(353,negated_conjecture,($false),inference(cn,[status(thm)],[352,theory(equality)])).
% cnf(354,negated_conjecture,($false),353,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 129
% # ...of these trivial : 2
% # ...subsumed : 6
% # ...remaining for further processing: 121
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 9
% # Generated clauses : 128
% # ...of the previous two non-trivial : 114
% # Contextual simplify-reflections : 2
% # Paramodulations : 123
% # Factorizations : 2
% # Equation resolutions : 3
% # Current number of processed clauses: 55
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 35
% # Current number of unprocessed clauses: 89
% # ...number of literals in the above : 291
% # Clause-clause subsumption calls (NU) : 51
% # Rec. Clause-clause subsumption calls : 51
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 75 leaves, 1.72+/-1.419 terms/leaf
% # Paramod-from index: 31 leaves, 1.26+/-0.506 terms/leaf
% # Paramod-into index: 66 leaves, 1.48+/-1.184 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.006 s
% # Total time : 0.029 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.20 WC
% FINAL PrfWatch: 0.14 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP12263/SWV408+1.tptp
%
%------------------------------------------------------------------------------