TSTP Solution File: SET586+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET586+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 : art03.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:12:34 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.92s
% 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/SystemOnTPTP1144/SET586+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP1144/SET586+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1144/SET586+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 1241
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:(member(X3,intersection(X1,X2))<=>(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersection_defn)).
% fof(3, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(4, axiom,![X1]:![X2]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(6, conjecture,![X1]:![X2]:![X3]:(subset(X1,X2)=>subset(intersection(X1,X3),intersection(X2,X3))),file('/tmp/SRASS.s.p', prove_intersection_of_subset)).
% fof(7, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(X1,X2)=>subset(intersection(X1,X3),intersection(X2,X3)))),inference(assume_negation,[status(cth)],[6])).
% fof(10, 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)],[2])).
% fof(11, 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)],[10])).
% fof(12, 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)],[11])).
% cnf(13,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[12])).
% cnf(14,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[12])).
% fof(16, 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)],[3])).
% fof(17, 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)],[16])).
% fof(18, 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)],[17])).
% fof(19, 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)],[18])).
% fof(20, 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)],[19])).
% cnf(21,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[20])).
% cnf(23,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(24, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[4])).
% cnf(25,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(35, negated_conjecture,?[X1]:?[X2]:?[X3]:(subset(X1,X2)&~(subset(intersection(X1,X3),intersection(X2,X3)))),inference(fof_nnf,[status(thm)],[7])).
% fof(36, negated_conjecture,?[X4]:?[X5]:?[X6]:(subset(X4,X5)&~(subset(intersection(X4,X6),intersection(X5,X6)))),inference(variable_rename,[status(thm)],[35])).
% fof(37, negated_conjecture,(subset(esk3_0,esk4_0)&~(subset(intersection(esk3_0,esk5_0),intersection(esk4_0,esk5_0)))),inference(skolemize,[status(esa)],[36])).
% cnf(38,negated_conjecture,(~subset(intersection(esk3_0,esk5_0),intersection(esk4_0,esk5_0))),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,negated_conjecture,(subset(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(42,plain,(member(esk1_2(intersection(X1,X2),X3),X2)|subset(intersection(X1,X2),X3)),inference(spm,[status(thm)],[14,22,theory(equality)])).
% cnf(48,negated_conjecture,(member(X1,esk4_0)|~member(X1,esk3_0)),inference(spm,[status(thm)],[23,39,theory(equality)])).
% cnf(50,plain,(subset(X1,intersection(X2,X3))|~member(esk1_2(X1,intersection(X2,X3)),X3)|~member(esk1_2(X1,intersection(X2,X3)),X2)),inference(spm,[status(thm)],[21,13,theory(equality)])).
% cnf(64,negated_conjecture,(subset(X1,esk4_0)|~member(esk1_2(X1,esk4_0),esk3_0)),inference(spm,[status(thm)],[21,48,theory(equality)])).
% cnf(69,negated_conjecture,(subset(intersection(X1,esk3_0),esk4_0)),inference(spm,[status(thm)],[64,42,theory(equality)])).
% cnf(74,negated_conjecture,(subset(intersection(esk3_0,X1),esk4_0)),inference(spm,[status(thm)],[69,25,theory(equality)])).
% cnf(79,negated_conjecture,(member(X1,esk4_0)|~member(X1,intersection(esk3_0,X2))),inference(spm,[status(thm)],[23,74,theory(equality)])).
% cnf(113,negated_conjecture,(member(esk1_2(intersection(esk3_0,X1),X2),esk4_0)|subset(intersection(esk3_0,X1),X2)),inference(spm,[status(thm)],[79,22,theory(equality)])).
% cnf(129,plain,(subset(intersection(X1,X2),intersection(X3,X2))|~member(esk1_2(intersection(X1,X2),intersection(X3,X2)),X3)),inference(spm,[status(thm)],[50,42,theory(equality)])).
% cnf(1106,negated_conjecture,(subset(intersection(esk3_0,X1),intersection(esk4_0,X1))),inference(spm,[status(thm)],[129,113,theory(equality)])).
% cnf(1121,negated_conjecture,($false),inference(rw,[status(thm)],[38,1106,theory(equality)])).
% cnf(1122,negated_conjecture,($false),inference(cn,[status(thm)],[1121,theory(equality)])).
% cnf(1123,negated_conjecture,($false),1122,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 263
% # ...of these trivial : 26
% # ...subsumed : 121
% # ...remaining for further processing: 116
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 932
% # ...of the previous two non-trivial : 811
% # Contextual simplify-reflections : 10
% # Paramodulations : 914
% # Factorizations : 18
% # Equation resolutions : 0
% # Current number of processed clauses: 112
% # Positive orientable unit clauses: 37
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 74
% # Current number of unprocessed clauses: 555
% # ...number of literals in the above : 1286
% # Clause-clause subsumption calls (NU) : 1323
% # Rec. Clause-clause subsumption calls : 1238
% # Unit Clause-clause subsumption calls : 137
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 69
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 125 leaves, 1.94+/-1.752 terms/leaf
% # Paramod-from index: 40 leaves, 2.27+/-2.213 terms/leaf
% # Paramod-into index: 114 leaves, 1.88+/-1.702 terms/leaf
% # -------------------------------------------------
% # User time : 0.038 s
% # System time : 0.003 s
% # Total time : 0.041 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP1144/SET586+3.tptp
%
%------------------------------------------------------------------------------