TSTP Solution File: SET890+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET890+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 : art09.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:16:00 EST 2010
% Result : Theorem 33.67s
% Output : Solution 33.67s
% 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/SystemOnTPTP28154/SET890+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28154/SET890+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28154/SET890+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 28250
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.02 WC
% PrfWatch: 3.93 CPU 4.02 WC
% PrfWatch: 5.92 CPU 6.03 WC
% PrfWatch: 7.91 CPU 8.03 WC
% PrfWatch: 9.90 CPU 10.04 WC
% PrfWatch: 11.90 CPU 12.04 WC
% PrfWatch: 13.88 CPU 14.05 WC
% PrfWatch: 15.88 CPU 16.05 WC
% PrfWatch: 17.87 CPU 18.06 WC
% PrfWatch: 19.85 CPU 20.06 WC
% PrfWatch: 21.85 CPU 22.06 WC
% PrfWatch: 23.84 CPU 24.07 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 25.81 CPU 26.07 WC
% PrfWatch: 27.81 CPU 28.08 WC
% PrfWatch: 29.80 CPU 30.08 WC
% PrfWatch: 31.78 CPU 32.09 WC
% # 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(2, 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(3, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', d10_xboole_0)).
% fof(7, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(10, conjecture,![X1]:union(singleton(X1))=X1,file('/tmp/SRASS.s.p', t31_zfmisc_1)).
% fof(11, negated_conjecture,~(![X1]:union(singleton(X1))=X1),inference(assume_negation,[status(cth)],[10])).
% fof(14, 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(15, 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)],[14])).
% fof(16, 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)],[15])).
% fof(17, 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)],[16])).
% fof(18, 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)],[17])).
% cnf(21,plain,(in(X3,X1)|X1!=singleton(X2)|X3!=X2),inference(split_conjunct,[status(thm)],[18])).
% cnf(22,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(23, 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)],[2])).
% fof(24, 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)],[23])).
% fof(25, 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)],[24])).
% fof(26, 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)],[25])).
% fof(27, 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)],[26])).
% cnf(28,plain,(in(esk2_3(X2,X1,X3),X2)|X1!=union(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,plain,(in(X3,esk2_3(X2,X1,X3))|X1!=union(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[27])).
% cnf(30,plain,(in(X3,X1)|X1!=union(X2)|~in(X4,X2)|~in(X3,X4)),inference(split_conjunct,[status(thm)],[27])).
% fof(34, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[3])).
% fof(35, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[34])).
% fof(36, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[35])).
% cnf(37,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(48, 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)],[7])).
% fof(49, 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)],[48])).
% fof(50, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk5_2(X4,X5),X4)&~(in(esk5_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk5_2(X4,X5),X4)&~(in(esk5_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[50])).
% fof(52, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk5_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk5_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[51])).
% cnf(53,plain,(subset(X1,X2)|~in(esk5_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,plain,(subset(X1,X2)|in(esk5_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(62, negated_conjecture,?[X1]:~(union(singleton(X1))=X1),inference(fof_nnf,[status(thm)],[11])).
% fof(63, negated_conjecture,?[X2]:~(union(singleton(X2))=X2),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,~(union(singleton(esk8_0))=esk8_0),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(union(singleton(esk8_0))!=esk8_0),inference(split_conjunct,[status(thm)],[64])).
% cnf(70,plain,(in(X1,X2)|singleton(X1)!=X2),inference(er,[status(thm)],[21,theory(equality)])).
% cnf(72,plain,(in(X1,singleton(X1))),inference(er,[status(thm)],[70,theory(equality)])).
% cnf(90,plain,(in(X1,esk2_3(X2,union(X2),X1))|~in(X1,union(X2))),inference(er,[status(thm)],[29,theory(equality)])).
% cnf(91,plain,(in(esk2_3(X1,union(X1),X2),X1)|~in(X2,union(X1))),inference(er,[status(thm)],[28,theory(equality)])).
% cnf(140,plain,(in(X1,X2)|union(singleton(X3))!=X2|~in(X1,X3)),inference(spm,[status(thm)],[30,72,theory(equality)])).
% cnf(1434,plain,(X1=esk2_3(X2,union(X2),X3)|singleton(X1)!=X2|~in(X3,union(X2))),inference(spm,[status(thm)],[22,91,theory(equality)])).
% cnf(1692,plain,(in(X1,union(singleton(X2)))|~in(X1,X2)),inference(er,[status(thm)],[140,theory(equality)])).
% cnf(1944,plain,(subset(X1,union(singleton(X2)))|~in(esk5_2(X1,union(singleton(X2))),X2)),inference(spm,[status(thm)],[53,1692,theory(equality)])).
% cnf(6189,plain,(subset(X1,union(singleton(X1)))),inference(spm,[status(thm)],[1944,54,theory(equality)])).
% cnf(6389,plain,(union(singleton(X1))=X1|~subset(union(singleton(X1)),X1)),inference(spm,[status(thm)],[37,6189,theory(equality)])).
% cnf(328635,plain,(X1=esk2_3(singleton(X1),union(singleton(X1)),X2)|~in(X2,union(singleton(X1)))),inference(er,[status(thm)],[1434,theory(equality)])).
% cnf(329917,plain,(in(X1,X2)|~in(X1,union(singleton(X2)))),inference(spm,[status(thm)],[90,328635,theory(equality)])).
% cnf(334628,plain,(in(esk5_2(union(singleton(X1)),X2),X1)|subset(union(singleton(X1)),X2)),inference(spm,[status(thm)],[329917,54,theory(equality)])).
% cnf(440314,plain,(subset(union(singleton(X1)),X1)),inference(spm,[status(thm)],[53,334628,theory(equality)])).
% cnf(440848,plain,(union(singleton(X1))=X1|$false),inference(rw,[status(thm)],[6389,440314,theory(equality)])).
% cnf(440849,plain,(union(singleton(X1))=X1),inference(cn,[status(thm)],[440848,theory(equality)])).
% cnf(442361,negated_conjecture,($false),inference(rw,[status(thm)],[65,440849,theory(equality)])).
% cnf(442362,negated_conjecture,($false),inference(cn,[status(thm)],[442361,theory(equality)])).
% cnf(442363,negated_conjecture,($false),442362,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2247
% # ...of these trivial : 22
% # ...subsumed : 693
% # ...remaining for further processing: 1532
% # Other redundant clauses eliminated : 604
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 1298
% # Generated clauses : 440140
% # ...of the previous two non-trivial : 439287
% # Contextual simplify-reflections : 7
% # Paramodulations : 439433
% # Factorizations : 75
% # Equation resolutions : 632
% # Current number of processed clauses: 210
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 202
% # Current number of unprocessed clauses: 15814
% # ...number of literals in the above : 123669
% # Clause-clause subsumption calls (NU) : 27559
% # Rec. Clause-clause subsumption calls : 21588
% # Unit Clause-clause subsumption calls : 34658
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 189441
% # Indexed BW rewrite successes : 914
% # Backwards rewriting index: 138 leaves, 2.10+/-1.931 terms/leaf
% # Paramod-from index: 62 leaves, 1.61+/-1.141 terms/leaf
% # Paramod-into index: 114 leaves, 1.97+/-1.625 terms/leaf
% # -------------------------------------------------
% # User time : 23.313 s
% # System time : 0.702 s
% # Total time : 24.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 32.79 CPU 33.40 WC
% FINAL PrfWatch: 32.79 CPU 33.40 WC
% SZS output end Solution for /tmp/SystemOnTPTP28154/SET890+1.tptp
%
%------------------------------------------------------------------------------