TSTP Solution File: SET047+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET047+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 22:58:09 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP29660/SET047+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29660/SET047+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29660/SET047+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 29792
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(set_equal(X1,X2)<=>![X3]:(element(X3,X1)<=>element(X3,X2))),file('/tmp/SRASS.s.p', pel43_1)).
% fof(2, conjecture,![X1]:![X2]:(set_equal(X1,X2)<=>set_equal(X2,X1)),file('/tmp/SRASS.s.p', pel43)).
% fof(3, negated_conjecture,~(![X1]:![X2]:(set_equal(X1,X2)<=>set_equal(X2,X1))),inference(assume_negation,[status(cth)],[2])).
% fof(4, plain,![X1]:![X2]:((~(set_equal(X1,X2))|![X3]:((~(element(X3,X1))|element(X3,X2))&(~(element(X3,X2))|element(X3,X1))))&(?[X3]:((~(element(X3,X1))|~(element(X3,X2)))&(element(X3,X1)|element(X3,X2)))|set_equal(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(5, plain,![X4]:![X5]:((~(set_equal(X4,X5))|![X6]:((~(element(X6,X4))|element(X6,X5))&(~(element(X6,X5))|element(X6,X4))))&(?[X7]:((~(element(X7,X4))|~(element(X7,X5)))&(element(X7,X4)|element(X7,X5)))|set_equal(X4,X5))),inference(variable_rename,[status(thm)],[4])).
% fof(6, plain,![X4]:![X5]:((~(set_equal(X4,X5))|![X6]:((~(element(X6,X4))|element(X6,X5))&(~(element(X6,X5))|element(X6,X4))))&(((~(element(esk1_2(X4,X5),X4))|~(element(esk1_2(X4,X5),X5)))&(element(esk1_2(X4,X5),X4)|element(esk1_2(X4,X5),X5)))|set_equal(X4,X5))),inference(skolemize,[status(esa)],[5])).
% fof(7, plain,![X4]:![X5]:![X6]:((((~(element(X6,X4))|element(X6,X5))&(~(element(X6,X5))|element(X6,X4)))|~(set_equal(X4,X5)))&(((~(element(esk1_2(X4,X5),X4))|~(element(esk1_2(X4,X5),X5)))&(element(esk1_2(X4,X5),X4)|element(esk1_2(X4,X5),X5)))|set_equal(X4,X5))),inference(shift_quantors,[status(thm)],[6])).
% fof(8, plain,![X4]:![X5]:![X6]:((((~(element(X6,X4))|element(X6,X5))|~(set_equal(X4,X5)))&((~(element(X6,X5))|element(X6,X4))|~(set_equal(X4,X5))))&(((~(element(esk1_2(X4,X5),X4))|~(element(esk1_2(X4,X5),X5)))|set_equal(X4,X5))&((element(esk1_2(X4,X5),X4)|element(esk1_2(X4,X5),X5))|set_equal(X4,X5)))),inference(distribute,[status(thm)],[7])).
% cnf(9,plain,(set_equal(X1,X2)|element(esk1_2(X1,X2),X2)|element(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[8])).
% cnf(10,plain,(set_equal(X1,X2)|~element(esk1_2(X1,X2),X2)|~element(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[8])).
% cnf(11,plain,(element(X3,X1)|~set_equal(X1,X2)|~element(X3,X2)),inference(split_conjunct,[status(thm)],[8])).
% cnf(12,plain,(element(X3,X2)|~set_equal(X1,X2)|~element(X3,X1)),inference(split_conjunct,[status(thm)],[8])).
% fof(13, negated_conjecture,?[X1]:?[X2]:((~(set_equal(X1,X2))|~(set_equal(X2,X1)))&(set_equal(X1,X2)|set_equal(X2,X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(14, negated_conjecture,?[X3]:?[X4]:((~(set_equal(X3,X4))|~(set_equal(X4,X3)))&(set_equal(X3,X4)|set_equal(X4,X3))),inference(variable_rename,[status(thm)],[13])).
% fof(15, negated_conjecture,((~(set_equal(esk2_0,esk3_0))|~(set_equal(esk3_0,esk2_0)))&(set_equal(esk2_0,esk3_0)|set_equal(esk3_0,esk2_0))),inference(skolemize,[status(esa)],[14])).
% cnf(16,negated_conjecture,(set_equal(esk3_0,esk2_0)|set_equal(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(17,negated_conjecture,(~set_equal(esk3_0,esk2_0)|~set_equal(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(19,negated_conjecture,(element(X1,esk3_0)|set_equal(esk3_0,esk2_0)|~element(X1,esk2_0)),inference(spm,[status(thm)],[12,16,theory(equality)])).
% cnf(20,negated_conjecture,(element(X1,esk2_0)|set_equal(esk3_0,esk2_0)|~element(X1,esk3_0)),inference(spm,[status(thm)],[11,16,theory(equality)])).
% cnf(25,negated_conjecture,(element(X1,esk3_0)|~element(X1,esk2_0)),inference(csr,[status(thm)],[19,11])).
% cnf(26,negated_conjecture,(element(esk1_2(X1,esk2_0),esk3_0)|element(esk1_2(X1,esk2_0),X1)|set_equal(X1,esk2_0)),inference(spm,[status(thm)],[25,9,theory(equality)])).
% cnf(27,negated_conjecture,(element(esk1_2(esk2_0,X1),esk3_0)|element(esk1_2(esk2_0,X1),X1)|set_equal(esk2_0,X1)),inference(spm,[status(thm)],[25,9,theory(equality)])).
% cnf(29,negated_conjecture,(element(X1,esk2_0)|~element(X1,esk3_0)),inference(csr,[status(thm)],[20,12])).
% cnf(30,negated_conjecture,(set_equal(X1,esk2_0)|~element(esk1_2(X1,esk2_0),X1)|~element(esk1_2(X1,esk2_0),esk3_0)),inference(spm,[status(thm)],[10,29,theory(equality)])).
% cnf(37,negated_conjecture,(element(esk1_2(esk3_0,esk2_0),esk3_0)|set_equal(esk3_0,esk2_0)),inference(ef,[status(thm)],[26,theory(equality)])).
% cnf(43,negated_conjecture,(element(esk1_2(esk2_0,esk3_0),esk3_0)|set_equal(esk2_0,esk3_0)),inference(ef,[status(thm)],[27,theory(equality)])).
% cnf(48,negated_conjecture,(set_equal(esk2_0,esk3_0)|~element(esk1_2(esk2_0,esk3_0),esk2_0)),inference(spm,[status(thm)],[10,43,theory(equality)])).
% cnf(49,negated_conjecture,(set_equal(esk2_0,esk3_0)|~element(esk1_2(esk2_0,esk3_0),esk3_0)),inference(spm,[status(thm)],[48,29,theory(equality)])).
% cnf(51,negated_conjecture,(set_equal(esk2_0,esk3_0)),inference(csr,[status(thm)],[49,43])).
% cnf(56,negated_conjecture,($false|~set_equal(esk3_0,esk2_0)),inference(rw,[status(thm)],[17,51,theory(equality)])).
% cnf(57,negated_conjecture,(~set_equal(esk3_0,esk2_0)),inference(cn,[status(thm)],[56,theory(equality)])).
% cnf(58,negated_conjecture,(element(esk1_2(esk3_0,esk2_0),esk3_0)),inference(sr,[status(thm)],[37,57,theory(equality)])).
% cnf(60,negated_conjecture,(set_equal(esk3_0,esk2_0)|~element(esk1_2(esk3_0,esk2_0),esk3_0)),inference(spm,[status(thm)],[30,58,theory(equality)])).
% cnf(62,negated_conjecture,(set_equal(esk3_0,esk2_0)|$false),inference(rw,[status(thm)],[60,58,theory(equality)])).
% cnf(63,negated_conjecture,(set_equal(esk3_0,esk2_0)),inference(cn,[status(thm)],[62,theory(equality)])).
% cnf(64,negated_conjecture,($false),inference(sr,[status(thm)],[63,57,theory(equality)])).
% cnf(65,negated_conjecture,($false),64,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 32
% # ...of these trivial : 0
% # ...subsumed : 6
% # ...remaining for further processing: 26
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 5
% # Generated clauses : 30
% # ...of the previous two non-trivial : 21
% # Contextual simplify-reflections : 5
% # Paramodulations : 23
% # Factorizations : 6
% # Equation resolutions : 0
% # Current number of processed clauses: 13
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 9
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 37
% # Rec. Clause-clause subsumption calls : 29
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 21 leaves, 1.24+/-0.683 terms/leaf
% # Paramod-from index: 9 leaves, 1.11+/-0.314 terms/leaf
% # Paramod-into index: 16 leaves, 1.19+/-0.527 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.003 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP29660/SET047+1.tptp
%
%------------------------------------------------------------------------------