TSTP Solution File: SEU188+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU188+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 : art07.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:15 EST 2010
% Result : Theorem 2.03s
% Output : Solution 2.03s
% 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/SystemOnTPTP1362/SEU188+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1362/SEU188+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1362/SEU188+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 1458
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.037 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:((~(empty(X1))&relation(X1))=>~(empty(relation_dom(X1)))),file('/tmp/SRASS.s.p', fc5_relat_1)).
% fof(5, axiom,![X1]:((~(empty(X1))&relation(X1))=>~(empty(relation_rng(X1)))),file('/tmp/SRASS.s.p', fc6_relat_1)).
% fof(9, axiom,(empty(empty_set)&relation(empty_set)),file('/tmp/SRASS.s.p', fc4_relat_1)).
% fof(14, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(170, 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(171, negated_conjecture,~(![X1]:(relation(X1)=>((relation_dom(X1)=empty_set|relation_rng(X1)=empty_set)=>X1=empty_set))),inference(assume_negation,[status(cth)],[170])).
% fof(172, plain,![X1]:((~(empty(X1))&relation(X1))=>~(empty(relation_dom(X1)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(173, plain,![X1]:((~(empty(X1))&relation(X1))=>~(empty(relation_rng(X1)))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(211, plain,![X1]:((empty(X1)|~(relation(X1)))|~(empty(relation_dom(X1)))),inference(fof_nnf,[status(thm)],[172])).
% fof(212, plain,![X2]:((empty(X2)|~(relation(X2)))|~(empty(relation_dom(X2)))),inference(variable_rename,[status(thm)],[211])).
% cnf(213,plain,(empty(X1)|~empty(relation_dom(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[212])).
% fof(214, plain,![X1]:((empty(X1)|~(relation(X1)))|~(empty(relation_rng(X1)))),inference(fof_nnf,[status(thm)],[173])).
% fof(215, plain,![X2]:((empty(X2)|~(relation(X2)))|~(empty(relation_rng(X2)))),inference(variable_rename,[status(thm)],[214])).
% cnf(216,plain,(empty(X1)|~empty(relation_rng(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[215])).
% cnf(234,plain,(empty(empty_set)),inference(split_conjunct,[status(thm)],[9])).
% fof(249, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[14])).
% fof(250, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[249])).
% cnf(251,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[250])).
% fof(851, negated_conjecture,?[X1]:(relation(X1)&((relation_dom(X1)=empty_set|relation_rng(X1)=empty_set)&~(X1=empty_set))),inference(fof_nnf,[status(thm)],[171])).
% fof(852, negated_conjecture,?[X2]:(relation(X2)&((relation_dom(X2)=empty_set|relation_rng(X2)=empty_set)&~(X2=empty_set))),inference(variable_rename,[status(thm)],[851])).
% fof(853, negated_conjecture,(relation(esk52_0)&((relation_dom(esk52_0)=empty_set|relation_rng(esk52_0)=empty_set)&~(esk52_0=empty_set))),inference(skolemize,[status(esa)],[852])).
% cnf(854,negated_conjecture,(esk52_0!=empty_set),inference(split_conjunct,[status(thm)],[853])).
% cnf(855,negated_conjecture,(relation_rng(esk52_0)=empty_set|relation_dom(esk52_0)=empty_set),inference(split_conjunct,[status(thm)],[853])).
% cnf(856,negated_conjecture,(relation(esk52_0)),inference(split_conjunct,[status(thm)],[853])).
% cnf(1021,negated_conjecture,(empty(esk52_0)|relation_dom(esk52_0)=empty_set|~empty(empty_set)|~relation(esk52_0)),inference(spm,[status(thm)],[216,855,theory(equality)])).
% cnf(1024,negated_conjecture,(empty(esk52_0)|relation_dom(esk52_0)=empty_set|$false|~relation(esk52_0)),inference(rw,[status(thm)],[1021,234,theory(equality)])).
% cnf(1025,negated_conjecture,(empty(esk52_0)|relation_dom(esk52_0)=empty_set|$false|$false),inference(rw,[status(thm)],[1024,856,theory(equality)])).
% cnf(1026,negated_conjecture,(empty(esk52_0)|relation_dom(esk52_0)=empty_set),inference(cn,[status(thm)],[1025,theory(equality)])).
% cnf(3948,negated_conjecture,(empty(esk52_0)|~empty(empty_set)|~relation(esk52_0)),inference(spm,[status(thm)],[213,1026,theory(equality)])).
% cnf(3956,negated_conjecture,(empty(esk52_0)|$false|~relation(esk52_0)),inference(rw,[status(thm)],[3948,234,theory(equality)])).
% cnf(3957,negated_conjecture,(empty(esk52_0)|$false|$false),inference(rw,[status(thm)],[3956,856,theory(equality)])).
% cnf(3958,negated_conjecture,(empty(esk52_0)),inference(cn,[status(thm)],[3957,theory(equality)])).
% cnf(3971,negated_conjecture,(empty_set=esk52_0),inference(spm,[status(thm)],[251,3958,theory(equality)])).
% cnf(3976,negated_conjecture,($false),inference(sr,[status(thm)],[3971,854,theory(equality)])).
% cnf(3977,negated_conjecture,($false),3976,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 529
% # ...of these trivial : 3
% # ...subsumed : 22
% # ...remaining for further processing: 504
% # Other redundant clauses eliminated : 52
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 2681
% # ...of the previous two non-trivial : 2458
% # Contextual simplify-reflections : 4
% # Paramodulations : 2595
% # Factorizations : 14
% # Equation resolutions : 72
% # Current number of processed clauses: 247
% # Positive orientable unit clauses: 28
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 7
% # Non-unit-clauses : 209
% # Current number of unprocessed clauses: 2437
% # ...number of literals in the above : 10101
% # Clause-clause subsumption calls (NU) : 2751
% # Rec. Clause-clause subsumption calls : 1209
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 63
% # Indexed BW rewrite successes : 53
% # Backwards rewriting index: 259 leaves, 1.71+/-2.512 terms/leaf
% # Paramod-from index: 115 leaves, 1.23+/-0.735 terms/leaf
% # Paramod-into index: 229 leaves, 1.53+/-1.801 terms/leaf
% # -------------------------------------------------
% # User time : 0.158 s
% # System time : 0.011 s
% # Total time : 0.169 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.32 CPU 0.40 WC
% FINAL PrfWatch: 0.32 CPU 0.40 WC
% SZS output end Solution for /tmp/SystemOnTPTP1362/SEU188+2.tptp
%
%------------------------------------------------------------------------------