TSTP Solution File: SET016+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET016+4 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 : Wed Dec 29 22:51:32 EST 2010
% Result : Theorem 1.24s
% Output : Solution 1.24s
% 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/SystemOnTPTP14899/SET016+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14899/SET016+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14899/SET016+4.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 14995
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(member(X1,singleton(X2))<=>X1=X2),file('/tmp/SRASS.s.p', singleton)).
% fof(2, axiom,![X1]:![X2]:![X3]:(member(X1,unordered_pair(X2,X3))<=>(X1=X2|X1=X3)),file('/tmp/SRASS.s.p', unordered_pair)).
% fof(3, axiom,![X2]:![X3]:(equal_set(X2,X3)<=>(subset(X2,X3)&subset(X3,X2))),file('/tmp/SRASS.s.p', equal_set)).
% fof(4, axiom,![X2]:![X3]:(subset(X2,X3)<=>![X1]:(member(X1,X2)=>member(X1,X3))),file('/tmp/SRASS.s.p', subset)).
% fof(12, conjecture,![X2]:![X3]:![X6]:![X7]:(equal_set(unordered_pair(singleton(X2),unordered_pair(X2,X3)),unordered_pair(singleton(X6),unordered_pair(X6,X7)))=>X2=X6),file('/tmp/SRASS.s.p', thI50a)).
% fof(13, negated_conjecture,~(![X2]:![X3]:![X6]:![X7]:(equal_set(unordered_pair(singleton(X2),unordered_pair(X2,X3)),unordered_pair(singleton(X6),unordered_pair(X6,X7)))=>X2=X6)),inference(assume_negation,[status(cth)],[12])).
% fof(16, plain,![X1]:![X2]:((~(member(X1,singleton(X2)))|X1=X2)&(~(X1=X2)|member(X1,singleton(X2)))),inference(fof_nnf,[status(thm)],[1])).
% fof(17, plain,![X3]:![X4]:((~(member(X3,singleton(X4)))|X3=X4)&(~(X3=X4)|member(X3,singleton(X4)))),inference(variable_rename,[status(thm)],[16])).
% cnf(18,plain,(member(X1,singleton(X2))|X1!=X2),inference(split_conjunct,[status(thm)],[17])).
% cnf(19,plain,(X1=X2|~member(X1,singleton(X2))),inference(split_conjunct,[status(thm)],[17])).
% fof(20, plain,![X1]:![X2]:![X3]:((~(member(X1,unordered_pair(X2,X3)))|(X1=X2|X1=X3))&((~(X1=X2)&~(X1=X3))|member(X1,unordered_pair(X2,X3)))),inference(fof_nnf,[status(thm)],[2])).
% fof(21, plain,![X4]:![X5]:![X6]:((~(member(X4,unordered_pair(X5,X6)))|(X4=X5|X4=X6))&((~(X4=X5)&~(X4=X6))|member(X4,unordered_pair(X5,X6)))),inference(variable_rename,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:![X6]:((~(member(X4,unordered_pair(X5,X6)))|(X4=X5|X4=X6))&((~(X4=X5)|member(X4,unordered_pair(X5,X6)))&(~(X4=X6)|member(X4,unordered_pair(X5,X6))))),inference(distribute,[status(thm)],[21])).
% cnf(24,plain,(member(X1,unordered_pair(X2,X3))|X1!=X2),inference(split_conjunct,[status(thm)],[22])).
% cnf(25,plain,(X1=X2|X1=X3|~member(X1,unordered_pair(X3,X2))),inference(split_conjunct,[status(thm)],[22])).
% fof(26, plain,![X2]:![X3]:((~(equal_set(X2,X3))|(subset(X2,X3)&subset(X3,X2)))&((~(subset(X2,X3))|~(subset(X3,X2)))|equal_set(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(27, plain,![X4]:![X5]:((~(equal_set(X4,X5))|(subset(X4,X5)&subset(X5,X4)))&((~(subset(X4,X5))|~(subset(X5,X4)))|equal_set(X4,X5))),inference(variable_rename,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:(((subset(X4,X5)|~(equal_set(X4,X5)))&(subset(X5,X4)|~(equal_set(X4,X5))))&((~(subset(X4,X5))|~(subset(X5,X4)))|equal_set(X4,X5))),inference(distribute,[status(thm)],[27])).
% cnf(30,plain,(subset(X2,X1)|~equal_set(X1,X2)),inference(split_conjunct,[status(thm)],[28])).
% fof(32, plain,![X2]:![X3]:((~(subset(X2,X3))|![X1]:(~(member(X1,X2))|member(X1,X3)))&(?[X1]:(member(X1,X2)&~(member(X1,X3)))|subset(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(33, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&(?[X7]:(member(X7,X4)&~(member(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[33])).
% fof(35, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[34])).
% fof(36, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[35])).
% cnf(39,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(80, negated_conjecture,?[X2]:?[X3]:?[X6]:?[X7]:(equal_set(unordered_pair(singleton(X2),unordered_pair(X2,X3)),unordered_pair(singleton(X6),unordered_pair(X6,X7)))&~(X2=X6)),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X8]:?[X9]:?[X10]:?[X11]:(equal_set(unordered_pair(singleton(X8),unordered_pair(X8,X9)),unordered_pair(singleton(X10),unordered_pair(X10,X11)))&~(X8=X10)),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,(equal_set(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)),unordered_pair(singleton(esk6_0),unordered_pair(esk6_0,esk7_0)))&~(esk4_0=esk6_0)),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(esk4_0!=esk6_0),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,negated_conjecture,(equal_set(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)),unordered_pair(singleton(esk6_0),unordered_pair(esk6_0,esk7_0)))),inference(split_conjunct,[status(thm)],[82])).
% cnf(85,plain,(member(X1,singleton(X1))),inference(er,[status(thm)],[18,theory(equality)])).
% cnf(87,plain,(member(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[24,theory(equality)])).
% cnf(88,negated_conjecture,(subset(unordered_pair(singleton(esk6_0),unordered_pair(esk6_0,esk7_0)),unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)))),inference(spm,[status(thm)],[30,84,theory(equality)])).
% cnf(161,negated_conjecture,(member(X1,unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)))|~member(X1,unordered_pair(singleton(esk6_0),unordered_pair(esk6_0,esk7_0)))),inference(spm,[status(thm)],[39,88,theory(equality)])).
% cnf(3339,negated_conjecture,(member(singleton(esk6_0),unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)))),inference(spm,[status(thm)],[161,87,theory(equality)])).
% cnf(3371,negated_conjecture,(singleton(esk6_0)=singleton(esk4_0)|singleton(esk6_0)=unordered_pair(esk4_0,esk5_0)),inference(spm,[status(thm)],[25,3339,theory(equality)])).
% cnf(3378,negated_conjecture,(member(esk4_0,singleton(esk6_0))|singleton(esk6_0)=singleton(esk4_0)),inference(spm,[status(thm)],[87,3371,theory(equality)])).
% cnf(3938,negated_conjecture,(esk4_0=esk6_0|singleton(esk6_0)=singleton(esk4_0)),inference(spm,[status(thm)],[19,3378,theory(equality)])).
% cnf(3940,negated_conjecture,(singleton(esk6_0)=singleton(esk4_0)),inference(sr,[status(thm)],[3938,83,theory(equality)])).
% cnf(3946,negated_conjecture,(member(esk6_0,singleton(esk4_0))),inference(spm,[status(thm)],[85,3940,theory(equality)])).
% cnf(3986,negated_conjecture,(esk6_0=esk4_0),inference(spm,[status(thm)],[19,3946,theory(equality)])).
% cnf(3989,negated_conjecture,($false),inference(sr,[status(thm)],[3986,83,theory(equality)])).
% cnf(3990,negated_conjecture,($false),3989,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 469
% # ...of these trivial : 16
% # ...subsumed : 15
% # ...remaining for further processing: 438
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 17
% # Generated clauses : 3630
% # ...of the previous two non-trivial : 3416
% # Contextual simplify-reflections : 0
% # Paramodulations : 3613
% # Factorizations : 10
% # Equation resolutions : 7
% # Current number of processed clauses: 386
% # Positive orientable unit clauses: 294
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 19
% # Non-unit-clauses : 73
% # Current number of unprocessed clauses: 2488
% # ...number of literals in the above : 5254
% # Clause-clause subsumption calls (NU) : 249
% # Rec. Clause-clause subsumption calls : 234
% # Unit Clause-clause subsumption calls : 50
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1051
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 285 leaves, 2.48+/-2.384 terms/leaf
% # Paramod-from index: 106 leaves, 3.10+/-3.328 terms/leaf
% # Paramod-into index: 256 leaves, 2.54+/-2.417 terms/leaf
% # -------------------------------------------------
% # User time : 0.131 s
% # System time : 0.009 s
% # Total time : 0.140 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.31 CPU 0.36 WC
% FINAL PrfWatch: 0.31 CPU 0.36 WC
% SZS output end Solution for /tmp/SystemOnTPTP14899/SET016+4.tptp
%
%------------------------------------------------------------------------------