TSTP Solution File: SYN365+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN365+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 : art01.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:25:50 EST 2010
% Result : Theorem 1.04s
% Output : Solution 1.04s
% 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/SystemOnTPTP5686/SYN365+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5686/SYN365+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5686/SYN365+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 5782
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,((![X1]:?[X2]:(big_p(X1)=>(big_r(X1,g(h(X2)))&big_p(X2)))&![X3]:(big_p(X3)=>(big_p(g(X3))&big_p(h(X3)))))=>![X1]:(big_p(X1)=>?[X2]:(big_r(X1,X2)&big_p(X2)))),file('/tmp/SRASS.s.p', x2116)).
% fof(2, negated_conjecture,~(((![X1]:?[X2]:(big_p(X1)=>(big_r(X1,g(h(X2)))&big_p(X2)))&![X3]:(big_p(X3)=>(big_p(g(X3))&big_p(h(X3)))))=>![X1]:(big_p(X1)=>?[X2]:(big_r(X1,X2)&big_p(X2))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,((![X1]:?[X2]:(~(big_p(X1))|(big_r(X1,g(h(X2)))&big_p(X2)))&![X3]:(~(big_p(X3))|(big_p(g(X3))&big_p(h(X3)))))&?[X1]:(big_p(X1)&![X2]:(~(big_r(X1,X2))|~(big_p(X2))))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,((![X4]:?[X5]:(~(big_p(X4))|(big_r(X4,g(h(X5)))&big_p(X5)))&![X6]:(~(big_p(X6))|(big_p(g(X6))&big_p(h(X6)))))&?[X7]:(big_p(X7)&![X8]:(~(big_r(X7,X8))|~(big_p(X8))))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,((![X4]:(~(big_p(X4))|(big_r(X4,g(h(esk1_1(X4))))&big_p(esk1_1(X4))))&![X6]:(~(big_p(X6))|(big_p(g(X6))&big_p(h(X6)))))&(big_p(esk2_0)&![X8]:(~(big_r(esk2_0,X8))|~(big_p(X8))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X4]:![X6]:![X8]:(((~(big_r(esk2_0,X8))|~(big_p(X8)))&big_p(esk2_0))&((~(big_p(X6))|(big_p(g(X6))&big_p(h(X6))))&(~(big_p(X4))|(big_r(X4,g(h(esk1_1(X4))))&big_p(esk1_1(X4)))))),inference(shift_quantors,[status(thm)],[5])).
% fof(7, negated_conjecture,![X4]:![X6]:![X8]:(((~(big_r(esk2_0,X8))|~(big_p(X8)))&big_p(esk2_0))&(((big_p(g(X6))|~(big_p(X6)))&(big_p(h(X6))|~(big_p(X6))))&((big_r(X4,g(h(esk1_1(X4))))|~(big_p(X4)))&(big_p(esk1_1(X4))|~(big_p(X4)))))),inference(distribute,[status(thm)],[6])).
% cnf(8,negated_conjecture,(big_p(esk1_1(X1))|~big_p(X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,negated_conjecture,(big_r(X1,g(h(esk1_1(X1))))|~big_p(X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(10,negated_conjecture,(big_p(h(X1))|~big_p(X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(11,negated_conjecture,(big_p(g(X1))|~big_p(X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(12,negated_conjecture,(big_p(esk2_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(13,negated_conjecture,(~big_p(X1)|~big_r(esk2_0,X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(14,negated_conjecture,(~big_p(g(h(esk1_1(esk2_0))))|~big_p(esk2_0)),inference(spm,[status(thm)],[13,9,theory(equality)])).
% cnf(15,negated_conjecture,(~big_p(g(h(esk1_1(esk2_0))))|$false),inference(rw,[status(thm)],[14,12,theory(equality)])).
% cnf(16,negated_conjecture,(~big_p(g(h(esk1_1(esk2_0))))),inference(cn,[status(thm)],[15,theory(equality)])).
% cnf(17,negated_conjecture,(~big_p(h(esk1_1(esk2_0)))),inference(spm,[status(thm)],[16,11,theory(equality)])).
% cnf(18,negated_conjecture,(~big_p(esk1_1(esk2_0))),inference(spm,[status(thm)],[17,10,theory(equality)])).
% cnf(19,negated_conjecture,(~big_p(esk2_0)),inference(spm,[status(thm)],[18,8,theory(equality)])).
% cnf(20,negated_conjecture,($false),inference(rw,[status(thm)],[19,12,theory(equality)])).
% cnf(21,negated_conjecture,($false),inference(cn,[status(thm)],[20,theory(equality)])).
% cnf(22,negated_conjecture,($false),21,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 15
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 15
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 4
% # ...of the previous two non-trivial : 3
% # Contextual simplify-reflections : 0
% # Paramodulations : 4
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 9
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 5
% # 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 : 3
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 19 leaves, 1.05+/-0.223 terms/leaf
% # Paramod-from index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 17 leaves, 1.06+/-0.235 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.004 s
% # Total time : 0.011 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/SystemOnTPTP5686/SYN365+1.tptp
%
%------------------------------------------------------------------------------