TSTP Solution File: SET616+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET616+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 : 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 23:21:35 EST 2010
% Result : Theorem 1.11s
% Output : Solution 1.11s
% 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/SystemOnTPTP13109/SET616+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13109/SET616+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13109/SET616+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 13241
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),file('/tmp/SRASS.s.p', difference_defn)).
% fof(4, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_defn)).
% fof(6, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(7, conjecture,![X1]:![X2]:(difference(X1,X2)=difference(X2,X1)=>X1=X2),file('/tmp/SRASS.s.p', prove_th90)).
% fof(8, negated_conjecture,~(![X1]:![X2]:(difference(X1,X2)=difference(X2,X1)=>X1=X2)),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(10, plain,![X1]:![X2]:![X3]:((~(member(X3,difference(X1,X2)))|(member(X3,X1)&~(member(X3,X2))))&((~(member(X3,X1))|member(X3,X2))|member(X3,difference(X1,X2)))),inference(fof_nnf,[status(thm)],[9])).
% fof(11, plain,![X4]:![X5]:![X6]:((~(member(X6,difference(X4,X5)))|(member(X6,X4)&~(member(X6,X5))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(variable_rename,[status(thm)],[10])).
% fof(12, plain,![X4]:![X5]:![X6]:(((member(X6,X4)|~(member(X6,difference(X4,X5))))&(~(member(X6,X5))|~(member(X6,difference(X4,X5)))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(distribute,[status(thm)],[11])).
% cnf(13,plain,(member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[12])).
% cnf(14,plain,(~member(X1,difference(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[12])).
% cnf(15,plain,(member(X1,X2)|~member(X1,difference(X2,X3))),inference(split_conjunct,[status(thm)],[12])).
% fof(31, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[4])).
% fof(32, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[31])).
% fof(33, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[32])).
% cnf(34,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[33])).
% fof(39, 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)],[6])).
% fof(40, 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)],[39])).
% fof(41, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk3_2(X4,X5),X4)&~(member(esk3_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[40])).
% fof(42, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk3_2(X4,X5),X4)&~(member(esk3_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[41])).
% fof(43, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk3_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk3_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[42])).
% cnf(44,plain,(subset(X1,X2)|~member(esk3_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[43])).
% cnf(45,plain,(subset(X1,X2)|member(esk3_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(47, negated_conjecture,?[X1]:?[X2]:(difference(X1,X2)=difference(X2,X1)&~(X1=X2)),inference(fof_nnf,[status(thm)],[8])).
% fof(48, negated_conjecture,?[X3]:?[X4]:(difference(X3,X4)=difference(X4,X3)&~(X3=X4)),inference(variable_rename,[status(thm)],[47])).
% fof(49, negated_conjecture,(difference(esk4_0,esk5_0)=difference(esk5_0,esk4_0)&~(esk4_0=esk5_0)),inference(skolemize,[status(esa)],[48])).
% cnf(50,negated_conjecture,(esk4_0!=esk5_0),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,negated_conjecture,(difference(esk4_0,esk5_0)=difference(esk5_0,esk4_0)),inference(split_conjunct,[status(thm)],[49])).
% cnf(57,negated_conjecture,(~member(X1,difference(esk5_0,esk4_0))|~member(X1,esk5_0)),inference(spm,[status(thm)],[14,51,theory(equality)])).
% cnf(60,negated_conjecture,(member(X1,difference(esk5_0,esk4_0))|member(X1,esk5_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[13,51,theory(equality)])).
% cnf(83,negated_conjecture,(~member(X1,difference(esk5_0,esk4_0))),inference(csr,[status(thm)],[57,15])).
% cnf(89,negated_conjecture,(member(X1,esk4_0)|~member(X1,esk5_0)),inference(spm,[status(thm)],[83,13,theory(equality)])).
% cnf(92,negated_conjecture,(subset(X1,esk4_0)|~member(esk3_2(X1,esk4_0),esk5_0)),inference(spm,[status(thm)],[44,89,theory(equality)])).
% cnf(96,negated_conjecture,(member(X1,esk5_0)|~member(X1,esk4_0)),inference(sr,[status(thm)],[60,83,theory(equality)])).
% cnf(97,negated_conjecture,(member(esk3_2(esk4_0,X1),esk5_0)|subset(esk4_0,X1)),inference(spm,[status(thm)],[96,45,theory(equality)])).
% cnf(103,negated_conjecture,(subset(esk4_0,esk5_0)),inference(spm,[status(thm)],[44,97,theory(equality)])).
% cnf(104,negated_conjecture,(esk5_0=esk4_0|~subset(esk5_0,esk4_0)),inference(spm,[status(thm)],[34,103,theory(equality)])).
% cnf(106,negated_conjecture,(~subset(esk5_0,esk4_0)),inference(sr,[status(thm)],[104,50,theory(equality)])).
% cnf(140,negated_conjecture,(subset(esk5_0,esk4_0)),inference(spm,[status(thm)],[92,45,theory(equality)])).
% cnf(142,negated_conjecture,($false),inference(sr,[status(thm)],[140,106,theory(equality)])).
% cnf(143,negated_conjecture,($false),142,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 53
% # ...of these trivial : 1
% # ...subsumed : 5
% # ...remaining for further processing: 47
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 76
% # ...of the previous two non-trivial : 53
% # Contextual simplify-reflections : 2
% # Paramodulations : 70
% # Factorizations : 4
% # Equation resolutions : 2
% # Current number of processed clauses: 31
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 22
% # Current number of unprocessed clauses: 30
% # ...number of literals in the above : 78
% # Clause-clause subsumption calls (NU) : 28
% # Rec. Clause-clause subsumption calls : 28
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 42 leaves, 1.21+/-0.558 terms/leaf
% # Paramod-from index: 17 leaves, 1.12+/-0.322 terms/leaf
% # Paramod-into index: 37 leaves, 1.16+/-0.436 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.004 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP13109/SET616+3.tptp
%
%------------------------------------------------------------------------------