%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU307+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 : art09.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:21:46 EST 2010
% Result : Theorem 1.02s
% Output : Solution 1.02s
% 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/SystemOnTPTP27548/SEU307+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27548/SEU307+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27548/SEU307+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 27644
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, 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_intersection2(X1,X2,X3)=set_intersection2(X2,X3)),file('/tmp/SRASS.s.p', redefinition_k5_subset_1)).
% fof(13, axiom,![X1]:![X2]:(element(X1,powerset(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t3_subset)).
% fof(32, axiom,![X1]:![X2]:(subset(X1,X2)=>set_intersection2(X1,X2)=X1),file('/tmp/SRASS.s.p', t28_xboole_1)).
% fof(59, conjecture,![X1]:(one_sorted_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>subset_intersection2(the_carrier(X1),X2,cast_as_carrier_subset(X1))=X2)),file('/tmp/SRASS.s.p', t15_pre_topc)).
% fof(60, negated_conjecture,~(![X1]:(one_sorted_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>subset_intersection2(the_carrier(X1),X2,cast_as_carrier_subset(X1))=X2))),inference(assume_negation,[status(cth)],[59])).
% fof(77, plain,![X1]:(~(one_sorted_str(X1))|element(cast_as_carrier_subset(X1),powerset(the_carrier(X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(78, plain,![X2]:(~(one_sorted_str(X2))|element(cast_as_carrier_subset(X2),powerset(the_carrier(X2)))),inference(variable_rename,[status(thm)],[77])).
% cnf(79,plain,(element(cast_as_carrier_subset(X1),powerset(the_carrier(X1)))|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(83, plain,![X1]:(~(one_sorted_str(X1))|cast_as_carrier_subset(X1)=the_carrier(X1)),inference(fof_nnf,[status(thm)],[7])).
% fof(84, plain,![X2]:(~(one_sorted_str(X2))|cast_as_carrier_subset(X2)=the_carrier(X2)),inference(variable_rename,[status(thm)],[83])).
% cnf(85,plain,(cast_as_carrier_subset(X1)=the_carrier(X1)|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[84])).
% fof(86, plain,![X1]:![X2]:![X3]:((~(element(X2,powerset(X1)))|~(element(X3,powerset(X1))))|subset_intersection2(X1,X2,X3)=set_intersection2(X2,X3)),inference(fof_nnf,[status(thm)],[8])).
% fof(87, plain,![X4]:![X5]:![X6]:((~(element(X5,powerset(X4)))|~(element(X6,powerset(X4))))|subset_intersection2(X4,X5,X6)=set_intersection2(X5,X6)),inference(variable_rename,[status(thm)],[86])).
% cnf(88,plain,(subset_intersection2(X1,X2,X3)=set_intersection2(X2,X3)|~element(X3,powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[87])).
% fof(106, plain,![X1]:![X2]:((~(element(X1,powerset(X2)))|subset(X1,X2))&(~(subset(X1,X2))|element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[13])).
% fof(107, plain,![X3]:![X4]:((~(element(X3,powerset(X4)))|subset(X3,X4))&(~(subset(X3,X4))|element(X3,powerset(X4)))),inference(variable_rename,[status(thm)],[106])).
% cnf(109,plain,(subset(X1,X2)|~element(X1,powerset(X2))),inference(split_conjunct,[status(thm)],[107])).
% fof(175, plain,![X1]:![X2]:(~(subset(X1,X2))|set_intersection2(X1,X2)=X1),inference(fof_nnf,[status(thm)],[32])).
% fof(176, plain,![X3]:![X4]:(~(subset(X3,X4))|set_intersection2(X3,X4)=X3),inference(variable_rename,[status(thm)],[175])).
% cnf(177,plain,(set_intersection2(X1,X2)=X1|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[176])).
% fof(306, negated_conjecture,?[X1]:(one_sorted_str(X1)&?[X2]:(element(X2,powerset(the_carrier(X1)))&~(subset_intersection2(the_carrier(X1),X2,cast_as_carrier_subset(X1))=X2))),inference(fof_nnf,[status(thm)],[60])).
% fof(307, negated_conjecture,?[X3]:(one_sorted_str(X3)&?[X4]:(element(X4,powerset(the_carrier(X3)))&~(subset_intersection2(the_carrier(X3),X4,cast_as_carrier_subset(X3))=X4))),inference(variable_rename,[status(thm)],[306])).
% fof(308, negated_conjecture,(one_sorted_str(esk6_0)&(element(esk7_0,powerset(the_carrier(esk6_0)))&~(subset_intersection2(the_carrier(esk6_0),esk7_0,cast_as_carrier_subset(esk6_0))=esk7_0))),inference(skolemize,[status(esa)],[307])).
% cnf(309,negated_conjecture,(subset_intersection2(the_carrier(esk6_0),esk7_0,cast_as_carrier_subset(esk6_0))!=esk7_0),inference(split_conjunct,[status(thm)],[308])).
% cnf(310,negated_conjecture,(element(esk7_0,powerset(the_carrier(esk6_0)))),inference(split_conjunct,[status(thm)],[308])).
% cnf(311,negated_conjecture,(one_sorted_str(esk6_0)),inference(split_conjunct,[status(thm)],[308])).
% cnf(353,plain,(set_intersection2(X1,X2)=X1|~element(X1,powerset(X2))),inference(spm,[status(thm)],[177,109,theory(equality)])).
% cnf(726,negated_conjecture,(set_intersection2(esk7_0,cast_as_carrier_subset(esk6_0))!=esk7_0|~element(cast_as_carrier_subset(esk6_0),powerset(the_carrier(esk6_0)))|~element(esk7_0,powerset(the_carrier(esk6_0)))),inference(spm,[status(thm)],[309,88,theory(equality)])).
% cnf(728,negated_conjecture,(set_intersection2(esk7_0,cast_as_carrier_subset(esk6_0))!=esk7_0|~element(cast_as_carrier_subset(esk6_0),powerset(the_carrier(esk6_0)))|$false),inference(rw,[status(thm)],[726,310,theory(equality)])).
% cnf(729,negated_conjecture,(set_intersection2(esk7_0,cast_as_carrier_subset(esk6_0))!=esk7_0|~element(cast_as_carrier_subset(esk6_0),powerset(the_carrier(esk6_0)))),inference(cn,[status(thm)],[728,theory(equality)])).
% cnf(738,negated_conjecture,(set_intersection2(esk7_0,cast_as_carrier_subset(esk6_0))!=esk7_0|~one_sorted_str(esk6_0)),inference(spm,[status(thm)],[729,79,theory(equality)])).
% cnf(741,negated_conjecture,(set_intersection2(esk7_0,cast_as_carrier_subset(esk6_0))!=esk7_0|$false),inference(rw,[status(thm)],[738,311,theory(equality)])).
% cnf(742,negated_conjecture,(set_intersection2(esk7_0,cast_as_carrier_subset(esk6_0))!=esk7_0),inference(cn,[status(thm)],[741,theory(equality)])).
% cnf(743,negated_conjecture,(set_intersection2(esk7_0,the_carrier(esk6_0))!=esk7_0|~one_sorted_str(esk6_0)),inference(spm,[status(thm)],[742,85,theory(equality)])).
% cnf(744,negated_conjecture,(set_intersection2(esk7_0,the_carrier(esk6_0))!=esk7_0|$false),inference(rw,[status(thm)],[743,311,theory(equality)])).
% cnf(745,negated_conjecture,(set_intersection2(esk7_0,the_carrier(esk6_0))!=esk7_0),inference(cn,[status(thm)],[744,theory(equality)])).
% cnf(983,negated_conjecture,(set_intersection2(esk7_0,the_carrier(esk6_0))=esk7_0),inference(spm,[status(thm)],[353,310,theory(equality)])).
% cnf(990,negated_conjecture,($false),inference(sr,[status(thm)],[983,745,theory(equality)])).
% cnf(991,negated_conjecture,($false),990,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 341
% # ...of these trivial : 2
% # ...subsumed : 62
% # ...remaining for further processing: 277
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 517
% # ...of the previous two non-trivial : 405
% # Contextual simplify-reflections : 0
% # Paramodulations : 517
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 163
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 6
% # Non-unit-clauses : 134
% # Current number of unprocessed clauses: 249
% # ...number of literals in the above : 648
% # Clause-clause subsumption calls (NU) : 221
% # Rec. Clause-clause subsumption calls : 221
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 21
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 97 leaves, 1.24+/-0.729 terms/leaf
% # Paramod-from index: 42 leaves, 1.10+/-0.366 terms/leaf
% # Paramod-into index: 76 leaves, 1.16+/-0.586 terms/leaf
% # -------------------------------------------------
% # User time : 0.036 s
% # System time : 0.007 s
% # Total time : 0.043 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP27548/SEU307+1.tptp
%
%------------------------------------------------------------------------------