TSTP Solution File: SET629+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET629+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 : art04.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:19:05 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP30453/SET629+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP30453/SET629+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30453/SET629+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 30549
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),file('/tmp/SRASS.s.p', difference_defn)).
% fof(2, axiom,![X1]:![X2]:![X3]:(member(X3,intersection(X1,X2))<=>(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersection_defn)).
% fof(3, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>~(intersect(X1,X2))),file('/tmp/SRASS.s.p', disjoint_defn)).
% fof(4, axiom,![X1]:![X2]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(5, axiom,![X1]:![X2]:(intersect(X1,X2)=>intersect(X2,X1)),file('/tmp/SRASS.s.p', symmetry_of_intersect)).
% fof(7, axiom,![X1]:![X2]:(intersect(X1,X2)<=>?[X3]:(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersect_defn)).
% fof(8, conjecture,![X1]:![X2]:disjoint(intersection(X1,X2),difference(X1,X2)),file('/tmp/SRASS.s.p', prove_intersection_and_difference_disjoint)).
% fof(9, negated_conjecture,~(![X1]:![X2]:disjoint(intersection(X1,X2),difference(X1,X2))),inference(assume_negation,[status(cth)],[8])).
% fof(10, plain,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(11, plain,![X1]:![X2]:(disjoint(X1,X2)<=>~(intersect(X1,X2))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(12, plain,![X1]:![X2]:![X3]:((~(member(X3,difference(X1,X2)))|(member(X3,X1)&~(member(X3,X2))))&((~(member(X3,X1))|member(X3,X2))|member(X3,difference(X1,X2)))),inference(fof_nnf,[status(thm)],[10])).
% fof(13, plain,![X4]:![X5]:![X6]:((~(member(X6,difference(X4,X5)))|(member(X6,X4)&~(member(X6,X5))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(variable_rename,[status(thm)],[12])).
% fof(14, plain,![X4]:![X5]:![X6]:(((member(X6,X4)|~(member(X6,difference(X4,X5))))&(~(member(X6,X5))|~(member(X6,difference(X4,X5)))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(distribute,[status(thm)],[13])).
% cnf(16,plain,(~member(X1,difference(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[14])).
% fof(18, 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)],[2])).
% fof(19, 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)],[18])).
% fof(20, 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)],[19])).
% cnf(23,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[20])).
% fof(24, plain,![X1]:![X2]:((~(disjoint(X1,X2))|~(intersect(X1,X2)))&(intersect(X1,X2)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[11])).
% fof(25, plain,![X3]:![X4]:((~(disjoint(X3,X4))|~(intersect(X3,X4)))&(intersect(X3,X4)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[24])).
% cnf(26,plain,(disjoint(X1,X2)|intersect(X1,X2)),inference(split_conjunct,[status(thm)],[25])).
% fof(28, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[4])).
% cnf(29,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X1]:![X2]:(~(intersect(X1,X2))|intersect(X2,X1)),inference(fof_nnf,[status(thm)],[5])).
% fof(31, plain,![X3]:![X4]:(~(intersect(X3,X4))|intersect(X4,X3)),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(intersect(X1,X2)|~intersect(X2,X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(42, plain,![X1]:![X2]:((~(intersect(X1,X2))|?[X3]:(member(X3,X1)&member(X3,X2)))&(![X3]:(~(member(X3,X1))|~(member(X3,X2)))|intersect(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(43, plain,![X4]:![X5]:((~(intersect(X4,X5))|?[X6]:(member(X6,X4)&member(X6,X5)))&(![X7]:(~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))),inference(variable_rename,[status(thm)],[42])).
% fof(44, plain,![X4]:![X5]:((~(intersect(X4,X5))|(member(esk2_2(X4,X5),X4)&member(esk2_2(X4,X5),X5)))&(![X7]:(~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))),inference(skolemize,[status(esa)],[43])).
% fof(45, plain,![X4]:![X5]:![X7]:(((~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))&(~(intersect(X4,X5))|(member(esk2_2(X4,X5),X4)&member(esk2_2(X4,X5),X5)))),inference(shift_quantors,[status(thm)],[44])).
% fof(46, plain,![X4]:![X5]:![X7]:(((~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))&((member(esk2_2(X4,X5),X4)|~(intersect(X4,X5)))&(member(esk2_2(X4,X5),X5)|~(intersect(X4,X5))))),inference(distribute,[status(thm)],[45])).
% cnf(47,plain,(member(esk2_2(X1,X2),X2)|~intersect(X1,X2)),inference(split_conjunct,[status(thm)],[46])).
% cnf(48,plain,(member(esk2_2(X1,X2),X1)|~intersect(X1,X2)),inference(split_conjunct,[status(thm)],[46])).
% fof(50, negated_conjecture,?[X1]:?[X2]:~(disjoint(intersection(X1,X2),difference(X1,X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(51, negated_conjecture,?[X3]:?[X4]:~(disjoint(intersection(X3,X4),difference(X3,X4))),inference(variable_rename,[status(thm)],[50])).
% fof(52, negated_conjecture,~(disjoint(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0))),inference(skolemize,[status(esa)],[51])).
% cnf(53,negated_conjecture,(~disjoint(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0))),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,negated_conjecture,(intersect(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0))),inference(spm,[status(thm)],[53,26,theory(equality)])).
% cnf(60,plain,(member(esk2_2(X1,intersection(X2,X3)),X2)|~intersect(X1,intersection(X2,X3))),inference(spm,[status(thm)],[23,47,theory(equality)])).
% cnf(68,plain,(~member(esk2_2(difference(X1,X2),X3),X2)|~intersect(difference(X1,X2),X3)),inference(spm,[status(thm)],[16,48,theory(equality)])).
% cnf(93,negated_conjecture,(intersect(difference(esk3_0,esk4_0),intersection(esk3_0,esk4_0))),inference(spm,[status(thm)],[32,54,theory(equality)])).
% cnf(111,plain,(~intersect(difference(X1,X2),intersection(X2,X3))),inference(spm,[status(thm)],[68,60,theory(equality)])).
% cnf(115,plain,(~intersect(difference(X1,X2),intersection(X3,X2))),inference(spm,[status(thm)],[111,29,theory(equality)])).
% cnf(119,negated_conjecture,($false),inference(sr,[status(thm)],[93,115,theory(equality)])).
% cnf(120,negated_conjecture,($false),119,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 47
% # ...of these trivial : 0
% # ...subsumed : 5
% # ...remaining for further processing: 42
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 65
% # ...of the previous two non-trivial : 52
% # Contextual simplify-reflections : 0
% # Paramodulations : 62
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 25
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 5
% # Non-unit-clauses : 18
% # Current number of unprocessed clauses: 37
% # ...number of literals in the above : 104
% # Clause-clause subsumption calls (NU) : 33
% # Rec. Clause-clause subsumption calls : 33
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 28 leaves, 1.64+/-0.934 terms/leaf
% # Paramod-from index: 8 leaves, 1.38+/-0.484 terms/leaf
% # Paramod-into index: 26 leaves, 1.42+/-0.793 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.003 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.16 WC
% FINAL PrfWatch: 0.08 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP30453/SET629+3.tptp
%
%------------------------------------------------------------------------------