TSTP Solution File: SET593+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET593+3 : 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:13:26 EST 2010
% Result : Theorem 0.98s
% Output : Solution 0.98s
% 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/SystemOnTPTP28174/SET593+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28174/SET593+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28174/SET593+3.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 28270
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),file('/tmp/SRASS.s.p', difference_defn)).
% fof(3, axiom,![X1]:![X2]:![X3]:(member(X3,union(X1,X2))<=>(member(X3,X1)|member(X3,X2))),file('/tmp/SRASS.s.p', union_defn)).
% fof(4, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(7, conjecture,![X1]:![X2]:![X3]:(subset(X1,union(X2,X3))=>(subset(difference(X1,X2),X3)&subset(difference(X1,X3),X2))),file('/tmp/SRASS.s.p', prove_th52)).
% fof(8, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(X1,union(X2,X3))=>(subset(difference(X1,X2),X3)&subset(difference(X1,X3),X2)))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(12, plain,![X1]:![X2]:![X3]:((~(member(X3,difference(X1,X2)))|(member(X3,X1)&~(member(X3,X2))))&((~(member(X3,X1))|member(X3,X2))|member(X3,difference(X1,X2)))),inference(fof_nnf,[status(thm)],[9])).
% fof(13, plain,![X4]:![X5]:![X6]:((~(member(X6,difference(X4,X5)))|(member(X6,X4)&~(member(X6,X5))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(variable_rename,[status(thm)],[12])).
% fof(14, plain,![X4]:![X5]:![X6]:(((member(X6,X4)|~(member(X6,difference(X4,X5))))&(~(member(X6,X5))|~(member(X6,difference(X4,X5)))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(distribute,[status(thm)],[13])).
% cnf(16,plain,(~member(X1,difference(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[14])).
% cnf(17,plain,(member(X1,X2)|~member(X1,difference(X2,X3))),inference(split_conjunct,[status(thm)],[14])).
% fof(18, plain,![X1]:![X2]:![X3]:((~(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)],[3])).
% fof(19, plain,![X4]:![X5]:![X6]:((~(member(X6,union(X4,X5)))|(member(X6,X4)|member(X6,X5)))&((~(member(X6,X4))&~(member(X6,X5)))|member(X6,union(X4,X5)))),inference(variable_rename,[status(thm)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:((~(member(X6,union(X4,X5)))|(member(X6,X4)|member(X6,X5)))&((~(member(X6,X4))|member(X6,union(X4,X5)))&(~(member(X6,X5))|member(X6,union(X4,X5))))),inference(distribute,[status(thm)],[19])).
% cnf(23,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))),inference(split_conjunct,[status(thm)],[20])).
% fof(24, 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)],[4])).
% fof(25, 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)],[24])).
% fof(26, 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)],[25])).
% fof(27, 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)],[26])).
% fof(28, 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)],[27])).
% cnf(29,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[28])).
% cnf(31,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(43, negated_conjecture,?[X1]:?[X2]:?[X3]:(subset(X1,union(X2,X3))&(~(subset(difference(X1,X2),X3))|~(subset(difference(X1,X3),X2)))),inference(fof_nnf,[status(thm)],[8])).
% fof(44, negated_conjecture,?[X4]:?[X5]:?[X6]:(subset(X4,union(X5,X6))&(~(subset(difference(X4,X5),X6))|~(subset(difference(X4,X6),X5)))),inference(variable_rename,[status(thm)],[43])).
% fof(45, negated_conjecture,(subset(esk3_0,union(esk4_0,esk5_0))&(~(subset(difference(esk3_0,esk4_0),esk5_0))|~(subset(difference(esk3_0,esk5_0),esk4_0)))),inference(skolemize,[status(esa)],[44])).
% cnf(46,negated_conjecture,(~subset(difference(esk3_0,esk5_0),esk4_0)|~subset(difference(esk3_0,esk4_0),esk5_0)),inference(split_conjunct,[status(thm)],[45])).
% cnf(47,negated_conjecture,(subset(esk3_0,union(esk4_0,esk5_0))),inference(split_conjunct,[status(thm)],[45])).
% cnf(52,plain,(member(esk1_2(difference(X1,X2),X3),X1)|subset(difference(X1,X2),X3)),inference(spm,[status(thm)],[17,30,theory(equality)])).
% cnf(53,negated_conjecture,(member(X1,union(esk4_0,esk5_0))|~member(X1,esk3_0)),inference(spm,[status(thm)],[31,47,theory(equality)])).
% cnf(59,plain,(subset(difference(X1,X2),X3)|~member(esk1_2(difference(X1,X2),X3),X2)),inference(spm,[status(thm)],[16,30,theory(equality)])).
% cnf(81,negated_conjecture,(subset(X1,union(esk4_0,esk5_0))|~member(esk1_2(X1,union(esk4_0,esk5_0)),esk3_0)),inference(spm,[status(thm)],[29,53,theory(equality)])).
% cnf(82,negated_conjecture,(member(X1,esk5_0)|member(X1,esk4_0)|~member(X1,esk3_0)),inference(spm,[status(thm)],[23,53,theory(equality)])).
% cnf(84,negated_conjecture,(subset(X1,esk5_0)|member(esk1_2(X1,esk5_0),esk4_0)|~member(esk1_2(X1,esk5_0),esk3_0)),inference(spm,[status(thm)],[29,82,theory(equality)])).
% cnf(90,negated_conjecture,(subset(difference(esk3_0,X1),union(esk4_0,esk5_0))),inference(spm,[status(thm)],[81,52,theory(equality)])).
% cnf(93,negated_conjecture,(member(X1,union(esk4_0,esk5_0))|~member(X1,difference(esk3_0,X2))),inference(spm,[status(thm)],[31,90,theory(equality)])).
% cnf(124,negated_conjecture,(member(esk1_2(difference(esk3_0,X1),X2),union(esk4_0,esk5_0))|subset(difference(esk3_0,X1),X2)),inference(spm,[status(thm)],[93,30,theory(equality)])).
% cnf(137,negated_conjecture,(member(esk1_2(difference(esk3_0,X1),X2),esk5_0)|member(esk1_2(difference(esk3_0,X1),X2),esk4_0)|subset(difference(esk3_0,X1),X2)),inference(spm,[status(thm)],[23,124,theory(equality)])).
% cnf(162,negated_conjecture,(subset(difference(X1,esk4_0),esk5_0)|~member(esk1_2(difference(X1,esk4_0),esk5_0),esk3_0)),inference(spm,[status(thm)],[59,84,theory(equality)])).
% cnf(167,negated_conjecture,(subset(difference(esk3_0,esk4_0),esk5_0)),inference(spm,[status(thm)],[162,52,theory(equality)])).
% cnf(169,negated_conjecture,($false|~subset(difference(esk3_0,esk5_0),esk4_0)),inference(rw,[status(thm)],[46,167,theory(equality)])).
% cnf(170,negated_conjecture,(~subset(difference(esk3_0,esk5_0),esk4_0)),inference(cn,[status(thm)],[169,theory(equality)])).
% cnf(2319,negated_conjecture,(subset(difference(esk3_0,esk5_0),X1)|member(esk1_2(difference(esk3_0,esk5_0),X1),esk4_0)),inference(spm,[status(thm)],[59,137,theory(equality)])).
% cnf(2331,negated_conjecture,(subset(difference(esk3_0,esk5_0),esk4_0)),inference(spm,[status(thm)],[29,2319,theory(equality)])).
% cnf(2332,negated_conjecture,($false),inference(sr,[status(thm)],[2331,170,theory(equality)])).
% cnf(2333,negated_conjecture,($false),2332,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 371
% # ...of these trivial : 70
% # ...subsumed : 69
% # ...remaining for further processing: 232
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 1970
% # ...of the previous two non-trivial : 1719
% # Contextual simplify-reflections : 4
% # Paramodulations : 1944
% # Factorizations : 26
% # Equation resolutions : 0
% # Current number of processed clauses: 231
% # Positive orientable unit clauses: 113
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 116
% # Current number of unprocessed clauses: 1363
% # ...number of literals in the above : 3632
% # Clause-clause subsumption calls (NU) : 1517
% # Rec. Clause-clause subsumption calls : 1399
% # Unit Clause-clause subsumption calls : 203
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 660
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 222 leaves, 2.14+/-2.124 terms/leaf
% # Paramod-from index: 86 leaves, 2.21+/-2.141 terms/leaf
% # Paramod-into index: 198 leaves, 2.18+/-2.140 terms/leaf
% # -------------------------------------------------
% # User time : 0.082 s
% # System time : 0.007 s
% # Total time : 0.089 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.28 WC
% FINAL PrfWatch: 0.20 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP28174/SET593+3.tptp
%
%------------------------------------------------------------------------------