TSTP Solution File: CSR044+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR044+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 : 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:19:33 EST 2010
% Result : Theorem 1.02s
% Output : Solution 1.02s
% 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/SystemOnTPTP18959/CSR044+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18959/CSR044+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18959/CSR044+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 19055
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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', just48)).
% fof(2, axiom,executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),file('/tmp/SRASS.s.p', just12)).
% fof(8, axiom,(mtvisible(c_cyclistsmt)=>relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)),file('/tmp/SRASS.s.p', just11)).
% fof(9, axiom,genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),file('/tmp/SRASS.s.p', just9)).
% fof(10, axiom,![X5]:(isa(X5,c_tptpcol_16_29490)=>tptpcol_16_29490(X5)),file('/tmp/SRASS.s.p', just31)).
% fof(12, axiom,genlmt(c_tptp_spindleheadmt,c_cyclistsmt),file('/tmp/SRASS.s.p', just8)).
% fof(14, axiom,![X9]:((mtvisible(c_cyclistsmt)&executionbyfiringsquad(X9))=>tptp_9_720(X9,f_relationallexistsfn(X9,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))),file('/tmp/SRASS.s.p', just10)).
% fof(33, axiom,![X5]:(executionbyfiringsquad(X5)=>isa(X5,c_executionbyfiringsquad)),file('/tmp/SRASS.s.p', just34)).
% fof(45, axiom,![X9]:![X17]:![X18]:![X19]:((isa(X9,X17)&relationallexists(X18,X17,X19))=>isa(f_relationallexistsfn(X9,X18,X17,X19),X19)),file('/tmp/SRASS.s.p', just1)).
% fof(65, conjecture,?[X5]:(mtvisible(c_tptp_member3633_mt)=>(tptp_9_720(c_tptpexecutionbyfiringsquad_90,X5)&tptpcol_16_29490(X5))),file('/tmp/SRASS.s.p', query44)).
% fof(66, negated_conjecture,~(?[X5]:(mtvisible(c_tptp_member3633_mt)=>(tptp_9_720(c_tptpexecutionbyfiringsquad_90,X5)&tptpcol_16_29490(X5)))),inference(assume_negation,[status(cth)],[65])).
% fof(67, plain,![X1]:![X2]:((~(mtvisible(X1))|~(genlmt(X1,X2)))|mtvisible(X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(68, plain,![X3]:![X4]:((~(mtvisible(X3))|~(genlmt(X3,X4)))|mtvisible(X4)),inference(variable_rename,[status(thm)],[67])).
% cnf(69,plain,(mtvisible(X1)|~genlmt(X2,X1)|~mtvisible(X2)),inference(split_conjunct,[status(thm)],[68])).
% cnf(70,plain,(executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90)),inference(split_conjunct,[status(thm)],[2])).
% fof(82, plain,(~(mtvisible(c_cyclistsmt))|relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)),inference(fof_nnf,[status(thm)],[8])).
% cnf(83,plain,(relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)|~mtvisible(c_cyclistsmt)),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,plain,(genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt)),inference(split_conjunct,[status(thm)],[9])).
% fof(85, plain,![X5]:(~(isa(X5,c_tptpcol_16_29490))|tptpcol_16_29490(X5)),inference(fof_nnf,[status(thm)],[10])).
% fof(86, plain,![X6]:(~(isa(X6,c_tptpcol_16_29490))|tptpcol_16_29490(X6)),inference(variable_rename,[status(thm)],[85])).
% cnf(87,plain,(tptpcol_16_29490(X1)|~isa(X1,c_tptpcol_16_29490)),inference(split_conjunct,[status(thm)],[86])).
% cnf(91,plain,(genlmt(c_tptp_spindleheadmt,c_cyclistsmt)),inference(split_conjunct,[status(thm)],[12])).
% fof(95, plain,![X9]:((~(mtvisible(c_cyclistsmt))|~(executionbyfiringsquad(X9)))|tptp_9_720(X9,f_relationallexistsfn(X9,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))),inference(fof_nnf,[status(thm)],[14])).
% fof(96, plain,![X10]:((~(mtvisible(c_cyclistsmt))|~(executionbyfiringsquad(X10)))|tptp_9_720(X10,f_relationallexistsfn(X10,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))),inference(variable_rename,[status(thm)],[95])).
% cnf(97,plain,(tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))|~executionbyfiringsquad(X1)|~mtvisible(c_cyclistsmt)),inference(split_conjunct,[status(thm)],[96])).
% fof(148, plain,![X5]:(~(executionbyfiringsquad(X5))|isa(X5,c_executionbyfiringsquad)),inference(fof_nnf,[status(thm)],[33])).
% fof(149, plain,![X6]:(~(executionbyfiringsquad(X6))|isa(X6,c_executionbyfiringsquad)),inference(variable_rename,[status(thm)],[148])).
% cnf(150,plain,(isa(X1,c_executionbyfiringsquad)|~executionbyfiringsquad(X1)),inference(split_conjunct,[status(thm)],[149])).
% fof(177, plain,![X9]:![X17]:![X18]:![X19]:((~(isa(X9,X17))|~(relationallexists(X18,X17,X19)))|isa(f_relationallexistsfn(X9,X18,X17,X19),X19)),inference(fof_nnf,[status(thm)],[45])).
% fof(178, plain,![X20]:![X21]:![X22]:![X23]:((~(isa(X20,X21))|~(relationallexists(X22,X21,X23)))|isa(f_relationallexistsfn(X20,X22,X21,X23),X23)),inference(variable_rename,[status(thm)],[177])).
% cnf(179,plain,(isa(f_relationallexistsfn(X1,X2,X3,X4),X4)|~relationallexists(X2,X3,X4)|~isa(X1,X3)),inference(split_conjunct,[status(thm)],[178])).
% fof(230, negated_conjecture,![X5]:(mtvisible(c_tptp_member3633_mt)&(~(tptp_9_720(c_tptpexecutionbyfiringsquad_90,X5))|~(tptpcol_16_29490(X5)))),inference(fof_nnf,[status(thm)],[66])).
% fof(231, negated_conjecture,![X6]:(mtvisible(c_tptp_member3633_mt)&(~(tptp_9_720(c_tptpexecutionbyfiringsquad_90,X6))|~(tptpcol_16_29490(X6)))),inference(variable_rename,[status(thm)],[230])).
% cnf(232,negated_conjecture,(~tptpcol_16_29490(X1)|~tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1)),inference(split_conjunct,[status(thm)],[231])).
% cnf(233,negated_conjecture,(mtvisible(c_tptp_member3633_mt)),inference(split_conjunct,[status(thm)],[231])).
% cnf(235,negated_conjecture,(~tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1)|~isa(X1,c_tptpcol_16_29490)),inference(spm,[status(thm)],[232,87,theory(equality)])).
% cnf(236,plain,(isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad)),inference(spm,[status(thm)],[150,70,theory(equality)])).
% cnf(240,plain,(mtvisible(c_cyclistsmt)|~mtvisible(c_tptp_spindleheadmt)),inference(spm,[status(thm)],[69,91,theory(equality)])).
% cnf(241,plain,(mtvisible(c_tptp_spindleheadmt)|~mtvisible(c_tptp_member3633_mt)),inference(spm,[status(thm)],[69,84,theory(equality)])).
% cnf(245,plain,(mtvisible(c_tptp_spindleheadmt)|$false),inference(rw,[status(thm)],[241,233,theory(equality)])).
% cnf(246,plain,(mtvisible(c_tptp_spindleheadmt)),inference(cn,[status(thm)],[245,theory(equality)])).
% cnf(278,negated_conjecture,(~isa(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490)|~executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90)|~mtvisible(c_cyclistsmt)),inference(spm,[status(thm)],[235,97,theory(equality)])).
% cnf(279,negated_conjecture,(~isa(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490)|$false|~mtvisible(c_cyclistsmt)),inference(rw,[status(thm)],[278,70,theory(equality)])).
% cnf(280,negated_conjecture,(~isa(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490)|~mtvisible(c_cyclistsmt)),inference(cn,[status(thm)],[279,theory(equality)])).
% cnf(293,plain,(mtvisible(c_cyclistsmt)|$false),inference(rw,[status(thm)],[240,246,theory(equality)])).
% cnf(294,plain,(mtvisible(c_cyclistsmt)),inference(cn,[status(thm)],[293,theory(equality)])).
% cnf(295,negated_conjecture,(~isa(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490)|$false),inference(rw,[status(thm)],[280,294,theory(equality)])).
% cnf(296,negated_conjecture,(~isa(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490)),inference(cn,[status(thm)],[295,theory(equality)])).
% cnf(299,plain,(relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)|$false),inference(rw,[status(thm)],[83,294,theory(equality)])).
% cnf(300,plain,(relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)),inference(cn,[status(thm)],[299,theory(equality)])).
% cnf(304,plain,(isa(f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490)|~isa(X1,c_executionbyfiringsquad)),inference(spm,[status(thm)],[179,300,theory(equality)])).
% cnf(444,negated_conjecture,(~isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad)),inference(spm,[status(thm)],[296,304,theory(equality)])).
% cnf(447,negated_conjecture,($false),inference(rw,[status(thm)],[444,236,theory(equality)])).
% cnf(448,negated_conjecture,($false),inference(cn,[status(thm)],[447,theory(equality)])).
% cnf(449,negated_conjecture,($false),448,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 180
% # ...of these trivial : 6
% # ...subsumed : 12
% # ...remaining for further processing: 162
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 122
% # ...of the previous two non-trivial : 68
% # Contextual simplify-reflections : 0
% # Paramodulations : 122
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 100
% # Positive orientable unit clauses: 50
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 49
% # Current number of unprocessed clauses: 7
% # ...number of literals in the above : 17
% # Clause-clause subsumption calls (NU) : 107
% # Rec. Clause-clause subsumption calls : 107
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 108 leaves, 1.24+/-0.837 terms/leaf
% # Paramod-from index: 58 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 94 leaves, 1.17+/-0.577 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.002 s
% # Total time : 0.025 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.20 WC
% FINAL PrfWatch: 0.10 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP18959/CSR044+1.tptp
%
%------------------------------------------------------------------------------