TSTP Solution File: SET695+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET695+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:31:34 EST 2010
% Result : Theorem 11.04s
% Output : Solution 11.04s
% 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/SystemOnTPTP10011/SET695+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10011/SET695+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10011/SET695+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 10107
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.93 CPU 2.01 WC
% PrfWatch: 3.92 CPU 4.01 WC
% PrfWatch: 5.92 CPU 6.02 WC
% PrfWatch: 7.91 CPU 8.02 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 9.91 CPU 10.03 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(member(X1,difference(X3,X2))<=>(member(X1,X3)&~(member(X1,X2)))),file('/tmp/SRASS.s.p', difference)).
% fof(2, axiom,![X2]:![X1]:(subset(X2,X1)<=>![X4]:(member(X4,X2)=>member(X4,X1))),file('/tmp/SRASS.s.p', subset)).
% fof(12, conjecture,![X2]:![X1]:![X3]:((subset(X2,X3)&subset(X1,X3))=>(subset(X2,X1)<=>subset(difference(X3,X1),difference(X3,X2)))),file('/tmp/SRASS.s.p', thI24)).
% fof(13, negated_conjecture,~(![X2]:![X1]:![X3]:((subset(X2,X3)&subset(X1,X3))=>(subset(X2,X1)<=>subset(difference(X3,X1),difference(X3,X2))))),inference(assume_negation,[status(cth)],[12])).
% fof(14, plain,![X1]:![X2]:![X3]:(member(X1,difference(X3,X2))<=>(member(X1,X3)&~(member(X1,X2)))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(16, plain,![X1]:![X2]:![X3]:((~(member(X1,difference(X3,X2)))|(member(X1,X3)&~(member(X1,X2))))&((~(member(X1,X3))|member(X1,X2))|member(X1,difference(X3,X2)))),inference(fof_nnf,[status(thm)],[14])).
% fof(17, plain,![X4]:![X5]:![X6]:((~(member(X4,difference(X6,X5)))|(member(X4,X6)&~(member(X4,X5))))&((~(member(X4,X6))|member(X4,X5))|member(X4,difference(X6,X5)))),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X4]:![X5]:![X6]:(((member(X4,X6)|~(member(X4,difference(X6,X5))))&(~(member(X4,X5))|~(member(X4,difference(X6,X5)))))&((~(member(X4,X6))|member(X4,X5))|member(X4,difference(X6,X5)))),inference(distribute,[status(thm)],[17])).
% cnf(19,plain,(member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(~member(X1,difference(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[18])).
% cnf(21,plain,(member(X1,X2)|~member(X1,difference(X2,X3))),inference(split_conjunct,[status(thm)],[18])).
% fof(22, plain,![X2]:![X1]:((~(subset(X2,X1))|![X4]:(~(member(X4,X2))|member(X4,X1)))&(?[X4]:(member(X4,X2)&~(member(X4,X1)))|subset(X2,X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(23, plain,![X5]:![X6]:((~(subset(X5,X6))|![X7]:(~(member(X7,X5))|member(X7,X6)))&(?[X8]:(member(X8,X5)&~(member(X8,X6)))|subset(X5,X6))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X5]:![X6]:((~(subset(X5,X6))|![X7]:(~(member(X7,X5))|member(X7,X6)))&((member(esk1_2(X5,X6),X5)&~(member(esk1_2(X5,X6),X6)))|subset(X5,X6))),inference(skolemize,[status(esa)],[23])).
% fof(25, plain,![X5]:![X6]:![X7]:(((~(member(X7,X5))|member(X7,X6))|~(subset(X5,X6)))&((member(esk1_2(X5,X6),X5)&~(member(esk1_2(X5,X6),X6)))|subset(X5,X6))),inference(shift_quantors,[status(thm)],[24])).
% fof(26, plain,![X5]:![X6]:![X7]:(((~(member(X7,X5))|member(X7,X6))|~(subset(X5,X6)))&((member(esk1_2(X5,X6),X5)|subset(X5,X6))&(~(member(esk1_2(X5,X6),X6))|subset(X5,X6)))),inference(distribute,[status(thm)],[25])).
% cnf(27,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[26])).
% cnf(29,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(80, negated_conjecture,?[X2]:?[X1]:?[X3]:((subset(X2,X3)&subset(X1,X3))&((~(subset(X2,X1))|~(subset(difference(X3,X1),difference(X3,X2))))&(subset(X2,X1)|subset(difference(X3,X1),difference(X3,X2))))),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X4]:?[X5]:?[X6]:((subset(X4,X6)&subset(X5,X6))&((~(subset(X4,X5))|~(subset(difference(X6,X5),difference(X6,X4))))&(subset(X4,X5)|subset(difference(X6,X5),difference(X6,X4))))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,((subset(esk4_0,esk6_0)&subset(esk5_0,esk6_0))&((~(subset(esk4_0,esk5_0))|~(subset(difference(esk6_0,esk5_0),difference(esk6_0,esk4_0))))&(subset(esk4_0,esk5_0)|subset(difference(esk6_0,esk5_0),difference(esk6_0,esk4_0))))),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(subset(difference(esk6_0,esk5_0),difference(esk6_0,esk4_0))|subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,negated_conjecture,(~subset(difference(esk6_0,esk5_0),difference(esk6_0,esk4_0))|~subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(86,negated_conjecture,(subset(esk4_0,esk6_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(97,plain,(member(esk1_2(difference(X1,X2),X3),X1)|subset(difference(X1,X2),X3)),inference(spm,[status(thm)],[21,28,theory(equality)])).
% cnf(98,plain,(subset(difference(X1,X2),X3)|~member(esk1_2(difference(X1,X2),X3),X2)),inference(spm,[status(thm)],[20,28,theory(equality)])).
% cnf(107,negated_conjecture,(member(X1,esk6_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[29,86,theory(equality)])).
% cnf(108,negated_conjecture,(member(X1,difference(esk6_0,esk4_0))|subset(esk4_0,esk5_0)|~member(X1,difference(esk6_0,esk5_0))),inference(spm,[status(thm)],[29,83,theory(equality)])).
% cnf(109,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)],[27,19,theory(equality)])).
% cnf(176,plain,(subset(difference(X1,difference(X2,X3)),X4)|member(esk1_2(difference(X1,difference(X2,X3)),X4),X3)|~member(esk1_2(difference(X1,difference(X2,X3)),X4),X2)),inference(spm,[status(thm)],[98,19,theory(equality)])).
% cnf(235,negated_conjecture,(member(esk1_2(difference(esk4_0,X1),X2),esk6_0)|subset(difference(esk4_0,X1),X2)),inference(spm,[status(thm)],[107,97,theory(equality)])).
% cnf(690,negated_conjecture,(subset(esk4_0,esk5_0)|~member(X1,esk4_0)|~member(X1,difference(esk6_0,esk5_0))),inference(spm,[status(thm)],[20,108,theory(equality)])).
% cnf(749,plain,(subset(difference(X1,X2),difference(X1,X3))|member(esk1_2(difference(X1,X2),difference(X1,X3)),X3)),inference(spm,[status(thm)],[109,97,theory(equality)])).
% cnf(4825,negated_conjecture,(subset(difference(esk4_0,difference(esk6_0,X1)),X2)|member(esk1_2(difference(esk4_0,difference(esk6_0,X1)),X2),X1)),inference(spm,[status(thm)],[176,235,theory(equality)])).
% cnf(5083,negated_conjecture,(subset(difference(esk4_0,difference(esk6_0,X1)),X1)),inference(spm,[status(thm)],[27,4825,theory(equality)])).
% cnf(5085,negated_conjecture,(member(X1,X2)|~member(X1,difference(esk4_0,difference(esk6_0,X2)))),inference(spm,[status(thm)],[29,5083,theory(equality)])).
% cnf(5167,negated_conjecture,(member(X1,X2)|member(X1,difference(esk6_0,X2))|~member(X1,esk4_0)),inference(spm,[status(thm)],[5085,19,theory(equality)])).
% cnf(6110,negated_conjecture,(subset(esk4_0,esk5_0)|member(X1,esk5_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[690,5167,theory(equality)])).
% cnf(6115,negated_conjecture,(member(X1,esk5_0)|~member(X1,esk4_0)),inference(csr,[status(thm)],[6110,29])).
% cnf(6139,negated_conjecture,(member(esk1_2(esk4_0,X1),esk5_0)|subset(esk4_0,X1)),inference(spm,[status(thm)],[6115,28,theory(equality)])).
% cnf(6150,negated_conjecture,(subset(esk4_0,esk5_0)),inference(spm,[status(thm)],[27,6139,theory(equality)])).
% cnf(6155,negated_conjecture,(~subset(difference(esk6_0,esk5_0),difference(esk6_0,esk4_0))|$false),inference(rw,[status(thm)],[84,6150,theory(equality)])).
% cnf(6156,negated_conjecture,(~subset(difference(esk6_0,esk5_0),difference(esk6_0,esk4_0))),inference(cn,[status(thm)],[6155,theory(equality)])).
% cnf(52147,negated_conjecture,(member(esk1_2(difference(X1,X2),difference(X1,esk4_0)),esk5_0)|subset(difference(X1,X2),difference(X1,esk4_0))),inference(spm,[status(thm)],[6115,749,theory(equality)])).
% cnf(62744,negated_conjecture,(subset(difference(X1,esk5_0),difference(X1,esk4_0))),inference(spm,[status(thm)],[98,52147,theory(equality)])).
% cnf(62757,negated_conjecture,($false),inference(rw,[status(thm)],[6156,62744,theory(equality)])).
% cnf(62758,negated_conjecture,($false),inference(cn,[status(thm)],[62757,theory(equality)])).
% cnf(62759,negated_conjecture,($false),62758,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5305
% # ...of these trivial : 59
% # ...subsumed : 603
% # ...remaining for further processing: 4643
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 63
% # Generated clauses : 61468
% # ...of the previous two non-trivial : 60482
% # Contextual simplify-reflections : 89
% # Paramodulations : 61429
% # Factorizations : 24
% # Equation resolutions : 15
% # Current number of processed clauses: 4541
% # Positive orientable unit clauses: 4022
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 93
% # Non-unit-clauses : 426
% # Current number of unprocessed clauses: 42527
% # ...number of literals in the above : 81215
% # Clause-clause subsumption calls (NU) : 6442
% # Rec. Clause-clause subsumption calls : 6179
% # Unit Clause-clause subsumption calls : 2175
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 204742
% # Indexed BW rewrite successes : 60
% # Backwards rewriting index: 1099 leaves, 8.11+/-19.377 terms/leaf
% # Paramod-from index: 394 leaves, 10.72+/-27.088 terms/leaf
% # Paramod-into index: 1014 leaves, 8.59+/-19.913 terms/leaf
% # -------------------------------------------------
% # User time : 9.126 s
% # System time : 0.101 s
% # Total time : 9.227 s
% # Maximum resident set size: 0 pages
% PrfWatch: 10.23 CPU 10.35 WC
% FINAL PrfWatch: 10.23 CPU 10.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP10011/SET695+4.tptp
%
%------------------------------------------------------------------------------