TSTP Solution File: SWV402+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV402+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:55:21 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/SystemOnTPTP11742/SWV402+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11742/SWV402+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11742/SWV402+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 11838
% 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(1, axiom,![X1]:![X2]:~(pair_in_list(create_slb,X1,X2)),file('/tmp/SRASS.s.p', ax22)).
% fof(19, conjecture,![X1]:![X2]:![X3]:![X4]:((pair_in_list(create_slb,X2,X3)&strictly_less_than(X3,X4))=>pair_in_list(update_slb(create_slb,X4),X2,X4)),file('/tmp/SRASS.s.p', l38_co)).
% fof(20, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:((pair_in_list(create_slb,X2,X3)&strictly_less_than(X3,X4))=>pair_in_list(update_slb(create_slb,X4),X2,X4))),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X1]:![X2]:~(pair_in_list(create_slb,X1,X2)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(25, plain,![X3]:![X4]:~(pair_in_list(create_slb,X3,X4)),inference(variable_rename,[status(thm)],[21])).
% cnf(26,plain,(~pair_in_list(create_slb,X1,X2)),inference(split_conjunct,[status(thm)],[25])).
% fof(78, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((pair_in_list(create_slb,X2,X3)&strictly_less_than(X3,X4))&~(pair_in_list(update_slb(create_slb,X4),X2,X4))),inference(fof_nnf,[status(thm)],[20])).
% fof(79, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((pair_in_list(create_slb,X6,X7)&strictly_less_than(X7,X8))&~(pair_in_list(update_slb(create_slb,X8),X6,X8))),inference(variable_rename,[status(thm)],[78])).
% fof(80, negated_conjecture,((pair_in_list(create_slb,esk2_0,esk3_0)&strictly_less_than(esk3_0,esk4_0))&~(pair_in_list(update_slb(create_slb,esk4_0),esk2_0,esk4_0))),inference(skolemize,[status(esa)],[79])).
% cnf(83,negated_conjecture,(pair_in_list(create_slb,esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[80])).
% cnf(84,negated_conjecture,($false),inference(sr,[status(thm)],[83,26,theory(equality)])).
% cnf(85,negated_conjecture,($false),84,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 8
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 8
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 7
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 20
% # ...number of literals in the above : 44
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 12 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 11 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.005 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP11742/SWV402+1.tptp
%
%------------------------------------------------------------------------------