TSTP Solution File: SET635+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET635+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 : 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:19:52 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP32311/SET635+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32311/SET635+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32311/SET635+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 32407
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:intersection(X1,difference(X2,X3))=difference(intersection(X1,X2),X3),file('/tmp/SRASS.s.p', difference_and_intersection)).
% fof(2, axiom,![X1]:![X2]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(3, axiom,![X1]:![X2]:![X3]:difference(X1,intersection(X2,X3))=union(difference(X1,X2),difference(X1,X3)),file('/tmp/SRASS.s.p', difference_and_intersection_and_union)).
% fof(8, axiom,![X1]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_of_subset)).
% fof(9, axiom,![X1]:![X2]:(difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', difference_empty_set)).
% fof(12, axiom,![X1]:union(X1,empty_set)=X1,file('/tmp/SRASS.s.p', union_empty_set)).
% fof(16, conjecture,![X1]:![X2]:![X3]:intersection(X1,difference(X2,X3))=difference(intersection(X1,X2),intersection(X1,X3)),file('/tmp/SRASS.s.p', prove_th117)).
% fof(17, negated_conjecture,~(![X1]:![X2]:![X3]:intersection(X1,difference(X2,X3))=difference(intersection(X1,X2),intersection(X1,X3))),inference(assume_negation,[status(cth)],[16])).
% fof(21, plain,![X4]:![X5]:![X6]:intersection(X4,difference(X5,X6))=difference(intersection(X4,X5),X6),inference(variable_rename,[status(thm)],[1])).
% cnf(22,plain,(intersection(X1,difference(X2,X3))=difference(intersection(X1,X2),X3)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(24,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:difference(X4,intersection(X5,X6))=union(difference(X4,X5),difference(X4,X6)),inference(variable_rename,[status(thm)],[3])).
% cnf(26,plain,(difference(X1,intersection(X2,X3))=union(difference(X1,X2),difference(X1,X3))),inference(split_conjunct,[status(thm)],[25])).
% fof(43, plain,![X2]:subset(X2,X2),inference(variable_rename,[status(thm)],[8])).
% cnf(44,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X1]:![X2]:((~(difference(X1,X2)=empty_set)|subset(X1,X2))&(~(subset(X1,X2))|difference(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[9])).
% fof(46, plain,![X3]:![X4]:((~(difference(X3,X4)=empty_set)|subset(X3,X4))&(~(subset(X3,X4))|difference(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[46])).
% fof(64, plain,![X2]:union(X2,empty_set)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(65,plain,(union(X1,empty_set)=X1),inference(split_conjunct,[status(thm)],[64])).
% fof(82, negated_conjecture,?[X1]:?[X2]:?[X3]:~(intersection(X1,difference(X2,X3))=difference(intersection(X1,X2),intersection(X1,X3))),inference(fof_nnf,[status(thm)],[17])).
% fof(83, negated_conjecture,?[X4]:?[X5]:?[X6]:~(intersection(X4,difference(X5,X6))=difference(intersection(X4,X5),intersection(X4,X6))),inference(variable_rename,[status(thm)],[82])).
% fof(84, negated_conjecture,~(intersection(esk4_0,difference(esk5_0,esk6_0))=difference(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),inference(skolemize,[status(esa)],[83])).
% cnf(85,negated_conjecture,(intersection(esk4_0,difference(esk5_0,esk6_0))!=difference(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),inference(split_conjunct,[status(thm)],[84])).
% cnf(93,plain,(difference(X1,X1)=empty_set),inference(spm,[status(thm)],[47,44,theory(equality)])).
% cnf(98,negated_conjecture,(intersection(esk4_0,difference(esk5_0,intersection(esk4_0,esk6_0)))!=intersection(esk4_0,difference(esk5_0,esk6_0))),inference(rw,[status(thm)],[85,22,theory(equality)])).
% cnf(178,plain,(union(difference(X1,X2),empty_set)=difference(X1,intersection(X2,X1))),inference(spm,[status(thm)],[26,93,theory(equality)])).
% cnf(179,plain,(difference(X1,X2)=difference(X1,intersection(X2,X1))),inference(rw,[status(thm)],[178,65,theory(equality)])).
% cnf(324,plain,(union(difference(X1,X2),difference(X1,X3))=difference(X1,intersection(intersection(X2,X1),X3))),inference(spm,[status(thm)],[26,179,theory(equality)])).
% cnf(334,plain,(difference(X1,intersection(X1,X2))=difference(X1,X2)),inference(spm,[status(thm)],[179,24,theory(equality)])).
% cnf(338,plain,(difference(X1,intersection(X2,X3))=difference(X1,intersection(intersection(X2,X1),X3))),inference(rw,[status(thm)],[324,26,theory(equality)])).
% cnf(343,plain,(difference(intersection(X1,X2),X3)=intersection(X1,difference(X2,intersection(intersection(X1,X2),X3)))),inference(spm,[status(thm)],[22,334,theory(equality)])).
% cnf(357,plain,(intersection(X1,difference(X2,X3))=intersection(X1,difference(X2,intersection(intersection(X1,X2),X3)))),inference(rw,[status(thm)],[343,22,theory(equality)])).
% cnf(8697,plain,(intersection(X1,difference(X2,intersection(X1,X3)))=intersection(X1,difference(X2,X3))),inference(rw,[status(thm)],[357,338,theory(equality)])).
% cnf(8819,negated_conjecture,($false),inference(rw,[status(thm)],[98,8697,theory(equality)])).
% cnf(8820,negated_conjecture,($false),inference(cn,[status(thm)],[8819,theory(equality)])).
% cnf(8821,negated_conjecture,($false),8820,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 840
% # ...of these trivial : 47
% # ...subsumed : 599
% # ...remaining for further processing: 194
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 19
% # Generated clauses : 5612
% # ...of the previous two non-trivial : 3728
% # Contextual simplify-reflections : 81
% # Paramodulations : 5596
% # Factorizations : 14
% # Equation resolutions : 2
% # Current number of processed clauses: 173
% # Positive orientable unit clauses: 46
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 5
% # Non-unit-clauses : 119
% # Current number of unprocessed clauses: 2728
% # ...number of literals in the above : 6617
% # Clause-clause subsumption calls (NU) : 2585
% # Rec. Clause-clause subsumption calls : 2529
% # Unit Clause-clause subsumption calls : 17
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 122
% # Indexed BW rewrite successes : 35
% # Backwards rewriting index: 93 leaves, 1.88+/-1.639 terms/leaf
% # Paramod-from index: 58 leaves, 1.55+/-0.770 terms/leaf
% # Paramod-into index: 91 leaves, 1.74+/-1.481 terms/leaf
% # -------------------------------------------------
% # User time : 0.132 s
% # System time : 0.004 s
% # Total time : 0.136 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.32 CPU 0.42 WC
% FINAL PrfWatch: 0.32 CPU 0.42 WC
% SZS output end Solution for /tmp/SystemOnTPTP32311/SET635+3.tptp
%
%------------------------------------------------------------------------------