TSTP Solution File: SET992+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET992+1 : TPTP v5.0.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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:30:46 EST 2010
% Result : Theorem 93.28s
% Output : Solution 93.87s
% 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/SystemOnTPTP15665/SET992+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~t14_funct_1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc1_funct_1:
% d5_funct_1:
% CSA axiom d5_funct_1 found
% Looking for CSA axiom ... fc5_relat_1:
% CSA axiom fc5_relat_1 found
% Looking for CSA axiom ... fc6_relat_1:
% CSA axiom fc6_relat_1 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc1_funct_1:
% fc7_relat_1:
% CSA axiom fc7_relat_1 found
% Looking for CSA axiom ... fc8_relat_1:
% CSA axiom fc8_relat_1 found
% Looking for CSA axiom ... fc2_subset_1:
% CSA axiom fc2_subset_1 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc1_funct_1:
% cc1_funct_1:
% CSA axiom cc1_funct_1 found
% Looking for CSA axiom ... t8_boole: CSA axiom t8_boole found
% Looking for CSA axiom ... d1_tarski:
% CSA axiom d1_tarski found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :d1_tarski:t8_boole:cc1_funct_1:fc2_subset_1:fc8_relat_1:fc7_relat_1:fc6_relat_1:fc5_relat_1:d5_funct_1 (9)
% Unselected axioms are ... :rc1_funct_1:cc1_relat_1:rc1_relat_1:rc2_relat_1:antisymmetry_r2_hidden:fc1_xboole_0:rc1_xboole_0:rc2_xboole_0:t2_tarski:t6_boole:rc3_relat_1:t7_boole:existence_m1_subset_1:fc4_relat_1:fc1_subset_1:t1_subset:fc12_relat_1:t4_subset:reflexivity_r1_tarski:t2_subset:t5_subset:t3_subset:rc1_subset_1:rc2_subset_1 (24)
% SZS status THM for /tmp/SystemOnTPTP15665/SET992+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP15665/SET992+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 17962
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(9, axiom,![X1]:((relation(X1)&function(X1))=>![X2]:(X2=relation_rng(X1)<=>![X3]:(in(X3,X2)<=>?[X4]:(in(X4,relation_dom(X1))&X3=apply(X1,X4))))),file('/tmp/SRASS.s.p', d5_funct_1)).
% fof(10, conjecture,![X1]:![X2]:((relation(X2)&function(X2))=>(relation_dom(X2)=singleton(X1)=>relation_rng(X2)=singleton(apply(X2,X1)))),file('/tmp/SRASS.s.p', t14_funct_1)).
% fof(11, negated_conjecture,~(![X1]:![X2]:((relation(X2)&function(X2))=>(relation_dom(X2)=singleton(X1)=>relation_rng(X2)=singleton(apply(X2,X1))))),inference(assume_negation,[status(cth)],[10])).
% fof(15, plain,![X1]:![X2]:((~(X2=singleton(X1))|![X3]:((~(in(X3,X2))|X3=X1)&(~(X3=X1)|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(X3=X1))&(in(X3,X2)|X3=X1))|X2=singleton(X1))),inference(fof_nnf,[status(thm)],[1])).
% fof(16, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(X7=X4))&(in(X7,X5)|X7=X4))|X5=singleton(X4))),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[16])).
% fof(18, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[17])).
% fof(19, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[18])).
% cnf(20,plain,(X1=singleton(X2)|esk1_2(X2,X1)=X2|in(esk1_2(X2,X1),X1)),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,plain,(X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1)),inference(split_conjunct,[status(thm)],[19])).
% cnf(22,plain,(in(X3,X1)|X1!=singleton(X2)|X3!=X2),inference(split_conjunct,[status(thm)],[19])).
% cnf(23,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(48, plain,![X1]:((~(relation(X1))|~(function(X1)))|![X2]:((~(X2=relation_rng(X1))|![X3]:((~(in(X3,X2))|?[X4]:(in(X4,relation_dom(X1))&X3=apply(X1,X4)))&(![X4]:(~(in(X4,relation_dom(X1)))|~(X3=apply(X1,X4)))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|![X4]:(~(in(X4,relation_dom(X1)))|~(X3=apply(X1,X4))))&(in(X3,X2)|?[X4]:(in(X4,relation_dom(X1))&X3=apply(X1,X4))))|X2=relation_rng(X1)))),inference(fof_nnf,[status(thm)],[9])).
% fof(49, plain,![X5]:((~(relation(X5))|~(function(X5)))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|?[X8]:(in(X8,relation_dom(X5))&X7=apply(X5,X8)))&(![X9]:(~(in(X9,relation_dom(X5)))|~(X7=apply(X5,X9)))|in(X7,X6))))&(?[X10]:((~(in(X10,X6))|![X11]:(~(in(X11,relation_dom(X5)))|~(X10=apply(X5,X11))))&(in(X10,X6)|?[X12]:(in(X12,relation_dom(X5))&X10=apply(X5,X12))))|X6=relation_rng(X5)))),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,![X5]:((~(relation(X5))|~(function(X5)))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|(in(esk2_3(X5,X6,X7),relation_dom(X5))&X7=apply(X5,esk2_3(X5,X6,X7))))&(![X9]:(~(in(X9,relation_dom(X5)))|~(X7=apply(X5,X9)))|in(X7,X6))))&(((~(in(esk3_2(X5,X6),X6))|![X11]:(~(in(X11,relation_dom(X5)))|~(esk3_2(X5,X6)=apply(X5,X11))))&(in(esk3_2(X5,X6),X6)|(in(esk4_2(X5,X6),relation_dom(X5))&esk3_2(X5,X6)=apply(X5,esk4_2(X5,X6)))))|X6=relation_rng(X5)))),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X5]:![X6]:![X7]:![X9]:![X11]:((((((~(in(X11,relation_dom(X5)))|~(esk3_2(X5,X6)=apply(X5,X11)))|~(in(esk3_2(X5,X6),X6)))&(in(esk3_2(X5,X6),X6)|(in(esk4_2(X5,X6),relation_dom(X5))&esk3_2(X5,X6)=apply(X5,esk4_2(X5,X6)))))|X6=relation_rng(X5))&((((~(in(X9,relation_dom(X5)))|~(X7=apply(X5,X9)))|in(X7,X6))&(~(in(X7,X6))|(in(esk2_3(X5,X6,X7),relation_dom(X5))&X7=apply(X5,esk2_3(X5,X6,X7)))))|~(X6=relation_rng(X5))))|(~(relation(X5))|~(function(X5)))),inference(shift_quantors,[status(thm)],[50])).
% fof(52, plain,![X5]:![X6]:![X7]:![X9]:![X11]:((((((~(in(X11,relation_dom(X5)))|~(esk3_2(X5,X6)=apply(X5,X11)))|~(in(esk3_2(X5,X6),X6)))|X6=relation_rng(X5))|(~(relation(X5))|~(function(X5))))&((((in(esk4_2(X5,X6),relation_dom(X5))|in(esk3_2(X5,X6),X6))|X6=relation_rng(X5))|(~(relation(X5))|~(function(X5))))&(((esk3_2(X5,X6)=apply(X5,esk4_2(X5,X6))|in(esk3_2(X5,X6),X6))|X6=relation_rng(X5))|(~(relation(X5))|~(function(X5))))))&(((((~(in(X9,relation_dom(X5)))|~(X7=apply(X5,X9)))|in(X7,X6))|~(X6=relation_rng(X5)))|(~(relation(X5))|~(function(X5))))&((((in(esk2_3(X5,X6,X7),relation_dom(X5))|~(in(X7,X6)))|~(X6=relation_rng(X5)))|(~(relation(X5))|~(function(X5))))&(((X7=apply(X5,esk2_3(X5,X6,X7))|~(in(X7,X6)))|~(X6=relation_rng(X5)))|(~(relation(X5))|~(function(X5))))))),inference(distribute,[status(thm)],[51])).
% cnf(53,plain,(X3=apply(X1,esk2_3(X1,X2,X3))|~function(X1)|~relation(X1)|X2!=relation_rng(X1)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,plain,(in(esk2_3(X1,X2,X3),relation_dom(X1))|~function(X1)|~relation(X1)|X2!=relation_rng(X1)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[52])).
% cnf(55,plain,(in(X3,X2)|~function(X1)|~relation(X1)|X2!=relation_rng(X1)|X3!=apply(X1,X4)|~in(X4,relation_dom(X1))),inference(split_conjunct,[status(thm)],[52])).
% fof(59, negated_conjecture,?[X1]:?[X2]:((relation(X2)&function(X2))&(relation_dom(X2)=singleton(X1)&~(relation_rng(X2)=singleton(apply(X2,X1))))),inference(fof_nnf,[status(thm)],[11])).
% fof(60, negated_conjecture,?[X3]:?[X4]:((relation(X4)&function(X4))&(relation_dom(X4)=singleton(X3)&~(relation_rng(X4)=singleton(apply(X4,X3))))),inference(variable_rename,[status(thm)],[59])).
% fof(61, negated_conjecture,((relation(esk6_0)&function(esk6_0))&(relation_dom(esk6_0)=singleton(esk5_0)&~(relation_rng(esk6_0)=singleton(apply(esk6_0,esk5_0))))),inference(skolemize,[status(esa)],[60])).
% cnf(62,negated_conjecture,(relation_rng(esk6_0)!=singleton(apply(esk6_0,esk5_0))),inference(split_conjunct,[status(thm)],[61])).
% cnf(63,negated_conjecture,(relation_dom(esk6_0)=singleton(esk5_0)),inference(split_conjunct,[status(thm)],[61])).
% cnf(64,negated_conjecture,(function(esk6_0)),inference(split_conjunct,[status(thm)],[61])).
% cnf(65,negated_conjecture,(relation(esk6_0)),inference(split_conjunct,[status(thm)],[61])).
% cnf(66,plain,(in(X1,X2)|singleton(X1)!=X2),inference(er,[status(thm)],[22,theory(equality)])).
% cnf(79,negated_conjecture,(esk1_2(apply(esk6_0,esk5_0),X1)=apply(esk6_0,esk5_0)|in(esk1_2(apply(esk6_0,esk5_0),X1),X1)|X1!=relation_rng(esk6_0)),inference(spm,[status(thm)],[62,20,theory(equality)])).
% cnf(84,plain,(in(X1,singleton(X1))),inference(er,[status(thm)],[66,theory(equality)])).
% cnf(88,negated_conjecture,(in(esk2_3(esk6_0,X1,X2),singleton(esk5_0))|relation_rng(esk6_0)!=X1|~relation(esk6_0)|~function(esk6_0)|~in(X2,X1)),inference(spm,[status(thm)],[54,63,theory(equality)])).
% cnf(89,negated_conjecture,(in(esk2_3(esk6_0,X1,X2),singleton(esk5_0))|relation_rng(esk6_0)!=X1|$false|~function(esk6_0)|~in(X2,X1)),inference(rw,[status(thm)],[88,65,theory(equality)])).
% cnf(90,negated_conjecture,(in(esk2_3(esk6_0,X1,X2),singleton(esk5_0))|relation_rng(esk6_0)!=X1|$false|$false|~in(X2,X1)),inference(rw,[status(thm)],[89,64,theory(equality)])).
% cnf(91,negated_conjecture,(in(esk2_3(esk6_0,X1,X2),singleton(esk5_0))|relation_rng(esk6_0)!=X1|~in(X2,X1)),inference(cn,[status(thm)],[90,theory(equality)])).
% cnf(98,negated_conjecture,(in(X1,X2)|apply(esk6_0,X3)!=X1|relation_rng(esk6_0)!=X2|~relation(esk6_0)|~function(esk6_0)|~in(X3,singleton(esk5_0))),inference(spm,[status(thm)],[55,63,theory(equality)])).
% cnf(101,negated_conjecture,(in(X1,X2)|apply(esk6_0,X3)!=X1|relation_rng(esk6_0)!=X2|$false|~function(esk6_0)|~in(X3,singleton(esk5_0))),inference(rw,[status(thm)],[98,65,theory(equality)])).
% cnf(102,negated_conjecture,(in(X1,X2)|apply(esk6_0,X3)!=X1|relation_rng(esk6_0)!=X2|$false|$false|~in(X3,singleton(esk5_0))),inference(rw,[status(thm)],[101,64,theory(equality)])).
% cnf(103,negated_conjecture,(in(X1,X2)|apply(esk6_0,X3)!=X1|relation_rng(esk6_0)!=X2|~in(X3,singleton(esk5_0))),inference(cn,[status(thm)],[102,theory(equality)])).
% cnf(587,negated_conjecture,(X1=esk2_3(esk6_0,X2,X3)|singleton(X1)!=singleton(esk5_0)|relation_rng(esk6_0)!=X2|~in(X3,X2)),inference(spm,[status(thm)],[23,91,theory(equality)])).
% cnf(707,negated_conjecture,(in(apply(esk6_0,X1),X2)|relation_rng(esk6_0)!=X2|~in(X1,singleton(esk5_0))),inference(er,[status(thm)],[103,theory(equality)])).
% cnf(885,negated_conjecture,(X1=esk2_3(esk6_0,relation_rng(esk6_0),X2)|singleton(X1)!=singleton(esk5_0)|~in(X2,relation_rng(esk6_0))),inference(er,[status(thm)],[587,theory(equality)])).
% cnf(892,negated_conjecture,(esk5_0=esk2_3(esk6_0,relation_rng(esk6_0),X1)|~in(X1,relation_rng(esk6_0))),inference(er,[status(thm)],[885,theory(equality)])).
% cnf(902,negated_conjecture,(apply(esk6_0,esk5_0)=X1|~relation(esk6_0)|~function(esk6_0)|~in(X1,relation_rng(esk6_0))),inference(spm,[status(thm)],[53,892,theory(equality)])).
% cnf(910,negated_conjecture,(apply(esk6_0,esk5_0)=X1|$false|~function(esk6_0)|~in(X1,relation_rng(esk6_0))),inference(rw,[status(thm)],[902,65,theory(equality)])).
% cnf(911,negated_conjecture,(apply(esk6_0,esk5_0)=X1|$false|$false|~in(X1,relation_rng(esk6_0))),inference(rw,[status(thm)],[910,64,theory(equality)])).
% cnf(912,negated_conjecture,(apply(esk6_0,esk5_0)=X1|~in(X1,relation_rng(esk6_0))),inference(cn,[status(thm)],[911,theory(equality)])).
% cnf(925,negated_conjecture,(apply(esk6_0,esk5_0)=esk1_2(apply(esk6_0,esk5_0),relation_rng(esk6_0))),inference(spm,[status(thm)],[912,79,theory(equality)])).
% cnf(945,negated_conjecture,(singleton(apply(esk6_0,esk5_0))=relation_rng(esk6_0)|~in(apply(esk6_0,esk5_0),relation_rng(esk6_0))),inference(spm,[status(thm)],[21,925,theory(equality)])).
% cnf(958,negated_conjecture,(~in(apply(esk6_0,esk5_0),relation_rng(esk6_0))),inference(sr,[status(thm)],[945,62,theory(equality)])).
% cnf(966,negated_conjecture,(~in(esk5_0,singleton(esk5_0))),inference(spm,[status(thm)],[958,707,theory(equality)])).
% cnf(967,negated_conjecture,($false),inference(rw,[status(thm)],[966,84,theory(equality)])).
% cnf(968,negated_conjecture,($false),inference(cn,[status(thm)],[967,theory(equality)])).
% cnf(969,negated_conjecture,($false),968,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 173
% # ...of these trivial : 2
% # ...subsumed : 61
% # ...remaining for further processing: 110
% # Other redundant clauses eliminated : 70
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 3
% # Generated clauses : 762
% # ...of the previous two non-trivial : 650
% # Contextual simplify-reflections : 43
% # Paramodulations : 662
% # Factorizations : 9
% # Equation resolutions : 91
% # Current number of processed clauses: 79
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 70
% # Current number of unprocessed clauses: 448
% # ...number of literals in the above : 3257
% # Clause-clause subsumption calls (NU) : 847
% # Rec. Clause-clause subsumption calls : 597
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 83 leaves, 1.51+/-1.010 terms/leaf
% # Paramod-from index: 31 leaves, 1.19+/-0.395 terms/leaf
% # Paramod-into index: 63 leaves, 1.24+/-0.610 terms/leaf
% # -------------------------------------------------
% # User time : 0.052 s
% # System time : 0.004 s
% # Total time : 0.056 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.24 WC
% FINAL PrfWatch: 0.15 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP15665/SET992+1.tptp
%
%------------------------------------------------------------------------------