TSTP Solution File: SET183+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET183+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 : art09.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:07:52 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP24312/SET183+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP24312/SET183+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24312/SET183+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 24408
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:subset(intersection(X1,X2),X1),file('/tmp/SRASS.s.p', intersection_is_subset)).
% fof(2, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_defn)).
% fof(5, axiom,![X1]:![X2]:![X3]:(member(X3,intersection(X1,X2))<=>(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersection_defn)).
% fof(7, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(8, conjecture,![X1]:![X2]:(subset(X1,X2)=>intersection(X1,X2)=X1),file('/tmp/SRASS.s.p', prove_subset_intersection)).
% fof(9, negated_conjecture,~(![X1]:![X2]:(subset(X1,X2)=>intersection(X1,X2)=X1)),inference(assume_negation,[status(cth)],[8])).
% fof(10, plain,![X3]:![X4]:subset(intersection(X3,X4),X3),inference(variable_rename,[status(thm)],[1])).
% cnf(11,plain,(subset(intersection(X1,X2),X1)),inference(split_conjunct,[status(thm)],[10])).
% fof(12, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[2])).
% fof(13, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[12])).
% fof(14, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[13])).
% cnf(15,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[14])).
% fof(22, plain,![X1]:![X2]:![X3]:((~(member(X3,intersection(X1,X2)))|(member(X3,X1)&member(X3,X2)))&((~(member(X3,X1))|~(member(X3,X2)))|member(X3,intersection(X1,X2)))),inference(fof_nnf,[status(thm)],[5])).
% fof(23, plain,![X4]:![X5]:![X6]:((~(member(X6,intersection(X4,X5)))|(member(X6,X4)&member(X6,X5)))&((~(member(X6,X4))|~(member(X6,X5)))|member(X6,intersection(X4,X5)))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:(((member(X6,X4)|~(member(X6,intersection(X4,X5))))&(member(X6,X5)|~(member(X6,intersection(X4,X5)))))&((~(member(X6,X4))|~(member(X6,X5)))|member(X6,intersection(X4,X5)))),inference(distribute,[status(thm)],[23])).
% cnf(25,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[24])).
% fof(37, 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)],[7])).
% fof(38, 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)],[37])).
% fof(39, 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)],[38])).
% fof(40, 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)],[39])).
% fof(41, 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)],[40])).
% cnf(42,plain,(subset(X1,X2)|~member(esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[41])).
% cnf(43,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[41])).
% cnf(44,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[41])).
% fof(45, negated_conjecture,?[X1]:?[X2]:(subset(X1,X2)&~(intersection(X1,X2)=X1)),inference(fof_nnf,[status(thm)],[9])).
% fof(46, negated_conjecture,?[X3]:?[X4]:(subset(X3,X4)&~(intersection(X3,X4)=X3)),inference(variable_rename,[status(thm)],[45])).
% fof(47, negated_conjecture,(subset(esk3_0,esk4_0)&~(intersection(esk3_0,esk4_0)=esk3_0)),inference(skolemize,[status(esa)],[46])).
% cnf(48,negated_conjecture,(intersection(esk3_0,esk4_0)!=esk3_0),inference(split_conjunct,[status(thm)],[47])).
% cnf(49,negated_conjecture,(subset(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[47])).
% cnf(66,negated_conjecture,(member(X1,esk4_0)|~member(X1,esk3_0)),inference(spm,[status(thm)],[44,49,theory(equality)])).
% cnf(69,plain,(subset(X1,intersection(X2,X3))|~member(esk2_2(X1,intersection(X2,X3)),X3)|~member(esk2_2(X1,intersection(X2,X3)),X2)),inference(spm,[status(thm)],[42,25,theory(equality)])).
% cnf(137,negated_conjecture,(subset(X1,intersection(X2,esk4_0))|~member(esk2_2(X1,intersection(X2,esk4_0)),X2)|~member(esk2_2(X1,intersection(X2,esk4_0)),esk3_0)),inference(spm,[status(thm)],[69,66,theory(equality)])).
% cnf(785,negated_conjecture,(subset(esk3_0,intersection(X1,esk4_0))|~member(esk2_2(esk3_0,intersection(X1,esk4_0)),X1)),inference(spm,[status(thm)],[137,43,theory(equality)])).
% cnf(790,negated_conjecture,(subset(esk3_0,intersection(esk3_0,esk4_0))),inference(spm,[status(thm)],[785,43,theory(equality)])).
% cnf(791,negated_conjecture,(intersection(esk3_0,esk4_0)=esk3_0|~subset(intersection(esk3_0,esk4_0),esk3_0)),inference(spm,[status(thm)],[15,790,theory(equality)])).
% cnf(794,negated_conjecture,(intersection(esk3_0,esk4_0)=esk3_0|$false),inference(rw,[status(thm)],[791,11,theory(equality)])).
% cnf(795,negated_conjecture,(intersection(esk3_0,esk4_0)=esk3_0),inference(cn,[status(thm)],[794,theory(equality)])).
% cnf(796,negated_conjecture,($false),inference(sr,[status(thm)],[795,48,theory(equality)])).
% cnf(797,negated_conjecture,($false),796,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 227
% # ...of these trivial : 13
% # ...subsumed : 117
% # ...remaining for further processing: 97
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 683
% # ...of the previous two non-trivial : 634
% # Contextual simplify-reflections : 10
% # Paramodulations : 667
% # Factorizations : 14
% # Equation resolutions : 2
% # Current number of processed clauses: 95
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 78
% # Current number of unprocessed clauses: 423
% # ...number of literals in the above : 1023
% # Clause-clause subsumption calls (NU) : 1281
% # Rec. Clause-clause subsumption calls : 1228
% # Unit Clause-clause subsumption calls : 42
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 22
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 95 leaves, 1.96+/-1.647 terms/leaf
% # Paramod-from index: 24 leaves, 2.62+/-2.463 terms/leaf
% # Paramod-into index: 86 leaves, 1.92+/-1.623 terms/leaf
% # -------------------------------------------------
% # User time : 0.031 s
% # System time : 0.005 s
% # Total time : 0.036 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.20 WC
% FINAL PrfWatch: 0.13 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP24312/SET183+3.tptp
%
%------------------------------------------------------------------------------