TSTP Solution File: CSR031+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR031+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:56:10 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/SystemOnTPTP11015/CSR031+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11015/CSR031+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11015/CSR031+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 11255
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.080 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(7, axiom,individual(c_tptptptpcol_16_8398),file('/tmp/SRASS.s.p', ax1_447)).
% fof(13, axiom,![X11]:![X9]:(disjointwith(X11,X9)=>collection(X11)),file('/tmp/SRASS.s.p', ax1_1119)).
% fof(39, axiom,![X3]:~((collection(X3)&individual(X3))),file('/tmp/SRASS.s.p', ax1_289)).
% fof(1132, conjecture,~(disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488)),file('/tmp/SRASS.s.p', query81)).
% fof(1133, negated_conjecture,~(~(disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488))),inference(assume_negation,[status(cth)],[1132])).
% fof(1137, negated_conjecture,disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),inference(fof_simplification,[status(thm)],[1133,theory(equality)])).
% cnf(1156,plain,(individual(c_tptptptpcol_16_8398)),inference(split_conjunct,[status(thm)],[7])).
% fof(1172, plain,![X11]:![X9]:(~(disjointwith(X11,X9))|collection(X11)),inference(fof_nnf,[status(thm)],[13])).
% fof(1173, plain,![X12]:![X13]:(~(disjointwith(X12,X13))|collection(X12)),inference(variable_rename,[status(thm)],[1172])).
% cnf(1174,plain,(collection(X1)|~disjointwith(X1,X2)),inference(split_conjunct,[status(thm)],[1173])).
% fof(1238, plain,![X3]:(~(collection(X3))|~(individual(X3))),inference(fof_nnf,[status(thm)],[39])).
% fof(1239, plain,![X4]:(~(collection(X4))|~(individual(X4))),inference(variable_rename,[status(thm)],[1238])).
% cnf(1240,plain,(~individual(X1)|~collection(X1)),inference(split_conjunct,[status(thm)],[1239])).
% cnf(3865,negated_conjecture,(disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488)),inference(split_conjunct,[status(thm)],[1137])).
% cnf(3883,negated_conjecture,(collection(c_tptptptpcol_16_8398)),inference(spm,[status(thm)],[1174,3865,theory(equality)])).
% cnf(3886,plain,(~collection(c_tptptptpcol_16_8398)),inference(spm,[status(thm)],[1240,1156,theory(equality)])).
% cnf(6460,plain,($false),inference(rw,[status(thm)],[3886,3883,theory(equality)])).
% cnf(6461,plain,($false),inference(cn,[status(thm)],[6460,theory(equality)])).
% cnf(6462,plain,($false),6461,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1176
% # ...of these trivial : 22
% # ...subsumed : 31
% # ...remaining for further processing: 1123
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 2512
% # ...of the previous two non-trivial : 2245
% # Contextual simplify-reflections : 0
% # Paramodulations : 2512
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1122
% # Positive orientable unit clauses: 363
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 754
% # Current number of unprocessed clauses: 2201
% # ...number of literals in the above : 3888
% # Clause-clause subsumption calls (NU) : 228075
% # Rec. Clause-clause subsumption calls : 215177
% # Unit Clause-clause subsumption calls : 1433
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 1357 leaves, 1.07+/-0.429 terms/leaf
% # Paramod-from index: 620 leaves, 1.00+/-0.090 terms/leaf
% # Paramod-into index: 1113 leaves, 1.07+/-0.351 terms/leaf
% # -------------------------------------------------
% # User time : 0.226 s
% # System time : 0.010 s
% # Total time : 0.236 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/SystemOnTPTP11015/CSR031+2.tptp
%
%------------------------------------------------------------------------------