TSTP Solution File: SYN328+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN328+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:21:50 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP12392/SYN328+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP12392/SYN328+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12392/SYN328+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 12514
% 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, conjecture,?[X1]:![X2]:![X3]:(((big_f(X2)=>big_g(X2))<=>big_f(X1))=>(((big_f(X2)=>big_h(X2))<=>big_g(X1))=>((((big_f(X2)=>big_g(X2))=>big_h(X2))<=>big_h(X1))=>((big_f(X3)&big_g(X3))&big_h(X3))))),file('/tmp/SRASS.s.p', church_46_12_3)).
% fof(2, negated_conjecture,~(?[X1]:![X2]:![X3]:(((big_f(X2)=>big_g(X2))<=>big_f(X1))=>(((big_f(X2)=>big_h(X2))<=>big_g(X1))=>((((big_f(X2)=>big_g(X2))=>big_h(X2))<=>big_h(X1))=>((big_f(X3)&big_g(X3))&big_h(X3)))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,![X1]:?[X2]:?[X3]:((((big_f(X2)&~(big_g(X2)))|big_f(X1))&(~(big_f(X1))|(~(big_f(X2))|big_g(X2))))&((((big_f(X2)&~(big_h(X2)))|big_g(X1))&(~(big_g(X1))|(~(big_f(X2))|big_h(X2))))&(((((~(big_f(X2))|big_g(X2))&~(big_h(X2)))|big_h(X1))&(~(big_h(X1))|((big_f(X2)&~(big_g(X2)))|big_h(X2))))&((~(big_f(X3))|~(big_g(X3)))|~(big_h(X3)))))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,![X4]:?[X5]:?[X6]:((((big_f(X5)&~(big_g(X5)))|big_f(X4))&(~(big_f(X4))|(~(big_f(X5))|big_g(X5))))&((((big_f(X5)&~(big_h(X5)))|big_g(X4))&(~(big_g(X4))|(~(big_f(X5))|big_h(X5))))&(((((~(big_f(X5))|big_g(X5))&~(big_h(X5)))|big_h(X4))&(~(big_h(X4))|((big_f(X5)&~(big_g(X5)))|big_h(X5))))&((~(big_f(X6))|~(big_g(X6)))|~(big_h(X6)))))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,![X4]:((((big_f(esk1_1(X4))&~(big_g(esk1_1(X4))))|big_f(X4))&(~(big_f(X4))|(~(big_f(esk1_1(X4)))|big_g(esk1_1(X4)))))&((((big_f(esk1_1(X4))&~(big_h(esk1_1(X4))))|big_g(X4))&(~(big_g(X4))|(~(big_f(esk1_1(X4)))|big_h(esk1_1(X4)))))&(((((~(big_f(esk1_1(X4)))|big_g(esk1_1(X4)))&~(big_h(esk1_1(X4))))|big_h(X4))&(~(big_h(X4))|((big_f(esk1_1(X4))&~(big_g(esk1_1(X4))))|big_h(esk1_1(X4)))))&((~(big_f(esk2_1(X4)))|~(big_g(esk2_1(X4))))|~(big_h(esk2_1(X4))))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X4]:((((big_f(esk1_1(X4))|big_f(X4))&(~(big_g(esk1_1(X4)))|big_f(X4)))&(~(big_f(X4))|(~(big_f(esk1_1(X4)))|big_g(esk1_1(X4)))))&((((big_f(esk1_1(X4))|big_g(X4))&(~(big_h(esk1_1(X4)))|big_g(X4)))&(~(big_g(X4))|(~(big_f(esk1_1(X4)))|big_h(esk1_1(X4)))))&(((((~(big_f(esk1_1(X4)))|big_g(esk1_1(X4)))|big_h(X4))&(~(big_h(esk1_1(X4)))|big_h(X4)))&(((big_f(esk1_1(X4))|big_h(esk1_1(X4)))|~(big_h(X4)))&((~(big_g(esk1_1(X4)))|big_h(esk1_1(X4)))|~(big_h(X4)))))&((~(big_f(esk2_1(X4)))|~(big_g(esk2_1(X4))))|~(big_h(esk2_1(X4))))))),inference(distribute,[status(thm)],[5])).
% cnf(7,negated_conjecture,(~big_h(esk2_1(X1))|~big_g(esk2_1(X1))|~big_f(esk2_1(X1))),inference(split_conjunct,[status(thm)],[6])).
% cnf(10,negated_conjecture,(big_h(X1)|~big_h(esk1_1(X1))),inference(split_conjunct,[status(thm)],[6])).
% cnf(11,negated_conjecture,(big_h(X1)|big_g(esk1_1(X1))|~big_f(esk1_1(X1))),inference(split_conjunct,[status(thm)],[6])).
% cnf(12,negated_conjecture,(big_h(esk1_1(X1))|~big_f(esk1_1(X1))|~big_g(X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(13,negated_conjecture,(big_g(X1)|~big_h(esk1_1(X1))),inference(split_conjunct,[status(thm)],[6])).
% cnf(16,negated_conjecture,(big_f(X1)|~big_g(esk1_1(X1))),inference(split_conjunct,[status(thm)],[6])).
% cnf(17,negated_conjecture,(big_f(X1)|big_f(esk1_1(X1))),inference(split_conjunct,[status(thm)],[6])).
% cnf(19,negated_conjecture,(big_f(X1)|~big_h(esk1_1(esk1_1(X1)))),inference(spm,[status(thm)],[16,13,theory(equality)])).
% cnf(21,negated_conjecture,(big_f(X1)|big_h(X1)|~big_f(esk1_1(X1))),inference(spm,[status(thm)],[16,11,theory(equality)])).
% cnf(22,negated_conjecture,(big_h(esk1_1(esk1_1(X1)))|big_h(X1)|~big_f(esk1_1(esk1_1(X1)))|~big_f(esk1_1(X1))),inference(spm,[status(thm)],[12,11,theory(equality)])).
% cnf(32,negated_conjecture,(~big_h(esk2_1(X1))|~big_f(esk2_1(X1))|~big_h(esk1_1(esk2_1(X1)))),inference(spm,[status(thm)],[7,13,theory(equality)])).
% cnf(34,negated_conjecture,(big_h(X1)|big_f(X1)),inference(csr,[status(thm)],[21,17])).
% cnf(36,negated_conjecture,(big_h(X1)|big_f(esk1_1(X1))),inference(spm,[status(thm)],[10,34,theory(equality)])).
% cnf(37,negated_conjecture,(big_h(esk1_1(esk1_1(X1)))|big_h(X1)|~big_f(esk1_1(esk1_1(X1)))),inference(csr,[status(thm)],[22,36])).
% cnf(38,negated_conjecture,(big_h(esk1_1(esk1_1(X1)))|big_h(X1)),inference(csr,[status(thm)],[37,34])).
% cnf(39,negated_conjecture,(big_h(esk1_1(X1))|big_h(X1)),inference(spm,[status(thm)],[10,38,theory(equality)])).
% cnf(43,negated_conjecture,(~big_h(esk1_1(esk2_1(X1)))|~big_f(esk2_1(X1))),inference(csr,[status(thm)],[32,10])).
% cnf(46,negated_conjecture,(big_h(X1)),inference(csr,[status(thm)],[39,10])).
% cnf(61,negated_conjecture,(big_f(X1)|$false),inference(rw,[status(thm)],[19,46,theory(equality)])).
% cnf(62,negated_conjecture,(big_f(X1)),inference(cn,[status(thm)],[61,theory(equality)])).
% cnf(63,negated_conjecture,($false|~big_f(esk2_1(X1))),inference(rw,[status(thm)],[43,46,theory(equality)])).
% cnf(64,negated_conjecture,(~big_f(esk2_1(X1))),inference(cn,[status(thm)],[63,theory(equality)])).
% cnf(80,negated_conjecture,($false),inference(rw,[status(thm)],[64,62,theory(equality)])).
% cnf(81,negated_conjecture,($false),inference(cn,[status(thm)],[80,theory(equality)])).
% cnf(82,negated_conjecture,($false),81,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 35
% # ...of these trivial : 1
% # ...subsumed : 1
% # ...remaining for further processing: 33
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 16
% # Generated clauses : 21
% # ...of the previous two non-trivial : 20
% # Contextual simplify-reflections : 7
% # Paramodulations : 21
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 3
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 2
% # Clause-clause subsumption calls (NU) : 30
% # Rec. Clause-clause subsumption calls : 30
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 3 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.005 s
% # Total time : 0.012 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/SystemOnTPTP12392/SYN328+1.tptp
%
%------------------------------------------------------------------------------