TSTP Solution File: SEU104+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU104+1 : TPTP v5.0.0. Released v3.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 : Thu Dec 30 01:08:59 EST 2010
% Result : Theorem 1.37s
% Output : Solution 1.37s
% 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/SystemOnTPTP11543/SEU104+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11543/SEU104+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11543/SEU104+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 11675
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:![X2]:(in(X1,X2)=>element(X1,X2)),file('/tmp/SRASS.s.p', t1_subset)).
% fof(8, axiom,![X1]:(preboolean(X1)<=>![X2]:![X3]:((in(X2,X1)&in(X3,X1))=>(in(set_union2(X2,X3),X1)&in(set_difference(X2,X3),X1)))),file('/tmp/SRASS.s.p', t10_finsub_1)).
% fof(16, axiom,![X1]:![X2]:set_union2(X1,X2)=symmetric_difference(X1,set_difference(X2,X1)),file('/tmp/SRASS.s.p', t98_xboole_1)).
% fof(18, axiom,![X1]:![X2]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(42, conjecture,![X1]:(~(empty(X1))=>(![X2]:(element(X2,X1)=>![X3]:(element(X3,X1)=>(in(symmetric_difference(X2,X3),X1)&in(set_difference(X2,X3),X1))))=>preboolean(X1))),file('/tmp/SRASS.s.p', t15_finsub_1)).
% fof(43, negated_conjecture,~(![X1]:(~(empty(X1))=>(![X2]:(element(X2,X1)=>![X3]:(element(X3,X1)=>(in(symmetric_difference(X2,X3),X1)&in(set_difference(X2,X3),X1))))=>preboolean(X1)))),inference(assume_negation,[status(cth)],[42])).
% fof(54, negated_conjecture,~(![X1]:(~(empty(X1))=>(![X2]:(element(X2,X1)=>![X3]:(element(X3,X1)=>(in(symmetric_difference(X2,X3),X1)&in(set_difference(X2,X3),X1))))=>preboolean(X1)))),inference(fof_simplification,[status(thm)],[43,theory(equality)])).
% fof(67, plain,![X1]:![X2]:(~(in(X1,X2))|element(X1,X2)),inference(fof_nnf,[status(thm)],[5])).
% fof(68, plain,![X3]:![X4]:(~(in(X3,X4))|element(X3,X4)),inference(variable_rename,[status(thm)],[67])).
% cnf(69,plain,(element(X1,X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[68])).
% fof(76, plain,![X1]:((~(preboolean(X1))|![X2]:![X3]:((~(in(X2,X1))|~(in(X3,X1)))|(in(set_union2(X2,X3),X1)&in(set_difference(X2,X3),X1))))&(?[X2]:?[X3]:((in(X2,X1)&in(X3,X1))&(~(in(set_union2(X2,X3),X1))|~(in(set_difference(X2,X3),X1))))|preboolean(X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(77, plain,![X4]:((~(preboolean(X4))|![X5]:![X6]:((~(in(X5,X4))|~(in(X6,X4)))|(in(set_union2(X5,X6),X4)&in(set_difference(X5,X6),X4))))&(?[X7]:?[X8]:((in(X7,X4)&in(X8,X4))&(~(in(set_union2(X7,X8),X4))|~(in(set_difference(X7,X8),X4))))|preboolean(X4))),inference(variable_rename,[status(thm)],[76])).
% fof(78, plain,![X4]:((~(preboolean(X4))|![X5]:![X6]:((~(in(X5,X4))|~(in(X6,X4)))|(in(set_union2(X5,X6),X4)&in(set_difference(X5,X6),X4))))&(((in(esk4_1(X4),X4)&in(esk5_1(X4),X4))&(~(in(set_union2(esk4_1(X4),esk5_1(X4)),X4))|~(in(set_difference(esk4_1(X4),esk5_1(X4)),X4))))|preboolean(X4))),inference(skolemize,[status(esa)],[77])).
% fof(79, plain,![X4]:![X5]:![X6]:((((~(in(X5,X4))|~(in(X6,X4)))|(in(set_union2(X5,X6),X4)&in(set_difference(X5,X6),X4)))|~(preboolean(X4)))&(((in(esk4_1(X4),X4)&in(esk5_1(X4),X4))&(~(in(set_union2(esk4_1(X4),esk5_1(X4)),X4))|~(in(set_difference(esk4_1(X4),esk5_1(X4)),X4))))|preboolean(X4))),inference(shift_quantors,[status(thm)],[78])).
% fof(80, plain,![X4]:![X5]:![X6]:((((in(set_union2(X5,X6),X4)|(~(in(X5,X4))|~(in(X6,X4))))|~(preboolean(X4)))&((in(set_difference(X5,X6),X4)|(~(in(X5,X4))|~(in(X6,X4))))|~(preboolean(X4))))&(((in(esk4_1(X4),X4)|preboolean(X4))&(in(esk5_1(X4),X4)|preboolean(X4)))&((~(in(set_union2(esk4_1(X4),esk5_1(X4)),X4))|~(in(set_difference(esk4_1(X4),esk5_1(X4)),X4)))|preboolean(X4)))),inference(distribute,[status(thm)],[79])).
% cnf(81,plain,(preboolean(X1)|~in(set_difference(esk4_1(X1),esk5_1(X1)),X1)|~in(set_union2(esk4_1(X1),esk5_1(X1)),X1)),inference(split_conjunct,[status(thm)],[80])).
% cnf(82,plain,(preboolean(X1)|in(esk5_1(X1),X1)),inference(split_conjunct,[status(thm)],[80])).
% cnf(83,plain,(preboolean(X1)|in(esk4_1(X1),X1)),inference(split_conjunct,[status(thm)],[80])).
% fof(109, plain,![X3]:![X4]:set_union2(X3,X4)=symmetric_difference(X3,set_difference(X4,X3)),inference(variable_rename,[status(thm)],[16])).
% cnf(110,plain,(set_union2(X1,X2)=symmetric_difference(X1,set_difference(X2,X1))),inference(split_conjunct,[status(thm)],[109])).
% fof(114, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[18])).
% cnf(115,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[114])).
% fof(202, negated_conjecture,?[X1]:(~(empty(X1))&(![X2]:(~(element(X2,X1))|![X3]:(~(element(X3,X1))|(in(symmetric_difference(X2,X3),X1)&in(set_difference(X2,X3),X1))))&~(preboolean(X1)))),inference(fof_nnf,[status(thm)],[54])).
% fof(203, negated_conjecture,?[X4]:(~(empty(X4))&(![X5]:(~(element(X5,X4))|![X6]:(~(element(X6,X4))|(in(symmetric_difference(X5,X6),X4)&in(set_difference(X5,X6),X4))))&~(preboolean(X4)))),inference(variable_rename,[status(thm)],[202])).
% fof(204, negated_conjecture,(~(empty(esk13_0))&(![X5]:(~(element(X5,esk13_0))|![X6]:(~(element(X6,esk13_0))|(in(symmetric_difference(X5,X6),esk13_0)&in(set_difference(X5,X6),esk13_0))))&~(preboolean(esk13_0)))),inference(skolemize,[status(esa)],[203])).
% fof(205, negated_conjecture,![X5]:![X6]:((((~(element(X6,esk13_0))|(in(symmetric_difference(X5,X6),esk13_0)&in(set_difference(X5,X6),esk13_0)))|~(element(X5,esk13_0)))&~(preboolean(esk13_0)))&~(empty(esk13_0))),inference(shift_quantors,[status(thm)],[204])).
% fof(206, negated_conjecture,![X5]:![X6]:(((((in(symmetric_difference(X5,X6),esk13_0)|~(element(X6,esk13_0)))|~(element(X5,esk13_0)))&((in(set_difference(X5,X6),esk13_0)|~(element(X6,esk13_0)))|~(element(X5,esk13_0))))&~(preboolean(esk13_0)))&~(empty(esk13_0))),inference(distribute,[status(thm)],[205])).
% cnf(208,negated_conjecture,(~preboolean(esk13_0)),inference(split_conjunct,[status(thm)],[206])).
% cnf(209,negated_conjecture,(in(set_difference(X1,X2),esk13_0)|~element(X1,esk13_0)|~element(X2,esk13_0)),inference(split_conjunct,[status(thm)],[206])).
% cnf(210,negated_conjecture,(in(symmetric_difference(X1,X2),esk13_0)|~element(X1,esk13_0)|~element(X2,esk13_0)),inference(split_conjunct,[status(thm)],[206])).
% cnf(213,plain,(symmetric_difference(X1,set_difference(X2,X1))=symmetric_difference(X2,set_difference(X1,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[115,110,theory(equality)]),110,theory(equality)]),['unfolding']).
% cnf(218,plain,(preboolean(X1)|~in(symmetric_difference(esk4_1(X1),set_difference(esk5_1(X1),esk4_1(X1))),X1)|~in(set_difference(esk4_1(X1),esk5_1(X1)),X1)),inference(rw,[status(thm)],[81,110,theory(equality)]),['unfolding']).
% cnf(305,negated_conjecture,(in(symmetric_difference(X2,set_difference(X1,X2)),esk13_0)|~element(set_difference(X2,X1),esk13_0)|~element(X1,esk13_0)),inference(spm,[status(thm)],[210,213,theory(equality)])).
% cnf(923,negated_conjecture,(preboolean(esk13_0)|~in(set_difference(esk4_1(esk13_0),esk5_1(esk13_0)),esk13_0)|~element(set_difference(esk4_1(esk13_0),esk5_1(esk13_0)),esk13_0)|~element(esk5_1(esk13_0),esk13_0)),inference(spm,[status(thm)],[218,305,theory(equality)])).
% cnf(940,negated_conjecture,(~in(set_difference(esk4_1(esk13_0),esk5_1(esk13_0)),esk13_0)|~element(set_difference(esk4_1(esk13_0),esk5_1(esk13_0)),esk13_0)|~element(esk5_1(esk13_0),esk13_0)),inference(sr,[status(thm)],[923,208,theory(equality)])).
% cnf(6348,negated_conjecture,(~element(esk5_1(esk13_0),esk13_0)|~in(set_difference(esk4_1(esk13_0),esk5_1(esk13_0)),esk13_0)),inference(csr,[status(thm)],[940,69])).
% cnf(6352,negated_conjecture,(~element(esk5_1(esk13_0),esk13_0)|~element(esk4_1(esk13_0),esk13_0)),inference(spm,[status(thm)],[6348,209,theory(equality)])).
% cnf(7039,negated_conjecture,(~element(esk4_1(esk13_0),esk13_0)|~in(esk5_1(esk13_0),esk13_0)),inference(spm,[status(thm)],[6352,69,theory(equality)])).
% cnf(7040,negated_conjecture,(~in(esk5_1(esk13_0),esk13_0)|~in(esk4_1(esk13_0),esk13_0)),inference(spm,[status(thm)],[7039,69,theory(equality)])).
% cnf(7041,negated_conjecture,(preboolean(esk13_0)|~in(esk4_1(esk13_0),esk13_0)),inference(spm,[status(thm)],[7040,82,theory(equality)])).
% cnf(7042,negated_conjecture,(~in(esk4_1(esk13_0),esk13_0)),inference(sr,[status(thm)],[7041,208,theory(equality)])).
% cnf(7043,negated_conjecture,(preboolean(esk13_0)),inference(spm,[status(thm)],[7042,83,theory(equality)])).
% cnf(7044,negated_conjecture,($false),inference(sr,[status(thm)],[7043,208,theory(equality)])).
% cnf(7045,negated_conjecture,($false),7044,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1067
% # ...of these trivial : 14
% # ...subsumed : 791
% # ...remaining for further processing: 262
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 16
% # Generated clauses : 4244
% # ...of the previous two non-trivial : 3446
% # Contextual simplify-reflections : 353
% # Paramodulations : 4235
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 234
% # Positive orientable unit clauses: 34
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 12
% # Non-unit-clauses : 186
% # Current number of unprocessed clauses: 2420
% # ...number of literals in the above : 10384
% # Clause-clause subsumption calls (NU) : 9936
% # Rec. Clause-clause subsumption calls : 8518
% # Unit Clause-clause subsumption calls : 94
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 26
% # Indexed BW rewrite successes : 11
% # Backwards rewriting index: 191 leaves, 1.50+/-1.148 terms/leaf
% # Paramod-from index: 80 leaves, 1.30+/-0.731 terms/leaf
% # Paramod-into index: 178 leaves, 1.34+/-0.893 terms/leaf
% # -------------------------------------------------
% # User time : 0.141 s
% # System time : 0.008 s
% # Total time : 0.149 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.32 CPU 0.38 WC
% FINAL PrfWatch: 0.32 CPU 0.38 WC
% SZS output end Solution for /tmp/SystemOnTPTP11543/SEU104+1.tptp
%
%------------------------------------------------------------------------------