TSTP Solution File: SET143+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET143+3 : 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:06:55 EST 2010
% Result : Theorem 13.60s
% Output : Solution 13.60s
% 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/SystemOnTPTP3199/SET143+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3199/SET143+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3199/SET143+3.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 3331
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.71 CPU 2.03 WC
% PrfWatch: 3.60 CPU 4.03 WC
% PrfWatch: 5.60 CPU 6.04 WC
% PrfWatch: 7.59 CPU 8.05 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 9.59 CPU 10.05 WC
% PrfWatch: 11.58 CPU 12.06 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(2, axiom,![X1]:![X2]:![X3]:(member(X3,intersection(X1,X2))<=>(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersection_defn)).
% fof(3, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_defn)).
% fof(6, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(7, conjecture,![X1]:![X2]:![X3]:intersection(intersection(X1,X2),X3)=intersection(X1,intersection(X2,X3)),file('/tmp/SRASS.s.p', prove_associativity_of_intersection)).
% fof(8, negated_conjecture,~(![X1]:![X2]:![X3]:intersection(intersection(X1,X2),X3)=intersection(X1,intersection(X2,X3))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(10,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[9])).
% fof(11, plain,![X1]:![X2]:![X3]:((~(member(X3,intersection(X1,X2)))|(member(X3,X1)&member(X3,X2)))&((~(member(X3,X1))|~(member(X3,X2)))|member(X3,intersection(X1,X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(12, plain,![X4]:![X5]:![X6]:((~(member(X6,intersection(X4,X5)))|(member(X6,X4)&member(X6,X5)))&((~(member(X6,X4))|~(member(X6,X5)))|member(X6,intersection(X4,X5)))),inference(variable_rename,[status(thm)],[11])).
% fof(13, plain,![X4]:![X5]:![X6]:(((member(X6,X4)|~(member(X6,intersection(X4,X5))))&(member(X6,X5)|~(member(X6,intersection(X4,X5)))))&((~(member(X6,X4))|~(member(X6,X5)))|member(X6,intersection(X4,X5)))),inference(distribute,[status(thm)],[12])).
% cnf(14,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[13])).
% cnf(15,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[13])).
% cnf(16,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[13])).
% fof(17, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[3])).
% fof(18, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[18])).
% cnf(20,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[19])).
% fof(34, 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)],[6])).
% fof(35, 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)],[34])).
% fof(36, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[35])).
% fof(37, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[36])).
% fof(38, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk2_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk2_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[37])).
% cnf(39,plain,(subset(X1,X2)|~member(esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[38])).
% cnf(40,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[38])).
% cnf(41,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[38])).
% fof(42, negated_conjecture,?[X1]:?[X2]:?[X3]:~(intersection(intersection(X1,X2),X3)=intersection(X1,intersection(X2,X3))),inference(fof_nnf,[status(thm)],[8])).
% fof(43, negated_conjecture,?[X4]:?[X5]:?[X6]:~(intersection(intersection(X4,X5),X6)=intersection(X4,intersection(X5,X6))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,~(intersection(intersection(esk3_0,esk4_0),esk5_0)=intersection(esk3_0,intersection(esk4_0,esk5_0))),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(intersection(intersection(esk3_0,esk4_0),esk5_0)!=intersection(esk3_0,intersection(esk4_0,esk5_0))),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,negated_conjecture,(intersection(esk5_0,intersection(esk3_0,esk4_0))!=intersection(esk3_0,intersection(esk4_0,esk5_0))),inference(rw,[status(thm)],[45,10,theory(equality)])).
% cnf(55,plain,(member(esk2_2(intersection(X1,X2),X3),X1)|subset(intersection(X1,X2),X3)),inference(spm,[status(thm)],[16,40,theory(equality)])).
% cnf(56,plain,(member(esk2_2(intersection(X1,X2),X3),X2)|subset(intersection(X1,X2),X3)),inference(spm,[status(thm)],[15,40,theory(equality)])).
% cnf(60,plain,(subset(X1,intersection(X2,X3))|~member(esk2_2(X1,intersection(X2,X3)),X3)|~member(esk2_2(X1,intersection(X2,X3)),X2)),inference(spm,[status(thm)],[39,14,theory(equality)])).
% cnf(74,plain,(member(esk2_2(intersection(intersection(X1,X2),X3),X4),X2)|subset(intersection(intersection(X1,X2),X3),X4)),inference(spm,[status(thm)],[15,55,theory(equality)])).
% cnf(93,plain,(member(esk2_2(intersection(X1,intersection(X2,X3)),X4),X2)|subset(intersection(X1,intersection(X2,X3)),X4)),inference(spm,[status(thm)],[16,56,theory(equality)])).
% cnf(115,plain,(subset(intersection(X1,X2),intersection(X3,X1))|~member(esk2_2(intersection(X1,X2),intersection(X3,X1)),X3)),inference(spm,[status(thm)],[60,55,theory(equality)])).
% cnf(116,plain,(subset(intersection(X1,X2),intersection(X3,X2))|~member(esk2_2(intersection(X1,X2),intersection(X3,X2)),X3)),inference(spm,[status(thm)],[60,56,theory(equality)])).
% cnf(1701,plain,(subset(intersection(X1,intersection(X2,X3)),intersection(X2,X1))),inference(spm,[status(thm)],[115,93,theory(equality)])).
% cnf(1753,plain,(member(X1,intersection(X2,X3))|~member(X1,intersection(X3,intersection(X2,X4)))),inference(spm,[status(thm)],[41,1701,theory(equality)])).
% cnf(1851,plain,(subset(intersection(X1,X2),intersection(X2,X3))|~member(esk2_2(intersection(X1,X2),intersection(X2,X3)),X3)),inference(spm,[status(thm)],[116,10,theory(equality)])).
% cnf(1868,plain,(subset(intersection(intersection(X1,X2),X3),intersection(X2,X3))),inference(spm,[status(thm)],[116,74,theory(equality)])).
% cnf(26155,plain,(member(esk2_2(intersection(X1,intersection(X2,X3)),X4),intersection(X2,X1))|subset(intersection(X1,intersection(X2,X3)),X4)),inference(spm,[status(thm)],[1753,40,theory(equality)])).
% cnf(428870,plain,(subset(intersection(X1,intersection(X2,X3)),intersection(intersection(X2,X1),intersection(X2,X3)))),inference(spm,[status(thm)],[116,26155,theory(equality)])).
% cnf(428887,plain,(subset(intersection(X1,intersection(X2,X3)),intersection(intersection(X2,X3),intersection(X2,X1)))),inference(spm,[status(thm)],[1851,26155,theory(equality)])).
% cnf(429618,plain,(intersection(intersection(X1,X2),intersection(X1,X3))=intersection(X2,intersection(X1,X3))|~subset(intersection(intersection(X1,X2),intersection(X1,X3)),intersection(X2,intersection(X1,X3)))),inference(spm,[status(thm)],[20,428870,theory(equality)])).
% cnf(429964,plain,(intersection(intersection(X1,X2),intersection(X1,X3))=intersection(X2,intersection(X1,X3))|$false),inference(rw,[status(thm)],[429618,1868,theory(equality)])).
% cnf(429965,plain,(intersection(intersection(X1,X2),intersection(X1,X3))=intersection(X2,intersection(X1,X3))),inference(cn,[status(thm)],[429964,theory(equality)])).
% cnf(436420,plain,(subset(intersection(X1,intersection(X2,X3)),intersection(X3,intersection(X2,X1)))),inference(rw,[status(thm)],[428887,429965,theory(equality)])).
% cnf(436421,plain,(intersection(X1,intersection(X2,X3))=intersection(X3,intersection(X2,X1))|~subset(intersection(X1,intersection(X2,X3)),intersection(X3,intersection(X2,X1)))),inference(spm,[status(thm)],[20,436420,theory(equality)])).
% cnf(436719,plain,(intersection(X1,intersection(X2,X3))=intersection(X3,intersection(X2,X1))|$false),inference(rw,[status(thm)],[436421,436420,theory(equality)])).
% cnf(436720,plain,(intersection(X1,intersection(X2,X3))=intersection(X3,intersection(X2,X1))),inference(cn,[status(thm)],[436719,theory(equality)])).
% cnf(444694,plain,(intersection(X1,intersection(X2,X3))=intersection(X3,intersection(X1,X2))),inference(spm,[status(thm)],[436720,10,theory(equality)])).
% cnf(444771,negated_conjecture,(intersection(esk4_0,intersection(esk3_0,esk5_0))!=intersection(esk3_0,intersection(esk4_0,esk5_0))),inference(rw,[status(thm)],[46,436720,theory(equality)])).
% cnf(449479,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[444771,444694,theory(equality)]),10,theory(equality)])).
% cnf(449480,negated_conjecture,($false),inference(cn,[status(thm)],[449479,theory(equality)])).
% cnf(449481,negated_conjecture,($false),449480,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5830
% # ...of these trivial : 3467
% # ...subsumed : 1474
% # ...remaining for further processing: 889
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 718
% # Generated clauses : 316023
% # ...of the previous two non-trivial : 189222
% # Contextual simplify-reflections : 45
% # Paramodulations : 315899
% # Factorizations : 122
% # Equation resolutions : 2
% # Current number of processed clauses: 169
% # Positive orientable unit clauses: 56
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 110
% # Current number of unprocessed clauses: 6046
% # ...number of literals in the above : 14243
% # Clause-clause subsumption calls (NU) : 38476
% # Rec. Clause-clause subsumption calls : 31029
% # Unit Clause-clause subsumption calls : 15500
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 61813
% # Indexed BW rewrite successes : 817
% # Backwards rewriting index: 46 leaves, 6.72+/-7.711 terms/leaf
% # Paramod-from index: 18 leaves, 7.00+/-7.579 terms/leaf
% # Paramod-into index: 44 leaves, 6.32+/-7.624 terms/leaf
% # -------------------------------------------------
% # User time : 7.728 s
% # System time : 0.230 s
% # Total time : 7.958 s
% # Maximum resident set size: 0 pages
% PrfWatch: 12.57 CPU 13.05 WC
% FINAL PrfWatch: 12.57 CPU 13.05 WC
% SZS output end Solution for /tmp/SystemOnTPTP3199/SET143+3.tptp
%
%------------------------------------------------------------------------------