TSTP Solution File: SEU250+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU250+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 : art04.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 02:27:42 EST 2010
% Result : Theorem 1.16s
% Output : Solution 1.16s
% 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/SystemOnTPTP12253/SEU250+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12253/SEU250+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12253/SEU250+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 12349
% 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(3, axiom,![X1]:![X2]:![X3]:(relation(X3)=>(in(X1,relation_field(relation_restriction(X3,X2)))=>(in(X1,relation_field(X3))&in(X1,X2)))),file('/tmp/SRASS.s.p', t19_wellord1)).
% fof(4, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(42, conjecture,![X1]:![X2]:(relation(X2)=>(subset(relation_field(relation_restriction(X2,X1)),relation_field(X2))&subset(relation_field(relation_restriction(X2,X1)),X1))),file('/tmp/SRASS.s.p', t20_wellord1)).
% fof(43, negated_conjecture,~(![X1]:![X2]:(relation(X2)=>(subset(relation_field(relation_restriction(X2,X1)),relation_field(X2))&subset(relation_field(relation_restriction(X2,X1)),X1)))),inference(assume_negation,[status(cth)],[42])).
% fof(53, plain,![X1]:![X2]:![X3]:(~(relation(X3))|(~(in(X1,relation_field(relation_restriction(X3,X2))))|(in(X1,relation_field(X3))&in(X1,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(54, plain,![X4]:![X5]:![X6]:(~(relation(X6))|(~(in(X4,relation_field(relation_restriction(X6,X5))))|(in(X4,relation_field(X6))&in(X4,X5)))),inference(variable_rename,[status(thm)],[53])).
% fof(55, plain,![X4]:![X5]:![X6]:(((in(X4,relation_field(X6))|~(in(X4,relation_field(relation_restriction(X6,X5)))))|~(relation(X6)))&((in(X4,X5)|~(in(X4,relation_field(relation_restriction(X6,X5)))))|~(relation(X6)))),inference(distribute,[status(thm)],[54])).
% cnf(56,plain,(in(X2,X3)|~relation(X1)|~in(X2,relation_field(relation_restriction(X1,X3)))),inference(split_conjunct,[status(thm)],[55])).
% cnf(57,plain,(in(X2,relation_field(X1))|~relation(X1)|~in(X2,relation_field(relation_restriction(X1,X3)))),inference(split_conjunct,[status(thm)],[55])).
% fof(58, 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)],[4])).
% fof(59, 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)],[58])).
% fof(60, 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)],[59])).
% fof(61, 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)],[60])).
% fof(62, 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)],[61])).
% cnf(63,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(161, negated_conjecture,?[X1]:?[X2]:(relation(X2)&(~(subset(relation_field(relation_restriction(X2,X1)),relation_field(X2)))|~(subset(relation_field(relation_restriction(X2,X1)),X1)))),inference(fof_nnf,[status(thm)],[43])).
% fof(162, negated_conjecture,?[X3]:?[X4]:(relation(X4)&(~(subset(relation_field(relation_restriction(X4,X3)),relation_field(X4)))|~(subset(relation_field(relation_restriction(X4,X3)),X3)))),inference(variable_rename,[status(thm)],[161])).
% fof(163, negated_conjecture,(relation(esk9_0)&(~(subset(relation_field(relation_restriction(esk9_0,esk8_0)),relation_field(esk9_0)))|~(subset(relation_field(relation_restriction(esk9_0,esk8_0)),esk8_0)))),inference(skolemize,[status(esa)],[162])).
% cnf(164,negated_conjecture,(~subset(relation_field(relation_restriction(esk9_0,esk8_0)),esk8_0)|~subset(relation_field(relation_restriction(esk9_0,esk8_0)),relation_field(esk9_0))),inference(split_conjunct,[status(thm)],[163])).
% cnf(165,negated_conjecture,(relation(esk9_0)),inference(split_conjunct,[status(thm)],[163])).
% cnf(210,plain,(in(esk1_2(relation_field(relation_restriction(X1,X2)),X3),X2)|subset(relation_field(relation_restriction(X1,X2)),X3)|~relation(X1)),inference(pm,[status(thm)],[56,64,theory(equality)])).
% cnf(225,plain,(in(esk1_2(relation_field(relation_restriction(X1,X2)),X3),relation_field(X1))|subset(relation_field(relation_restriction(X1,X2)),X3)|~relation(X1)),inference(pm,[status(thm)],[57,64,theory(equality)])).
% cnf(345,negated_conjecture,(in(esk1_2(relation_field(relation_restriction(esk9_0,X1)),X2),X1)|subset(relation_field(relation_restriction(esk9_0,X1)),X2)),inference(pm,[status(thm)],[210,165,theory(equality)])).
% cnf(578,negated_conjecture,(in(esk1_2(relation_field(relation_restriction(esk9_0,X1)),X2),relation_field(esk9_0))|subset(relation_field(relation_restriction(esk9_0,X1)),X2)),inference(pm,[status(thm)],[225,165,theory(equality)])).
% cnf(859,negated_conjecture,(subset(relation_field(relation_restriction(esk9_0,X1)),X1)),inference(pm,[status(thm)],[63,345,theory(equality)])).
% cnf(877,negated_conjecture,(~subset(relation_field(relation_restriction(esk9_0,esk8_0)),relation_field(esk9_0))|$false),inference(rw,[status(thm)],[164,859,theory(equality)])).
% cnf(878,negated_conjecture,(~subset(relation_field(relation_restriction(esk9_0,esk8_0)),relation_field(esk9_0))),inference(cn,[status(thm)],[877,theory(equality)])).
% cnf(5292,negated_conjecture,(subset(relation_field(relation_restriction(esk9_0,X1)),relation_field(esk9_0))),inference(pm,[status(thm)],[63,578,theory(equality)])).
% cnf(5300,negated_conjecture,($false),inference(rw,[status(thm)],[878,5292,theory(equality)])).
% cnf(5301,negated_conjecture,($false),inference(cn,[status(thm)],[5300,theory(equality)])).
% cnf(5302,negated_conjecture,($false),5301,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 795
% # ...of these trivial : 23
% # ...subsumed : 213
% # ...remaining for further processing: 559
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 8
% # Backward-rewritten : 114
% # Generated clauses : 4477
% # ...of the previous two non-trivial : 4183
% # Contextual simplify-reflections : 0
% # Paramodulations : 4447
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 437
% # Positive orientable unit clauses: 118
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 12
% # Non-unit-clauses : 305
% # Current number of unprocessed clauses: 2175
% # ...number of literals in the above : 5136
% # Clause-clause subsumption calls (NU) : 2312
% # Rec. Clause-clause subsumption calls : 2201
% # Unit Clause-clause subsumption calls : 1945
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 733
% # Indexed BW rewrite successes : 62
% # Backwards rewriting index: 266 leaves, 2.71+/-4.974 terms/leaf
% # Paramod-from index: 115 leaves, 1.71+/-2.101 terms/leaf
% # Paramod-into index: 218 leaves, 2.08+/-2.835 terms/leaf
% # -------------------------------------------------
% # User time : 0.161 s
% # System time : 0.010 s
% # Total time : 0.171 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/SystemOnTPTP12253/SEU250+1.tptp
%
%------------------------------------------------------------------------------