TSTP Solution File: SET788+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET788+1 : TPTP v5.0.0. Released v3.1.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:07:20 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/SystemOnTPTP30069/SET788+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP30069/SET788+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30069/SET788+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 30165
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(![X1]:![X2]:(equalish(X1,X2)<=>![X3]:(a_member_of(X3,X1)<=>a_member_of(X3,X2)))=>![X1]:![X2]:(equalish(X1,X2)<=>equalish(X2,X1))),file('/tmp/SRASS.s.p', prove_this)).
% fof(2, negated_conjecture,~((![X1]:![X2]:(equalish(X1,X2)<=>![X3]:(a_member_of(X3,X1)<=>a_member_of(X3,X2)))=>![X1]:![X2]:(equalish(X1,X2)<=>equalish(X2,X1)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,(![X1]:![X2]:((~(equalish(X1,X2))|![X3]:((~(a_member_of(X3,X1))|a_member_of(X3,X2))&(~(a_member_of(X3,X2))|a_member_of(X3,X1))))&(?[X3]:((~(a_member_of(X3,X1))|~(a_member_of(X3,X2)))&(a_member_of(X3,X1)|a_member_of(X3,X2)))|equalish(X1,X2)))&?[X1]:?[X2]:((~(equalish(X1,X2))|~(equalish(X2,X1)))&(equalish(X1,X2)|equalish(X2,X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,(![X4]:![X5]:((~(equalish(X4,X5))|![X6]:((~(a_member_of(X6,X4))|a_member_of(X6,X5))&(~(a_member_of(X6,X5))|a_member_of(X6,X4))))&(?[X7]:((~(a_member_of(X7,X4))|~(a_member_of(X7,X5)))&(a_member_of(X7,X4)|a_member_of(X7,X5)))|equalish(X4,X5)))&?[X8]:?[X9]:((~(equalish(X8,X9))|~(equalish(X9,X8)))&(equalish(X8,X9)|equalish(X9,X8)))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,(![X4]:![X5]:((~(equalish(X4,X5))|![X6]:((~(a_member_of(X6,X4))|a_member_of(X6,X5))&(~(a_member_of(X6,X5))|a_member_of(X6,X4))))&(((~(a_member_of(esk1_2(X4,X5),X4))|~(a_member_of(esk1_2(X4,X5),X5)))&(a_member_of(esk1_2(X4,X5),X4)|a_member_of(esk1_2(X4,X5),X5)))|equalish(X4,X5)))&((~(equalish(esk2_0,esk3_0))|~(equalish(esk3_0,esk2_0)))&(equalish(esk2_0,esk3_0)|equalish(esk3_0,esk2_0)))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X4]:![X5]:![X6]:(((((~(a_member_of(X6,X4))|a_member_of(X6,X5))&(~(a_member_of(X6,X5))|a_member_of(X6,X4)))|~(equalish(X4,X5)))&(((~(a_member_of(esk1_2(X4,X5),X4))|~(a_member_of(esk1_2(X4,X5),X5)))&(a_member_of(esk1_2(X4,X5),X4)|a_member_of(esk1_2(X4,X5),X5)))|equalish(X4,X5)))&((~(equalish(esk2_0,esk3_0))|~(equalish(esk3_0,esk2_0)))&(equalish(esk2_0,esk3_0)|equalish(esk3_0,esk2_0)))),inference(shift_quantors,[status(thm)],[5])).
% fof(7, negated_conjecture,![X4]:![X5]:![X6]:(((((~(a_member_of(X6,X4))|a_member_of(X6,X5))|~(equalish(X4,X5)))&((~(a_member_of(X6,X5))|a_member_of(X6,X4))|~(equalish(X4,X5))))&(((~(a_member_of(esk1_2(X4,X5),X4))|~(a_member_of(esk1_2(X4,X5),X5)))|equalish(X4,X5))&((a_member_of(esk1_2(X4,X5),X4)|a_member_of(esk1_2(X4,X5),X5))|equalish(X4,X5))))&((~(equalish(esk2_0,esk3_0))|~(equalish(esk3_0,esk2_0)))&(equalish(esk2_0,esk3_0)|equalish(esk3_0,esk2_0)))),inference(distribute,[status(thm)],[6])).
% cnf(8,negated_conjecture,(equalish(esk3_0,esk2_0)|equalish(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,negated_conjecture,(~equalish(esk3_0,esk2_0)|~equalish(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(10,negated_conjecture,(equalish(X1,X2)|a_member_of(esk1_2(X1,X2),X2)|a_member_of(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(11,negated_conjecture,(equalish(X1,X2)|~a_member_of(esk1_2(X1,X2),X2)|~a_member_of(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(12,negated_conjecture,(a_member_of(X3,X1)|~equalish(X1,X2)|~a_member_of(X3,X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(13,negated_conjecture,(a_member_of(X3,X2)|~equalish(X1,X2)|~a_member_of(X3,X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(15,negated_conjecture,(a_member_of(X1,esk3_0)|equalish(esk3_0,esk2_0)|~a_member_of(X1,esk2_0)),inference(spm,[status(thm)],[13,8,theory(equality)])).
% cnf(16,negated_conjecture,(a_member_of(X1,esk2_0)|equalish(esk3_0,esk2_0)|~a_member_of(X1,esk3_0)),inference(spm,[status(thm)],[12,8,theory(equality)])).
% cnf(20,negated_conjecture,(a_member_of(X1,esk3_0)|~a_member_of(X1,esk2_0)),inference(csr,[status(thm)],[15,12])).
% cnf(21,negated_conjecture,(a_member_of(esk1_2(X1,esk2_0),esk3_0)|a_member_of(esk1_2(X1,esk2_0),X1)|equalish(X1,esk2_0)),inference(spm,[status(thm)],[20,10,theory(equality)])).
% cnf(22,negated_conjecture,(a_member_of(esk1_2(esk2_0,X1),esk3_0)|a_member_of(esk1_2(esk2_0,X1),X1)|equalish(esk2_0,X1)),inference(spm,[status(thm)],[20,10,theory(equality)])).
% cnf(23,negated_conjecture,(a_member_of(X1,esk2_0)|~a_member_of(X1,esk3_0)),inference(csr,[status(thm)],[16,13])).
% cnf(24,negated_conjecture,(equalish(X1,esk2_0)|~a_member_of(esk1_2(X1,esk2_0),X1)|~a_member_of(esk1_2(X1,esk2_0),esk3_0)),inference(spm,[status(thm)],[11,23,theory(equality)])).
% cnf(28,negated_conjecture,(a_member_of(esk1_2(esk3_0,esk2_0),esk3_0)|equalish(esk3_0,esk2_0)),inference(ef,[status(thm)],[21,theory(equality)])).
% cnf(38,negated_conjecture,(a_member_of(esk1_2(esk2_0,esk3_0),esk3_0)|equalish(esk2_0,esk3_0)),inference(ef,[status(thm)],[22,theory(equality)])).
% cnf(43,negated_conjecture,(equalish(esk2_0,esk3_0)|~a_member_of(esk1_2(esk2_0,esk3_0),esk2_0)),inference(spm,[status(thm)],[11,38,theory(equality)])).
% cnf(44,negated_conjecture,(equalish(esk3_0,esk2_0)|~a_member_of(esk1_2(esk3_0,esk2_0),esk3_0)),inference(spm,[status(thm)],[24,28,theory(equality)])).
% cnf(46,negated_conjecture,(equalish(esk2_0,esk3_0)|~a_member_of(esk1_2(esk2_0,esk3_0),esk3_0)),inference(spm,[status(thm)],[43,23,theory(equality)])).
% cnf(48,negated_conjecture,(equalish(esk3_0,esk2_0)),inference(csr,[status(thm)],[44,28])).
% cnf(52,negated_conjecture,(~equalish(esk2_0,esk3_0)|$false),inference(rw,[status(thm)],[9,48,theory(equality)])).
% cnf(53,negated_conjecture,(~equalish(esk2_0,esk3_0)),inference(cn,[status(thm)],[52,theory(equality)])).
% cnf(55,negated_conjecture,(a_member_of(esk1_2(esk2_0,esk3_0),esk3_0)),inference(sr,[status(thm)],[38,53,theory(equality)])).
% cnf(58,negated_conjecture,(equalish(esk2_0,esk3_0)|$false),inference(rw,[status(thm)],[46,55,theory(equality)])).
% cnf(59,negated_conjecture,(equalish(esk2_0,esk3_0)),inference(cn,[status(thm)],[58,theory(equality)])).
% cnf(60,negated_conjecture,($false),inference(sr,[status(thm)],[59,53,theory(equality)])).
% cnf(61,negated_conjecture,($false),60,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 34
% # ...of these trivial : 1
% # ...subsumed : 6
% # ...remaining for further processing: 27
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 31
% # ...of the previous two non-trivial : 25
% # Contextual simplify-reflections : 4
% # Paramodulations : 24
% # Factorizations : 6
% # Equation resolutions : 0
% # Current number of processed clauses: 14
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 10
% # Current number of unprocessed clauses: 3
% # ...number of literals in the above : 6
% # Clause-clause subsumption calls (NU) : 37
% # Rec. Clause-clause subsumption calls : 31
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 22 leaves, 1.23+/-0.670 terms/leaf
% # Paramod-from index: 9 leaves, 1.11+/-0.314 terms/leaf
% # Paramod-into index: 17 leaves, 1.18+/-0.513 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.003 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP30069/SET788+1.tptp
%
%------------------------------------------------------------------------------