↑ Up

SRASS---0.1.THM-Sol.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : CSR062+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 : 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:28 EST 2010

% Result   : Theorem 117.35s
% Output   : Solution 117.35s
% 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/SystemOnTPTP22362/CSR062+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP22362/CSR062+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22362/CSR062+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 22566
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.081 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X4]:![X5]:((mtvisible(X4)&genlmt(X4,X5))=>mtvisible(X5)),file('/tmp/SRASS.s.p', ax1_1123)).
% fof(4, axiom,![X1]:![X3]:(tptptypes_6_388(X1,X3)=>tptptypes_5_387(X1,X3)),file('/tmp/SRASS.s.p', ax1_99)).
% fof(14, axiom,(mtvisible(c_cyclistsmt)=>tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)),file('/tmp/SRASS.s.p', ax1_460)).
% fof(17, axiom,genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),file('/tmp/SRASS.s.p', ax1_34)).
% fof(24, axiom,genlmt(c_tptp_spindleheadmt,c_cyclistsmt),file('/tmp/SRASS.s.p', ax1_254)).
% fof(35, axiom,![X1]:![X3]:(tptptypes_8_390(X1,X3)=>tptptypes_7_389(X1,X3)),file('/tmp/SRASS.s.p', ax1_61)).
% fof(40, axiom,![X1]:![X3]:(tptptypes_7_389(X1,X3)=>tptptypes_6_388(X3,X1)),file('/tmp/SRASS.s.p', ax1_302)).
% fof(1132, conjecture,?[X1]:(mtvisible(c_tptp_member3205_mt)=>tptptypes_5_387(X1,c_pushingwithfingers)),file('/tmp/SRASS.s.p', query112)).
% fof(1133, negated_conjecture,~(?[X1]:(mtvisible(c_tptp_member3205_mt)=>tptptypes_5_387(X1,c_pushingwithfingers))),inference(assume_negation,[status(cth)],[1132])).
% fof(1143, plain,![X4]:![X5]:((~(mtvisible(X4))|~(genlmt(X4,X5)))|mtvisible(X5)),inference(fof_nnf,[status(thm)],[3])).
% fof(1144, plain,![X6]:![X7]:((~(mtvisible(X6))|~(genlmt(X6,X7)))|mtvisible(X7)),inference(variable_rename,[status(thm)],[1143])).
% cnf(1145,plain,(mtvisible(X1)|~genlmt(X2,X1)|~mtvisible(X2)),inference(split_conjunct,[status(thm)],[1144])).
% fof(1146, plain,![X1]:![X3]:(~(tptptypes_6_388(X1,X3))|tptptypes_5_387(X1,X3)),inference(fof_nnf,[status(thm)],[4])).
% fof(1147, plain,![X4]:![X5]:(~(tptptypes_6_388(X4,X5))|tptptypes_5_387(X4,X5)),inference(variable_rename,[status(thm)],[1146])).
% cnf(1148,plain,(tptptypes_5_387(X1,X2)|~tptptypes_6_388(X1,X2)),inference(split_conjunct,[status(thm)],[1147])).
% fof(1167, plain,(~(mtvisible(c_cyclistsmt))|tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)),inference(fof_nnf,[status(thm)],[14])).
% cnf(1168,plain,(tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)|~mtvisible(c_cyclistsmt)),inference(split_conjunct,[status(thm)],[1167])).
% cnf(1175,plain,(genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt)),inference(split_conjunct,[status(thm)],[17])).
% cnf(1182,plain,(genlmt(c_tptp_spindleheadmt,c_cyclistsmt)),inference(split_conjunct,[status(thm)],[24])).
% fof(1203, plain,![X1]:![X3]:(~(tptptypes_8_390(X1,X3))|tptptypes_7_389(X1,X3)),inference(fof_nnf,[status(thm)],[35])).
% fof(1204, plain,![X4]:![X5]:(~(tptptypes_8_390(X4,X5))|tptptypes_7_389(X4,X5)),inference(variable_rename,[status(thm)],[1203])).
% cnf(1205,plain,(tptptypes_7_389(X1,X2)|~tptptypes_8_390(X1,X2)),inference(split_conjunct,[status(thm)],[1204])).
% fof(1217, plain,![X1]:![X3]:(~(tptptypes_7_389(X1,X3))|tptptypes_6_388(X3,X1)),inference(fof_nnf,[status(thm)],[40])).
% fof(1218, plain,![X4]:![X5]:(~(tptptypes_7_389(X4,X5))|tptptypes_6_388(X5,X4)),inference(variable_rename,[status(thm)],[1217])).
% cnf(1219,plain,(tptptypes_6_388(X1,X2)|~tptptypes_7_389(X2,X1)),inference(split_conjunct,[status(thm)],[1218])).
% fof(3864, negated_conjecture,![X1]:(mtvisible(c_tptp_member3205_mt)&~(tptptypes_5_387(X1,c_pushingwithfingers))),inference(fof_nnf,[status(thm)],[1133])).
% fof(3865, negated_conjecture,![X2]:(mtvisible(c_tptp_member3205_mt)&~(tptptypes_5_387(X2,c_pushingwithfingers))),inference(variable_rename,[status(thm)],[3864])).
% cnf(3866,negated_conjecture,(~tptptypes_5_387(X1,c_pushingwithfingers)),inference(split_conjunct,[status(thm)],[3865])).
% cnf(3867,negated_conjecture,(mtvisible(c_tptp_member3205_mt)),inference(split_conjunct,[status(thm)],[3865])).
% cnf(3868,negated_conjecture,(~tptptypes_6_388(X1,c_pushingwithfingers)),inference(spm,[status(thm)],[3866,1148,theory(equality)])).
% cnf(3925,plain,(mtvisible(c_cyclistsmt)|~mtvisible(c_tptp_spindleheadmt)),inference(spm,[status(thm)],[1145,1182,theory(equality)])).
% cnf(3926,plain,(mtvisible(c_tptp_spindleheadmt)|~mtvisible(c_tptp_member3205_mt)),inference(spm,[status(thm)],[1145,1175,theory(equality)])).
% cnf(3942,plain,(mtvisible(c_tptp_spindleheadmt)|$false),inference(rw,[status(thm)],[3926,3867,theory(equality)])).
% cnf(3943,plain,(mtvisible(c_tptp_spindleheadmt)),inference(cn,[status(thm)],[3942,theory(equality)])).
% cnf(6924,plain,(mtvisible(c_cyclistsmt)|$false),inference(rw,[status(thm)],[3925,3943,theory(equality)])).
% cnf(6925,plain,(mtvisible(c_cyclistsmt)),inference(cn,[status(thm)],[6924,theory(equality)])).
% cnf(6936,plain,(tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)|$false),inference(rw,[status(thm)],[1168,6925,theory(equality)])).
% cnf(6937,plain,(tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)),inference(cn,[status(thm)],[6936,theory(equality)])).
% cnf(7020,plain,(tptptypes_7_389(c_pushingwithfingers,c_tptpcol_15_4027)),inference(spm,[status(thm)],[1205,6937,theory(equality)])).
% cnf(7024,plain,(tptptypes_6_388(c_tptpcol_15_4027,c_pushingwithfingers)),inference(spm,[status(thm)],[1219,7020,theory(equality)])).
% cnf(7027,plain,($false),inference(sr,[status(thm)],[7024,3868,theory(equality)])).
% cnf(7028,plain,($false),7027,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 1431
% # ...of these trivial                : 90
% # ...subsumed                        : 33
% # ...remaining for further processing: 1308
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 14
% # Generated clauses                  : 2901
% # ...of the previous two non-trivial : 2495
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 2901
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 1294
% #    Positive orientable unit clauses: 521
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 5
% #    Non-unit-clauses                : 768
% # Current number of unprocessed clauses: 2176
% # ...number of literals in the above : 3809
% # Clause-clause subsumption calls (NU) : 244034
% # Rec. Clause-clause subsumption calls : 232310
% # Unit Clause-clause subsumption calls : 13045
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 5
% # Indexed BW rewrite successes       : 2
% # Backwards rewriting index:  1518 leaves,   1.07+/-0.419 terms/leaf
% # Paramod-from index:          783 leaves,   1.00+/-0.080 terms/leaf
% # Paramod-into index:         1283 leaves,   1.06+/-0.328 terms/leaf
% # -------------------------------------------------
% # User time              : 0.239 s
% # System time            : 0.015 s
% # Total time             : 0.254 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/SystemOnTPTP22362/CSR062+2.tptp
% 
%------------------------------------------------------------------------------