TSTP Solution File: SET347+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET347+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:08:57 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP26902/SET347+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP26902/SET347+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26902/SET347+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 26998
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set)).
% fof(2, axiom,![X1]:![X2]:(member(X1,sum(X2))<=>?[X3]:(member(X3,X2)&member(X1,X3))),file('/tmp/SRASS.s.p', sum)).
% fof(3, axiom,![X2]:![X4]:(equal_set(X2,X4)<=>(subset(X2,X4)&subset(X4,X2))),file('/tmp/SRASS.s.p', equal_set)).
% fof(4, axiom,![X2]:![X4]:(subset(X2,X4)<=>![X1]:(member(X1,X2)=>member(X1,X4))),file('/tmp/SRASS.s.p', subset)).
% fof(12, conjecture,equal_set(sum(empty_set),empty_set),file('/tmp/SRASS.s.p', thI38)).
% fof(13, negated_conjecture,~(equal_set(sum(empty_set),empty_set)),inference(assume_negation,[status(cth)],[12])).
% fof(14, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(16, negated_conjecture,~(equal_set(sum(empty_set),empty_set)),inference(fof_simplification,[status(thm)],[13,theory(equality)])).
% fof(17, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[14])).
% cnf(18,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,![X1]:![X2]:((~(member(X1,sum(X2)))|?[X3]:(member(X3,X2)&member(X1,X3)))&(![X3]:(~(member(X3,X2))|~(member(X1,X3)))|member(X1,sum(X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(20, plain,![X4]:![X5]:((~(member(X4,sum(X5)))|?[X6]:(member(X6,X5)&member(X4,X6)))&(![X7]:(~(member(X7,X5))|~(member(X4,X7)))|member(X4,sum(X5)))),inference(variable_rename,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:((~(member(X4,sum(X5)))|(member(esk1_2(X4,X5),X5)&member(X4,esk1_2(X4,X5))))&(![X7]:(~(member(X7,X5))|~(member(X4,X7)))|member(X4,sum(X5)))),inference(skolemize,[status(esa)],[20])).
% fof(22, plain,![X4]:![X5]:![X7]:(((~(member(X7,X5))|~(member(X4,X7)))|member(X4,sum(X5)))&(~(member(X4,sum(X5)))|(member(esk1_2(X4,X5),X5)&member(X4,esk1_2(X4,X5))))),inference(shift_quantors,[status(thm)],[21])).
% fof(23, plain,![X4]:![X5]:![X7]:(((~(member(X7,X5))|~(member(X4,X7)))|member(X4,sum(X5)))&((member(esk1_2(X4,X5),X5)|~(member(X4,sum(X5))))&(member(X4,esk1_2(X4,X5))|~(member(X4,sum(X5)))))),inference(distribute,[status(thm)],[22])).
% cnf(25,plain,(member(esk1_2(X1,X2),X2)|~member(X1,sum(X2))),inference(split_conjunct,[status(thm)],[23])).
% fof(27, plain,![X2]:![X4]:((~(equal_set(X2,X4))|(subset(X2,X4)&subset(X4,X2)))&((~(subset(X2,X4))|~(subset(X4,X2)))|equal_set(X2,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(28, plain,![X5]:![X6]:((~(equal_set(X5,X6))|(subset(X5,X6)&subset(X6,X5)))&((~(subset(X5,X6))|~(subset(X6,X5)))|equal_set(X5,X6))),inference(variable_rename,[status(thm)],[27])).
% fof(29, plain,![X5]:![X6]:(((subset(X5,X6)|~(equal_set(X5,X6)))&(subset(X6,X5)|~(equal_set(X5,X6))))&((~(subset(X5,X6))|~(subset(X6,X5)))|equal_set(X5,X6))),inference(distribute,[status(thm)],[28])).
% cnf(30,plain,(equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[29])).
% fof(33, plain,![X2]:![X4]:((~(subset(X2,X4))|![X1]:(~(member(X1,X2))|member(X1,X4)))&(?[X1]:(member(X1,X2)&~(member(X1,X4)))|subset(X2,X4))),inference(fof_nnf,[status(thm)],[4])).
% fof(34, plain,![X5]:![X6]:((~(subset(X5,X6))|![X7]:(~(member(X7,X5))|member(X7,X6)))&(?[X8]:(member(X8,X5)&~(member(X8,X6)))|subset(X5,X6))),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X5]:![X6]:((~(subset(X5,X6))|![X7]:(~(member(X7,X5))|member(X7,X6)))&((member(esk2_2(X5,X6),X5)&~(member(esk2_2(X5,X6),X6)))|subset(X5,X6))),inference(skolemize,[status(esa)],[34])).
% fof(36, plain,![X5]:![X6]:![X7]:(((~(member(X7,X5))|member(X7,X6))|~(subset(X5,X6)))&((member(esk2_2(X5,X6),X5)&~(member(esk2_2(X5,X6),X6)))|subset(X5,X6))),inference(shift_quantors,[status(thm)],[35])).
% fof(37, plain,![X5]:![X6]:![X7]:(((~(member(X7,X5))|member(X7,X6))|~(subset(X5,X6)))&((member(esk2_2(X5,X6),X5)|subset(X5,X6))&(~(member(esk2_2(X5,X6),X6))|subset(X5,X6)))),inference(distribute,[status(thm)],[36])).
% cnf(39,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[37])).
% cnf(81,negated_conjecture,(~equal_set(sum(empty_set),empty_set)),inference(split_conjunct,[status(thm)],[16])).
% cnf(85,negated_conjecture,(~subset(empty_set,sum(empty_set))|~subset(sum(empty_set),empty_set)),inference(spm,[status(thm)],[81,30,theory(equality)])).
% cnf(91,plain,(subset(empty_set,X1)),inference(spm,[status(thm)],[18,39,theory(equality)])).
% cnf(100,plain,(member(esk1_2(esk2_2(sum(X1),X2),X1),X1)|subset(sum(X1),X2)),inference(spm,[status(thm)],[25,39,theory(equality)])).
% cnf(155,negated_conjecture,($false|~subset(sum(empty_set),empty_set)),inference(rw,[status(thm)],[85,91,theory(equality)])).
% cnf(156,negated_conjecture,(~subset(sum(empty_set),empty_set)),inference(cn,[status(thm)],[155,theory(equality)])).
% cnf(524,plain,(subset(sum(empty_set),X1)),inference(spm,[status(thm)],[18,100,theory(equality)])).
% cnf(528,negated_conjecture,($false),inference(rw,[status(thm)],[156,524,theory(equality)])).
% cnf(529,negated_conjecture,($false),inference(cn,[status(thm)],[528,theory(equality)])).
% cnf(530,negated_conjecture,($false),529,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 163
% # ...of these trivial : 0
% # ...subsumed : 10
% # ...remaining for further processing: 153
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 397
% # ...of the previous two non-trivial : 339
% # Contextual simplify-reflections : 0
% # Paramodulations : 390
% # Factorizations : 2
% # Equation resolutions : 5
% # Current number of processed clauses: 117
% # Positive orientable unit clauses: 72
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 43
% # Current number of unprocessed clauses: 221
% # ...number of literals in the above : 442
% # Clause-clause subsumption calls (NU) : 62
% # Rec. Clause-clause subsumption calls : 62
% # Unit Clause-clause subsumption calls : 30
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 105
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 125 leaves, 1.56+/-1.091 terms/leaf
% # Paramod-from index: 60 leaves, 1.50+/-1.162 terms/leaf
% # Paramod-into index: 118 leaves, 1.52+/-1.056 terms/leaf
% # -------------------------------------------------
% # User time : 0.027 s
% # System time : 0.004 s
% # Total time : 0.031 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP26902/SET347+4.tptp
%
%------------------------------------------------------------------------------