%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN069+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 : art03.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:18:51 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP28740/SYN069+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP28740/SYN069+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28740/SYN069+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 28836
% 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_f(X1)&![X2]:((big_g(X2)&big_h(X1,X2))=>big_j(X1,X2)))=>![X3]:((big_g(X3)&big_h(X1,X3))&big_k(X3))),file('/tmp/SRASS.s.p', pel45_1)).
% fof(2, axiom,?[X1]:((big_f(X1)&![X2]:(big_h(X1,X2)=>big_l(X2)))&![X3]:((big_g(X3)&big_h(X1,X3))=>big_j(X1,X3))),file('/tmp/SRASS.s.p', pel45_3)).
% fof(3, axiom,~(?[X2]:(big_l(X2)&big_k(X2))),file('/tmp/SRASS.s.p', pel45_2)).
% fof(4, conjecture,?[X1]:(big_f(X1)&~(?[X2]:(big_g(X2)&big_h(X1,X2)))),file('/tmp/SRASS.s.p', pel45)).
% fof(5, negated_conjecture,~(?[X1]:(big_f(X1)&~(?[X2]:(big_g(X2)&big_h(X1,X2))))),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X1]:((~(big_f(X1))|?[X2]:((big_g(X2)&big_h(X1,X2))&~(big_j(X1,X2))))|![X3]:((big_g(X3)&big_h(X1,X3))&big_k(X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(7, plain,![X4]:((~(big_f(X4))|?[X5]:((big_g(X5)&big_h(X4,X5))&~(big_j(X4,X5))))|![X6]:((big_g(X6)&big_h(X4,X6))&big_k(X6))),inference(variable_rename,[status(thm)],[6])).
% fof(8, plain,![X4]:((~(big_f(X4))|((big_g(esk1_1(X4))&big_h(X4,esk1_1(X4)))&~(big_j(X4,esk1_1(X4)))))|![X6]:((big_g(X6)&big_h(X4,X6))&big_k(X6))),inference(skolemize,[status(esa)],[7])).
% fof(9, plain,![X4]:![X6]:(((big_g(X6)&big_h(X4,X6))&big_k(X6))|(~(big_f(X4))|((big_g(esk1_1(X4))&big_h(X4,esk1_1(X4)))&~(big_j(X4,esk1_1(X4)))))),inference(shift_quantors,[status(thm)],[8])).
% fof(10, plain,![X4]:![X6]:((((((big_g(esk1_1(X4))|~(big_f(X4)))|big_g(X6))&((big_h(X4,esk1_1(X4))|~(big_f(X4)))|big_g(X6)))&((~(big_j(X4,esk1_1(X4)))|~(big_f(X4)))|big_g(X6)))&((((big_g(esk1_1(X4))|~(big_f(X4)))|big_h(X4,X6))&((big_h(X4,esk1_1(X4))|~(big_f(X4)))|big_h(X4,X6)))&((~(big_j(X4,esk1_1(X4)))|~(big_f(X4)))|big_h(X4,X6))))&((((big_g(esk1_1(X4))|~(big_f(X4)))|big_k(X6))&((big_h(X4,esk1_1(X4))|~(big_f(X4)))|big_k(X6)))&((~(big_j(X4,esk1_1(X4)))|~(big_f(X4)))|big_k(X6)))),inference(distribute,[status(thm)],[9])).
% cnf(11,plain,(big_k(X1)|~big_f(X2)|~big_j(X2,esk1_1(X2))),inference(split_conjunct,[status(thm)],[10])).
% cnf(12,plain,(big_k(X1)|big_h(X2,esk1_1(X2))|~big_f(X2)),inference(split_conjunct,[status(thm)],[10])).
% cnf(14,plain,(big_h(X1,X2)|~big_f(X1)|~big_j(X1,esk1_1(X1))),inference(split_conjunct,[status(thm)],[10])).
% cnf(17,plain,(big_g(X1)|~big_f(X2)|~big_j(X2,esk1_1(X2))),inference(split_conjunct,[status(thm)],[10])).
% cnf(19,plain,(big_g(X1)|big_g(esk1_1(X2))|~big_f(X2)),inference(split_conjunct,[status(thm)],[10])).
% fof(20, plain,?[X1]:((big_f(X1)&![X2]:(~(big_h(X1,X2))|big_l(X2)))&![X3]:((~(big_g(X3))|~(big_h(X1,X3)))|big_j(X1,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(21, plain,?[X4]:((big_f(X4)&![X5]:(~(big_h(X4,X5))|big_l(X5)))&![X6]:((~(big_g(X6))|~(big_h(X4,X6)))|big_j(X4,X6))),inference(variable_rename,[status(thm)],[20])).
% fof(22, plain,((big_f(esk2_0)&![X5]:(~(big_h(esk2_0,X5))|big_l(X5)))&![X6]:((~(big_g(X6))|~(big_h(esk2_0,X6)))|big_j(esk2_0,X6))),inference(skolemize,[status(esa)],[21])).
% fof(23, plain,![X5]:![X6]:(((~(big_g(X6))|~(big_h(esk2_0,X6)))|big_j(esk2_0,X6))&((~(big_h(esk2_0,X5))|big_l(X5))&big_f(esk2_0))),inference(shift_quantors,[status(thm)],[22])).
% cnf(24,plain,(big_f(esk2_0)),inference(split_conjunct,[status(thm)],[23])).
% cnf(25,plain,(big_l(X1)|~big_h(esk2_0,X1)),inference(split_conjunct,[status(thm)],[23])).
% cnf(26,plain,(big_j(esk2_0,X1)|~big_h(esk2_0,X1)|~big_g(X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(27, plain,![X2]:(~(big_l(X2))|~(big_k(X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(28, plain,![X3]:(~(big_l(X3))|~(big_k(X3))),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(~big_k(X1)|~big_l(X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, negated_conjecture,![X1]:(~(big_f(X1))|?[X2]:(big_g(X2)&big_h(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(31, negated_conjecture,![X3]:(~(big_f(X3))|?[X4]:(big_g(X4)&big_h(X3,X4))),inference(variable_rename,[status(thm)],[30])).
% fof(32, negated_conjecture,![X3]:(~(big_f(X3))|(big_g(esk3_1(X3))&big_h(X3,esk3_1(X3)))),inference(skolemize,[status(esa)],[31])).
% fof(33, negated_conjecture,![X3]:((big_g(esk3_1(X3))|~(big_f(X3)))&(big_h(X3,esk3_1(X3))|~(big_f(X3)))),inference(distribute,[status(thm)],[32])).
% cnf(34,negated_conjecture,(big_h(X1,esk3_1(X1))|~big_f(X1)),inference(split_conjunct,[status(thm)],[33])).
% cnf(36,plain,(~big_k(X1)|~big_h(esk2_0,X1)),inference(spm,[status(thm)],[29,25,theory(equality)])).
% cnf(37,plain,(big_g(esk1_1(esk2_0))|big_g(X1)),inference(spm,[status(thm)],[19,24,theory(equality)])).
% cnf(41,plain,(big_k(X1)|big_h(esk2_0,esk1_1(esk2_0))),inference(spm,[status(thm)],[12,24,theory(equality)])).
% cnf(43,plain,(big_g(X1)|~big_f(esk2_0)|~big_h(esk2_0,esk1_1(esk2_0))|~big_g(esk1_1(esk2_0))),inference(spm,[status(thm)],[17,26,theory(equality)])).
% cnf(44,plain,(big_g(X1)|$false|~big_h(esk2_0,esk1_1(esk2_0))|~big_g(esk1_1(esk2_0))),inference(rw,[status(thm)],[43,24,theory(equality)])).
% cnf(45,plain,(big_g(X1)|~big_h(esk2_0,esk1_1(esk2_0))|~big_g(esk1_1(esk2_0))),inference(cn,[status(thm)],[44,theory(equality)])).
% cnf(52,plain,(big_g(esk1_1(esk2_0))),inference(ef,[status(thm)],[37,theory(equality)])).
% cnf(56,plain,(big_h(esk2_0,esk1_1(esk2_0))|~big_h(esk2_0,X1)),inference(spm,[status(thm)],[36,41,theory(equality)])).
% cnf(57,negated_conjecture,(big_h(esk2_0,esk1_1(esk2_0))|~big_f(esk2_0)),inference(spm,[status(thm)],[56,34,theory(equality)])).
% cnf(60,negated_conjecture,(big_h(esk2_0,esk1_1(esk2_0))|$false),inference(rw,[status(thm)],[57,24,theory(equality)])).
% cnf(61,negated_conjecture,(big_h(esk2_0,esk1_1(esk2_0))),inference(cn,[status(thm)],[60,theory(equality)])).
% cnf(64,plain,(big_g(X1)|$false|~big_g(esk1_1(esk2_0))),inference(rw,[status(thm)],[45,61,theory(equality)])).
% cnf(65,plain,(big_g(X1)|$false|$false),inference(rw,[status(thm)],[64,52,theory(equality)])).
% cnf(66,plain,(big_g(X1)),inference(cn,[status(thm)],[65,theory(equality)])).
% cnf(69,plain,(big_j(esk2_0,X1)|~big_h(esk2_0,X1)|$false),inference(rw,[status(thm)],[26,66,theory(equality)])).
% cnf(70,plain,(big_j(esk2_0,X1)|~big_h(esk2_0,X1)),inference(cn,[status(thm)],[69,theory(equality)])).
% cnf(79,plain,(big_h(esk2_0,X1)|~big_f(esk2_0)|~big_h(esk2_0,esk1_1(esk2_0))),inference(spm,[status(thm)],[14,70,theory(equality)])).
% cnf(83,plain,(big_h(esk2_0,X1)|$false|~big_h(esk2_0,esk1_1(esk2_0))),inference(rw,[status(thm)],[79,24,theory(equality)])).
% cnf(84,plain,(big_h(esk2_0,X1)|$false|$false),inference(rw,[status(thm)],[83,61,theory(equality)])).
% cnf(85,plain,(big_h(esk2_0,X1)),inference(cn,[status(thm)],[84,theory(equality)])).
% cnf(86,plain,(~big_k(X1)|$false),inference(rw,[status(thm)],[36,85,theory(equality)])).
% cnf(87,plain,(~big_k(X1)),inference(cn,[status(thm)],[86,theory(equality)])).
% cnf(88,plain,(big_j(esk2_0,X1)|$false),inference(rw,[status(thm)],[70,85,theory(equality)])).
% cnf(89,plain,(big_j(esk2_0,X1)),inference(cn,[status(thm)],[88,theory(equality)])).
% cnf(93,plain,(big_k(X1)|~big_f(esk2_0)),inference(spm,[status(thm)],[11,89,theory(equality)])).
% cnf(95,plain,(big_k(X1)|$false),inference(rw,[status(thm)],[93,24,theory(equality)])).
% cnf(96,plain,(big_k(X1)),inference(cn,[status(thm)],[95,theory(equality)])).
% cnf(97,plain,($false),inference(sr,[status(thm)],[96,87,theory(equality)])).
% cnf(98,plain,($false),97,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 45
% # ...of these trivial : 3
% # ...subsumed : 0
% # ...remaining for further processing: 42
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 13
% # Generated clauses : 20
% # ...of the previous two non-trivial : 22
% # Contextual simplify-reflections : 0
% # Paramodulations : 18
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 11
% # Positive orientable unit clauses: 4
% # 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 : 1
% # Clause-clause subsumption calls (NU) : 4
% # Rec. Clause-clause subsumption calls : 4
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 15 leaves, 1.27+/-0.442 terms/leaf
% # Paramod-from index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 12 leaves, 1.25+/-0.433 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.004 s
% # Total time : 0.013 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/SystemOnTPTP28740/SYN069+1.tptp
%
%------------------------------------------------------------------------------