TSTP Solution File: CSR030+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR030+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 22:54:46 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP15749/CSR030+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15749/CSR030+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15749/CSR030+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 15845
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 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', just49)).
% 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_spindleheadmt)=>tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)),file('/tmp/SRASS.s.p', just12)).
% fof(9, axiom,genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),file('/tmp/SRASS.s.p', just11)).
% fof(14, axiom,![X3]:![X5]:(tptptypes_7_389(X3,X5)=>tptptypes_6_388(X5,X3)),file('/tmp/SRASS.s.p', just9)).
% fof(58, conjecture,?[X5]:(mtvisible(c_tptp_member3393_mt)=>tptptypes_5_387(X5,c_pushingwithopenhand)),file('/tmp/SRASS.s.p', query30)).
% fof(59, negated_conjecture,~(?[X5]:(mtvisible(c_tptp_member3393_mt)=>tptptypes_5_387(X5,c_pushingwithopenhand))),inference(assume_negation,[status(cth)],[58])).
% fof(60, plain,![X1]:![X2]:((~(mtvisible(X1))|~(genlmt(X1,X2)))|mtvisible(X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(61, plain,![X3]:![X4]:((~(mtvisible(X3))|~(genlmt(X3,X4)))|mtvisible(X4)),inference(variable_rename,[status(thm)],[60])).
% cnf(62,plain,(mtvisible(X1)|~genlmt(X2,X1)|~mtvisible(X2)),inference(split_conjunct,[status(thm)],[61])).
% fof(69, plain,![X3]:![X5]:(~(tptptypes_6_388(X3,X5))|tptptypes_5_387(X3,X5)),inference(fof_nnf,[status(thm)],[4])).
% fof(70, plain,![X6]:![X7]:(~(tptptypes_6_388(X6,X7))|tptptypes_5_387(X6,X7)),inference(variable_rename,[status(thm)],[69])).
% cnf(71,plain,(tptptypes_5_387(X1,X2)|~tptptypes_6_388(X1,X2)),inference(split_conjunct,[status(thm)],[70])).
% fof(77, plain,(~(mtvisible(c_tptp_spindleheadmt))|tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)),inference(fof_nnf,[status(thm)],[8])).
% cnf(78,plain,(tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)|~mtvisible(c_tptp_spindleheadmt)),inference(split_conjunct,[status(thm)],[77])).
% cnf(79,plain,(genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt)),inference(split_conjunct,[status(thm)],[9])).
% fof(90, plain,![X3]:![X5]:(~(tptptypes_7_389(X3,X5))|tptptypes_6_388(X5,X3)),inference(fof_nnf,[status(thm)],[14])).
% fof(91, plain,![X6]:![X7]:(~(tptptypes_7_389(X6,X7))|tptptypes_6_388(X7,X6)),inference(variable_rename,[status(thm)],[90])).
% cnf(92,plain,(tptptypes_6_388(X1,X2)|~tptptypes_7_389(X2,X1)),inference(split_conjunct,[status(thm)],[91])).
% fof(208, negated_conjecture,![X5]:(mtvisible(c_tptp_member3393_mt)&~(tptptypes_5_387(X5,c_pushingwithopenhand))),inference(fof_nnf,[status(thm)],[59])).
% fof(209, negated_conjecture,![X6]:(mtvisible(c_tptp_member3393_mt)&~(tptptypes_5_387(X6,c_pushingwithopenhand))),inference(variable_rename,[status(thm)],[208])).
% cnf(210,negated_conjecture,(~tptptypes_5_387(X1,c_pushingwithopenhand)),inference(split_conjunct,[status(thm)],[209])).
% cnf(211,negated_conjecture,(mtvisible(c_tptp_member3393_mt)),inference(split_conjunct,[status(thm)],[209])).
% cnf(216,plain,(mtvisible(c_tptp_spindleheadmt)|~mtvisible(c_tptp_member3393_mt)),inference(spm,[status(thm)],[62,79,theory(equality)])).
% cnf(220,plain,(mtvisible(c_tptp_spindleheadmt)|$false),inference(rw,[status(thm)],[216,211,theory(equality)])).
% cnf(221,plain,(mtvisible(c_tptp_spindleheadmt)),inference(cn,[status(thm)],[220,theory(equality)])).
% cnf(257,plain,(tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)|$false),inference(rw,[status(thm)],[78,221,theory(equality)])).
% cnf(258,plain,(tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)),inference(cn,[status(thm)],[257,theory(equality)])).
% cnf(300,plain,(tptptypes_6_388(c_tptpcol_16_4451,c_pushingwithopenhand)),inference(spm,[status(thm)],[92,258,theory(equality)])).
% cnf(310,plain,(tptptypes_5_387(c_tptpcol_16_4451,c_pushingwithopenhand)),inference(spm,[status(thm)],[71,300,theory(equality)])).
% cnf(313,plain,($false),inference(sr,[status(thm)],[310,210,theory(equality)])).
% cnf(314,plain,($false),313,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 91
% # ...of these trivial : 5
% # ...subsumed : 8
% # ...remaining for further processing: 78
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 68
% # ...of the previous two non-trivial : 53
% # Contextual simplify-reflections : 0
% # Paramodulations : 68
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 75
% # Positive orientable unit clauses: 36
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 38
% # Current number of unprocessed clauses: 18
% # ...number of literals in the above : 30
% # Clause-clause subsumption calls (NU) : 30
% # Rec. Clause-clause subsumption calls : 30
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 76 leaves, 1.32+/-0.935 terms/leaf
% # Paramod-from index: 40 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 66 leaves, 1.21+/-0.591 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.002 s
% # Total time : 0.020 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/SystemOnTPTP15749/CSR030+1.tptp
%
%------------------------------------------------------------------------------