TSTP Solution File: SEU108+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU108+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 : art05.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:06:22 EST 2010
% Result : Theorem 22.06s
% Output : Solution 22.06s
% 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/SystemOnTPTP8811/SEU108+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8811/SEU108+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8811/SEU108+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 8907
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.01 WC
% PrfWatch: 3.93 CPU 4.02 WC
% PrfWatch: 5.92 CPU 6.02 WC
% PrfWatch: 7.91 CPU 8.03 WC
% PrfWatch: 9.90 CPU 10.03 WC
% PrfWatch: 11.90 CPU 12.04 WC
% PrfWatch: 13.88 CPU 14.04 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 15.87 CPU 16.05 WC
% PrfWatch: 17.86 CPU 18.05 WC
% PrfWatch: 19.86 CPU 20.06 WC
% # SZS output start CNFRefutation.
% fof(14, axiom,![X1]:![X2]:![X3]:((element(X2,powerset(X1))&element(X3,powerset(X1)))=>element(subset_union2(X1,X2,X3),powerset(X1))),file('/tmp/SRASS.s.p', dt_k4_subset_1)).
% fof(15, axiom,![X1]:![X2]:![X3]:((element(X2,powerset(X1))&element(X3,powerset(X1)))=>element(subset_difference(X1,X2,X3),powerset(X1))),file('/tmp/SRASS.s.p', dt_k6_subset_1)).
% fof(16, axiom,![X1]:![X2]:(element(X1,X2)=>(empty(X2)|in(X1,X2))),file('/tmp/SRASS.s.p', t2_subset)).
% fof(18, 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(29, axiom,![X1]:![X2]:(in(X1,X2)=>element(X1,X2)),file('/tmp/SRASS.s.p', t1_subset)).
% fof(31, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(37, axiom,![X1]:![X2]:![X3]:((element(X2,powerset(X1))&element(X3,powerset(X1)))=>subset_union2(X1,X2,X3)=set_union2(X2,X3)),file('/tmp/SRASS.s.p', redefinition_k4_subset_1)).
% fof(38, axiom,![X1]:![X2]:![X3]:((element(X2,powerset(X1))&element(X3,powerset(X1)))=>subset_difference(X1,X2,X3)=set_difference(X2,X3)),file('/tmp/SRASS.s.p', redefinition_k6_subset_1)).
% fof(43, conjecture,![X1]:preboolean(powerset(X1)),file('/tmp/SRASS.s.p', t20_finsub_1)).
% fof(44, negated_conjecture,~(![X1]:preboolean(powerset(X1))),inference(assume_negation,[status(cth)],[43])).
% fof(103, plain,![X1]:![X2]:![X3]:((~(element(X2,powerset(X1)))|~(element(X3,powerset(X1))))|element(subset_union2(X1,X2,X3),powerset(X1))),inference(fof_nnf,[status(thm)],[14])).
% fof(104, plain,![X4]:![X5]:![X6]:((~(element(X5,powerset(X4)))|~(element(X6,powerset(X4))))|element(subset_union2(X4,X5,X6),powerset(X4))),inference(variable_rename,[status(thm)],[103])).
% cnf(105,plain,(element(subset_union2(X1,X2,X3),powerset(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[104])).
% fof(106, plain,![X1]:![X2]:![X3]:((~(element(X2,powerset(X1)))|~(element(X3,powerset(X1))))|element(subset_difference(X1,X2,X3),powerset(X1))),inference(fof_nnf,[status(thm)],[15])).
% fof(107, plain,![X4]:![X5]:![X6]:((~(element(X5,powerset(X4)))|~(element(X6,powerset(X4))))|element(subset_difference(X4,X5,X6),powerset(X4))),inference(variable_rename,[status(thm)],[106])).
% cnf(108,plain,(element(subset_difference(X1,X2,X3),powerset(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[107])).
% fof(109, plain,![X1]:![X2]:(~(element(X1,X2))|(empty(X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[16])).
% fof(110, plain,![X3]:![X4]:(~(element(X3,X4))|(empty(X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[109])).
% cnf(111,plain,(in(X1,X2)|empty(X2)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[110])).
% fof(116, 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)],[18])).
% fof(117, 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)],[116])).
% fof(118, 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(esk7_1(X4),X4)&in(esk8_1(X4),X4))&(~(in(set_union2(esk7_1(X4),esk8_1(X4)),X4))|~(in(set_difference(esk7_1(X4),esk8_1(X4)),X4))))|preboolean(X4))),inference(skolemize,[status(esa)],[117])).
% fof(119, 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(esk7_1(X4),X4)&in(esk8_1(X4),X4))&(~(in(set_union2(esk7_1(X4),esk8_1(X4)),X4))|~(in(set_difference(esk7_1(X4),esk8_1(X4)),X4))))|preboolean(X4))),inference(shift_quantors,[status(thm)],[118])).
% fof(120, 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(esk7_1(X4),X4)|preboolean(X4))&(in(esk8_1(X4),X4)|preboolean(X4)))&((~(in(set_union2(esk7_1(X4),esk8_1(X4)),X4))|~(in(set_difference(esk7_1(X4),esk8_1(X4)),X4)))|preboolean(X4)))),inference(distribute,[status(thm)],[119])).
% cnf(121,plain,(preboolean(X1)|~in(set_difference(esk7_1(X1),esk8_1(X1)),X1)|~in(set_union2(esk7_1(X1),esk8_1(X1)),X1)),inference(split_conjunct,[status(thm)],[120])).
% cnf(122,plain,(preboolean(X1)|in(esk8_1(X1),X1)),inference(split_conjunct,[status(thm)],[120])).
% cnf(123,plain,(preboolean(X1)|in(esk7_1(X1),X1)),inference(split_conjunct,[status(thm)],[120])).
% fof(165, plain,![X1]:![X2]:(~(in(X1,X2))|element(X1,X2)),inference(fof_nnf,[status(thm)],[29])).
% fof(166, plain,![X3]:![X4]:(~(in(X3,X4))|element(X3,X4)),inference(variable_rename,[status(thm)],[165])).
% cnf(167,plain,(element(X1,X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[166])).
% fof(171, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[31])).
% fof(172, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[171])).
% cnf(173,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[172])).
% fof(185, plain,![X1]:![X2]:![X3]:((~(element(X2,powerset(X1)))|~(element(X3,powerset(X1))))|subset_union2(X1,X2,X3)=set_union2(X2,X3)),inference(fof_nnf,[status(thm)],[37])).
% fof(186, plain,![X4]:![X5]:![X6]:((~(element(X5,powerset(X4)))|~(element(X6,powerset(X4))))|subset_union2(X4,X5,X6)=set_union2(X5,X6)),inference(variable_rename,[status(thm)],[185])).
% cnf(187,plain,(subset_union2(X1,X2,X3)=set_union2(X2,X3)|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[186])).
% fof(188, plain,![X1]:![X2]:![X3]:((~(element(X2,powerset(X1)))|~(element(X3,powerset(X1))))|subset_difference(X1,X2,X3)=set_difference(X2,X3)),inference(fof_nnf,[status(thm)],[38])).
% fof(189, plain,![X4]:![X5]:![X6]:((~(element(X5,powerset(X4)))|~(element(X6,powerset(X4))))|subset_difference(X4,X5,X6)=set_difference(X5,X6)),inference(variable_rename,[status(thm)],[188])).
% cnf(190,plain,(subset_difference(X1,X2,X3)=set_difference(X2,X3)|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[189])).
% fof(209, negated_conjecture,?[X1]:~(preboolean(powerset(X1))),inference(fof_nnf,[status(thm)],[44])).
% fof(210, negated_conjecture,?[X2]:~(preboolean(powerset(X2))),inference(variable_rename,[status(thm)],[209])).
% fof(211, negated_conjecture,~(preboolean(powerset(esk13_0))),inference(skolemize,[status(esa)],[210])).
% cnf(212,negated_conjecture,(~preboolean(powerset(esk13_0))),inference(split_conjunct,[status(thm)],[211])).
% cnf(236,plain,(preboolean(X1)|~empty(X1)),inference(spm,[status(thm)],[173,123,theory(equality)])).
% cnf(237,plain,(element(esk7_1(X1),X1)|preboolean(X1)),inference(spm,[status(thm)],[167,123,theory(equality)])).
% cnf(240,plain,(element(esk8_1(X1),X1)|preboolean(X1)),inference(spm,[status(thm)],[167,122,theory(equality)])).
% cnf(294,plain,(preboolean(X1)|empty(X1)|~in(set_union2(esk7_1(X1),esk8_1(X1)),X1)|~element(set_difference(esk7_1(X1),esk8_1(X1)),X1)),inference(spm,[status(thm)],[121,111,theory(equality)])).
% cnf(300,plain,(element(set_union2(X2,X3),powerset(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(spm,[status(thm)],[105,187,theory(equality)])).
% cnf(305,plain,(element(set_difference(X2,X3),powerset(X1))|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(spm,[status(thm)],[108,190,theory(equality)])).
% cnf(736,plain,(preboolean(X1)|~in(set_union2(esk7_1(X1),esk8_1(X1)),X1)|~element(set_difference(esk7_1(X1),esk8_1(X1)),X1)),inference(csr,[status(thm)],[294,173])).
% cnf(737,plain,(preboolean(X1)|empty(X1)|~element(set_difference(esk7_1(X1),esk8_1(X1)),X1)|~element(set_union2(esk7_1(X1),esk8_1(X1)),X1)),inference(spm,[status(thm)],[736,111,theory(equality)])).
% cnf(5198,plain,(preboolean(X1)|~element(set_difference(esk7_1(X1),esk8_1(X1)),X1)|~element(set_union2(esk7_1(X1),esk8_1(X1)),X1)),inference(csr,[status(thm)],[737,236])).
% cnf(5199,plain,(preboolean(powerset(X1))|~element(set_union2(esk7_1(powerset(X1)),esk8_1(powerset(X1))),powerset(X1))|~element(esk8_1(powerset(X1)),powerset(X1))|~element(esk7_1(powerset(X1)),powerset(X1))),inference(spm,[status(thm)],[5198,305,theory(equality)])).
% cnf(386099,plain,(preboolean(powerset(X1))|~element(set_union2(esk7_1(powerset(X1)),esk8_1(powerset(X1))),powerset(X1))|~element(esk8_1(powerset(X1)),powerset(X1))),inference(csr,[status(thm)],[5199,237])).
% cnf(386100,plain,(preboolean(powerset(X1))|~element(set_union2(esk7_1(powerset(X1)),esk8_1(powerset(X1))),powerset(X1))),inference(csr,[status(thm)],[386099,240])).
% cnf(386108,plain,(preboolean(powerset(X1))|~element(esk8_1(powerset(X1)),powerset(X1))|~element(esk7_1(powerset(X1)),powerset(X1))),inference(spm,[status(thm)],[386100,300,theory(equality)])).
% cnf(386125,plain,(preboolean(powerset(X1))|~element(esk8_1(powerset(X1)),powerset(X1))),inference(csr,[status(thm)],[386108,237])).
% cnf(386126,plain,(preboolean(powerset(X1))),inference(csr,[status(thm)],[386125,240])).
% cnf(388235,negated_conjecture,($false),inference(rw,[status(thm)],[212,386126,theory(equality)])).
% cnf(388236,negated_conjecture,($false),inference(cn,[status(thm)],[388235,theory(equality)])).
% cnf(388237,negated_conjecture,($false),388236,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 22938
% # ...of these trivial : 184
% # ...subsumed : 14147
% # ...remaining for further processing: 8607
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 311
% # Backward-rewritten : 2131
% # Generated clauses : 289979
% # ...of the previous two non-trivial : 253032
% # Contextual simplify-reflections : 8437
% # Paramodulations : 289973
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 6094
% # Positive orientable unit clauses: 408
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 10
% # Non-unit-clauses : 5675
% # Current number of unprocessed clauses: 139442
% # ...number of literals in the above : 562587
% # Clause-clause subsumption calls (NU) : 2411732
% # Rec. Clause-clause subsumption calls : 1221714
% # Unit Clause-clause subsumption calls : 37918
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 35514
% # Indexed BW rewrite successes : 203
% # Backwards rewriting index: 782 leaves, 13.53+/-36.525 terms/leaf
% # Paramod-from index: 309 leaves, 13.35+/-34.971 terms/leaf
% # Paramod-into index: 739 leaves, 12.79+/-32.603 terms/leaf
% # -------------------------------------------------
% # User time : 15.053 s
% # System time : 0.491 s
% # Total time : 15.544 s
% # Maximum resident set size: 0 pages
% PrfWatch: 21.15 CPU 21.39 WC
% FINAL PrfWatch: 21.15 CPU 21.39 WC
% SZS output end Solution for /tmp/SystemOnTPTP8811/SEU108+1.tptp
%
%------------------------------------------------------------------------------