TSTP Solution File: MSC019+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MSC019+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 : Wed Dec 29 16:13:01 EST 2010
% Result : Theorem 19.38s
% Output : Solution 19.38s
% 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/SystemOnTPTP6315/MSC019+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6315/MSC019+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6315/MSC019+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 6448
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.029 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:((s_contains(X1,X2)&s_contains(X2,X3))=>s_contains(X1,X3)),file('/tmp/SRASS.s.p', axiom1)).
% fof(4, axiom,s_contains(s_g013,s_MX),file('/tmp/SRASS.s.p', kb74)).
% fof(6, axiom,s_contains(s_g019,s_g013),file('/tmp/SRASS.s.p', kb18)).
% fof(604, conjecture,s_contains(s_g019,s_MX),file('/tmp/SRASS.s.p', mexico_in_america_1)).
% fof(605, negated_conjecture,~(s_contains(s_g019,s_MX)),inference(assume_negation,[status(cth)],[604])).
% fof(606, negated_conjecture,~(s_contains(s_g019,s_MX)),inference(fof_simplification,[status(thm)],[605,theory(equality)])).
% fof(607, plain,![X1]:![X2]:![X3]:((~(s_contains(X1,X2))|~(s_contains(X2,X3)))|s_contains(X1,X3)),inference(fof_nnf,[status(thm)],[1])).
% fof(608, plain,![X4]:![X5]:![X6]:((~(s_contains(X4,X5))|~(s_contains(X5,X6)))|s_contains(X4,X6)),inference(variable_rename,[status(thm)],[607])).
% cnf(609,plain,(s_contains(X1,X2)|~s_contains(X3,X2)|~s_contains(X1,X3)),inference(split_conjunct,[status(thm)],[608])).
% cnf(612,plain,(s_contains(s_g013,s_MX)),inference(split_conjunct,[status(thm)],[4])).
% cnf(614,plain,(s_contains(s_g019,s_g013)),inference(split_conjunct,[status(thm)],[6])).
% cnf(1216,negated_conjecture,(~s_contains(s_g019,s_MX)),inference(split_conjunct,[status(thm)],[606])).
% cnf(2070,plain,(s_contains(X1,s_MX)|~s_contains(X1,s_g013)),inference(spm,[status(thm)],[609,612,theory(equality)])).
% cnf(2118,negated_conjecture,(~s_contains(s_g019,s_g013)),inference(spm,[status(thm)],[1216,2070,theory(equality)])).
% cnf(2120,negated_conjecture,($false),inference(rw,[status(thm)],[2118,614,theory(equality)])).
% cnf(2121,negated_conjecture,($false),inference(cn,[status(thm)],[2120,theory(equality)])).
% cnf(2122,negated_conjecture,($false),2121,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1208
% # ...of these trivial : 2
% # ...subsumed : 0
% # ...remaining for further processing: 1206
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 602
% # ...of the previous two non-trivial : 300
% # Contextual simplify-reflections : 0
% # Paramodulations : 602
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 604
% # Positive orientable unit clauses: 598
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 5
% # Current number of unprocessed clauses: 298
% # ...number of literals in the above : 597
% # 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 : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 886 leaves, 1.00+/-0.106 terms/leaf
% # Paramod-from index: 601 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 883 leaves, 1.00+/-0.034 terms/leaf
% # -------------------------------------------------
% # User time : 0.064 s
% # System time : 0.008 s
% # Total time : 0.072 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.25 WC
% FINAL PrfWatch: 0.17 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP6315/MSC019+1.tptp
%
%------------------------------------------------------------------------------