TSTP Solution File: CSR030+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR030+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 22:54:52 EST 2010
% Result : Theorem 117.25s
% Output : Solution 117.25s
% 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/SystemOnTPTP16008/CSR030+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16008/CSR030+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16008/CSR030+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 16320
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.082 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_tptp_spindleheadmt)=>tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)),file('/tmp/SRASS.s.p', ax1_451)).
% fof(17, axiom,genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),file('/tmp/SRASS.s.p', ax1_133)).
% fof(37, axiom,![X1]:![X3]:(tptptypes_7_389(X1,X3)=>tptptypes_6_388(X3,X1)),file('/tmp/SRASS.s.p', ax1_302)).
% fof(1132, conjecture,?[X3]:(mtvisible(c_tptp_member3393_mt)=>tptptypes_5_387(X3,c_pushingwithopenhand)),file('/tmp/SRASS.s.p', query80)).
% fof(1133, negated_conjecture,~(?[X3]:(mtvisible(c_tptp_member3393_mt)=>tptptypes_5_387(X3,c_pushingwithopenhand))),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_tptp_spindleheadmt))|tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)),inference(fof_nnf,[status(thm)],[14])).
% cnf(1168,plain,(tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)|~mtvisible(c_tptp_spindleheadmt)),inference(split_conjunct,[status(thm)],[1167])).
% cnf(1175,plain,(genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt)),inference(split_conjunct,[status(thm)],[17])).
% fof(1211, plain,![X1]:![X3]:(~(tptptypes_7_389(X1,X3))|tptptypes_6_388(X3,X1)),inference(fof_nnf,[status(thm)],[37])).
% fof(1212, plain,![X4]:![X5]:(~(tptptypes_7_389(X4,X5))|tptptypes_6_388(X5,X4)),inference(variable_rename,[status(thm)],[1211])).
% cnf(1213,plain,(tptptypes_6_388(X1,X2)|~tptptypes_7_389(X2,X1)),inference(split_conjunct,[status(thm)],[1212])).
% fof(3864, negated_conjecture,![X3]:(mtvisible(c_tptp_member3393_mt)&~(tptptypes_5_387(X3,c_pushingwithopenhand))),inference(fof_nnf,[status(thm)],[1133])).
% fof(3865, negated_conjecture,![X4]:(mtvisible(c_tptp_member3393_mt)&~(tptptypes_5_387(X4,c_pushingwithopenhand))),inference(variable_rename,[status(thm)],[3864])).
% cnf(3866,negated_conjecture,(~tptptypes_5_387(X1,c_pushingwithopenhand)),inference(split_conjunct,[status(thm)],[3865])).
% cnf(3867,negated_conjecture,(mtvisible(c_tptp_member3393_mt)),inference(split_conjunct,[status(thm)],[3865])).
% cnf(3868,negated_conjecture,(~tptptypes_6_388(X1,c_pushingwithopenhand)),inference(spm,[status(thm)],[3866,1148,theory(equality)])).
% cnf(3928,plain,(mtvisible(c_tptp_spindleheadmt)|~mtvisible(c_tptp_member3393_mt)),inference(spm,[status(thm)],[1145,1175,theory(equality)])).
% cnf(3942,plain,(mtvisible(c_tptp_spindleheadmt)|$false),inference(rw,[status(thm)],[3928,3867,theory(equality)])).
% cnf(3943,plain,(mtvisible(c_tptp_spindleheadmt)),inference(cn,[status(thm)],[3942,theory(equality)])).
% cnf(6363,plain,(tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)|$false),inference(rw,[status(thm)],[1168,3943,theory(equality)])).
% cnf(6364,plain,(tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)),inference(cn,[status(thm)],[6363,theory(equality)])).
% cnf(6425,plain,(tptptypes_6_388(c_tptpcol_16_4451,c_pushingwithopenhand)),inference(spm,[status(thm)],[1213,6364,theory(equality)])).
% cnf(6427,plain,($false),inference(sr,[status(thm)],[6425,3868,theory(equality)])).
% cnf(6428,plain,($false),6427,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1164
% # ...of these trivial : 10
% # ...subsumed : 31
% # ...remaining for further processing: 1123
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 2484
% # ...of the previous two non-trivial : 2244
% # Contextual simplify-reflections : 0
% # Paramodulations : 2484
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1118
% # Positive orientable unit clauses: 362
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 751
% # Current number of unprocessed clauses: 2202
% # ...number of literals in the above : 3879
% # Clause-clause subsumption calls (NU) : 237497
% # Rec. Clause-clause subsumption calls : 225845
% # Unit Clause-clause subsumption calls : 1438
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 1351 leaves, 1.07+/-0.444 terms/leaf
% # Paramod-from index: 614 leaves, 1.00+/-0.090 terms/leaf
% # Paramod-into index: 1108 leaves, 1.07+/-0.352 terms/leaf
% # -------------------------------------------------
% # User time : 0.229 s
% # System time : 0.010 s
% # Total time : 0.239 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.42 CPU 0.49 WC
% FINAL PrfWatch: 0.42 CPU 0.49 WC
% SZS output end Solution for /tmp/SystemOnTPTP16008/CSR030+2.tptp
%
%------------------------------------------------------------------------------