TSTP Solution File: SET012+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET012+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 22:50:39 EST 2010
% Result : Theorem 3.19s
% Output : Solution 3.19s
% 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/SystemOnTPTP17584/SET012+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17584/SET012+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17584/SET012+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 17680
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.93 CPU 2.01 WC
% # 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,![X2]:![X1]:![X3]:(member(X2,difference(X3,X1))<=>(member(X2,X3)&~(member(X2,X1)))),file('/tmp/SRASS.s.p', difference)).
% fof(3, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X4]:(member(X4,X1)=>member(X4,X2))),file('/tmp/SRASS.s.p', subset)).
% fof(4, axiom,![X4]:![X1]:(member(X4,power_set(X1))<=>subset(X4,X1)),file('/tmp/SRASS.s.p', power_set)).
% fof(12, conjecture,![X1]:![X3]:(subset(X1,X3)=>equal_set(difference(X3,difference(X3,X1)),X1)),file('/tmp/SRASS.s.p', thI23)).
% fof(13, negated_conjecture,~(![X1]:![X3]:(subset(X1,X3)=>equal_set(difference(X3,difference(X3,X1)),X1))),inference(assume_negation,[status(cth)],[12])).
% fof(14, plain,![X2]:![X1]:![X3]:(member(X2,difference(X3,X1))<=>(member(X2,X3)&~(member(X2,X1)))),inference(fof_simplification,[status(thm)],[2,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,![X2]:![X1]:![X3]:((~(member(X2,difference(X3,X1)))|(member(X2,X3)&~(member(X2,X1))))&((~(member(X2,X3))|member(X2,X1))|member(X2,difference(X3,X1)))),inference(fof_nnf,[status(thm)],[14])).
% fof(23, 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)],[22])).
% fof(24, 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)],[23])).
% cnf(25,plain,(member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(~member(X1,difference(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[24])).
% cnf(27,plain,(member(X1,X2)|~member(X1,difference(X2,X3))),inference(split_conjunct,[status(thm)],[24])).
% fof(28, plain,![X1]:![X2]:((~(subset(X1,X2))|![X4]:(~(member(X4,X1))|member(X4,X2)))&(?[X4]:(member(X4,X1)&~(member(X4,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(29, 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)],[28])).
% fof(30, 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)],[29])).
% fof(31, 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)],[30])).
% fof(32, 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)],[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,![X4]:![X1]:((~(member(X4,power_set(X1)))|subset(X4,X1))&(~(subset(X4,X1))|member(X4,power_set(X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(37, plain,![X5]:![X6]:((~(member(X5,power_set(X6)))|subset(X5,X6))&(~(subset(X5,X6))|member(X5,power_set(X6)))),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]:?[X3]:(subset(X1,X3)&~(equal_set(difference(X3,difference(X3,X1)),X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X4]:?[X5]:(subset(X4,X5)&~(equal_set(difference(X5,difference(X5,X4)),X4))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,(subset(esk4_0,esk5_0)&~(equal_set(difference(esk5_0,difference(esk5_0,esk4_0)),esk4_0))),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(~equal_set(difference(esk5_0,difference(esk5_0,esk4_0)),esk4_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,negated_conjecture,(subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(88,negated_conjecture,(~subset(esk4_0,difference(esk5_0,difference(esk5_0,esk4_0)))|~subset(difference(esk5_0,difference(esk5_0,esk4_0)),esk4_0)),inference(spm,[status(thm)],[83,19,theory(equality)])).
% cnf(93,plain,(member(X1,power_set(X2))|member(esk1_2(X1,X2),X1)),inference(spm,[status(thm)],[38,34,theory(equality)])).
% cnf(94,plain,(member(X1,power_set(X2))|~member(esk1_2(X1,X2),X2)),inference(spm,[status(thm)],[38,33,theory(equality)])).
% cnf(95,negated_conjecture,(member(X1,esk5_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[35,84,theory(equality)])).
% cnf(135,negated_conjecture,(~subset(esk4_0,difference(esk5_0,difference(esk5_0,esk4_0)))|~member(difference(esk5_0,difference(esk5_0,esk4_0)),power_set(esk4_0))),inference(spm,[status(thm)],[88,39,theory(equality)])).
% cnf(153,plain,(member(esk1_2(difference(X1,X2),X3),X1)|member(difference(X1,X2),power_set(X3))),inference(spm,[status(thm)],[27,93,theory(equality)])).
% cnf(154,plain,(member(difference(X1,X2),power_set(X3))|~member(esk1_2(difference(X1,X2),X3),X2)),inference(spm,[status(thm)],[26,93,theory(equality)])).
% cnf(175,plain,(member(X1,power_set(difference(X2,X3)))|member(esk1_2(X1,difference(X2,X3)),X3)|~member(esk1_2(X1,difference(X2,X3)),X2)),inference(spm,[status(thm)],[94,25,theory(equality)])).
% cnf(211,negated_conjecture,(~member(difference(esk5_0,difference(esk5_0,esk4_0)),power_set(esk4_0))|~member(esk4_0,power_set(difference(esk5_0,difference(esk5_0,esk4_0))))),inference(spm,[status(thm)],[135,39,theory(equality)])).
% cnf(398,plain,(member(difference(X1,difference(X2,X3)),power_set(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)],[154,25,theory(equality)])).
% cnf(50040,plain,(member(esk1_2(difference(X1,difference(X1,X2)),X3),X2)|member(difference(X1,difference(X1,X2)),power_set(X3))),inference(spm,[status(thm)],[398,153,theory(equality)])).
% cnf(53222,plain,(member(difference(X1,difference(X1,X2)),power_set(X2))),inference(spm,[status(thm)],[94,50040,theory(equality)])).
% cnf(53310,negated_conjecture,($false|~member(esk4_0,power_set(difference(esk5_0,difference(esk5_0,esk4_0))))),inference(rw,[status(thm)],[211,53222,theory(equality)])).
% cnf(53311,negated_conjecture,(~member(esk4_0,power_set(difference(esk5_0,difference(esk5_0,esk4_0))))),inference(cn,[status(thm)],[53310,theory(equality)])).
% cnf(53316,negated_conjecture,($false|~subset(esk4_0,difference(esk5_0,difference(esk5_0,esk4_0)))),inference(rw,[status(thm)],[135,53222,theory(equality)])).
% cnf(53317,negated_conjecture,(~subset(esk4_0,difference(esk5_0,difference(esk5_0,esk4_0)))),inference(cn,[status(thm)],[53316,theory(equality)])).
% cnf(53369,negated_conjecture,(member(esk1_2(esk4_0,difference(esk5_0,difference(esk5_0,esk4_0))),esk4_0)),inference(spm,[status(thm)],[53317,34,theory(equality)])).
% cnf(53401,negated_conjecture,(member(esk1_2(esk4_0,difference(esk5_0,difference(esk5_0,esk4_0))),esk5_0)),inference(spm,[status(thm)],[95,53369,theory(equality)])).
% cnf(53469,negated_conjecture,(member(esk1_2(esk4_0,difference(esk5_0,difference(esk5_0,esk4_0))),difference(esk5_0,esk4_0))|member(esk4_0,power_set(difference(esk5_0,difference(esk5_0,esk4_0))))),inference(spm,[status(thm)],[175,53401,theory(equality)])).
% cnf(53477,negated_conjecture,(member(esk1_2(esk4_0,difference(esk5_0,difference(esk5_0,esk4_0))),difference(esk5_0,esk4_0))),inference(sr,[status(thm)],[53469,53311,theory(equality)])).
% cnf(53499,negated_conjecture,(~member(esk1_2(esk4_0,difference(esk5_0,difference(esk5_0,esk4_0))),esk4_0)),inference(spm,[status(thm)],[26,53477,theory(equality)])).
% cnf(53510,negated_conjecture,($false),inference(rw,[status(thm)],[53499,53369,theory(equality)])).
% cnf(53511,negated_conjecture,($false),inference(cn,[status(thm)],[53510,theory(equality)])).
% cnf(53512,negated_conjecture,($false),53511,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1381
% # ...of these trivial : 217
% # ...subsumed : 90
% # ...remaining for further processing: 1074
% # Other redundant clauses eliminated : 11
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 47
% # Generated clauses : 47946
% # ...of the previous two non-trivial : 43982
% # Contextual simplify-reflections : 5
% # Paramodulations : 47909
% # Factorizations : 26
% # Equation resolutions : 11
% # Current number of processed clauses: 990
% # Positive orientable unit clauses: 705
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 49
% # Non-unit-clauses : 236
% # Current number of unprocessed clauses: 37540
% # ...number of literals in the above : 85491
% # Clause-clause subsumption calls (NU) : 2894
% # Rec. Clause-clause subsumption calls : 2806
% # Unit Clause-clause subsumption calls : 321
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 15006
% # Indexed BW rewrite successes : 41
% # Backwards rewriting index: 503 leaves, 4.39+/-8.633 terms/leaf
% # Paramod-from index: 152 leaves, 5.43+/-12.543 terms/leaf
% # Paramod-into index: 455 leaves, 4.60+/-8.919 terms/leaf
% # -------------------------------------------------
% # User time : 1.563 s
% # System time : 0.057 s
% # Total time : 1.620 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.40 CPU 2.49 WC
% FINAL PrfWatch: 2.40 CPU 2.49 WC
% SZS output end Solution for /tmp/SystemOnTPTP17584/SET012+4.tptp
%
%------------------------------------------------------------------------------