TSTP Solution File: SET994+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET994+1 : TPTP v5.0.0. Released v3.2.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 00:31:10 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP9378/SET994+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9378/SET994+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9378/SET994+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 9475
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(3, axiom,(empty(empty_set)&relation(empty_set)),file('/tmp/SRASS.s.p', fc4_relat_1)).
% fof(13, axiom,![X1]:?[X2]:(((relation(X2)&function(X2))&relation_dom(X2)=X1)&![X3]:(in(X3,X1)=>apply(X2,X3)=n0)),file('/tmp/SRASS.s.p', s3_funct_1__e4_14__funct_1)).
% fof(14, axiom,![X1]:?[X2]:(((relation(X2)&function(X2))&relation_dom(X2)=X1)&![X3]:(in(X3,X1)=>apply(X2,X3)=n1)),file('/tmp/SRASS.s.p', s3_funct_1__e7_14__funct_1)).
% fof(19, axiom,empty(n0),file('/tmp/SRASS.s.p', spc0_boole)).
% fof(20, axiom,~(empty(n1)),file('/tmp/SRASS.s.p', spc1_boole)).
% fof(22, axiom,![X1]:?[X2]:element(X2,X1),file('/tmp/SRASS.s.p', existence_m1_subset_1)).
% fof(26, axiom,![X1]:![X2]:(element(X1,X2)=>(empty(X2)|in(X1,X2))),file('/tmp/SRASS.s.p', t2_subset)).
% fof(32, conjecture,![X1]:(![X2]:((relation(X2)&function(X2))=>![X3]:((relation(X3)&function(X3))=>((relation_dom(X2)=X1&relation_dom(X3)=X1)=>X2=X3)))=>X1=empty_set),file('/tmp/SRASS.s.p', t16_funct_1)).
% fof(33, negated_conjecture,~(![X1]:(![X2]:((relation(X2)&function(X2))=>![X3]:((relation(X3)&function(X3))=>((relation_dom(X2)=X1&relation_dom(X3)=X1)=>X2=X3)))=>X1=empty_set)),inference(assume_negation,[status(cth)],[32])).
% fof(38, plain,~(empty(n1)),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% fof(45, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[2])).
% fof(46, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[46])).
% cnf(49,plain,(empty(empty_set)),inference(split_conjunct,[status(thm)],[3])).
% fof(79, plain,![X1]:?[X2]:(((relation(X2)&function(X2))&relation_dom(X2)=X1)&![X3]:(~(in(X3,X1))|apply(X2,X3)=n0)),inference(fof_nnf,[status(thm)],[13])).
% fof(80, plain,![X4]:?[X5]:(((relation(X5)&function(X5))&relation_dom(X5)=X4)&![X6]:(~(in(X6,X4))|apply(X5,X6)=n0)),inference(variable_rename,[status(thm)],[79])).
% fof(81, plain,![X4]:(((relation(esk4_1(X4))&function(esk4_1(X4)))&relation_dom(esk4_1(X4))=X4)&![X6]:(~(in(X6,X4))|apply(esk4_1(X4),X6)=n0)),inference(skolemize,[status(esa)],[80])).
% fof(82, plain,![X4]:![X6]:((~(in(X6,X4))|apply(esk4_1(X4),X6)=n0)&((relation(esk4_1(X4))&function(esk4_1(X4)))&relation_dom(esk4_1(X4))=X4)),inference(shift_quantors,[status(thm)],[81])).
% cnf(83,plain,(relation_dom(esk4_1(X1))=X1),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,plain,(function(esk4_1(X1))),inference(split_conjunct,[status(thm)],[82])).
% cnf(85,plain,(relation(esk4_1(X1))),inference(split_conjunct,[status(thm)],[82])).
% cnf(86,plain,(apply(esk4_1(X1),X2)=n0|~in(X2,X1)),inference(split_conjunct,[status(thm)],[82])).
% fof(87, plain,![X1]:?[X2]:(((relation(X2)&function(X2))&relation_dom(X2)=X1)&![X3]:(~(in(X3,X1))|apply(X2,X3)=n1)),inference(fof_nnf,[status(thm)],[14])).
% fof(88, plain,![X4]:?[X5]:(((relation(X5)&function(X5))&relation_dom(X5)=X4)&![X6]:(~(in(X6,X4))|apply(X5,X6)=n1)),inference(variable_rename,[status(thm)],[87])).
% fof(89, plain,![X4]:(((relation(esk5_1(X4))&function(esk5_1(X4)))&relation_dom(esk5_1(X4))=X4)&![X6]:(~(in(X6,X4))|apply(esk5_1(X4),X6)=n1)),inference(skolemize,[status(esa)],[88])).
% fof(90, plain,![X4]:![X6]:((~(in(X6,X4))|apply(esk5_1(X4),X6)=n1)&((relation(esk5_1(X4))&function(esk5_1(X4)))&relation_dom(esk5_1(X4))=X4)),inference(shift_quantors,[status(thm)],[89])).
% cnf(91,plain,(relation_dom(esk5_1(X1))=X1),inference(split_conjunct,[status(thm)],[90])).
% cnf(92,plain,(function(esk5_1(X1))),inference(split_conjunct,[status(thm)],[90])).
% cnf(93,plain,(relation(esk5_1(X1))),inference(split_conjunct,[status(thm)],[90])).
% cnf(94,plain,(apply(esk5_1(X1),X2)=n1|~in(X2,X1)),inference(split_conjunct,[status(thm)],[90])).
% cnf(108,plain,(empty(n0)),inference(split_conjunct,[status(thm)],[19])).
% cnf(109,plain,(~empty(n1)),inference(split_conjunct,[status(thm)],[38])).
% fof(113, plain,![X3]:?[X4]:element(X4,X3),inference(variable_rename,[status(thm)],[22])).
% fof(114, plain,![X3]:element(esk9_1(X3),X3),inference(skolemize,[status(esa)],[113])).
% cnf(115,plain,(element(esk9_1(X1),X1)),inference(split_conjunct,[status(thm)],[114])).
% fof(124, plain,![X1]:![X2]:(~(element(X1,X2))|(empty(X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[26])).
% fof(125, plain,![X3]:![X4]:(~(element(X3,X4))|(empty(X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[124])).
% cnf(126,plain,(in(X1,X2)|empty(X2)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[125])).
% fof(146, negated_conjecture,?[X1]:(![X2]:((~(relation(X2))|~(function(X2)))|![X3]:((~(relation(X3))|~(function(X3)))|((~(relation_dom(X2)=X1)|~(relation_dom(X3)=X1))|X2=X3)))&~(X1=empty_set)),inference(fof_nnf,[status(thm)],[33])).
% fof(147, negated_conjecture,?[X4]:(![X5]:((~(relation(X5))|~(function(X5)))|![X6]:((~(relation(X6))|~(function(X6)))|((~(relation_dom(X5)=X4)|~(relation_dom(X6)=X4))|X5=X6)))&~(X4=empty_set)),inference(variable_rename,[status(thm)],[146])).
% fof(148, negated_conjecture,(![X5]:((~(relation(X5))|~(function(X5)))|![X6]:((~(relation(X6))|~(function(X6)))|((~(relation_dom(X5)=esk12_0)|~(relation_dom(X6)=esk12_0))|X5=X6)))&~(esk12_0=empty_set)),inference(skolemize,[status(esa)],[147])).
% fof(149, negated_conjecture,![X5]:![X6]:((((~(relation(X6))|~(function(X6)))|((~(relation_dom(X5)=esk12_0)|~(relation_dom(X6)=esk12_0))|X5=X6))|(~(relation(X5))|~(function(X5))))&~(esk12_0=empty_set)),inference(shift_quantors,[status(thm)],[148])).
% cnf(150,negated_conjecture,(esk12_0!=empty_set),inference(split_conjunct,[status(thm)],[149])).
% cnf(151,negated_conjecture,(X1=X2|~function(X1)|~relation(X1)|relation_dom(X2)!=esk12_0|relation_dom(X1)!=esk12_0|~function(X2)|~relation(X2)),inference(split_conjunct,[status(thm)],[149])).
% cnf(157,plain,(empty_set=n0),inference(pm,[status(thm)],[47,108,theory(equality)])).
% cnf(198,plain,(in(esk9_1(X1),X1)|empty(X1)),inference(pm,[status(thm)],[126,115,theory(equality)])).
% cnf(207,negated_conjecture,(X1=esk5_1(X2)|X2!=esk12_0|relation_dom(X1)!=esk12_0|~function(esk5_1(X2))|~function(X1)|~relation(esk5_1(X2))|~relation(X1)),inference(pm,[status(thm)],[151,91,theory(equality)])).
% cnf(209,negated_conjecture,(X1=esk5_1(X2)|X2!=esk12_0|relation_dom(X1)!=esk12_0|$false|~function(X1)|~relation(esk5_1(X2))|~relation(X1)),inference(rw,[status(thm)],[207,92,theory(equality)])).
% cnf(210,negated_conjecture,(X1=esk5_1(X2)|X2!=esk12_0|relation_dom(X1)!=esk12_0|$false|~function(X1)|$false|~relation(X1)),inference(rw,[status(thm)],[209,93,theory(equality)])).
% cnf(211,negated_conjecture,(X1=esk5_1(X2)|X2!=esk12_0|relation_dom(X1)!=esk12_0|~function(X1)|~relation(X1)),inference(cn,[status(thm)],[210,theory(equality)])).
% cnf(224,plain,(apply(esk4_1(X1),X2)=empty_set|~in(X2,X1)),inference(rw,[status(thm)],[86,157,theory(equality)])).
% cnf(343,plain,(apply(esk4_1(X1),esk9_1(X1))=empty_set|empty(X1)),inference(pm,[status(thm)],[224,198,theory(equality)])).
% cnf(344,plain,(apply(esk5_1(X1),esk9_1(X1))=n1|empty(X1)),inference(pm,[status(thm)],[94,198,theory(equality)])).
% cnf(382,negated_conjecture,(esk4_1(X1)=esk5_1(X2)|X1!=esk12_0|X2!=esk12_0|~function(esk4_1(X1))|~relation(esk4_1(X1))),inference(pm,[status(thm)],[211,83,theory(equality)])).
% cnf(387,negated_conjecture,(esk4_1(X1)=esk5_1(X2)|X1!=esk12_0|X2!=esk12_0|$false|~relation(esk4_1(X1))),inference(rw,[status(thm)],[382,84,theory(equality)])).
% cnf(388,negated_conjecture,(esk4_1(X1)=esk5_1(X2)|X1!=esk12_0|X2!=esk12_0|$false|$false),inference(rw,[status(thm)],[387,85,theory(equality)])).
% cnf(389,negated_conjecture,(esk4_1(X1)=esk5_1(X2)|X1!=esk12_0|X2!=esk12_0),inference(cn,[status(thm)],[388,theory(equality)])).
% cnf(413,negated_conjecture,(esk4_1(esk12_0)=esk5_1(X1)|X1!=esk12_0),inference(er,[status(thm)],[389,theory(equality)])).
% cnf(414,negated_conjecture,(esk4_1(esk12_0)=esk5_1(esk12_0)),inference(er,[status(thm)],[413,theory(equality)])).
% cnf(418,negated_conjecture,(apply(esk5_1(esk12_0),esk9_1(esk12_0))=empty_set|empty(esk12_0)),inference(pm,[status(thm)],[343,414,theory(equality)])).
% cnf(423,negated_conjecture,(empty_set=n1|empty(esk12_0)),inference(pm,[status(thm)],[344,418,theory(equality)])).
% cnf(446,negated_conjecture,(empty_set=esk12_0|n1=empty_set),inference(pm,[status(thm)],[47,423,theory(equality)])).
% cnf(456,negated_conjecture,(n1=empty_set),inference(sr,[status(thm)],[446,150,theory(equality)])).
% cnf(463,plain,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[109,456,theory(equality)]),49,theory(equality)])).
% cnf(464,plain,($false),inference(cn,[status(thm)],[463,theory(equality)])).
% cnf(465,plain,($false),464,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 136
% # ...of these trivial : 6
% # ...subsumed : 18
% # ...remaining for further processing: 112
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 26
% # Generated clauses : 192
% # ...of the previous two non-trivial : 161
% # Contextual simplify-reflections : 0
% # Paramodulations : 184
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 86
% # Positive orientable unit clauses: 37
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 41
% # Current number of unprocessed clauses: 20
% # ...number of literals in the above : 44
% # Clause-clause subsumption calls (NU) : 56
% # Rec. Clause-clause subsumption calls : 49
% # Unit Clause-clause subsumption calls : 84
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 21
% # Indexed BW rewrite successes : 13
% # Backwards rewriting index: 93 leaves, 1.23+/-0.551 terms/leaf
% # Paramod-from index: 46 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 84 leaves, 1.14+/-0.412 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.004 s
% # Total time : 0.024 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP9378/SET994+1.tptp
%
%------------------------------------------------------------------------------