TSTP Solution File: CSR056+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR056+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 : art06.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:41:07 EST 2010
% Result : Theorem 1.03s
% Output : Solution 1.03s
% 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/SystemOnTPTP22361/CSR056+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22361/CSR056+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22361/CSR056+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 22457
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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', just47)).
% fof(2, axiom,(mtvisible(c_cyclistsmt)=>artsupplies(c_tptpartsupplies)),file('/tmp/SRASS.s.p', just12)).
% fof(8, axiom,genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),file('/tmp/SRASS.s.p', just9)).
% fof(9, axiom,![X4]:((mtvisible(c_tptp_spindleheadmt)&supplies(X4))=>tptpofobject(X4,f_tptpquantityfn_14(n_232))),file('/tmp/SRASS.s.p', just10)).
% fof(10, axiom,genlmt(c_tptp_spindleheadmt,c_cyclistsmt),file('/tmp/SRASS.s.p', just8)).
% fof(13, axiom,![X9]:(artsupplies(X9)=>supplies(X9)),file('/tmp/SRASS.s.p', just2)).
% fof(69, conjecture,?[X18]:(mtvisible(c_tptp_member3717_mt)=>tptpofobject(c_tptpartsupplies,X18)),file('/tmp/SRASS.s.p', query56)).
% fof(70, negated_conjecture,~(?[X18]:(mtvisible(c_tptp_member3717_mt)=>tptpofobject(c_tptpartsupplies,X18))),inference(assume_negation,[status(cth)],[69])).
% fof(71, plain,![X1]:![X2]:((~(mtvisible(X1))|~(genlmt(X1,X2)))|mtvisible(X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(72, plain,![X3]:![X4]:((~(mtvisible(X3))|~(genlmt(X3,X4)))|mtvisible(X4)),inference(variable_rename,[status(thm)],[71])).
% cnf(73,plain,(mtvisible(X1)|~genlmt(X2,X1)|~mtvisible(X2)),inference(split_conjunct,[status(thm)],[72])).
% fof(74, plain,(~(mtvisible(c_cyclistsmt))|artsupplies(c_tptpartsupplies)),inference(fof_nnf,[status(thm)],[2])).
% cnf(75,plain,(artsupplies(c_tptpartsupplies)|~mtvisible(c_cyclistsmt)),inference(split_conjunct,[status(thm)],[74])).
% cnf(87,plain,(genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt)),inference(split_conjunct,[status(thm)],[8])).
% fof(88, plain,![X4]:((~(mtvisible(c_tptp_spindleheadmt))|~(supplies(X4)))|tptpofobject(X4,f_tptpquantityfn_14(n_232))),inference(fof_nnf,[status(thm)],[9])).
% fof(89, plain,![X5]:((~(mtvisible(c_tptp_spindleheadmt))|~(supplies(X5)))|tptpofobject(X5,f_tptpquantityfn_14(n_232))),inference(variable_rename,[status(thm)],[88])).
% cnf(90,plain,(tptpofobject(X1,f_tptpquantityfn_14(n_232))|~supplies(X1)|~mtvisible(c_tptp_spindleheadmt)),inference(split_conjunct,[status(thm)],[89])).
% cnf(91,plain,(genlmt(c_tptp_spindleheadmt,c_cyclistsmt)),inference(split_conjunct,[status(thm)],[10])).
% fof(96, plain,![X9]:(~(artsupplies(X9))|supplies(X9)),inference(fof_nnf,[status(thm)],[13])).
% fof(97, plain,![X10]:(~(artsupplies(X10))|supplies(X10)),inference(variable_rename,[status(thm)],[96])).
% cnf(98,plain,(supplies(X1)|~artsupplies(X1)),inference(split_conjunct,[status(thm)],[97])).
% fof(250, negated_conjecture,![X18]:(mtvisible(c_tptp_member3717_mt)&~(tptpofobject(c_tptpartsupplies,X18))),inference(fof_nnf,[status(thm)],[70])).
% fof(251, negated_conjecture,![X19]:(mtvisible(c_tptp_member3717_mt)&~(tptpofobject(c_tptpartsupplies,X19))),inference(variable_rename,[status(thm)],[250])).
% cnf(252,negated_conjecture,(~tptpofobject(c_tptpartsupplies,X1)),inference(split_conjunct,[status(thm)],[251])).
% cnf(253,negated_conjecture,(mtvisible(c_tptp_member3717_mt)),inference(split_conjunct,[status(thm)],[251])).
% cnf(258,plain,(mtvisible(c_cyclistsmt)|~mtvisible(c_tptp_spindleheadmt)),inference(spm,[status(thm)],[73,91,theory(equality)])).
% cnf(259,plain,(mtvisible(c_tptp_spindleheadmt)|~mtvisible(c_tptp_member3717_mt)),inference(spm,[status(thm)],[73,87,theory(equality)])).
% cnf(263,plain,(mtvisible(c_tptp_spindleheadmt)|$false),inference(rw,[status(thm)],[259,253,theory(equality)])).
% cnf(264,plain,(mtvisible(c_tptp_spindleheadmt)),inference(cn,[status(thm)],[263,theory(equality)])).
% cnf(284,negated_conjecture,(~supplies(c_tptpartsupplies)|~mtvisible(c_tptp_spindleheadmt)),inference(spm,[status(thm)],[252,90,theory(equality)])).
% cnf(307,negated_conjecture,(~supplies(c_tptpartsupplies)|$false),inference(rw,[status(thm)],[284,264,theory(equality)])).
% cnf(308,negated_conjecture,(~supplies(c_tptpartsupplies)),inference(cn,[status(thm)],[307,theory(equality)])).
% cnf(314,plain,(mtvisible(c_cyclistsmt)|$false),inference(rw,[status(thm)],[258,264,theory(equality)])).
% cnf(315,plain,(mtvisible(c_cyclistsmt)),inference(cn,[status(thm)],[314,theory(equality)])).
% cnf(316,plain,(artsupplies(c_tptpartsupplies)|$false),inference(rw,[status(thm)],[75,315,theory(equality)])).
% cnf(317,plain,(artsupplies(c_tptpartsupplies)),inference(cn,[status(thm)],[316,theory(equality)])).
% cnf(328,plain,(supplies(c_tptpartsupplies)),inference(spm,[status(thm)],[98,317,theory(equality)])).
% cnf(330,plain,($false),inference(sr,[status(thm)],[328,308,theory(equality)])).
% cnf(331,plain,($false),330,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 138
% # ...of these trivial : 0
% # ...subsumed : 14
% # ...remaining for further processing: 124
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 52
% # ...of the previous two non-trivial : 45
% # Contextual simplify-reflections : 0
% # Paramodulations : 52
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 62
% # Positive orientable unit clauses: 19
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 40
% # Current number of unprocessed clauses: 28
% # ...number of literals in the above : 41
% # Clause-clause subsumption calls (NU) : 51
% # Rec. Clause-clause subsumption calls : 51
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 62 leaves, 1.40+/-1.099 terms/leaf
% # Paramod-from index: 23 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 51 leaves, 1.31+/-0.828 terms/leaf
% # -------------------------------------------------
% # User time : 0.021 s
% # System time : 0.002 s
% # Total time : 0.023 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/SystemOnTPTP22361/CSR056+1.tptp
%
%------------------------------------------------------------------------------