TSTP Solution File: SEU126+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU126+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 : art01.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:11:07 EST 2010
% Result : Theorem 1.07s
% Output : Solution 1.07s
% 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/SystemOnTPTP9011/SEU126+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9011/SEU126+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9011/SEU126+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 9107
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(5, 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(9, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(19, conjecture,![X1]:![X2]:(subset(X1,X2)=>set_union2(X1,X2)=X2),file('/tmp/SRASS.s.p', t12_xboole_1)).
% fof(20, negated_conjecture,~(![X1]:![X2]:(subset(X1,X2)=>set_union2(X1,X2)=X2)),inference(assume_negation,[status(cth)],[19])).
% fof(25, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(26,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(37, 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)],[5])).
% fof(38, 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)],[37])).
% fof(39, 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(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))&~(in(esk1_3(X5,X6,X7),X6))))&(in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)|in(esk1_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(skolemize,[status(esa)],[38])).
% fof(40, 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(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))&~(in(esk1_3(X5,X6,X7),X6))))&(in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)|in(esk1_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(shift_quantors,[status(thm)],[39])).
% fof(41, 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(esk1_3(X5,X6,X7),X5))|~(in(esk1_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6))&((~(in(esk1_3(X5,X6,X7),X6))|~(in(esk1_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6)))&((in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)|in(esk1_3(X5,X6,X7),X6)))|X7=set_union2(X5,X6)))),inference(distribute,[status(thm)],[40])).
% cnf(42,plain,(X1=set_union2(X2,X3)|in(esk1_3(X2,X3,X1),X3)|in(esk1_3(X2,X3,X1),X2)|in(esk1_3(X2,X3,X1),X1)),inference(split_conjunct,[status(thm)],[41])).
% cnf(44,plain,(X1=set_union2(X2,X3)|~in(esk1_3(X2,X3,X1),X1)|~in(esk1_3(X2,X3,X1),X2)),inference(split_conjunct,[status(thm)],[41])).
% fof(56, 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)],[9])).
% fof(57, 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)],[56])).
% fof(58, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk2_2(X4,X5),X4)&~(in(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[57])).
% fof(59, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk2_2(X4,X5),X4)&~(in(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[58])).
% fof(60, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk2_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk2_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[59])).
% cnf(63,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(85, negated_conjecture,?[X1]:?[X2]:(subset(X1,X2)&~(set_union2(X1,X2)=X2)),inference(fof_nnf,[status(thm)],[20])).
% fof(86, negated_conjecture,?[X3]:?[X4]:(subset(X3,X4)&~(set_union2(X3,X4)=X4)),inference(variable_rename,[status(thm)],[85])).
% fof(87, negated_conjecture,(subset(esk5_0,esk6_0)&~(set_union2(esk5_0,esk6_0)=esk6_0)),inference(skolemize,[status(esa)],[86])).
% cnf(88,negated_conjecture,(set_union2(esk5_0,esk6_0)!=esk6_0),inference(split_conjunct,[status(thm)],[87])).
% cnf(89,negated_conjecture,(subset(esk5_0,esk6_0)),inference(split_conjunct,[status(thm)],[87])).
% cnf(94,negated_conjecture,(set_union2(esk6_0,esk5_0)!=esk6_0),inference(rw,[status(thm)],[88,26,theory(equality)])).
% cnf(116,negated_conjecture,(in(X1,esk6_0)|~in(X1,esk5_0)),inference(spm,[status(thm)],[63,89,theory(equality)])).
% cnf(169,negated_conjecture,(in(esk1_3(esk6_0,esk5_0,X1),esk5_0)|in(esk1_3(esk6_0,esk5_0,X1),esk6_0)|in(esk1_3(esk6_0,esk5_0,X1),X1)|X1!=esk6_0),inference(spm,[status(thm)],[94,42,theory(equality)])).
% cnf(205,negated_conjecture,(in(esk1_3(esk6_0,esk5_0,esk6_0),esk6_0)|in(esk1_3(esk6_0,esk5_0,esk6_0),esk5_0)),inference(er,[status(thm)],[169,theory(equality)])).
% cnf(275,negated_conjecture,(in(esk1_3(esk6_0,esk5_0,esk6_0),esk6_0)),inference(spm,[status(thm)],[116,205,theory(equality)])).
% cnf(279,negated_conjecture,(set_union2(esk6_0,esk5_0)=esk6_0|~in(esk1_3(esk6_0,esk5_0,esk6_0),esk6_0)),inference(spm,[status(thm)],[44,275,theory(equality)])).
% cnf(287,negated_conjecture,(set_union2(esk6_0,esk5_0)=esk6_0|$false),inference(rw,[status(thm)],[279,275,theory(equality)])).
% cnf(288,negated_conjecture,(set_union2(esk6_0,esk5_0)=esk6_0),inference(cn,[status(thm)],[287,theory(equality)])).
% cnf(289,negated_conjecture,($false),inference(sr,[status(thm)],[288,94,theory(equality)])).
% cnf(290,negated_conjecture,($false),289,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 75
% # ...of these trivial : 1
% # ...subsumed : 5
% # ...remaining for further processing: 69
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 3
% # Generated clauses : 171
% # ...of the previous two non-trivial : 128
% # Contextual simplify-reflections : 1
% # Paramodulations : 151
% # Factorizations : 2
% # Equation resolutions : 18
% # Current number of processed clauses: 37
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 4
% # Non-unit-clauses : 24
% # Current number of unprocessed clauses: 84
% # ...number of literals in the above : 347
% # Clause-clause subsumption calls (NU) : 58
% # Rec. Clause-clause subsumption calls : 58
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 19
% # Indexed BW rewrite successes : 14
% # Backwards rewriting index: 34 leaves, 1.50+/-1.007 terms/leaf
% # Paramod-from index: 12 leaves, 1.42+/-0.759 terms/leaf
% # Paramod-into index: 28 leaves, 1.43+/-0.979 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.006 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP9011/SEU126+1.tptp
%
%------------------------------------------------------------------------------