TSTP Solution File: SEU133+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU133+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 : art02.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:12:56 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP16716/SEU133+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16716/SEU133+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16716/SEU133+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 16812
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(8, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(16, axiom,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),file('/tmp/SRASS.s.p', d4_xboole_0)).
% fof(46, conjecture,![X1]:![X2]:subset(set_difference(X1,X2),X1),file('/tmp/SRASS.s.p', t36_xboole_1)).
% fof(47, negated_conjecture,~(![X1]:![X2]:subset(set_difference(X1,X2),X1)),inference(assume_negation,[status(cth)],[46])).
% fof(49, plain,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(79, 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)],[8])).
% fof(80, 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)],[79])).
% fof(81, 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)],[80])).
% fof(82, 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)],[81])).
% fof(83, 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)],[82])).
% cnf(84,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[83])).
% cnf(85,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[83])).
% fof(104, plain,![X1]:![X2]:![X3]:((~(X3=set_difference(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)&~(in(X4,X2))))&((~(in(X4,X1))|in(X4,X2))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))|in(X4,X2)))&(in(X4,X3)|(in(X4,X1)&~(in(X4,X2)))))|X3=set_difference(X1,X2))),inference(fof_nnf,[status(thm)],[49])).
% fof(105, plain,![X5]:![X6]:![X7]:((~(X7=set_difference(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))|in(X9,X6)))&(in(X9,X7)|(in(X9,X5)&~(in(X9,X6)))))|X7=set_difference(X5,X6))),inference(variable_rename,[status(thm)],[104])).
% fof(106, plain,![X5]:![X6]:![X7]:((~(X7=set_difference(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7))))&(((~(in(esk2_3(X5,X6,X7),X7))|(~(in(esk2_3(X5,X6,X7),X5))|in(esk2_3(X5,X6,X7),X6)))&(in(esk2_3(X5,X6,X7),X7)|(in(esk2_3(X5,X6,X7),X5)&~(in(esk2_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(skolemize,[status(esa)],[105])).
% fof(107, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7)))|~(X7=set_difference(X5,X6)))&(((~(in(esk2_3(X5,X6,X7),X7))|(~(in(esk2_3(X5,X6,X7),X5))|in(esk2_3(X5,X6,X7),X6)))&(in(esk2_3(X5,X6,X7),X7)|(in(esk2_3(X5,X6,X7),X5)&~(in(esk2_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(shift_quantors,[status(thm)],[106])).
% fof(108, plain,![X5]:![X6]:![X7]:![X8]:(((((in(X8,X5)|~(in(X8,X7)))|~(X7=set_difference(X5,X6)))&((~(in(X8,X6))|~(in(X8,X7)))|~(X7=set_difference(X5,X6))))&(((~(in(X8,X5))|in(X8,X6))|in(X8,X7))|~(X7=set_difference(X5,X6))))&(((~(in(esk2_3(X5,X6,X7),X7))|(~(in(esk2_3(X5,X6,X7),X5))|in(esk2_3(X5,X6,X7),X6)))|X7=set_difference(X5,X6))&(((in(esk2_3(X5,X6,X7),X5)|in(esk2_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))&((~(in(esk2_3(X5,X6,X7),X6))|in(esk2_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))))),inference(distribute,[status(thm)],[107])).
% cnf(114,plain,(in(X4,X2)|X1!=set_difference(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[108])).
% fof(217, negated_conjecture,?[X1]:?[X2]:~(subset(set_difference(X1,X2),X1)),inference(fof_nnf,[status(thm)],[47])).
% fof(218, negated_conjecture,?[X3]:?[X4]:~(subset(set_difference(X3,X4),X3)),inference(variable_rename,[status(thm)],[217])).
% fof(219, negated_conjecture,~(subset(set_difference(esk11_0,esk12_0),esk11_0)),inference(skolemize,[status(esa)],[218])).
% cnf(220,negated_conjecture,(~subset(set_difference(esk11_0,esk12_0),esk11_0)),inference(split_conjunct,[status(thm)],[219])).
% cnf(272,negated_conjecture,(in(esk1_2(set_difference(esk11_0,esk12_0),esk11_0),set_difference(esk11_0,esk12_0))),inference(spm,[status(thm)],[220,85,theory(equality)])).
% cnf(298,negated_conjecture,(~in(esk1_2(set_difference(esk11_0,esk12_0),esk11_0),esk11_0)),inference(spm,[status(thm)],[220,84,theory(equality)])).
% cnf(363,plain,(in(X1,X2)|~in(X1,set_difference(X2,X3))),inference(er,[status(thm)],[114,theory(equality)])).
% cnf(3994,negated_conjecture,(in(esk1_2(set_difference(esk11_0,esk12_0),esk11_0),esk11_0)),inference(spm,[status(thm)],[363,272,theory(equality)])).
% cnf(3996,negated_conjecture,($false),inference(sr,[status(thm)],[3994,298,theory(equality)])).
% cnf(3997,negated_conjecture,($false),3996,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 639
% # ...of these trivial : 23
% # ...subsumed : 327
% # ...remaining for further processing: 289
% # Other redundant clauses eliminated : 71
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 1
% # Generated clauses : 3061
% # ...of the previous two non-trivial : 2411
% # Contextual simplify-reflections : 13
% # Paramodulations : 2964
% # Factorizations : 12
% # Equation resolutions : 85
% # Current number of processed clauses: 215
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 18
% # Non-unit-clauses : 163
% # Current number of unprocessed clauses: 1854
% # ...number of literals in the above : 5419
% # Clause-clause subsumption calls (NU) : 1667
% # Rec. Clause-clause subsumption calls : 1624
% # Unit Clause-clause subsumption calls : 14
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 32
% # Indexed BW rewrite successes : 25
% # Backwards rewriting index: 106 leaves, 1.73+/-1.557 terms/leaf
% # Paramod-from index: 53 leaves, 1.49+/-0.768 terms/leaf
% # Paramod-into index: 98 leaves, 1.68+/-1.389 terms/leaf
% # -------------------------------------------------
% # User time : 0.097 s
% # System time : 0.008 s
% # Total time : 0.105 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.23 CPU 0.31 WC
% FINAL PrfWatch: 0.23 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP16716/SEU133+2.tptp
%
%------------------------------------------------------------------------------