%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU308+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 : art07.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:05 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP5434/SEU308+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5434/SEU308+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5434/SEU308+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 5530
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:(one_sorted_str(X1)=>element(cast_as_carrier_subset(X1),powerset(the_carrier(X1)))),file('/tmp/SRASS.s.p', dt_k2_pre_topc)).
% fof(7, axiom,![X1]:(one_sorted_str(X1)=>cast_as_carrier_subset(X1)=the_carrier(X1)),file('/tmp/SRASS.s.p', d3_pre_topc)).
% fof(8, 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(9, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>subset_complement(X1,X2)=set_difference(X1,X2)),file('/tmp/SRASS.s.p', d5_subset_1)).
% fof(53, conjecture,![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(54, negated_conjecture,~(![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(assume_negation,[status(cth)],[53])).
% fof(68, plain,![X1]:(~(one_sorted_str(X1))|element(cast_as_carrier_subset(X1),powerset(the_carrier(X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(69, plain,![X2]:(~(one_sorted_str(X2))|element(cast_as_carrier_subset(X2),powerset(the_carrier(X2)))),inference(variable_rename,[status(thm)],[68])).
% cnf(70,plain,(element(cast_as_carrier_subset(X1),powerset(the_carrier(X1)))|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[69])).
% fof(77, plain,![X1]:(~(one_sorted_str(X1))|cast_as_carrier_subset(X1)=the_carrier(X1)),inference(fof_nnf,[status(thm)],[7])).
% fof(78, plain,![X2]:(~(one_sorted_str(X2))|cast_as_carrier_subset(X2)=the_carrier(X2)),inference(variable_rename,[status(thm)],[77])).
% cnf(79,plain,(cast_as_carrier_subset(X1)=the_carrier(X1)|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(80, 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)],[8])).
% fof(81, 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)],[80])).
% cnf(82,plain,(subset_difference(X1,X2,X3)=set_difference(X2,X3)|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[81])).
% fof(83, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|subset_complement(X1,X2)=set_difference(X1,X2)),inference(fof_nnf,[status(thm)],[9])).
% fof(84, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|subset_complement(X3,X4)=set_difference(X3,X4)),inference(variable_rename,[status(thm)],[83])).
% cnf(85,plain,(subset_complement(X1,X2)=set_difference(X1,X2)|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[84])).
% fof(269, negated_conjecture,?[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)],[54])).
% fof(270, negated_conjecture,?[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)],[269])).
% fof(271, negated_conjecture,(one_sorted_str(esk6_0)&(element(esk7_0,powerset(the_carrier(esk6_0)))&~(subset_complement(the_carrier(esk6_0),esk7_0)=subset_difference(the_carrier(esk6_0),cast_as_carrier_subset(esk6_0),esk7_0)))),inference(skolemize,[status(esa)],[270])).
% cnf(272,negated_conjecture,(subset_complement(the_carrier(esk6_0),esk7_0)!=subset_difference(the_carrier(esk6_0),cast_as_carrier_subset(esk6_0),esk7_0)),inference(split_conjunct,[status(thm)],[271])).
% cnf(273,negated_conjecture,(element(esk7_0,powerset(the_carrier(esk6_0)))),inference(split_conjunct,[status(thm)],[271])).
% cnf(274,negated_conjecture,(one_sorted_str(esk6_0)),inference(split_conjunct,[status(thm)],[271])).
% cnf(602,negated_conjecture,(set_difference(cast_as_carrier_subset(esk6_0),esk7_0)!=subset_complement(the_carrier(esk6_0),esk7_0)|~element(esk7_0,powerset(the_carrier(esk6_0)))|~element(cast_as_carrier_subset(esk6_0),powerset(the_carrier(esk6_0)))),inference(spm,[status(thm)],[272,82,theory(equality)])).
% cnf(604,negated_conjecture,(set_difference(cast_as_carrier_subset(esk6_0),esk7_0)!=subset_complement(the_carrier(esk6_0),esk7_0)|$false|~element(cast_as_carrier_subset(esk6_0),powerset(the_carrier(esk6_0)))),inference(rw,[status(thm)],[602,273,theory(equality)])).
% cnf(605,negated_conjecture,(set_difference(cast_as_carrier_subset(esk6_0),esk7_0)!=subset_complement(the_carrier(esk6_0),esk7_0)|~element(cast_as_carrier_subset(esk6_0),powerset(the_carrier(esk6_0)))),inference(cn,[status(thm)],[604,theory(equality)])).
% cnf(610,negated_conjecture,(subset_complement(the_carrier(esk6_0),esk7_0)!=set_difference(cast_as_carrier_subset(esk6_0),esk7_0)|~one_sorted_str(esk6_0)),inference(spm,[status(thm)],[605,70,theory(equality)])).
% cnf(613,negated_conjecture,(subset_complement(the_carrier(esk6_0),esk7_0)!=set_difference(cast_as_carrier_subset(esk6_0),esk7_0)|$false),inference(rw,[status(thm)],[610,274,theory(equality)])).
% cnf(614,negated_conjecture,(subset_complement(the_carrier(esk6_0),esk7_0)!=set_difference(cast_as_carrier_subset(esk6_0),esk7_0)),inference(cn,[status(thm)],[613,theory(equality)])).
% cnf(615,negated_conjecture,(set_difference(the_carrier(esk6_0),esk7_0)!=set_difference(cast_as_carrier_subset(esk6_0),esk7_0)|~element(esk7_0,powerset(the_carrier(esk6_0)))),inference(spm,[status(thm)],[614,85,theory(equality)])).
% cnf(616,negated_conjecture,(set_difference(the_carrier(esk6_0),esk7_0)!=set_difference(cast_as_carrier_subset(esk6_0),esk7_0)|$false),inference(rw,[status(thm)],[615,273,theory(equality)])).
% cnf(617,negated_conjecture,(set_difference(the_carrier(esk6_0),esk7_0)!=set_difference(cast_as_carrier_subset(esk6_0),esk7_0)),inference(cn,[status(thm)],[616,theory(equality)])).
% cnf(620,negated_conjecture,(~one_sorted_str(esk6_0)),inference(spm,[status(thm)],[617,79,theory(equality)])).
% cnf(621,negated_conjecture,($false),inference(rw,[status(thm)],[620,274,theory(equality)])).
% cnf(622,negated_conjecture,($false),inference(cn,[status(thm)],[621,theory(equality)])).
% cnf(623,negated_conjecture,($false),622,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 199
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 198
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 283
% # ...of the previous two non-trivial : 254
% # Contextual simplify-reflections : 0
% # Paramodulations : 283
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 100
% # Positive orientable unit clauses: 19
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 75
% # Current number of unprocessed clauses: 210
% # ...number of literals in the above : 580
% # Clause-clause subsumption calls (NU) : 40
% # Rec. Clause-clause subsumption calls : 40
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 72 leaves, 1.24+/-0.656 terms/leaf
% # Paramod-from index: 37 leaves, 1.03+/-0.162 terms/leaf
% # Paramod-into index: 63 leaves, 1.10+/-0.387 terms/leaf
% # -------------------------------------------------
% # User time : 0.029 s
% # System time : 0.003 s
% # Total time : 0.032 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP5434/SEU308+1.tptp
%
%------------------------------------------------------------------------------