TSTP Solution File: SET603+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET603+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 : art02.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:14:56 EST 2010
% Result : Theorem 2.67s
% Output : Solution 2.67s
% 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/SystemOnTPTP31240/SET603+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31240/SET603+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31240/SET603+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 31336
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set)).
% fof(2, axiom,![X2]:![X3]:![X4]:(member(X2,difference(X4,X3))<=>(member(X2,X4)&~(member(X2,X3)))),file('/tmp/SRASS.s.p', difference)).
% fof(3, axiom,![X3]:![X2]:(equal_set(X3,X2)<=>(subset(X3,X2)&subset(X2,X3))),file('/tmp/SRASS.s.p', equal_set)).
% fof(4, axiom,![X3]:![X2]:(subset(X3,X2)<=>![X1]:(member(X1,X3)=>member(X1,X2))),file('/tmp/SRASS.s.p', subset)).
% fof(12, conjecture,![X4]:equal_set(difference(X4,empty_set),X4),file('/tmp/SRASS.s.p', thI30)).
% fof(13, negated_conjecture,~(![X4]:equal_set(difference(X4,empty_set),X4)),inference(assume_negation,[status(cth)],[12])).
% fof(14, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(15, plain,![X2]:![X3]:![X4]:(member(X2,difference(X4,X3))<=>(member(X2,X4)&~(member(X2,X3)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(16, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[14])).
% cnf(17,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X2]:![X3]:![X4]:((~(member(X2,difference(X4,X3)))|(member(X2,X4)&~(member(X2,X3))))&((~(member(X2,X4))|member(X2,X3))|member(X2,difference(X4,X3)))),inference(fof_nnf,[status(thm)],[15])).
% fof(19, 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)],[18])).
% fof(20, 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)],[19])).
% cnf(21,plain,(member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[20])).
% cnf(23,plain,(member(X1,X2)|~member(X1,difference(X2,X3))),inference(split_conjunct,[status(thm)],[20])).
% fof(24, plain,![X3]:![X2]:((~(equal_set(X3,X2))|(subset(X3,X2)&subset(X2,X3)))&((~(subset(X3,X2))|~(subset(X2,X3)))|equal_set(X3,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(25, plain,![X4]:![X5]:((~(equal_set(X4,X5))|(subset(X4,X5)&subset(X5,X4)))&((~(subset(X4,X5))|~(subset(X5,X4)))|equal_set(X4,X5))),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:(((subset(X4,X5)|~(equal_set(X4,X5)))&(subset(X5,X4)|~(equal_set(X4,X5))))&((~(subset(X4,X5))|~(subset(X5,X4)))|equal_set(X4,X5))),inference(distribute,[status(thm)],[25])).
% cnf(27,plain,(equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[26])).
% fof(30, plain,![X3]:![X2]:((~(subset(X3,X2))|![X1]:(~(member(X1,X3))|member(X1,X2)))&(?[X1]:(member(X1,X3)&~(member(X1,X2)))|subset(X3,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(31, 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)],[30])).
% fof(32, 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)],[31])).
% fof(33, 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)],[32])).
% fof(34, 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)],[33])).
% cnf(35,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[34])).
% cnf(36,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(80, negated_conjecture,?[X4]:~(equal_set(difference(X4,empty_set),X4)),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X5]:~(equal_set(difference(X5,empty_set),X5)),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,~(equal_set(difference(esk4_0,empty_set),esk4_0)),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(~equal_set(difference(esk4_0,empty_set),esk4_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(87,negated_conjecture,(~subset(esk4_0,difference(esk4_0,empty_set))|~subset(difference(esk4_0,empty_set),esk4_0)),inference(spm,[status(thm)],[83,27,theory(equality)])).
% cnf(92,plain,(member(esk1_2(difference(X1,X2),X3),X1)|subset(difference(X1,X2),X3)),inference(spm,[status(thm)],[23,36,theory(equality)])).
% cnf(101,plain,(subset(X1,difference(X2,X3))|member(esk1_2(X1,difference(X2,X3)),X3)|~member(esk1_2(X1,difference(X2,X3)),X2)),inference(spm,[status(thm)],[35,21,theory(equality)])).
% cnf(254,plain,(subset(difference(X1,X2),X1)),inference(spm,[status(thm)],[35,92,theory(equality)])).
% cnf(266,negated_conjecture,(~subset(esk4_0,difference(esk4_0,empty_set))|$false),inference(rw,[status(thm)],[87,254,theory(equality)])).
% cnf(267,negated_conjecture,(~subset(esk4_0,difference(esk4_0,empty_set))),inference(cn,[status(thm)],[266,theory(equality)])).
% cnf(523,plain,(subset(X1,difference(X1,X2))|member(esk1_2(X1,difference(X1,X2)),X2)),inference(spm,[status(thm)],[101,36,theory(equality)])).
% cnf(30279,plain,(subset(X1,difference(X1,empty_set))),inference(spm,[status(thm)],[17,523,theory(equality)])).
% cnf(30328,negated_conjecture,($false),inference(rw,[status(thm)],[267,30279,theory(equality)])).
% cnf(30329,negated_conjecture,($false),inference(cn,[status(thm)],[30328,theory(equality)])).
% cnf(30330,negated_conjecture,($false),30329,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1756
% # ...of these trivial : 85
% # ...subsumed : 87
% # ...remaining for further processing: 1584
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 41
% # Generated clauses : 28154
% # ...of the previous two non-trivial : 26529
% # Contextual simplify-reflections : 1
% # Paramodulations : 28091
% # Factorizations : 50
% # Equation resolutions : 13
% # Current number of processed clauses: 1500
% # Positive orientable unit clauses: 1263
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 41
% # Non-unit-clauses : 196
% # Current number of unprocessed clauses: 17552
% # ...number of literals in the above : 35406
% # Clause-clause subsumption calls (NU) : 1833
% # Rec. Clause-clause subsumption calls : 1640
% # Unit Clause-clause subsumption calls : 808
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 15609
% # Indexed BW rewrite successes : 51
% # Backwards rewriting index: 649 leaves, 4.26+/-6.796 terms/leaf
% # Paramod-from index: 232 leaves, 5.84+/-9.608 terms/leaf
% # Paramod-into index: 594 leaves, 4.44+/-6.923 terms/leaf
% # -------------------------------------------------
% # User time : 1.331 s
% # System time : 0.044 s
% # Total time : 1.375 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.88 CPU 1.96 WC
% FINAL PrfWatch: 1.88 CPU 1.96 WC
% SZS output end Solution for /tmp/SystemOnTPTP31240/SET603+4.tptp
%
%------------------------------------------------------------------------------