%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET702+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:32:22 EST 2010
% Result : Theorem 23.29s
% Output : Solution 23.29s
% 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/SystemOnTPTP4213/SET702+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4213/SET702+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4213/SET702+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 4309
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.95 CPU 2.02 WC
% PrfWatch: 3.94 CPU 4.03 WC
% PrfWatch: 5.93 CPU 6.04 WC
% PrfWatch: 7.91 CPU 8.04 WC
% PrfWatch: 9.91 CPU 10.05 WC
% PrfWatch: 11.90 CPU 12.06 WC
% PrfWatch: 13.49 CPU 14.06 WC
% PrfWatch: 15.10 CPU 16.07 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 17.08 CPU 18.08 WC
% PrfWatch: 19.07 CPU 20.09 WC
% PrfWatch: 21.06 CPU 22.09 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(member(X1,intersection(X2,X3))<=>(member(X1,X2)&member(X1,X3))),file('/tmp/SRASS.s.p', intersection)).
% fof(2, axiom,![X1]:![X2]:(member(X1,product(X2))<=>![X4]:(member(X4,X2)=>member(X1,X4))),file('/tmp/SRASS.s.p', product)).
% fof(3, axiom,![X2]:![X3]:(subset(X2,X3)<=>![X1]:(member(X1,X2)=>member(X1,X3))),file('/tmp/SRASS.s.p', subset)).
% fof(12, conjecture,![X2]:![X3]:subset(intersection(product(X2),product(X3)),product(intersection(X2,X3))),file('/tmp/SRASS.s.p', thI36)).
% fof(13, negated_conjecture,~(![X2]:![X3]:subset(intersection(product(X2),product(X3)),product(intersection(X2,X3)))),inference(assume_negation,[status(cth)],[12])).
% fof(16, plain,![X1]:![X2]:![X3]:((~(member(X1,intersection(X2,X3)))|(member(X1,X2)&member(X1,X3)))&((~(member(X1,X2))|~(member(X1,X3)))|member(X1,intersection(X2,X3)))),inference(fof_nnf,[status(thm)],[1])).
% fof(17, 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)],[16])).
% fof(18, 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)],[17])).
% cnf(21,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[18])).
% fof(22, plain,![X1]:![X2]:((~(member(X1,product(X2)))|![X4]:(~(member(X4,X2))|member(X1,X4)))&(?[X4]:(member(X4,X2)&~(member(X1,X4)))|member(X1,product(X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(23, plain,![X5]:![X6]:((~(member(X5,product(X6)))|![X7]:(~(member(X7,X6))|member(X5,X7)))&(?[X8]:(member(X8,X6)&~(member(X5,X8)))|member(X5,product(X6)))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X5]:![X6]:((~(member(X5,product(X6)))|![X7]:(~(member(X7,X6))|member(X5,X7)))&((member(esk1_2(X5,X6),X6)&~(member(X5,esk1_2(X5,X6))))|member(X5,product(X6)))),inference(skolemize,[status(esa)],[23])).
% fof(25, plain,![X5]:![X6]:![X7]:(((~(member(X7,X6))|member(X5,X7))|~(member(X5,product(X6))))&((member(esk1_2(X5,X6),X6)&~(member(X5,esk1_2(X5,X6))))|member(X5,product(X6)))),inference(shift_quantors,[status(thm)],[24])).
% fof(26, plain,![X5]:![X6]:![X7]:(((~(member(X7,X6))|member(X5,X7))|~(member(X5,product(X6))))&((member(esk1_2(X5,X6),X6)|member(X5,product(X6)))&(~(member(X5,esk1_2(X5,X6)))|member(X5,product(X6))))),inference(distribute,[status(thm)],[25])).
% cnf(27,plain,(member(X1,product(X2))|~member(X1,esk1_2(X1,X2))),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,plain,(member(X1,product(X2))|member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[26])).
% cnf(29,plain,(member(X1,X3)|~member(X1,product(X2))|~member(X3,X2)),inference(split_conjunct,[status(thm)],[26])).
% fof(30, plain,![X2]:![X3]:((~(subset(X2,X3))|![X1]:(~(member(X1,X2))|member(X1,X3)))&(?[X1]:(member(X1,X2)&~(member(X1,X3)))|subset(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% 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(esk2_2(X4,X5),X4)&~(member(esk2_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(esk2_2(X4,X5),X4)&~(member(esk2_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(esk2_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk2_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[33])).
% cnf(35,plain,(subset(X1,X2)|~member(esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[34])).
% cnf(36,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[34])).
% cnf(37,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(80, negated_conjecture,?[X2]:?[X3]:~(subset(intersection(product(X2),product(X3)),product(intersection(X2,X3)))),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X4]:?[X5]:~(subset(intersection(product(X4),product(X5)),product(intersection(X4,X5)))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,~(subset(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0)))),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(~subset(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0)))),inference(split_conjunct,[status(thm)],[82])).
% cnf(93,negated_conjecture,(member(esk2_2(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0))),intersection(product(esk4_0),product(esk5_0)))),inference(spm,[status(thm)],[83,36,theory(equality)])).
% cnf(95,negated_conjecture,(~member(esk2_2(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0))),product(intersection(esk4_0,esk5_0)))),inference(spm,[status(thm)],[83,35,theory(equality)])).
% cnf(105,plain,(member(X1,X2)|member(esk2_2(X3,X2),X3)|~member(X1,X3)),inference(spm,[status(thm)],[37,36,theory(equality)])).
% cnf(106,plain,(member(X1,X2)|~member(X1,X3)|~member(esk2_2(X3,X2),X2)),inference(spm,[status(thm)],[37,35,theory(equality)])).
% cnf(114,plain,(member(esk1_2(X1,intersection(X2,X3)),X2)|member(X1,product(intersection(X2,X3)))),inference(spm,[status(thm)],[21,28,theory(equality)])).
% cnf(146,negated_conjecture,(member(esk2_2(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0))),product(esk4_0))),inference(spm,[status(thm)],[21,93,theory(equality)])).
% cnf(408,negated_conjecture,(member(esk2_2(product(esk4_0),X1),product(esk4_0))|member(esk2_2(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0))),X1)),inference(spm,[status(thm)],[105,146,theory(equality)])).
% cnf(786,negated_conjecture,(member(esk2_2(product(esk4_0),product(intersection(esk4_0,esk5_0))),product(esk4_0))),inference(spm,[status(thm)],[95,408,theory(equality)])).
% cnf(792,negated_conjecture,(member(esk2_2(product(esk4_0),product(intersection(esk4_0,esk5_0))),X1)|~member(X1,esk4_0)),inference(spm,[status(thm)],[29,786,theory(equality)])).
% cnf(1093,negated_conjecture,(member(esk2_2(product(esk4_0),product(intersection(esk4_0,esk5_0))),esk1_2(X1,intersection(esk4_0,X2)))|member(X1,product(intersection(esk4_0,X2)))),inference(spm,[status(thm)],[792,114,theory(equality)])).
% cnf(561921,negated_conjecture,(member(esk2_2(product(esk4_0),product(intersection(esk4_0,esk5_0))),product(intersection(esk4_0,X1)))),inference(spm,[status(thm)],[27,1093,theory(equality)])).
% cnf(562187,negated_conjecture,(member(X1,product(intersection(esk4_0,esk5_0)))|~member(X1,product(esk4_0))),inference(spm,[status(thm)],[106,561921,theory(equality)])).
% cnf(562519,negated_conjecture,(~member(esk2_2(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0))),product(esk4_0))),inference(spm,[status(thm)],[95,562187,theory(equality)])).
% cnf(562620,negated_conjecture,($false),inference(rw,[status(thm)],[562519,146,theory(equality)])).
% cnf(562621,negated_conjecture,($false),inference(cn,[status(thm)],[562620,theory(equality)])).
% cnf(562622,negated_conjecture,($false),562621,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4566
% # ...of these trivial : 854
% # ...subsumed : 461
% # ...remaining for further processing: 3251
% # Other redundant clauses eliminated : 33
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 11
% # Backward-rewritten : 29
% # Generated clauses : 473552
% # ...of the previous two non-trivial : 402912
% # Contextual simplify-reflections : 16
% # Paramodulations : 473403
% # Factorizations : 116
% # Equation resolutions : 33
% # Current number of processed clauses: 3178
% # Positive orientable unit clauses: 2537
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 182
% # Non-unit-clauses : 459
% # Current number of unprocessed clauses: 378420
% # ...number of literals in the above : 916999
% # Clause-clause subsumption calls (NU) : 6109
% # Rec. Clause-clause subsumption calls : 5227
% # Unit Clause-clause subsumption calls : 1819
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 128374
% # Indexed BW rewrite successes : 34
% # Backwards rewriting index: 914 leaves, 6.33+/-17.881 terms/leaf
% # Paramod-from index: 304 leaves, 9.14+/-27.121 terms/leaf
% # Paramod-into index: 831 leaves, 6.71+/-18.477 terms/leaf
% # -------------------------------------------------
% # User time : 14.857 s
% # System time : 0.501 s
% # Total time : 15.358 s
% # Maximum resident set size: 0 pages
% PrfWatch: 22.29 CPU 23.32 WC
% FINAL PrfWatch: 22.29 CPU 23.32 WC
% SZS output end Solution for /tmp/SystemOnTPTP4213/SET702+4.tptp
%
%------------------------------------------------------------------------------