TSTP Solution File: SEU189+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU189+2 : 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:28 EST 2010
% Result : Theorem 2.02s
% Output : Solution 2.02s
% 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/SystemOnTPTP28499/SEU189+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28499/SEU189+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28499/SEU189+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 28595
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.036 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(relation_dom(empty_set)=empty_set&relation_rng(empty_set)=empty_set),file('/tmp/SRASS.s.p', t60_relat_1)).
% fof(2, axiom,![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(171, conjecture,![X1]:(relation(X1)=>(relation_dom(X1)=empty_set<=>relation_rng(X1)=empty_set)),file('/tmp/SRASS.s.p', t65_relat_1)).
% fof(172, negated_conjecture,~(![X1]:(relation(X1)=>(relation_dom(X1)=empty_set<=>relation_rng(X1)=empty_set))),inference(assume_negation,[status(cth)],[171])).
% cnf(199,plain,(relation_rng(empty_set)=empty_set),inference(split_conjunct,[status(thm)],[1])).
% cnf(200,plain,(relation_dom(empty_set)=empty_set),inference(split_conjunct,[status(thm)],[1])).
% fof(201, plain,![X1]:(~(relation(X1))|((~(relation_dom(X1)=empty_set)&~(relation_rng(X1)=empty_set))|X1=empty_set)),inference(fof_nnf,[status(thm)],[2])).
% fof(202, plain,![X2]:(~(relation(X2))|((~(relation_dom(X2)=empty_set)&~(relation_rng(X2)=empty_set))|X2=empty_set)),inference(variable_rename,[status(thm)],[201])).
% fof(203, plain,![X2]:(((~(relation_dom(X2)=empty_set)|X2=empty_set)|~(relation(X2)))&((~(relation_rng(X2)=empty_set)|X2=empty_set)|~(relation(X2)))),inference(distribute,[status(thm)],[202])).
% cnf(204,plain,(X1=empty_set|~relation(X1)|relation_rng(X1)!=empty_set),inference(split_conjunct,[status(thm)],[203])).
% cnf(205,plain,(X1=empty_set|~relation(X1)|relation_dom(X1)!=empty_set),inference(split_conjunct,[status(thm)],[203])).
% fof(857, negated_conjecture,?[X1]:(relation(X1)&((~(relation_dom(X1)=empty_set)|~(relation_rng(X1)=empty_set))&(relation_dom(X1)=empty_set|relation_rng(X1)=empty_set))),inference(fof_nnf,[status(thm)],[172])).
% fof(858, negated_conjecture,?[X2]:(relation(X2)&((~(relation_dom(X2)=empty_set)|~(relation_rng(X2)=empty_set))&(relation_dom(X2)=empty_set|relation_rng(X2)=empty_set))),inference(variable_rename,[status(thm)],[857])).
% fof(859, negated_conjecture,(relation(esk52_0)&((~(relation_dom(esk52_0)=empty_set)|~(relation_rng(esk52_0)=empty_set))&(relation_dom(esk52_0)=empty_set|relation_rng(esk52_0)=empty_set))),inference(skolemize,[status(esa)],[858])).
% cnf(860,negated_conjecture,(relation_rng(esk52_0)=empty_set|relation_dom(esk52_0)=empty_set),inference(split_conjunct,[status(thm)],[859])).
% cnf(861,negated_conjecture,(relation_rng(esk52_0)!=empty_set|relation_dom(esk52_0)!=empty_set),inference(split_conjunct,[status(thm)],[859])).
% cnf(862,negated_conjecture,(relation(esk52_0)),inference(split_conjunct,[status(thm)],[859])).
% cnf(986,negated_conjecture,(empty_set=esk52_0|relation_dom(esk52_0)=empty_set|~relation(esk52_0)),inference(spm,[status(thm)],[204,860,theory(equality)])).
% cnf(987,negated_conjecture,(empty_set=esk52_0|relation_dom(esk52_0)=empty_set|$false),inference(rw,[status(thm)],[986,862,theory(equality)])).
% cnf(988,negated_conjecture,(empty_set=esk52_0|relation_dom(esk52_0)=empty_set),inference(cn,[status(thm)],[987,theory(equality)])).
% cnf(3898,negated_conjecture,(empty_set=esk52_0|~relation(esk52_0)),inference(spm,[status(thm)],[205,988,theory(equality)])).
% cnf(3907,negated_conjecture,(empty_set=esk52_0|$false),inference(rw,[status(thm)],[3898,862,theory(equality)])).
% cnf(3908,negated_conjecture,(empty_set=esk52_0),inference(cn,[status(thm)],[3907,theory(equality)])).
% cnf(3932,negated_conjecture,($false|relation_rng(esk52_0)!=empty_set),inference(rw,[status(thm)],[inference(rw,[status(thm)],[861,3908,theory(equality)]),200,theory(equality)])).
% cnf(3933,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3932,3908,theory(equality)]),199,theory(equality)])).
% cnf(3934,negated_conjecture,($false),inference(cn,[status(thm)],[3933,theory(equality)])).
% cnf(3935,negated_conjecture,($false),3934,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 530
% # ...of these trivial : 3
% # ...subsumed : 21
% # ...remaining for further processing: 506
% # Other redundant clauses eliminated : 50
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 2646
% # ...of the previous two non-trivial : 2440
% # Contextual simplify-reflections : 4
% # Paramodulations : 2562
% # Factorizations : 14
% # Equation resolutions : 70
% # Current number of processed clauses: 247
% # Positive orientable unit clauses: 28
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 6
% # Non-unit-clauses : 210
% # Current number of unprocessed clauses: 2419
% # ...number of literals in the above : 10048
% # Clause-clause subsumption calls (NU) : 2751
% # Rec. Clause-clause subsumption calls : 1209
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 61
% # Indexed BW rewrite successes : 51
% # Backwards rewriting index: 258 leaves, 1.72+/-2.517 terms/leaf
% # Paramod-from index: 114 leaves, 1.23+/-0.738 terms/leaf
% # Paramod-into index: 229 leaves, 1.53+/-1.801 terms/leaf
% # -------------------------------------------------
% # User time : 0.165 s
% # System time : 0.005 s
% # Total time : 0.170 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.33 CPU 0.41 WC
% FINAL PrfWatch: 0.33 CPU 0.41 WC
% SZS output end Solution for /tmp/SystemOnTPTP28499/SEU189+2.tptp
%
%------------------------------------------------------------------------------