TSTP Solution File: CSR048+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR048+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 : 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 : Tue Dec 28 23:26:32 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP21151/CSR048+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21151/CSR048+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21151/CSR048+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 21247
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,(mtvisible(c_tptpgeo_member1_mt)=>borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10)),file('/tmp/SRASS.s.p', just2)).
% fof(4, axiom,![X3]:![X4]:((mtvisible(X3)&genlmt(X3,X4))=>mtvisible(X4)),file('/tmp/SRASS.s.p', just31)).
% fof(10, axiom,genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt),file('/tmp/SRASS.s.p', just1)).
% fof(40, conjecture,?[X8]:(mtvisible(c_tptpgeo_spindlecollectormt)=>borderson(c_georegion_l4_x45_y9,X8)),file('/tmp/SRASS.s.p', query48)).
% fof(41, negated_conjecture,~(?[X8]:(mtvisible(c_tptpgeo_spindlecollectormt)=>borderson(c_georegion_l4_x45_y9,X8))),inference(assume_negation,[status(cth)],[40])).
% fof(48, plain,(~(mtvisible(c_tptpgeo_member1_mt))|borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10)),inference(fof_nnf,[status(thm)],[3])).
% cnf(49,plain,(borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10)|~mtvisible(c_tptpgeo_member1_mt)),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X3]:![X4]:((~(mtvisible(X3))|~(genlmt(X3,X4)))|mtvisible(X4)),inference(fof_nnf,[status(thm)],[4])).
% fof(51, plain,![X5]:![X6]:((~(mtvisible(X5))|~(genlmt(X5,X6)))|mtvisible(X6)),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(mtvisible(X1)|~genlmt(X2,X1)|~mtvisible(X2)),inference(split_conjunct,[status(thm)],[51])).
% cnf(64,plain,(genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt)),inference(split_conjunct,[status(thm)],[10])).
% fof(152, negated_conjecture,![X8]:(mtvisible(c_tptpgeo_spindlecollectormt)&~(borderson(c_georegion_l4_x45_y9,X8))),inference(fof_nnf,[status(thm)],[41])).
% fof(153, negated_conjecture,![X9]:(mtvisible(c_tptpgeo_spindlecollectormt)&~(borderson(c_georegion_l4_x45_y9,X9))),inference(variable_rename,[status(thm)],[152])).
% cnf(154,negated_conjecture,(~borderson(c_georegion_l4_x45_y9,X1)),inference(split_conjunct,[status(thm)],[153])).
% cnf(155,negated_conjecture,(mtvisible(c_tptpgeo_spindlecollectormt)),inference(split_conjunct,[status(thm)],[153])).
% cnf(156,plain,(~mtvisible(c_tptpgeo_member1_mt)),inference(sr,[status(thm)],[49,154,theory(equality)])).
% cnf(157,plain,(mtvisible(c_tptpgeo_member1_mt)|~mtvisible(c_tptpgeo_spindlecollectormt)),inference(spm,[status(thm)],[52,64,theory(equality)])).
% cnf(158,plain,(mtvisible(c_tptpgeo_member1_mt)|$false),inference(rw,[status(thm)],[157,155,theory(equality)])).
% cnf(159,plain,(mtvisible(c_tptpgeo_member1_mt)),inference(cn,[status(thm)],[158,theory(equality)])).
% cnf(160,plain,($false),inference(sr,[status(thm)],[159,156,theory(equality)])).
% cnf(161,plain,($false),160,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 52
% # ...of these trivial : 0
% # ...subsumed : 8
% # ...remaining for further processing: 44
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 1
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 11
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 22
% # ...number of literals in the above : 53
% # Clause-clause subsumption calls (NU) : 28
% # Rec. Clause-clause subsumption calls : 28
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 16 leaves, 1.19+/-0.527 terms/leaf
% # Paramod-from index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 13 leaves, 1.15+/-0.533 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.004 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP21151/CSR048+1.tptp
%
%------------------------------------------------------------------------------