TSTP Solution File: SET619+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET619+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:17:24 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP29417/SET619+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP29417/SET619+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29417/SET619+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 29513
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:union(union(X1,X2),X3)=union(X1,union(X2,X3)),file('/tmp/SRASS.s.p', associativity_of_union)).
% fof(2, axiom,![X1]:![X2]:union(X1,intersection(X1,X2))=X1,file('/tmp/SRASS.s.p', union_intersection)).
% fof(3, axiom,![X1]:![X2]:union(X1,X2)=union(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_union)).
% fof(4, axiom,![X1]:![X2]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(6, axiom,![X1]:![X2]:symmetric_difference(X1,X2)=union(difference(X1,X2),difference(X2,X1)),file('/tmp/SRASS.s.p', symmetric_difference_defn)).
% fof(7, axiom,![X1]:![X2]:union(intersection(X1,X2),difference(X1,X2))=X1,file('/tmp/SRASS.s.p', union_intersection_difference)).
% fof(14, conjecture,![X1]:![X2]:union(X1,X2)=union(symmetric_difference(X1,X2),intersection(X1,X2)),file('/tmp/SRASS.s.p', prove_th95)).
% fof(15, negated_conjecture,~(![X1]:![X2]:union(X1,X2)=union(symmetric_difference(X1,X2),intersection(X1,X2))),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X4]:![X5]:![X6]:union(union(X4,X5),X6)=union(X4,union(X5,X6)),inference(variable_rename,[status(thm)],[1])).
% cnf(17,plain,(union(union(X1,X2),X3)=union(X1,union(X2,X3))),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X3]:![X4]:union(X3,intersection(X3,X4))=X3,inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(union(X1,intersection(X1,X2))=X1),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X3]:![X4]:union(X3,X4)=union(X4,X3),inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(union(X1,X2)=union(X2,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(26, plain,![X3]:![X4]:symmetric_difference(X3,X4)=union(difference(X3,X4),difference(X4,X3)),inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(symmetric_difference(X1,X2)=union(difference(X1,X2),difference(X2,X1))),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X3]:![X4]:union(intersection(X3,X4),difference(X3,X4))=X3,inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(union(intersection(X1,X2),difference(X1,X2))=X1),inference(split_conjunct,[status(thm)],[28])).
% fof(67, negated_conjecture,?[X1]:?[X2]:~(union(X1,X2)=union(symmetric_difference(X1,X2),intersection(X1,X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(68, negated_conjecture,?[X3]:?[X4]:~(union(X3,X4)=union(symmetric_difference(X3,X4),intersection(X3,X4))),inference(variable_rename,[status(thm)],[67])).
% fof(69, negated_conjecture,~(union(esk3_0,esk4_0)=union(symmetric_difference(esk3_0,esk4_0),intersection(esk3_0,esk4_0))),inference(skolemize,[status(esa)],[68])).
% cnf(70,negated_conjecture,(union(esk3_0,esk4_0)!=union(symmetric_difference(esk3_0,esk4_0),intersection(esk3_0,esk4_0))),inference(split_conjunct,[status(thm)],[69])).
% cnf(72,negated_conjecture,(union(union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)),intersection(esk3_0,esk4_0))!=union(esk3_0,esk4_0)),inference(rw,[status(thm)],[70,27,theory(equality)]),['unfolding']).
% cnf(77,negated_conjecture,(union(difference(esk3_0,esk4_0),union(intersection(esk3_0,esk4_0),difference(esk4_0,esk3_0)))!=union(esk3_0,esk4_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[72,17,theory(equality)]),21,theory(equality)])).
% cnf(80,plain,(union(intersection(X2,X1),difference(X1,X2))=X1),inference(spm,[status(thm)],[29,23,theory(equality)])).
% cnf(87,plain,(union(X1,X3)=union(X1,union(intersection(X1,X2),X3))),inference(spm,[status(thm)],[17,19,theory(equality)])).
% cnf(156,negated_conjecture,(union(esk4_0,difference(esk3_0,esk4_0))!=union(esk3_0,esk4_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[77,80,theory(equality)]),21,theory(equality)])).
% cnf(173,plain,(union(X1,X2)=union(X1,difference(X2,X1))),inference(spm,[status(thm)],[87,80,theory(equality)])).
% cnf(195,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[156,173,theory(equality)]),21,theory(equality)])).
% cnf(196,negated_conjecture,($false),inference(cn,[status(thm)],[195,theory(equality)])).
% cnf(197,negated_conjecture,($false),196,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 49
% # ...of these trivial : 3
% # ...subsumed : 0
% # ...remaining for further processing: 46
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 98
% # ...of the previous two non-trivial : 72
% # Contextual simplify-reflections : 0
% # Paramodulations : 94
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 23
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 0
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 64
% # ...number of literals in the above : 131
% # Clause-clause subsumption calls (NU) : 10
% # Rec. Clause-clause subsumption calls : 10
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 14
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 19 leaves, 1.95+/-1.146 terms/leaf
% # Paramod-from index: 12 leaves, 1.50+/-0.500 terms/leaf
% # Paramod-into index: 16 leaves, 1.88+/-0.857 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.007 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP29417/SET619+3.tptp
%
%------------------------------------------------------------------------------