TSTP Solution File: SYN061+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN061+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 : 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 : Thu Dec 30 09:17:58 EST 2010
% Result : Theorem 0.86s
% Output : Solution 0.86s
% 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/SystemOnTPTP8127/SYN061+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP8127/SYN061+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8127/SYN061+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 8223
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,?[X1]:(big_i(X1)&big_f(X1)),file('/tmp/SRASS.s.p', pel31_2)).
% fof(2, axiom,![X1]:(~(big_h(X1))=>big_j(X1)),file('/tmp/SRASS.s.p', pel31_3)).
% fof(3, axiom,~(?[X1]:(big_f(X1)&(big_g(X1)|big_h(X1)))),file('/tmp/SRASS.s.p', pel31_1)).
% fof(4, conjecture,?[X1]:(big_i(X1)&big_j(X1)),file('/tmp/SRASS.s.p', pel31)).
% fof(5, negated_conjecture,~(?[X1]:(big_i(X1)&big_j(X1))),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X1]:(~(big_h(X1))=>big_j(X1)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(7, plain,?[X2]:(big_i(X2)&big_f(X2)),inference(variable_rename,[status(thm)],[1])).
% fof(8, plain,(big_i(esk1_0)&big_f(esk1_0)),inference(skolemize,[status(esa)],[7])).
% cnf(9,plain,(big_f(esk1_0)),inference(split_conjunct,[status(thm)],[8])).
% cnf(10,plain,(big_i(esk1_0)),inference(split_conjunct,[status(thm)],[8])).
% fof(11, plain,![X1]:(big_h(X1)|big_j(X1)),inference(fof_nnf,[status(thm)],[6])).
% fof(12, plain,![X2]:(big_h(X2)|big_j(X2)),inference(variable_rename,[status(thm)],[11])).
% cnf(13,plain,(big_j(X1)|big_h(X1)),inference(split_conjunct,[status(thm)],[12])).
% fof(14, plain,![X1]:(~(big_f(X1))|(~(big_g(X1))&~(big_h(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(15, plain,![X2]:(~(big_f(X2))|(~(big_g(X2))&~(big_h(X2)))),inference(variable_rename,[status(thm)],[14])).
% fof(16, plain,![X2]:((~(big_g(X2))|~(big_f(X2)))&(~(big_h(X2))|~(big_f(X2)))),inference(distribute,[status(thm)],[15])).
% cnf(17,plain,(~big_f(X1)|~big_h(X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(19, negated_conjecture,![X1]:(~(big_i(X1))|~(big_j(X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(20, negated_conjecture,![X2]:(~(big_i(X2))|~(big_j(X2))),inference(variable_rename,[status(thm)],[19])).
% cnf(21,negated_conjecture,(~big_j(X1)|~big_i(X1)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,negated_conjecture,(big_h(X1)|~big_i(X1)),inference(spm,[status(thm)],[21,13,theory(equality)])).
% cnf(23,negated_conjecture,(~big_f(X1)|~big_i(X1)),inference(spm,[status(thm)],[17,22,theory(equality)])).
% cnf(24,negated_conjecture,(~big_f(esk1_0)),inference(spm,[status(thm)],[23,10,theory(equality)])).
% cnf(25,negated_conjecture,($false),inference(rw,[status(thm)],[24,9,theory(equality)])).
% cnf(26,negated_conjecture,($false),inference(cn,[status(thm)],[25,theory(equality)])).
% cnf(27,negated_conjecture,($false),26,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 14
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 14
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 3
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 0
% # Paramodulations : 3
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 8
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 6
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # 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: 9 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 7 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.002 s
% # Total time : 0.011 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/SystemOnTPTP8127/SYN061+1.tptp
%
%------------------------------------------------------------------------------