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