%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR066+1 : TPTP v5.0.0. Released v3.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.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 : Tue Dec 28 23:59:59 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/SystemOnTPTP29629/CSR066+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29629/CSR066+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29629/CSR066+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 29725
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,shavingrazor_manual(c_theprototypicalshavingrazor_manual),file('/tmp/SRASS.s.p', just11)).
% fof(12, axiom,![X5]:(isa(X5,c_tptpcol_16_25972)=>tptpcol_16_25972(X5)),file('/tmp/SRASS.s.p', just32)).
% fof(39, axiom,![X16]:(shavingrazor_manual(X16)=>tptp_8_271(f_relationexistsallfn(X16,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X16)),file('/tmp/SRASS.s.p', just9)).
% fof(46, axiom,![X5]:(shavingrazor_manual(X5)=>isa(X5,c_shavingrazor_manual)),file('/tmp/SRASS.s.p', just31)).
% fof(52, axiom,![X16]:![X17]:![X18]:![X19]:((isa(X16,X17)&relationexistsall(X18,X19,X17))=>isa(f_relationexistsallfn(X16,X18,X19,X17),X19)),file('/tmp/SRASS.s.p', just4)).
% fof(61, axiom,relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),file('/tmp/SRASS.s.p', just10)).
% fof(74, conjecture,?[X5]:(mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))=>(tptp_8_271(X5,c_theprototypicalshavingrazor_manual)&tptpcol_16_25972(X5))),file('/tmp/SRASS.s.p', query66)).
% fof(75, negated_conjecture,~(?[X5]:(mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))=>(tptp_8_271(X5,c_theprototypicalshavingrazor_manual)&tptpcol_16_25972(X5)))),inference(assume_negation,[status(cth)],[74])).
% cnf(80,plain,(shavingrazor_manual(c_theprototypicalshavingrazor_manual)),inference(split_conjunct,[status(thm)],[3])).
% fof(98, plain,![X5]:(~(isa(X5,c_tptpcol_16_25972))|tptpcol_16_25972(X5)),inference(fof_nnf,[status(thm)],[12])).
% fof(99, plain,![X6]:(~(isa(X6,c_tptpcol_16_25972))|tptpcol_16_25972(X6)),inference(variable_rename,[status(thm)],[98])).
% cnf(100,plain,(tptpcol_16_25972(X1)|~isa(X1,c_tptpcol_16_25972)),inference(split_conjunct,[status(thm)],[99])).
% fof(164, plain,![X16]:(~(shavingrazor_manual(X16))|tptp_8_271(f_relationexistsallfn(X16,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X16)),inference(fof_nnf,[status(thm)],[39])).
% fof(165, plain,![X17]:(~(shavingrazor_manual(X17))|tptp_8_271(f_relationexistsallfn(X17,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X17)),inference(variable_rename,[status(thm)],[164])).
% cnf(166,plain,(tptp_8_271(f_relationexistsallfn(X1,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X1)|~shavingrazor_manual(X1)),inference(split_conjunct,[status(thm)],[165])).
% fof(185, plain,![X5]:(~(shavingrazor_manual(X5))|isa(X5,c_shavingrazor_manual)),inference(fof_nnf,[status(thm)],[46])).
% fof(186, plain,![X6]:(~(shavingrazor_manual(X6))|isa(X6,c_shavingrazor_manual)),inference(variable_rename,[status(thm)],[185])).
% cnf(187,plain,(isa(X1,c_shavingrazor_manual)|~shavingrazor_manual(X1)),inference(split_conjunct,[status(thm)],[186])).
% fof(199, plain,![X16]:![X17]:![X18]:![X19]:((~(isa(X16,X17))|~(relationexistsall(X18,X19,X17)))|isa(f_relationexistsallfn(X16,X18,X19,X17),X19)),inference(fof_nnf,[status(thm)],[52])).
% fof(200, plain,![X20]:![X21]:![X22]:![X23]:((~(isa(X20,X21))|~(relationexistsall(X22,X23,X21)))|isa(f_relationexistsallfn(X20,X22,X23,X21),X23)),inference(variable_rename,[status(thm)],[199])).
% cnf(201,plain,(isa(f_relationexistsallfn(X1,X2,X3,X4),X3)|~relationexistsall(X2,X3,X4)|~isa(X1,X4)),inference(split_conjunct,[status(thm)],[200])).
% cnf(222,plain,(relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)),inference(split_conjunct,[status(thm)],[61])).
% fof(257, negated_conjecture,![X5]:(mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))&(~(tptp_8_271(X5,c_theprototypicalshavingrazor_manual))|~(tptpcol_16_25972(X5)))),inference(fof_nnf,[status(thm)],[75])).
% fof(258, negated_conjecture,![X6]:(mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))&(~(tptp_8_271(X6,c_theprototypicalshavingrazor_manual))|~(tptpcol_16_25972(X6)))),inference(variable_rename,[status(thm)],[257])).
% cnf(259,negated_conjecture,(~tptpcol_16_25972(X1)|~tptp_8_271(X1,c_theprototypicalshavingrazor_manual)),inference(split_conjunct,[status(thm)],[258])).
% cnf(262,negated_conjecture,(~tptp_8_271(X1,c_theprototypicalshavingrazor_manual)|~isa(X1,c_tptpcol_16_25972)),inference(spm,[status(thm)],[259,100,theory(equality)])).
% cnf(263,plain,(isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual)),inference(spm,[status(thm)],[187,80,theory(equality)])).
% cnf(302,plain,(isa(f_relationexistsallfn(X1,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972)|~isa(X1,c_shavingrazor_manual)),inference(spm,[status(thm)],[201,222,theory(equality)])).
% cnf(304,negated_conjecture,(~isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972)|~shavingrazor_manual(c_theprototypicalshavingrazor_manual)),inference(spm,[status(thm)],[262,166,theory(equality)])).
% cnf(305,negated_conjecture,(~isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972)|$false),inference(rw,[status(thm)],[304,80,theory(equality)])).
% cnf(306,negated_conjecture,(~isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972)),inference(cn,[status(thm)],[305,theory(equality)])).
% cnf(469,negated_conjecture,(~isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual)),inference(spm,[status(thm)],[306,302,theory(equality)])).
% cnf(472,negated_conjecture,($false),inference(rw,[status(thm)],[469,263,theory(equality)])).
% cnf(473,negated_conjecture,($false),inference(cn,[status(thm)],[472,theory(equality)])).
% cnf(474,negated_conjecture,($false),473,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 198
% # ...of these trivial : 5
% # ...subsumed : 13
% # ...remaining for further processing: 180
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 126
% # ...of the previous two non-trivial : 66
% # Contextual simplify-reflections : 0
% # Paramodulations : 126
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 112
% # Positive orientable unit clauses: 57
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 54
% # Current number of unprocessed clauses: 10
% # ...number of literals in the above : 23
% # Clause-clause subsumption calls (NU) : 428
% # Rec. Clause-clause subsumption calls : 410
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 125 leaves, 1.22+/-0.828 terms/leaf
% # Paramod-from index: 67 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 113 leaves, 1.14+/-0.530 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.006 s
% # Total time : 0.028 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP29629/CSR066+1.tptp
%
%------------------------------------------------------------------------------