TSTP Solution File: SET662+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET662+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 : art09.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:23:13 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP31941/SET662+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP31941/SET662+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31941/SET662+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 32037
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:ilf_type(X1,set_type),file('/tmp/SRASS.s.p', p20)).
% fof(3, axiom,![X1]:(ilf_type(X1,set_type)=>~(member(X1,empty_set))),file('/tmp/SRASS.s.p', p4)).
% fof(8, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>(![X3]:(ilf_type(X3,subset_type(cross_product(X1,X2)))=>ilf_type(X3,relation_type(X1,X2)))&![X4]:(ilf_type(X4,relation_type(X1,X2))=>ilf_type(X4,subset_type(cross_product(X1,X2))))))),file('/tmp/SRASS.s.p', p2)).
% fof(12, axiom,![X1]:(ilf_type(X1,set_type)=>(empty(X1)<=>![X2]:(ilf_type(X2,set_type)=>~(member(X2,X1))))),file('/tmp/SRASS.s.p', p11)).
% fof(14, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>(member(X1,power_set(X2))<=>![X3]:(ilf_type(X3,set_type)=>(member(X3,X1)=>member(X3,X2)))))),file('/tmp/SRASS.s.p', p12)).
% fof(15, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:((~(empty(X2))&ilf_type(X2,set_type))=>(ilf_type(X1,member_type(X2))<=>member(X1,X2)))),file('/tmp/SRASS.s.p', p14)).
% fof(19, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>(ilf_type(X2,subset_type(X1))<=>ilf_type(X2,member_type(power_set(X1)))))),file('/tmp/SRASS.s.p', p7)).
% fof(22, conjecture,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>ilf_type(empty_set,relation_type(X1,X2)))),file('/tmp/SRASS.s.p', prove_relset_1_25)).
% fof(23, negated_conjecture,~(![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>ilf_type(empty_set,relation_type(X1,X2))))),inference(assume_negation,[status(cth)],[22])).
% fof(24, plain,![X1]:(ilf_type(X1,set_type)=>~(member(X1,empty_set))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(25, plain,![X1]:(ilf_type(X1,set_type)=>(empty(X1)<=>![X2]:(ilf_type(X2,set_type)=>~(member(X2,X1))))),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(26, plain,![X1]:(ilf_type(X1,set_type)=>![X2]:((~(empty(X2))&ilf_type(X2,set_type))=>(ilf_type(X1,member_type(X2))<=>member(X1,X2)))),inference(fof_simplification,[status(thm)],[15,theory(equality)])).
% fof(34, plain,![X2]:ilf_type(X2,set_type),inference(variable_rename,[status(thm)],[2])).
% cnf(35,plain,(ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X1]:(~(ilf_type(X1,set_type))|~(member(X1,empty_set))),inference(fof_nnf,[status(thm)],[24])).
% fof(37, plain,![X2]:(~(ilf_type(X2,set_type))|~(member(X2,empty_set))),inference(variable_rename,[status(thm)],[36])).
% cnf(38,plain,(~member(X1,empty_set)|~ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[37])).
% fof(49, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|(![X3]:(~(ilf_type(X3,subset_type(cross_product(X1,X2))))|ilf_type(X3,relation_type(X1,X2)))&![X4]:(~(ilf_type(X4,relation_type(X1,X2)))|ilf_type(X4,subset_type(cross_product(X1,X2))))))),inference(fof_nnf,[status(thm)],[8])).
% fof(50, plain,![X5]:(~(ilf_type(X5,set_type))|![X6]:(~(ilf_type(X6,set_type))|(![X7]:(~(ilf_type(X7,subset_type(cross_product(X5,X6))))|ilf_type(X7,relation_type(X5,X6)))&![X8]:(~(ilf_type(X8,relation_type(X5,X6)))|ilf_type(X8,subset_type(cross_product(X5,X6))))))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X5]:![X6]:![X7]:![X8]:((((~(ilf_type(X8,relation_type(X5,X6)))|ilf_type(X8,subset_type(cross_product(X5,X6))))&(~(ilf_type(X7,subset_type(cross_product(X5,X6))))|ilf_type(X7,relation_type(X5,X6))))|~(ilf_type(X6,set_type)))|~(ilf_type(X5,set_type))),inference(shift_quantors,[status(thm)],[50])).
% fof(52, plain,![X5]:![X6]:![X7]:![X8]:((((~(ilf_type(X8,relation_type(X5,X6)))|ilf_type(X8,subset_type(cross_product(X5,X6))))|~(ilf_type(X6,set_type)))|~(ilf_type(X5,set_type)))&(((~(ilf_type(X7,subset_type(cross_product(X5,X6))))|ilf_type(X7,relation_type(X5,X6)))|~(ilf_type(X6,set_type)))|~(ilf_type(X5,set_type)))),inference(distribute,[status(thm)],[51])).
% cnf(53,plain,(ilf_type(X3,relation_type(X1,X2))|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~ilf_type(X3,subset_type(cross_product(X1,X2)))),inference(split_conjunct,[status(thm)],[52])).
% fof(66, plain,![X1]:(~(ilf_type(X1,set_type))|((~(empty(X1))|![X2]:(~(ilf_type(X2,set_type))|~(member(X2,X1))))&(?[X2]:(ilf_type(X2,set_type)&member(X2,X1))|empty(X1)))),inference(fof_nnf,[status(thm)],[25])).
% fof(67, plain,![X3]:(~(ilf_type(X3,set_type))|((~(empty(X3))|![X4]:(~(ilf_type(X4,set_type))|~(member(X4,X3))))&(?[X5]:(ilf_type(X5,set_type)&member(X5,X3))|empty(X3)))),inference(variable_rename,[status(thm)],[66])).
% fof(68, plain,![X3]:(~(ilf_type(X3,set_type))|((~(empty(X3))|![X4]:(~(ilf_type(X4,set_type))|~(member(X4,X3))))&((ilf_type(esk3_1(X3),set_type)&member(esk3_1(X3),X3))|empty(X3)))),inference(skolemize,[status(esa)],[67])).
% fof(69, plain,![X3]:![X4]:((((~(ilf_type(X4,set_type))|~(member(X4,X3)))|~(empty(X3)))&((ilf_type(esk3_1(X3),set_type)&member(esk3_1(X3),X3))|empty(X3)))|~(ilf_type(X3,set_type))),inference(shift_quantors,[status(thm)],[68])).
% fof(70, plain,![X3]:![X4]:((((~(ilf_type(X4,set_type))|~(member(X4,X3)))|~(empty(X3)))|~(ilf_type(X3,set_type)))&(((ilf_type(esk3_1(X3),set_type)|empty(X3))|~(ilf_type(X3,set_type)))&((member(esk3_1(X3),X3)|empty(X3))|~(ilf_type(X3,set_type))))),inference(distribute,[status(thm)],[69])).
% cnf(73,plain,(~ilf_type(X1,set_type)|~empty(X1)|~member(X2,X1)|~ilf_type(X2,set_type)),inference(split_conjunct,[status(thm)],[70])).
% fof(83, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|((~(member(X1,power_set(X2)))|![X3]:(~(ilf_type(X3,set_type))|(~(member(X3,X1))|member(X3,X2))))&(?[X3]:(ilf_type(X3,set_type)&(member(X3,X1)&~(member(X3,X2))))|member(X1,power_set(X2)))))),inference(fof_nnf,[status(thm)],[14])).
% fof(84, plain,![X4]:(~(ilf_type(X4,set_type))|![X5]:(~(ilf_type(X5,set_type))|((~(member(X4,power_set(X5)))|![X6]:(~(ilf_type(X6,set_type))|(~(member(X6,X4))|member(X6,X5))))&(?[X7]:(ilf_type(X7,set_type)&(member(X7,X4)&~(member(X7,X5))))|member(X4,power_set(X5)))))),inference(variable_rename,[status(thm)],[83])).
% fof(85, plain,![X4]:(~(ilf_type(X4,set_type))|![X5]:(~(ilf_type(X5,set_type))|((~(member(X4,power_set(X5)))|![X6]:(~(ilf_type(X6,set_type))|(~(member(X6,X4))|member(X6,X5))))&((ilf_type(esk5_2(X4,X5),set_type)&(member(esk5_2(X4,X5),X4)&~(member(esk5_2(X4,X5),X5))))|member(X4,power_set(X5)))))),inference(skolemize,[status(esa)],[84])).
% fof(86, plain,![X4]:![X5]:![X6]:(((((~(ilf_type(X6,set_type))|(~(member(X6,X4))|member(X6,X5)))|~(member(X4,power_set(X5))))&((ilf_type(esk5_2(X4,X5),set_type)&(member(esk5_2(X4,X5),X4)&~(member(esk5_2(X4,X5),X5))))|member(X4,power_set(X5))))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type))),inference(shift_quantors,[status(thm)],[85])).
% fof(87, plain,![X4]:![X5]:![X6]:(((((~(ilf_type(X6,set_type))|(~(member(X6,X4))|member(X6,X5)))|~(member(X4,power_set(X5))))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&((((ilf_type(esk5_2(X4,X5),set_type)|member(X4,power_set(X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&((((member(esk5_2(X4,X5),X4)|member(X4,power_set(X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&(((~(member(esk5_2(X4,X5),X5))|member(X4,power_set(X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))))),inference(distribute,[status(thm)],[86])).
% cnf(89,plain,(member(X1,power_set(X2))|member(esk5_2(X1,X2),X1)|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)),inference(split_conjunct,[status(thm)],[87])).
% fof(92, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:((empty(X2)|~(ilf_type(X2,set_type)))|((~(ilf_type(X1,member_type(X2)))|member(X1,X2))&(~(member(X1,X2))|ilf_type(X1,member_type(X2)))))),inference(fof_nnf,[status(thm)],[26])).
% fof(93, plain,![X3]:(~(ilf_type(X3,set_type))|![X4]:((empty(X4)|~(ilf_type(X4,set_type)))|((~(ilf_type(X3,member_type(X4)))|member(X3,X4))&(~(member(X3,X4))|ilf_type(X3,member_type(X4)))))),inference(variable_rename,[status(thm)],[92])).
% fof(94, plain,![X3]:![X4]:(((empty(X4)|~(ilf_type(X4,set_type)))|((~(ilf_type(X3,member_type(X4)))|member(X3,X4))&(~(member(X3,X4))|ilf_type(X3,member_type(X4)))))|~(ilf_type(X3,set_type))),inference(shift_quantors,[status(thm)],[93])).
% fof(95, plain,![X3]:![X4]:((((~(ilf_type(X3,member_type(X4)))|member(X3,X4))|(empty(X4)|~(ilf_type(X4,set_type))))|~(ilf_type(X3,set_type)))&(((~(member(X3,X4))|ilf_type(X3,member_type(X4)))|(empty(X4)|~(ilf_type(X4,set_type))))|~(ilf_type(X3,set_type)))),inference(distribute,[status(thm)],[94])).
% cnf(96,plain,(empty(X2)|ilf_type(X1,member_type(X2))|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[95])).
% fof(110, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|((~(ilf_type(X2,subset_type(X1)))|ilf_type(X2,member_type(power_set(X1))))&(~(ilf_type(X2,member_type(power_set(X1))))|ilf_type(X2,subset_type(X1)))))),inference(fof_nnf,[status(thm)],[19])).
% fof(111, plain,![X3]:(~(ilf_type(X3,set_type))|![X4]:(~(ilf_type(X4,set_type))|((~(ilf_type(X4,subset_type(X3)))|ilf_type(X4,member_type(power_set(X3))))&(~(ilf_type(X4,member_type(power_set(X3))))|ilf_type(X4,subset_type(X3)))))),inference(variable_rename,[status(thm)],[110])).
% fof(112, plain,![X3]:![X4]:((~(ilf_type(X4,set_type))|((~(ilf_type(X4,subset_type(X3)))|ilf_type(X4,member_type(power_set(X3))))&(~(ilf_type(X4,member_type(power_set(X3))))|ilf_type(X4,subset_type(X3)))))|~(ilf_type(X3,set_type))),inference(shift_quantors,[status(thm)],[111])).
% fof(113, plain,![X3]:![X4]:((((~(ilf_type(X4,subset_type(X3)))|ilf_type(X4,member_type(power_set(X3))))|~(ilf_type(X4,set_type)))|~(ilf_type(X3,set_type)))&(((~(ilf_type(X4,member_type(power_set(X3))))|ilf_type(X4,subset_type(X3)))|~(ilf_type(X4,set_type)))|~(ilf_type(X3,set_type)))),inference(distribute,[status(thm)],[112])).
% cnf(114,plain,(ilf_type(X2,subset_type(X1))|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~ilf_type(X2,member_type(power_set(X1)))),inference(split_conjunct,[status(thm)],[113])).
% fof(131, negated_conjecture,?[X1]:(ilf_type(X1,set_type)&?[X2]:(ilf_type(X2,set_type)&~(ilf_type(empty_set,relation_type(X1,X2))))),inference(fof_nnf,[status(thm)],[23])).
% fof(132, negated_conjecture,?[X3]:(ilf_type(X3,set_type)&?[X4]:(ilf_type(X4,set_type)&~(ilf_type(empty_set,relation_type(X3,X4))))),inference(variable_rename,[status(thm)],[131])).
% fof(133, negated_conjecture,(ilf_type(esk10_0,set_type)&(ilf_type(esk11_0,set_type)&~(ilf_type(empty_set,relation_type(esk10_0,esk11_0))))),inference(skolemize,[status(esa)],[132])).
% cnf(134,negated_conjecture,(~ilf_type(empty_set,relation_type(esk10_0,esk11_0))),inference(split_conjunct,[status(thm)],[133])).
% cnf(141,plain,($false|~member(X1,empty_set)),inference(rw,[status(thm)],[38,35,theory(equality)])).
% cnf(142,plain,(~member(X1,empty_set)),inference(cn,[status(thm)],[141,theory(equality)])).
% cnf(178,plain,(~empty(X1)|~member(X2,X1)|$false|~ilf_type(X1,set_type)),inference(rw,[status(thm)],[73,35,theory(equality)])).
% cnf(179,plain,(~empty(X1)|~member(X2,X1)|$false|$false),inference(rw,[status(thm)],[178,35,theory(equality)])).
% cnf(180,plain,(~empty(X1)|~member(X2,X1)),inference(cn,[status(thm)],[179,theory(equality)])).
% cnf(197,plain,(ilf_type(X2,subset_type(X1))|$false|~ilf_type(X1,set_type)|~ilf_type(X2,member_type(power_set(X1)))),inference(rw,[status(thm)],[114,35,theory(equality)])).
% cnf(198,plain,(ilf_type(X2,subset_type(X1))|$false|$false|~ilf_type(X2,member_type(power_set(X1)))),inference(rw,[status(thm)],[197,35,theory(equality)])).
% cnf(199,plain,(ilf_type(X2,subset_type(X1))|~ilf_type(X2,member_type(power_set(X1)))),inference(cn,[status(thm)],[198,theory(equality)])).
% cnf(200,plain,(empty(X2)|ilf_type(X1,member_type(X2))|~member(X1,X2)|$false|~ilf_type(X1,set_type)),inference(rw,[status(thm)],[96,35,theory(equality)])).
% cnf(201,plain,(empty(X2)|ilf_type(X1,member_type(X2))|~member(X1,X2)|$false|$false),inference(rw,[status(thm)],[200,35,theory(equality)])).
% cnf(202,plain,(empty(X2)|ilf_type(X1,member_type(X2))|~member(X1,X2)),inference(cn,[status(thm)],[201,theory(equality)])).
% cnf(203,plain,(ilf_type(X1,member_type(X2))|~member(X1,X2)),inference(csr,[status(thm)],[202,180])).
% cnf(214,plain,(ilf_type(X3,relation_type(X1,X2))|$false|~ilf_type(X1,set_type)|~ilf_type(X3,subset_type(cross_product(X1,X2)))),inference(rw,[status(thm)],[53,35,theory(equality)])).
% cnf(215,plain,(ilf_type(X3,relation_type(X1,X2))|$false|$false|~ilf_type(X3,subset_type(cross_product(X1,X2)))),inference(rw,[status(thm)],[214,35,theory(equality)])).
% cnf(216,plain,(ilf_type(X3,relation_type(X1,X2))|~ilf_type(X3,subset_type(cross_product(X1,X2)))),inference(cn,[status(thm)],[215,theory(equality)])).
% cnf(221,plain,(member(X1,power_set(X2))|member(esk5_2(X1,X2),X1)|$false|~ilf_type(X1,set_type)),inference(rw,[status(thm)],[89,35,theory(equality)])).
% cnf(222,plain,(member(X1,power_set(X2))|member(esk5_2(X1,X2),X1)|$false|$false),inference(rw,[status(thm)],[221,35,theory(equality)])).
% cnf(223,plain,(member(X1,power_set(X2))|member(esk5_2(X1,X2),X1)),inference(cn,[status(thm)],[222,theory(equality)])).
% cnf(261,plain,(ilf_type(X1,subset_type(X2))|~member(X1,power_set(X2))),inference(spm,[status(thm)],[199,203,theory(equality)])).
% cnf(267,plain,(member(empty_set,power_set(X1))),inference(spm,[status(thm)],[142,223,theory(equality)])).
% cnf(308,plain,(ilf_type(empty_set,subset_type(X1))),inference(spm,[status(thm)],[261,267,theory(equality)])).
% cnf(315,plain,(ilf_type(empty_set,relation_type(X1,X2))),inference(spm,[status(thm)],[216,308,theory(equality)])).
% cnf(318,negated_conjecture,($false),inference(rw,[status(thm)],[134,315,theory(equality)])).
% cnf(319,negated_conjecture,($false),inference(cn,[status(thm)],[318,theory(equality)])).
% cnf(320,negated_conjecture,($false),319,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 93
% # ...of these trivial : 9
% # ...subsumed : 6
% # ...remaining for further processing: 78
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 60
% # ...of the previous two non-trivial : 45
% # Contextual simplify-reflections : 1
% # Paramodulations : 60
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 44
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 26
% # Current number of unprocessed clauses: 22
% # ...number of literals in the above : 48
% # Clause-clause subsumption calls (NU) : 7
% # Rec. Clause-clause subsumption calls : 7
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 57 leaves, 1.26+/-0.578 terms/leaf
% # Paramod-from index: 27 leaves, 1.07+/-0.262 terms/leaf
% # Paramod-into index: 54 leaves, 1.22+/-0.533 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.004 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP31941/SET662+3.tptp
%
%------------------------------------------------------------------------------