TSTP Solution File: SYN060+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN060+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 09:22:39 EST 2010
% Result : Theorem 1.09s
% Output : Solution 1.09s
% 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/SystemOnTPTP24900/SYN060+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24900/SYN060+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24900/SYN060+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 25032
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:((big_g(X1)=>~(big_i(X1)))=>(big_f(X1)&big_h(X1))),file('/tmp/SRASS.s.p', pel30_2)).
% fof(2, axiom,![X1]:((big_f(X1)|big_g(X1))=>~(big_h(X1))),file('/tmp/SRASS.s.p', pel30_1)).
% fof(3, conjecture,![X1]:big_i(X1),file('/tmp/SRASS.s.p', pel30)).
% fof(4, negated_conjecture,~(![X1]:big_i(X1)),inference(assume_negation,[status(cth)],[3])).
% fof(5, plain,![X1]:((big_g(X1)=>~(big_i(X1)))=>(big_f(X1)&big_h(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(6, plain,![X1]:((big_f(X1)|big_g(X1))=>~(big_h(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(7, plain,![X1]:((big_g(X1)&big_i(X1))|(big_f(X1)&big_h(X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(8, plain,![X2]:((big_g(X2)&big_i(X2))|(big_f(X2)&big_h(X2))),inference(variable_rename,[status(thm)],[7])).
% fof(9, plain,![X2]:(((big_f(X2)|big_g(X2))&(big_h(X2)|big_g(X2)))&((big_f(X2)|big_i(X2))&(big_h(X2)|big_i(X2)))),inference(distribute,[status(thm)],[8])).
% cnf(10,plain,(big_i(X1)|big_h(X1)),inference(split_conjunct,[status(thm)],[9])).
% cnf(11,plain,(big_i(X1)|big_f(X1)),inference(split_conjunct,[status(thm)],[9])).
% fof(14, plain,![X1]:((~(big_f(X1))&~(big_g(X1)))|~(big_h(X1))),inference(fof_nnf,[status(thm)],[6])).
% fof(15, plain,![X2]:((~(big_f(X2))&~(big_g(X2)))|~(big_h(X2))),inference(variable_rename,[status(thm)],[14])).
% fof(16, plain,![X2]:((~(big_f(X2))|~(big_h(X2)))&(~(big_g(X2))|~(big_h(X2)))),inference(distribute,[status(thm)],[15])).
% cnf(18,plain,(~big_h(X1)|~big_f(X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(19, negated_conjecture,?[X1]:~(big_i(X1)),inference(fof_nnf,[status(thm)],[4])).
% fof(20, negated_conjecture,?[X2]:~(big_i(X2)),inference(variable_rename,[status(thm)],[19])).
% fof(21, negated_conjecture,~(big_i(esk1_0)),inference(skolemize,[status(esa)],[20])).
% cnf(22,negated_conjecture,(~big_i(esk1_0)),inference(split_conjunct,[status(thm)],[21])).
% cnf(23,negated_conjecture,(big_f(esk1_0)),inference(spm,[status(thm)],[22,11,theory(equality)])).
% cnf(24,negated_conjecture,(big_h(esk1_0)),inference(spm,[status(thm)],[22,10,theory(equality)])).
% cnf(27,negated_conjecture,(~big_h(esk1_0)),inference(spm,[status(thm)],[18,23,theory(equality)])).
% cnf(28,negated_conjecture,($false),inference(rw,[status(thm)],[27,24,theory(equality)])).
% cnf(29,negated_conjecture,($false),inference(cn,[status(thm)],[28,theory(equality)])).
% cnf(30,negated_conjecture,($false),29,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 17
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 17
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 5
% # ...of the previous two non-trivial : 4
% # Contextual simplify-reflections : 0
% # Paramodulations : 5
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 9
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 6
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 2
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 4
% # 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.008 s
% # System time : 0.002 s
% # Total time : 0.010 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP24900/SYN060+1.tptp
%
%------------------------------------------------------------------------------