TSTP Solution File: SET622+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET622+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:17:43 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP28298/SET622+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28298/SET622+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28298/SET622+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 28394
% 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]:![X3]:intersection(intersection(X1,X2),X3)=intersection(X1,intersection(X2,X3)),file('/tmp/SRASS.s.p', associativity_of_intersection)).
% fof(2, axiom,![X1]:![X2]:![X3]:difference(X1,difference(X2,X3))=union(difference(X1,X2),intersection(X1,X3)),file('/tmp/SRASS.s.p', difference_difference_union2)).
% fof(3, axiom,![X1]:![X2]:symmetric_difference(X1,X2)=difference(union(X1,X2),intersection(X1,X2)),file('/tmp/SRASS.s.p', symmetric_difference_and_difference)).
% fof(5, axiom,![X1]:![X2]:union(X1,X2)=union(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_union)).
% fof(6, axiom,![X1]:![X2]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(15, conjecture,![X1]:![X2]:![X3]:difference(X1,symmetric_difference(X2,X3))=union(difference(X1,union(X2,X3)),intersection(intersection(X1,X2),X3)),file('/tmp/SRASS.s.p', prove_th98)).
% fof(16, negated_conjecture,~(![X1]:![X2]:![X3]:difference(X1,symmetric_difference(X2,X3))=union(difference(X1,union(X2,X3)),intersection(intersection(X1,X2),X3))),inference(assume_negation,[status(cth)],[15])).
% fof(18, plain,![X4]:![X5]:![X6]:intersection(intersection(X4,X5),X6)=intersection(X4,intersection(X5,X6)),inference(variable_rename,[status(thm)],[1])).
% cnf(19,plain,(intersection(intersection(X1,X2),X3)=intersection(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:difference(X4,difference(X5,X6))=union(difference(X4,X5),intersection(X4,X6)),inference(variable_rename,[status(thm)],[2])).
% cnf(21,plain,(difference(X1,difference(X2,X3))=union(difference(X1,X2),intersection(X1,X3))),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X3]:![X4]:symmetric_difference(X3,X4)=difference(union(X3,X4),intersection(X3,X4)),inference(variable_rename,[status(thm)],[3])).
% cnf(23,plain,(symmetric_difference(X1,X2)=difference(union(X1,X2),intersection(X1,X2))),inference(split_conjunct,[status(thm)],[22])).
% fof(26, plain,![X3]:![X4]:union(X3,X4)=union(X4,X3),inference(variable_rename,[status(thm)],[5])).
% cnf(27,plain,(union(X1,X2)=union(X2,X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(29,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(75, negated_conjecture,?[X1]:?[X2]:?[X3]:~(difference(X1,symmetric_difference(X2,X3))=union(difference(X1,union(X2,X3)),intersection(intersection(X1,X2),X3))),inference(fof_nnf,[status(thm)],[16])).
% fof(76, negated_conjecture,?[X4]:?[X5]:?[X6]:~(difference(X4,symmetric_difference(X5,X6))=union(difference(X4,union(X5,X6)),intersection(intersection(X4,X5),X6))),inference(variable_rename,[status(thm)],[75])).
% fof(77, negated_conjecture,~(difference(esk3_0,symmetric_difference(esk4_0,esk5_0))=union(difference(esk3_0,union(esk4_0,esk5_0)),intersection(intersection(esk3_0,esk4_0),esk5_0))),inference(skolemize,[status(esa)],[76])).
% cnf(78,negated_conjecture,(difference(esk3_0,symmetric_difference(esk4_0,esk5_0))!=union(difference(esk3_0,union(esk4_0,esk5_0)),intersection(intersection(esk3_0,esk4_0),esk5_0))),inference(split_conjunct,[status(thm)],[77])).
% cnf(81,negated_conjecture,(union(difference(esk3_0,union(esk4_0,esk5_0)),intersection(intersection(esk3_0,esk4_0),esk5_0))!=difference(esk3_0,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)))),inference(rw,[status(thm)],[78,23,theory(equality)]),['unfolding']).
% cnf(86,negated_conjecture,(union(intersection(esk4_0,intersection(esk5_0,esk3_0)),difference(esk3_0,union(esk4_0,esk5_0)))!=difference(esk3_0,difference(union(esk4_0,esk5_0),intersection(esk4_0,esk5_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[81,29,theory(equality)]),19,theory(equality)]),29,theory(equality)]),27,theory(equality)])).
% cnf(87,plain,(intersection(X1,intersection(X2,X3))=intersection(X3,intersection(X1,X2))),inference(spm,[status(thm)],[29,19,theory(equality)])).
% cnf(96,plain,(difference(X1,difference(X2,X3))=union(intersection(X1,X3),difference(X1,X2))),inference(spm,[status(thm)],[27,21,theory(equality)])).
% cnf(185,plain,(union(intersection(X2,intersection(X3,X1)),difference(X1,X4))=difference(X1,difference(X4,intersection(X2,X3)))),inference(spm,[status(thm)],[96,87,theory(equality)])).
% cnf(488,negated_conjecture,($false),inference(rw,[status(thm)],[86,185,theory(equality)])).
% cnf(489,negated_conjecture,($false),inference(cn,[status(thm)],[488,theory(equality)])).
% cnf(490,negated_conjecture,($false),489,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 85
% # ...of these trivial : 7
% # ...subsumed : 23
% # ...remaining for further processing: 55
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 307
% # ...of the previous two non-trivial : 257
% # Contextual simplify-reflections : 0
% # Paramodulations : 303
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 30
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 0
% # Non-unit-clauses : 15
% # Current number of unprocessed clauses: 219
% # ...number of literals in the above : 327
% # Clause-clause subsumption calls (NU) : 28
% # Rec. Clause-clause subsumption calls : 28
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 26
% # Indexed BW rewrite successes : 21
% # Backwards rewriting index: 27 leaves, 2.26+/-1.992 terms/leaf
% # Paramod-from index: 16 leaves, 1.50+/-0.791 terms/leaf
% # Paramod-into index: 20 leaves, 2.25+/-1.894 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.002 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP28298/SET622+3.tptp
%
%------------------------------------------------------------------------------