TSTP Solution File: SET941+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET941+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 : art05.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:21:30 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP3389/SET941+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP3389/SET941+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3389/SET941+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 3485
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 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=union(X1)<=>![X3]:(in(X3,X2)<=>?[X4]:(in(X3,X4)&in(X4,X1)))),file('/tmp/SRASS.s.p', d4_tarski)).
% fof(7, conjecture,![X1]:![X2]:(![X3]:(in(X3,X1)=>subset(X3,X2))=>subset(union(X1),X2)),file('/tmp/SRASS.s.p', t94_zfmisc_1)).
% fof(8, negated_conjecture,~(![X1]:![X2]:(![X3]:(in(X3,X1)=>subset(X3,X2))=>subset(union(X1),X2))),inference(assume_negation,[status(cth)],[7])).
% fof(14, 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(15, 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)],[14])).
% fof(16, 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)],[15])).
% fof(17, 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)],[16])).
% fof(18, 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)],[17])).
% cnf(19,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[18])).
% cnf(21,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(24, plain,![X1]:![X2]:((~(X2=union(X1))|![X3]:((~(in(X3,X2))|?[X4]:(in(X3,X4)&in(X4,X1)))&(![X4]:(~(in(X3,X4))|~(in(X4,X1)))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|![X4]:(~(in(X3,X4))|~(in(X4,X1))))&(in(X3,X2)|?[X4]:(in(X3,X4)&in(X4,X1))))|X2=union(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(25, plain,![X5]:![X6]:((~(X6=union(X5))|![X7]:((~(in(X7,X6))|?[X8]:(in(X7,X8)&in(X8,X5)))&(![X9]:(~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))))&(?[X10]:((~(in(X10,X6))|![X11]:(~(in(X10,X11))|~(in(X11,X5))))&(in(X10,X6)|?[X12]:(in(X10,X12)&in(X12,X5))))|X6=union(X5))),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X5]:![X6]:((~(X6=union(X5))|![X7]:((~(in(X7,X6))|(in(X7,esk2_3(X5,X6,X7))&in(esk2_3(X5,X6,X7),X5)))&(![X9]:(~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))))&(((~(in(esk3_2(X5,X6),X6))|![X11]:(~(in(esk3_2(X5,X6),X11))|~(in(X11,X5))))&(in(esk3_2(X5,X6),X6)|(in(esk3_2(X5,X6),esk4_2(X5,X6))&in(esk4_2(X5,X6),X5))))|X6=union(X5))),inference(skolemize,[status(esa)],[25])).
% fof(27, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(esk3_2(X5,X6),X11))|~(in(X11,X5)))|~(in(esk3_2(X5,X6),X6)))&(in(esk3_2(X5,X6),X6)|(in(esk3_2(X5,X6),esk4_2(X5,X6))&in(esk4_2(X5,X6),X5))))|X6=union(X5))&((((~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))&(~(in(X7,X6))|(in(X7,esk2_3(X5,X6,X7))&in(esk2_3(X5,X6,X7),X5))))|~(X6=union(X5)))),inference(shift_quantors,[status(thm)],[26])).
% fof(28, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(esk3_2(X5,X6),X11))|~(in(X11,X5)))|~(in(esk3_2(X5,X6),X6)))|X6=union(X5))&(((in(esk3_2(X5,X6),esk4_2(X5,X6))|in(esk3_2(X5,X6),X6))|X6=union(X5))&((in(esk4_2(X5,X6),X5)|in(esk3_2(X5,X6),X6))|X6=union(X5))))&((((~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))|~(X6=union(X5)))&(((in(X7,esk2_3(X5,X6,X7))|~(in(X7,X6)))|~(X6=union(X5)))&((in(esk2_3(X5,X6,X7),X5)|~(in(X7,X6)))|~(X6=union(X5)))))),inference(distribute,[status(thm)],[27])).
% cnf(29,plain,(in(esk2_3(X2,X1,X3),X2)|X1!=union(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,plain,(in(X3,esk2_3(X2,X1,X3))|X1!=union(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(41, negated_conjecture,?[X1]:?[X2]:(![X3]:(~(in(X3,X1))|subset(X3,X2))&~(subset(union(X1),X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(42, negated_conjecture,?[X4]:?[X5]:(![X6]:(~(in(X6,X4))|subset(X6,X5))&~(subset(union(X4),X5))),inference(variable_rename,[status(thm)],[41])).
% fof(43, negated_conjecture,(![X6]:(~(in(X6,esk7_0))|subset(X6,esk8_0))&~(subset(union(esk7_0),esk8_0))),inference(skolemize,[status(esa)],[42])).
% fof(44, negated_conjecture,![X6]:((~(in(X6,esk7_0))|subset(X6,esk8_0))&~(subset(union(esk7_0),esk8_0))),inference(shift_quantors,[status(thm)],[43])).
% cnf(45,negated_conjecture,(~subset(union(esk7_0),esk8_0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,negated_conjecture,(subset(X1,esk8_0)|~in(X1,esk7_0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(53,plain,(in(X1,esk2_3(X2,union(X2),X1))|~in(X1,union(X2))),inference(er,[status(thm)],[30,theory(equality)])).
% cnf(60,plain,(in(esk2_3(X1,union(X1),X2),X1)|~in(X2,union(X1))),inference(er,[status(thm)],[29,theory(equality)])).
% cnf(67,plain,(in(esk1_2(union(X1),X2),esk2_3(X1,union(X1),esk1_2(union(X1),X2)))|subset(union(X1),X2)),inference(spm,[status(thm)],[53,20,theory(equality)])).
% cnf(70,plain,(in(esk2_3(X1,union(X1),esk1_2(union(X1),X2)),X1)|subset(union(X1),X2)),inference(spm,[status(thm)],[60,20,theory(equality)])).
% cnf(89,negated_conjecture,(subset(esk2_3(esk7_0,union(esk7_0),esk1_2(union(esk7_0),X1)),esk8_0)|subset(union(esk7_0),X1)),inference(spm,[status(thm)],[46,70,theory(equality)])).
% cnf(102,negated_conjecture,(in(X1,esk8_0)|subset(union(esk7_0),X2)|~in(X1,esk2_3(esk7_0,union(esk7_0),esk1_2(union(esk7_0),X2)))),inference(spm,[status(thm)],[21,89,theory(equality)])).
% cnf(154,negated_conjecture,(subset(union(esk7_0),X1)|in(esk1_2(union(esk7_0),X1),esk8_0)),inference(spm,[status(thm)],[102,67,theory(equality)])).
% cnf(158,negated_conjecture,(subset(union(esk7_0),esk8_0)),inference(spm,[status(thm)],[19,154,theory(equality)])).
% cnf(159,negated_conjecture,($false),inference(sr,[status(thm)],[158,45,theory(equality)])).
% cnf(160,negated_conjecture,($false),159,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 50
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 46
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 109
% # ...of the previous two non-trivial : 105
% # Contextual simplify-reflections : 2
% # Paramodulations : 106
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 45
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 41
% # Current number of unprocessed clauses: 69
% # ...number of literals in the above : 253
% # Clause-clause subsumption calls (NU) : 214
% # Rec. Clause-clause subsumption calls : 131
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 67 leaves, 1.37+/-0.959 terms/leaf
% # Paramod-from index: 18 leaves, 1.06+/-0.229 terms/leaf
% # Paramod-into index: 54 leaves, 1.24+/-0.507 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.006 s
% # Total time : 0.021 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/SystemOnTPTP3389/SET941+1.tptp
%
%------------------------------------------------------------------------------