TSTP Solution File: SWV412+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV412+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 : art09.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:57:21 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP26804/SWV412+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP26804/SWV412+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26804/SWV412+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 26900
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, 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(20, conjecture,![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', l48_co)).
% fof(21, negated_conjecture,~(![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(assume_negation,[status(cth)],[20])).
% fof(26, 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)],[1])).
% fof(27, 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)],[26])).
% cnf(28,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)],[27])).
% fof(82, negated_conjecture,?[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)],[21])).
% fof(83, negated_conjecture,?[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)],[82])).
% fof(84, negated_conjecture,(((pair_in_list(esk1_0,esk2_0,esk3_0)&strictly_less_than(esk2_0,esk4_0))&strictly_less_than(esk3_0,esk4_0))&~(pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk4_0))),inference(skolemize,[status(esa)],[83])).
% cnf(85,negated_conjecture,(~pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk4_0)),inference(split_conjunct,[status(thm)],[84])).
% cnf(86,negated_conjecture,(strictly_less_than(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[84])).
% cnf(88,negated_conjecture,(pair_in_list(esk1_0,esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[84])).
% cnf(103,negated_conjecture,(pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)|~strictly_less_than(esk3_0,X1)),inference(spm,[status(thm)],[28,88,theory(equality)])).
% cnf(135,negated_conjecture,(~strictly_less_than(esk3_0,esk4_0)),inference(spm,[status(thm)],[85,103,theory(equality)])).
% cnf(136,negated_conjecture,($false),inference(rw,[status(thm)],[135,86,theory(equality)])).
% cnf(137,negated_conjecture,($false),inference(cn,[status(thm)],[136,theory(equality)])).
% cnf(138,negated_conjecture,($false),137,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 68
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 67
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 43
% # ...of the previous two non-trivial : 35
% # Contextual simplify-reflections : 1
% # Paramodulations : 39
% # Factorizations : 2
% # Equation resolutions : 3
% # Current number of processed clauses: 35
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 16
% # Current number of unprocessed clauses: 27
% # ...number of literals in the above : 76
% # Clause-clause subsumption calls (NU) : 14
% # Rec. Clause-clause subsumption calls : 14
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 42 leaves, 1.67+/-1.266 terms/leaf
% # Paramod-from index: 17 leaves, 1.35+/-0.588 terms/leaf
% # Paramod-into index: 35 leaves, 1.51+/-1.079 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.004 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP26804/SWV412+1.tptp
%
%------------------------------------------------------------------------------