TSTP Solution File: SYN065+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN065+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 : 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 09:18:23 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/SystemOnTPTP11356/SYN065+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP11356/SYN065+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11356/SYN065+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 11452
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:?[X2]:big_f(X1,X2),file('/tmp/SRASS.s.p', pel36_1)).
% fof(3, axiom,![X1]:![X2]:((big_f(X1,X2)|big_g(X1,X2))=>![X3]:((big_f(X2,X3)|big_g(X2,X3))=>big_h(X1,X3))),file('/tmp/SRASS.s.p', pel36_3)).
% fof(4, conjecture,![X1]:?[X2]:big_h(X1,X2),file('/tmp/SRASS.s.p', pel36)).
% fof(5, negated_conjecture,~(![X1]:?[X2]:big_h(X1,X2)),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X3]:?[X4]:big_f(X3,X4),inference(variable_rename,[status(thm)],[1])).
% fof(7, plain,![X3]:big_f(X3,esk1_1(X3)),inference(skolemize,[status(esa)],[6])).
% cnf(8,plain,(big_f(X1,esk1_1(X1))),inference(split_conjunct,[status(thm)],[7])).
% fof(12, plain,![X1]:![X2]:((~(big_f(X1,X2))&~(big_g(X1,X2)))|![X3]:((~(big_f(X2,X3))&~(big_g(X2,X3)))|big_h(X1,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(13, plain,![X4]:![X5]:((~(big_f(X4,X5))&~(big_g(X4,X5)))|![X6]:((~(big_f(X5,X6))&~(big_g(X5,X6)))|big_h(X4,X6))),inference(variable_rename,[status(thm)],[12])).
% fof(14, plain,![X4]:![X5]:![X6]:(((~(big_f(X5,X6))&~(big_g(X5,X6)))|big_h(X4,X6))|(~(big_f(X4,X5))&~(big_g(X4,X5)))),inference(shift_quantors,[status(thm)],[13])).
% fof(15, plain,![X4]:![X5]:![X6]:(((~(big_f(X4,X5))|(~(big_f(X5,X6))|big_h(X4,X6)))&(~(big_g(X4,X5))|(~(big_f(X5,X6))|big_h(X4,X6))))&((~(big_f(X4,X5))|(~(big_g(X5,X6))|big_h(X4,X6)))&(~(big_g(X4,X5))|(~(big_g(X5,X6))|big_h(X4,X6))))),inference(distribute,[status(thm)],[14])).
% cnf(19,plain,(big_h(X1,X2)|~big_f(X3,X2)|~big_f(X1,X3)),inference(split_conjunct,[status(thm)],[15])).
% fof(20, negated_conjecture,?[X1]:![X2]:~(big_h(X1,X2)),inference(fof_nnf,[status(thm)],[5])).
% fof(21, negated_conjecture,?[X3]:![X4]:~(big_h(X3,X4)),inference(variable_rename,[status(thm)],[20])).
% fof(22, negated_conjecture,![X4]:~(big_h(esk3_0,X4)),inference(skolemize,[status(esa)],[21])).
% cnf(23,negated_conjecture,(~big_h(esk3_0,X1)),inference(split_conjunct,[status(thm)],[22])).
% cnf(24,plain,(big_h(X1,esk1_1(X2))|~big_f(X1,X2)),inference(spm,[status(thm)],[19,8,theory(equality)])).
% cnf(28,plain,(big_h(X1,esk1_1(esk1_1(X1)))),inference(spm,[status(thm)],[24,8,theory(equality)])).
% cnf(29,negated_conjecture,($false),inference(spm,[status(thm)],[23,28,theory(equality)])).
% cnf(30,negated_conjecture,($false),29,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 16
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 16
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 6
% # ...of the previous two non-trivial : 5
% # Contextual simplify-reflections : 0
% # Paramodulations : 6
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 9
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 5
% # Current number of unprocessed clauses: 3
% # ...number of literals in the above : 6
% # Clause-clause subsumption calls (NU) : 4
% # Rec. Clause-clause subsumption calls : 4
% # 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: 13 leaves, 1.31+/-0.606 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 10 leaves, 1.20+/-0.400 terms/leaf
% # -------------------------------------------------
% # User time : 0.006 s
% # System time : 0.004 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/SystemOnTPTP11356/SYN065+1.tptp
%
%------------------------------------------------------------------------------