TSTP Solution File: SEU132+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU132+1 : TPTP v5.0.0. Released v3.3.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 : Thu Dec 30 01:17:26 EST 2010
% Result : Theorem 2.47s
% Output : Solution 2.47s
% 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/SystemOnTPTP18226/SEU132+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18226/SEU132+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18226/SEU132+1.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 18358
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(4, axiom,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),file('/tmp/SRASS.s.p', d4_xboole_0)).
% fof(5, axiom,![X1]:set_difference(X1,empty_set)=X1,file('/tmp/SRASS.s.p', t3_boole)).
% fof(15, conjecture,![X1]:![X2]:![X3]:(subset(X1,X2)=>subset(set_difference(X1,X3),set_difference(X2,X3))),file('/tmp/SRASS.s.p', t33_xboole_1)).
% fof(16, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(X1,X2)=>subset(set_difference(X1,X3),set_difference(X2,X3)))),inference(assume_negation,[status(cth)],[15])).
% fof(18, plain,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(22, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(23, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[25])).
% cnf(27,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[26])).
% cnf(29,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(33, plain,![X1]:![X2]:![X3]:((~(X3=set_difference(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)&~(in(X4,X2))))&((~(in(X4,X1))|in(X4,X2))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))|in(X4,X2)))&(in(X4,X3)|(in(X4,X1)&~(in(X4,X2)))))|X3=set_difference(X1,X2))),inference(fof_nnf,[status(thm)],[18])).
% fof(34, plain,![X5]:![X6]:![X7]:((~(X7=set_difference(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))|in(X9,X6)))&(in(X9,X7)|(in(X9,X5)&~(in(X9,X6)))))|X7=set_difference(X5,X6))),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X5]:![X6]:![X7]:((~(X7=set_difference(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7))))&(((~(in(esk2_3(X5,X6,X7),X7))|(~(in(esk2_3(X5,X6,X7),X5))|in(esk2_3(X5,X6,X7),X6)))&(in(esk2_3(X5,X6,X7),X7)|(in(esk2_3(X5,X6,X7),X5)&~(in(esk2_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(skolemize,[status(esa)],[34])).
% fof(36, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7)))|~(X7=set_difference(X5,X6)))&(((~(in(esk2_3(X5,X6,X7),X7))|(~(in(esk2_3(X5,X6,X7),X5))|in(esk2_3(X5,X6,X7),X6)))&(in(esk2_3(X5,X6,X7),X7)|(in(esk2_3(X5,X6,X7),X5)&~(in(esk2_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(shift_quantors,[status(thm)],[35])).
% fof(37, plain,![X5]:![X6]:![X7]:![X8]:(((((in(X8,X5)|~(in(X8,X7)))|~(X7=set_difference(X5,X6)))&((~(in(X8,X6))|~(in(X8,X7)))|~(X7=set_difference(X5,X6))))&(((~(in(X8,X5))|in(X8,X6))|in(X8,X7))|~(X7=set_difference(X5,X6))))&(((~(in(esk2_3(X5,X6,X7),X7))|(~(in(esk2_3(X5,X6,X7),X5))|in(esk2_3(X5,X6,X7),X6)))|X7=set_difference(X5,X6))&(((in(esk2_3(X5,X6,X7),X5)|in(esk2_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))&((~(in(esk2_3(X5,X6,X7),X6))|in(esk2_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))))),inference(distribute,[status(thm)],[36])).
% cnf(41,plain,(in(X4,X1)|in(X4,X3)|X1!=set_difference(X2,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[37])).
% cnf(42,plain,(X1!=set_difference(X2,X3)|~in(X4,X1)|~in(X4,X3)),inference(split_conjunct,[status(thm)],[37])).
% cnf(43,plain,(in(X4,X2)|X1!=set_difference(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(44, plain,![X2]:set_difference(X2,empty_set)=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(45,plain,(set_difference(X1,empty_set)=X1),inference(split_conjunct,[status(thm)],[44])).
% fof(66, negated_conjecture,?[X1]:?[X2]:?[X3]:(subset(X1,X2)&~(subset(set_difference(X1,X3),set_difference(X2,X3)))),inference(fof_nnf,[status(thm)],[16])).
% fof(67, negated_conjecture,?[X4]:?[X5]:?[X6]:(subset(X4,X5)&~(subset(set_difference(X4,X6),set_difference(X5,X6)))),inference(variable_rename,[status(thm)],[66])).
% fof(68, negated_conjecture,(subset(esk5_0,esk6_0)&~(subset(set_difference(esk5_0,esk7_0),set_difference(esk6_0,esk7_0)))),inference(skolemize,[status(esa)],[67])).
% cnf(69,negated_conjecture,(~subset(set_difference(esk5_0,esk7_0),set_difference(esk6_0,esk7_0))),inference(split_conjunct,[status(thm)],[68])).
% cnf(70,negated_conjecture,(subset(esk5_0,esk6_0)),inference(split_conjunct,[status(thm)],[68])).
% cnf(78,negated_conjecture,(in(X1,esk6_0)|~in(X1,esk5_0)),inference(spm,[status(thm)],[29,70,theory(equality)])).
% cnf(80,plain,(in(X1,X2)|~in(X1,set_difference(X2,X3))),inference(er,[status(thm)],[43,theory(equality)])).
% cnf(84,plain,(~in(X1,X2)|~in(X1,set_difference(X3,X2))),inference(er,[status(thm)],[42,theory(equality)])).
% cnf(88,plain,(in(X1,X2)|in(X1,set_difference(X3,X2))|~in(X1,X3)),inference(er,[status(thm)],[41,theory(equality)])).
% cnf(108,plain,(subset(set_difference(X1,X2),X3)|~in(esk1_2(set_difference(X1,X2),X3),X2)),inference(spm,[status(thm)],[84,28,theory(equality)])).
% cnf(115,negated_conjecture,(subset(X1,esk6_0)|~in(esk1_2(X1,esk6_0),esk5_0)),inference(spm,[status(thm)],[27,78,theory(equality)])).
% cnf(131,plain,(in(esk1_2(set_difference(X1,X2),X3),X1)|subset(set_difference(X1,X2),X3)),inference(spm,[status(thm)],[80,28,theory(equality)])).
% cnf(233,plain,(subset(X1,set_difference(X2,X3))|in(esk1_2(X1,set_difference(X2,X3)),X3)|~in(esk1_2(X1,set_difference(X2,X3)),X2)),inference(spm,[status(thm)],[27,88,theory(equality)])).
% cnf(271,negated_conjecture,(subset(set_difference(esk5_0,X1),esk6_0)),inference(spm,[status(thm)],[115,131,theory(equality)])).
% cnf(287,negated_conjecture,(in(X1,esk6_0)|~in(X1,set_difference(esk5_0,X2))),inference(spm,[status(thm)],[29,271,theory(equality)])).
% cnf(456,negated_conjecture,(in(esk1_2(set_difference(set_difference(esk5_0,X1),X2),X3),esk6_0)|subset(set_difference(set_difference(esk5_0,X1),X2),X3)),inference(spm,[status(thm)],[287,131,theory(equality)])).
% cnf(2555,negated_conjecture,(in(esk1_2(set_difference(set_difference(esk5_0,X1),X2),set_difference(esk6_0,X3)),X3)|subset(set_difference(set_difference(esk5_0,X1),X2),set_difference(esk6_0,X3))),inference(spm,[status(thm)],[233,456,theory(equality)])).
% cnf(44631,negated_conjecture,(subset(set_difference(set_difference(esk5_0,X1),X2),set_difference(esk6_0,X2))),inference(spm,[status(thm)],[108,2555,theory(equality)])).
% cnf(44821,negated_conjecture,(subset(set_difference(esk5_0,X1),set_difference(esk6_0,X1))),inference(spm,[status(thm)],[44631,45,theory(equality)])).
% cnf(45146,negated_conjecture,($false),inference(rw,[status(thm)],[69,44821,theory(equality)])).
% cnf(45147,negated_conjecture,($false),inference(cn,[status(thm)],[45146,theory(equality)])).
% cnf(45148,negated_conjecture,($false),45147,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4714
% # ...of these trivial : 50
% # ...subsumed : 4200
% # ...remaining for further processing: 464
% # Other redundant clauses eliminated : 39
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 9
% # Generated clauses : 28133
% # ...of the previous two non-trivial : 21396
% # Contextual simplify-reflections : 1909
% # Paramodulations : 28049
% # Factorizations : 38
% # Equation resolutions : 46
% # Current number of processed clauses: 424
% # Positive orientable unit clauses: 52
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 35
% # Non-unit-clauses : 337
% # Current number of unprocessed clauses: 16312
% # ...number of literals in the above : 56373
% # Clause-clause subsumption calls (NU) : 43384
% # Rec. Clause-clause subsumption calls : 38875
% # Unit Clause-clause subsumption calls : 372
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 75
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 210 leaves, 2.61+/-4.182 terms/leaf
% # Paramod-from index: 78 leaves, 2.53+/-3.339 terms/leaf
% # Paramod-into index: 199 leaves, 2.50+/-3.733 terms/leaf
% # -------------------------------------------------
% # User time : 0.843 s
% # System time : 0.027 s
% # Total time : 0.870 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.47 CPU 1.54 WC
% FINAL PrfWatch: 1.47 CPU 1.55 WC
% SZS output end Solution for /tmp/SystemOnTPTP18226/SEU132+1.tptp
%
%------------------------------------------------------------------------------