TSTP Solution File: SEU144+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU144+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 : 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 01:16:46 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP27475/SEU144+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP27475/SEU144+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27475/SEU144+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 27571
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(4, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(6, conjecture,![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2)),file('/tmp/SRASS.s.p', l2_zfmisc_1)).
% fof(7, negated_conjecture,~(![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2))),inference(assume_negation,[status(cth)],[6])).
% fof(12, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(13, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[12])).
% fof(14, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[13])).
% fof(15, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[14])).
% fof(16, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[15])).
% cnf(17,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[16])).
% cnf(18,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[16])).
% cnf(19,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(22, 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)],[4])).
% fof(23, 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)],[22])).
% fof(24, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk2_2(X4,X5),X5))|~(esk2_2(X4,X5)=X4))&(in(esk2_2(X4,X5),X5)|esk2_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk2_2(X4,X5),X5))|~(esk2_2(X4,X5)=X4))&(in(esk2_2(X4,X5),X5)|esk2_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk2_2(X4,X5),X5))|~(esk2_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk2_2(X4,X5),X5)|esk2_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[25])).
% cnf(29,plain,(in(X3,X1)|X1!=singleton(X2)|X3!=X2),inference(split_conjunct,[status(thm)],[26])).
% cnf(30,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(32, negated_conjecture,?[X1]:?[X2]:((~(subset(singleton(X1),X2))|~(in(X1,X2)))&(subset(singleton(X1),X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(33, negated_conjecture,?[X3]:?[X4]:((~(subset(singleton(X3),X4))|~(in(X3,X4)))&(subset(singleton(X3),X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[32])).
% fof(34, negated_conjecture,((~(subset(singleton(esk3_0),esk4_0))|~(in(esk3_0,esk4_0)))&(subset(singleton(esk3_0),esk4_0)|in(esk3_0,esk4_0))),inference(skolemize,[status(esa)],[33])).
% cnf(35,negated_conjecture,(in(esk3_0,esk4_0)|subset(singleton(esk3_0),esk4_0)),inference(split_conjunct,[status(thm)],[34])).
% cnf(36,negated_conjecture,(~in(esk3_0,esk4_0)|~subset(singleton(esk3_0),esk4_0)),inference(split_conjunct,[status(thm)],[34])).
% cnf(37,plain,(in(X1,X2)|singleton(X1)!=X2),inference(er,[status(thm)],[29,theory(equality)])).
% cnf(38,plain,(in(X1,singleton(X1))),inference(er,[status(thm)],[37,theory(equality)])).
% cnf(39,negated_conjecture,(in(X1,esk4_0)|in(esk3_0,esk4_0)|~in(X1,singleton(esk3_0))),inference(spm,[status(thm)],[19,35,theory(equality)])).
% cnf(43,plain,(X1=esk1_2(X2,X3)|subset(X2,X3)|singleton(X1)!=X2),inference(spm,[status(thm)],[30,18,theory(equality)])).
% cnf(53,negated_conjecture,(in(esk3_0,esk4_0)),inference(spm,[status(thm)],[39,38,theory(equality)])).
% cnf(57,negated_conjecture,(~subset(singleton(esk3_0),esk4_0)|$false),inference(rw,[status(thm)],[36,53,theory(equality)])).
% cnf(58,negated_conjecture,(~subset(singleton(esk3_0),esk4_0)),inference(cn,[status(thm)],[57,theory(equality)])).
% cnf(61,plain,(X1=esk1_2(singleton(X1),X2)|subset(singleton(X1),X2)),inference(er,[status(thm)],[43,theory(equality)])).
% cnf(63,plain,(subset(singleton(X1),X2)|~in(X1,X2)),inference(spm,[status(thm)],[17,61,theory(equality)])).
% cnf(68,negated_conjecture,(~in(esk3_0,esk4_0)),inference(spm,[status(thm)],[58,63,theory(equality)])).
% cnf(69,negated_conjecture,($false),inference(rw,[status(thm)],[68,53,theory(equality)])).
% cnf(70,negated_conjecture,($false),inference(cn,[status(thm)],[69,theory(equality)])).
% cnf(71,negated_conjecture,($false),70,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 38
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 37
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 26
% # ...of the previous two non-trivial : 20
% # Contextual simplify-reflections : 0
% # Paramodulations : 21
% # Factorizations : 0
% # Equation resolutions : 5
% # Current number of processed clauses: 22
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 16
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 6
% # Clause-clause subsumption calls (NU) : 20
% # Rec. Clause-clause subsumption calls : 19
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 20 leaves, 1.50+/-0.975 terms/leaf
% # Paramod-from index: 7 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 19 leaves, 1.26+/-0.547 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.003 s
% # Total time : 0.013 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/SystemOnTPTP27475/SEU144+1.tptp
%
%------------------------------------------------------------------------------