TSTP Solution File: CSR026+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR026+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 : art02.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:47:20 EST 2010
% Result : Theorem 116.92s
% Output : Solution 116.92s
% 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/SystemOnTPTP10080/CSR026+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10080/CSR026+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10080/CSR026+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 10284
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.080 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:((mtvisible(c_tptp_member2701_mt)&runningshorts(X1))=>tptpofobject(X1,f_tptpquantityfn_2(n_756))),file('/tmp/SRASS.s.p', ax1_440)).
% fof(2, axiom,![X2]:![X3]:((mtvisible(X2)&genlmt(X2,X3))=>mtvisible(X3)),file('/tmp/SRASS.s.p', ax1_1123)).
% fof(7, axiom,(mtvisible(c_cyclistsmt)=>runningshorts(c_tptprunningshorts)),file('/tmp/SRASS.s.p', ax1_163)).
% fof(15, axiom,genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),file('/tmp/SRASS.s.p', ax1_344)).
% fof(17, axiom,genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),file('/tmp/SRASS.s.p', ax1_364)).
% fof(25, axiom,genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),file('/tmp/SRASS.s.p', ax1_315)).
% fof(184, axiom,genlmt(c_tptp_spindleheadmt,c_cyclistsmt),file('/tmp/SRASS.s.p', ax1_254)).
% fof(1132, conjecture,(mtvisible(c_tptp_spindlecollectormt)=>tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756))),file('/tmp/SRASS.s.p', query76)).
% fof(1133, negated_conjecture,~((mtvisible(c_tptp_spindlecollectormt)=>tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)))),inference(assume_negation,[status(cth)],[1132])).
% fof(1137, plain,![X1]:((~(mtvisible(c_tptp_member2701_mt))|~(runningshorts(X1)))|tptpofobject(X1,f_tptpquantityfn_2(n_756))),inference(fof_nnf,[status(thm)],[1])).
% fof(1138, plain,![X2]:((~(mtvisible(c_tptp_member2701_mt))|~(runningshorts(X2)))|tptpofobject(X2,f_tptpquantityfn_2(n_756))),inference(variable_rename,[status(thm)],[1137])).
% cnf(1139,plain,(tptpofobject(X1,f_tptpquantityfn_2(n_756))|~runningshorts(X1)|~mtvisible(c_tptp_member2701_mt)),inference(split_conjunct,[status(thm)],[1138])).
% fof(1140, plain,![X2]:![X3]:((~(mtvisible(X2))|~(genlmt(X2,X3)))|mtvisible(X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(1141, plain,![X4]:![X5]:((~(mtvisible(X4))|~(genlmt(X4,X5)))|mtvisible(X5)),inference(variable_rename,[status(thm)],[1140])).
% cnf(1142,plain,(mtvisible(X1)|~genlmt(X2,X1)|~mtvisible(X2)),inference(split_conjunct,[status(thm)],[1141])).
% fof(1154, plain,(~(mtvisible(c_cyclistsmt))|runningshorts(c_tptprunningshorts)),inference(fof_nnf,[status(thm)],[7])).
% cnf(1155,plain,(runningshorts(c_tptprunningshorts)|~mtvisible(c_cyclistsmt)),inference(split_conjunct,[status(thm)],[1154])).
% cnf(1164,plain,(genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt)),inference(split_conjunct,[status(thm)],[15])).
% cnf(1166,plain,(genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt)),inference(split_conjunct,[status(thm)],[17])).
% cnf(1181,plain,(genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt)),inference(split_conjunct,[status(thm)],[25])).
% cnf(1563,plain,(genlmt(c_tptp_spindleheadmt,c_cyclistsmt)),inference(split_conjunct,[status(thm)],[184])).
% fof(3864, negated_conjecture,(mtvisible(c_tptp_spindlecollectormt)&~(tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)))),inference(fof_nnf,[status(thm)],[1133])).
% cnf(3865,negated_conjecture,(~tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756))),inference(split_conjunct,[status(thm)],[3864])).
% cnf(3866,negated_conjecture,(mtvisible(c_tptp_spindlecollectormt)),inference(split_conjunct,[status(thm)],[3864])).
% cnf(3917,plain,(mtvisible(c_cyclistsmt)|~mtvisible(c_tptp_spindleheadmt)),inference(spm,[status(thm)],[1142,1563,theory(equality)])).
% cnf(3918,plain,(mtvisible(c_tptp_spindleheadmt)|~mtvisible(c_tptp_member3993_mt)),inference(spm,[status(thm)],[1142,1181,theory(equality)])).
% cnf(3922,plain,(mtvisible(c_tptp_member3993_mt)|~mtvisible(c_tptp_spindlecollectormt)),inference(spm,[status(thm)],[1142,1166,theory(equality)])).
% cnf(3926,plain,(mtvisible(c_tptp_member2701_mt)|~mtvisible(c_tptp_spindlecollectormt)),inference(spm,[status(thm)],[1142,1164,theory(equality)])).
% cnf(3948,plain,(mtvisible(c_tptp_member3993_mt)|$false),inference(rw,[status(thm)],[3922,3866,theory(equality)])).
% cnf(3949,plain,(mtvisible(c_tptp_member3993_mt)),inference(cn,[status(thm)],[3948,theory(equality)])).
% cnf(3956,plain,(mtvisible(c_tptp_member2701_mt)|$false),inference(rw,[status(thm)],[3926,3866,theory(equality)])).
% cnf(3957,plain,(mtvisible(c_tptp_member2701_mt)),inference(cn,[status(thm)],[3956,theory(equality)])).
% cnf(6394,plain,(tptpofobject(X1,f_tptpquantityfn_2(n_756))|~runningshorts(X1)|$false),inference(rw,[status(thm)],[1139,3957,theory(equality)])).
% cnf(6395,plain,(tptpofobject(X1,f_tptpquantityfn_2(n_756))|~runningshorts(X1)),inference(cn,[status(thm)],[6394,theory(equality)])).
% cnf(6494,negated_conjecture,(~runningshorts(c_tptprunningshorts)),inference(spm,[status(thm)],[3865,6395,theory(equality)])).
% cnf(6499,negated_conjecture,(~mtvisible(c_cyclistsmt)),inference(spm,[status(thm)],[6494,1155,theory(equality)])).
% cnf(6981,plain,(~mtvisible(c_tptp_spindleheadmt)),inference(sr,[status(thm)],[3917,6499,theory(equality)])).
% cnf(6989,plain,(mtvisible(c_tptp_spindleheadmt)|$false),inference(rw,[status(thm)],[3918,3949,theory(equality)])).
% cnf(6990,plain,(mtvisible(c_tptp_spindleheadmt)),inference(cn,[status(thm)],[6989,theory(equality)])).
% cnf(6991,plain,($false),inference(sr,[status(thm)],[6990,6981,theory(equality)])).
% cnf(6992,plain,($false),6991,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1398
% # ...of these trivial : 79
% # ...subsumed : 33
% # ...remaining for further processing: 1286
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 11
% # Generated clauses : 2851
% # ...of the previous two non-trivial : 2447
% # Contextual simplify-reflections : 0
% # Paramodulations : 2851
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1274
% # Positive orientable unit clauses: 492
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 775
% # Current number of unprocessed clauses: 2158
% # ...number of literals in the above : 3799
% # Clause-clause subsumption calls (NU) : 322414
% # Rec. Clause-clause subsumption calls : 302342
% # Unit Clause-clause subsumption calls : 26021
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 1496 leaves, 1.06+/-0.409 terms/leaf
% # Paramod-from index: 753 leaves, 1.00+/-0.081 terms/leaf
% # Paramod-into index: 1260 leaves, 1.06+/-0.331 terms/leaf
% # -------------------------------------------------
% # User time : 0.242 s
% # System time : 0.013 s
% # Total time : 0.255 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.43 CPU 0.52 WC
% FINAL PrfWatch: 0.43 CPU 0.52 WC
% SZS output end Solution for /tmp/SystemOnTPTP10080/CSR026+2.tptp
%
%------------------------------------------------------------------------------