TSTP Solution File: SET867+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET867+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:13:16 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.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/SystemOnTPTP1237/SET867+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP1237/SET867+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1237/SET867+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 1334
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, 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(2, axiom,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),file('/tmp/SRASS.s.p', d1_xboole_0)).
% fof(7, conjecture,union(empty_set)=empty_set,file('/tmp/SRASS.s.p', t2_zfmisc_1)).
% fof(8, negated_conjecture,~(union(empty_set)=empty_set),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(12, negated_conjecture,~(union(empty_set)=empty_set),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(13, 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)],[1])).
% fof(14, 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)],[13])).
% fof(15, plain,![X5]:![X6]:((~(X6=union(X5))|![X7]:((~(in(X7,X6))|(in(X7,esk1_3(X5,X6,X7))&in(esk1_3(X5,X6,X7),X5)))&(![X9]:(~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))))&(((~(in(esk2_2(X5,X6),X6))|![X11]:(~(in(esk2_2(X5,X6),X11))|~(in(X11,X5))))&(in(esk2_2(X5,X6),X6)|(in(esk2_2(X5,X6),esk3_2(X5,X6))&in(esk3_2(X5,X6),X5))))|X6=union(X5))),inference(skolemize,[status(esa)],[14])).
% fof(16, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(esk2_2(X5,X6),X11))|~(in(X11,X5)))|~(in(esk2_2(X5,X6),X6)))&(in(esk2_2(X5,X6),X6)|(in(esk2_2(X5,X6),esk3_2(X5,X6))&in(esk3_2(X5,X6),X5))))|X6=union(X5))&((((~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))&(~(in(X7,X6))|(in(X7,esk1_3(X5,X6,X7))&in(esk1_3(X5,X6,X7),X5))))|~(X6=union(X5)))),inference(shift_quantors,[status(thm)],[15])).
% fof(17, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(esk2_2(X5,X6),X11))|~(in(X11,X5)))|~(in(esk2_2(X5,X6),X6)))|X6=union(X5))&(((in(esk2_2(X5,X6),esk3_2(X5,X6))|in(esk2_2(X5,X6),X6))|X6=union(X5))&((in(esk3_2(X5,X6),X5)|in(esk2_2(X5,X6),X6))|X6=union(X5))))&((((~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))|~(X6=union(X5)))&(((in(X7,esk1_3(X5,X6,X7))|~(in(X7,X6)))|~(X6=union(X5)))&((in(esk1_3(X5,X6,X7),X5)|~(in(X7,X6)))|~(X6=union(X5)))))),inference(distribute,[status(thm)],[16])).
% cnf(18,plain,(in(esk1_3(X2,X1,X3),X2)|X1!=union(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[17])).
% fof(24, plain,![X1]:((~(X1=empty_set)|![X2]:~(in(X2,X1)))&(?[X2]:in(X2,X1)|X1=empty_set)),inference(fof_nnf,[status(thm)],[9])).
% fof(25, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(?[X5]:in(X5,X3)|X3=empty_set)),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(in(esk4_1(X3),X3)|X3=empty_set)),inference(skolemize,[status(esa)],[25])).
% fof(27, plain,![X3]:![X4]:((~(in(X4,X3))|~(X3=empty_set))&(in(esk4_1(X3),X3)|X3=empty_set)),inference(shift_quantors,[status(thm)],[26])).
% cnf(28,plain,(X1=empty_set|in(esk4_1(X1),X1)),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,plain,(X1!=empty_set|~in(X2,X1)),inference(split_conjunct,[status(thm)],[27])).
% cnf(40,negated_conjecture,(union(empty_set)!=empty_set),inference(split_conjunct,[status(thm)],[12])).
% cnf(45,plain,(empty_set!=X1|union(X1)!=X2|~in(X3,X2)),inference(spm,[status(thm)],[29,18,theory(equality)])).
% cnf(62,plain,(empty_set=X2|union(X1)!=X2|empty_set!=X1),inference(spm,[status(thm)],[45,28,theory(equality)])).
% cnf(68,plain,(empty_set=union(X1)|empty_set!=X1),inference(er,[status(thm)],[62,theory(equality)])).
% cnf(69,negated_conjecture,($false),inference(spm,[status(thm)],[40,68,theory(equality)])).
% cnf(71,negated_conjecture,($false),69,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 30
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 30
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 30
% # ...of the previous two non-trivial : 26
% # Contextual simplify-reflections : 0
% # Paramodulations : 29
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 17
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 13
% # Current number of unprocessed clauses: 22
% # ...number of literals in the above : 85
% # Clause-clause subsumption calls (NU) : 28
% # Rec. Clause-clause subsumption calls : 26
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 21 leaves, 1.48+/-1.332 terms/leaf
% # Paramod-from index: 9 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 20 leaves, 1.30+/-0.714 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.001 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP1237/SET867+1.tptp
%
%------------------------------------------------------------------------------