TSTP Solution File: SET573+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET573+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 : art06.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:10:08 EST 2010
% Result : Theorem 0.86s
% Output : Solution 0.86s
% 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/SystemOnTPTP27161/SET573+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP27161/SET573+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27161/SET573+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 27257
% 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(1, axiom,![X1]:![X2]:(intersect(X1,X2)<=>?[X3]:(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersect_defn)).
% fof(2, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>~(intersect(X1,X2))),file('/tmp/SRASS.s.p', disjoint_defn)).
% fof(4, conjecture,![X1]:![X2]:![X3]:((member(X1,X2)&disjoint(X2,X3))=>~(member(X1,X3))),file('/tmp/SRASS.s.p', prove_th12)).
% fof(5, negated_conjecture,~(![X1]:![X2]:![X3]:((member(X1,X2)&disjoint(X2,X3))=>~(member(X1,X3)))),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X1]:![X2]:(disjoint(X1,X2)<=>~(intersect(X1,X2))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(7, negated_conjecture,~(![X1]:![X2]:![X3]:((member(X1,X2)&disjoint(X2,X3))=>~(member(X1,X3)))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(8, 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)],[1])).
% fof(9, 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)],[8])).
% fof(10, 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)],[9])).
% fof(11, 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)],[10])).
% fof(12, 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)],[11])).
% cnf(15,plain,(intersect(X1,X2)|~member(X3,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[12])).
% fof(16, plain,![X1]:![X2]:((~(disjoint(X1,X2))|~(intersect(X1,X2)))&(intersect(X1,X2)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(17, plain,![X3]:![X4]:((~(disjoint(X3,X4))|~(intersect(X3,X4)))&(intersect(X3,X4)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[16])).
% cnf(19,plain,(~intersect(X1,X2)|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[17])).
% fof(23, negated_conjecture,?[X1]:?[X2]:?[X3]:((member(X1,X2)&disjoint(X2,X3))&member(X1,X3)),inference(fof_nnf,[status(thm)],[7])).
% fof(24, negated_conjecture,?[X4]:?[X5]:?[X6]:((member(X4,X5)&disjoint(X5,X6))&member(X4,X6)),inference(variable_rename,[status(thm)],[23])).
% fof(25, negated_conjecture,((member(esk2_0,esk3_0)&disjoint(esk3_0,esk4_0))&member(esk2_0,esk4_0)),inference(skolemize,[status(esa)],[24])).
% cnf(26,negated_conjecture,(member(esk2_0,esk4_0)),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,negated_conjecture,(disjoint(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[25])).
% cnf(28,negated_conjecture,(member(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[25])).
% cnf(29,negated_conjecture,(~intersect(esk3_0,esk4_0)),inference(spm,[status(thm)],[19,27,theory(equality)])).
% cnf(31,negated_conjecture,(intersect(X1,esk4_0)|~member(esk2_0,X1)),inference(spm,[status(thm)],[15,26,theory(equality)])).
% cnf(36,negated_conjecture,(intersect(esk3_0,esk4_0)),inference(spm,[status(thm)],[31,28,theory(equality)])).
% cnf(37,negated_conjecture,($false),inference(sr,[status(thm)],[36,29,theory(equality)])).
% cnf(38,negated_conjecture,($false),37,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 20
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 20
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 8
% # ...of the previous two non-trivial : 6
% # Contextual simplify-reflections : 0
% # Paramodulations : 8
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 11
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 7
% # Current number of unprocessed clauses: 4
% # ...number of literals in the above : 9
% # Clause-clause subsumption calls (NU) : 4
% # Rec. Clause-clause subsumption calls : 4
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 15 leaves, 1.20+/-0.400 terms/leaf
% # Paramod-from index: 5 leaves, 1.20+/-0.400 terms/leaf
% # Paramod-into index: 13 leaves, 1.08+/-0.266 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.002 s
% # Total time : 0.011 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/SystemOnTPTP27161/SET573+3.tptp
%
%------------------------------------------------------------------------------