TSTP Solution File: CSR063+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : CSR063+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 : art02.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:54:32 EST 2010

% Result   : Theorem 1.29s
% Output   : Solution 1.29s
% 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/SystemOnTPTP17784/CSR063+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP17784/CSR063+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17784/CSR063+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 17880
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X3]:![X4]:![X5]:~(((isa(X3,X4)&isa(X3,X5))&disjointwith(X4,X5))),file('/tmp/SRASS.s.p', just19)).
% fof(6, axiom,![X6]:![X7]:![X8]:((disjointwith(X6,X7)&genls(X8,X7))=>disjointwith(X6,X8)),file('/tmp/SRASS.s.p', just82)).
% fof(7, axiom,![X7]:![X9]:![X8]:((disjointwith(X7,X9)&genls(X8,X7))=>disjointwith(X8,X9)),file('/tmp/SRASS.s.p', just83)).
% fof(8, axiom,![X6]:![X9]:(disjointwith(X6,X9)=>no(X6,X9)),file('/tmp/SRASS.s.p', just22)).
% fof(12, axiom,![X6]:computerdataartifact(f_urlreferentfn(X6)),file('/tmp/SRASS.s.p', just95)).
% fof(21, axiom,disjointwith(c_intangible,c_partiallytangible),file('/tmp/SRASS.s.p', just6)).
% fof(33, axiom,![X3]:(computerdataartifact(X3)=>artifact(X3)),file('/tmp/SRASS.s.p', just9)).
% fof(36, axiom,![X10]:![X9]:(no(X10,X9)=>setorcollection(X10)),file('/tmp/SRASS.s.p', just44)).
% fof(47, axiom,genls(c_mathematicalorcomputationalthing,c_intangible),file('/tmp/SRASS.s.p', just4)).
% fof(48, axiom,genls(c_inanimateobject,c_partiallytangible),file('/tmp/SRASS.s.p', just17)).
% fof(59, axiom,![X3]:(setorcollection(X3)=>mathematicalthing(X3)),file('/tmp/SRASS.s.p', just2)).
% fof(68, axiom,genls(c_mathematicalthing,c_mathematicalorcomputationalthing),file('/tmp/SRASS.s.p', just10)).
% fof(69, axiom,genls(c_artifact,c_inanimateobject_nonnatural),file('/tmp/SRASS.s.p', just13)).
% fof(70, axiom,genls(c_inanimateobject_nonnatural,c_inanimateobject),file('/tmp/SRASS.s.p', just15)).
% fof(78, axiom,![X1]:(artifact(X1)=>isa(X1,c_artifact)),file('/tmp/SRASS.s.p', just76)).
% fof(82, axiom,![X1]:(mathematicalthing(X1)=>isa(X1,c_mathematicalthing)),file('/tmp/SRASS.s.p', just103)).
% fof(116, conjecture,~(disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949)),file('/tmp/SRASS.s.p', query63)).
% fof(117, negated_conjecture,~(~(disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949))),inference(assume_negation,[status(cth)],[116])).
% fof(118, negated_conjecture,disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),inference(fof_simplification,[status(thm)],[117,theory(equality)])).
% fof(123, plain,![X3]:![X4]:![X5]:((~(isa(X3,X4))|~(isa(X3,X5)))|~(disjointwith(X4,X5))),inference(fof_nnf,[status(thm)],[3])).
% fof(124, plain,![X6]:![X7]:![X8]:((~(isa(X6,X7))|~(isa(X6,X8)))|~(disjointwith(X7,X8))),inference(variable_rename,[status(thm)],[123])).
% cnf(125,plain,(~disjointwith(X1,X2)|~isa(X3,X2)|~isa(X3,X1)),inference(split_conjunct,[status(thm)],[124])).
% fof(132, plain,![X6]:![X7]:![X8]:((~(disjointwith(X6,X7))|~(genls(X8,X7)))|disjointwith(X6,X8)),inference(fof_nnf,[status(thm)],[6])).
% fof(133, plain,![X9]:![X10]:![X11]:((~(disjointwith(X9,X10))|~(genls(X11,X10)))|disjointwith(X9,X11)),inference(variable_rename,[status(thm)],[132])).
% cnf(134,plain,(disjointwith(X1,X2)|~genls(X2,X3)|~disjointwith(X1,X3)),inference(split_conjunct,[status(thm)],[133])).
% fof(135, plain,![X7]:![X9]:![X8]:((~(disjointwith(X7,X9))|~(genls(X8,X7)))|disjointwith(X8,X9)),inference(fof_nnf,[status(thm)],[7])).
% fof(136, plain,![X10]:![X11]:![X12]:((~(disjointwith(X10,X11))|~(genls(X12,X10)))|disjointwith(X12,X11)),inference(variable_rename,[status(thm)],[135])).
% cnf(137,plain,(disjointwith(X1,X2)|~genls(X1,X3)|~disjointwith(X3,X2)),inference(split_conjunct,[status(thm)],[136])).
% fof(138, plain,![X6]:![X9]:(~(disjointwith(X6,X9))|no(X6,X9)),inference(fof_nnf,[status(thm)],[8])).
% fof(139, plain,![X10]:![X11]:(~(disjointwith(X10,X11))|no(X10,X11)),inference(variable_rename,[status(thm)],[138])).
% cnf(140,plain,(no(X1,X2)|~disjointwith(X1,X2)),inference(split_conjunct,[status(thm)],[139])).
% fof(150, plain,![X7]:computerdataartifact(f_urlreferentfn(X7)),inference(variable_rename,[status(thm)],[12])).
% cnf(151,plain,(computerdataartifact(f_urlreferentfn(X1))),inference(split_conjunct,[status(thm)],[150])).
% cnf(171,plain,(disjointwith(c_intangible,c_partiallytangible)),inference(split_conjunct,[status(thm)],[21])).
% fof(205, plain,![X3]:(~(computerdataartifact(X3))|artifact(X3)),inference(fof_nnf,[status(thm)],[33])).
% fof(206, plain,![X4]:(~(computerdataartifact(X4))|artifact(X4)),inference(variable_rename,[status(thm)],[205])).
% cnf(207,plain,(artifact(X1)|~computerdataartifact(X1)),inference(split_conjunct,[status(thm)],[206])).
% fof(214, plain,![X10]:![X9]:(~(no(X10,X9))|setorcollection(X10)),inference(fof_nnf,[status(thm)],[36])).
% fof(215, plain,![X11]:![X12]:(~(no(X11,X12))|setorcollection(X11)),inference(variable_rename,[status(thm)],[214])).
% cnf(216,plain,(setorcollection(X1)|~no(X1,X2)),inference(split_conjunct,[status(thm)],[215])).
% cnf(247,plain,(genls(c_mathematicalorcomputationalthing,c_intangible)),inference(split_conjunct,[status(thm)],[47])).
% cnf(248,plain,(genls(c_inanimateobject,c_partiallytangible)),inference(split_conjunct,[status(thm)],[48])).
% fof(277, plain,![X3]:(~(setorcollection(X3))|mathematicalthing(X3)),inference(fof_nnf,[status(thm)],[59])).
% fof(278, plain,![X4]:(~(setorcollection(X4))|mathematicalthing(X4)),inference(variable_rename,[status(thm)],[277])).
% cnf(279,plain,(mathematicalthing(X1)|~setorcollection(X1)),inference(split_conjunct,[status(thm)],[278])).
% cnf(300,plain,(genls(c_mathematicalthing,c_mathematicalorcomputationalthing)),inference(split_conjunct,[status(thm)],[68])).
% cnf(301,plain,(genls(c_artifact,c_inanimateobject_nonnatural)),inference(split_conjunct,[status(thm)],[69])).
% cnf(302,plain,(genls(c_inanimateobject_nonnatural,c_inanimateobject)),inference(split_conjunct,[status(thm)],[70])).
% fof(324, plain,![X1]:(~(artifact(X1))|isa(X1,c_artifact)),inference(fof_nnf,[status(thm)],[78])).
% fof(325, plain,![X2]:(~(artifact(X2))|isa(X2,c_artifact)),inference(variable_rename,[status(thm)],[324])).
% cnf(326,plain,(isa(X1,c_artifact)|~artifact(X1)),inference(split_conjunct,[status(thm)],[325])).
% fof(336, plain,![X1]:(~(mathematicalthing(X1))|isa(X1,c_mathematicalthing)),inference(fof_nnf,[status(thm)],[82])).
% fof(337, plain,![X2]:(~(mathematicalthing(X2))|isa(X2,c_mathematicalthing)),inference(variable_rename,[status(thm)],[336])).
% cnf(338,plain,(isa(X1,c_mathematicalthing)|~mathematicalthing(X1)),inference(split_conjunct,[status(thm)],[337])).
% cnf(426,negated_conjecture,(disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949)),inference(split_conjunct,[status(thm)],[118])).
% cnf(429,negated_conjecture,(no(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949)),inference(spm,[status(thm)],[140,426,theory(equality)])).
% cnf(458,plain,(isa(X1,c_mathematicalthing)|~setorcollection(X1)),inference(spm,[status(thm)],[338,279,theory(equality)])).
% cnf(459,plain,(isa(X1,c_artifact)|~computerdataartifact(X1)),inference(spm,[status(thm)],[326,207,theory(equality)])).
% cnf(470,plain,(disjointwith(c_mathematicalthing,X1)|~disjointwith(c_mathematicalorcomputationalthing,X1)),inference(spm,[status(thm)],[137,300,theory(equality)])).
% cnf(474,plain,(disjointwith(c_mathematicalorcomputationalthing,X1)|~disjointwith(c_intangible,X1)),inference(spm,[status(thm)],[137,247,theory(equality)])).
% cnf(487,plain,(disjointwith(X1,c_inanimateobject_nonnatural)|~disjointwith(X1,c_inanimateobject)),inference(spm,[status(thm)],[134,302,theory(equality)])).
% cnf(488,plain,(disjointwith(X1,c_artifact)|~disjointwith(X1,c_inanimateobject_nonnatural)),inference(spm,[status(thm)],[134,301,theory(equality)])).
% cnf(492,plain,(disjointwith(X1,c_inanimateobject)|~disjointwith(X1,c_partiallytangible)),inference(spm,[status(thm)],[134,248,theory(equality)])).
% cnf(580,negated_conjecture,(setorcollection(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)))),inference(spm,[status(thm)],[216,429,theory(equality)])).
% cnf(681,negated_conjecture,(isa(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_mathematicalthing)),inference(spm,[status(thm)],[458,580,theory(equality)])).
% cnf(725,plain,(isa(f_urlreferentfn(X1),c_artifact)),inference(spm,[status(thm)],[459,151,theory(equality)])).
% cnf(729,plain,(~isa(f_urlreferentfn(X1),X2)|~disjointwith(X2,c_artifact)),inference(spm,[status(thm)],[125,725,theory(equality)])).
% cnf(848,negated_conjecture,(~disjointwith(c_mathematicalthing,c_artifact)),inference(spm,[status(thm)],[729,681,theory(equality)])).
% cnf(882,negated_conjecture,(~disjointwith(c_mathematicalorcomputationalthing,c_artifact)),inference(spm,[status(thm)],[848,470,theory(equality)])).
% cnf(952,plain,(disjointwith(c_mathematicalorcomputationalthing,c_artifact)|~disjointwith(c_intangible,c_inanimateobject_nonnatural)),inference(spm,[status(thm)],[488,474,theory(equality)])).
% cnf(1092,plain,(~disjointwith(c_intangible,c_inanimateobject_nonnatural)),inference(sr,[status(thm)],[952,882,theory(equality)])).
% cnf(1093,plain,(~disjointwith(c_intangible,c_inanimateobject)),inference(spm,[status(thm)],[1092,487,theory(equality)])).
% cnf(1111,plain,(~disjointwith(c_intangible,c_partiallytangible)),inference(spm,[status(thm)],[1093,492,theory(equality)])).
% cnf(1112,plain,($false),inference(rw,[status(thm)],[1111,171,theory(equality)])).
% cnf(1113,plain,($false),inference(cn,[status(thm)],[1112,theory(equality)])).
% cnf(1114,plain,($false),1113,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 370
% # ...of these trivial                : 16
% # ...subsumed                        : 37
% # ...remaining for further processing: 317
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 538
% # ...of the previous two non-trivial : 354
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 538
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 225
% #    Positive orientable unit clauses: 83
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 28
% #    Non-unit-clauses                : 114
% # Current number of unprocessed clauses: 192
% # ...number of literals in the above : 344
% # Clause-clause subsumption calls (NU) : 684
% # Rec. Clause-clause subsumption calls : 650
% # Unit Clause-clause subsumption calls : 690
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:   207 leaves,   1.15+/-0.678 terms/leaf
% # Paramod-from index:          109 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:          181 leaves,   1.09+/-0.455 terms/leaf
% # -------------------------------------------------
% # User time              : 0.041 s
% # System time            : 0.003 s
% # Total time             : 0.044 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP17784/CSR063+1.tptp
% 
%------------------------------------------------------------------------------