%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU373+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 : art06.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 04:15:29 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP9099/SEU373+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9099/SEU373+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9099/SEU373+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 9195
% 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(1, axiom,![X1]:![X2]:((one_sorted_str(X1)&net_str(X2,X1))=>![X3]:(subnetstr(X3,X1,X2)=>net_str(X3,X1))),file('/tmp/SRASS.s.p', dt_m1_yellow_6)).
% fof(6, axiom,![X1]:(one_sorted_str(X1)=>![X2]:(net_str(X2,X1)=>rel_str(X2))),file('/tmp/SRASS.s.p', dt_l1_waybel_0)).
% fof(11, axiom,![X1]:(one_sorted_str(X1)=>![X2]:(net_str(X2,X1)=>![X3]:(net_str(X3,X1)=>(subnetstr(X3,X1,X2)<=>(subrelstr(X3,X2)&the_mapping(X1,X3)=relation_dom_restr_as_relation_of(the_carrier(X2),the_carrier(X1),the_mapping(X1,X2),the_carrier(X3))))))),file('/tmp/SRASS.s.p', d8_yellow_6)).
% fof(13, axiom,![X1]:(rel_str(X1)=>![X2]:(rel_str(X2)=>(subrelstr(X2,X1)<=>(subset(the_carrier(X2),the_carrier(X1))&subset(the_InternalRel(X2),the_InternalRel(X1)))))),file('/tmp/SRASS.s.p', d13_yellow_0)).
% fof(24, axiom,![X1]:(rel_str(X1)=>![X2]:(subrelstr(X2,X1)=>rel_str(X2))),file('/tmp/SRASS.s.p', dt_m1_yellow_0)).
% fof(59, conjecture,![X1]:(one_sorted_str(X1)=>![X2]:(net_str(X2,X1)=>![X3]:(subnetstr(X3,X1,X2)=>subset(the_carrier(X3),the_carrier(X2))))),file('/tmp/SRASS.s.p', t19_yellow_6)).
% fof(60, negated_conjecture,~(![X1]:(one_sorted_str(X1)=>![X2]:(net_str(X2,X1)=>![X3]:(subnetstr(X3,X1,X2)=>subset(the_carrier(X3),the_carrier(X2)))))),inference(assume_negation,[status(cth)],[59])).
% fof(66, plain,![X1]:![X2]:((~(one_sorted_str(X1))|~(net_str(X2,X1)))|![X3]:(~(subnetstr(X3,X1,X2))|net_str(X3,X1))),inference(fof_nnf,[status(thm)],[1])).
% fof(67, plain,![X4]:![X5]:((~(one_sorted_str(X4))|~(net_str(X5,X4)))|![X6]:(~(subnetstr(X6,X4,X5))|net_str(X6,X4))),inference(variable_rename,[status(thm)],[66])).
% fof(68, plain,![X4]:![X5]:![X6]:((~(subnetstr(X6,X4,X5))|net_str(X6,X4))|(~(one_sorted_str(X4))|~(net_str(X5,X4)))),inference(shift_quantors,[status(thm)],[67])).
% cnf(69,plain,(net_str(X3,X2)|~net_str(X1,X2)|~one_sorted_str(X2)|~subnetstr(X3,X2,X1)),inference(split_conjunct,[status(thm)],[68])).
% fof(83, plain,![X1]:(~(one_sorted_str(X1))|![X2]:(~(net_str(X2,X1))|rel_str(X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(84, plain,![X3]:(~(one_sorted_str(X3))|![X4]:(~(net_str(X4,X3))|rel_str(X4))),inference(variable_rename,[status(thm)],[83])).
% fof(85, plain,![X3]:![X4]:((~(net_str(X4,X3))|rel_str(X4))|~(one_sorted_str(X3))),inference(shift_quantors,[status(thm)],[84])).
% cnf(86,plain,(rel_str(X2)|~one_sorted_str(X1)|~net_str(X2,X1)),inference(split_conjunct,[status(thm)],[85])).
% fof(99, plain,![X1]:(~(one_sorted_str(X1))|![X2]:(~(net_str(X2,X1))|![X3]:(~(net_str(X3,X1))|((~(subnetstr(X3,X1,X2))|(subrelstr(X3,X2)&the_mapping(X1,X3)=relation_dom_restr_as_relation_of(the_carrier(X2),the_carrier(X1),the_mapping(X1,X2),the_carrier(X3))))&((~(subrelstr(X3,X2))|~(the_mapping(X1,X3)=relation_dom_restr_as_relation_of(the_carrier(X2),the_carrier(X1),the_mapping(X1,X2),the_carrier(X3))))|subnetstr(X3,X1,X2)))))),inference(fof_nnf,[status(thm)],[11])).
% fof(100, plain,![X4]:(~(one_sorted_str(X4))|![X5]:(~(net_str(X5,X4))|![X6]:(~(net_str(X6,X4))|((~(subnetstr(X6,X4,X5))|(subrelstr(X6,X5)&the_mapping(X4,X6)=relation_dom_restr_as_relation_of(the_carrier(X5),the_carrier(X4),the_mapping(X4,X5),the_carrier(X6))))&((~(subrelstr(X6,X5))|~(the_mapping(X4,X6)=relation_dom_restr_as_relation_of(the_carrier(X5),the_carrier(X4),the_mapping(X4,X5),the_carrier(X6))))|subnetstr(X6,X4,X5)))))),inference(variable_rename,[status(thm)],[99])).
% fof(101, plain,![X4]:![X5]:![X6]:(((~(net_str(X6,X4))|((~(subnetstr(X6,X4,X5))|(subrelstr(X6,X5)&the_mapping(X4,X6)=relation_dom_restr_as_relation_of(the_carrier(X5),the_carrier(X4),the_mapping(X4,X5),the_carrier(X6))))&((~(subrelstr(X6,X5))|~(the_mapping(X4,X6)=relation_dom_restr_as_relation_of(the_carrier(X5),the_carrier(X4),the_mapping(X4,X5),the_carrier(X6))))|subnetstr(X6,X4,X5))))|~(net_str(X5,X4)))|~(one_sorted_str(X4))),inference(shift_quantors,[status(thm)],[100])).
% fof(102, plain,![X4]:![X5]:![X6]:((((((subrelstr(X6,X5)|~(subnetstr(X6,X4,X5)))|~(net_str(X6,X4)))|~(net_str(X5,X4)))|~(one_sorted_str(X4)))&((((the_mapping(X4,X6)=relation_dom_restr_as_relation_of(the_carrier(X5),the_carrier(X4),the_mapping(X4,X5),the_carrier(X6))|~(subnetstr(X6,X4,X5)))|~(net_str(X6,X4)))|~(net_str(X5,X4)))|~(one_sorted_str(X4))))&(((((~(subrelstr(X6,X5))|~(the_mapping(X4,X6)=relation_dom_restr_as_relation_of(the_carrier(X5),the_carrier(X4),the_mapping(X4,X5),the_carrier(X6))))|subnetstr(X6,X4,X5))|~(net_str(X6,X4)))|~(net_str(X5,X4)))|~(one_sorted_str(X4)))),inference(distribute,[status(thm)],[101])).
% cnf(105,plain,(subrelstr(X3,X2)|~one_sorted_str(X1)|~net_str(X2,X1)|~net_str(X3,X1)|~subnetstr(X3,X1,X2)),inference(split_conjunct,[status(thm)],[102])).
% fof(112, plain,![X1]:(~(rel_str(X1))|![X2]:(~(rel_str(X2))|((~(subrelstr(X2,X1))|(subset(the_carrier(X2),the_carrier(X1))&subset(the_InternalRel(X2),the_InternalRel(X1))))&((~(subset(the_carrier(X2),the_carrier(X1)))|~(subset(the_InternalRel(X2),the_InternalRel(X1))))|subrelstr(X2,X1))))),inference(fof_nnf,[status(thm)],[13])).
% fof(113, plain,![X3]:(~(rel_str(X3))|![X4]:(~(rel_str(X4))|((~(subrelstr(X4,X3))|(subset(the_carrier(X4),the_carrier(X3))&subset(the_InternalRel(X4),the_InternalRel(X3))))&((~(subset(the_carrier(X4),the_carrier(X3)))|~(subset(the_InternalRel(X4),the_InternalRel(X3))))|subrelstr(X4,X3))))),inference(variable_rename,[status(thm)],[112])).
% fof(114, plain,![X3]:![X4]:((~(rel_str(X4))|((~(subrelstr(X4,X3))|(subset(the_carrier(X4),the_carrier(X3))&subset(the_InternalRel(X4),the_InternalRel(X3))))&((~(subset(the_carrier(X4),the_carrier(X3)))|~(subset(the_InternalRel(X4),the_InternalRel(X3))))|subrelstr(X4,X3))))|~(rel_str(X3))),inference(shift_quantors,[status(thm)],[113])).
% fof(115, plain,![X3]:![X4]:(((((subset(the_carrier(X4),the_carrier(X3))|~(subrelstr(X4,X3)))|~(rel_str(X4)))|~(rel_str(X3)))&(((subset(the_InternalRel(X4),the_InternalRel(X3))|~(subrelstr(X4,X3)))|~(rel_str(X4)))|~(rel_str(X3))))&((((~(subset(the_carrier(X4),the_carrier(X3)))|~(subset(the_InternalRel(X4),the_InternalRel(X3))))|subrelstr(X4,X3))|~(rel_str(X4)))|~(rel_str(X3)))),inference(distribute,[status(thm)],[114])).
% cnf(118,plain,(subset(the_carrier(X2),the_carrier(X1))|~rel_str(X1)|~rel_str(X2)|~subrelstr(X2,X1)),inference(split_conjunct,[status(thm)],[115])).
% fof(154, plain,![X1]:(~(rel_str(X1))|![X2]:(~(subrelstr(X2,X1))|rel_str(X2))),inference(fof_nnf,[status(thm)],[24])).
% fof(155, plain,![X3]:(~(rel_str(X3))|![X4]:(~(subrelstr(X4,X3))|rel_str(X4))),inference(variable_rename,[status(thm)],[154])).
% fof(156, plain,![X3]:![X4]:((~(subrelstr(X4,X3))|rel_str(X4))|~(rel_str(X3))),inference(shift_quantors,[status(thm)],[155])).
% cnf(157,plain,(rel_str(X2)|~rel_str(X1)|~subrelstr(X2,X1)),inference(split_conjunct,[status(thm)],[156])).
% fof(265, negated_conjecture,?[X1]:(one_sorted_str(X1)&?[X2]:(net_str(X2,X1)&?[X3]:(subnetstr(X3,X1,X2)&~(subset(the_carrier(X3),the_carrier(X2)))))),inference(fof_nnf,[status(thm)],[60])).
% fof(266, negated_conjecture,?[X4]:(one_sorted_str(X4)&?[X5]:(net_str(X5,X4)&?[X6]:(subnetstr(X6,X4,X5)&~(subset(the_carrier(X6),the_carrier(X5)))))),inference(variable_rename,[status(thm)],[265])).
% fof(267, negated_conjecture,(one_sorted_str(esk19_0)&(net_str(esk20_0,esk19_0)&(subnetstr(esk21_0,esk19_0,esk20_0)&~(subset(the_carrier(esk21_0),the_carrier(esk20_0)))))),inference(skolemize,[status(esa)],[266])).
% cnf(268,negated_conjecture,(~subset(the_carrier(esk21_0),the_carrier(esk20_0))),inference(split_conjunct,[status(thm)],[267])).
% cnf(269,negated_conjecture,(subnetstr(esk21_0,esk19_0,esk20_0)),inference(split_conjunct,[status(thm)],[267])).
% cnf(270,negated_conjecture,(net_str(esk20_0,esk19_0)),inference(split_conjunct,[status(thm)],[267])).
% cnf(271,negated_conjecture,(one_sorted_str(esk19_0)),inference(split_conjunct,[status(thm)],[267])).
% cnf(278,plain,(subset(the_carrier(X2),the_carrier(X1))|~subrelstr(X2,X1)|~rel_str(X1)),inference(csr,[status(thm)],[118,157])).
% cnf(279,plain,(subrelstr(X3,X2)|~subnetstr(X3,X1,X2)|~net_str(X2,X1)|~one_sorted_str(X1)),inference(csr,[status(thm)],[105,69])).
% cnf(287,negated_conjecture,(rel_str(esk20_0)|~one_sorted_str(esk19_0)),inference(spm,[status(thm)],[86,270,theory(equality)])).
% cnf(289,negated_conjecture,(rel_str(esk20_0)|$false),inference(rw,[status(thm)],[287,271,theory(equality)])).
% cnf(290,negated_conjecture,(rel_str(esk20_0)),inference(cn,[status(thm)],[289,theory(equality)])).
% cnf(291,negated_conjecture,(~subrelstr(esk21_0,esk20_0)|~rel_str(esk20_0)),inference(spm,[status(thm)],[268,278,theory(equality)])).
% cnf(306,negated_conjecture,(subrelstr(esk21_0,esk20_0)|~net_str(esk20_0,esk19_0)|~one_sorted_str(esk19_0)),inference(spm,[status(thm)],[279,269,theory(equality)])).
% cnf(307,negated_conjecture,(subrelstr(esk21_0,esk20_0)|$false|~one_sorted_str(esk19_0)),inference(rw,[status(thm)],[306,270,theory(equality)])).
% cnf(308,negated_conjecture,(subrelstr(esk21_0,esk20_0)|$false|$false),inference(rw,[status(thm)],[307,271,theory(equality)])).
% cnf(309,negated_conjecture,(subrelstr(esk21_0,esk20_0)),inference(cn,[status(thm)],[308,theory(equality)])).
% cnf(354,negated_conjecture,($false|~rel_str(esk20_0)),inference(rw,[status(thm)],[291,309,theory(equality)])).
% cnf(355,negated_conjecture,($false|$false),inference(rw,[status(thm)],[354,290,theory(equality)])).
% cnf(356,negated_conjecture,($false),inference(cn,[status(thm)],[355,theory(equality)])).
% cnf(357,negated_conjecture,($false),356,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 170
% # ...of these trivial : 2
% # ...subsumed : 2
% # ...remaining for further processing: 166
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 52
% # ...of the previous two non-trivial : 45
% # Contextual simplify-reflections : 8
% # Paramodulations : 52
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 82
% # Positive orientable unit clauses: 37
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 42
% # Current number of unprocessed clauses: 33
% # ...number of literals in the above : 78
% # Clause-clause subsumption calls (NU) : 77
% # Rec. Clause-clause subsumption calls : 50
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 104 leaves, 1.26+/-0.635 terms/leaf
% # Paramod-from index: 60 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 99 leaves, 1.13+/-0.441 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.004 s
% # Total time : 0.027 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP9099/SEU373+1.tptp
%
%------------------------------------------------------------------------------