↑ Up

SRASS---0.1.THM-Sol.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : ALG200+1 : TPTP v5.0.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art03.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 21:03:39 EST 2010

% Result   : Theorem 1.29s
% Output   : Solution 1.29s
% 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/SystemOnTPTP27948/ALG200+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP27948/ALG200+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27948/ALG200+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 28044
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(7, conjecture,~(((((((((op(e0,e0)=e0&op(e1,e1)=e1)&op(e2,e2)=e2)&op(e3,e3)=e3)&op(e4,e4)=e4)&op(e5,e5)=e5)&op(e6,e6)=e6)&((((((op(e0,e0)=e0|op(e1,e1)=e1)|op(e2,e2)=e2)|op(e3,e3)=e3)|op(e4,e4)=e4)|op(e5,e5)=e5)|op(e6,e6)=e6))&((((((~(op(e0,e0)=e0)|~(op(e1,e1)=e1))|~(op(e2,e2)=e2))|~(op(e3,e3)=e3))|~(op(e4,e4)=e4))|~(op(e5,e5)=e5))|~(op(e6,e6)=e6)))),file('/tmp/SRASS.s.p', co1)).
% fof(8, negated_conjecture,~(~(((((((((op(e0,e0)=e0&op(e1,e1)=e1)&op(e2,e2)=e2)&op(e3,e3)=e3)&op(e4,e4)=e4)&op(e5,e5)=e5)&op(e6,e6)=e6)&((((((op(e0,e0)=e0|op(e1,e1)=e1)|op(e2,e2)=e2)|op(e3,e3)=e3)|op(e4,e4)=e4)|op(e5,e5)=e5)|op(e6,e6)=e6))&((((((~(op(e0,e0)=e0)|~(op(e1,e1)=e1))|~(op(e2,e2)=e2))|~(op(e3,e3)=e3))|~(op(e4,e4)=e4))|~(op(e5,e5)=e5))|~(op(e6,e6)=e6))))),inference(assume_negation,[status(cth)],[7])).
% fof(525, negated_conjecture,((((((((op(e0,e0)=e0&op(e1,e1)=e1)&op(e2,e2)=e2)&op(e3,e3)=e3)&op(e4,e4)=e4)&op(e5,e5)=e5)&op(e6,e6)=e6)&((((((op(e0,e0)=e0|op(e1,e1)=e1)|op(e2,e2)=e2)|op(e3,e3)=e3)|op(e4,e4)=e4)|op(e5,e5)=e5)|op(e6,e6)=e6))&((((((~(op(e0,e0)=e0)|~(op(e1,e1)=e1))|~(op(e2,e2)=e2))|~(op(e3,e3)=e3))|~(op(e4,e4)=e4))|~(op(e5,e5)=e5))|~(op(e6,e6)=e6))),inference(fof_nnf,[status(thm)],[8])).
% cnf(526,negated_conjecture,(op(e6,e6)!=e6|op(e5,e5)!=e5|op(e4,e4)!=e4|op(e3,e3)!=e3|op(e2,e2)!=e2|op(e1,e1)!=e1|op(e0,e0)!=e0),inference(split_conjunct,[status(thm)],[525])).
% cnf(528,negated_conjecture,(op(e6,e6)=e6),inference(split_conjunct,[status(thm)],[525])).
% cnf(529,negated_conjecture,(op(e5,e5)=e5),inference(split_conjunct,[status(thm)],[525])).
% cnf(530,negated_conjecture,(op(e4,e4)=e4),inference(split_conjunct,[status(thm)],[525])).
% cnf(531,negated_conjecture,(op(e3,e3)=e3),inference(split_conjunct,[status(thm)],[525])).
% cnf(532,negated_conjecture,(op(e2,e2)=e2),inference(split_conjunct,[status(thm)],[525])).
% cnf(533,negated_conjecture,(op(e1,e1)=e1),inference(split_conjunct,[status(thm)],[525])).
% cnf(534,negated_conjecture,(op(e0,e0)=e0),inference(split_conjunct,[status(thm)],[525])).
% cnf(2754,negated_conjecture,($false|op(e1,e1)!=e1|op(e2,e2)!=e2|op(e3,e3)!=e3|op(e4,e4)!=e4|op(e5,e5)!=e5|op(e6,e6)!=e6),inference(rw,[status(thm)],[526,534,theory(equality)])).
% cnf(2755,negated_conjecture,($false|$false|op(e2,e2)!=e2|op(e3,e3)!=e3|op(e4,e4)!=e4|op(e5,e5)!=e5|op(e6,e6)!=e6),inference(rw,[status(thm)],[2754,533,theory(equality)])).
% cnf(2756,negated_conjecture,($false|$false|$false|op(e3,e3)!=e3|op(e4,e4)!=e4|op(e5,e5)!=e5|op(e6,e6)!=e6),inference(rw,[status(thm)],[2755,532,theory(equality)])).
% cnf(2757,negated_conjecture,($false|$false|$false|$false|op(e4,e4)!=e4|op(e5,e5)!=e5|op(e6,e6)!=e6),inference(rw,[status(thm)],[2756,531,theory(equality)])).
% cnf(2758,negated_conjecture,($false|$false|$false|$false|$false|op(e5,e5)!=e5|op(e6,e6)!=e6),inference(rw,[status(thm)],[2757,530,theory(equality)])).
% cnf(2759,negated_conjecture,($false|$false|$false|$false|$false|$false|op(e6,e6)!=e6),inference(rw,[status(thm)],[2758,529,theory(equality)])).
% cnf(2760,negated_conjecture,($false|$false|$false|$false|$false|$false|$false),inference(rw,[status(thm)],[2759,528,theory(equality)])).
% cnf(2761,negated_conjecture,($false),inference(cn,[status(thm)],[2760,theory(equality)])).
% cnf(2762,negated_conjecture,($false),2761,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 521
% # ...of these trivial                : 43
% # ...subsumed                        : 23
% # ...remaining for further processing: 455
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 1
% # Generated clauses                  : 1287
% # ...of the previous two non-trivial : 1082
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 1134
% # Factorizations                     : 116
% # Equation resolutions               : 0
% # Current number of processed clauses: 416
% #    Positive orientable unit clauses: 53
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 292
% #    Non-unit-clauses                : 71
% # Current number of unprocessed clauses: 770
% # ...number of literals in the above : 3413
% # Clause-clause subsumption calls (NU) : 228
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 507
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 87
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:   104 leaves,   1.29+/-1.098 terms/leaf
% # Paramod-from index:           56 leaves,   1.54+/-1.451 terms/leaf
% # Paramod-into index:          104 leaves,   1.29+/-1.098 terms/leaf
% # -------------------------------------------------
% # User time              : 0.086 s
% # System time            : 0.005 s
% # Total time             : 0.091 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.31 WC
% FINAL PrfWatch: 0.24 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP27948/ALG200+1.tptp
% 
%------------------------------------------------------------------------------