TSTP Solution File: SWV408+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV408+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.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:46 EST 2010
% Result : Theorem 1.06s
% Output : Solution 1.06s
% 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/SystemOnTPTP27341/SWV408+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27341/SWV408+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27341/SWV408+2.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 27437
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 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(X3,X4))=>pair_in_list(update_slb(X1,X4),X2,X4)),file('/tmp/SRASS.s.p', l48_li3839)).
% fof(7, 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', l49_li3637)).
% fof(45, 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(46, 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)],[45])).
% fof(47, 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(59, plain,![X3]:![X4]:(less_than(X3,X4)|less_than(X4,X3)),inference(variable_rename,[status(thm)],[2])).
% cnf(60,plain,(less_than(X1,X2)|less_than(X2,X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(63, 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)],[47])).
% fof(64, 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)],[63])).
% fof(65, 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)],[64])).
% cnf(66,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[65])).
% fof(69, plain,![X1]:![X2]:(~(contains_slb(X1,X2))|?[X3]:pair_in_list(X1,X2,X3)),inference(fof_nnf,[status(thm)],[5])).
% fof(70, plain,![X4]:![X5]:(~(contains_slb(X4,X5))|?[X6]:pair_in_list(X4,X5,X6)),inference(variable_rename,[status(thm)],[69])).
% fof(71, plain,![X4]:![X5]:(~(contains_slb(X4,X5))|pair_in_list(X4,X5,esk1_2(X4,X5))),inference(skolemize,[status(esa)],[70])).
% cnf(72,plain,(pair_in_list(X1,X2,esk1_2(X1,X2))|~contains_slb(X1,X2)),inference(split_conjunct,[status(thm)],[71])).
% fof(73, 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)],[6])).
% fof(74, 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)],[73])).
% cnf(75,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)],[74])).
% fof(76, 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)],[7])).
% fof(77, 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)],[76])).
% cnf(78,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)],[77])).
% fof(183, 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)],[46])).
% fof(184, 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)],[183])).
% fof(185, 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)],[184])).
% fof(186, 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)],[185])).
% cnf(188,negated_conjecture,(contains_slb(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[186])).
% cnf(189,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)],[186])).
% cnf(190,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)],[186])).
% cnf(192,plain,(strictly_less_than(X1,X2)|less_than(X2,X1)),inference(csr,[status(thm)],[66,60])).
% cnf(223,negated_conjecture,(~less_than(findmin_pqp_res(esk2_0),X1)|~pair_in_list(esk3_0,esk5_0,X1)),inference(spm,[status(thm)],[190,78,theory(equality)])).
% cnf(231,plain,(pair_in_list(update_slb(X1,X2),X3,X2)|~strictly_less_than(esk1_2(X1,X3),X2)|~contains_slb(X1,X3)),inference(spm,[status(thm)],[75,72,theory(equality)])).
% cnf(839,plain,(pair_in_list(update_slb(X1,X2),X3,X2)|less_than(X2,esk1_2(X1,X3))|~contains_slb(X1,X3)),inference(spm,[status(thm)],[231,192,theory(equality)])).
% cnf(1730,negated_conjecture,(pair_in_list(update_slb(esk3_0,X1),esk5_0,X1)|less_than(X1,esk1_2(esk3_0,esk5_0))),inference(spm,[status(thm)],[839,188,theory(equality)])).
% cnf(1879,negated_conjecture,(pair_in_list(update_slb(esk3_0,findmin_pqp_res(esk2_0)),esk5_0,findmin_pqp_res(esk2_0))|~pair_in_list(esk3_0,esk5_0,esk1_2(esk3_0,esk5_0))),inference(spm,[status(thm)],[223,1730,theory(equality)])).
% cnf(1892,negated_conjecture,(~pair_in_list(esk3_0,esk5_0,esk1_2(esk3_0,esk5_0))),inference(sr,[status(thm)],[1879,189,theory(equality)])).
% cnf(1930,negated_conjecture,(~contains_slb(esk3_0,esk5_0)),inference(spm,[status(thm)],[1892,72,theory(equality)])).
% cnf(1931,negated_conjecture,($false),inference(rw,[status(thm)],[1930,188,theory(equality)])).
% cnf(1932,negated_conjecture,($false),inference(cn,[status(thm)],[1931,theory(equality)])).
% cnf(1933,negated_conjecture,($false),1932,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 404
% # ...of these trivial : 2
% # ...subsumed : 183
% # ...remaining for further processing: 219
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1358
% # ...of the previous two non-trivial : 1114
% # Contextual simplify-reflections : 85
% # Paramodulations : 1274
% # Factorizations : 82
% # Equation resolutions : 3
% # Current number of processed clauses: 162
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 13
% # Non-unit-clauses : 129
% # Current number of unprocessed clauses: 820
% # ...number of literals in the above : 3952
% # Clause-clause subsumption calls (NU) : 4294
% # Rec. Clause-clause subsumption calls : 3328
% # Unit Clause-clause subsumption calls : 33
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 160 leaves, 1.89+/-1.851 terms/leaf
% # Paramod-from index: 72 leaves, 1.29+/-1.111 terms/leaf
% # Paramod-into index: 142 leaves, 1.65+/-1.548 terms/leaf
% # -------------------------------------------------
% # User time : 0.093 s
% # System time : 0.005 s
% # Total time : 0.098 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.29 WC
% FINAL PrfWatch: 0.20 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP27341/SWV408+2.tptp
%
%------------------------------------------------------------------------------