TSTP Solution File: SET689+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET689+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 : 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 : Wed Dec 29 23:30:01 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/SystemOnTPTP8753/SET689+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8753/SET689+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8753/SET689+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 8849
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(equal_set(X1,X2)<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_set)).
% fof(2, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset)).
% fof(12, conjecture,![X1]:![X2]:![X6]:(((subset(X1,X2)&subset(X2,X6))&subset(X6,X1))=>equal_set(X1,X6)),file('/tmp/SRASS.s.p', thI05)).
% fof(13, negated_conjecture,~(![X1]:![X2]:![X6]:(((subset(X1,X2)&subset(X2,X6))&subset(X6,X1))=>equal_set(X1,X6))),inference(assume_negation,[status(cth)],[12])).
% fof(16, plain,![X1]:![X2]:((~(equal_set(X1,X2))|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|equal_set(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(17, plain,![X3]:![X4]:((~(equal_set(X3,X4))|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|equal_set(X3,X4))),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X3]:![X4]:(((subset(X3,X4)|~(equal_set(X3,X4)))&(subset(X4,X3)|~(equal_set(X3,X4))))&((~(subset(X3,X4))|~(subset(X4,X3)))|equal_set(X3,X4))),inference(distribute,[status(thm)],[17])).
% cnf(19,plain,(equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[18])).
% fof(22, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(23, 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)],[22])).
% fof(24, 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)],[23])).
% fof(25, 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)],[24])).
% fof(26, 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)],[25])).
% cnf(27,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[26])).
% cnf(29,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(80, negated_conjecture,?[X1]:?[X2]:?[X6]:(((subset(X1,X2)&subset(X2,X6))&subset(X6,X1))&~(equal_set(X1,X6))),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X7]:?[X8]:?[X9]:(((subset(X7,X8)&subset(X8,X9))&subset(X9,X7))&~(equal_set(X7,X9))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,(((subset(esk4_0,esk5_0)&subset(esk5_0,esk6_0))&subset(esk6_0,esk4_0))&~(equal_set(esk4_0,esk6_0))),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(~equal_set(esk4_0,esk6_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,negated_conjecture,(subset(esk6_0,esk4_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(85,negated_conjecture,(subset(esk5_0,esk6_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(86,negated_conjecture,(subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(90,negated_conjecture,(~subset(esk6_0,esk4_0)|~subset(esk4_0,esk6_0)),inference(spm,[status(thm)],[83,19,theory(equality)])).
% cnf(93,negated_conjecture,($false|~subset(esk4_0,esk6_0)),inference(rw,[status(thm)],[90,84,theory(equality)])).
% cnf(94,negated_conjecture,(~subset(esk4_0,esk6_0)),inference(cn,[status(thm)],[93,theory(equality)])).
% cnf(109,negated_conjecture,(member(X1,esk6_0)|~member(X1,esk5_0)),inference(spm,[status(thm)],[29,85,theory(equality)])).
% cnf(110,negated_conjecture,(member(X1,esk5_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[29,86,theory(equality)])).
% cnf(191,negated_conjecture,(member(X1,esk6_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[109,110,theory(equality)])).
% cnf(213,negated_conjecture,(member(esk1_2(esk4_0,X1),esk6_0)|subset(esk4_0,X1)),inference(spm,[status(thm)],[191,28,theory(equality)])).
% cnf(216,negated_conjecture,(subset(esk4_0,esk6_0)),inference(spm,[status(thm)],[27,213,theory(equality)])).
% cnf(217,negated_conjecture,($false),inference(sr,[status(thm)],[216,94,theory(equality)])).
% cnf(218,negated_conjecture,($false),217,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 103
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 99
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 123
% # ...of the previous two non-trivial : 106
% # Contextual simplify-reflections : 0
% # Paramodulations : 120
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 63
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 37
% # Current number of unprocessed clauses: 69
% # ...number of literals in the above : 165
% # Clause-clause subsumption calls (NU) : 43
% # Rec. Clause-clause subsumption calls : 43
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 21
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 81 leaves, 1.35+/-0.670 terms/leaf
% # Paramod-from index: 29 leaves, 1.21+/-0.483 terms/leaf
% # Paramod-into index: 70 leaves, 1.30+/-0.544 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.003 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP8753/SET689+4.tptp
%
%------------------------------------------------------------------------------