TSTP Solution File: CSR067+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR067+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 00:07:32 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP607/CSR067+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP607/CSR067+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP607/CSR067+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 740
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(borderson(X1,X2)=>borderson(X2,X1)),file('/tmp/SRASS.s.p', just28)).
% fof(3, axiom,(mtvisible(c_tptpgeo_member7_mt)=>borderson(c_georegion_l4_x29_y75,c_georegion_l4_x29_y76)),file('/tmp/SRASS.s.p', just1)).
% fof(30, conjecture,?[X3]:(mtvisible(c_tptpgeo_member7_mt)=>borderson(X3,c_georegion_l4_x29_y75)),file('/tmp/SRASS.s.p', query67)).
% fof(31, negated_conjecture,~(?[X3]:(mtvisible(c_tptpgeo_member7_mt)=>borderson(X3,c_georegion_l4_x29_y75))),inference(assume_negation,[status(cth)],[30])).
% fof(33, plain,![X1]:![X2]:(~(borderson(X1,X2))|borderson(X2,X1)),inference(fof_nnf,[status(thm)],[1])).
% fof(34, plain,![X3]:![X4]:(~(borderson(X3,X4))|borderson(X4,X3)),inference(variable_rename,[status(thm)],[33])).
% cnf(35,plain,(borderson(X1,X2)|~borderson(X2,X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(38, plain,(~(mtvisible(c_tptpgeo_member7_mt))|borderson(c_georegion_l4_x29_y75,c_georegion_l4_x29_y76)),inference(fof_nnf,[status(thm)],[3])).
% cnf(39,plain,(borderson(c_georegion_l4_x29_y75,c_georegion_l4_x29_y76)|~mtvisible(c_tptpgeo_member7_mt)),inference(split_conjunct,[status(thm)],[38])).
% fof(116, negated_conjecture,![X3]:(mtvisible(c_tptpgeo_member7_mt)&~(borderson(X3,c_georegion_l4_x29_y75))),inference(fof_nnf,[status(thm)],[31])).
% fof(117, negated_conjecture,![X4]:(mtvisible(c_tptpgeo_member7_mt)&~(borderson(X4,c_georegion_l4_x29_y75))),inference(variable_rename,[status(thm)],[116])).
% cnf(118,negated_conjecture,(~borderson(X1,c_georegion_l4_x29_y75)),inference(split_conjunct,[status(thm)],[117])).
% cnf(119,negated_conjecture,(mtvisible(c_tptpgeo_member7_mt)),inference(split_conjunct,[status(thm)],[117])).
% cnf(120,plain,(borderson(c_georegion_l4_x29_y75,c_georegion_l4_x29_y76)|$false),inference(rw,[status(thm)],[39,119,theory(equality)])).
% cnf(121,plain,(borderson(c_georegion_l4_x29_y75,c_georegion_l4_x29_y76)),inference(cn,[status(thm)],[120,theory(equality)])).
% cnf(122,plain,(borderson(c_georegion_l4_x29_y76,c_georegion_l4_x29_y75)),inference(spm,[status(thm)],[35,121,theory(equality)])).
% cnf(123,plain,($false),inference(sr,[status(thm)],[122,118,theory(equality)])).
% cnf(124,plain,($false),123,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 37
% # ...of these trivial : 0
% # ...subsumed : 5
% # ...remaining for further processing: 32
% # 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: 6
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 20
% # ...number of literals in the above : 48
% # Clause-clause subsumption calls (NU) : 21
% # Rec. Clause-clause subsumption calls : 21
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 10 leaves, 1.20+/-0.600 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 9 leaves, 1.11+/-0.314 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.003 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP607/CSR067+1.tptp
%
%------------------------------------------------------------------------------