TSTP Solution File: SET162+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET162+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 : art07.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:06:05 EST 2010
% Result : Theorem 2.42s
% Output : Solution 2.42s
% 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/SystemOnTPTP24777/SET162+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24777/SET162+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24777/SET162+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 24873
% 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]:![X2]:![X3]:(member(X1,union(X2,X3))<=>(member(X1,X2)|member(X1,X3))),file('/tmp/SRASS.s.p', union)).
% fof(2, axiom,![X1]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set)).
% fof(3, axiom,![X2]:![X3]:(equal_set(X2,X3)<=>(subset(X2,X3)&subset(X3,X2))),file('/tmp/SRASS.s.p', equal_set)).
% fof(4, axiom,![X2]:![X3]:(subset(X2,X3)<=>![X1]:(member(X1,X2)=>member(X1,X3))),file('/tmp/SRASS.s.p', subset)).
% fof(12, conjecture,![X2]:equal_set(union(X2,empty_set),X2),file('/tmp/SRASS.s.p', thI18)).
% fof(13, negated_conjecture,~(![X2]:equal_set(union(X2,empty_set),X2)),inference(assume_negation,[status(cth)],[12])).
% fof(14, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(16, plain,![X1]:![X2]:![X3]:((~(member(X1,union(X2,X3)))|(member(X1,X2)|member(X1,X3)))&((~(member(X1,X2))&~(member(X1,X3)))|member(X1,union(X2,X3)))),inference(fof_nnf,[status(thm)],[1])).
% fof(17, plain,![X4]:![X5]:![X6]:((~(member(X4,union(X5,X6)))|(member(X4,X5)|member(X4,X6)))&((~(member(X4,X5))&~(member(X4,X6)))|member(X4,union(X5,X6)))),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X4]:![X5]:![X6]:((~(member(X4,union(X5,X6)))|(member(X4,X5)|member(X4,X6)))&((~(member(X4,X5))|member(X4,union(X5,X6)))&(~(member(X4,X6))|member(X4,union(X5,X6))))),inference(distribute,[status(thm)],[17])).
% cnf(20,plain,(member(X1,union(X2,X3))|~member(X1,X2)),inference(split_conjunct,[status(thm)],[18])).
% cnf(21,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))),inference(split_conjunct,[status(thm)],[18])).
% fof(22, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[14])).
% cnf(23,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X2]:![X3]:((~(equal_set(X2,X3))|(subset(X2,X3)&subset(X3,X2)))&((~(subset(X2,X3))|~(subset(X3,X2)))|equal_set(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(25, plain,![X4]:![X5]:((~(equal_set(X4,X5))|(subset(X4,X5)&subset(X5,X4)))&((~(subset(X4,X5))|~(subset(X5,X4)))|equal_set(X4,X5))),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:(((subset(X4,X5)|~(equal_set(X4,X5)))&(subset(X5,X4)|~(equal_set(X4,X5))))&((~(subset(X4,X5))|~(subset(X5,X4)))|equal_set(X4,X5))),inference(distribute,[status(thm)],[25])).
% cnf(27,plain,(equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[26])).
% fof(30, plain,![X2]:![X3]:((~(subset(X2,X3))|![X1]:(~(member(X1,X2))|member(X1,X3)))&(?[X1]:(member(X1,X2)&~(member(X1,X3)))|subset(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(31, 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)],[30])).
% fof(32, 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)],[31])).
% fof(33, 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)],[32])).
% fof(34, 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)],[33])).
% cnf(35,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[34])).
% cnf(36,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(80, negated_conjecture,?[X2]:~(equal_set(union(X2,empty_set),X2)),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X3]:~(equal_set(union(X3,empty_set),X3)),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,~(equal_set(union(esk4_0,empty_set),esk4_0)),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(~equal_set(union(esk4_0,empty_set),esk4_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(87,negated_conjecture,(~subset(esk4_0,union(esk4_0,empty_set))|~subset(union(esk4_0,empty_set),esk4_0)),inference(spm,[status(thm)],[83,27,theory(equality)])).
% cnf(97,plain,(subset(X1,union(X2,X3))|~member(esk1_2(X1,union(X2,X3)),X2)),inference(spm,[status(thm)],[35,20,theory(equality)])).
% cnf(101,plain,(member(esk1_2(union(X1,X2),X3),X1)|member(esk1_2(union(X1,X2),X3),X2)|subset(union(X1,X2),X3)),inference(spm,[status(thm)],[21,36,theory(equality)])).
% cnf(410,plain,(subset(X1,union(X1,X2))),inference(spm,[status(thm)],[97,36,theory(equality)])).
% cnf(422,negated_conjecture,($false|~subset(union(esk4_0,empty_set),esk4_0)),inference(rw,[status(thm)],[87,410,theory(equality)])).
% cnf(423,negated_conjecture,(~subset(union(esk4_0,empty_set),esk4_0)),inference(cn,[status(thm)],[422,theory(equality)])).
% cnf(509,plain,(subset(union(X1,X2),X1)|member(esk1_2(union(X1,X2),X1),X2)),inference(spm,[status(thm)],[35,101,theory(equality)])).
% cnf(26463,plain,(subset(union(X1,empty_set),X1)),inference(spm,[status(thm)],[23,509,theory(equality)])).
% cnf(26498,negated_conjecture,($false),inference(rw,[status(thm)],[423,26463,theory(equality)])).
% cnf(26499,negated_conjecture,($false),inference(cn,[status(thm)],[26498,theory(equality)])).
% cnf(26500,negated_conjecture,($false),26499,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1576
% # ...of these trivial : 72
% # ...subsumed : 58
% # ...remaining for further processing: 1446
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 46
% # Generated clauses : 24527
% # ...of the previous two non-trivial : 22947
% # Contextual simplify-reflections : 0
% # Paramodulations : 24482
% # Factorizations : 32
% # Equation resolutions : 13
% # Current number of processed clauses: 1367
% # Positive orientable unit clauses: 1137
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 47
% # Non-unit-clauses : 183
% # Current number of unprocessed clauses: 15407
% # ...number of literals in the above : 32308
% # Clause-clause subsumption calls (NU) : 1588
% # Rec. Clause-clause subsumption calls : 1345
% # Unit Clause-clause subsumption calls : 926
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 16495
% # Indexed BW rewrite successes : 46
% # Backwards rewriting index: 571 leaves, 4.53+/-7.450 terms/leaf
% # Paramod-from index: 196 leaves, 6.23+/-10.643 terms/leaf
% # Paramod-into index: 513 leaves, 4.80+/-7.692 terms/leaf
% # -------------------------------------------------
% # User time : 1.140 s
% # System time : 0.038 s
% # Total time : 1.178 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.64 CPU 1.72 WC
% FINAL PrfWatch: 1.64 CPU 1.72 WC
% SZS output end Solution for /tmp/SystemOnTPTP24777/SET162+4.tptp
%
%------------------------------------------------------------------------------