TSTP Solution File: SET653+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET653+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:22:15 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP28206/SET653+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28206/SET653+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28206/SET653+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 28302
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,set_type)=>((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3))))),file('/tmp/SRASS.s.p', p1)).
% fof(4, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,set_type)=>![X4]:(ilf_type(X4,relation_type(X1,X3))=>(subset(domain_of(X4),X2)=>ilf_type(X4,relation_type(X2,X3))))))),file('/tmp/SRASS.s.p', p3)).
% fof(8, 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', p2)).
% fof(22, axiom,![X1]:ilf_type(X1,set_type),file('/tmp/SRASS.s.p', p22)).
% fof(23, conjecture,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,set_type)=>![X4]:(ilf_type(X4,relation_type(X1,X3))=>(subset(X1,X2)=>ilf_type(X4,relation_type(X2,X3))))))),file('/tmp/SRASS.s.p', prove_relset_1_15)).
% fof(24, negated_conjecture,~(![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,set_type)=>![X4]:(ilf_type(X4,relation_type(X1,X3))=>(subset(X1,X2)=>ilf_type(X4,relation_type(X2,X3)))))))),inference(assume_negation,[status(cth)],[23])).
% fof(29, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|![X3]:(~(ilf_type(X3,set_type))|((~(subset(X1,X2))|~(subset(X2,X3)))|subset(X1,X3))))),inference(fof_nnf,[status(thm)],[1])).
% fof(30, plain,![X4]:(~(ilf_type(X4,set_type))|![X5]:(~(ilf_type(X5,set_type))|![X6]:(~(ilf_type(X6,set_type))|((~(subset(X4,X5))|~(subset(X5,X6)))|subset(X4,X6))))),inference(variable_rename,[status(thm)],[29])).
% fof(31, plain,![X4]:![X5]:![X6]:(((~(ilf_type(X6,set_type))|((~(subset(X4,X5))|~(subset(X5,X6)))|subset(X4,X6)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type))),inference(shift_quantors,[status(thm)],[30])).
% cnf(32,plain,(subset(X1,X3)|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~subset(X2,X3)|~subset(X1,X2)|~ilf_type(X3,set_type)),inference(split_conjunct,[status(thm)],[31])).
% fof(41, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|![X3]:(~(ilf_type(X3,set_type))|![X4]:(~(ilf_type(X4,relation_type(X1,X3)))|(~(subset(domain_of(X4),X2))|ilf_type(X4,relation_type(X2,X3))))))),inference(fof_nnf,[status(thm)],[4])).
% fof(42, plain,![X5]:(~(ilf_type(X5,set_type))|![X6]:(~(ilf_type(X6,set_type))|![X7]:(~(ilf_type(X7,set_type))|![X8]:(~(ilf_type(X8,relation_type(X5,X7)))|(~(subset(domain_of(X8),X6))|ilf_type(X8,relation_type(X6,X7))))))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X5]:![X6]:![X7]:![X8]:((((~(ilf_type(X8,relation_type(X5,X7)))|(~(subset(domain_of(X8),X6))|ilf_type(X8,relation_type(X6,X7))))|~(ilf_type(X7,set_type)))|~(ilf_type(X6,set_type)))|~(ilf_type(X5,set_type))),inference(shift_quantors,[status(thm)],[42])).
% cnf(44,plain,(ilf_type(X4,relation_type(X2,X3))|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~ilf_type(X3,set_type)|~subset(domain_of(X4),X2)|~ilf_type(X4,relation_type(X1,X3))),inference(split_conjunct,[status(thm)],[43])).
% fof(62, 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)],[8])).
% fof(63, 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)],[62])).
% fof(64, 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)],[63])).
% fof(65, 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)],[64])).
% cnf(67,plain,(subset(domain_of(X3),X1)|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~ilf_type(X3,relation_type(X1,X2))),inference(split_conjunct,[status(thm)],[65])).
% fof(140, plain,![X2]:ilf_type(X2,set_type),inference(variable_rename,[status(thm)],[22])).
% cnf(141,plain,(ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[140])).
% fof(142, negated_conjecture,?[X1]:(ilf_type(X1,set_type)&?[X2]:(ilf_type(X2,set_type)&?[X3]:(ilf_type(X3,set_type)&?[X4]:(ilf_type(X4,relation_type(X1,X3))&(subset(X1,X2)&~(ilf_type(X4,relation_type(X2,X3)))))))),inference(fof_nnf,[status(thm)],[24])).
% fof(143, negated_conjecture,?[X5]:(ilf_type(X5,set_type)&?[X6]:(ilf_type(X6,set_type)&?[X7]:(ilf_type(X7,set_type)&?[X8]:(ilf_type(X8,relation_type(X5,X7))&(subset(X5,X6)&~(ilf_type(X8,relation_type(X6,X7)))))))),inference(variable_rename,[status(thm)],[142])).
% fof(144, negated_conjecture,(ilf_type(esk10_0,set_type)&(ilf_type(esk11_0,set_type)&(ilf_type(esk12_0,set_type)&(ilf_type(esk13_0,relation_type(esk10_0,esk12_0))&(subset(esk10_0,esk11_0)&~(ilf_type(esk13_0,relation_type(esk11_0,esk12_0)))))))),inference(skolemize,[status(esa)],[143])).
% cnf(145,negated_conjecture,(~ilf_type(esk13_0,relation_type(esk11_0,esk12_0))),inference(split_conjunct,[status(thm)],[144])).
% cnf(146,negated_conjecture,(subset(esk10_0,esk11_0)),inference(split_conjunct,[status(thm)],[144])).
% cnf(147,negated_conjecture,(ilf_type(esk13_0,relation_type(esk10_0,esk12_0))),inference(split_conjunct,[status(thm)],[144])).
% cnf(197,plain,(subset(domain_of(X3),X1)|$false|~ilf_type(X1,set_type)|~ilf_type(X3,relation_type(X1,X2))),inference(rw,[status(thm)],[67,141,theory(equality)])).
% cnf(198,plain,(subset(domain_of(X3),X1)|$false|$false|~ilf_type(X3,relation_type(X1,X2))),inference(rw,[status(thm)],[197,141,theory(equality)])).
% cnf(199,plain,(subset(domain_of(X3),X1)|~ilf_type(X3,relation_type(X1,X2))),inference(cn,[status(thm)],[198,theory(equality)])).
% cnf(203,plain,(subset(X1,X3)|~subset(X2,X3)|~subset(X1,X2)|$false|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)),inference(rw,[status(thm)],[32,141,theory(equality)])).
% cnf(204,plain,(subset(X1,X3)|~subset(X2,X3)|~subset(X1,X2)|$false|$false|~ilf_type(X1,set_type)),inference(rw,[status(thm)],[203,141,theory(equality)])).
% cnf(205,plain,(subset(X1,X3)|~subset(X2,X3)|~subset(X1,X2)|$false|$false|$false),inference(rw,[status(thm)],[204,141,theory(equality)])).
% cnf(206,plain,(subset(X1,X3)|~subset(X2,X3)|~subset(X1,X2)),inference(cn,[status(thm)],[205,theory(equality)])).
% cnf(268,plain,(ilf_type(X4,relation_type(X2,X3))|$false|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~subset(domain_of(X4),X2)|~ilf_type(X4,relation_type(X1,X3))),inference(rw,[status(thm)],[44,141,theory(equality)])).
% cnf(269,plain,(ilf_type(X4,relation_type(X2,X3))|$false|$false|~ilf_type(X1,set_type)|~subset(domain_of(X4),X2)|~ilf_type(X4,relation_type(X1,X3))),inference(rw,[status(thm)],[268,141,theory(equality)])).
% cnf(270,plain,(ilf_type(X4,relation_type(X2,X3))|$false|$false|$false|~subset(domain_of(X4),X2)|~ilf_type(X4,relation_type(X1,X3))),inference(rw,[status(thm)],[269,141,theory(equality)])).
% cnf(271,plain,(ilf_type(X4,relation_type(X2,X3))|~subset(domain_of(X4),X2)|~ilf_type(X4,relation_type(X1,X3))),inference(cn,[status(thm)],[270,theory(equality)])).
% cnf(272,negated_conjecture,(subset(X1,esk11_0)|~subset(X1,esk10_0)),inference(spm,[status(thm)],[206,146,theory(equality)])).
% cnf(279,negated_conjecture,(subset(domain_of(esk13_0),esk10_0)),inference(spm,[status(thm)],[199,147,theory(equality)])).
% cnf(304,negated_conjecture,(ilf_type(esk13_0,relation_type(X1,esk12_0))|~subset(domain_of(esk13_0),X1)),inference(spm,[status(thm)],[271,147,theory(equality)])).
% cnf(469,negated_conjecture,(ilf_type(esk13_0,relation_type(esk11_0,esk12_0))|~subset(domain_of(esk13_0),esk10_0)),inference(spm,[status(thm)],[304,272,theory(equality)])).
% cnf(474,negated_conjecture,(ilf_type(esk13_0,relation_type(esk11_0,esk12_0))|$false),inference(rw,[status(thm)],[469,279,theory(equality)])).
% cnf(475,negated_conjecture,(ilf_type(esk13_0,relation_type(esk11_0,esk12_0))),inference(cn,[status(thm)],[474,theory(equality)])).
% cnf(476,negated_conjecture,($false),inference(sr,[status(thm)],[475,145,theory(equality)])).
% cnf(477,negated_conjecture,($false),476,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 146
% # ...of these trivial : 11
% # ...subsumed : 13
% # ...remaining for further processing: 122
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 189
% # ...of the previous two non-trivial : 167
% # Contextual simplify-reflections : 1
% # Paramodulations : 189
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 87
% # Positive orientable unit clauses: 42
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 42
% # Current number of unprocessed clauses: 99
% # ...number of literals in the above : 198
% # Clause-clause subsumption calls (NU) : 34
% # Rec. Clause-clause subsumption calls : 34
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 127 leaves, 1.24+/-0.704 terms/leaf
% # Paramod-from index: 57 leaves, 1.04+/-0.184 terms/leaf
% # Paramod-into index: 121 leaves, 1.21+/-0.655 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.007 s
% # Total time : 0.029 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/SystemOnTPTP28206/SET653+3.tptp
%
%------------------------------------------------------------------------------