TSTP Solution File: CSR063+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR063+2 : 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:54:51 EST 2010
% Result : Theorem 117.96s
% Output : Solution 117.96s
% 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/SystemOnTPTP28350/CSR063+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28350/CSR063+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28350/CSR063+2.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 28626
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.080 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X6]:![X9]:(disjointwith(X6,X9)=>no(X6,X9)),file('/tmp/SRASS.s.p', ax1_221)).
% fof(10, axiom,![X6]:computerdataartifact(f_urlreferentfn(X6)),file('/tmp/SRASS.s.p', ax1_1085)).
% fof(81, axiom,![X3]:(computerdataartifact(X3)=>artifact(X3)),file('/tmp/SRASS.s.p', ax1_494)).
% fof(91, axiom,![X11]:![X9]:(no(X11,X9)=>setorcollection(X11)),file('/tmp/SRASS.s.p', ax1_718)).
% fof(137, axiom,![X3]:~((intangible(X3)&partiallytangible(X3))),file('/tmp/SRASS.s.p', ax1_3)).
% fof(174, axiom,![X3]:(setorcollection(X3)=>mathematicalthing(X3)),file('/tmp/SRASS.s.p', ax1_112)).
% fof(180, axiom,![X3]:(mathematicalorcomputationalthing(X3)=>intangible(X3)),file('/tmp/SRASS.s.p', ax1_132)).
% fof(201, axiom,![X3]:(artifact(X3)=>inanimateobject_nonnatural(X3)),file('/tmp/SRASS.s.p', ax1_211)).
% fof(629, axiom,![X3]:(mathematicalthing(X3)=>mathematicalorcomputationalthing(X3)),file('/tmp/SRASS.s.p', ax1_180)).
% fof(630, axiom,![X3]:(inanimateobject_nonnatural(X3)=>inanimateobject(X3)),file('/tmp/SRASS.s.p', ax1_196)).
% fof(1030, axiom,![X3]:(inanimateobject(X3)=>partiallytangible(X3)),file('/tmp/SRASS.s.p', ax1_9)).
% fof(1132, conjecture,~(disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949)),file('/tmp/SRASS.s.p', query113)).
% fof(1133, negated_conjecture,~(~(disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949))),inference(assume_negation,[status(cth)],[1132])).
% fof(1137, negated_conjecture,disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),inference(fof_simplification,[status(thm)],[1133,theory(equality)])).
% fof(1151, plain,![X6]:![X9]:(~(disjointwith(X6,X9))|no(X6,X9)),inference(fof_nnf,[status(thm)],[6])).
% fof(1152, plain,![X10]:![X11]:(~(disjointwith(X10,X11))|no(X10,X11)),inference(variable_rename,[status(thm)],[1151])).
% cnf(1153,plain,(no(X1,X2)|~disjointwith(X1,X2)),inference(split_conjunct,[status(thm)],[1152])).
% fof(1162, plain,![X7]:computerdataartifact(f_urlreferentfn(X7)),inference(variable_rename,[status(thm)],[10])).
% cnf(1163,plain,(computerdataartifact(f_urlreferentfn(X1))),inference(split_conjunct,[status(thm)],[1162])).
% fof(1320, plain,![X3]:(~(computerdataartifact(X3))|artifact(X3)),inference(fof_nnf,[status(thm)],[81])).
% fof(1321, plain,![X4]:(~(computerdataartifact(X4))|artifact(X4)),inference(variable_rename,[status(thm)],[1320])).
% cnf(1322,plain,(artifact(X1)|~computerdataartifact(X1)),inference(split_conjunct,[status(thm)],[1321])).
% fof(1347, plain,![X11]:![X9]:(~(no(X11,X9))|setorcollection(X11)),inference(fof_nnf,[status(thm)],[91])).
% fof(1348, plain,![X12]:![X13]:(~(no(X12,X13))|setorcollection(X12)),inference(variable_rename,[status(thm)],[1347])).
% cnf(1349,plain,(setorcollection(X1)|~no(X1,X2)),inference(split_conjunct,[status(thm)],[1348])).
% fof(1482, plain,![X3]:(~(intangible(X3))|~(partiallytangible(X3))),inference(fof_nnf,[status(thm)],[137])).
% fof(1483, plain,![X4]:(~(intangible(X4))|~(partiallytangible(X4))),inference(variable_rename,[status(thm)],[1482])).
% cnf(1484,plain,(~partiallytangible(X1)|~intangible(X1)),inference(split_conjunct,[status(thm)],[1483])).
% fof(1573, plain,![X3]:(~(setorcollection(X3))|mathematicalthing(X3)),inference(fof_nnf,[status(thm)],[174])).
% fof(1574, plain,![X4]:(~(setorcollection(X4))|mathematicalthing(X4)),inference(variable_rename,[status(thm)],[1573])).
% cnf(1575,plain,(mathematicalthing(X1)|~setorcollection(X1)),inference(split_conjunct,[status(thm)],[1574])).
% fof(1587, plain,![X3]:(~(mathematicalorcomputationalthing(X3))|intangible(X3)),inference(fof_nnf,[status(thm)],[180])).
% fof(1588, plain,![X4]:(~(mathematicalorcomputationalthing(X4))|intangible(X4)),inference(variable_rename,[status(thm)],[1587])).
% cnf(1589,plain,(intangible(X1)|~mathematicalorcomputationalthing(X1)),inference(split_conjunct,[status(thm)],[1588])).
% fof(1644, plain,![X3]:(~(artifact(X3))|inanimateobject_nonnatural(X3)),inference(fof_nnf,[status(thm)],[201])).
% fof(1645, plain,![X4]:(~(artifact(X4))|inanimateobject_nonnatural(X4)),inference(variable_rename,[status(thm)],[1644])).
% cnf(1646,plain,(inanimateobject_nonnatural(X1)|~artifact(X1)),inference(split_conjunct,[status(thm)],[1645])).
% fof(2461, plain,![X3]:(~(mathematicalthing(X3))|mathematicalorcomputationalthing(X3)),inference(fof_nnf,[status(thm)],[629])).
% fof(2462, plain,![X4]:(~(mathematicalthing(X4))|mathematicalorcomputationalthing(X4)),inference(variable_rename,[status(thm)],[2461])).
% cnf(2463,plain,(mathematicalorcomputationalthing(X1)|~mathematicalthing(X1)),inference(split_conjunct,[status(thm)],[2462])).
% fof(2464, plain,![X3]:(~(inanimateobject_nonnatural(X3))|inanimateobject(X3)),inference(fof_nnf,[status(thm)],[630])).
% fof(2465, plain,![X4]:(~(inanimateobject_nonnatural(X4))|inanimateobject(X4)),inference(variable_rename,[status(thm)],[2464])).
% cnf(2466,plain,(inanimateobject(X1)|~inanimateobject_nonnatural(X1)),inference(split_conjunct,[status(thm)],[2465])).
% fof(3631, plain,![X3]:(~(inanimateobject(X3))|partiallytangible(X3)),inference(fof_nnf,[status(thm)],[1030])).
% fof(3632, plain,![X4]:(~(inanimateobject(X4))|partiallytangible(X4)),inference(variable_rename,[status(thm)],[3631])).
% cnf(3633,plain,(partiallytangible(X1)|~inanimateobject(X1)),inference(split_conjunct,[status(thm)],[3632])).
% cnf(3865,negated_conjecture,(disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949)),inference(split_conjunct,[status(thm)],[1137])).
% cnf(3894,negated_conjecture,(no(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949)),inference(spm,[status(thm)],[1153,3865,theory(equality)])).
% cnf(4339,plain,(mathematicalorcomputationalthing(X1)|~setorcollection(X1)),inference(spm,[status(thm)],[2463,1575,theory(equality)])).
% cnf(4364,plain,(inanimateobject(X1)|~artifact(X1)),inference(spm,[status(thm)],[2466,1646,theory(equality)])).
% cnf(6471,negated_conjecture,(setorcollection(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)))),inference(spm,[status(thm)],[1349,3894,theory(equality)])).
% cnf(7408,plain,(intangible(X1)|~setorcollection(X1)),inference(spm,[status(thm)],[1589,4339,theory(equality)])).
% cnf(7892,plain,(partiallytangible(X1)|~artifact(X1)),inference(spm,[status(thm)],[3633,4364,theory(equality)])).
% cnf(37457,plain,(~partiallytangible(X1)|~setorcollection(X1)),inference(spm,[status(thm)],[1484,7408,theory(equality)])).
% cnf(37561,plain,(partiallytangible(X1)|~computerdataartifact(X1)),inference(spm,[status(thm)],[7892,1322,theory(equality)])).
% cnf(37563,plain,(partiallytangible(f_urlreferentfn(X1))),inference(spm,[status(thm)],[37561,1163,theory(equality)])).
% cnf(37653,plain,(~setorcollection(f_urlreferentfn(X1))),inference(spm,[status(thm)],[37457,37563,theory(equality)])).
% cnf(37665,negated_conjecture,($false),inference(sr,[status(thm)],[6471,37653,theory(equality)])).
% cnf(37666,negated_conjecture,($false),37665,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5479
% # ...of these trivial : 665
% # ...subsumed : 248
% # ...remaining for further processing: 4566
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 28927
% # ...of the previous two non-trivial : 22404
% # Contextual simplify-reflections : 0
% # Paramodulations : 28926
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 4564
% # Positive orientable unit clauses: 2819
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 265
% # Non-unit-clauses : 1480
% # Current number of unprocessed clauses: 18056
% # ...number of literals in the above : 34109
% # Clause-clause subsumption calls (NU) : 661461
% # Rec. Clause-clause subsumption calls : 640322
% # Unit Clause-clause subsumption calls : 77711
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 4461 leaves, 1.02+/-0.239 terms/leaf
% # Paramod-from index: 3305 leaves, 1.00+/-0.046 terms/leaf
% # Paramod-into index: 4226 leaves, 1.02+/-0.203 terms/leaf
% # -------------------------------------------------
% # User time : 1.263 s
% # System time : 0.044 s
% # Total time : 1.307 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.82 CPU 1.91 WC
% FINAL PrfWatch: 1.82 CPU 1.91 WC
% SZS output end Solution for /tmp/SystemOnTPTP28350/CSR063+2.tptp
%
%------------------------------------------------------------------------------