TSTP Solution File: SEU355+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU355+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.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 : Thu Dec 30 03:58:14 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP5493/SEU355+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP5493/SEU355+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5493/SEU355+1.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 5589
% 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(3, axiom,![X1]:(rel_str(X1)=>![X2]:![X3]:(element(X3,the_carrier(X1))=>(relstr_element_smaller(X1,X2,X3)<=>![X4]:(element(X4,the_carrier(X1))=>(in(X4,X2)=>related(X1,X3,X4)))))),file('/tmp/SRASS.s.p', d8_lattice3)).
% fof(4, axiom,![X1]:(rel_str(X1)=>![X2]:![X3]:(element(X3,the_carrier(X1))=>(relstr_set_smaller(X1,X2,X3)<=>![X4]:(element(X4,the_carrier(X1))=>(in(X4,X2)=>related(X1,X4,X3)))))),file('/tmp/SRASS.s.p', d9_lattice3)).
% fof(5, axiom,empty(empty_set),file('/tmp/SRASS.s.p', fc1_xboole_0)).
% fof(15, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(22, conjecture,![X1]:(rel_str(X1)=>![X2]:(element(X2,the_carrier(X1))=>(relstr_set_smaller(X1,empty_set,X2)&relstr_element_smaller(X1,empty_set,X2)))),file('/tmp/SRASS.s.p', t6_yellow_0)).
% fof(23, negated_conjecture,~(![X1]:(rel_str(X1)=>![X2]:(element(X2,the_carrier(X1))=>(relstr_set_smaller(X1,empty_set,X2)&relstr_element_smaller(X1,empty_set,X2))))),inference(assume_negation,[status(cth)],[22])).
% fof(33, plain,![X1]:(~(rel_str(X1))|![X2]:![X3]:(~(element(X3,the_carrier(X1)))|((~(relstr_element_smaller(X1,X2,X3))|![X4]:(~(element(X4,the_carrier(X1)))|(~(in(X4,X2))|related(X1,X3,X4))))&(?[X4]:(element(X4,the_carrier(X1))&(in(X4,X2)&~(related(X1,X3,X4))))|relstr_element_smaller(X1,X2,X3))))),inference(fof_nnf,[status(thm)],[3])).
% fof(34, plain,![X5]:(~(rel_str(X5))|![X6]:![X7]:(~(element(X7,the_carrier(X5)))|((~(relstr_element_smaller(X5,X6,X7))|![X8]:(~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X7,X8))))&(?[X9]:(element(X9,the_carrier(X5))&(in(X9,X6)&~(related(X5,X7,X9))))|relstr_element_smaller(X5,X6,X7))))),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X5]:(~(rel_str(X5))|![X6]:![X7]:(~(element(X7,the_carrier(X5)))|((~(relstr_element_smaller(X5,X6,X7))|![X8]:(~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X7,X8))))&((element(esk3_3(X5,X6,X7),the_carrier(X5))&(in(esk3_3(X5,X6,X7),X6)&~(related(X5,X7,esk3_3(X5,X6,X7)))))|relstr_element_smaller(X5,X6,X7))))),inference(skolemize,[status(esa)],[34])).
% fof(36, plain,![X5]:![X6]:![X7]:![X8]:(((((~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X7,X8)))|~(relstr_element_smaller(X5,X6,X7)))&((element(esk3_3(X5,X6,X7),the_carrier(X5))&(in(esk3_3(X5,X6,X7),X6)&~(related(X5,X7,esk3_3(X5,X6,X7)))))|relstr_element_smaller(X5,X6,X7)))|~(element(X7,the_carrier(X5))))|~(rel_str(X5))),inference(shift_quantors,[status(thm)],[35])).
% fof(37, plain,![X5]:![X6]:![X7]:![X8]:(((((~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X7,X8)))|~(relstr_element_smaller(X5,X6,X7)))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))&((((element(esk3_3(X5,X6,X7),the_carrier(X5))|relstr_element_smaller(X5,X6,X7))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))&((((in(esk3_3(X5,X6,X7),X6)|relstr_element_smaller(X5,X6,X7))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))&(((~(related(X5,X7,esk3_3(X5,X6,X7)))|relstr_element_smaller(X5,X6,X7))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))))),inference(distribute,[status(thm)],[36])).
% cnf(39,plain,(relstr_element_smaller(X1,X3,X2)|in(esk3_3(X1,X3,X2),X3)|~rel_str(X1)|~element(X2,the_carrier(X1))),inference(split_conjunct,[status(thm)],[37])).
% fof(42, plain,![X1]:(~(rel_str(X1))|![X2]:![X3]:(~(element(X3,the_carrier(X1)))|((~(relstr_set_smaller(X1,X2,X3))|![X4]:(~(element(X4,the_carrier(X1)))|(~(in(X4,X2))|related(X1,X4,X3))))&(?[X4]:(element(X4,the_carrier(X1))&(in(X4,X2)&~(related(X1,X4,X3))))|relstr_set_smaller(X1,X2,X3))))),inference(fof_nnf,[status(thm)],[4])).
% fof(43, plain,![X5]:(~(rel_str(X5))|![X6]:![X7]:(~(element(X7,the_carrier(X5)))|((~(relstr_set_smaller(X5,X6,X7))|![X8]:(~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X8,X7))))&(?[X9]:(element(X9,the_carrier(X5))&(in(X9,X6)&~(related(X5,X9,X7))))|relstr_set_smaller(X5,X6,X7))))),inference(variable_rename,[status(thm)],[42])).
% fof(44, plain,![X5]:(~(rel_str(X5))|![X6]:![X7]:(~(element(X7,the_carrier(X5)))|((~(relstr_set_smaller(X5,X6,X7))|![X8]:(~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X8,X7))))&((element(esk4_3(X5,X6,X7),the_carrier(X5))&(in(esk4_3(X5,X6,X7),X6)&~(related(X5,esk4_3(X5,X6,X7),X7))))|relstr_set_smaller(X5,X6,X7))))),inference(skolemize,[status(esa)],[43])).
% fof(45, plain,![X5]:![X6]:![X7]:![X8]:(((((~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X8,X7)))|~(relstr_set_smaller(X5,X6,X7)))&((element(esk4_3(X5,X6,X7),the_carrier(X5))&(in(esk4_3(X5,X6,X7),X6)&~(related(X5,esk4_3(X5,X6,X7),X7))))|relstr_set_smaller(X5,X6,X7)))|~(element(X7,the_carrier(X5))))|~(rel_str(X5))),inference(shift_quantors,[status(thm)],[44])).
% fof(46, plain,![X5]:![X6]:![X7]:![X8]:(((((~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X8,X7)))|~(relstr_set_smaller(X5,X6,X7)))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))&((((element(esk4_3(X5,X6,X7),the_carrier(X5))|relstr_set_smaller(X5,X6,X7))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))&((((in(esk4_3(X5,X6,X7),X6)|relstr_set_smaller(X5,X6,X7))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))&(((~(related(X5,esk4_3(X5,X6,X7),X7))|relstr_set_smaller(X5,X6,X7))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))))),inference(distribute,[status(thm)],[45])).
% cnf(48,plain,(relstr_set_smaller(X1,X3,X2)|in(esk4_3(X1,X3,X2),X3)|~rel_str(X1)|~element(X2,the_carrier(X1))),inference(split_conjunct,[status(thm)],[46])).
% cnf(51,plain,(empty(empty_set)),inference(split_conjunct,[status(thm)],[5])).
% fof(79, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(80, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[79])).
% cnf(81,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[80])).
% fof(93, negated_conjecture,?[X1]:(rel_str(X1)&?[X2]:(element(X2,the_carrier(X1))&(~(relstr_set_smaller(X1,empty_set,X2))|~(relstr_element_smaller(X1,empty_set,X2))))),inference(fof_nnf,[status(thm)],[23])).
% fof(94, negated_conjecture,?[X3]:(rel_str(X3)&?[X4]:(element(X4,the_carrier(X3))&(~(relstr_set_smaller(X3,empty_set,X4))|~(relstr_element_smaller(X3,empty_set,X4))))),inference(variable_rename,[status(thm)],[93])).
% fof(95, negated_conjecture,(rel_str(esk9_0)&(element(esk10_0,the_carrier(esk9_0))&(~(relstr_set_smaller(esk9_0,empty_set,esk10_0))|~(relstr_element_smaller(esk9_0,empty_set,esk10_0))))),inference(skolemize,[status(esa)],[94])).
% cnf(96,negated_conjecture,(~relstr_element_smaller(esk9_0,empty_set,esk10_0)|~relstr_set_smaller(esk9_0,empty_set,esk10_0)),inference(split_conjunct,[status(thm)],[95])).
% cnf(97,negated_conjecture,(element(esk10_0,the_carrier(esk9_0))),inference(split_conjunct,[status(thm)],[95])).
% cnf(98,negated_conjecture,(rel_str(esk9_0)),inference(split_conjunct,[status(thm)],[95])).
% cnf(105,plain,(relstr_element_smaller(X2,X1,X3)|~empty(X1)|~element(X3,the_carrier(X2))|~rel_str(X2)),inference(spm,[status(thm)],[81,39,theory(equality)])).
% cnf(108,plain,(relstr_set_smaller(X2,X1,X3)|~empty(X1)|~element(X3,the_carrier(X2))|~rel_str(X2)),inference(spm,[status(thm)],[81,48,theory(equality)])).
% cnf(116,negated_conjecture,(~relstr_element_smaller(esk9_0,empty_set,esk10_0)|~empty(empty_set)|~element(esk10_0,the_carrier(esk9_0))|~rel_str(esk9_0)),inference(spm,[status(thm)],[96,108,theory(equality)])).
% cnf(118,negated_conjecture,(~relstr_element_smaller(esk9_0,empty_set,esk10_0)|$false|~element(esk10_0,the_carrier(esk9_0))|~rel_str(esk9_0)),inference(rw,[status(thm)],[116,51,theory(equality)])).
% cnf(119,negated_conjecture,(~relstr_element_smaller(esk9_0,empty_set,esk10_0)|$false|$false|~rel_str(esk9_0)),inference(rw,[status(thm)],[118,97,theory(equality)])).
% cnf(120,negated_conjecture,(~relstr_element_smaller(esk9_0,empty_set,esk10_0)|$false|$false|$false),inference(rw,[status(thm)],[119,98,theory(equality)])).
% cnf(121,negated_conjecture,(~relstr_element_smaller(esk9_0,empty_set,esk10_0)),inference(cn,[status(thm)],[120,theory(equality)])).
% cnf(122,negated_conjecture,(~empty(empty_set)|~element(esk10_0,the_carrier(esk9_0))|~rel_str(esk9_0)),inference(spm,[status(thm)],[121,105,theory(equality)])).
% cnf(123,negated_conjecture,($false|~element(esk10_0,the_carrier(esk9_0))|~rel_str(esk9_0)),inference(rw,[status(thm)],[122,51,theory(equality)])).
% cnf(124,negated_conjecture,($false|$false|~rel_str(esk9_0)),inference(rw,[status(thm)],[123,97,theory(equality)])).
% cnf(125,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[124,98,theory(equality)])).
% cnf(126,negated_conjecture,($false),inference(cn,[status(thm)],[125,theory(equality)])).
% cnf(127,negated_conjecture,($false),126,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 33
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 32
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 19
% # ...of the previous two non-trivial : 16
% # Contextual simplify-reflections : 0
% # Paramodulations : 19
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 31
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 20
% # Current number of unprocessed clauses: 9
% # ...number of literals in the above : 42
% # Clause-clause subsumption calls (NU) : 8
% # Rec. Clause-clause subsumption calls : 8
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 40 leaves, 1.23+/-0.570 terms/leaf
% # Paramod-from index: 17 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 36 leaves, 1.11+/-0.314 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.004 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP5493/SEU355+1.tptp
%
%------------------------------------------------------------------------------