TSTP Solution File: SEU124+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU124+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 : 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 01:10:45 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP15189/SEU124+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15189/SEU124+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15189/SEU124+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 15285
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(13, axiom,![X1]:![X2]:![X3]:(X3=set_union2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)|in(X4,X2)))),file('/tmp/SRASS.s.p', d2_xboole_0)).
% fof(31, conjecture,![X1]:![X2]:subset(X1,set_union2(X1,X2)),file('/tmp/SRASS.s.p', t7_xboole_1)).
% fof(32, negated_conjecture,~(![X1]:![X2]:subset(X1,set_union2(X1,X2))),inference(assume_negation,[status(cth)],[31])).
% fof(55, 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)],[6])).
% fof(56, 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)],[55])).
% fof(57, 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)],[56])).
% fof(58, 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)],[57])).
% fof(59, 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)],[58])).
% cnf(60,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[59])).
% cnf(61,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(80, plain,![X1]:![X2]:![X3]:((~(X3=set_union2(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_union2(X1,X2))),inference(fof_nnf,[status(thm)],[13])).
% fof(81, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(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_union2(X5,X6))),inference(variable_rename,[status(thm)],[80])).
% fof(82, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))&~(in(esk4_3(X5,X6,X7),X6))))&(in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(skolemize,[status(esa)],[81])).
% fof(83, 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_union2(X5,X6)))&(((~(in(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))&~(in(esk4_3(X5,X6,X7),X6))))&(in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(shift_quantors,[status(thm)],[82])).
% fof(84, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))|~(X7=set_union2(X5,X6)))&(((~(in(X8,X5))|in(X8,X7))|~(X7=set_union2(X5,X6)))&((~(in(X8,X6))|in(X8,X7))|~(X7=set_union2(X5,X6)))))&((((~(in(esk4_3(X5,X6,X7),X5))|~(in(esk4_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6))&((~(in(esk4_3(X5,X6,X7),X6))|~(in(esk4_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6)))&((in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X6)))|X7=set_union2(X5,X6)))),inference(distribute,[status(thm)],[83])).
% cnf(89,plain,(in(X4,X1)|X1!=set_union2(X2,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[84])).
% fof(151, negated_conjecture,?[X1]:?[X2]:~(subset(X1,set_union2(X1,X2))),inference(fof_nnf,[status(thm)],[32])).
% fof(152, negated_conjecture,?[X3]:?[X4]:~(subset(X3,set_union2(X3,X4))),inference(variable_rename,[status(thm)],[151])).
% fof(153, negated_conjecture,~(subset(esk9_0,set_union2(esk9_0,esk10_0))),inference(skolemize,[status(esa)],[152])).
% cnf(154,negated_conjecture,(~subset(esk9_0,set_union2(esk9_0,esk10_0))),inference(split_conjunct,[status(thm)],[153])).
% cnf(182,negated_conjecture,(in(esk1_2(esk9_0,set_union2(esk9_0,esk10_0)),esk9_0)),inference(spm,[status(thm)],[154,61,theory(equality)])).
% cnf(186,negated_conjecture,(~in(esk1_2(esk9_0,set_union2(esk9_0,esk10_0)),set_union2(esk9_0,esk10_0))),inference(spm,[status(thm)],[154,60,theory(equality)])).
% cnf(214,plain,(in(X1,set_union2(X2,X3))|~in(X1,X2)),inference(er,[status(thm)],[89,theory(equality)])).
% cnf(662,negated_conjecture,(~in(esk1_2(esk9_0,set_union2(esk9_0,esk10_0)),esk9_0)),inference(spm,[status(thm)],[186,214,theory(equality)])).
% cnf(674,negated_conjecture,($false),inference(rw,[status(thm)],[662,182,theory(equality)])).
% cnf(675,negated_conjecture,($false),inference(cn,[status(thm)],[674,theory(equality)])).
% cnf(676,negated_conjecture,($false),675,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 196
% # ...of these trivial : 3
% # ...subsumed : 48
% # ...remaining for further processing: 145
% # Other redundant clauses eliminated : 17
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 459
% # ...of the previous two non-trivial : 376
% # Contextual simplify-reflections : 2
% # Paramodulations : 428
% # Factorizations : 6
% # Equation resolutions : 25
% # Current number of processed clauses: 94
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 10
% # Non-unit-clauses : 68
% # Current number of unprocessed clauses: 262
% # ...number of literals in the above : 958
% # Clause-clause subsumption calls (NU) : 252
% # Rec. Clause-clause subsumption calls : 245
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 18
% # Indexed BW rewrite successes : 18
% # Backwards rewriting index: 60 leaves, 1.63+/-1.378 terms/leaf
% # Paramod-from index: 25 leaves, 1.40+/-0.748 terms/leaf
% # Paramod-into index: 58 leaves, 1.43+/-1.131 terms/leaf
% # -------------------------------------------------
% # User time : 0.031 s
% # System time : 0.003 s
% # Total time : 0.034 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP15189/SEU124+2.tptp
%
%------------------------------------------------------------------------------