TSTP Solution File: SEU188+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU188+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 : art05.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:36:00 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP27981/SEU188+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27981/SEU188+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27981/SEU188+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 28077
% 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]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(2, axiom,![X1]:((~(empty(X1))&relation(X1))=>~(empty(relation_dom(X1)))),file('/tmp/SRASS.s.p', fc5_relat_1)).
% fof(3, axiom,![X1]:((~(empty(X1))&relation(X1))=>~(empty(relation_rng(X1)))),file('/tmp/SRASS.s.p', fc6_relat_1)).
% fof(6, axiom,(empty(empty_set)&relation(empty_set)),file('/tmp/SRASS.s.p', fc4_relat_1)).
% fof(34, conjecture,![X1]:(relation(X1)=>((relation_dom(X1)=empty_set|relation_rng(X1)=empty_set)=>X1=empty_set)),file('/tmp/SRASS.s.p', t64_relat_1)).
% fof(35, negated_conjecture,~(![X1]:(relation(X1)=>((relation_dom(X1)=empty_set|relation_rng(X1)=empty_set)=>X1=empty_set))),inference(assume_negation,[status(cth)],[34])).
% fof(36, plain,![X1]:((~(empty(X1))&relation(X1))=>~(empty(relation_dom(X1)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(37, plain,![X1]:((~(empty(X1))&relation(X1))=>~(empty(relation_rng(X1)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(45, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[1])).
% fof(46, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(48, plain,![X1]:((empty(X1)|~(relation(X1)))|~(empty(relation_dom(X1)))),inference(fof_nnf,[status(thm)],[36])).
% fof(49, plain,![X2]:((empty(X2)|~(relation(X2)))|~(empty(relation_dom(X2)))),inference(variable_rename,[status(thm)],[48])).
% cnf(50,plain,(empty(X1)|~empty(relation_dom(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(51, plain,![X1]:((empty(X1)|~(relation(X1)))|~(empty(relation_rng(X1)))),inference(fof_nnf,[status(thm)],[37])).
% fof(52, plain,![X2]:((empty(X2)|~(relation(X2)))|~(empty(relation_rng(X2)))),inference(variable_rename,[status(thm)],[51])).
% cnf(53,plain,(empty(X1)|~empty(relation_rng(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[52])).
% cnf(65,plain,(empty(empty_set)),inference(split_conjunct,[status(thm)],[6])).
% fof(141, negated_conjecture,?[X1]:(relation(X1)&((relation_dom(X1)=empty_set|relation_rng(X1)=empty_set)&~(X1=empty_set))),inference(fof_nnf,[status(thm)],[35])).
% fof(142, negated_conjecture,?[X2]:(relation(X2)&((relation_dom(X2)=empty_set|relation_rng(X2)=empty_set)&~(X2=empty_set))),inference(variable_rename,[status(thm)],[141])).
% fof(143, negated_conjecture,(relation(esk14_0)&((relation_dom(esk14_0)=empty_set|relation_rng(esk14_0)=empty_set)&~(esk14_0=empty_set))),inference(skolemize,[status(esa)],[142])).
% cnf(144,negated_conjecture,(esk14_0!=empty_set),inference(split_conjunct,[status(thm)],[143])).
% cnf(145,negated_conjecture,(relation_rng(esk14_0)=empty_set|relation_dom(esk14_0)=empty_set),inference(split_conjunct,[status(thm)],[143])).
% cnf(146,negated_conjecture,(relation(esk14_0)),inference(split_conjunct,[status(thm)],[143])).
% cnf(163,negated_conjecture,(empty(esk14_0)|relation_dom(esk14_0)=empty_set|~relation(esk14_0)|~empty(empty_set)),inference(spm,[status(thm)],[53,145,theory(equality)])).
% cnf(164,negated_conjecture,(empty(esk14_0)|relation_dom(esk14_0)=empty_set|$false|~empty(empty_set)),inference(rw,[status(thm)],[163,146,theory(equality)])).
% cnf(165,negated_conjecture,(empty(esk14_0)|relation_dom(esk14_0)=empty_set|$false|$false),inference(rw,[status(thm)],[164,65,theory(equality)])).
% cnf(166,negated_conjecture,(empty(esk14_0)|relation_dom(esk14_0)=empty_set),inference(cn,[status(thm)],[165,theory(equality)])).
% cnf(266,negated_conjecture,(empty(esk14_0)|~relation(esk14_0)|~empty(empty_set)),inference(spm,[status(thm)],[50,166,theory(equality)])).
% cnf(267,negated_conjecture,(empty(esk14_0)|$false|~empty(empty_set)),inference(rw,[status(thm)],[266,146,theory(equality)])).
% cnf(268,negated_conjecture,(empty(esk14_0)|$false|$false),inference(rw,[status(thm)],[267,65,theory(equality)])).
% cnf(269,negated_conjecture,(empty(esk14_0)),inference(cn,[status(thm)],[268,theory(equality)])).
% cnf(270,negated_conjecture,(empty_set=esk14_0),inference(spm,[status(thm)],[47,269,theory(equality)])).
% cnf(278,negated_conjecture,($false),inference(sr,[status(thm)],[270,144,theory(equality)])).
% cnf(279,negated_conjecture,($false),278,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 56
% # ...of these trivial : 3
% # ...subsumed : 5
% # ...remaining for further processing: 48
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 9
% # Generated clauses : 82
% # ...of the previous two non-trivial : 73
% # Contextual simplify-reflections : 0
% # Paramodulations : 82
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 39
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 5
% # Non-unit-clauses : 23
% # Current number of unprocessed clauses: 24
% # ...number of literals in the above : 81
% # Clause-clause subsumption calls (NU) : 17
% # Rec. Clause-clause subsumption calls : 17
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 65 leaves, 1.34+/-0.864 terms/leaf
% # Paramod-from index: 12 leaves, 1.08+/-0.276 terms/leaf
% # Paramod-into index: 40 leaves, 1.25+/-0.661 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.003 s
% # Total time : 0.019 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP27981/SEU188+1.tptp
%
%------------------------------------------------------------------------------