TSTP Solution File: SET594+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET594+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:13:32 EST 2010
% Result : Theorem 2.95s
% Output : Solution 2.95s
% 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/SystemOnTPTP28433/SET594+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28433/SET594+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28433/SET594+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 28529
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.94 CPU 2.02 WC
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:![X2]:![X3]:(member(X3,union(X1,X2))<=>(member(X3,X1)|member(X3,X2))),file('/tmp/SRASS.s.p', union_defn)).
% fof(6, axiom,![X1]:![X2]:![X3]:(member(X3,intersection(X1,X2))<=>(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersection_defn)).
% fof(7, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(9, conjecture,![X1]:![X2]:![X3]:(union(intersection(X1,X2),intersection(X1,X3))=X1=>subset(X1,union(X2,X3))),file('/tmp/SRASS.s.p', prove_th53)).
% fof(10, negated_conjecture,~(![X1]:![X2]:![X3]:(union(intersection(X1,X2),intersection(X1,X3))=X1=>subset(X1,union(X2,X3)))),inference(assume_negation,[status(cth)],[9])).
% fof(23, 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)],[5])).
% fof(24, 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)],[23])).
% fof(25, 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)],[24])).
% cnf(26,plain,(member(X1,union(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(member(X1,union(X2,X3))|~member(X1,X2)),inference(split_conjunct,[status(thm)],[25])).
% cnf(28,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))),inference(split_conjunct,[status(thm)],[25])).
% fof(29, 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)],[6])).
% fof(30, 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)],[29])).
% fof(31, 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)],[30])).
% cnf(33,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[31])).
% fof(35, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(36, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&(?[X7]:(member(X7,X4)&~(member(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[36])).
% fof(38, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[37])).
% fof(39, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[38])).
% cnf(40,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[39])).
% cnf(41,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(52, negated_conjecture,?[X1]:?[X2]:?[X3]:(union(intersection(X1,X2),intersection(X1,X3))=X1&~(subset(X1,union(X2,X3)))),inference(fof_nnf,[status(thm)],[10])).
% fof(53, negated_conjecture,?[X4]:?[X5]:?[X6]:(union(intersection(X4,X5),intersection(X4,X6))=X4&~(subset(X4,union(X5,X6)))),inference(variable_rename,[status(thm)],[52])).
% fof(54, negated_conjecture,(union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))=esk3_0&~(subset(esk3_0,union(esk4_0,esk5_0)))),inference(skolemize,[status(esa)],[53])).
% cnf(55,negated_conjecture,(~subset(esk3_0,union(esk4_0,esk5_0))),inference(split_conjunct,[status(thm)],[54])).
% cnf(56,negated_conjecture,(union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))=esk3_0),inference(split_conjunct,[status(thm)],[54])).
% cnf(73,plain,(subset(X1,union(X2,X3))|~member(esk1_2(X1,union(X2,X3)),X3)),inference(spm,[status(thm)],[40,26,theory(equality)])).
% cnf(74,plain,(subset(X1,union(X2,X3))|~member(esk1_2(X1,union(X2,X3)),X2)),inference(spm,[status(thm)],[40,27,theory(equality)])).
% cnf(83,negated_conjecture,(member(X1,intersection(esk3_0,esk5_0))|member(X1,intersection(esk3_0,esk4_0))|~member(X1,esk3_0)),inference(spm,[status(thm)],[28,56,theory(equality)])).
% cnf(132,negated_conjecture,(member(X1,esk5_0)|member(X1,intersection(esk3_0,esk4_0))|~member(X1,esk3_0)),inference(spm,[status(thm)],[33,83,theory(equality)])).
% cnf(393,negated_conjecture,(member(X1,esk4_0)|member(X1,esk5_0)|~member(X1,esk3_0)),inference(spm,[status(thm)],[33,132,theory(equality)])).
% cnf(398,negated_conjecture,(subset(X1,union(X2,esk5_0))|member(esk1_2(X1,union(X2,esk5_0)),esk4_0)|~member(esk1_2(X1,union(X2,esk5_0)),esk3_0)),inference(spm,[status(thm)],[73,393,theory(equality)])).
% cnf(22690,negated_conjecture,(subset(X1,union(esk4_0,esk5_0))|~member(esk1_2(X1,union(esk4_0,esk5_0)),esk3_0)),inference(spm,[status(thm)],[74,398,theory(equality)])).
% cnf(75040,negated_conjecture,(subset(esk3_0,union(esk4_0,esk5_0))),inference(spm,[status(thm)],[22690,41,theory(equality)])).
% cnf(75044,negated_conjecture,($false),inference(sr,[status(thm)],[75040,55,theory(equality)])).
% cnf(75045,negated_conjecture,($false),75044,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2643
% # ...of these trivial : 1091
% # ...subsumed : 802
% # ...remaining for further processing: 750
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 81
% # Generated clauses : 55499
% # ...of the previous two non-trivial : 37905
% # Contextual simplify-reflections : 16
% # Paramodulations : 55077
% # Factorizations : 420
% # Equation resolutions : 2
% # Current number of processed clauses: 657
% # Positive orientable unit clauses: 383
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 1
% # Non-unit-clauses : 271
% # Current number of unprocessed clauses: 33160
% # ...number of literals in the above : 94695
% # Clause-clause subsumption calls (NU) : 18329
% # Rec. Clause-clause subsumption calls : 8152
% # Unit Clause-clause subsumption calls : 2696
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2915
% # Indexed BW rewrite successes : 87
% # Backwards rewriting index: 385 leaves, 3.26+/-3.876 terms/leaf
% # Paramod-from index: 152 leaves, 4.07+/-3.878 terms/leaf
% # Paramod-into index: 336 leaves, 3.37+/-3.972 terms/leaf
% # -------------------------------------------------
% # User time : 1.245 s
% # System time : 0.049 s
% # Total time : 1.294 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.17 CPU 2.25 WC
% FINAL PrfWatch: 2.17 CPU 2.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP28433/SET594+3.tptp
%
%------------------------------------------------------------------------------