TSTP Solution File: SET637+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET637+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:20:10 EST 2010
% Result : Theorem 1.14s
% Output : Solution 1.14s
% 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/SystemOnTPTP32043/SET637+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32043/SET637+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32043/SET637+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 32139
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 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]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set_defn)).
% fof(3, axiom,![X1]:![X2]:![X3]:(member(X3,intersection(X1,X2))<=>(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersection_defn)).
% fof(4, axiom,![X1]:![X2]:(intersect(X1,X2)<=>?[X3]:(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersect_defn)).
% fof(5, axiom,![X1]:![X2]:(not_equal(X1,X2)<=>~(X1=X2)),file('/tmp/SRASS.s.p', not_equal_defn)).
% fof(7, axiom,![X1]:![X2]:(X1=X2<=>![X3]:(member(X3,X1)<=>member(X3,X2))),file('/tmp/SRASS.s.p', equal_member_defn)).
% fof(8, axiom,![X1]:(empty(X1)<=>![X2]:~(member(X2,X1))),file('/tmp/SRASS.s.p', empty_defn)).
% fof(9, conjecture,![X1]:![X2]:(intersect(X1,X2)<=>not_equal(intersection(X1,X2),empty_set)),file('/tmp/SRASS.s.p', prove_th119)).
% fof(10, negated_conjecture,~(![X1]:![X2]:(intersect(X1,X2)<=>not_equal(intersection(X1,X2),empty_set))),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(12, plain,![X1]:(empty(X1)<=>![X2]:~(member(X2,X1))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(13, plain,![X1]:![X2]:(~(intersect(X1,X2))|intersect(X2,X1)),inference(fof_nnf,[status(thm)],[1])).
% fof(14, plain,![X3]:![X4]:(~(intersect(X3,X4))|intersect(X4,X3)),inference(variable_rename,[status(thm)],[13])).
% cnf(15,plain,(intersect(X1,X2)|~intersect(X2,X1)),inference(split_conjunct,[status(thm)],[14])).
% fof(16, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[11])).
% cnf(17,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, 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)],[3])).
% fof(19, 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)],[18])).
% fof(20, 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)],[19])).
% cnf(21,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[20])).
% cnf(23,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[20])).
% fof(24, 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)],[4])).
% fof(25, 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)],[24])).
% fof(26, 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)],[25])).
% fof(27, 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)],[26])).
% fof(28, 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)],[27])).
% cnf(29,plain,(member(esk1_2(X1,X2),X2)|~intersect(X1,X2)),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,plain,(member(esk1_2(X1,X2),X1)|~intersect(X1,X2)),inference(split_conjunct,[status(thm)],[28])).
% cnf(31,plain,(intersect(X1,X2)|~member(X3,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(32, plain,![X1]:![X2]:((~(not_equal(X1,X2))|~(X1=X2))&(X1=X2|not_equal(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(33, plain,![X3]:![X4]:((~(not_equal(X3,X4))|~(X3=X4))&(X3=X4|not_equal(X3,X4))),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(not_equal(X1,X2)|X1=X2),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,plain,(X1!=X2|~not_equal(X1,X2)),inference(split_conjunct,[status(thm)],[33])).
% fof(38, 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)],[7])).
% fof(39, 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)],[38])).
% fof(40, 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)],[39])).
% fof(41, 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)],[40])).
% fof(42, 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)],[41])).
% cnf(43,plain,(X1=X2|member(esk2_2(X1,X2),X2)|member(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(47, plain,![X1]:((~(empty(X1))|![X2]:~(member(X2,X1)))&(?[X2]:member(X2,X1)|empty(X1))),inference(fof_nnf,[status(thm)],[12])).
% fof(48, plain,![X3]:((~(empty(X3))|![X4]:~(member(X4,X3)))&(?[X5]:member(X5,X3)|empty(X3))),inference(variable_rename,[status(thm)],[47])).
% fof(49, plain,![X3]:((~(empty(X3))|![X4]:~(member(X4,X3)))&(member(esk3_1(X3),X3)|empty(X3))),inference(skolemize,[status(esa)],[48])).
% fof(50, plain,![X3]:![X4]:((~(member(X4,X3))|~(empty(X3)))&(member(esk3_1(X3),X3)|empty(X3))),inference(shift_quantors,[status(thm)],[49])).
% cnf(51,plain,(empty(X1)|member(esk3_1(X1),X1)),inference(split_conjunct,[status(thm)],[50])).
% cnf(52,plain,(~empty(X1)|~member(X2,X1)),inference(split_conjunct,[status(thm)],[50])).
% fof(53, negated_conjecture,?[X1]:?[X2]:((~(intersect(X1,X2))|~(not_equal(intersection(X1,X2),empty_set)))&(intersect(X1,X2)|not_equal(intersection(X1,X2),empty_set))),inference(fof_nnf,[status(thm)],[10])).
% fof(54, negated_conjecture,?[X3]:?[X4]:((~(intersect(X3,X4))|~(not_equal(intersection(X3,X4),empty_set)))&(intersect(X3,X4)|not_equal(intersection(X3,X4),empty_set))),inference(variable_rename,[status(thm)],[53])).
% fof(55, negated_conjecture,((~(intersect(esk4_0,esk5_0))|~(not_equal(intersection(esk4_0,esk5_0),empty_set)))&(intersect(esk4_0,esk5_0)|not_equal(intersection(esk4_0,esk5_0),empty_set))),inference(skolemize,[status(esa)],[54])).
% cnf(56,negated_conjecture,(not_equal(intersection(esk4_0,esk5_0),empty_set)|intersect(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[55])).
% cnf(57,negated_conjecture,(~not_equal(intersection(esk4_0,esk5_0),empty_set)|~intersect(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[55])).
% cnf(58,plain,(~not_equal(X1,X1)),inference(er,[status(thm)],[35,theory(equality)])).
% cnf(61,plain,(intersect(X1,X2)|empty(X2)|~member(esk3_1(X2),X1)),inference(spm,[status(thm)],[31,51,theory(equality)])).
% cnf(62,negated_conjecture,(intersection(esk4_0,esk5_0)=empty_set|~intersect(esk4_0,esk5_0)),inference(spm,[status(thm)],[57,34,theory(equality)])).
% cnf(66,plain,(member(esk3_1(intersection(X1,X2)),X2)|empty(intersection(X1,X2))),inference(spm,[status(thm)],[22,51,theory(equality)])).
% cnf(74,plain,(intersect(X1,X2)|~member(esk1_2(X3,X2),X1)|~intersect(X3,X2)),inference(spm,[status(thm)],[31,29,theory(equality)])).
% cnf(75,plain,(member(esk1_2(intersection(X1,X2),X3),X1)|~intersect(intersection(X1,X2),X3)),inference(spm,[status(thm)],[23,30,theory(equality)])).
% cnf(90,plain,(empty_set=X1|member(esk2_2(empty_set,X1),X1)),inference(spm,[status(thm)],[17,43,theory(equality)])).
% cnf(102,plain,(empty_set=X1|~empty(X1)),inference(spm,[status(thm)],[52,90,theory(equality)])).
% cnf(171,plain,(empty(intersection(X1,X2))|intersect(X2,intersection(X1,X2))),inference(spm,[status(thm)],[61,66,theory(equality)])).
% cnf(198,plain,(empty_set=intersection(X1,X2)|intersect(X2,intersection(X1,X2))),inference(spm,[status(thm)],[102,171,theory(equality)])).
% cnf(221,plain,(intersect(intersection(X1,X2),X2)|intersection(X1,X2)=empty_set),inference(spm,[status(thm)],[15,198,theory(equality)])).
% cnf(1142,plain,(intersect(X1,X2)|~intersect(intersection(X1,X3),X2)),inference(spm,[status(thm)],[74,75,theory(equality)])).
% cnf(1191,plain,(intersect(X1,X2)|intersection(X1,X2)=empty_set),inference(spm,[status(thm)],[1142,221,theory(equality)])).
% cnf(1197,negated_conjecture,(intersection(esk4_0,esk5_0)=empty_set),inference(spm,[status(thm)],[62,1191,theory(equality)])).
% cnf(1221,negated_conjecture,(member(X1,empty_set)|~member(X1,esk5_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[21,1197,theory(equality)])).
% cnf(1233,negated_conjecture,(not_equal(empty_set,empty_set)|intersect(esk4_0,esk5_0)),inference(rw,[status(thm)],[56,1197,theory(equality)])).
% cnf(1234,negated_conjecture,(intersect(esk4_0,esk5_0)),inference(sr,[status(thm)],[1233,58,theory(equality)])).
% cnf(1247,negated_conjecture,(~member(X1,esk5_0)|~member(X1,esk4_0)),inference(sr,[status(thm)],[1221,17,theory(equality)])).
% cnf(1833,negated_conjecture,(~member(esk1_2(X1,esk5_0),esk4_0)|~intersect(X1,esk5_0)),inference(spm,[status(thm)],[1247,29,theory(equality)])).
% cnf(11939,negated_conjecture,(~intersect(esk4_0,esk5_0)),inference(spm,[status(thm)],[1833,30,theory(equality)])).
% cnf(11940,negated_conjecture,($false),inference(rw,[status(thm)],[11939,1234,theory(equality)])).
% cnf(11941,negated_conjecture,($false),inference(cn,[status(thm)],[11940,theory(equality)])).
% cnf(11942,negated_conjecture,($false),11941,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 908
% # ...of these trivial : 1
% # ...subsumed : 722
% # ...remaining for further processing: 185
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 6721
% # ...of the previous two non-trivial : 2556
% # Contextual simplify-reflections : 22
% # Paramodulations : 6710
% # Factorizations : 10
% # Equation resolutions : 1
% # Current number of processed clauses: 164
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 7
% # Non-unit-clauses : 148
% # Current number of unprocessed clauses: 1682
% # ...number of literals in the above : 4983
% # Clause-clause subsumption calls (NU) : 9628
% # Rec. Clause-clause subsumption calls : 9330
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 77 leaves, 2.08+/-2.243 terms/leaf
% # Paramod-from index: 40 leaves, 1.85+/-1.352 terms/leaf
% # Paramod-into index: 74 leaves, 1.89+/-1.640 terms/leaf
% # -------------------------------------------------
% # User time : 0.143 s
% # System time : 0.008 s
% # Total time : 0.151 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.34 CPU 0.43 WC
% FINAL PrfWatch: 0.34 CPU 0.43 WC
% SZS output end Solution for /tmp/SystemOnTPTP32043/SET637+3.tptp
%
%------------------------------------------------------------------------------