TSTP Solution File: SET355+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET355+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 : art02.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:09:20 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/SystemOnTPTP28434/SET355+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP28434/SET355+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28434/SET355+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 28530
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset)).
% fof(2, axiom,![X3]:![X1]:(member(X3,sum(X1))<=>?[X4]:(member(X4,X1)&member(X3,X4))),file('/tmp/SRASS.s.p', sum)).
% fof(12, conjecture,![X1]:![X3]:(member(X3,X1)=>subset(X3,sum(X1))),file('/tmp/SRASS.s.p', thI43)).
% fof(13, negated_conjecture,~(![X1]:![X3]:(member(X3,X1)=>subset(X3,sum(X1)))),inference(assume_negation,[status(cth)],[12])).
% fof(16, 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)],[1])).
% fof(17, 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)],[16])).
% fof(18, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[17])).
% fof(19, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[19])).
% cnf(21,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(24, plain,![X3]:![X1]:((~(member(X3,sum(X1)))|?[X4]:(member(X4,X1)&member(X3,X4)))&(![X4]:(~(member(X4,X1))|~(member(X3,X4)))|member(X3,sum(X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(25, plain,![X5]:![X6]:((~(member(X5,sum(X6)))|?[X7]:(member(X7,X6)&member(X5,X7)))&(![X8]:(~(member(X8,X6))|~(member(X5,X8)))|member(X5,sum(X6)))),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X5]:![X6]:((~(member(X5,sum(X6)))|(member(esk2_2(X5,X6),X6)&member(X5,esk2_2(X5,X6))))&(![X8]:(~(member(X8,X6))|~(member(X5,X8)))|member(X5,sum(X6)))),inference(skolemize,[status(esa)],[25])).
% fof(27, plain,![X5]:![X6]:![X8]:(((~(member(X8,X6))|~(member(X5,X8)))|member(X5,sum(X6)))&(~(member(X5,sum(X6)))|(member(esk2_2(X5,X6),X6)&member(X5,esk2_2(X5,X6))))),inference(shift_quantors,[status(thm)],[26])).
% fof(28, plain,![X5]:![X6]:![X8]:(((~(member(X8,X6))|~(member(X5,X8)))|member(X5,sum(X6)))&((member(esk2_2(X5,X6),X6)|~(member(X5,sum(X6))))&(member(X5,esk2_2(X5,X6))|~(member(X5,sum(X6)))))),inference(distribute,[status(thm)],[27])).
% cnf(31,plain,(member(X1,sum(X2))|~member(X1,X3)|~member(X3,X2)),inference(split_conjunct,[status(thm)],[28])).
% fof(80, negated_conjecture,?[X1]:?[X3]:(member(X3,X1)&~(subset(X3,sum(X1)))),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X4]:?[X5]:(member(X5,X4)&~(subset(X5,sum(X4)))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,(member(esk5_0,esk4_0)&~(subset(esk5_0,sum(esk4_0)))),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(~subset(esk5_0,sum(esk4_0))),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,negated_conjecture,(member(esk5_0,esk4_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(94,negated_conjecture,(member(esk1_2(esk5_0,sum(esk4_0)),esk5_0)),inference(spm,[status(thm)],[83,22,theory(equality)])).
% cnf(96,negated_conjecture,(~member(esk1_2(esk5_0,sum(esk4_0)),sum(esk4_0))),inference(spm,[status(thm)],[83,21,theory(equality)])).
% cnf(103,negated_conjecture,(member(X1,sum(esk4_0))|~member(X1,esk5_0)),inference(spm,[status(thm)],[31,84,theory(equality)])).
% cnf(138,negated_conjecture,(member(esk1_2(esk5_0,sum(esk4_0)),sum(esk4_0))),inference(spm,[status(thm)],[103,94,theory(equality)])).
% cnf(143,negated_conjecture,($false),inference(rw,[status(thm)],[96,138,theory(equality)])).
% cnf(144,negated_conjecture,($false),inference(cn,[status(thm)],[143,theory(equality)])).
% cnf(145,negated_conjecture,($false),144,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 75
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 74
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 58
% # ...of the previous two non-trivial : 50
% # Contextual simplify-reflections : 0
% # Paramodulations : 55
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 39
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 26
% # Current number of unprocessed clauses: 37
% # ...number of literals in the above : 92
% # Clause-clause subsumption calls (NU) : 26
% # Rec. Clause-clause subsumption calls : 26
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 48 leaves, 1.35+/-0.692 terms/leaf
% # Paramod-from index: 12 leaves, 1.08+/-0.276 terms/leaf
% # Paramod-into index: 38 leaves, 1.26+/-0.593 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.004 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP28434/SET355+4.tptp
%
%------------------------------------------------------------------------------