TSTP Solution File: SET696+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET696+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 : art01.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:31:46 EST 2010
% Result : Theorem 1.06s
% Output : Solution 1.06s
% 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/SystemOnTPTP3692/SET696+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3692/SET696+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3692/SET696+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 3788
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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,![X3]:~(member(X3,empty_set)),file('/tmp/SRASS.s.p', empty_set)).
% fof(4, axiom,![X2]:![X1]:![X4]:(member(X2,difference(X4,X1))<=>(member(X2,X4)&~(member(X2,X1)))),file('/tmp/SRASS.s.p', difference)).
% fof(5, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset)).
% fof(12, conjecture,![X1]:![X4]:(subset(X1,X4)=>equal_set(intersection(difference(X4,X1),X1),empty_set)),file('/tmp/SRASS.s.p', thI28)).
% fof(13, negated_conjecture,~(![X1]:![X4]:(subset(X1,X4)=>equal_set(intersection(difference(X4,X1),X1),empty_set))),inference(assume_negation,[status(cth)],[12])).
% fof(14, plain,![X3]:~(member(X3,empty_set)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(15, plain,![X2]:![X1]:![X4]:(member(X2,difference(X4,X1))<=>(member(X2,X4)&~(member(X2,X1)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% 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])).
% 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(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,![X4]:~(member(X4,empty_set)),inference(variable_rename,[status(thm)],[14])).
% cnf(29,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X2]:![X1]:![X4]:((~(member(X2,difference(X4,X1)))|(member(X2,X4)&~(member(X2,X1))))&((~(member(X2,X4))|member(X2,X1))|member(X2,difference(X4,X1)))),inference(fof_nnf,[status(thm)],[15])).
% fof(31, plain,![X5]:![X6]:![X7]:((~(member(X5,difference(X7,X6)))|(member(X5,X7)&~(member(X5,X6))))&((~(member(X5,X7))|member(X5,X6))|member(X5,difference(X7,X6)))),inference(variable_rename,[status(thm)],[30])).
% fof(32, plain,![X5]:![X6]:![X7]:(((member(X5,X7)|~(member(X5,difference(X7,X6))))&(~(member(X5,X6))|~(member(X5,difference(X7,X6)))))&((~(member(X5,X7))|member(X5,X6))|member(X5,difference(X7,X6)))),inference(distribute,[status(thm)],[31])).
% cnf(34,plain,(~member(X1,difference(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[32])).
% fof(36, 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)],[5])).
% fof(37, 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)],[36])).
% fof(38, 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)],[37])).
% fof(39, 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)],[38])).
% fof(40, 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)],[39])).
% cnf(42,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(80, negated_conjecture,?[X1]:?[X4]:(subset(X1,X4)&~(equal_set(intersection(difference(X4,X1),X1),empty_set))),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X5]:?[X6]:(subset(X5,X6)&~(equal_set(intersection(difference(X6,X5),X5),empty_set))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,(subset(esk4_0,esk5_0)&~(equal_set(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set))),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(~equal_set(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set)),inference(split_conjunct,[status(thm)],[82])).
% cnf(88,negated_conjecture,(~subset(empty_set,intersection(difference(esk5_0,esk4_0),esk4_0))|~subset(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set)),inference(spm,[status(thm)],[83,19,theory(equality)])).
% cnf(144,negated_conjecture,(member(esk1_2(empty_set,intersection(difference(esk5_0,esk4_0),esk4_0)),empty_set)|~subset(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set)),inference(spm,[status(thm)],[88,42,theory(equality)])).
% cnf(146,negated_conjecture,(~subset(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set)),inference(sr,[status(thm)],[144,29,theory(equality)])).
% cnf(148,negated_conjecture,(member(esk1_2(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set),intersection(difference(esk5_0,esk4_0),esk4_0))),inference(spm,[status(thm)],[146,42,theory(equality)])).
% cnf(151,negated_conjecture,(member(esk1_2(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set),difference(esk5_0,esk4_0))),inference(spm,[status(thm)],[27,148,theory(equality)])).
% cnf(152,negated_conjecture,(member(esk1_2(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set),esk4_0)),inference(spm,[status(thm)],[26,148,theory(equality)])).
% cnf(156,negated_conjecture,(~member(esk1_2(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set),esk4_0)),inference(spm,[status(thm)],[34,151,theory(equality)])).
% cnf(157,negated_conjecture,($false),inference(rw,[status(thm)],[156,152,theory(equality)])).
% cnf(158,negated_conjecture,($false),inference(cn,[status(thm)],[157,theory(equality)])).
% cnf(159,negated_conjecture,($false),158,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 76
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 76
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 71
% # ...of the previous two non-trivial : 61
% # Contextual simplify-reflections : 0
% # Paramodulations : 68
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 42
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 27
% # Current number of unprocessed clauses: 47
% # ...number of literals in the above : 108
% # Clause-clause subsumption calls (NU) : 26
% # Rec. Clause-clause subsumption calls : 26
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 54 leaves, 1.31+/-0.662 terms/leaf
% # Paramod-from index: 18 leaves, 1.06+/-0.229 terms/leaf
% # Paramod-into index: 46 leaves, 1.22+/-0.507 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.003 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.43 WC
% FINAL PrfWatch: 0.13 CPU 0.43 WC
% SZS output end Solution for /tmp/SystemOnTPTP3692/SET696+4.tptp
%
%------------------------------------------------------------------------------