TSTP Solution File: SYN319+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN319+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:21:09 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/SystemOnTPTP3357/SYN319+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3357/SYN319+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3357/SYN319+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 3453
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,?[X1]:?[X2]:![X3]:![X4]:(((big_f(X2)=>big_g(X3))=>(big_g(X1)&~(big_f(X3))))=>(((big_f(X1)|big_g(X1))=>big_h(X1))=>(big_h(X4)&(big_h(X2)=>((big_f(X4)|big_g(X4))=>big_h(X4)))))),file('/tmp/SRASS.s.p', church_46_2_5)).
% fof(2, negated_conjecture,~(?[X1]:?[X2]:![X3]:![X4]:(((big_f(X2)=>big_g(X3))=>(big_g(X1)&~(big_f(X3))))=>(((big_f(X1)|big_g(X1))=>big_h(X1))=>(big_h(X4)&(big_h(X2)=>((big_f(X4)|big_g(X4))=>big_h(X4))))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,~(?[X1]:?[X2]:![X3]:![X4]:(((big_f(X2)=>big_g(X3))=>(big_g(X1)&~(big_f(X3))))=>(((big_f(X1)|big_g(X1))=>big_h(X1))=>(big_h(X4)&(big_h(X2)=>((big_f(X4)|big_g(X4))=>big_h(X4))))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(4, negated_conjecture,![X1]:![X2]:?[X3]:?[X4]:(((big_f(X2)&~(big_g(X3)))|(big_g(X1)&~(big_f(X3))))&(((~(big_f(X1))&~(big_g(X1)))|big_h(X1))&(~(big_h(X4))|(big_h(X2)&((big_f(X4)|big_g(X4))&~(big_h(X4))))))),inference(fof_nnf,[status(thm)],[3])).
% fof(5, negated_conjecture,![X5]:![X6]:?[X7]:?[X8]:(((big_f(X6)&~(big_g(X7)))|(big_g(X5)&~(big_f(X7))))&(((~(big_f(X5))&~(big_g(X5)))|big_h(X5))&(~(big_h(X8))|(big_h(X6)&((big_f(X8)|big_g(X8))&~(big_h(X8))))))),inference(variable_rename,[status(thm)],[4])).
% fof(6, negated_conjecture,![X5]:![X6]:(((big_f(X6)&~(big_g(esk1_2(X5,X6))))|(big_g(X5)&~(big_f(esk1_2(X5,X6)))))&(((~(big_f(X5))&~(big_g(X5)))|big_h(X5))&(~(big_h(esk2_2(X5,X6)))|(big_h(X6)&((big_f(esk2_2(X5,X6))|big_g(esk2_2(X5,X6)))&~(big_h(esk2_2(X5,X6)))))))),inference(skolemize,[status(esa)],[5])).
% fof(7, negated_conjecture,![X5]:![X6]:((((big_g(X5)|big_f(X6))&(~(big_f(esk1_2(X5,X6)))|big_f(X6)))&((big_g(X5)|~(big_g(esk1_2(X5,X6))))&(~(big_f(esk1_2(X5,X6)))|~(big_g(esk1_2(X5,X6))))))&(((~(big_f(X5))|big_h(X5))&(~(big_g(X5))|big_h(X5)))&((big_h(X6)|~(big_h(esk2_2(X5,X6))))&(((big_f(esk2_2(X5,X6))|big_g(esk2_2(X5,X6)))|~(big_h(esk2_2(X5,X6))))&(~(big_h(esk2_2(X5,X6)))|~(big_h(esk2_2(X5,X6)))))))),inference(distribute,[status(thm)],[6])).
% cnf(8,negated_conjecture,(~big_h(esk2_2(X1,X2))|~big_h(esk2_2(X1,X2))),inference(split_conjunct,[status(thm)],[7])).
% cnf(11,negated_conjecture,(big_h(X1)|~big_g(X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(12,negated_conjecture,(big_h(X1)|~big_f(X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(16,negated_conjecture,(big_f(X1)|big_g(X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(18,negated_conjecture,(~big_g(esk2_2(X1,X2))),inference(spm,[status(thm)],[8,11,theory(equality)])).
% cnf(23,negated_conjecture,(big_f(X3)),inference(spm,[status(thm)],[18,16,theory(equality)])).
% cnf(27,negated_conjecture,(big_h(X1)|$false),inference(rw,[status(thm)],[12,23,theory(equality)])).
% cnf(28,negated_conjecture,(big_h(X1)),inference(cn,[status(thm)],[27,theory(equality)])).
% cnf(34,negated_conjecture,($false),inference(rw,[status(thm)],[8,28,theory(equality)])).
% cnf(35,negated_conjecture,($false),inference(cn,[status(thm)],[34,theory(equality)])).
% cnf(36,negated_conjecture,($false),35,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 20
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 18
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 4
% # Generated clauses : 9
% # ...of the previous two non-trivial : 11
% # Contextual simplify-reflections : 1
% # Paramodulations : 9
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 4
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 1
% # Clause-clause subsumption calls (NU) : 3
% # Rec. Clause-clause subsumption calls : 3
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 8 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 6 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.003 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP3357/SYN319+1.tptp
%
%------------------------------------------------------------------------------