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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : CSR062+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 : art09.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:53:16 EST 2010

% Result   : Theorem 1.00s
% Output   : Solution 1.00s
% 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/SystemOnTPTP22103/CSR062+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP22103/CSR062+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22103/CSR062+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 22199
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:((mtvisible(X1)&genlmt(X1,X2))=>mtvisible(X2)),file('/tmp/SRASS.s.p', just53)).
% fof(4, axiom,![X3]:![X5]:(tptptypes_6_388(X3,X5)=>tptptypes_5_387(X3,X5)),file('/tmp/SRASS.s.p', just7)).
% fof(8, axiom,(mtvisible(c_cyclistsmt)=>tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)),file('/tmp/SRASS.s.p', just14)).
% fof(9, axiom,genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),file('/tmp/SRASS.s.p', just13)).
% fof(13, axiom,genlmt(c_tptp_spindleheadmt,c_cyclistsmt),file('/tmp/SRASS.s.p', just12)).
% fof(16, axiom,![X3]:![X5]:(tptptypes_7_389(X3,X5)=>tptptypes_6_388(X5,X3)),file('/tmp/SRASS.s.p', just9)).
% fof(17, axiom,![X3]:![X5]:(tptptypes_8_390(X3,X5)=>tptptypes_7_389(X3,X5)),file('/tmp/SRASS.s.p', just11)).
% fof(62, conjecture,?[X3]:(mtvisible(c_tptp_member3205_mt)=>tptptypes_5_387(X3,c_pushingwithfingers)),file('/tmp/SRASS.s.p', query62)).
% fof(63, negated_conjecture,~(?[X3]:(mtvisible(c_tptp_member3205_mt)=>tptptypes_5_387(X3,c_pushingwithfingers))),inference(assume_negation,[status(cth)],[62])).
% fof(64, plain,![X1]:![X2]:((~(mtvisible(X1))|~(genlmt(X1,X2)))|mtvisible(X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(65, plain,![X3]:![X4]:((~(mtvisible(X3))|~(genlmt(X3,X4)))|mtvisible(X4)),inference(variable_rename,[status(thm)],[64])).
% cnf(66,plain,(mtvisible(X1)|~genlmt(X2,X1)|~mtvisible(X2)),inference(split_conjunct,[status(thm)],[65])).
% fof(73, plain,![X3]:![X5]:(~(tptptypes_6_388(X3,X5))|tptptypes_5_387(X3,X5)),inference(fof_nnf,[status(thm)],[4])).
% fof(74, plain,![X6]:![X7]:(~(tptptypes_6_388(X6,X7))|tptptypes_5_387(X6,X7)),inference(variable_rename,[status(thm)],[73])).
% cnf(75,plain,(tptptypes_5_387(X1,X2)|~tptptypes_6_388(X1,X2)),inference(split_conjunct,[status(thm)],[74])).
% fof(81, plain,(~(mtvisible(c_cyclistsmt))|tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)),inference(fof_nnf,[status(thm)],[8])).
% cnf(82,plain,(tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)|~mtvisible(c_cyclistsmt)),inference(split_conjunct,[status(thm)],[81])).
% cnf(83,plain,(genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt)),inference(split_conjunct,[status(thm)],[9])).
% cnf(93,plain,(genlmt(c_tptp_spindleheadmt,c_cyclistsmt)),inference(split_conjunct,[status(thm)],[13])).
% fof(100, plain,![X3]:![X5]:(~(tptptypes_7_389(X3,X5))|tptptypes_6_388(X5,X3)),inference(fof_nnf,[status(thm)],[16])).
% fof(101, plain,![X6]:![X7]:(~(tptptypes_7_389(X6,X7))|tptptypes_6_388(X7,X6)),inference(variable_rename,[status(thm)],[100])).
% cnf(102,plain,(tptptypes_6_388(X1,X2)|~tptptypes_7_389(X2,X1)),inference(split_conjunct,[status(thm)],[101])).
% fof(103, plain,![X3]:![X5]:(~(tptptypes_8_390(X3,X5))|tptptypes_7_389(X3,X5)),inference(fof_nnf,[status(thm)],[17])).
% fof(104, plain,![X6]:![X7]:(~(tptptypes_8_390(X6,X7))|tptptypes_7_389(X6,X7)),inference(variable_rename,[status(thm)],[103])).
% cnf(105,plain,(tptptypes_7_389(X1,X2)|~tptptypes_8_390(X1,X2)),inference(split_conjunct,[status(thm)],[104])).
% fof(222, negated_conjecture,![X3]:(mtvisible(c_tptp_member3205_mt)&~(tptptypes_5_387(X3,c_pushingwithfingers))),inference(fof_nnf,[status(thm)],[63])).
% fof(223, negated_conjecture,![X4]:(mtvisible(c_tptp_member3205_mt)&~(tptptypes_5_387(X4,c_pushingwithfingers))),inference(variable_rename,[status(thm)],[222])).
% cnf(224,negated_conjecture,(~tptptypes_5_387(X1,c_pushingwithfingers)),inference(split_conjunct,[status(thm)],[223])).
% cnf(225,negated_conjecture,(mtvisible(c_tptp_member3205_mt)),inference(split_conjunct,[status(thm)],[223])).
% cnf(229,plain,(mtvisible(c_cyclistsmt)|~mtvisible(c_tptp_spindleheadmt)),inference(spm,[status(thm)],[66,93,theory(equality)])).
% cnf(230,plain,(mtvisible(c_tptp_spindleheadmt)|~mtvisible(c_tptp_member3205_mt)),inference(spm,[status(thm)],[66,83,theory(equality)])).
% cnf(234,plain,(mtvisible(c_tptp_spindleheadmt)|$false),inference(rw,[status(thm)],[230,225,theory(equality)])).
% cnf(235,plain,(mtvisible(c_tptp_spindleheadmt)),inference(cn,[status(thm)],[234,theory(equality)])).
% cnf(263,plain,(tptptypes_6_388(X1,X2)|~tptptypes_8_390(X2,X1)),inference(spm,[status(thm)],[102,105,theory(equality)])).
% cnf(303,plain,(mtvisible(c_cyclistsmt)|$false),inference(rw,[status(thm)],[229,235,theory(equality)])).
% cnf(304,plain,(mtvisible(c_cyclistsmt)),inference(cn,[status(thm)],[303,theory(equality)])).
% cnf(305,plain,(tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)|$false),inference(rw,[status(thm)],[82,304,theory(equality)])).
% cnf(306,plain,(tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)),inference(cn,[status(thm)],[305,theory(equality)])).
% cnf(403,plain,(tptptypes_6_388(c_tptpcol_15_4027,c_pushingwithfingers)),inference(spm,[status(thm)],[263,306,theory(equality)])).
% cnf(406,plain,(tptptypes_5_387(c_tptpcol_15_4027,c_pushingwithfingers)),inference(spm,[status(thm)],[75,403,theory(equality)])).
% cnf(409,plain,($false),inference(sr,[status(thm)],[406,224,theory(equality)])).
% cnf(410,plain,($false),409,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 109
% # ...of these trivial                : 5
% # ...subsumed                        : 11
% # ...remaining for further processing: 93
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 2
% # Generated clauses                  : 117
% # ...of the previous two non-trivial : 61
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 117
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 91
% #    Positive orientable unit clauses: 48
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 42
% # Current number of unprocessed clauses: 13
% # ...number of literals in the above : 27
% # Clause-clause subsumption calls (NU) : 41
% # Rec. Clause-clause subsumption calls : 37
% # Unit Clause-clause subsumption calls : 18
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 2
% # Indexed BW rewrite successes       : 2
% # Backwards rewriting index:    90 leaves,   1.28+/-0.870 terms/leaf
% # Paramod-from index:           53 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           80 leaves,   1.19+/-0.550 terms/leaf
% # -------------------------------------------------
% # User time              : 0.018 s
% # System time            : 0.003 s
% # Total time             : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.19 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP22103/CSR062+1.tptp
% 
%------------------------------------------------------------------------------