TSTP Solution File: SEU056+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU056+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 : 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 : Thu Dec 30 00:46:42 EST 2010
% Result : Theorem 1.83s
% Output : Solution 1.83s
% 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/SystemOnTPTP22435/SEU056+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22435/SEU056+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22435/SEU056+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 22531
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X1]:![X2]:![X3]:((relation(X3)&function(X3))=>(one_to_one(X3)=>relation_image(X3,set_intersection2(X1,X2))=set_intersection2(relation_image(X3,X1),relation_image(X3,X2)))),file('/tmp/SRASS.s.p', t121_funct_1)).
% fof(16, axiom,![X1]:(relation(X1)=>relation_image(X1,empty_set)=empty_set),file('/tmp/SRASS.s.p', t149_relat_1)).
% fof(27, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>set_intersection2(X1,X2)=empty_set),file('/tmp/SRASS.s.p', d7_xboole_0)).
% fof(37, conjecture,![X1]:![X2]:![X3]:((relation(X3)&function(X3))=>((disjoint(X1,X2)&one_to_one(X3))=>disjoint(relation_image(X3,X1),relation_image(X3,X2)))),file('/tmp/SRASS.s.p', t125_funct_1)).
% fof(38, negated_conjecture,~(![X1]:![X2]:![X3]:((relation(X3)&function(X3))=>((disjoint(X1,X2)&one_to_one(X3))=>disjoint(relation_image(X3,X1),relation_image(X3,X2))))),inference(assume_negation,[status(cth)],[37])).
% fof(67, plain,![X1]:![X2]:![X3]:((~(relation(X3))|~(function(X3)))|(~(one_to_one(X3))|relation_image(X3,set_intersection2(X1,X2))=set_intersection2(relation_image(X3,X1),relation_image(X3,X2)))),inference(fof_nnf,[status(thm)],[6])).
% fof(68, plain,![X4]:![X5]:![X6]:((~(relation(X6))|~(function(X6)))|(~(one_to_one(X6))|relation_image(X6,set_intersection2(X4,X5))=set_intersection2(relation_image(X6,X4),relation_image(X6,X5)))),inference(variable_rename,[status(thm)],[67])).
% cnf(69,plain,(relation_image(X1,set_intersection2(X2,X3))=set_intersection2(relation_image(X1,X2),relation_image(X1,X3))|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[68])).
% fof(97, plain,![X1]:(~(relation(X1))|relation_image(X1,empty_set)=empty_set),inference(fof_nnf,[status(thm)],[16])).
% fof(98, plain,![X2]:(~(relation(X2))|relation_image(X2,empty_set)=empty_set),inference(variable_rename,[status(thm)],[97])).
% cnf(99,plain,(relation_image(X1,empty_set)=empty_set|~relation(X1)),inference(split_conjunct,[status(thm)],[98])).
% fof(126, plain,![X1]:![X2]:((~(disjoint(X1,X2))|set_intersection2(X1,X2)=empty_set)&(~(set_intersection2(X1,X2)=empty_set)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[27])).
% fof(127, plain,![X3]:![X4]:((~(disjoint(X3,X4))|set_intersection2(X3,X4)=empty_set)&(~(set_intersection2(X3,X4)=empty_set)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[126])).
% cnf(128,plain,(disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[127])).
% cnf(129,plain,(set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[127])).
% fof(161, negated_conjecture,?[X1]:?[X2]:?[X3]:((relation(X3)&function(X3))&((disjoint(X1,X2)&one_to_one(X3))&~(disjoint(relation_image(X3,X1),relation_image(X3,X2))))),inference(fof_nnf,[status(thm)],[38])).
% fof(162, negated_conjecture,?[X4]:?[X5]:?[X6]:((relation(X6)&function(X6))&((disjoint(X4,X5)&one_to_one(X6))&~(disjoint(relation_image(X6,X4),relation_image(X6,X5))))),inference(variable_rename,[status(thm)],[161])).
% fof(163, negated_conjecture,((relation(esk14_0)&function(esk14_0))&((disjoint(esk12_0,esk13_0)&one_to_one(esk14_0))&~(disjoint(relation_image(esk14_0,esk12_0),relation_image(esk14_0,esk13_0))))),inference(skolemize,[status(esa)],[162])).
% cnf(164,negated_conjecture,(~disjoint(relation_image(esk14_0,esk12_0),relation_image(esk14_0,esk13_0))),inference(split_conjunct,[status(thm)],[163])).
% cnf(165,negated_conjecture,(one_to_one(esk14_0)),inference(split_conjunct,[status(thm)],[163])).
% cnf(166,negated_conjecture,(disjoint(esk12_0,esk13_0)),inference(split_conjunct,[status(thm)],[163])).
% cnf(167,negated_conjecture,(function(esk14_0)),inference(split_conjunct,[status(thm)],[163])).
% cnf(168,negated_conjecture,(relation(esk14_0)),inference(split_conjunct,[status(thm)],[163])).
% cnf(208,negated_conjecture,(set_intersection2(esk12_0,esk13_0)=empty_set),inference(pm,[status(thm)],[129,166,theory(equality)])).
% cnf(212,negated_conjecture,(relation_image(esk14_0,empty_set)=empty_set),inference(pm,[status(thm)],[99,168,theory(equality)])).
% cnf(251,negated_conjecture,(set_intersection2(relation_image(esk14_0,X1),relation_image(esk14_0,X2))=relation_image(esk14_0,set_intersection2(X1,X2))|~function(esk14_0)|~relation(esk14_0)),inference(pm,[status(thm)],[69,165,theory(equality)])).
% cnf(253,negated_conjecture,(set_intersection2(relation_image(esk14_0,X1),relation_image(esk14_0,X2))=relation_image(esk14_0,set_intersection2(X1,X2))|$false|~relation(esk14_0)),inference(rw,[status(thm)],[251,167,theory(equality)])).
% cnf(254,negated_conjecture,(set_intersection2(relation_image(esk14_0,X1),relation_image(esk14_0,X2))=relation_image(esk14_0,set_intersection2(X1,X2))|$false|$false),inference(rw,[status(thm)],[253,168,theory(equality)])).
% cnf(255,negated_conjecture,(set_intersection2(relation_image(esk14_0,X1),relation_image(esk14_0,X2))=relation_image(esk14_0,set_intersection2(X1,X2))),inference(cn,[status(thm)],[254,theory(equality)])).
% cnf(701,negated_conjecture,(disjoint(relation_image(esk14_0,X1),relation_image(esk14_0,X2))|relation_image(esk14_0,set_intersection2(X1,X2))!=empty_set),inference(pm,[status(thm)],[128,255,theory(equality)])).
% cnf(24652,negated_conjecture,(disjoint(relation_image(esk14_0,esk12_0),relation_image(esk14_0,esk13_0))|relation_image(esk14_0,empty_set)!=empty_set),inference(pm,[status(thm)],[701,208,theory(equality)])).
% cnf(24661,negated_conjecture,(disjoint(relation_image(esk14_0,esk12_0),relation_image(esk14_0,esk13_0))|$false),inference(rw,[status(thm)],[24652,212,theory(equality)])).
% cnf(24662,negated_conjecture,(disjoint(relation_image(esk14_0,esk12_0),relation_image(esk14_0,esk13_0))),inference(cn,[status(thm)],[24661,theory(equality)])).
% cnf(24663,negated_conjecture,($false),inference(sr,[status(thm)],[24662,164,theory(equality)])).
% cnf(24664,negated_conjecture,($false),24663,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 700
% # ...of these trivial : 115
% # ...subsumed : 91
% # ...remaining for further processing: 494
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 20
% # Generated clauses : 23779
% # ...of the previous two non-trivial : 23485
% # Contextual simplify-reflections : 0
% # Paramodulations : 23772
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 472
% # Positive orientable unit clauses: 247
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 9
% # Non-unit-clauses : 215
% # Current number of unprocessed clauses: 22815
% # ...number of literals in the above : 34401
% # Clause-clause subsumption calls (NU) : 1023
% # Rec. Clause-clause subsumption calls : 1012
% # Unit Clause-clause subsumption calls : 97
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3008
% # Indexed BW rewrite successes : 14
% # Backwards rewriting index: 388 leaves, 2.15+/-6.320 terms/leaf
% # Paramod-from index: 116 leaves, 2.76+/-7.243 terms/leaf
% # Paramod-into index: 341 leaves, 1.77+/-4.306 terms/leaf
% # -------------------------------------------------
% # User time : 0.382 s
% # System time : 0.029 s
% # Total time : 0.411 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.85 CPU 0.92 WC
% FINAL PrfWatch: 0.85 CPU 0.92 WC
% SZS output end Solution for /tmp/SystemOnTPTP22435/SEU056+1.tptp
%
%------------------------------------------------------------------------------