TSTP Solution File: SEU200+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU200+1 : TPTP v5.0.0. Released v3.3.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 : Thu Dec 30 01:41:55 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.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/SystemOnTPTP4221/SEU200+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4221/SEU200+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4221/SEU200+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 4317
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(relation(X2)=>relation(relation_rng_restriction(X1,X2))),file('/tmp/SRASS.s.p', dt_k8_relat_1)).
% fof(3, axiom,![X1]:![X2]:(relation(X2)=>subset(relation_rng_restriction(X1,X2),X2)),file('/tmp/SRASS.s.p', t117_relat_1)).
% fof(6, axiom,![X1]:(relation(X1)=>![X2]:(relation(X2)=>(subset(X1,X2)=>(subset(relation_dom(X1),relation_dom(X2))&subset(relation_rng(X1),relation_rng(X2)))))),file('/tmp/SRASS.s.p', t25_relat_1)).
% fof(34, conjecture,![X1]:![X2]:(relation(X2)=>subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2))),file('/tmp/SRASS.s.p', t118_relat_1)).
% fof(35, negated_conjecture,~(![X1]:![X2]:(relation(X2)=>subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2)))),inference(assume_negation,[status(cth)],[34])).
% fof(43, plain,![X1]:![X2]:(~(relation(X2))|relation(relation_rng_restriction(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(44, plain,![X3]:![X4]:(~(relation(X4))|relation(relation_rng_restriction(X3,X4))),inference(variable_rename,[status(thm)],[43])).
% cnf(45,plain,(relation(relation_rng_restriction(X1,X2))|~relation(X2)),inference(split_conjunct,[status(thm)],[44])).
% fof(48, plain,![X1]:![X2]:(~(relation(X2))|subset(relation_rng_restriction(X1,X2),X2)),inference(fof_nnf,[status(thm)],[3])).
% fof(49, plain,![X3]:![X4]:(~(relation(X4))|subset(relation_rng_restriction(X3,X4),X4)),inference(variable_rename,[status(thm)],[48])).
% cnf(50,plain,(subset(relation_rng_restriction(X1,X2),X2)|~relation(X2)),inference(split_conjunct,[status(thm)],[49])).
% fof(59, plain,![X1]:(~(relation(X1))|![X2]:(~(relation(X2))|(~(subset(X1,X2))|(subset(relation_dom(X1),relation_dom(X2))&subset(relation_rng(X1),relation_rng(X2)))))),inference(fof_nnf,[status(thm)],[6])).
% fof(60, plain,![X3]:(~(relation(X3))|![X4]:(~(relation(X4))|(~(subset(X3,X4))|(subset(relation_dom(X3),relation_dom(X4))&subset(relation_rng(X3),relation_rng(X4)))))),inference(variable_rename,[status(thm)],[59])).
% fof(61, plain,![X3]:![X4]:((~(relation(X4))|(~(subset(X3,X4))|(subset(relation_dom(X3),relation_dom(X4))&subset(relation_rng(X3),relation_rng(X4)))))|~(relation(X3))),inference(shift_quantors,[status(thm)],[60])).
% fof(62, plain,![X3]:![X4]:((((subset(relation_dom(X3),relation_dom(X4))|~(subset(X3,X4)))|~(relation(X4)))|~(relation(X3)))&(((subset(relation_rng(X3),relation_rng(X4))|~(subset(X3,X4)))|~(relation(X4)))|~(relation(X3)))),inference(distribute,[status(thm)],[61])).
% cnf(63,plain,(subset(relation_rng(X1),relation_rng(X2))|~relation(X1)|~relation(X2)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% fof(141, negated_conjecture,?[X1]:?[X2]:(relation(X2)&~(subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2)))),inference(fof_nnf,[status(thm)],[35])).
% fof(142, negated_conjecture,?[X3]:?[X4]:(relation(X4)&~(subset(relation_rng(relation_rng_restriction(X3,X4)),relation_rng(X4)))),inference(variable_rename,[status(thm)],[141])).
% fof(143, negated_conjecture,(relation(esk9_0)&~(subset(relation_rng(relation_rng_restriction(esk8_0,esk9_0)),relation_rng(esk9_0)))),inference(skolemize,[status(esa)],[142])).
% cnf(144,negated_conjecture,(~subset(relation_rng(relation_rng_restriction(esk8_0,esk9_0)),relation_rng(esk9_0))),inference(split_conjunct,[status(thm)],[143])).
% cnf(145,negated_conjecture,(relation(esk9_0)),inference(split_conjunct,[status(thm)],[143])).
% cnf(176,negated_conjecture,(relation(relation_rng_restriction(X1,esk9_0))),inference(pm,[status(thm)],[45,145,theory(equality)])).
% cnf(192,negated_conjecture,(subset(relation_rng_restriction(X1,esk9_0),esk9_0)),inference(pm,[status(thm)],[50,145,theory(equality)])).
% cnf(322,negated_conjecture,(subset(relation_rng(relation_rng_restriction(X1,esk9_0)),relation_rng(esk9_0))|~relation(esk9_0)|~relation(relation_rng_restriction(X1,esk9_0))),inference(pm,[status(thm)],[63,192,theory(equality)])).
% cnf(324,negated_conjecture,(subset(relation_rng(relation_rng_restriction(X1,esk9_0)),relation_rng(esk9_0))|$false|~relation(relation_rng_restriction(X1,esk9_0))),inference(rw,[status(thm)],[322,145,theory(equality)])).
% cnf(325,negated_conjecture,(subset(relation_rng(relation_rng_restriction(X1,esk9_0)),relation_rng(esk9_0))|$false|$false),inference(rw,[status(thm)],[324,176,theory(equality)])).
% cnf(326,negated_conjecture,(subset(relation_rng(relation_rng_restriction(X1,esk9_0)),relation_rng(esk9_0))),inference(cn,[status(thm)],[325,theory(equality)])).
% cnf(454,negated_conjecture,($false),inference(rw,[status(thm)],[144,326,theory(equality)])).
% cnf(455,negated_conjecture,($false),inference(cn,[status(thm)],[454,theory(equality)])).
% cnf(456,negated_conjecture,($false),455,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 124
% # ...of these trivial : 4
% # ...subsumed : 19
% # ...remaining for further processing: 101
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 23
% # Generated clauses : 190
% # ...of the previous two non-trivial : 162
% # Contextual simplify-reflections : 0
% # Paramodulations : 184
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 78
% # Positive orientable unit clauses: 34
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 35
% # Current number of unprocessed clauses: 21
% # ...number of literals in the above : 36
% # Clause-clause subsumption calls (NU) : 61
% # Rec. Clause-clause subsumption calls : 52
% # Unit Clause-clause subsumption calls : 110
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 23
% # Indexed BW rewrite successes : 12
% # Backwards rewriting index: 90 leaves, 1.20+/-0.542 terms/leaf
% # Paramod-from index: 37 leaves, 1.03+/-0.162 terms/leaf
% # Paramod-into index: 79 leaves, 1.15+/-0.480 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.002 s
% # Total time : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP4221/SEU200+1.tptp
%
%------------------------------------------------------------------------------