TSTP Solution File: SET159+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET159+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 : art05.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:05:46 EST 2010
% Result : Theorem 116.13s
% Output : Solution 147.77s
% 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/SystemOnTPTP27858/SET159+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~thI09:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... union: CSA axiom union found
% Looking for CSA axiom ... equal_set:
% CSA axiom equal_set found
% Looking for CSA axiom ... subset:
% CSA axiom subset found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :subset:equal_set:union (3)
% Unselected axioms are ... :power_set:intersection:empty_set:difference:sum:product:singleton:unordered_pair (8)
% SZS status THM for /tmp/SystemOnTPTP27858/SET159+4.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP27858/SET159+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 28970
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.80 CPU 2.01 WC
% PrfWatch: 3.80 CPU 4.01 WC
% PrfWatch: 5.67 CPU 6.02 WC
% PrfWatch: 7.21 CPU 8.03 WC
% PrfWatch: 9.07 CPU 10.03 WC
% PrfWatch: 11.06 CPU 12.04 WC
% PrfWatch: 13.05 CPU 14.04 WC
% PrfWatch: 15.05 CPU 16.05 WC
% PrfWatch: 17.04 CPU 18.05 WC
% PrfWatch: 19.04 CPU 20.06 WC
% PrfWatch: 21.03 CPU 22.06 WC
% PrfWatch: 23.02 CPU 24.06 WC
% PrfWatch: 25.01 CPU 26.07 WC
% PrfWatch: 27.01 CPU 28.07 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 29.00 CPU 30.08 WC
% PrfWatch: 30.99 CPU 32.08 WC
% # 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,![X1]:![X2]:(equal_set(X1,X2)<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_set)).
% fof(3, axiom,![X3]:![X1]:![X2]:(member(X3,union(X1,X2))<=>(member(X3,X1)|member(X3,X2))),file('/tmp/SRASS.s.p', union)).
% fof(4, conjecture,![X1]:![X2]:![X4]:equal_set(union(union(X1,X2),X4),union(X1,union(X2,X4))),file('/tmp/SRASS.s.p', thI09)).
% fof(5, negated_conjecture,~(![X1]:![X2]:![X4]:equal_set(union(union(X1,X2),X4),union(X1,union(X2,X4)))),inference(assume_negation,[status(cth)],[4])).
% fof(6, 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(7, 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)],[6])).
% fof(8, 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)],[7])).
% fof(9, 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)],[8])).
% fof(10, 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)],[9])).
% cnf(11,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[10])).
% cnf(12,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[10])).
% cnf(13,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[10])).
% fof(14, plain,![X1]:![X2]:((~(equal_set(X1,X2))|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|equal_set(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(15, plain,![X3]:![X4]:((~(equal_set(X3,X4))|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|equal_set(X3,X4))),inference(variable_rename,[status(thm)],[14])).
% fof(16, plain,![X3]:![X4]:(((subset(X3,X4)|~(equal_set(X3,X4)))&(subset(X4,X3)|~(equal_set(X3,X4))))&((~(subset(X3,X4))|~(subset(X4,X3)))|equal_set(X3,X4))),inference(distribute,[status(thm)],[15])).
% cnf(17,plain,(equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[16])).
% fof(20, plain,![X3]:![X1]:![X2]:((~(member(X3,union(X1,X2)))|(member(X3,X1)|member(X3,X2)))&((~(member(X3,X1))&~(member(X3,X2)))|member(X3,union(X1,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(21, 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)],[20])).
% fof(22, 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)],[21])).
% cnf(23,plain,(member(X1,union(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[22])).
% cnf(24,plain,(member(X1,union(X2,X3))|~member(X1,X2)),inference(split_conjunct,[status(thm)],[22])).
% cnf(25,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))),inference(split_conjunct,[status(thm)],[22])).
% fof(26, negated_conjecture,?[X1]:?[X2]:?[X4]:~(equal_set(union(union(X1,X2),X4),union(X1,union(X2,X4)))),inference(fof_nnf,[status(thm)],[5])).
% fof(27, negated_conjecture,?[X5]:?[X6]:?[X7]:~(equal_set(union(union(X5,X6),X7),union(X5,union(X6,X7)))),inference(variable_rename,[status(thm)],[26])).
% fof(28, negated_conjecture,~(equal_set(union(union(esk2_0,esk3_0),esk4_0),union(esk2_0,union(esk3_0,esk4_0)))),inference(skolemize,[status(esa)],[27])).
% cnf(29,negated_conjecture,(~equal_set(union(union(esk2_0,esk3_0),esk4_0),union(esk2_0,union(esk3_0,esk4_0)))),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,negated_conjecture,(~subset(union(esk2_0,union(esk3_0,esk4_0)),union(union(esk2_0,esk3_0),esk4_0))|~subset(union(union(esk2_0,esk3_0),esk4_0),union(esk2_0,union(esk3_0,esk4_0)))),inference(spm,[status(thm)],[29,17,theory(equality)])).
% cnf(33,plain,(subset(X1,union(X2,X3))|~member(esk1_2(X1,union(X2,X3)),X3)),inference(spm,[status(thm)],[11,23,theory(equality)])).
% cnf(34,plain,(subset(X1,union(X2,X3))|~member(esk1_2(X1,union(X2,X3)),X2)),inference(spm,[status(thm)],[11,24,theory(equality)])).
% cnf(36,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)],[25,12,theory(equality)])).
% cnf(40,plain,(subset(X1,union(X2,union(X3,X4)))|~member(esk1_2(X1,union(X2,union(X3,X4))),X4)),inference(spm,[status(thm)],[33,23,theory(equality)])).
% cnf(41,plain,(subset(X1,union(X2,union(X3,X4)))|~member(esk1_2(X1,union(X2,union(X3,X4))),X3)),inference(spm,[status(thm)],[33,24,theory(equality)])).
% cnf(44,plain,(subset(X1,union(union(X2,X3),X4))|~member(esk1_2(X1,union(union(X2,X3),X4)),X3)),inference(spm,[status(thm)],[34,23,theory(equality)])).
% cnf(45,plain,(subset(X1,union(union(X2,X3),X4))|~member(esk1_2(X1,union(union(X2,X3),X4)),X2)),inference(spm,[status(thm)],[34,24,theory(equality)])).
% cnf(51,plain,(subset(union(X1,X2),union(X1,X3))|member(esk1_2(union(X1,X2),union(X1,X3)),X2)),inference(spm,[status(thm)],[34,36,theory(equality)])).
% cnf(54,plain,(subset(union(X1,X2),union(X3,X2))|member(esk1_2(union(X1,X2),union(X3,X2)),X1)),inference(spm,[status(thm)],[33,36,theory(equality)])).
% cnf(79,plain,(subset(union(X1,X2),union(X3,union(X4,X2)))|member(esk1_2(union(X1,X2),union(X3,union(X4,X2))),X1)),inference(spm,[status(thm)],[40,36,theory(equality)])).
% cnf(154,plain,(subset(union(X1,X2),union(union(X1,X3),X4))|member(esk1_2(union(X1,X2),union(union(X1,X3),X4)),X2)),inference(spm,[status(thm)],[45,36,theory(equality)])).
% cnf(280,plain,(subset(union(X1,X2),union(X1,union(X2,X3)))),inference(spm,[status(thm)],[41,51,theory(equality)])).
% cnf(287,plain,(member(X1,union(X2,union(X3,X4)))|~member(X1,union(X2,X3))),inference(spm,[status(thm)],[13,280,theory(equality)])).
% cnf(384,plain,(subset(union(X1,X2),union(union(X3,X1),X2))),inference(spm,[status(thm)],[44,54,theory(equality)])).
% cnf(389,plain,(member(X1,union(union(X2,X3),X4))|~member(X1,union(X3,X4))),inference(spm,[status(thm)],[13,384,theory(equality)])).
% cnf(778,plain,(subset(X1,union(X2,union(X3,X4)))|~member(esk1_2(X1,union(X2,union(X3,X4))),union(X2,X3))),inference(spm,[status(thm)],[11,287,theory(equality)])).
% cnf(1107,plain,(subset(X1,union(union(X2,X3),X4))|~member(esk1_2(X1,union(union(X2,X3),X4)),union(X3,X4))),inference(spm,[status(thm)],[11,389,theory(equality)])).
% cnf(85554,plain,(subset(union(union(X1,X2),X3),union(X1,union(X2,X3)))),inference(spm,[status(thm)],[778,79,theory(equality)])).
% cnf(85935,negated_conjecture,(~subset(union(esk2_0,union(esk3_0,esk4_0)),union(union(esk2_0,esk3_0),esk4_0))|$false),inference(rw,[status(thm)],[30,85554,theory(equality)])).
% cnf(85936,negated_conjecture,(~subset(union(esk2_0,union(esk3_0,esk4_0)),union(union(esk2_0,esk3_0),esk4_0))),inference(cn,[status(thm)],[85935,theory(equality)])).
% cnf(151256,plain,(subset(union(X1,union(X2,X3)),union(union(X1,X2),X3))),inference(spm,[status(thm)],[1107,154,theory(equality)])).
% cnf(151800,negated_conjecture,($false),inference(rw,[status(thm)],[85936,151256,theory(equality)])).
% cnf(151801,negated_conjecture,($false),inference(cn,[status(thm)],[151800,theory(equality)])).
% cnf(151802,negated_conjecture,($false),151801,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6538
% # ...of these trivial : 166
% # ...subsumed : 1421
% # ...remaining for further processing: 4951
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 148332
% # ...of the previous two non-trivial : 145043
% # Contextual simplify-reflections : 39
% # Paramodulations : 147506
% # Factorizations : 826
% # Equation resolutions : 0
% # Current number of processed clauses: 4939
% # Positive orientable unit clauses: 4259
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 679
% # Current number of unprocessed clauses: 138525
% # ...number of literals in the above : 366257
% # Clause-clause subsumption calls (NU) : 276992
% # Rec. Clause-clause subsumption calls : 141350
% # Unit Clause-clause subsumption calls : 936673
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2376931
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 93 leaves, 85.84+/-140.975 terms/leaf
% # Paramod-from index: 38 leaves, 129.13+/-178.156 terms/leaf
% # Paramod-into index: 91 leaves, 84.38+/-139.670 terms/leaf
% # -------------------------------------------------
% # User time : 28.673 s
% # System time : 0.229 s
% # Total time : 28.902 s
% # Maximum resident set size: 0 pages
% PrfWatch: 31.19 CPU 32.29 WC
% FINAL PrfWatch: 31.19 CPU 32.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP27858/SET159+4.tptp
%
%------------------------------------------------------------------------------