TSTP Solution File: CSR073+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR073+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 : art01.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 : Wed Dec 29 00:12:53 EST 2010
% Result : Theorem 1.21s
% Output : Solution 1.21s
% 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/SystemOnTPTP20688/CSR073+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20688/CSR073+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20688/CSR073+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 20784
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.016 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', just59)).
% 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_tptp_member237_mt)=>tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258)),file('/tmp/SRASS.s.p', just18)).
% fof(9, axiom,genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),file('/tmp/SRASS.s.p', just15)).
% fof(17, axiom,![X3]:![X5]:(tptptypes_7_396(X3,X5)=>tptptypes_6_388(X3,X5)),file('/tmp/SRASS.s.p', just9)).
% fof(18, axiom,![X3]:![X5]:(tptptypes_9_401(X3,X5)=>tptptypes_8_400(X5,X3)),file('/tmp/SRASS.s.p', just13)).
% fof(39, axiom,![X3]:![X5]:(tptptypes_8_400(X3,X5)=>tptptypes_7_396(X3,X5)),file('/tmp/SRASS.s.p', just11)).
% fof(68, conjecture,?[X3]:(mtvisible(c_tptp_spindlecollectormt)=>tptptypes_5_387(X3,c_pushingababycarriage)),file('/tmp/SRASS.s.p', query73)).
% fof(69, negated_conjecture,~(?[X3]:(mtvisible(c_tptp_spindlecollectormt)=>tptptypes_5_387(X3,c_pushingababycarriage))),inference(assume_negation,[status(cth)],[68])).
% fof(70, plain,![X1]:![X2]:((~(mtvisible(X1))|~(genlmt(X1,X2)))|mtvisible(X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(71, plain,![X3]:![X4]:((~(mtvisible(X3))|~(genlmt(X3,X4)))|mtvisible(X4)),inference(variable_rename,[status(thm)],[70])).
% cnf(72,plain,(mtvisible(X1)|~genlmt(X2,X1)|~mtvisible(X2)),inference(split_conjunct,[status(thm)],[71])).
% fof(79, plain,![X3]:![X5]:(~(tptptypes_6_388(X3,X5))|tptptypes_5_387(X3,X5)),inference(fof_nnf,[status(thm)],[4])).
% fof(80, plain,![X6]:![X7]:(~(tptptypes_6_388(X6,X7))|tptptypes_5_387(X6,X7)),inference(variable_rename,[status(thm)],[79])).
% cnf(81,plain,(tptptypes_5_387(X1,X2)|~tptptypes_6_388(X1,X2)),inference(split_conjunct,[status(thm)],[80])).
% fof(87, plain,(~(mtvisible(c_tptp_member237_mt))|tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258)),inference(fof_nnf,[status(thm)],[8])).
% cnf(88,plain,(tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258)|~mtvisible(c_tptp_member237_mt)),inference(split_conjunct,[status(thm)],[87])).
% cnf(89,plain,(genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt)),inference(split_conjunct,[status(thm)],[9])).
% fof(107, plain,![X3]:![X5]:(~(tptptypes_7_396(X3,X5))|tptptypes_6_388(X3,X5)),inference(fof_nnf,[status(thm)],[17])).
% fof(108, plain,![X6]:![X7]:(~(tptptypes_7_396(X6,X7))|tptptypes_6_388(X6,X7)),inference(variable_rename,[status(thm)],[107])).
% cnf(109,plain,(tptptypes_6_388(X1,X2)|~tptptypes_7_396(X1,X2)),inference(split_conjunct,[status(thm)],[108])).
% fof(110, plain,![X3]:![X5]:(~(tptptypes_9_401(X3,X5))|tptptypes_8_400(X5,X3)),inference(fof_nnf,[status(thm)],[18])).
% fof(111, plain,![X6]:![X7]:(~(tptptypes_9_401(X6,X7))|tptptypes_8_400(X7,X6)),inference(variable_rename,[status(thm)],[110])).
% cnf(112,plain,(tptptypes_8_400(X1,X2)|~tptptypes_9_401(X2,X1)),inference(split_conjunct,[status(thm)],[111])).
% fof(169, plain,![X3]:![X5]:(~(tptptypes_8_400(X3,X5))|tptptypes_7_396(X3,X5)),inference(fof_nnf,[status(thm)],[39])).
% fof(170, plain,![X6]:![X7]:(~(tptptypes_8_400(X6,X7))|tptptypes_7_396(X6,X7)),inference(variable_rename,[status(thm)],[169])).
% cnf(171,plain,(tptptypes_7_396(X1,X2)|~tptptypes_8_400(X1,X2)),inference(split_conjunct,[status(thm)],[170])).
% fof(240, negated_conjecture,![X3]:(mtvisible(c_tptp_spindlecollectormt)&~(tptptypes_5_387(X3,c_pushingababycarriage))),inference(fof_nnf,[status(thm)],[69])).
% fof(241, negated_conjecture,![X4]:(mtvisible(c_tptp_spindlecollectormt)&~(tptptypes_5_387(X4,c_pushingababycarriage))),inference(variable_rename,[status(thm)],[240])).
% cnf(242,negated_conjecture,(~tptptypes_5_387(X1,c_pushingababycarriage)),inference(split_conjunct,[status(thm)],[241])).
% cnf(243,negated_conjecture,(mtvisible(c_tptp_spindlecollectormt)),inference(split_conjunct,[status(thm)],[241])).
% cnf(251,plain,(mtvisible(c_tptp_member237_mt)|~mtvisible(c_tptp_spindlecollectormt)),inference(spm,[status(thm)],[72,89,theory(equality)])).
% cnf(256,plain,(mtvisible(c_tptp_member237_mt)|$false),inference(rw,[status(thm)],[251,243,theory(equality)])).
% cnf(257,plain,(mtvisible(c_tptp_member237_mt)),inference(cn,[status(thm)],[256,theory(equality)])).
% cnf(292,plain,(tptptypes_7_396(X1,X2)|~tptptypes_9_401(X2,X1)),inference(spm,[status(thm)],[171,112,theory(equality)])).
% cnf(311,plain,(tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258)|$false),inference(rw,[status(thm)],[88,257,theory(equality)])).
% cnf(312,plain,(tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258)),inference(cn,[status(thm)],[311,theory(equality)])).
% cnf(375,plain,(tptptypes_6_388(X1,X2)|~tptptypes_9_401(X2,X1)),inference(spm,[status(thm)],[109,292,theory(equality)])).
% cnf(472,plain,(tptptypes_6_388(c_tptpcol_16_10258,c_pushingababycarriage)),inference(spm,[status(thm)],[375,312,theory(equality)])).
% cnf(481,plain,(tptptypes_5_387(c_tptpcol_16_10258,c_pushingababycarriage)),inference(spm,[status(thm)],[81,472,theory(equality)])).
% cnf(484,plain,($false),inference(sr,[status(thm)],[481,242,theory(equality)])).
% cnf(485,plain,($false),484,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 133
% # ...of these trivial : 9
% # ...subsumed : 14
% # ...remaining for further processing: 110
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 152
% # ...of the previous two non-trivial : 86
% # Contextual simplify-reflections : 0
% # Paramodulations : 152
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 106
% # Positive orientable unit clauses: 57
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 48
% # Current number of unprocessed clauses: 19
% # ...number of literals in the above : 41
% # Clause-clause subsumption calls (NU) : 85
% # Rec. Clause-clause subsumption calls : 71
% # Unit Clause-clause subsumption calls : 17
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 106 leaves, 1.25+/-0.810 terms/leaf
% # Paramod-from index: 65 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 95 leaves, 1.17+/-0.516 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.005 s
% # Total time : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP20688/CSR073+1.tptp
%
%------------------------------------------------------------------------------