TSTP Solution File: SYN386+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN386+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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 09:27:56 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP25164/SYN386+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP25164/SYN386+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25164/SYN386+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 25260
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(((![X1]:?[X2]:big_f(X1,X2)&?[X1]:![X3]:?[X4]:![X5]:(big_s(X4,X5)=>big_d(X5,X1,X3)))&![X3]:?[X6]:![X7]:![X8]:(big_d(X7,X8,X6)=>![X2]:![X9]:((big_f(X7,X2)&big_f(X8,X9))=>big_d(X2,X9,X3))))=>?[X2]:![X3]:?[X10]:![X5]:(big_s(X10,X5)=>![X9]:(big_f(X5,X9)=>big_d(X9,X2,X3)))),file('/tmp/SRASS.s.p', x2138)).
% fof(2, negated_conjecture,~((((![X1]:?[X2]:big_f(X1,X2)&?[X1]:![X3]:?[X4]:![X5]:(big_s(X4,X5)=>big_d(X5,X1,X3)))&![X3]:?[X6]:![X7]:![X8]:(big_d(X7,X8,X6)=>![X2]:![X9]:((big_f(X7,X2)&big_f(X8,X9))=>big_d(X2,X9,X3))))=>?[X2]:![X3]:?[X10]:![X5]:(big_s(X10,X5)=>![X9]:(big_f(X5,X9)=>big_d(X9,X2,X3))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,(((![X1]:?[X2]:big_f(X1,X2)&?[X1]:![X3]:?[X4]:![X5]:(~(big_s(X4,X5))|big_d(X5,X1,X3)))&![X3]:?[X6]:![X7]:![X8]:(~(big_d(X7,X8,X6))|![X2]:![X9]:((~(big_f(X7,X2))|~(big_f(X8,X9)))|big_d(X2,X9,X3))))&![X2]:?[X3]:![X10]:?[X5]:(big_s(X10,X5)&?[X9]:(big_f(X5,X9)&~(big_d(X9,X2,X3))))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,(((![X11]:?[X12]:big_f(X11,X12)&?[X13]:![X14]:?[X15]:![X16]:(~(big_s(X15,X16))|big_d(X16,X13,X14)))&![X17]:?[X18]:![X19]:![X20]:(~(big_d(X19,X20,X18))|![X21]:![X22]:((~(big_f(X19,X21))|~(big_f(X20,X22)))|big_d(X21,X22,X17))))&![X23]:?[X24]:![X25]:?[X26]:(big_s(X25,X26)&?[X27]:(big_f(X26,X27)&~(big_d(X27,X23,X24))))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,(((![X11]:big_f(X11,esk1_1(X11))&![X14]:![X16]:(~(big_s(esk3_1(X14),X16))|big_d(X16,esk2_0,X14)))&![X17]:![X19]:![X20]:(~(big_d(X19,X20,esk4_1(X17)))|![X21]:![X22]:((~(big_f(X19,X21))|~(big_f(X20,X22)))|big_d(X21,X22,X17))))&![X23]:![X25]:(big_s(X25,esk6_2(X23,X25))&(big_f(esk6_2(X23,X25),esk7_2(X23,X25))&~(big_d(esk7_2(X23,X25),X23,esk5_1(X23)))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X11]:![X14]:![X16]:![X17]:![X19]:![X20]:![X21]:![X22]:![X23]:![X25]:((big_s(X25,esk6_2(X23,X25))&(big_f(esk6_2(X23,X25),esk7_2(X23,X25))&~(big_d(esk7_2(X23,X25),X23,esk5_1(X23)))))&((((~(big_f(X19,X21))|~(big_f(X20,X22)))|big_d(X21,X22,X17))|~(big_d(X19,X20,esk4_1(X17))))&((~(big_s(esk3_1(X14),X16))|big_d(X16,esk2_0,X14))&big_f(X11,esk1_1(X11))))),inference(shift_quantors,[status(thm)],[5])).
% cnf(7,negated_conjecture,(big_f(X1,esk1_1(X1))),inference(split_conjunct,[status(thm)],[6])).
% cnf(8,negated_conjecture,(big_d(X1,esk2_0,X2)|~big_s(esk3_1(X2),X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(9,negated_conjecture,(big_d(X4,X5,X3)|~big_d(X1,X2,esk4_1(X3))|~big_f(X2,X5)|~big_f(X1,X4)),inference(split_conjunct,[status(thm)],[6])).
% cnf(10,negated_conjecture,(~big_d(esk7_2(X1,X2),X1,esk5_1(X1))),inference(split_conjunct,[status(thm)],[6])).
% cnf(11,negated_conjecture,(big_f(esk6_2(X1,X2),esk7_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(12,negated_conjecture,(big_s(X1,esk6_2(X2,X1))),inference(split_conjunct,[status(thm)],[6])).
% cnf(13,negated_conjecture,(big_d(esk6_2(X1,esk3_1(X2)),esk2_0,X2)),inference(spm,[status(thm)],[8,12,theory(equality)])).
% cnf(14,negated_conjecture,(big_d(X1,X2,X3)|~big_f(esk2_0,X2)|~big_f(esk6_2(X4,esk3_1(esk4_1(X3))),X1)),inference(spm,[status(thm)],[9,13,theory(equality)])).
% cnf(15,negated_conjecture,(big_d(X1,esk1_1(esk2_0),X2)|~big_f(esk6_2(X3,esk3_1(esk4_1(X2))),X1)),inference(spm,[status(thm)],[14,7,theory(equality)])).
% cnf(17,negated_conjecture,(big_d(esk7_2(X1,esk3_1(esk4_1(X2))),esk1_1(esk2_0),X2)),inference(spm,[status(thm)],[15,11,theory(equality)])).
% cnf(19,negated_conjecture,($false),inference(spm,[status(thm)],[10,17,theory(equality)])).
% cnf(20,negated_conjecture,($false),19,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 10
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 10
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 7
% # ...of the previous two non-trivial : 6
% # Contextual simplify-reflections : 0
% # Paramodulations : 7
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 10
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 4
% # 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: 26 leaves, 1.27+/-0.444 terms/leaf
% # Paramod-from index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 22 leaves, 1.09+/-0.287 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.002 s
% # Total time : 0.010 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP25164/SYN386+1.tptp
%
%------------------------------------------------------------------------------