TSTP Solution File: SEU125+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU125+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 : art09.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 : Thu Dec 30 01:10:54 EST 2010
% Result : Theorem 1.77s
% Output : Solution 1.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/SystemOnTPTP2339/SEU125+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2339/SEU125+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2339/SEU125+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 2435
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(6, axiom,![X1]:![X2]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(10, axiom,![X1]:![X2]:![X3]:(X3=set_union2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)|in(X4,X2)))),file('/tmp/SRASS.s.p', d2_xboole_0)).
% fof(11, axiom,![X1]:set_union2(X1,empty_set)=X1,file('/tmp/SRASS.s.p', t1_boole)).
% fof(18, conjecture,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X3,X2))=>subset(set_union2(X1,X3),X2)),file('/tmp/SRASS.s.p', t8_xboole_1)).
% fof(19, negated_conjecture,~(![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X3,X2))=>subset(set_union2(X1,X3),X2))),inference(assume_negation,[status(cth)],[18])).
% fof(32, 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)],[4])).
% fof(33, 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)],[32])).
% fof(34, 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)],[33])).
% fof(35, 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)],[34])).
% fof(36, 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)],[35])).
% cnf(37,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[36])).
% cnf(38,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[36])).
% cnf(39,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(43, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(44,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(53, plain,![X1]:![X2]:![X3]:((~(X3=set_union2(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_union2(X1,X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(54, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(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_union2(X5,X6))),inference(variable_rename,[status(thm)],[53])).
% fof(55, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))&~(in(esk4_3(X5,X6,X7),X6))))&(in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(skolemize,[status(esa)],[54])).
% fof(56, 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_union2(X5,X6)))&(((~(in(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))&~(in(esk4_3(X5,X6,X7),X6))))&(in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(shift_quantors,[status(thm)],[55])).
% fof(57, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))|~(X7=set_union2(X5,X6)))&(((~(in(X8,X5))|in(X8,X7))|~(X7=set_union2(X5,X6)))&((~(in(X8,X6))|in(X8,X7))|~(X7=set_union2(X5,X6)))))&((((~(in(esk4_3(X5,X6,X7),X5))|~(in(esk4_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6))&((~(in(esk4_3(X5,X6,X7),X6))|~(in(esk4_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6)))&((in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X6)))|X7=set_union2(X5,X6)))),inference(distribute,[status(thm)],[56])).
% cnf(61,plain,(in(X4,X1)|X1!=set_union2(X2,X3)|~in(X4,X3)),inference(split_conjunct,[status(thm)],[57])).
% cnf(63,plain,(in(X4,X3)|in(X4,X2)|X1!=set_union2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(64, plain,![X2]:set_union2(X2,empty_set)=X2,inference(variable_rename,[status(thm)],[11])).
% cnf(65,plain,(set_union2(X1,empty_set)=X1),inference(split_conjunct,[status(thm)],[64])).
% fof(78, negated_conjecture,?[X1]:?[X2]:?[X3]:((subset(X1,X2)&subset(X3,X2))&~(subset(set_union2(X1,X3),X2))),inference(fof_nnf,[status(thm)],[19])).
% fof(79, negated_conjecture,?[X4]:?[X5]:?[X6]:((subset(X4,X5)&subset(X6,X5))&~(subset(set_union2(X4,X6),X5))),inference(variable_rename,[status(thm)],[78])).
% fof(80, negated_conjecture,((subset(esk5_0,esk6_0)&subset(esk7_0,esk6_0))&~(subset(set_union2(esk5_0,esk7_0),esk6_0))),inference(skolemize,[status(esa)],[79])).
% cnf(81,negated_conjecture,(~subset(set_union2(esk5_0,esk7_0),esk6_0)),inference(split_conjunct,[status(thm)],[80])).
% cnf(82,negated_conjecture,(subset(esk7_0,esk6_0)),inference(split_conjunct,[status(thm)],[80])).
% cnf(83,negated_conjecture,(subset(esk5_0,esk6_0)),inference(split_conjunct,[status(thm)],[80])).
% cnf(85,plain,(set_union2(empty_set,X1)=X1),inference(spm,[status(thm)],[65,44,theory(equality)])).
% cnf(105,negated_conjecture,(in(X1,esk6_0)|~in(X1,esk7_0)),inference(spm,[status(thm)],[39,82,theory(equality)])).
% cnf(106,negated_conjecture,(in(X1,esk6_0)|~in(X1,esk5_0)),inference(spm,[status(thm)],[39,83,theory(equality)])).
% cnf(109,plain,(in(X1,set_union2(X2,X3))|~in(X1,X3)),inference(er,[status(thm)],[61,theory(equality)])).
% cnf(123,plain,(in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2))),inference(er,[status(thm)],[63,theory(equality)])).
% cnf(167,negated_conjecture,(in(esk1_2(esk7_0,X1),esk6_0)|subset(esk7_0,X1)),inference(spm,[status(thm)],[105,38,theory(equality)])).
% cnf(191,negated_conjecture,(in(esk1_2(esk5_0,X1),esk6_0)|subset(esk5_0,X1)),inference(spm,[status(thm)],[106,38,theory(equality)])).
% cnf(223,plain,(subset(X1,set_union2(X2,X3))|~in(esk1_2(X1,set_union2(X2,X3)),X3)),inference(spm,[status(thm)],[37,109,theory(equality)])).
% cnf(317,plain,(in(esk1_2(set_union2(X1,X2),X3),X1)|in(esk1_2(set_union2(X1,X2),X3),X2)|subset(set_union2(X1,X2),X3)),inference(spm,[status(thm)],[123,38,theory(equality)])).
% cnf(500,negated_conjecture,(subset(esk7_0,set_union2(X1,esk6_0))),inference(spm,[status(thm)],[223,167,theory(equality)])).
% cnf(501,negated_conjecture,(subset(esk5_0,set_union2(X1,esk6_0))),inference(spm,[status(thm)],[223,191,theory(equality)])).
% cnf(503,negated_conjecture,(in(X1,set_union2(X2,esk6_0))|~in(X1,esk7_0)),inference(spm,[status(thm)],[39,500,theory(equality)])).
% cnf(511,negated_conjecture,(in(X1,set_union2(X2,esk6_0))|~in(X1,esk5_0)),inference(spm,[status(thm)],[39,501,theory(equality)])).
% cnf(572,negated_conjecture,(subset(X1,set_union2(X2,esk6_0))|~in(esk1_2(X1,set_union2(X2,esk6_0)),esk7_0)),inference(spm,[status(thm)],[37,503,theory(equality)])).
% cnf(654,negated_conjecture,(subset(X1,set_union2(X2,esk6_0))|~in(esk1_2(X1,set_union2(X2,esk6_0)),esk5_0)),inference(spm,[status(thm)],[37,511,theory(equality)])).
% cnf(1055,negated_conjecture,(subset(X1,esk6_0)|~in(esk1_2(X1,esk6_0),esk7_0)),inference(spm,[status(thm)],[572,85,theory(equality)])).
% cnf(1179,negated_conjecture,(subset(X1,esk6_0)|~in(esk1_2(X1,esk6_0),esk5_0)),inference(spm,[status(thm)],[654,85,theory(equality)])).
% cnf(2426,negated_conjecture,(subset(set_union2(esk7_0,X1),esk6_0)|in(esk1_2(set_union2(esk7_0,X1),esk6_0),X1)),inference(spm,[status(thm)],[1055,317,theory(equality)])).
% cnf(17750,negated_conjecture,(subset(set_union2(esk7_0,esk5_0),esk6_0)),inference(spm,[status(thm)],[1179,2426,theory(equality)])).
% cnf(17789,negated_conjecture,(subset(set_union2(esk5_0,esk7_0),esk6_0)),inference(rw,[status(thm)],[17750,44,theory(equality)])).
% cnf(17790,negated_conjecture,($false),inference(sr,[status(thm)],[17789,81,theory(equality)])).
% cnf(17791,negated_conjecture,($false),17790,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4019
% # ...of these trivial : 33
% # ...subsumed : 3189
% # ...remaining for further processing: 797
% # Other redundant clauses eliminated : 27
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 49
% # Backward-rewritten : 33
% # Generated clauses : 13085
% # ...of the previous two non-trivial : 12277
% # Contextual simplify-reflections : 765
% # Paramodulations : 12568
% # Factorizations : 396
% # Equation resolutions : 34
% # Current number of processed clauses: 652
% # Positive orientable unit clauses: 54
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 50
% # Non-unit-clauses : 547
% # Current number of unprocessed clauses: 6885
% # ...number of literals in the above : 26531
% # Clause-clause subsumption calls (NU) : 59523
% # Rec. Clause-clause subsumption calls : 45352
% # Unit Clause-clause subsumption calls : 2822
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 80
% # Indexed BW rewrite successes : 25
% # Backwards rewriting index: 304 leaves, 2.45+/-2.997 terms/leaf
% # Paramod-from index: 105 leaves, 2.77+/-3.264 terms/leaf
% # Paramod-into index: 276 leaves, 2.41+/-2.645 terms/leaf
% # -------------------------------------------------
% # User time : 0.638 s
% # System time : 0.017 s
% # Total time : 0.655 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.98 CPU 1.05 WC
% FINAL PrfWatch: 0.98 CPU 1.05 WC
% SZS output end Solution for /tmp/SystemOnTPTP2339/SEU125+1.tptp
%
%------------------------------------------------------------------------------