TSTP Solution File: SEU062+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU062+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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 00:49:44 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/SystemOnTPTP15836/SEU062+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15836/SEU062+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15836/SEU062+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 15932
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(4, axiom,![X1]:![X2]:(relation(X2)=>(in(X1,relation_rng(X2))<=>~(relation_inverse_image(X2,singleton(X1))=empty_set))),file('/tmp/SRASS.s.p', t142_funct_1)).
% fof(34, conjecture,![X1]:![X2]:(relation(X2)=>(![X3]:~((in(X3,X1)&relation_inverse_image(X2,singleton(X3))=empty_set))=>subset(X1,relation_rng(X2)))),file('/tmp/SRASS.s.p', t143_funct_1)).
% fof(35, negated_conjecture,~(![X1]:![X2]:(relation(X2)=>(![X3]:~((in(X3,X1)&relation_inverse_image(X2,singleton(X3))=empty_set))=>subset(X1,relation_rng(X2))))),inference(assume_negation,[status(cth)],[34])).
% fof(46, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(47, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[48])).
% fof(50, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[49])).
% cnf(51,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[50])).
% cnf(52,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[50])).
% fof(56, plain,![X1]:![X2]:(~(relation(X2))|((~(in(X1,relation_rng(X2)))|~(relation_inverse_image(X2,singleton(X1))=empty_set))&(relation_inverse_image(X2,singleton(X1))=empty_set|in(X1,relation_rng(X2))))),inference(fof_nnf,[status(thm)],[4])).
% fof(57, plain,![X3]:![X4]:(~(relation(X4))|((~(in(X3,relation_rng(X4)))|~(relation_inverse_image(X4,singleton(X3))=empty_set))&(relation_inverse_image(X4,singleton(X3))=empty_set|in(X3,relation_rng(X4))))),inference(variable_rename,[status(thm)],[56])).
% fof(58, plain,![X3]:![X4]:(((~(in(X3,relation_rng(X4)))|~(relation_inverse_image(X4,singleton(X3))=empty_set))|~(relation(X4)))&((relation_inverse_image(X4,singleton(X3))=empty_set|in(X3,relation_rng(X4)))|~(relation(X4)))),inference(distribute,[status(thm)],[57])).
% cnf(59,plain,(in(X2,relation_rng(X1))|relation_inverse_image(X1,singleton(X2))=empty_set|~relation(X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(161, negated_conjecture,?[X1]:?[X2]:(relation(X2)&(![X3]:(~(in(X3,X1))|~(relation_inverse_image(X2,singleton(X3))=empty_set))&~(subset(X1,relation_rng(X2))))),inference(fof_nnf,[status(thm)],[35])).
% fof(162, negated_conjecture,?[X4]:?[X5]:(relation(X5)&(![X6]:(~(in(X6,X4))|~(relation_inverse_image(X5,singleton(X6))=empty_set))&~(subset(X4,relation_rng(X5))))),inference(variable_rename,[status(thm)],[161])).
% fof(163, negated_conjecture,(relation(esk14_0)&(![X6]:(~(in(X6,esk13_0))|~(relation_inverse_image(esk14_0,singleton(X6))=empty_set))&~(subset(esk13_0,relation_rng(esk14_0))))),inference(skolemize,[status(esa)],[162])).
% fof(164, negated_conjecture,![X6]:(((~(in(X6,esk13_0))|~(relation_inverse_image(esk14_0,singleton(X6))=empty_set))&~(subset(esk13_0,relation_rng(esk14_0))))&relation(esk14_0)),inference(shift_quantors,[status(thm)],[163])).
% cnf(165,negated_conjecture,(relation(esk14_0)),inference(split_conjunct,[status(thm)],[164])).
% cnf(166,negated_conjecture,(~subset(esk13_0,relation_rng(esk14_0))),inference(split_conjunct,[status(thm)],[164])).
% cnf(167,negated_conjecture,(relation_inverse_image(esk14_0,singleton(X1))!=empty_set|~in(X1,esk13_0)),inference(split_conjunct,[status(thm)],[164])).
% cnf(229,negated_conjecture,(relation_inverse_image(esk14_0,singleton(X1))=empty_set|in(X1,relation_rng(esk14_0))),inference(pm,[status(thm)],[59,165,theory(equality)])).
% cnf(424,negated_conjecture,(in(X1,relation_rng(esk14_0))|~in(X1,esk13_0)),inference(pm,[status(thm)],[167,229,theory(equality)])).
% cnf(428,negated_conjecture,(in(esk1_2(esk13_0,X1),relation_rng(esk14_0))|subset(esk13_0,X1)),inference(pm,[status(thm)],[424,52,theory(equality)])).
% cnf(452,negated_conjecture,(subset(esk13_0,relation_rng(esk14_0))),inference(pm,[status(thm)],[51,428,theory(equality)])).
% cnf(453,negated_conjecture,($false),inference(sr,[status(thm)],[452,166,theory(equality)])).
% cnf(454,negated_conjecture,($false),453,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 139
% # ...of these trivial : 7
% # ...subsumed : 14
% # ...remaining for further processing: 118
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 26
% # Generated clauses : 186
% # ...of the previous two non-trivial : 161
% # Contextual simplify-reflections : 0
% # Paramodulations : 180
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 92
% # Positive orientable unit clauses: 30
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 53
% # Current number of unprocessed clauses: 31
% # ...number of literals in the above : 72
% # Clause-clause subsumption calls (NU) : 72
% # Rec. Clause-clause subsumption calls : 61
% # Unit Clause-clause subsumption calls : 114
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 14
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 104 leaves, 1.17+/-0.489 terms/leaf
% # Paramod-from index: 42 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 90 leaves, 1.14+/-0.410 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.004 s
% # Total time : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP15836/SEU062+1.tptp
%
%------------------------------------------------------------------------------