TSTP Solution File: CSR056+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR056+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 : 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:21 EST 2010
% Result : Theorem 117.64s
% Output : Solution 117.64s
% 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/SystemOnTPTP22620/CSR056+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22620/CSR056+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22620/CSR056+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 22860
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.083 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', ax1_1123)).
% fof(5, axiom,(mtvisible(c_cyclistsmt)=>artsupplies(c_tptpartsupplies)),file('/tmp/SRASS.s.p', ax1_40)).
% fof(10, axiom,genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),file('/tmp/SRASS.s.p', ax1_279)).
% fof(18, axiom,![X4]:((mtvisible(c_tptp_spindleheadmt)&supplies(X4))=>tptpofobject(X4,f_tptpquantityfn_14(n_232))),file('/tmp/SRASS.s.p', ax1_202)).
% fof(21, axiom,genlmt(c_tptp_spindleheadmt,c_cyclistsmt),file('/tmp/SRASS.s.p', ax1_254)).
% fof(38, axiom,![X9]:(artsupplies(X9)=>supplies(X9)),file('/tmp/SRASS.s.p', ax1_238)).
% fof(1132, conjecture,?[X22]:(mtvisible(c_tptp_member3717_mt)=>tptpofobject(c_tptpartsupplies,X22)),file('/tmp/SRASS.s.p', query106)).
% fof(1133, negated_conjecture,~(?[X22]:(mtvisible(c_tptp_member3717_mt)=>tptpofobject(c_tptpartsupplies,X22))),inference(assume_negation,[status(cth)],[1132])).
% fof(1137, plain,![X1]:![X2]:((~(mtvisible(X1))|~(genlmt(X1,X2)))|mtvisible(X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(1138, plain,![X3]:![X4]:((~(mtvisible(X3))|~(genlmt(X3,X4)))|mtvisible(X4)),inference(variable_rename,[status(thm)],[1137])).
% cnf(1139,plain,(mtvisible(X1)|~genlmt(X2,X1)|~mtvisible(X2)),inference(split_conjunct,[status(thm)],[1138])).
% fof(1149, plain,(~(mtvisible(c_cyclistsmt))|artsupplies(c_tptpartsupplies)),inference(fof_nnf,[status(thm)],[5])).
% cnf(1150,plain,(artsupplies(c_tptpartsupplies)|~mtvisible(c_cyclistsmt)),inference(split_conjunct,[status(thm)],[1149])).
% cnf(1155,plain,(genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt)),inference(split_conjunct,[status(thm)],[10])).
% fof(1167, plain,![X4]:((~(mtvisible(c_tptp_spindleheadmt))|~(supplies(X4)))|tptpofobject(X4,f_tptpquantityfn_14(n_232))),inference(fof_nnf,[status(thm)],[18])).
% fof(1168, plain,![X5]:((~(mtvisible(c_tptp_spindleheadmt))|~(supplies(X5)))|tptpofobject(X5,f_tptpquantityfn_14(n_232))),inference(variable_rename,[status(thm)],[1167])).
% cnf(1169,plain,(tptpofobject(X1,f_tptpquantityfn_14(n_232))|~supplies(X1)|~mtvisible(c_tptp_spindleheadmt)),inference(split_conjunct,[status(thm)],[1168])).
% cnf(1172,plain,(genlmt(c_tptp_spindleheadmt,c_cyclistsmt)),inference(split_conjunct,[status(thm)],[21])).
% fof(1208, plain,![X9]:(~(artsupplies(X9))|supplies(X9)),inference(fof_nnf,[status(thm)],[38])).
% fof(1209, plain,![X10]:(~(artsupplies(X10))|supplies(X10)),inference(variable_rename,[status(thm)],[1208])).
% cnf(1210,plain,(supplies(X1)|~artsupplies(X1)),inference(split_conjunct,[status(thm)],[1209])).
% fof(3864, negated_conjecture,![X22]:(mtvisible(c_tptp_member3717_mt)&~(tptpofobject(c_tptpartsupplies,X22))),inference(fof_nnf,[status(thm)],[1133])).
% fof(3865, negated_conjecture,![X23]:(mtvisible(c_tptp_member3717_mt)&~(tptpofobject(c_tptpartsupplies,X23))),inference(variable_rename,[status(thm)],[3864])).
% cnf(3866,negated_conjecture,(~tptpofobject(c_tptpartsupplies,X1)),inference(split_conjunct,[status(thm)],[3865])).
% cnf(3867,negated_conjecture,(mtvisible(c_tptp_member3717_mt)),inference(split_conjunct,[status(thm)],[3865])).
% cnf(3868,plain,(supplies(c_tptpartsupplies)|~mtvisible(c_cyclistsmt)),inference(spm,[status(thm)],[1210,1150,theory(equality)])).
% cnf(3924,plain,(mtvisible(c_cyclistsmt)|~mtvisible(c_tptp_spindleheadmt)),inference(spm,[status(thm)],[1139,1172,theory(equality)])).
% cnf(3925,plain,(mtvisible(c_tptp_spindleheadmt)|~mtvisible(c_tptp_member3717_mt)),inference(spm,[status(thm)],[1139,1155,theory(equality)])).
% cnf(3941,plain,(mtvisible(c_tptp_spindleheadmt)|$false),inference(rw,[status(thm)],[3925,3867,theory(equality)])).
% cnf(3942,plain,(mtvisible(c_tptp_spindleheadmt)),inference(cn,[status(thm)],[3941,theory(equality)])).
% cnf(6366,plain,(tptpofobject(X1,f_tptpquantityfn_14(n_232))|~supplies(X1)|$false),inference(rw,[status(thm)],[1169,3942,theory(equality)])).
% cnf(6367,plain,(tptpofobject(X1,f_tptpquantityfn_14(n_232))|~supplies(X1)),inference(cn,[status(thm)],[6366,theory(equality)])).
% cnf(6412,negated_conjecture,(~supplies(c_tptpartsupplies)),inference(spm,[status(thm)],[3866,6367,theory(equality)])).
% cnf(6417,negated_conjecture,(~mtvisible(c_cyclistsmt)),inference(spm,[status(thm)],[6412,3868,theory(equality)])).
% cnf(6916,plain,(mtvisible(c_cyclistsmt)|$false),inference(rw,[status(thm)],[3924,3942,theory(equality)])).
% cnf(6917,plain,(mtvisible(c_cyclistsmt)),inference(cn,[status(thm)],[6916,theory(equality)])).
% cnf(6918,plain,($false),inference(sr,[status(thm)],[6917,6417,theory(equality)])).
% cnf(6919,plain,($false),6918,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1398
% # ...of these trivial : 95
% # ...subsumed : 33
% # ...remaining for further processing: 1270
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 2820
% # ...of the previous two non-trivial : 2447
% # Contextual simplify-reflections : 0
% # Paramodulations : 2820
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1264
% # Positive orientable unit clauses: 481
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 776
% # Current number of unprocessed clauses: 2170
% # ...number of literals in the above : 3826
% # Clause-clause subsumption calls (NU) : 324738
% # Rec. Clause-clause subsumption calls : 304061
% # Unit Clause-clause subsumption calls : 26374
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 1486 leaves, 1.07+/-0.411 terms/leaf
% # Paramod-from index: 754 leaves, 1.00+/-0.081 terms/leaf
% # Paramod-into index: 1251 leaves, 1.06+/-0.332 terms/leaf
% # -------------------------------------------------
% # User time : 0.254 s
% # System time : 0.009 s
% # Total time : 0.263 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.44 CPU 0.52 WC
% FINAL PrfWatch: 0.44 CPU 0.52 WC
% SZS output end Solution for /tmp/SystemOnTPTP22620/CSR056+2.tptp
%
%------------------------------------------------------------------------------