TSTP Solution File: SWB029+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWB029+2 : TPTP v5.2.0. Released v5.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 Feb 16 04:03:10 EST 2011
% Result : Theorem 0.62s
% Output : Solution 0.62s
% 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/SystemOnTPTP31212/SWB029+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31212/SWB029+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31212/SWB029+2.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 31300
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:(iext(uri_rdf_type,X1,X2)<=>icext(X2,X1)),file('/tmp/SRASS.s.p', rdfs_cext_def)).
% fof(2, axiom,![X3]:![X4]:![X5]:![X6]:![X7]:((((iext(uri_rdf_first,X4,X5)&iext(uri_rdf_rest,X4,X6))&iext(uri_rdf_first,X6,X7))&iext(uri_rdf_rest,X6,uri_rdf_nil))=>(iext(uri_owl_intersectionOf,X3,X4)<=>(((ic(X3)&ic(X5))&ic(X7))&![X1]:(icext(X3,X1)<=>(icext(X5,X1)&icext(X7,X1)))))),file('/tmp/SRASS.s.p', owl_bool_intersectionof_class_002)).
% fof(3, axiom,?[X8]:?[X9]:?[X10]:?[X11]:((((((((iext(uri_rdf_type,uri_ex_A,uri_owl_Class)&iext(uri_rdf_type,uri_ex_B,uri_owl_Class))&iext(uri_rdf_type,uri_ex_w,X8))&iext(uri_owl_intersectionOf,X8,X10))&iext(uri_rdf_first,X10,uri_ex_A))&iext(uri_rdf_rest,X10,X11))&iext(uri_rdf_first,X11,X9))&iext(uri_rdf_rest,X11,uri_rdf_nil))&iext(uri_owl_complementOf,X9,uri_ex_A)),file('/tmp/SRASS.s.p', testcase_premise_fullish_029_Ex_Falso_Quodlibet)).
% fof(4, axiom,![X3]:![X2]:(iext(uri_owl_complementOf,X3,X2)=>((ic(X3)&ic(X2))&![X1]:(icext(X3,X1)<=>~(icext(X2,X1))))),file('/tmp/SRASS.s.p', owl_bool_complementof_class)).
% fof(7, plain,![X3]:![X2]:(iext(uri_owl_complementOf,X3,X2)=>((ic(X3)&ic(X2))&![X1]:(icext(X3,X1)<=>~(icext(X2,X1))))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(9, plain,![X1]:![X2]:((~(iext(uri_rdf_type,X1,X2))|icext(X2,X1))&(~(icext(X2,X1))|iext(uri_rdf_type,X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(10, plain,![X3]:![X4]:((~(iext(uri_rdf_type,X3,X4))|icext(X4,X3))&(~(icext(X4,X3))|iext(uri_rdf_type,X3,X4))),inference(variable_rename,[status(thm)],[9])).
% cnf(12,plain,(icext(X1,X2)|~iext(uri_rdf_type,X2,X1)),inference(split_conjunct,[status(thm)],[10])).
% fof(13, plain,![X3]:![X4]:![X5]:![X6]:![X7]:((((~(iext(uri_rdf_first,X4,X5))|~(iext(uri_rdf_rest,X4,X6)))|~(iext(uri_rdf_first,X6,X7)))|~(iext(uri_rdf_rest,X6,uri_rdf_nil)))|((~(iext(uri_owl_intersectionOf,X3,X4))|(((ic(X3)&ic(X5))&ic(X7))&![X1]:((~(icext(X3,X1))|(icext(X5,X1)&icext(X7,X1)))&((~(icext(X5,X1))|~(icext(X7,X1)))|icext(X3,X1)))))&((((~(ic(X3))|~(ic(X5)))|~(ic(X7)))|?[X1]:((~(icext(X3,X1))|(~(icext(X5,X1))|~(icext(X7,X1))))&(icext(X3,X1)|(icext(X5,X1)&icext(X7,X1)))))|iext(uri_owl_intersectionOf,X3,X4)))),inference(fof_nnf,[status(thm)],[2])).
% fof(14, plain,![X8]:![X9]:![X10]:![X11]:![X12]:((((~(iext(uri_rdf_first,X9,X10))|~(iext(uri_rdf_rest,X9,X11)))|~(iext(uri_rdf_first,X11,X12)))|~(iext(uri_rdf_rest,X11,uri_rdf_nil)))|((~(iext(uri_owl_intersectionOf,X8,X9))|(((ic(X8)&ic(X10))&ic(X12))&![X13]:((~(icext(X8,X13))|(icext(X10,X13)&icext(X12,X13)))&((~(icext(X10,X13))|~(icext(X12,X13)))|icext(X8,X13)))))&((((~(ic(X8))|~(ic(X10)))|~(ic(X12)))|?[X14]:((~(icext(X8,X14))|(~(icext(X10,X14))|~(icext(X12,X14))))&(icext(X8,X14)|(icext(X10,X14)&icext(X12,X14)))))|iext(uri_owl_intersectionOf,X8,X9)))),inference(variable_rename,[status(thm)],[13])).
% fof(15, plain,![X8]:![X9]:![X10]:![X11]:![X12]:((((~(iext(uri_rdf_first,X9,X10))|~(iext(uri_rdf_rest,X9,X11)))|~(iext(uri_rdf_first,X11,X12)))|~(iext(uri_rdf_rest,X11,uri_rdf_nil)))|((~(iext(uri_owl_intersectionOf,X8,X9))|(((ic(X8)&ic(X10))&ic(X12))&![X13]:((~(icext(X8,X13))|(icext(X10,X13)&icext(X12,X13)))&((~(icext(X10,X13))|~(icext(X12,X13)))|icext(X8,X13)))))&((((~(ic(X8))|~(ic(X10)))|~(ic(X12)))|((~(icext(X8,esk1_5(X8,X9,X10,X11,X12)))|(~(icext(X10,esk1_5(X8,X9,X10,X11,X12)))|~(icext(X12,esk1_5(X8,X9,X10,X11,X12)))))&(icext(X8,esk1_5(X8,X9,X10,X11,X12))|(icext(X10,esk1_5(X8,X9,X10,X11,X12))&icext(X12,esk1_5(X8,X9,X10,X11,X12))))))|iext(uri_owl_intersectionOf,X8,X9)))),inference(skolemize,[status(esa)],[14])).
% fof(16, plain,![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:((((((~(icext(X8,X13))|(icext(X10,X13)&icext(X12,X13)))&((~(icext(X10,X13))|~(icext(X12,X13)))|icext(X8,X13)))&((ic(X8)&ic(X10))&ic(X12)))|~(iext(uri_owl_intersectionOf,X8,X9)))&((((~(ic(X8))|~(ic(X10)))|~(ic(X12)))|((~(icext(X8,esk1_5(X8,X9,X10,X11,X12)))|(~(icext(X10,esk1_5(X8,X9,X10,X11,X12)))|~(icext(X12,esk1_5(X8,X9,X10,X11,X12)))))&(icext(X8,esk1_5(X8,X9,X10,X11,X12))|(icext(X10,esk1_5(X8,X9,X10,X11,X12))&icext(X12,esk1_5(X8,X9,X10,X11,X12))))))|iext(uri_owl_intersectionOf,X8,X9)))|(((~(iext(uri_rdf_first,X9,X10))|~(iext(uri_rdf_rest,X9,X11)))|~(iext(uri_rdf_first,X11,X12)))|~(iext(uri_rdf_rest,X11,uri_rdf_nil)))),inference(shift_quantors,[status(thm)],[15])).
% fof(17, plain,![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:(((((((icext(X10,X13)|~(icext(X8,X13)))|~(iext(uri_owl_intersectionOf,X8,X9)))|(((~(iext(uri_rdf_first,X9,X10))|~(iext(uri_rdf_rest,X9,X11)))|~(iext(uri_rdf_first,X11,X12)))|~(iext(uri_rdf_rest,X11,uri_rdf_nil))))&(((icext(X12,X13)|~(icext(X8,X13)))|~(iext(uri_owl_intersectionOf,X8,X9)))|(((~(iext(uri_rdf_first,X9,X10))|~(iext(uri_rdf_rest,X9,X11)))|~(iext(uri_rdf_first,X11,X12)))|~(iext(uri_rdf_rest,X11,uri_rdf_nil)))))&((((~(icext(X10,X13))|~(icext(X12,X13)))|icext(X8,X13))|~(iext(uri_owl_intersectionOf,X8,X9)))|(((~(iext(uri_rdf_first,X9,X10))|~(iext(uri_rdf_rest,X9,X11)))|~(iext(uri_rdf_first,X11,X12)))|~(iext(uri_rdf_rest,X11,uri_rdf_nil)))))&((((ic(X8)|~(iext(uri_owl_intersectionOf,X8,X9)))|(((~(iext(uri_rdf_first,X9,X10))|~(iext(uri_rdf_rest,X9,X11)))|~(iext(uri_rdf_first,X11,X12)))|~(iext(uri_rdf_rest,X11,uri_rdf_nil))))&((ic(X10)|~(iext(uri_owl_intersectionOf,X8,X9)))|(((~(iext(uri_rdf_first,X9,X10))|~(iext(uri_rdf_rest,X9,X11)))|~(iext(uri_rdf_first,X11,X12)))|~(iext(uri_rdf_rest,X11,uri_rdf_nil)))))&((ic(X12)|~(iext(uri_owl_intersectionOf,X8,X9)))|(((~(iext(uri_rdf_first,X9,X10))|~(iext(uri_rdf_rest,X9,X11)))|~(iext(uri_rdf_first,X11,X12)))|~(iext(uri_rdf_rest,X11,uri_rdf_nil))))))&(((((~(icext(X8,esk1_5(X8,X9,X10,X11,X12)))|(~(icext(X10,esk1_5(X8,X9,X10,X11,X12)))|~(icext(X12,esk1_5(X8,X9,X10,X11,X12)))))|((~(ic(X8))|~(ic(X10)))|~(ic(X12))))|iext(uri_owl_intersectionOf,X8,X9))|(((~(iext(uri_rdf_first,X9,X10))|~(iext(uri_rdf_rest,X9,X11)))|~(iext(uri_rdf_first,X11,X12)))|~(iext(uri_rdf_rest,X11,uri_rdf_nil))))&(((((icext(X10,esk1_5(X8,X9,X10,X11,X12))|icext(X8,esk1_5(X8,X9,X10,X11,X12)))|((~(ic(X8))|~(ic(X10)))|~(ic(X12))))|iext(uri_owl_intersectionOf,X8,X9))|(((~(iext(uri_rdf_first,X9,X10))|~(iext(uri_rdf_rest,X9,X11)))|~(iext(uri_rdf_first,X11,X12)))|~(iext(uri_rdf_rest,X11,uri_rdf_nil))))&((((icext(X12,esk1_5(X8,X9,X10,X11,X12))|icext(X8,esk1_5(X8,X9,X10,X11,X12)))|((~(ic(X8))|~(ic(X10)))|~(ic(X12))))|iext(uri_owl_intersectionOf,X8,X9))|(((~(iext(uri_rdf_first,X9,X10))|~(iext(uri_rdf_rest,X9,X11)))|~(iext(uri_rdf_first,X11,X12)))|~(iext(uri_rdf_rest,X11,uri_rdf_nil))))))),inference(distribute,[status(thm)],[16])).
% cnf(25,plain,(icext(X2,X6)|~iext(uri_rdf_rest,X1,uri_rdf_nil)|~iext(uri_rdf_first,X1,X2)|~iext(uri_rdf_rest,X3,X1)|~iext(uri_rdf_first,X3,X4)|~iext(uri_owl_intersectionOf,X5,X3)|~icext(X5,X6)),inference(split_conjunct,[status(thm)],[17])).
% cnf(26,plain,(icext(X4,X6)|~iext(uri_rdf_rest,X1,uri_rdf_nil)|~iext(uri_rdf_first,X1,X2)|~iext(uri_rdf_rest,X3,X1)|~iext(uri_rdf_first,X3,X4)|~iext(uri_owl_intersectionOf,X5,X3)|~icext(X5,X6)),inference(split_conjunct,[status(thm)],[17])).
% fof(27, plain,?[X12]:?[X13]:?[X14]:?[X15]:((((((((iext(uri_rdf_type,uri_ex_A,uri_owl_Class)&iext(uri_rdf_type,uri_ex_B,uri_owl_Class))&iext(uri_rdf_type,uri_ex_w,X12))&iext(uri_owl_intersectionOf,X12,X14))&iext(uri_rdf_first,X14,uri_ex_A))&iext(uri_rdf_rest,X14,X15))&iext(uri_rdf_first,X15,X13))&iext(uri_rdf_rest,X15,uri_rdf_nil))&iext(uri_owl_complementOf,X13,uri_ex_A)),inference(variable_rename,[status(thm)],[3])).
% fof(28, plain,((((((((iext(uri_rdf_type,uri_ex_A,uri_owl_Class)&iext(uri_rdf_type,uri_ex_B,uri_owl_Class))&iext(uri_rdf_type,uri_ex_w,esk2_0))&iext(uri_owl_intersectionOf,esk2_0,esk4_0))&iext(uri_rdf_first,esk4_0,uri_ex_A))&iext(uri_rdf_rest,esk4_0,esk5_0))&iext(uri_rdf_first,esk5_0,esk3_0))&iext(uri_rdf_rest,esk5_0,uri_rdf_nil))&iext(uri_owl_complementOf,esk3_0,uri_ex_A)),inference(skolemize,[status(esa)],[27])).
% cnf(29,plain,(iext(uri_owl_complementOf,esk3_0,uri_ex_A)),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,plain,(iext(uri_rdf_rest,esk5_0,uri_rdf_nil)),inference(split_conjunct,[status(thm)],[28])).
% cnf(31,plain,(iext(uri_rdf_first,esk5_0,esk3_0)),inference(split_conjunct,[status(thm)],[28])).
% cnf(32,plain,(iext(uri_rdf_rest,esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[28])).
% cnf(33,plain,(iext(uri_rdf_first,esk4_0,uri_ex_A)),inference(split_conjunct,[status(thm)],[28])).
% cnf(34,plain,(iext(uri_owl_intersectionOf,esk2_0,esk4_0)),inference(split_conjunct,[status(thm)],[28])).
% cnf(35,plain,(iext(uri_rdf_type,uri_ex_w,esk2_0)),inference(split_conjunct,[status(thm)],[28])).
% fof(38, plain,![X3]:![X2]:(~(iext(uri_owl_complementOf,X3,X2))|((ic(X3)&ic(X2))&![X1]:((~(icext(X3,X1))|~(icext(X2,X1)))&(icext(X2,X1)|icext(X3,X1))))),inference(fof_nnf,[status(thm)],[7])).
% fof(39, plain,![X4]:![X5]:(~(iext(uri_owl_complementOf,X4,X5))|((ic(X4)&ic(X5))&![X6]:((~(icext(X4,X6))|~(icext(X5,X6)))&(icext(X5,X6)|icext(X4,X6))))),inference(variable_rename,[status(thm)],[38])).
% fof(40, plain,![X4]:![X5]:![X6]:((((~(icext(X4,X6))|~(icext(X5,X6)))&(icext(X5,X6)|icext(X4,X6)))&(ic(X4)&ic(X5)))|~(iext(uri_owl_complementOf,X4,X5))),inference(shift_quantors,[status(thm)],[39])).
% fof(41, plain,![X4]:![X5]:![X6]:((((~(icext(X4,X6))|~(icext(X5,X6)))|~(iext(uri_owl_complementOf,X4,X5)))&((icext(X5,X6)|icext(X4,X6))|~(iext(uri_owl_complementOf,X4,X5))))&((ic(X4)|~(iext(uri_owl_complementOf,X4,X5)))&(ic(X5)|~(iext(uri_owl_complementOf,X4,X5))))),inference(distribute,[status(thm)],[40])).
% cnf(45,plain,(~iext(uri_owl_complementOf,X1,X2)|~icext(X2,X3)|~icext(X1,X3)),inference(split_conjunct,[status(thm)],[41])).
% cnf(48,plain,(icext(esk2_0,uri_ex_w)),inference(spm,[status(thm)],[12,35,theory(equality)])).
% cnf(58,plain,(~icext(uri_ex_A,X1)|~icext(esk3_0,X1)),inference(spm,[status(thm)],[45,29,theory(equality)])).
% cnf(59,plain,(icext(X1,X2)|~icext(X3,X2)|~iext(uri_rdf_first,X4,X1)|~iext(uri_rdf_first,esk5_0,X5)|~iext(uri_rdf_rest,X4,esk5_0)|~iext(uri_owl_intersectionOf,X3,X4)),inference(spm,[status(thm)],[26,30,theory(equality)])).
% cnf(60,plain,(icext(X1,X2)|~icext(X3,X2)|~iext(uri_rdf_first,X4,X5)|~iext(uri_rdf_first,esk5_0,X1)|~iext(uri_rdf_rest,X4,esk5_0)|~iext(uri_owl_intersectionOf,X3,X4)),inference(spm,[status(thm)],[25,30,theory(equality)])).
% cnf(83,plain,(icext(X1,X2)|~icext(X3,X2)|~iext(uri_rdf_rest,X4,esk5_0)|~iext(uri_rdf_first,X4,X1)|~iext(uri_owl_intersectionOf,X3,X4)),inference(spm,[status(thm)],[59,31,theory(equality)])).
% cnf(85,plain,(icext(uri_ex_A,X1)|~icext(X2,X1)|~iext(uri_rdf_rest,esk4_0,esk5_0)|~iext(uri_owl_intersectionOf,X2,esk4_0)),inference(spm,[status(thm)],[83,33,theory(equality)])).
% cnf(86,plain,(icext(uri_ex_A,X1)|~icext(X2,X1)|$false|~iext(uri_owl_intersectionOf,X2,esk4_0)),inference(rw,[status(thm)],[85,32,theory(equality)])).
% cnf(87,plain,(icext(uri_ex_A,X1)|~icext(X2,X1)|~iext(uri_owl_intersectionOf,X2,esk4_0)),inference(cn,[status(thm)],[86,theory(equality)])).
% cnf(88,plain,(icext(uri_ex_A,X1)|~icext(esk2_0,X1)),inference(spm,[status(thm)],[87,34,theory(equality)])).
% cnf(90,plain,(icext(esk3_0,X1)|~icext(X2,X1)|~iext(uri_rdf_rest,X3,esk5_0)|~iext(uri_rdf_first,X3,X4)|~iext(uri_owl_intersectionOf,X2,X3)),inference(spm,[status(thm)],[60,31,theory(equality)])).
% cnf(92,plain,(icext(esk3_0,X1)|~icext(X2,X1)|~iext(uri_rdf_rest,esk4_0,esk5_0)|~iext(uri_owl_intersectionOf,X2,esk4_0)),inference(spm,[status(thm)],[90,33,theory(equality)])).
% cnf(93,plain,(icext(esk3_0,X1)|~icext(X2,X1)|$false|~iext(uri_owl_intersectionOf,X2,esk4_0)),inference(rw,[status(thm)],[92,32,theory(equality)])).
% cnf(94,plain,(icext(esk3_0,X1)|~icext(X2,X1)|~iext(uri_owl_intersectionOf,X2,esk4_0)),inference(cn,[status(thm)],[93,theory(equality)])).
% cnf(95,plain,(icext(esk3_0,X1)|~icext(esk2_0,X1)),inference(spm,[status(thm)],[94,34,theory(equality)])).
% cnf(97,plain,(~icext(uri_ex_A,X1)|~icext(esk2_0,X1)),inference(spm,[status(thm)],[58,95,theory(equality)])).
% cnf(105,plain,(~icext(esk2_0,X1)),inference(csr,[status(thm)],[97,88])).
% cnf(106,plain,($false),inference(sr,[status(thm)],[48,105,theory(equality)])).
% cnf(107,plain,($false),106,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 80
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 79
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 0
% # Generated clauses : 42
% # ...of the previous two non-trivial : 36
% # Contextual simplify-reflections : 1
% # Paramodulations : 41
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 50
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 32
% # Current number of unprocessed clauses: 6
% # ...number of literals in the above : 46
% # Clause-clause subsumption calls (NU) : 140
% # Rec. Clause-clause subsumption calls : 75
% # Unit Clause-clause subsumption calls : 18
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 43 leaves, 2.37+/-3.369 terms/leaf
% # Paramod-from index: 17 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 39 leaves, 1.38+/-0.923 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.005 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.18 WC
% FINAL PrfWatch: 0.12 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP31212/SWB029+2.tptp
%
%------------------------------------------------------------------------------