TSTP Solution File: SET631+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET631+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:19:17 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP3986/SET631+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP3986/SET631+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3986/SET631+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 4082
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(intersect(X1,X2)=>intersect(X2,X1)),file('/tmp/SRASS.s.p', symmetry_of_intersect)).
% fof(2, axiom,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),file('/tmp/SRASS.s.p', difference_defn)).
% fof(3, axiom,![X1]:![X2]:(intersect(X1,X2)<=>?[X3]:(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersect_defn)).
% fof(4, conjecture,![X1]:![X2]:![X3]:(intersect(X1,difference(X2,X3))=>intersect(X1,X2)),file('/tmp/SRASS.s.p', prove_th113)).
% fof(5, negated_conjecture,~(![X1]:![X2]:![X3]:(intersect(X1,difference(X2,X3))=>intersect(X1,X2))),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(7, plain,![X1]:![X2]:(~(intersect(X1,X2))|intersect(X2,X1)),inference(fof_nnf,[status(thm)],[1])).
% fof(8, plain,![X3]:![X4]:(~(intersect(X3,X4))|intersect(X4,X3)),inference(variable_rename,[status(thm)],[7])).
% cnf(9,plain,(intersect(X1,X2)|~intersect(X2,X1)),inference(split_conjunct,[status(thm)],[8])).
% fof(10, 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)],[6])).
% fof(11, 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)],[10])).
% fof(12, 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)],[11])).
% cnf(15,plain,(member(X1,X2)|~member(X1,difference(X2,X3))),inference(split_conjunct,[status(thm)],[12])).
% fof(16, plain,![X1]:![X2]:((~(intersect(X1,X2))|?[X3]:(member(X3,X1)&member(X3,X2)))&(![X3]:(~(member(X3,X1))|~(member(X3,X2)))|intersect(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(17, plain,![X4]:![X5]:((~(intersect(X4,X5))|?[X6]:(member(X6,X4)&member(X6,X5)))&(![X7]:(~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X4]:![X5]:((~(intersect(X4,X5))|(member(esk1_2(X4,X5),X4)&member(esk1_2(X4,X5),X5)))&(![X7]:(~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))),inference(skolemize,[status(esa)],[17])).
% fof(19, plain,![X4]:![X5]:![X7]:(((~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))&(~(intersect(X4,X5))|(member(esk1_2(X4,X5),X4)&member(esk1_2(X4,X5),X5)))),inference(shift_quantors,[status(thm)],[18])).
% fof(20, plain,![X4]:![X5]:![X7]:(((~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))&((member(esk1_2(X4,X5),X4)|~(intersect(X4,X5)))&(member(esk1_2(X4,X5),X5)|~(intersect(X4,X5))))),inference(distribute,[status(thm)],[19])).
% cnf(21,plain,(member(esk1_2(X1,X2),X2)|~intersect(X1,X2)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(member(esk1_2(X1,X2),X1)|~intersect(X1,X2)),inference(split_conjunct,[status(thm)],[20])).
% cnf(23,plain,(intersect(X1,X2)|~member(X3,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(24, negated_conjecture,?[X1]:?[X2]:?[X3]:(intersect(X1,difference(X2,X3))&~(intersect(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(25, negated_conjecture,?[X4]:?[X5]:?[X6]:(intersect(X4,difference(X5,X6))&~(intersect(X4,X5))),inference(variable_rename,[status(thm)],[24])).
% fof(26, negated_conjecture,(intersect(esk2_0,difference(esk3_0,esk4_0))&~(intersect(esk2_0,esk3_0))),inference(skolemize,[status(esa)],[25])).
% cnf(27,negated_conjecture,(~intersect(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,negated_conjecture,(intersect(esk2_0,difference(esk3_0,esk4_0))),inference(split_conjunct,[status(thm)],[26])).
% cnf(29,negated_conjecture,(intersect(difference(esk3_0,esk4_0),esk2_0)),inference(spm,[status(thm)],[9,28,theory(equality)])).
% cnf(31,plain,(member(esk1_2(difference(X1,X2),X3),X1)|~intersect(difference(X1,X2),X3)),inference(spm,[status(thm)],[15,22,theory(equality)])).
% cnf(32,plain,(intersect(X1,X2)|~member(esk1_2(X3,X2),X1)|~intersect(X3,X2)),inference(spm,[status(thm)],[23,21,theory(equality)])).
% cnf(79,plain,(intersect(X1,X2)|~intersect(difference(X1,X3),X2)),inference(spm,[status(thm)],[32,31,theory(equality)])).
% cnf(92,negated_conjecture,(intersect(esk3_0,esk2_0)),inference(spm,[status(thm)],[79,29,theory(equality)])).
% cnf(96,negated_conjecture,(intersect(esk2_0,esk3_0)),inference(spm,[status(thm)],[9,92,theory(equality)])).
% cnf(98,negated_conjecture,($false),inference(sr,[status(thm)],[96,27,theory(equality)])).
% cnf(99,negated_conjecture,($false),98,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 44
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 43
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 56
% # ...of the previous two non-trivial : 39
% # Contextual simplify-reflections : 0
% # Paramodulations : 56
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 34
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 17
% # Current number of unprocessed clauses: 13
% # ...number of literals in the above : 35
% # Clause-clause subsumption calls (NU) : 51
% # Rec. Clause-clause subsumption calls : 51
% # Unit Clause-clause subsumption calls : 32
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 33 leaves, 1.94+/-1.496 terms/leaf
% # Paramod-from index: 12 leaves, 1.08+/-0.276 terms/leaf
% # Paramod-into index: 31 leaves, 1.68+/-1.305 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.003 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP3986/SET631+3.tptp
%
%------------------------------------------------------------------------------