TSTP Solution File: SET693+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET693+4 : TPTP v5.0.0. Released v2.2.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 : Wed Dec 29 23:30:53 EST 2010
% Result : Theorem 2.97s
% Output : Solution 2.97s
% 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/SystemOnTPTP7440/SET693+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7440/SET693+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7440/SET693+4.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 7536
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.93 CPU 2.01 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(equal_set(X1,X2)<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_set)).
% fof(2, axiom,![X3]:![X1]:![X2]:(member(X3,union(X1,X2))<=>(member(X3,X1)|member(X3,X2))),file('/tmp/SRASS.s.p', union)).
% fof(3, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset)).
% fof(4, axiom,![X3]:![X1]:(member(X3,power_set(X1))<=>subset(X3,X1)),file('/tmp/SRASS.s.p', power_set)).
% fof(12, conjecture,![X1]:![X2]:(equal_set(X1,union(X1,X2))<=>subset(X2,X1)),file('/tmp/SRASS.s.p', thI20)).
% fof(13, negated_conjecture,~(![X1]:![X2]:(equal_set(X1,union(X1,X2))<=>subset(X2,X1))),inference(assume_negation,[status(cth)],[12])).
% fof(16, plain,![X1]:![X2]:((~(equal_set(X1,X2))|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|equal_set(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(17, plain,![X3]:![X4]:((~(equal_set(X3,X4))|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|equal_set(X3,X4))),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X3]:![X4]:(((subset(X3,X4)|~(equal_set(X3,X4)))&(subset(X4,X3)|~(equal_set(X3,X4))))&((~(subset(X3,X4))|~(subset(X4,X3)))|equal_set(X3,X4))),inference(distribute,[status(thm)],[17])).
% cnf(19,plain,(equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(subset(X2,X1)|~equal_set(X1,X2)),inference(split_conjunct,[status(thm)],[18])).
% fof(22, plain,![X3]:![X1]:![X2]:((~(member(X3,union(X1,X2)))|(member(X3,X1)|member(X3,X2)))&((~(member(X3,X1))&~(member(X3,X2)))|member(X3,union(X1,X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(23, plain,![X4]:![X5]:![X6]:((~(member(X4,union(X5,X6)))|(member(X4,X5)|member(X4,X6)))&((~(member(X4,X5))&~(member(X4,X6)))|member(X4,union(X5,X6)))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:((~(member(X4,union(X5,X6)))|(member(X4,X5)|member(X4,X6)))&((~(member(X4,X5))|member(X4,union(X5,X6)))&(~(member(X4,X6))|member(X4,union(X5,X6))))),inference(distribute,[status(thm)],[23])).
% cnf(25,plain,(member(X1,union(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(member(X1,union(X2,X3))|~member(X1,X2)),inference(split_conjunct,[status(thm)],[24])).
% cnf(27,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))),inference(split_conjunct,[status(thm)],[24])).
% fof(28, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(29, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&(?[X7]:(member(X7,X4)&~(member(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[29])).
% fof(31, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[30])).
% fof(32, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[31])).
% cnf(33,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[32])).
% cnf(34,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(35,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(36, plain,![X3]:![X1]:((~(member(X3,power_set(X1)))|subset(X3,X1))&(~(subset(X3,X1))|member(X3,power_set(X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(37, plain,![X4]:![X5]:((~(member(X4,power_set(X5)))|subset(X4,X5))&(~(subset(X4,X5))|member(X4,power_set(X5)))),inference(variable_rename,[status(thm)],[36])).
% cnf(38,plain,(member(X1,power_set(X2))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,plain,(subset(X1,X2)|~member(X1,power_set(X2))),inference(split_conjunct,[status(thm)],[37])).
% fof(80, negated_conjecture,?[X1]:?[X2]:((~(equal_set(X1,union(X1,X2)))|~(subset(X2,X1)))&(equal_set(X1,union(X1,X2))|subset(X2,X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X3]:?[X4]:((~(equal_set(X3,union(X3,X4)))|~(subset(X4,X3)))&(equal_set(X3,union(X3,X4))|subset(X4,X3))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,((~(equal_set(esk4_0,union(esk4_0,esk5_0)))|~(subset(esk5_0,esk4_0)))&(equal_set(esk4_0,union(esk4_0,esk5_0))|subset(esk5_0,esk4_0))),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(subset(esk5_0,esk4_0)|equal_set(esk4_0,union(esk4_0,esk5_0))),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,negated_conjecture,(~subset(esk5_0,esk4_0)|~equal_set(esk4_0,union(esk4_0,esk5_0))),inference(split_conjunct,[status(thm)],[82])).
% cnf(89,negated_conjecture,(subset(union(esk4_0,esk5_0),esk4_0)|subset(esk5_0,esk4_0)),inference(spm,[status(thm)],[20,83,theory(equality)])).
% cnf(91,negated_conjecture,(~subset(esk5_0,esk4_0)|~subset(union(esk4_0,esk5_0),esk4_0)|~subset(esk4_0,union(esk4_0,esk5_0))),inference(spm,[status(thm)],[84,19,theory(equality)])).
% cnf(95,plain,(member(X1,power_set(X2))|member(esk1_2(X1,X2),X1)),inference(spm,[status(thm)],[38,34,theory(equality)])).
% cnf(96,plain,(member(X1,power_set(X2))|~member(esk1_2(X1,X2),X2)),inference(spm,[status(thm)],[38,33,theory(equality)])).
% cnf(137,negated_conjecture,(member(esk1_2(union(esk4_0,esk5_0),esk4_0),union(esk4_0,esk5_0))|~subset(esk4_0,union(esk4_0,esk5_0))|~subset(esk5_0,esk4_0)),inference(spm,[status(thm)],[91,34,theory(equality)])).
% cnf(138,negated_conjecture,(~subset(esk4_0,union(esk4_0,esk5_0))|~subset(esk5_0,esk4_0)|~member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk4_0)),inference(spm,[status(thm)],[91,33,theory(equality)])).
% cnf(142,negated_conjecture,(member(X1,esk4_0)|subset(esk5_0,esk4_0)|~member(X1,union(esk4_0,esk5_0))),inference(spm,[status(thm)],[35,89,theory(equality)])).
% cnf(171,negated_conjecture,(member(X1,esk4_0)|subset(esk5_0,esk4_0)|~member(X1,esk5_0)),inference(spm,[status(thm)],[142,25,theory(equality)])).
% cnf(181,plain,(member(X1,power_set(union(X2,X3)))|~member(esk1_2(X1,union(X2,X3)),X2)),inference(spm,[status(thm)],[96,26,theory(equality)])).
% cnf(194,negated_conjecture,(member(X1,esk4_0)|~member(X1,esk5_0)),inference(csr,[status(thm)],[171,35])).
% cnf(197,negated_conjecture,(member(esk1_2(esk5_0,X1),esk4_0)|member(esk5_0,power_set(X1))),inference(spm,[status(thm)],[194,95,theory(equality)])).
% cnf(217,negated_conjecture,(~member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk4_0)|~subset(esk5_0,esk4_0)|~member(esk4_0,power_set(union(esk4_0,esk5_0)))),inference(spm,[status(thm)],[138,39,theory(equality)])).
% cnf(281,negated_conjecture,(member(esk1_2(union(esk4_0,esk5_0),esk4_0),union(esk4_0,esk5_0))|~subset(esk5_0,esk4_0)|~member(esk4_0,power_set(union(esk4_0,esk5_0)))),inference(spm,[status(thm)],[137,39,theory(equality)])).
% cnf(299,negated_conjecture,(member(esk5_0,power_set(esk4_0))),inference(spm,[status(thm)],[96,197,theory(equality)])).
% cnf(6813,plain,(member(X1,power_set(union(X1,X2)))),inference(spm,[status(thm)],[181,95,theory(equality)])).
% cnf(6930,negated_conjecture,(~member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk4_0)|$false|~subset(esk5_0,esk4_0)),inference(rw,[status(thm)],[217,6813,theory(equality)])).
% cnf(6931,negated_conjecture,(~member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk4_0)|~subset(esk5_0,esk4_0)),inference(cn,[status(thm)],[6930,theory(equality)])).
% cnf(22235,negated_conjecture,(member(esk1_2(union(esk4_0,esk5_0),esk4_0),union(esk4_0,esk5_0))|~subset(esk5_0,esk4_0)|$false),inference(rw,[status(thm)],[281,6813,theory(equality)])).
% cnf(22236,negated_conjecture,(member(esk1_2(union(esk4_0,esk5_0),esk4_0),union(esk4_0,esk5_0))|~subset(esk5_0,esk4_0)),inference(cn,[status(thm)],[22235,theory(equality)])).
% cnf(22251,negated_conjecture,(member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk4_0)|member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk5_0)|~subset(esk5_0,esk4_0)),inference(spm,[status(thm)],[27,22236,theory(equality)])).
% cnf(50244,negated_conjecture,(member(esk1_2(union(esk4_0,esk5_0),esk4_0),esk4_0)|~subset(esk5_0,esk4_0)),inference(csr,[status(thm)],[22251,35])).
% cnf(50245,negated_conjecture,(~subset(esk5_0,esk4_0)),inference(csr,[status(thm)],[50244,6931])).
% cnf(50249,negated_conjecture,(~member(esk5_0,power_set(esk4_0))),inference(spm,[status(thm)],[50245,39,theory(equality)])).
% cnf(50261,negated_conjecture,($false),inference(rw,[status(thm)],[50249,299,theory(equality)])).
% cnf(50262,negated_conjecture,($false),inference(cn,[status(thm)],[50261,theory(equality)])).
% cnf(50263,negated_conjecture,($false),50262,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1137
% # ...of these trivial : 151
% # ...subsumed : 79
% # ...remaining for further processing: 907
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 9
% # Backward-rewritten : 39
% # Generated clauses : 43463
% # ...of the previous two non-trivial : 38321
% # Contextual simplify-reflections : 21
% # Paramodulations : 43413
% # Factorizations : 28
% # Equation resolutions : 13
% # Current number of processed clauses: 816
% # Positive orientable unit clauses: 558
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 47
% # Non-unit-clauses : 211
% # Current number of unprocessed clauses: 31916
% # ...number of literals in the above : 77884
% # Clause-clause subsumption calls (NU) : 2064
% # Rec. Clause-clause subsumption calls : 1858
% # Unit Clause-clause subsumption calls : 156
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 26319
% # Indexed BW rewrite successes : 38
% # Backwards rewriting index: 415 leaves, 4.60+/-12.298 terms/leaf
% # Paramod-from index: 127 leaves, 5.30+/-18.767 terms/leaf
% # Paramod-into index: 368 leaves, 4.93+/-12.955 terms/leaf
% # -------------------------------------------------
% # User time : 1.370 s
% # System time : 0.070 s
% # Total time : 1.440 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.18 CPU 2.27 WC
% FINAL PrfWatch: 2.18 CPU 2.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP7440/SET693+4.tptp
%
%------------------------------------------------------------------------------