TSTP Solution File: SET628+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET628+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 : art02.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:18:54 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/SystemOnTPTP31793/SET628+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP31793/SET628+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31793/SET628+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 31889
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set_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, axiom,![X1]:![X2]:(not_equal(X1,X2)<=>~(X1=X2)),file('/tmp/SRASS.s.p', not_equal_defn)).
% fof(5, axiom,![X1]:![X2]:(X1=X2<=>![X3]:(member(X3,X1)<=>member(X3,X2))),file('/tmp/SRASS.s.p', equal_member_defn)).
% fof(7, conjecture,![X1]:(intersect(X1,X1)<=>not_equal(X1,empty_set)),file('/tmp/SRASS.s.p', prove_th110)).
% fof(8, negated_conjecture,~(![X1]:(intersect(X1,X1)<=>not_equal(X1,empty_set))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(14, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[9])).
% cnf(15,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[14])).
% 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(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, plain,![X1]:![X2]:((~(not_equal(X1,X2))|~(X1=X2))&(X1=X2|not_equal(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(25, plain,![X3]:![X4]:((~(not_equal(X3,X4))|~(X3=X4))&(X3=X4|not_equal(X3,X4))),inference(variable_rename,[status(thm)],[24])).
% cnf(26,plain,(not_equal(X1,X2)|X1=X2),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(X1!=X2|~not_equal(X1,X2)),inference(split_conjunct,[status(thm)],[25])).
% fof(28, plain,![X1]:![X2]:((~(X1=X2)|![X3]:((~(member(X3,X1))|member(X3,X2))&(~(member(X3,X2))|member(X3,X1))))&(?[X3]:((~(member(X3,X1))|~(member(X3,X2)))&(member(X3,X1)|member(X3,X2)))|X1=X2)),inference(fof_nnf,[status(thm)],[5])).
% fof(29, plain,![X4]:![X5]:((~(X4=X5)|![X6]:((~(member(X6,X4))|member(X6,X5))&(~(member(X6,X5))|member(X6,X4))))&(?[X7]:((~(member(X7,X4))|~(member(X7,X5)))&(member(X7,X4)|member(X7,X5)))|X4=X5)),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:((~(X4=X5)|![X6]:((~(member(X6,X4))|member(X6,X5))&(~(member(X6,X5))|member(X6,X4))))&(((~(member(esk2_2(X4,X5),X4))|~(member(esk2_2(X4,X5),X5)))&(member(esk2_2(X4,X5),X4)|member(esk2_2(X4,X5),X5)))|X4=X5)),inference(skolemize,[status(esa)],[29])).
% fof(31, plain,![X4]:![X5]:![X6]:((((~(member(X6,X4))|member(X6,X5))&(~(member(X6,X5))|member(X6,X4)))|~(X4=X5))&(((~(member(esk2_2(X4,X5),X4))|~(member(esk2_2(X4,X5),X5)))&(member(esk2_2(X4,X5),X4)|member(esk2_2(X4,X5),X5)))|X4=X5)),inference(shift_quantors,[status(thm)],[30])).
% fof(32, plain,![X4]:![X5]:![X6]:((((~(member(X6,X4))|member(X6,X5))|~(X4=X5))&((~(member(X6,X5))|member(X6,X4))|~(X4=X5)))&(((~(member(esk2_2(X4,X5),X4))|~(member(esk2_2(X4,X5),X5)))|X4=X5)&((member(esk2_2(X4,X5),X4)|member(esk2_2(X4,X5),X5))|X4=X5))),inference(distribute,[status(thm)],[31])).
% cnf(33,plain,(X1=X2|member(esk2_2(X1,X2),X2)|member(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(43, negated_conjecture,?[X1]:((~(intersect(X1,X1))|~(not_equal(X1,empty_set)))&(intersect(X1,X1)|not_equal(X1,empty_set))),inference(fof_nnf,[status(thm)],[8])).
% fof(44, negated_conjecture,?[X2]:((~(intersect(X2,X2))|~(not_equal(X2,empty_set)))&(intersect(X2,X2)|not_equal(X2,empty_set))),inference(variable_rename,[status(thm)],[43])).
% fof(45, negated_conjecture,((~(intersect(esk4_0,esk4_0))|~(not_equal(esk4_0,empty_set)))&(intersect(esk4_0,esk4_0)|not_equal(esk4_0,empty_set))),inference(skolemize,[status(esa)],[44])).
% cnf(46,negated_conjecture,(not_equal(esk4_0,empty_set)|intersect(esk4_0,esk4_0)),inference(split_conjunct,[status(thm)],[45])).
% cnf(47,negated_conjecture,(~not_equal(esk4_0,empty_set)|~intersect(esk4_0,esk4_0)),inference(split_conjunct,[status(thm)],[45])).
% cnf(48,plain,(~not_equal(X1,X1)),inference(er,[status(thm)],[27,theory(equality)])).
% cnf(49,negated_conjecture,(esk4_0=empty_set|~intersect(esk4_0,esk4_0)),inference(spm,[status(thm)],[47,26,theory(equality)])).
% cnf(52,plain,(~intersect(empty_set,X1)),inference(spm,[status(thm)],[15,22,theory(equality)])).
% cnf(59,plain,(empty_set=X1|member(esk2_2(empty_set,X1),X1)),inference(spm,[status(thm)],[15,33,theory(equality)])).
% cnf(70,plain,(intersect(X1,X2)|empty_set=X2|~member(esk2_2(empty_set,X2),X1)),inference(spm,[status(thm)],[23,59,theory(equality)])).
% cnf(75,plain,(empty_set=X1|intersect(X1,X1)|member(esk2_2(empty_set,X1),empty_set)),inference(spm,[status(thm)],[70,33,theory(equality)])).
% cnf(78,plain,(empty_set=X1|intersect(X1,X1)),inference(sr,[status(thm)],[75,15,theory(equality)])).
% cnf(80,negated_conjecture,(empty_set=esk4_0),inference(spm,[status(thm)],[49,78,theory(equality)])).
% cnf(93,plain,(~intersect(esk4_0,X1)),inference(rw,[status(thm)],[52,80,theory(equality)])).
% cnf(97,negated_conjecture,(not_equal(esk4_0,esk4_0)|intersect(esk4_0,esk4_0)),inference(rw,[status(thm)],[46,80,theory(equality)])).
% cnf(98,negated_conjecture,(intersect(esk4_0,esk4_0)),inference(sr,[status(thm)],[97,48,theory(equality)])).
% cnf(107,negated_conjecture,($false),inference(sr,[status(thm)],[98,93,theory(equality)])).
% cnf(108,negated_conjecture,($false),107,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 46
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 44
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 12
% # Generated clauses : 41
% # ...of the previous two non-trivial : 45
% # Contextual simplify-reflections : 0
% # Paramodulations : 37
% # Factorizations : 2
% # Equation resolutions : 1
% # Current number of processed clauses: 17
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 13
% # Current number of unprocessed clauses: 17
% # ...number of literals in the above : 41
% # Clause-clause subsumption calls (NU) : 18
% # Rec. Clause-clause subsumption calls : 15
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 15 leaves, 1.53+/-0.718 terms/leaf
% # Paramod-from index: 7 leaves, 1.29+/-0.452 terms/leaf
% # Paramod-into index: 13 leaves, 1.54+/-0.634 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.001 s
% # Total time : 0.014 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/SystemOnTPTP31793/SET628+3.tptp
%
%------------------------------------------------------------------------------