TSTP Solution File: SET351+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET351+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 : 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:13:51 EST 2010
% Result : Theorem 96.79s
% Output : Solution 97.25s
% 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/SystemOnTPTP8156/SET351+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~thI39:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... sum:
% CSA axiom sum found
% Looking for CSA axiom ... equal_set:
% CSA axiom equal_set found
% Looking for CSA axiom ... singleton:
% CSA axiom singleton found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... subset:
% CSA axiom subset found
% Looking for CSA axiom ... unordered_pair:
% CSA axiom unordered_pair found
% Looking for CSA axiom ... power_set:
% CSA axiom power_set found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :power_set:unordered_pair:subset:singleton:equal_set:sum (6)
% Unselected axioms are ... :intersection:union:empty_set:difference:product (5)
% SZS status THM for /tmp/SystemOnTPTP8156/SET351+4.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP8156/SET351+4.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 10029
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X2]:![X3]:(subset(X2,X3)<=>![X1]:(member(X1,X2)=>member(X1,X3))),file('/tmp/SRASS.s.p', subset)).
% fof(4, axiom,![X1]:![X2]:(member(X1,singleton(X2))<=>X1=X2),file('/tmp/SRASS.s.p', singleton)).
% fof(5, axiom,![X2]:![X3]:(equal_set(X2,X3)<=>(subset(X2,X3)&subset(X3,X2))),file('/tmp/SRASS.s.p', equal_set)).
% fof(6, axiom,![X1]:![X2]:(member(X1,sum(X2))<=>?[X4]:(member(X4,X2)&member(X1,X4))),file('/tmp/SRASS.s.p', sum)).
% fof(7, conjecture,![X2]:equal_set(sum(singleton(X2)),X2),file('/tmp/SRASS.s.p', thI39)).
% fof(8, negated_conjecture,~(![X2]:equal_set(sum(singleton(X2)),X2)),inference(assume_negation,[status(cth)],[7])).
% fof(19, 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)],[3])).
% fof(20, 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)],[19])).
% fof(21, 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)],[20])).
% fof(22, 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)],[21])).
% fof(23, 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)],[22])).
% cnf(24,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[23])).
% cnf(25,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(27, plain,![X1]:![X2]:((~(member(X1,singleton(X2)))|X1=X2)&(~(X1=X2)|member(X1,singleton(X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(28, plain,![X3]:![X4]:((~(member(X3,singleton(X4)))|X3=X4)&(~(X3=X4)|member(X3,singleton(X4)))),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(member(X1,singleton(X2))|X1!=X2),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,plain,(X1=X2|~member(X1,singleton(X2))),inference(split_conjunct,[status(thm)],[28])).
% fof(31, 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)],[5])).
% fof(32, 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)],[31])).
% fof(33, 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)],[32])).
% cnf(34,plain,(equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[33])).
% fof(37, plain,![X1]:![X2]:((~(member(X1,sum(X2)))|?[X4]:(member(X4,X2)&member(X1,X4)))&(![X4]:(~(member(X4,X2))|~(member(X1,X4)))|member(X1,sum(X2)))),inference(fof_nnf,[status(thm)],[6])).
% fof(38, 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)],[37])).
% fof(39, 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)],[38])).
% fof(40, 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)],[39])).
% fof(41, 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)],[40])).
% cnf(42,plain,(member(X1,esk2_2(X1,X2))|~member(X1,sum(X2))),inference(split_conjunct,[status(thm)],[41])).
% cnf(43,plain,(member(esk2_2(X1,X2),X2)|~member(X1,sum(X2))),inference(split_conjunct,[status(thm)],[41])).
% cnf(44,plain,(member(X1,sum(X2))|~member(X1,X3)|~member(X3,X2)),inference(split_conjunct,[status(thm)],[41])).
% fof(45, negated_conjecture,?[X2]:~(equal_set(sum(singleton(X2)),X2)),inference(fof_nnf,[status(thm)],[8])).
% fof(46, negated_conjecture,?[X3]:~(equal_set(sum(singleton(X3)),X3)),inference(variable_rename,[status(thm)],[45])).
% fof(47, negated_conjecture,~(equal_set(sum(singleton(esk3_0)),esk3_0)),inference(skolemize,[status(esa)],[46])).
% cnf(48,negated_conjecture,(~equal_set(sum(singleton(esk3_0)),esk3_0)),inference(split_conjunct,[status(thm)],[47])).
% cnf(49,plain,(member(X1,singleton(X1))),inference(er,[status(thm)],[29,theory(equality)])).
% cnf(52,negated_conjecture,(~subset(esk3_0,sum(singleton(esk3_0)))|~subset(sum(singleton(esk3_0)),esk3_0)),inference(spm,[status(thm)],[48,34,theory(equality)])).
% cnf(55,plain,(esk2_2(X1,singleton(X2))=X2|~member(X1,sum(singleton(X2)))),inference(spm,[status(thm)],[30,43,theory(equality)])).
% cnf(67,plain,(member(X1,sum(singleton(X2)))|~member(X1,X2)),inference(spm,[status(thm)],[44,49,theory(equality)])).
% cnf(76,plain,(subset(X1,sum(singleton(X2)))|~member(esk1_2(X1,sum(singleton(X2))),X2)),inference(spm,[status(thm)],[24,67,theory(equality)])).
% cnf(78,plain,(member(X1,X2)|~member(X1,sum(singleton(X2)))),inference(spm,[status(thm)],[42,55,theory(equality)])).
% cnf(82,plain,(member(esk1_2(sum(singleton(X1)),X2),X1)|subset(sum(singleton(X1)),X2)),inference(spm,[status(thm)],[78,25,theory(equality)])).
% cnf(90,plain,(subset(sum(singleton(X1)),X1)),inference(spm,[status(thm)],[24,82,theory(equality)])).
% cnf(92,negated_conjecture,(~subset(esk3_0,sum(singleton(esk3_0)))|$false),inference(rw,[status(thm)],[52,90,theory(equality)])).
% cnf(93,negated_conjecture,(~subset(esk3_0,sum(singleton(esk3_0)))),inference(cn,[status(thm)],[92,theory(equality)])).
% cnf(317,plain,(subset(X1,sum(singleton(X1)))),inference(spm,[status(thm)],[76,25,theory(equality)])).
% cnf(322,negated_conjecture,($false),inference(rw,[status(thm)],[93,317,theory(equality)])).
% cnf(323,negated_conjecture,($false),inference(cn,[status(thm)],[322,theory(equality)])).
% cnf(324,negated_conjecture,($false),323,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 100
% # ...of these trivial : 0
% # ...subsumed : 7
% # ...remaining for further processing: 93
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 252
% # ...of the previous two non-trivial : 223
% # Contextual simplify-reflections : 0
% # Paramodulations : 245
% # Factorizations : 2
% # Equation resolutions : 5
% # Current number of processed clauses: 71
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 62
% # Current number of unprocessed clauses: 157
% # ...number of literals in the above : 422
% # Clause-clause subsumption calls (NU) : 230
% # Rec. Clause-clause subsumption calls : 229
% # Unit Clause-clause subsumption calls : 39
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 19
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 66 leaves, 1.98+/-1.409 terms/leaf
% # Paramod-from index: 30 leaves, 1.50+/-1.118 terms/leaf
% # Paramod-into index: 59 leaves, 1.86+/-1.228 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.004 s
% # Total time : 0.024 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.18 WC
% FINAL PrfWatch: 0.12 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP8156/SET351+4.tptp
%
%------------------------------------------------------------------------------