TSTP Solution File: SET664+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET664+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 : art01.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:32 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP28468/SET664+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28468/SET664+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28468/SET664+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 28564
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.018 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', p33)).
% fof(3, axiom,![X1]:(ilf_type(X1,set_type)=>(subset(X1,empty_set)=>X1=empty_set)),file('/tmp/SRASS.s.p', p1)).
% fof(15, axiom,![X1]:(ilf_type(X1,binary_relation_type)=>((domain_of(X1)=empty_set|range_of(X1)=empty_set)=>X1=empty_set)),file('/tmp/SRASS.s.p', p2)).
% fof(16, 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', p6)).
% fof(19, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,subset_type(cross_product(X1,X2)))=>relation_like(X3)))),file('/tmp/SRASS.s.p', p28)).
% fof(26, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,relation_type(X1,X2))=>(subset(domain_of(X3),X1)&subset(range_of(X3),X2))))),file('/tmp/SRASS.s.p', p3)).
% fof(29, axiom,![X1]:(ilf_type(X1,set_type)=>(ilf_type(X1,binary_relation_type)<=>(relation_like(X1)&ilf_type(X1,set_type)))),file('/tmp/SRASS.s.p', p13)).
% fof(35, conjecture,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,relation_type(X2,X1))=>(ilf_type(X3,relation_type(X2,empty_set))=>X3=empty_set)))),file('/tmp/SRASS.s.p', prove_relset_1_27)).
% fof(36, negated_conjecture,~(![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,relation_type(X2,X1))=>(ilf_type(X3,relation_type(X2,empty_set))=>X3=empty_set))))),inference(assume_negation,[status(cth)],[35])).
% fof(47, plain,![X2]:ilf_type(X2,set_type),inference(variable_rename,[status(thm)],[2])).
% cnf(48,plain,(ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X1]:(~(ilf_type(X1,set_type))|(~(subset(X1,empty_set))|X1=empty_set)),inference(fof_nnf,[status(thm)],[3])).
% fof(50, plain,![X2]:(~(ilf_type(X2,set_type))|(~(subset(X2,empty_set))|X2=empty_set)),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(X1=empty_set|~subset(X1,empty_set)|~ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[50])).
% fof(86, plain,![X1]:(~(ilf_type(X1,binary_relation_type))|((~(domain_of(X1)=empty_set)&~(range_of(X1)=empty_set))|X1=empty_set)),inference(fof_nnf,[status(thm)],[15])).
% fof(87, plain,![X2]:(~(ilf_type(X2,binary_relation_type))|((~(domain_of(X2)=empty_set)&~(range_of(X2)=empty_set))|X2=empty_set)),inference(variable_rename,[status(thm)],[86])).
% fof(88, plain,![X2]:(((~(domain_of(X2)=empty_set)|X2=empty_set)|~(ilf_type(X2,binary_relation_type)))&((~(range_of(X2)=empty_set)|X2=empty_set)|~(ilf_type(X2,binary_relation_type)))),inference(distribute,[status(thm)],[87])).
% cnf(89,plain,(X1=empty_set|~ilf_type(X1,binary_relation_type)|range_of(X1)!=empty_set),inference(split_conjunct,[status(thm)],[88])).
% fof(91, 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)],[16])).
% fof(92, 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)],[91])).
% fof(93, 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)],[92])).
% fof(94, 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)],[93])).
% cnf(96,plain,(ilf_type(X3,subset_type(cross_product(X1,X2)))|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~ilf_type(X3,relation_type(X1,X2))),inference(split_conjunct,[status(thm)],[94])).
% fof(105, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|![X3]:(~(ilf_type(X3,subset_type(cross_product(X1,X2))))|relation_like(X3)))),inference(fof_nnf,[status(thm)],[19])).
% fof(106, plain,![X4]:(~(ilf_type(X4,set_type))|![X5]:(~(ilf_type(X5,set_type))|![X6]:(~(ilf_type(X6,subset_type(cross_product(X4,X5))))|relation_like(X6)))),inference(variable_rename,[status(thm)],[105])).
% fof(107, plain,![X4]:![X5]:![X6]:(((~(ilf_type(X6,subset_type(cross_product(X4,X5))))|relation_like(X6))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type))),inference(shift_quantors,[status(thm)],[106])).
% cnf(108,plain,(relation_like(X3)|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~ilf_type(X3,subset_type(cross_product(X1,X2)))),inference(split_conjunct,[status(thm)],[107])).
% fof(147, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|![X3]:(~(ilf_type(X3,relation_type(X1,X2)))|(subset(domain_of(X3),X1)&subset(range_of(X3),X2))))),inference(fof_nnf,[status(thm)],[26])).
% fof(148, plain,![X4]:(~(ilf_type(X4,set_type))|![X5]:(~(ilf_type(X5,set_type))|![X6]:(~(ilf_type(X6,relation_type(X4,X5)))|(subset(domain_of(X6),X4)&subset(range_of(X6),X5))))),inference(variable_rename,[status(thm)],[147])).
% fof(149, plain,![X4]:![X5]:![X6]:(((~(ilf_type(X6,relation_type(X4,X5)))|(subset(domain_of(X6),X4)&subset(range_of(X6),X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type))),inference(shift_quantors,[status(thm)],[148])).
% fof(150, plain,![X4]:![X5]:![X6]:((((subset(domain_of(X6),X4)|~(ilf_type(X6,relation_type(X4,X5))))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&(((subset(range_of(X6),X5)|~(ilf_type(X6,relation_type(X4,X5))))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))),inference(distribute,[status(thm)],[149])).
% cnf(151,plain,(subset(range_of(X3),X2)|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~ilf_type(X3,relation_type(X1,X2))),inference(split_conjunct,[status(thm)],[150])).
% fof(173, plain,![X1]:(~(ilf_type(X1,set_type))|((~(ilf_type(X1,binary_relation_type))|(relation_like(X1)&ilf_type(X1,set_type)))&((~(relation_like(X1))|~(ilf_type(X1,set_type)))|ilf_type(X1,binary_relation_type)))),inference(fof_nnf,[status(thm)],[29])).
% fof(174, plain,![X2]:(~(ilf_type(X2,set_type))|((~(ilf_type(X2,binary_relation_type))|(relation_like(X2)&ilf_type(X2,set_type)))&((~(relation_like(X2))|~(ilf_type(X2,set_type)))|ilf_type(X2,binary_relation_type)))),inference(variable_rename,[status(thm)],[173])).
% fof(175, plain,![X2]:((((relation_like(X2)|~(ilf_type(X2,binary_relation_type)))|~(ilf_type(X2,set_type)))&((ilf_type(X2,set_type)|~(ilf_type(X2,binary_relation_type)))|~(ilf_type(X2,set_type))))&(((~(relation_like(X2))|~(ilf_type(X2,set_type)))|ilf_type(X2,binary_relation_type))|~(ilf_type(X2,set_type)))),inference(distribute,[status(thm)],[174])).
% cnf(176,plain,(ilf_type(X1,binary_relation_type)|~ilf_type(X1,set_type)|~ilf_type(X1,set_type)|~relation_like(X1)),inference(split_conjunct,[status(thm)],[175])).
% fof(203, negated_conjecture,?[X1]:(ilf_type(X1,set_type)&?[X2]:(ilf_type(X2,set_type)&?[X3]:(ilf_type(X3,relation_type(X2,X1))&(ilf_type(X3,relation_type(X2,empty_set))&~(X3=empty_set))))),inference(fof_nnf,[status(thm)],[36])).
% fof(204, negated_conjecture,?[X4]:(ilf_type(X4,set_type)&?[X5]:(ilf_type(X5,set_type)&?[X6]:(ilf_type(X6,relation_type(X5,X4))&(ilf_type(X6,relation_type(X5,empty_set))&~(X6=empty_set))))),inference(variable_rename,[status(thm)],[203])).
% fof(205, negated_conjecture,(ilf_type(esk13_0,set_type)&(ilf_type(esk14_0,set_type)&(ilf_type(esk15_0,relation_type(esk14_0,esk13_0))&(ilf_type(esk15_0,relation_type(esk14_0,empty_set))&~(esk15_0=empty_set))))),inference(skolemize,[status(esa)],[204])).
% cnf(206,negated_conjecture,(esk15_0!=empty_set),inference(split_conjunct,[status(thm)],[205])).
% cnf(207,negated_conjecture,(ilf_type(esk15_0,relation_type(esk14_0,empty_set))),inference(split_conjunct,[status(thm)],[205])).
% cnf(208,negated_conjecture,(ilf_type(esk15_0,relation_type(esk14_0,esk13_0))),inference(split_conjunct,[status(thm)],[205])).
% cnf(225,plain,(ilf_type(X1,binary_relation_type)|~relation_like(X1)|$false),inference(rw,[status(thm)],[176,48,theory(equality)])).
% cnf(226,plain,(ilf_type(X1,binary_relation_type)|~relation_like(X1)),inference(cn,[status(thm)],[225,theory(equality)])).
% cnf(227,plain,(empty_set=X1|$false|~subset(X1,empty_set)),inference(rw,[status(thm)],[51,48,theory(equality)])).
% cnf(228,plain,(empty_set=X1|~subset(X1,empty_set)),inference(cn,[status(thm)],[227,theory(equality)])).
% cnf(237,plain,(relation_like(X3)|$false|~ilf_type(X1,set_type)|~ilf_type(X3,subset_type(cross_product(X1,X2)))),inference(rw,[status(thm)],[108,48,theory(equality)])).
% cnf(238,plain,(relation_like(X3)|$false|$false|~ilf_type(X3,subset_type(cross_product(X1,X2)))),inference(rw,[status(thm)],[237,48,theory(equality)])).
% cnf(239,plain,(relation_like(X3)|~ilf_type(X3,subset_type(cross_product(X1,X2)))),inference(cn,[status(thm)],[238,theory(equality)])).
% cnf(314,plain,(subset(range_of(X3),X2)|$false|~ilf_type(X1,set_type)|~ilf_type(X3,relation_type(X1,X2))),inference(rw,[status(thm)],[151,48,theory(equality)])).
% cnf(315,plain,(subset(range_of(X3),X2)|$false|$false|~ilf_type(X3,relation_type(X1,X2))),inference(rw,[status(thm)],[314,48,theory(equality)])).
% cnf(316,plain,(subset(range_of(X3),X2)|~ilf_type(X3,relation_type(X1,X2))),inference(cn,[status(thm)],[315,theory(equality)])).
% cnf(318,negated_conjecture,(subset(range_of(esk15_0),empty_set)),inference(spm,[status(thm)],[316,207,theory(equality)])).
% cnf(365,plain,(ilf_type(X3,subset_type(cross_product(X1,X2)))|$false|~ilf_type(X1,set_type)|~ilf_type(X3,relation_type(X1,X2))),inference(rw,[status(thm)],[96,48,theory(equality)])).
% cnf(366,plain,(ilf_type(X3,subset_type(cross_product(X1,X2)))|$false|$false|~ilf_type(X3,relation_type(X1,X2))),inference(rw,[status(thm)],[365,48,theory(equality)])).
% cnf(367,plain,(ilf_type(X3,subset_type(cross_product(X1,X2)))|~ilf_type(X3,relation_type(X1,X2))),inference(cn,[status(thm)],[366,theory(equality)])).
% cnf(368,negated_conjecture,(ilf_type(esk15_0,subset_type(cross_product(esk14_0,esk13_0)))),inference(spm,[status(thm)],[367,208,theory(equality)])).
% cnf(428,negated_conjecture,(empty_set=range_of(esk15_0)),inference(spm,[status(thm)],[228,318,theory(equality)])).
% cnf(430,negated_conjecture,(empty_set=esk15_0|~ilf_type(esk15_0,binary_relation_type)),inference(spm,[status(thm)],[89,428,theory(equality)])).
% cnf(433,negated_conjecture,(~ilf_type(esk15_0,binary_relation_type)),inference(sr,[status(thm)],[430,206,theory(equality)])).
% cnf(490,negated_conjecture,(relation_like(esk15_0)),inference(spm,[status(thm)],[239,368,theory(equality)])).
% cnf(497,negated_conjecture,(ilf_type(esk15_0,binary_relation_type)),inference(spm,[status(thm)],[226,490,theory(equality)])).
% cnf(498,negated_conjecture,($false),inference(sr,[status(thm)],[497,433,theory(equality)])).
% cnf(499,negated_conjecture,($false),498,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 106
% # ...of these trivial : 15
% # ...subsumed : 8
% # ...remaining for further processing: 83
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 126
% # ...of the previous two non-trivial : 112
% # Contextual simplify-reflections : 2
% # Paramodulations : 126
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 76
% # Positive orientable unit clauses: 30
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 42
% # Current number of unprocessed clauses: 62
% # ...number of literals in the above : 124
% # Clause-clause subsumption calls (NU) : 28
% # Rec. Clause-clause subsumption calls : 25
% # Unit Clause-clause subsumption calls : 18
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 14
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 103 leaves, 1.23+/-0.561 terms/leaf
% # Paramod-from index: 36 leaves, 1.06+/-0.229 terms/leaf
% # Paramod-into index: 86 leaves, 1.22+/-0.558 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.005 s
% # Total time : 0.027 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP28468/SET664+3.tptp
%
%------------------------------------------------------------------------------