TSTP Solution File: SET679+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET679+3 : 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:28:19 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.92s
% 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/SystemOnTPTP7680/SET679+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7680/SET679+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7680/SET679+3.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 7776
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:ilf_type(X1,set_type),file('/tmp/SRASS.s.p', p22)).
% fof(3, axiom,![X1]:(ilf_type(X1,set_type)=>~(member(X1,empty_set))),file('/tmp/SRASS.s.p', p2)).
% fof(4, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>(not_equal(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', p7)).
% fof(5, axiom,![X1]:(ilf_type(X1,set_type)=>(empty(X1)<=>![X2]:(ilf_type(X2,set_type)=>~(member(X2,X1))))),file('/tmp/SRASS.s.p', p8)).
% fof(13, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>(member(X2,X1)<=>member(ordered_pair(X2,X2),identity_relation_of(X1))))),file('/tmp/SRASS.s.p', p1)).
% fof(24, conjecture,![X1]:((~(empty(X1))&ilf_type(X1,set_type))=>not_equal(identity_relation_of(X1),empty_set)),file('/tmp/SRASS.s.p', prove_relset_1_46)).
% fof(25, negated_conjecture,~(![X1]:((~(empty(X1))&ilf_type(X1,set_type))=>not_equal(identity_relation_of(X1),empty_set))),inference(assume_negation,[status(cth)],[24])).
% fof(26, plain,![X1]:(ilf_type(X1,set_type)=>~(member(X1,empty_set))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(27, plain,![X1]:(ilf_type(X1,set_type)=>(empty(X1)<=>![X2]:(ilf_type(X2,set_type)=>~(member(X2,X1))))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(31, negated_conjecture,~(![X1]:((~(empty(X1))&ilf_type(X1,set_type))=>not_equal(identity_relation_of(X1),empty_set))),inference(fof_simplification,[status(thm)],[25,theory(equality)])).
% fof(33, plain,![X2]:ilf_type(X2,set_type),inference(variable_rename,[status(thm)],[2])).
% cnf(34,plain,(ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X1]:(~(ilf_type(X1,set_type))|~(member(X1,empty_set))),inference(fof_nnf,[status(thm)],[26])).
% fof(36, plain,![X2]:(~(ilf_type(X2,set_type))|~(member(X2,empty_set))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(~member(X1,empty_set)|~ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|((~(not_equal(X1,X2))|~(X1=X2))&(X1=X2|not_equal(X1,X2))))),inference(fof_nnf,[status(thm)],[4])).
% fof(39, plain,![X3]:(~(ilf_type(X3,set_type))|![X4]:(~(ilf_type(X4,set_type))|((~(not_equal(X3,X4))|~(X3=X4))&(X3=X4|not_equal(X3,X4))))),inference(variable_rename,[status(thm)],[38])).
% fof(40, plain,![X3]:![X4]:((~(ilf_type(X4,set_type))|((~(not_equal(X3,X4))|~(X3=X4))&(X3=X4|not_equal(X3,X4))))|~(ilf_type(X3,set_type))),inference(shift_quantors,[status(thm)],[39])).
% fof(41, plain,![X3]:![X4]:((((~(not_equal(X3,X4))|~(X3=X4))|~(ilf_type(X4,set_type)))|~(ilf_type(X3,set_type)))&(((X3=X4|not_equal(X3,X4))|~(ilf_type(X4,set_type)))|~(ilf_type(X3,set_type)))),inference(distribute,[status(thm)],[40])).
% cnf(42,plain,(not_equal(X1,X2)|X1=X2|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)),inference(split_conjunct,[status(thm)],[41])).
% fof(44, plain,![X1]:(~(ilf_type(X1,set_type))|((~(empty(X1))|![X2]:(~(ilf_type(X2,set_type))|~(member(X2,X1))))&(?[X2]:(ilf_type(X2,set_type)&member(X2,X1))|empty(X1)))),inference(fof_nnf,[status(thm)],[27])).
% fof(45, plain,![X3]:(~(ilf_type(X3,set_type))|((~(empty(X3))|![X4]:(~(ilf_type(X4,set_type))|~(member(X4,X3))))&(?[X5]:(ilf_type(X5,set_type)&member(X5,X3))|empty(X3)))),inference(variable_rename,[status(thm)],[44])).
% fof(46, plain,![X3]:(~(ilf_type(X3,set_type))|((~(empty(X3))|![X4]:(~(ilf_type(X4,set_type))|~(member(X4,X3))))&((ilf_type(esk1_1(X3),set_type)&member(esk1_1(X3),X3))|empty(X3)))),inference(skolemize,[status(esa)],[45])).
% fof(47, plain,![X3]:![X4]:((((~(ilf_type(X4,set_type))|~(member(X4,X3)))|~(empty(X3)))&((ilf_type(esk1_1(X3),set_type)&member(esk1_1(X3),X3))|empty(X3)))|~(ilf_type(X3,set_type))),inference(shift_quantors,[status(thm)],[46])).
% fof(48, plain,![X3]:![X4]:((((~(ilf_type(X4,set_type))|~(member(X4,X3)))|~(empty(X3)))|~(ilf_type(X3,set_type)))&(((ilf_type(esk1_1(X3),set_type)|empty(X3))|~(ilf_type(X3,set_type)))&((member(esk1_1(X3),X3)|empty(X3))|~(ilf_type(X3,set_type))))),inference(distribute,[status(thm)],[47])).
% cnf(49,plain,(empty(X1)|member(esk1_1(X1),X1)|~ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[48])).
% fof(75, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|((~(member(X2,X1))|member(ordered_pair(X2,X2),identity_relation_of(X1)))&(~(member(ordered_pair(X2,X2),identity_relation_of(X1)))|member(X2,X1))))),inference(fof_nnf,[status(thm)],[13])).
% fof(76, plain,![X3]:(~(ilf_type(X3,set_type))|![X4]:(~(ilf_type(X4,set_type))|((~(member(X4,X3))|member(ordered_pair(X4,X4),identity_relation_of(X3)))&(~(member(ordered_pair(X4,X4),identity_relation_of(X3)))|member(X4,X3))))),inference(variable_rename,[status(thm)],[75])).
% fof(77, plain,![X3]:![X4]:((~(ilf_type(X4,set_type))|((~(member(X4,X3))|member(ordered_pair(X4,X4),identity_relation_of(X3)))&(~(member(ordered_pair(X4,X4),identity_relation_of(X3)))|member(X4,X3))))|~(ilf_type(X3,set_type))),inference(shift_quantors,[status(thm)],[76])).
% fof(78, plain,![X3]:![X4]:((((~(member(X4,X3))|member(ordered_pair(X4,X4),identity_relation_of(X3)))|~(ilf_type(X4,set_type)))|~(ilf_type(X3,set_type)))&(((~(member(ordered_pair(X4,X4),identity_relation_of(X3)))|member(X4,X3))|~(ilf_type(X4,set_type)))|~(ilf_type(X3,set_type)))),inference(distribute,[status(thm)],[77])).
% cnf(80,plain,(member(ordered_pair(X2,X2),identity_relation_of(X1))|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~member(X2,X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(148, negated_conjecture,?[X1]:((~(empty(X1))&ilf_type(X1,set_type))&~(not_equal(identity_relation_of(X1),empty_set))),inference(fof_nnf,[status(thm)],[31])).
% fof(149, negated_conjecture,?[X2]:((~(empty(X2))&ilf_type(X2,set_type))&~(not_equal(identity_relation_of(X2),empty_set))),inference(variable_rename,[status(thm)],[148])).
% fof(150, negated_conjecture,((~(empty(esk10_0))&ilf_type(esk10_0,set_type))&~(not_equal(identity_relation_of(esk10_0),empty_set))),inference(skolemize,[status(esa)],[149])).
% cnf(151,negated_conjecture,(~not_equal(identity_relation_of(esk10_0),empty_set)),inference(split_conjunct,[status(thm)],[150])).
% cnf(153,negated_conjecture,(~empty(esk10_0)),inference(split_conjunct,[status(thm)],[150])).
% cnf(157,plain,($false|~member(X1,empty_set)),inference(rw,[status(thm)],[37,34,theory(equality)])).
% cnf(158,plain,(~member(X1,empty_set)),inference(cn,[status(thm)],[157,theory(equality)])).
% cnf(178,plain,(X1=X2|not_equal(X1,X2)|$false|~ilf_type(X1,set_type)),inference(rw,[status(thm)],[42,34,theory(equality)])).
% cnf(179,plain,(X1=X2|not_equal(X1,X2)|$false|$false),inference(rw,[status(thm)],[178,34,theory(equality)])).
% cnf(180,plain,(X1=X2|not_equal(X1,X2)),inference(cn,[status(thm)],[179,theory(equality)])).
% cnf(185,plain,(empty(X1)|member(esk1_1(X1),X1)|$false),inference(rw,[status(thm)],[49,34,theory(equality)])).
% cnf(186,plain,(empty(X1)|member(esk1_1(X1),X1)),inference(cn,[status(thm)],[185,theory(equality)])).
% cnf(227,plain,(member(ordered_pair(X2,X2),identity_relation_of(X1))|~member(X2,X1)|$false|~ilf_type(X1,set_type)),inference(rw,[status(thm)],[80,34,theory(equality)])).
% cnf(228,plain,(member(ordered_pair(X2,X2),identity_relation_of(X1))|~member(X2,X1)|$false|$false),inference(rw,[status(thm)],[227,34,theory(equality)])).
% cnf(229,plain,(member(ordered_pair(X2,X2),identity_relation_of(X1))|~member(X2,X1)),inference(cn,[status(thm)],[228,theory(equality)])).
% cnf(276,negated_conjecture,(identity_relation_of(esk10_0)=empty_set),inference(spm,[status(thm)],[151,180,theory(equality)])).
% cnf(315,negated_conjecture,(member(ordered_pair(X1,X1),empty_set)|~member(X1,esk10_0)),inference(spm,[status(thm)],[229,276,theory(equality)])).
% cnf(319,negated_conjecture,(~member(X1,esk10_0)),inference(sr,[status(thm)],[315,158,theory(equality)])).
% cnf(330,negated_conjecture,(empty(esk10_0)),inference(spm,[status(thm)],[319,186,theory(equality)])).
% cnf(331,negated_conjecture,($false),inference(sr,[status(thm)],[330,153,theory(equality)])).
% cnf(332,negated_conjecture,($false),331,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 91
% # ...of these trivial : 10
% # ...subsumed : 3
% # ...remaining for further processing: 78
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 2
% # Generated clauses : 49
% # ...of the previous two non-trivial : 39
% # Contextual simplify-reflections : 1
% # Paramodulations : 45
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 39
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 24
% # Current number of unprocessed clauses: 28
% # ...number of literals in the above : 64
% # Clause-clause subsumption calls (NU) : 12
% # Rec. Clause-clause subsumption calls : 12
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 53 leaves, 1.32+/-0.667 terms/leaf
% # Paramod-from index: 21 leaves, 1.05+/-0.213 terms/leaf
% # Paramod-into index: 50 leaves, 1.24+/-0.618 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.001 s
% # Total time : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.19 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP7680/SET679+3.tptp
%
%------------------------------------------------------------------------------