TSTP Solution File: SET692+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET692+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:39 EST 2010
% Result : Theorem 1.65s
% Output : Solution 1.65s
% 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/SystemOnTPTP7181/SET692+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7181/SET692+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7181/SET692+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 7277
% 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(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,intersection(X1,X2))<=>(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersection)).
% 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,intersection(X1,X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', thI19)).
% fof(13, negated_conjecture,~(![X1]:![X2]:(equal_set(X1,intersection(X1,X2))<=>subset(X1,X2))),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(21,plain,(subset(X1,X2)|~equal_set(X1,X2)),inference(split_conjunct,[status(thm)],[18])).
% fof(22, plain,![X3]:![X1]:![X2]:((~(member(X3,intersection(X1,X2)))|(member(X3,X1)&member(X3,X2)))&((~(member(X3,X1))|~(member(X3,X2)))|member(X3,intersection(X1,X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(23, plain,![X4]:![X5]:![X6]:((~(member(X4,intersection(X5,X6)))|(member(X4,X5)&member(X4,X6)))&((~(member(X4,X5))|~(member(X4,X6)))|member(X4,intersection(X5,X6)))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:(((member(X4,X5)|~(member(X4,intersection(X5,X6))))&(member(X4,X6)|~(member(X4,intersection(X5,X6)))))&((~(member(X4,X5))|~(member(X4,X6)))|member(X4,intersection(X5,X6)))),inference(distribute,[status(thm)],[23])).
% cnf(25,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[24])).
% cnf(27,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),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,intersection(X1,X2)))|~(subset(X1,X2)))&(equal_set(X1,intersection(X1,X2))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X3]:?[X4]:((~(equal_set(X3,intersection(X3,X4)))|~(subset(X3,X4)))&(equal_set(X3,intersection(X3,X4))|subset(X3,X4))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,((~(equal_set(esk4_0,intersection(esk4_0,esk5_0)))|~(subset(esk4_0,esk5_0)))&(equal_set(esk4_0,intersection(esk4_0,esk5_0))|subset(esk4_0,esk5_0))),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(subset(esk4_0,esk5_0)|equal_set(esk4_0,intersection(esk4_0,esk5_0))),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,negated_conjecture,(~subset(esk4_0,esk5_0)|~equal_set(esk4_0,intersection(esk4_0,esk5_0))),inference(split_conjunct,[status(thm)],[82])).
% cnf(88,negated_conjecture,(subset(esk4_0,intersection(esk4_0,esk5_0))|subset(esk4_0,esk5_0)),inference(spm,[status(thm)],[21,83,theory(equality)])).
% cnf(91,negated_conjecture,(~subset(esk4_0,esk5_0)|~subset(intersection(esk4_0,esk5_0),esk4_0)|~subset(esk4_0,intersection(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(136,negated_conjecture,(~subset(esk4_0,intersection(esk4_0,esk5_0))|~subset(esk4_0,esk5_0)|~member(intersection(esk4_0,esk5_0),power_set(esk4_0))),inference(spm,[status(thm)],[91,39,theory(equality)])).
% cnf(140,negated_conjecture,(member(X1,intersection(esk4_0,esk5_0))|subset(esk4_0,esk5_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[35,88,theory(equality)])).
% cnf(155,plain,(member(esk1_2(intersection(X1,X2),X3),X1)|member(intersection(X1,X2),power_set(X3))),inference(spm,[status(thm)],[27,95,theory(equality)])).
% cnf(163,negated_conjecture,(member(esk1_2(esk4_0,intersection(esk4_0,esk5_0)),esk4_0)|~member(intersection(esk4_0,esk5_0),power_set(esk4_0))|~subset(esk4_0,esk5_0)),inference(spm,[status(thm)],[136,34,theory(equality)])).
% cnf(169,negated_conjecture,(member(X1,esk5_0)|subset(esk4_0,esk5_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[26,140,theory(equality)])).
% cnf(170,negated_conjecture,(member(X1,esk5_0)|~member(X1,esk4_0)),inference(csr,[status(thm)],[169,35])).
% cnf(175,negated_conjecture,(member(X1,power_set(esk5_0))|~member(esk1_2(X1,esk5_0),esk4_0)),inference(spm,[status(thm)],[96,170,theory(equality)])).
% cnf(387,negated_conjecture,(member(esk4_0,power_set(esk5_0))),inference(spm,[status(thm)],[175,95,theory(equality)])).
% cnf(4301,plain,(member(intersection(X1,X2),power_set(X1))),inference(spm,[status(thm)],[96,155,theory(equality)])).
% cnf(4374,negated_conjecture,(member(esk1_2(esk4_0,intersection(esk4_0,esk5_0)),esk4_0)|$false|~subset(esk4_0,esk5_0)),inference(rw,[status(thm)],[163,4301,theory(equality)])).
% cnf(4375,negated_conjecture,(member(esk1_2(esk4_0,intersection(esk4_0,esk5_0)),esk4_0)|~subset(esk4_0,esk5_0)),inference(cn,[status(thm)],[4374,theory(equality)])).
% cnf(4378,negated_conjecture,($false|~subset(esk4_0,intersection(esk4_0,esk5_0))|~subset(esk4_0,esk5_0)),inference(rw,[status(thm)],[136,4301,theory(equality)])).
% cnf(4379,negated_conjecture,(~subset(esk4_0,intersection(esk4_0,esk5_0))|~subset(esk4_0,esk5_0)),inference(cn,[status(thm)],[4378,theory(equality)])).
% cnf(4393,negated_conjecture,(~subset(esk4_0,esk5_0)|~member(esk1_2(esk4_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,esk5_0))),inference(spm,[status(thm)],[4379,33,theory(equality)])).
% cnf(4408,negated_conjecture,(~subset(esk4_0,esk5_0)|~member(esk1_2(esk4_0,intersection(esk4_0,esk5_0)),esk5_0)|~member(esk1_2(esk4_0,intersection(esk4_0,esk5_0)),esk4_0)),inference(spm,[status(thm)],[4393,25,theory(equality)])).
% cnf(18945,negated_conjecture,(~member(esk1_2(esk4_0,intersection(esk4_0,esk5_0)),esk5_0)|~subset(esk4_0,esk5_0)),inference(csr,[status(thm)],[4408,4375])).
% cnf(18946,negated_conjecture,(~subset(esk4_0,esk5_0)|~member(esk1_2(esk4_0,intersection(esk4_0,esk5_0)),esk4_0)),inference(spm,[status(thm)],[18945,170,theory(equality)])).
% cnf(18948,negated_conjecture,(~subset(esk4_0,esk5_0)),inference(csr,[status(thm)],[18946,4375])).
% cnf(18949,negated_conjecture,(~member(esk4_0,power_set(esk5_0))),inference(spm,[status(thm)],[18948,39,theory(equality)])).
% cnf(18963,negated_conjecture,($false),inference(rw,[status(thm)],[18949,387,theory(equality)])).
% cnf(18964,negated_conjecture,($false),inference(cn,[status(thm)],[18963,theory(equality)])).
% cnf(18965,negated_conjecture,($false),18964,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 742
% # ...of these trivial : 45
% # ...subsumed : 54
% # ...remaining for further processing: 643
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 23
% # Generated clauses : 16596
% # ...of the previous two non-trivial : 14846
% # Contextual simplify-reflections : 10
% # Paramodulations : 16562
% # Factorizations : 14
% # Equation resolutions : 9
% # Current number of processed clauses: 571
% # Positive orientable unit clauses: 382
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 36
% # Non-unit-clauses : 153
% # Current number of unprocessed clauses: 11669
% # ...number of literals in the above : 27387
% # Clause-clause subsumption calls (NU) : 965
% # Rec. Clause-clause subsumption calls : 899
% # Unit Clause-clause subsumption calls : 114
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5893
% # Indexed BW rewrite successes : 20
% # Backwards rewriting index: 348 leaves, 3.57+/-6.296 terms/leaf
% # Paramod-from index: 102 leaves, 4.53+/-9.666 terms/leaf
% # Paramod-into index: 308 leaves, 3.79+/-6.540 terms/leaf
% # -------------------------------------------------
% # User time : 0.517 s
% # System time : 0.014 s
% # Total time : 0.531 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.87 CPU 0.95 WC
% FINAL PrfWatch: 0.87 CPU 0.95 WC
% SZS output end Solution for /tmp/SystemOnTPTP7181/SET692+4.tptp
%
%------------------------------------------------------------------------------