TSTP Solution File: CSR048+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR048+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 : 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:38 EST 2010
% Result : Theorem 117.97s
% Output : Solution 117.97s
% 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/SystemOnTPTP21410/CSR048+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21410/CSR048+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21410/CSR048+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 21614
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.080 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', ax1_207)).
% fof(4, axiom,![X3]:![X4]:((mtvisible(X3)&genlmt(X3,X4))=>mtvisible(X4)),file('/tmp/SRASS.s.p', ax1_1123)).
% fof(16, axiom,genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt),file('/tmp/SRASS.s.p', ax1_140)).
% fof(1132, conjecture,?[X7]:(mtvisible(c_tptpgeo_spindlecollectormt)=>borderson(c_georegion_l4_x45_y9,X7)),file('/tmp/SRASS.s.p', query98)).
% fof(1133, negated_conjecture,~(?[X7]:(mtvisible(c_tptpgeo_spindlecollectormt)=>borderson(c_georegion_l4_x45_y9,X7))),inference(assume_negation,[status(cth)],[1132])).
% fof(1142, plain,(~(mtvisible(c_tptpgeo_member1_mt))|borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10)),inference(fof_nnf,[status(thm)],[3])).
% cnf(1143,plain,(borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10)|~mtvisible(c_tptpgeo_member1_mt)),inference(split_conjunct,[status(thm)],[1142])).
% fof(1144, plain,![X3]:![X4]:((~(mtvisible(X3))|~(genlmt(X3,X4)))|mtvisible(X4)),inference(fof_nnf,[status(thm)],[4])).
% fof(1145, plain,![X5]:![X6]:((~(mtvisible(X5))|~(genlmt(X5,X6)))|mtvisible(X6)),inference(variable_rename,[status(thm)],[1144])).
% cnf(1146,plain,(mtvisible(X1)|~genlmt(X2,X1)|~mtvisible(X2)),inference(split_conjunct,[status(thm)],[1145])).
% cnf(1168,plain,(genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt)),inference(split_conjunct,[status(thm)],[16])).
% fof(3864, negated_conjecture,![X7]:(mtvisible(c_tptpgeo_spindlecollectormt)&~(borderson(c_georegion_l4_x45_y9,X7))),inference(fof_nnf,[status(thm)],[1133])).
% fof(3865, negated_conjecture,![X8]:(mtvisible(c_tptpgeo_spindlecollectormt)&~(borderson(c_georegion_l4_x45_y9,X8))),inference(variable_rename,[status(thm)],[3864])).
% cnf(3866,negated_conjecture,(~borderson(c_georegion_l4_x45_y9,X1)),inference(split_conjunct,[status(thm)],[3865])).
% cnf(3867,negated_conjecture,(mtvisible(c_tptpgeo_spindlecollectormt)),inference(split_conjunct,[status(thm)],[3865])).
% cnf(3869,plain,(~mtvisible(c_tptpgeo_member1_mt)),inference(sr,[status(thm)],[1143,3866,theory(equality)])).
% cnf(3926,plain,(mtvisible(c_tptpgeo_member1_mt)|~mtvisible(c_tptpgeo_spindlecollectormt)),inference(spm,[status(thm)],[1146,1168,theory(equality)])).
% cnf(3946,plain,(mtvisible(c_tptpgeo_member1_mt)|$false),inference(rw,[status(thm)],[3926,3867,theory(equality)])).
% cnf(3947,plain,(mtvisible(c_tptpgeo_member1_mt)),inference(cn,[status(thm)],[3946,theory(equality)])).
% cnf(3948,plain,($false),inference(sr,[status(thm)],[3947,3869,theory(equality)])).
% cnf(3949,plain,($false),3948,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 130
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 130
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 63
% # ...of the previous two non-trivial : 41
% # Contextual simplify-reflections : 0
% # Paramodulations : 63
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 130
% # Positive orientable unit clauses: 86
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 40
% # Current number of unprocessed clauses: 1044
% # ...number of literals in the above : 1871
% # Clause-clause subsumption calls (NU) : 298
% # Rec. Clause-clause subsumption calls : 298
% # Unit Clause-clause subsumption calls : 42
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 237 leaves, 1.02+/-0.194 terms/leaf
% # Paramod-from index: 106 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 215 leaves, 1.01+/-0.152 terms/leaf
% # -------------------------------------------------
% # User time : 0.082 s
% # System time : 0.005 s
% # Total time : 0.087 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.32 WC
% FINAL PrfWatch: 0.24 CPU 0.32 WC
% SZS output end Solution for /tmp/SystemOnTPTP21410/CSR048+2.tptp
%
%------------------------------------------------------------------------------