TSTP Solution File: SEU309+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU309+2 : 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 03:22:30 EST 2010
% Result : Theorem 22.54s
% Output : Solution 22.54s
% 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/SystemOnTPTP1323/SEU309+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1323/SEU309+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1323/SEU309+2.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 1483
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.59 CPU 2.03 WC
% PrfWatch: 3.58 CPU 4.04 WC
% PrfWatch: 5.57 CPU 6.04 WC
% # Preprocessing time : 0.222 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.55 CPU 8.05 WC
% PrfWatch: 9.55 CPU 10.06 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(one_sorted_str(X1)=>cast_as_carrier_subset(X1)=the_carrier(X1)),file('/tmp/SRASS.s.p', d3_pre_topc)).
% fof(7, axiom,![X1]:(one_sorted_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>subset_complement(the_carrier(X1),X2)=subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2))),file('/tmp/SRASS.s.p', t17_pre_topc)).
% fof(15, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>subset_complement(X1,subset_complement(X1,X2))=X2),file('/tmp/SRASS.s.p', involutiveness_k3_subset_1)).
% fof(24, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>element(subset_complement(X1,X2),powerset(X1))),file('/tmp/SRASS.s.p', dt_k3_subset_1)).
% fof(30, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>subset_complement(X1,X2)=set_difference(X1,X2)),file('/tmp/SRASS.s.p', d5_subset_1)).
% fof(496, conjecture,![X1]:(one_sorted_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2))=X2)),file('/tmp/SRASS.s.p', t22_pre_topc)).
% fof(497, negated_conjecture,~(![X1]:(one_sorted_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2))=X2))),inference(assume_negation,[status(cth)],[496])).
% fof(577, plain,![X1]:(~(one_sorted_str(X1))|cast_as_carrier_subset(X1)=the_carrier(X1)),inference(fof_nnf,[status(thm)],[1])).
% fof(578, plain,![X2]:(~(one_sorted_str(X2))|cast_as_carrier_subset(X2)=the_carrier(X2)),inference(variable_rename,[status(thm)],[577])).
% cnf(579,plain,(cast_as_carrier_subset(X1)=the_carrier(X1)|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[578])).
% fof(595, plain,![X1]:(~(one_sorted_str(X1))|![X2]:(~(element(X2,powerset(the_carrier(X1))))|subset_complement(the_carrier(X1),X2)=subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(596, plain,![X3]:(~(one_sorted_str(X3))|![X4]:(~(element(X4,powerset(the_carrier(X3))))|subset_complement(the_carrier(X3),X4)=subset_difference(the_carrier(X3),cast_as_carrier_subset(X3),X4))),inference(variable_rename,[status(thm)],[595])).
% fof(597, plain,![X3]:![X4]:((~(element(X4,powerset(the_carrier(X3))))|subset_complement(the_carrier(X3),X4)=subset_difference(the_carrier(X3),cast_as_carrier_subset(X3),X4))|~(one_sorted_str(X3))),inference(shift_quantors,[status(thm)],[596])).
% cnf(598,plain,(subset_complement(the_carrier(X1),X2)=subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2)|~one_sorted_str(X1)|~element(X2,powerset(the_carrier(X1)))),inference(split_conjunct,[status(thm)],[597])).
% fof(625, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|subset_complement(X1,subset_complement(X1,X2))=X2),inference(fof_nnf,[status(thm)],[15])).
% fof(626, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|subset_complement(X3,subset_complement(X3,X4))=X4),inference(variable_rename,[status(thm)],[625])).
% cnf(627,plain,(subset_complement(X1,subset_complement(X1,X2))=X2|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[626])).
% fof(661, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|element(subset_complement(X1,X2),powerset(X1))),inference(fof_nnf,[status(thm)],[24])).
% fof(662, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|element(subset_complement(X3,X4),powerset(X3))),inference(variable_rename,[status(thm)],[661])).
% cnf(663,plain,(element(subset_complement(X1,X2),powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[662])).
% fof(678, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|subset_complement(X1,X2)=set_difference(X1,X2)),inference(fof_nnf,[status(thm)],[30])).
% fof(679, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|subset_complement(X3,X4)=set_difference(X3,X4)),inference(variable_rename,[status(thm)],[678])).
% cnf(680,plain,(subset_complement(X1,X2)=set_difference(X1,X2)|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[679])).
% fof(3694, negated_conjecture,?[X1]:(one_sorted_str(X1)&?[X2]:(element(X2,powerset(the_carrier(X1)))&~(subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2))=X2))),inference(fof_nnf,[status(thm)],[497])).
% fof(3695, negated_conjecture,?[X3]:(one_sorted_str(X3)&?[X4]:(element(X4,powerset(the_carrier(X3)))&~(subset_difference(the_carrier(X3),cast_as_carrier_subset(X3),subset_difference(the_carrier(X3),cast_as_carrier_subset(X3),X4))=X4))),inference(variable_rename,[status(thm)],[3694])).
% fof(3696, negated_conjecture,(one_sorted_str(esk310_0)&(element(esk311_0,powerset(the_carrier(esk310_0)))&~(subset_difference(the_carrier(esk310_0),cast_as_carrier_subset(esk310_0),subset_difference(the_carrier(esk310_0),cast_as_carrier_subset(esk310_0),esk311_0))=esk311_0))),inference(skolemize,[status(esa)],[3695])).
% cnf(3697,negated_conjecture,(subset_difference(the_carrier(esk310_0),cast_as_carrier_subset(esk310_0),subset_difference(the_carrier(esk310_0),cast_as_carrier_subset(esk310_0),esk311_0))!=esk311_0),inference(split_conjunct,[status(thm)],[3696])).
% cnf(3698,negated_conjecture,(element(esk311_0,powerset(the_carrier(esk310_0)))),inference(split_conjunct,[status(thm)],[3696])).
% cnf(3699,negated_conjecture,(one_sorted_str(esk310_0)),inference(split_conjunct,[status(thm)],[3696])).
% cnf(5217,negated_conjecture,(cast_as_carrier_subset(esk310_0)=the_carrier(esk310_0)),inference(spm,[status(thm)],[579,3699,theory(equality)])).
% cnf(5696,negated_conjecture,(subset_complement(the_carrier(esk310_0),esk311_0)=set_difference(the_carrier(esk310_0),esk311_0)),inference(spm,[status(thm)],[680,3698,theory(equality)])).
% cnf(7034,negated_conjecture,(subset_complement(the_carrier(esk310_0),subset_complement(the_carrier(esk310_0),esk311_0))=esk311_0),inference(spm,[status(thm)],[627,3698,theory(equality)])).
% cnf(8293,negated_conjecture,(subset_difference(the_carrier(esk310_0),cast_as_carrier_subset(esk310_0),esk311_0)=subset_complement(the_carrier(esk310_0),esk311_0)|~one_sorted_str(esk310_0)),inference(spm,[status(thm)],[598,3698,theory(equality)])).
% cnf(8311,negated_conjecture,(subset_difference(the_carrier(esk310_0),cast_as_carrier_subset(esk310_0),esk311_0)=subset_complement(the_carrier(esk310_0),esk311_0)|$false),inference(rw,[status(thm)],[8293,3699,theory(equality)])).
% cnf(8312,negated_conjecture,(subset_difference(the_carrier(esk310_0),cast_as_carrier_subset(esk310_0),esk311_0)=subset_complement(the_carrier(esk310_0),esk311_0)),inference(cn,[status(thm)],[8311,theory(equality)])).
% cnf(96180,negated_conjecture,(subset_difference(the_carrier(esk310_0),the_carrier(esk310_0),subset_difference(the_carrier(esk310_0),the_carrier(esk310_0),esk311_0))!=esk311_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3697,5217,theory(equality)]),5217,theory(equality)])).
% cnf(97085,negated_conjecture,(subset_difference(the_carrier(esk310_0),the_carrier(esk310_0),esk311_0)=subset_complement(the_carrier(esk310_0),esk311_0)),inference(rw,[status(thm)],[8312,5217,theory(equality)])).
% cnf(97091,negated_conjecture,(subset_difference(the_carrier(esk310_0),the_carrier(esk310_0),subset_complement(the_carrier(esk310_0),esk311_0))!=esk311_0),inference(rw,[status(thm)],[96180,97085,theory(equality)])).
% cnf(98171,negated_conjecture,(element(set_difference(the_carrier(esk310_0),esk311_0),powerset(the_carrier(esk310_0)))|~element(esk311_0,powerset(the_carrier(esk310_0)))),inference(spm,[status(thm)],[663,5696,theory(equality)])).
% cnf(98177,negated_conjecture,(subset_difference(the_carrier(esk310_0),the_carrier(esk310_0),set_difference(the_carrier(esk310_0),esk311_0))!=esk311_0),inference(rw,[status(thm)],[97091,5696,theory(equality)])).
% cnf(98178,negated_conjecture,(element(set_difference(the_carrier(esk310_0),esk311_0),powerset(the_carrier(esk310_0)))|$false),inference(rw,[status(thm)],[98171,3698,theory(equality)])).
% cnf(98179,negated_conjecture,(element(set_difference(the_carrier(esk310_0),esk311_0),powerset(the_carrier(esk310_0)))),inference(cn,[status(thm)],[98178,theory(equality)])).
% cnf(100233,negated_conjecture,(subset_complement(the_carrier(esk310_0),set_difference(the_carrier(esk310_0),esk311_0))=esk311_0),inference(rw,[status(thm)],[7034,5696,theory(equality)])).
% cnf(104760,negated_conjecture,(subset_difference(the_carrier(esk310_0),cast_as_carrier_subset(esk310_0),set_difference(the_carrier(esk310_0),esk311_0))=subset_complement(the_carrier(esk310_0),set_difference(the_carrier(esk310_0),esk311_0))|~one_sorted_str(esk310_0)),inference(spm,[status(thm)],[598,98179,theory(equality)])).
% cnf(104784,negated_conjecture,(subset_difference(the_carrier(esk310_0),the_carrier(esk310_0),set_difference(the_carrier(esk310_0),esk311_0))=subset_complement(the_carrier(esk310_0),set_difference(the_carrier(esk310_0),esk311_0))|~one_sorted_str(esk310_0)),inference(rw,[status(thm)],[104760,5217,theory(equality)])).
% cnf(104785,negated_conjecture,(subset_difference(the_carrier(esk310_0),the_carrier(esk310_0),set_difference(the_carrier(esk310_0),esk311_0))=esk311_0|~one_sorted_str(esk310_0)),inference(rw,[status(thm)],[104784,100233,theory(equality)])).
% cnf(104786,negated_conjecture,(subset_difference(the_carrier(esk310_0),the_carrier(esk310_0),set_difference(the_carrier(esk310_0),esk311_0))=esk311_0|$false),inference(rw,[status(thm)],[104785,3699,theory(equality)])).
% cnf(104787,negated_conjecture,(subset_difference(the_carrier(esk310_0),the_carrier(esk310_0),set_difference(the_carrier(esk310_0),esk311_0))=esk311_0),inference(cn,[status(thm)],[104786,theory(equality)])).
% cnf(104788,negated_conjecture,($false),inference(sr,[status(thm)],[104787,98177,theory(equality)])).
% cnf(104789,negated_conjecture,($false),104788,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4210
% # ...of these trivial : 30
% # ...subsumed : 307
% # ...remaining for further processing: 3873
% # Other redundant clauses eliminated : 508
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 60
% # Generated clauses : 95841
% # ...of the previous two non-trivial : 94435
% # Contextual simplify-reflections : 229
% # Paramodulations : 95249
% # Factorizations : 14
% # Equation resolutions : 625
% # Current number of processed clauses: 1937
% # Positive orientable unit clauses: 198
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 39
% # Non-unit-clauses : 1697
% # Current number of unprocessed clauses: 90971
% # ...number of literals in the above : 619157
% # Clause-clause subsumption calls (NU) : 2506475
% # Rec. Clause-clause subsumption calls : 138654
% # Unit Clause-clause subsumption calls : 15367
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 71
% # Indexed BW rewrite successes : 47
% # Backwards rewriting index: 1532 leaves, 1.66+/-3.795 terms/leaf
% # Paramod-from index: 591 leaves, 1.11+/-1.704 terms/leaf
% # Paramod-into index: 1190 leaves, 1.41+/-3.160 terms/leaf
% # -------------------------------------------------
% # User time : 7.162 s
% # System time : 0.205 s
% # Total time : 7.367 s
% # Maximum resident set size: 0 pages
% PrfWatch: 9.70 CPU 10.33 WC
% FINAL PrfWatch: 9.70 CPU 10.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP1323/SEU309+2.tptp
%
%------------------------------------------------------------------------------