TSTP Solution File: SET580+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET580+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 : art07.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:11:33 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/SystemOnTPTP27396/SET580+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP27396/SET580+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27396/SET580+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 27492
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:![X3]:(member(X3,union(X1,X2))<=>(member(X3,X1)|member(X3,X2))),file('/tmp/SRASS.s.p', union_defn)).
% fof(4, axiom,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),file('/tmp/SRASS.s.p', difference_defn)).
% fof(5, axiom,![X1]:![X2]:symmetric_difference(X1,X2)=union(difference(X1,X2),difference(X2,X1)),file('/tmp/SRASS.s.p', symmetric_difference_defn)).
% fof(7, conjecture,![X1]:![X2]:![X3]:(member(X1,symmetric_difference(X2,X3))<=>~((member(X1,X2)<=>member(X1,X3)))),file('/tmp/SRASS.s.p', prove_th23)).
% fof(8, negated_conjecture,~(![X1]:![X2]:![X3]:(member(X1,symmetric_difference(X2,X3))<=>~((member(X1,X2)<=>member(X1,X3))))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(21, plain,![X1]:![X2]:![X3]:((~(member(X3,union(X1,X2)))|(member(X3,X1)|member(X3,X2)))&((~(member(X3,X1))&~(member(X3,X2)))|member(X3,union(X1,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(22, plain,![X4]:![X5]:![X6]:((~(member(X6,union(X4,X5)))|(member(X6,X4)|member(X6,X5)))&((~(member(X6,X4))&~(member(X6,X5)))|member(X6,union(X4,X5)))),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X4]:![X5]:![X6]:((~(member(X6,union(X4,X5)))|(member(X6,X4)|member(X6,X5)))&((~(member(X6,X4))|member(X6,union(X4,X5)))&(~(member(X6,X5))|member(X6,union(X4,X5))))),inference(distribute,[status(thm)],[22])).
% cnf(24,plain,(member(X1,union(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[23])).
% cnf(25,plain,(member(X1,union(X2,X3))|~member(X1,X2)),inference(split_conjunct,[status(thm)],[23])).
% cnf(26,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))),inference(split_conjunct,[status(thm)],[23])).
% fof(27, 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)],[9])).
% fof(28, 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)],[27])).
% fof(29, 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)],[28])).
% cnf(30,plain,(member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[29])).
% cnf(31,plain,(~member(X1,difference(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[29])).
% cnf(32,plain,(member(X1,X2)|~member(X1,difference(X2,X3))),inference(split_conjunct,[status(thm)],[29])).
% fof(33, plain,![X3]:![X4]:symmetric_difference(X3,X4)=union(difference(X3,X4),difference(X4,X3)),inference(variable_rename,[status(thm)],[5])).
% cnf(34,plain,(symmetric_difference(X1,X2)=union(difference(X1,X2),difference(X2,X1))),inference(split_conjunct,[status(thm)],[33])).
% fof(37, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(member(X1,symmetric_difference(X2,X3)))|((~(member(X1,X2))|member(X1,X3))&(~(member(X1,X3))|member(X1,X2))))&(member(X1,symmetric_difference(X2,X3))|((~(member(X1,X2))|~(member(X1,X3)))&(member(X1,X2)|member(X1,X3))))),inference(fof_nnf,[status(thm)],[8])).
% fof(38, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(member(X4,symmetric_difference(X5,X6)))|((~(member(X4,X5))|member(X4,X6))&(~(member(X4,X6))|member(X4,X5))))&(member(X4,symmetric_difference(X5,X6))|((~(member(X4,X5))|~(member(X4,X6)))&(member(X4,X5)|member(X4,X6))))),inference(variable_rename,[status(thm)],[37])).
% fof(39, negated_conjecture,((~(member(esk2_0,symmetric_difference(esk3_0,esk4_0)))|((~(member(esk2_0,esk3_0))|member(esk2_0,esk4_0))&(~(member(esk2_0,esk4_0))|member(esk2_0,esk3_0))))&(member(esk2_0,symmetric_difference(esk3_0,esk4_0))|((~(member(esk2_0,esk3_0))|~(member(esk2_0,esk4_0)))&(member(esk2_0,esk3_0)|member(esk2_0,esk4_0))))),inference(skolemize,[status(esa)],[38])).
% fof(40, negated_conjecture,((((~(member(esk2_0,esk3_0))|member(esk2_0,esk4_0))|~(member(esk2_0,symmetric_difference(esk3_0,esk4_0))))&((~(member(esk2_0,esk4_0))|member(esk2_0,esk3_0))|~(member(esk2_0,symmetric_difference(esk3_0,esk4_0)))))&(((~(member(esk2_0,esk3_0))|~(member(esk2_0,esk4_0)))|member(esk2_0,symmetric_difference(esk3_0,esk4_0)))&((member(esk2_0,esk3_0)|member(esk2_0,esk4_0))|member(esk2_0,symmetric_difference(esk3_0,esk4_0))))),inference(distribute,[status(thm)],[39])).
% cnf(41,negated_conjecture,(member(esk2_0,symmetric_difference(esk3_0,esk4_0))|member(esk2_0,esk4_0)|member(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(42,negated_conjecture,(member(esk2_0,symmetric_difference(esk3_0,esk4_0))|~member(esk2_0,esk4_0)|~member(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(43,negated_conjecture,(member(esk2_0,esk3_0)|~member(esk2_0,symmetric_difference(esk3_0,esk4_0))|~member(esk2_0,esk4_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(44,negated_conjecture,(member(esk2_0,esk4_0)|~member(esk2_0,symmetric_difference(esk3_0,esk4_0))|~member(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(46,negated_conjecture,(member(esk2_0,esk3_0)|member(esk2_0,esk4_0)|member(esk2_0,union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)))),inference(rw,[status(thm)],[41,34,theory(equality)]),['unfolding']).
% cnf(47,negated_conjecture,(member(esk2_0,esk3_0)|~member(esk2_0,esk4_0)|~member(esk2_0,union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)))),inference(rw,[status(thm)],[43,34,theory(equality)]),['unfolding']).
% cnf(48,negated_conjecture,(member(esk2_0,esk4_0)|~member(esk2_0,esk3_0)|~member(esk2_0,union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)))),inference(rw,[status(thm)],[44,34,theory(equality)]),['unfolding']).
% cnf(49,negated_conjecture,(member(esk2_0,union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)))|~member(esk2_0,esk3_0)|~member(esk2_0,esk4_0)),inference(rw,[status(thm)],[42,34,theory(equality)]),['unfolding']).
% cnf(63,negated_conjecture,(member(esk2_0,esk3_0)|~member(esk2_0,esk4_0)|~member(esk2_0,difference(esk4_0,esk3_0))),inference(spm,[status(thm)],[47,24,theory(equality)])).
% cnf(66,negated_conjecture,(member(esk2_0,esk4_0)|~member(esk2_0,esk3_0)|~member(esk2_0,difference(esk3_0,esk4_0))),inference(spm,[status(thm)],[48,25,theory(equality)])).
% cnf(72,negated_conjecture,(member(esk2_0,difference(esk4_0,esk3_0))|member(esk2_0,difference(esk3_0,esk4_0))|member(esk2_0,esk4_0)|member(esk2_0,esk3_0)),inference(spm,[status(thm)],[26,46,theory(equality)])).
% cnf(83,negated_conjecture,(member(esk2_0,esk3_0)|~member(esk2_0,esk4_0)),inference(csr,[status(thm)],[63,30])).
% cnf(84,negated_conjecture,(member(esk2_0,esk4_0)|~member(esk2_0,esk3_0)),inference(csr,[status(thm)],[66,30])).
% cnf(86,negated_conjecture,(member(esk2_0,difference(esk4_0,esk3_0))|member(esk2_0,difference(esk3_0,esk4_0))|member(esk2_0,esk4_0)),inference(csr,[status(thm)],[72,30])).
% cnf(87,negated_conjecture,(member(esk2_0,difference(esk3_0,esk4_0))|member(esk2_0,esk4_0)),inference(csr,[status(thm)],[86,32])).
% cnf(88,negated_conjecture,(member(esk2_0,esk3_0)|member(esk2_0,esk4_0)),inference(spm,[status(thm)],[32,87,theory(equality)])).
% cnf(90,negated_conjecture,(member(esk2_0,esk3_0)),inference(csr,[status(thm)],[88,83])).
% cnf(91,negated_conjecture,(member(esk2_0,esk4_0)|$false),inference(rw,[status(thm)],[84,90,theory(equality)])).
% cnf(92,negated_conjecture,(member(esk2_0,esk4_0)),inference(cn,[status(thm)],[91,theory(equality)])).
% cnf(94,negated_conjecture,(member(esk2_0,union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)))|$false|~member(esk2_0,esk4_0)),inference(rw,[status(thm)],[49,90,theory(equality)])).
% cnf(95,negated_conjecture,(member(esk2_0,union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)))|~member(esk2_0,esk4_0)),inference(cn,[status(thm)],[94,theory(equality)])).
% cnf(98,negated_conjecture,(member(esk2_0,union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)))|$false),inference(rw,[status(thm)],[95,92,theory(equality)])).
% cnf(99,negated_conjecture,(member(esk2_0,union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)))),inference(cn,[status(thm)],[98,theory(equality)])).
% cnf(100,negated_conjecture,(member(esk2_0,difference(esk4_0,esk3_0))|member(esk2_0,difference(esk3_0,esk4_0))),inference(spm,[status(thm)],[26,99,theory(equality)])).
% cnf(102,negated_conjecture,(member(esk2_0,difference(esk3_0,esk4_0))|~member(esk2_0,esk3_0)),inference(spm,[status(thm)],[31,100,theory(equality)])).
% cnf(104,negated_conjecture,(member(esk2_0,difference(esk3_0,esk4_0))|$false),inference(rw,[status(thm)],[102,90,theory(equality)])).
% cnf(105,negated_conjecture,(member(esk2_0,difference(esk3_0,esk4_0))),inference(cn,[status(thm)],[104,theory(equality)])).
% cnf(115,negated_conjecture,(~member(esk2_0,esk4_0)),inference(spm,[status(thm)],[31,105,theory(equality)])).
% cnf(118,negated_conjecture,($false),inference(rw,[status(thm)],[115,92,theory(equality)])).
% cnf(119,negated_conjecture,($false),inference(cn,[status(thm)],[118,theory(equality)])).
% cnf(120,negated_conjecture,($false),119,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 28
% # ...of these trivial : 1
% # ...subsumed : 5
% # ...remaining for further processing: 22
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 6
% # Generated clauses : 48
% # ...of the previous two non-trivial : 34
% # Contextual simplify-reflections : 6
% # Paramodulations : 44
% # Factorizations : 4
% # Equation resolutions : 0
% # Current number of processed clauses: 14
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 9
% # Current number of unprocessed clauses: 18
% # ...number of literals in the above : 57
% # Clause-clause subsumption calls (NU) : 63
% # Rec. Clause-clause subsumption calls : 58
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 20 leaves, 1.35+/-0.726 terms/leaf
% # Paramod-from index: 9 leaves, 1.33+/-0.471 terms/leaf
% # Paramod-into index: 18 leaves, 1.33+/-0.745 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.003 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP27396/SET580+3.tptp
%
%------------------------------------------------------------------------------