%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN352+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:24:26 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/SystemOnTPTP5424/SYN352+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5424/SYN352+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5424/SYN352+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 5520
% 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]:?[X3]:?[X4]:![X5]:(big_f(X1,X2)=>((big_f(X3,X4)=>(big_f(X2,X5)|big_f(X4,X5)))=>(((big_f(X3,X4)=>(big_f(X2,X5)<=>big_f(X3,X5)))=>big_f(X5,X5))=>(big_f(X3,X4)&(big_f(X3,X5)<=>big_f(X4,X5)))))),file('/tmp/SRASS.s.p', church_46_18_4)).
% fof(2, negated_conjecture,~(![X1]:![X2]:?[X3]:?[X4]:![X5]:(big_f(X1,X2)=>((big_f(X3,X4)=>(big_f(X2,X5)|big_f(X4,X5)))=>(((big_f(X3,X4)=>(big_f(X2,X5)<=>big_f(X3,X5)))=>big_f(X5,X5))=>(big_f(X3,X4)&(big_f(X3,X5)<=>big_f(X4,X5))))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,?[X1]:?[X2]:![X3]:![X4]:?[X5]:(big_f(X1,X2)&((~(big_f(X3,X4))|(big_f(X2,X5)|big_f(X4,X5)))&(((big_f(X3,X4)&((~(big_f(X2,X5))|~(big_f(X3,X5)))&(big_f(X2,X5)|big_f(X3,X5))))|big_f(X5,X5))&(~(big_f(X3,X4))|((~(big_f(X3,X5))|~(big_f(X4,X5)))&(big_f(X3,X5)|big_f(X4,X5))))))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,?[X6]:?[X7]:![X8]:![X9]:?[X10]:(big_f(X6,X7)&((~(big_f(X8,X9))|(big_f(X7,X10)|big_f(X9,X10)))&(((big_f(X8,X9)&((~(big_f(X7,X10))|~(big_f(X8,X10)))&(big_f(X7,X10)|big_f(X8,X10))))|big_f(X10,X10))&(~(big_f(X8,X9))|((~(big_f(X8,X10))|~(big_f(X9,X10)))&(big_f(X8,X10)|big_f(X9,X10))))))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,![X8]:![X9]:(big_f(esk1_0,esk2_0)&((~(big_f(X8,X9))|(big_f(esk2_0,esk3_2(X8,X9))|big_f(X9,esk3_2(X8,X9))))&(((big_f(X8,X9)&((~(big_f(esk2_0,esk3_2(X8,X9)))|~(big_f(X8,esk3_2(X8,X9))))&(big_f(esk2_0,esk3_2(X8,X9))|big_f(X8,esk3_2(X8,X9)))))|big_f(esk3_2(X8,X9),esk3_2(X8,X9)))&(~(big_f(X8,X9))|((~(big_f(X8,esk3_2(X8,X9)))|~(big_f(X9,esk3_2(X8,X9))))&(big_f(X8,esk3_2(X8,X9))|big_f(X9,esk3_2(X8,X9)))))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X8]:![X9]:(big_f(esk1_0,esk2_0)&((~(big_f(X8,X9))|(big_f(esk2_0,esk3_2(X8,X9))|big_f(X9,esk3_2(X8,X9))))&(((big_f(X8,X9)|big_f(esk3_2(X8,X9),esk3_2(X8,X9)))&(((~(big_f(esk2_0,esk3_2(X8,X9)))|~(big_f(X8,esk3_2(X8,X9))))|big_f(esk3_2(X8,X9),esk3_2(X8,X9)))&((big_f(esk2_0,esk3_2(X8,X9))|big_f(X8,esk3_2(X8,X9)))|big_f(esk3_2(X8,X9),esk3_2(X8,X9)))))&(((~(big_f(X8,esk3_2(X8,X9)))|~(big_f(X9,esk3_2(X8,X9))))|~(big_f(X8,X9)))&((big_f(X8,esk3_2(X8,X9))|big_f(X9,esk3_2(X8,X9)))|~(big_f(X8,X9))))))),inference(distribute,[status(thm)],[5])).
% cnf(7,negated_conjecture,(big_f(X2,esk3_2(X1,X2))|big_f(X1,esk3_2(X1,X2))|~big_f(X1,X2)),inference(split_conjunct,[status(thm)],[6])).
% cnf(8,negated_conjecture,(~big_f(X1,X2)|~big_f(X2,esk3_2(X1,X2))|~big_f(X1,esk3_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(11,negated_conjecture,(big_f(esk3_2(X1,X2),esk3_2(X1,X2))|big_f(X1,X2)),inference(split_conjunct,[status(thm)],[6])).
% cnf(16,negated_conjecture,(big_f(esk3_2(X1,X2),esk3_2(esk3_2(X1,X2),esk3_2(X1,X2)))|big_f(X1,X2)),inference(spm,[status(thm)],[7,11,theory(equality)])).
% cnf(48,negated_conjecture,(big_f(X1,X2)|~big_f(esk3_2(X1,X2),esk3_2(esk3_2(X1,X2),esk3_2(X1,X2)))|~big_f(esk3_2(X1,X2),esk3_2(X1,X2))),inference(spm,[status(thm)],[8,16,theory(equality)])).
% cnf(53,negated_conjecture,(big_f(X1,X2)|~big_f(esk3_2(X1,X2),esk3_2(esk3_2(X1,X2),esk3_2(X1,X2)))),inference(csr,[status(thm)],[48,11])).
% cnf(54,negated_conjecture,(big_f(X1,X2)),inference(csr,[status(thm)],[53,16])).
% cnf(55,negated_conjecture,($false|~big_f(X2,esk3_2(X2,X1))|~big_f(X2,X1)),inference(rw,[status(thm)],[8,54,theory(equality)])).
% cnf(56,negated_conjecture,($false|$false|~big_f(X2,X1)),inference(rw,[status(thm)],[55,54,theory(equality)])).
% cnf(57,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[56,54,theory(equality)])).
% cnf(58,negated_conjecture,($false),inference(cn,[status(thm)],[57,theory(equality)])).
% cnf(59,negated_conjecture,($false),58,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 28
% # ...of these trivial : 1
% # ...subsumed : 3
% # ...remaining for further processing: 24
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 15
% # Generated clauses : 31
% # ...of the previous two non-trivial : 29
% # Contextual simplify-reflections : 5
% # Paramodulations : 31
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 176
% # Rec. Clause-clause subsumption calls : 114
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 19
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 1 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 1 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.004 s
% # Total time : 0.014 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/SystemOnTPTP5424/SYN352+1.tptp
%
%------------------------------------------------------------------------------