TSTP Solution File: SEU321+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU321+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 03:35:58 EST 2010
% Result : Theorem 1.20s
% Output : Solution 1.20s
% 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/SystemOnTPTP6051/SEU321+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6051/SEU321+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6051/SEU321+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 6183
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(8, axiom,![X1]:![X2]:![X3]:(element(X3,powerset(X1))=>~((in(X2,subset_complement(X1,X3))&in(X2,X3)))),file('/tmp/SRASS.s.p', t54_subset_1)).
% fof(10, axiom,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(the_carrier(X1)))),file('/tmp/SRASS.s.p', fc1_struct_0)).
% fof(15, axiom,![X1]:(~(X1=empty_set)=>![X2]:(element(X2,powerset(X1))=>![X3]:(element(X3,X1)=>(~(in(X3,X2))=>in(X3,subset_complement(X1,X2)))))),file('/tmp/SRASS.s.p', t50_subset_1)).
% fof(30, axiom,(((((empty(empty_set)&v1_membered(empty_set))&v2_membered(empty_set))&v3_membered(empty_set))&v4_membered(empty_set))&v5_membered(empty_set)),file('/tmp/SRASS.s.p', fc6_membered)).
% fof(42, conjecture,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(element(X2,powerset(the_carrier(X1)))=>![X3]:(element(X3,the_carrier(X1))=>(in(X3,subset_complement(the_carrier(X1),X2))<=>~(in(X3,X2)))))),file('/tmp/SRASS.s.p', l40_tops_1)).
% fof(43, negated_conjecture,~(![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(element(X2,powerset(the_carrier(X1)))=>![X3]:(element(X3,the_carrier(X1))=>(in(X3,subset_complement(the_carrier(X1),X2))<=>~(in(X3,X2))))))),inference(assume_negation,[status(cth)],[42])).
% fof(47, plain,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(the_carrier(X1)))),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(48, plain,![X1]:(~(X1=empty_set)=>![X2]:(element(X2,powerset(X1))=>![X3]:(element(X3,X1)=>(~(in(X3,X2))=>in(X3,subset_complement(X1,X2)))))),inference(fof_simplification,[status(thm)],[15,theory(equality)])).
% fof(50, negated_conjecture,~(![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(element(X2,powerset(the_carrier(X1)))=>![X3]:(element(X3,the_carrier(X1))=>(in(X3,subset_complement(the_carrier(X1),X2))<=>~(in(X3,X2))))))),inference(fof_simplification,[status(thm)],[43,theory(equality)])).
% fof(73, plain,![X1]:![X2]:![X3]:(~(element(X3,powerset(X1)))|(~(in(X2,subset_complement(X1,X3)))|~(in(X2,X3)))),inference(fof_nnf,[status(thm)],[8])).
% fof(74, plain,![X4]:![X5]:![X6]:(~(element(X6,powerset(X4)))|(~(in(X5,subset_complement(X4,X6)))|~(in(X5,X6)))),inference(variable_rename,[status(thm)],[73])).
% cnf(75,plain,(~in(X1,X2)|~in(X1,subset_complement(X3,X2))|~element(X2,powerset(X3))),inference(split_conjunct,[status(thm)],[74])).
% fof(82, plain,![X1]:((empty_carrier(X1)|~(one_sorted_str(X1)))|~(empty(the_carrier(X1)))),inference(fof_nnf,[status(thm)],[47])).
% fof(83, plain,![X2]:((empty_carrier(X2)|~(one_sorted_str(X2)))|~(empty(the_carrier(X2)))),inference(variable_rename,[status(thm)],[82])).
% cnf(84,plain,(empty_carrier(X1)|~empty(the_carrier(X1))|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[83])).
% fof(98, plain,![X1]:(X1=empty_set|![X2]:(~(element(X2,powerset(X1)))|![X3]:(~(element(X3,X1))|(in(X3,X2)|in(X3,subset_complement(X1,X2)))))),inference(fof_nnf,[status(thm)],[48])).
% fof(99, plain,![X4]:(X4=empty_set|![X5]:(~(element(X5,powerset(X4)))|![X6]:(~(element(X6,X4))|(in(X6,X5)|in(X6,subset_complement(X4,X5)))))),inference(variable_rename,[status(thm)],[98])).
% fof(100, plain,![X4]:![X5]:![X6]:(((~(element(X6,X4))|(in(X6,X5)|in(X6,subset_complement(X4,X5))))|~(element(X5,powerset(X4))))|X4=empty_set),inference(shift_quantors,[status(thm)],[99])).
% cnf(101,plain,(X1=empty_set|in(X3,subset_complement(X1,X2))|in(X3,X2)|~element(X2,powerset(X1))|~element(X3,X1)),inference(split_conjunct,[status(thm)],[100])).
% cnf(175,plain,(empty(empty_set)),inference(split_conjunct,[status(thm)],[30])).
% fof(220, negated_conjecture,?[X1]:((~(empty_carrier(X1))&one_sorted_str(X1))&?[X2]:(element(X2,powerset(the_carrier(X1)))&?[X3]:(element(X3,the_carrier(X1))&((~(in(X3,subset_complement(the_carrier(X1),X2)))|in(X3,X2))&(in(X3,subset_complement(the_carrier(X1),X2))|~(in(X3,X2))))))),inference(fof_nnf,[status(thm)],[50])).
% fof(221, negated_conjecture,?[X4]:((~(empty_carrier(X4))&one_sorted_str(X4))&?[X5]:(element(X5,powerset(the_carrier(X4)))&?[X6]:(element(X6,the_carrier(X4))&((~(in(X6,subset_complement(the_carrier(X4),X5)))|in(X6,X5))&(in(X6,subset_complement(the_carrier(X4),X5))|~(in(X6,X5))))))),inference(variable_rename,[status(thm)],[220])).
% fof(222, negated_conjecture,((~(empty_carrier(esk6_0))&one_sorted_str(esk6_0))&(element(esk7_0,powerset(the_carrier(esk6_0)))&(element(esk8_0,the_carrier(esk6_0))&((~(in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0)))|in(esk8_0,esk7_0))&(in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0))|~(in(esk8_0,esk7_0))))))),inference(skolemize,[status(esa)],[221])).
% cnf(223,negated_conjecture,(in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0))|~in(esk8_0,esk7_0)),inference(split_conjunct,[status(thm)],[222])).
% cnf(224,negated_conjecture,(in(esk8_0,esk7_0)|~in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0))),inference(split_conjunct,[status(thm)],[222])).
% cnf(225,negated_conjecture,(element(esk8_0,the_carrier(esk6_0))),inference(split_conjunct,[status(thm)],[222])).
% cnf(226,negated_conjecture,(element(esk7_0,powerset(the_carrier(esk6_0)))),inference(split_conjunct,[status(thm)],[222])).
% cnf(227,negated_conjecture,(one_sorted_str(esk6_0)),inference(split_conjunct,[status(thm)],[222])).
% cnf(228,negated_conjecture,(~empty_carrier(esk6_0)),inference(split_conjunct,[status(thm)],[222])).
% cnf(232,negated_conjecture,(~empty(the_carrier(esk6_0))|~one_sorted_str(esk6_0)),inference(spm,[status(thm)],[228,84,theory(equality)])).
% cnf(234,negated_conjecture,(~empty(the_carrier(esk6_0))|$false),inference(rw,[status(thm)],[232,227,theory(equality)])).
% cnf(235,negated_conjecture,(~empty(the_carrier(esk6_0))),inference(cn,[status(thm)],[234,theory(equality)])).
% cnf(395,negated_conjecture,(in(esk8_0,esk7_0)|empty_set=the_carrier(esk6_0)|~element(esk7_0,powerset(the_carrier(esk6_0)))|~element(esk8_0,the_carrier(esk6_0))),inference(spm,[status(thm)],[224,101,theory(equality)])).
% cnf(401,negated_conjecture,(in(esk8_0,esk7_0)|empty_set=the_carrier(esk6_0)|$false|~element(esk8_0,the_carrier(esk6_0))),inference(rw,[status(thm)],[395,226,theory(equality)])).
% cnf(402,negated_conjecture,(in(esk8_0,esk7_0)|empty_set=the_carrier(esk6_0)|$false|$false),inference(rw,[status(thm)],[401,225,theory(equality)])).
% cnf(403,negated_conjecture,(in(esk8_0,esk7_0)|empty_set=the_carrier(esk6_0)),inference(cn,[status(thm)],[402,theory(equality)])).
% cnf(444,negated_conjecture,(in(esk8_0,esk7_0)|~empty(empty_set)),inference(spm,[status(thm)],[235,403,theory(equality)])).
% cnf(445,negated_conjecture,(in(esk8_0,esk7_0)|$false),inference(rw,[status(thm)],[444,175,theory(equality)])).
% cnf(446,negated_conjecture,(in(esk8_0,esk7_0)),inference(cn,[status(thm)],[445,theory(equality)])).
% cnf(455,negated_conjecture,(in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0))|$false),inference(rw,[status(thm)],[223,446,theory(equality)])).
% cnf(456,negated_conjecture,(in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0))),inference(cn,[status(thm)],[455,theory(equality)])).
% cnf(476,negated_conjecture,(~element(esk7_0,powerset(the_carrier(esk6_0)))|~in(esk8_0,esk7_0)),inference(spm,[status(thm)],[75,456,theory(equality)])).
% cnf(477,negated_conjecture,($false|~in(esk8_0,esk7_0)),inference(rw,[status(thm)],[476,226,theory(equality)])).
% cnf(478,negated_conjecture,($false|$false),inference(rw,[status(thm)],[477,446,theory(equality)])).
% cnf(479,negated_conjecture,($false),inference(cn,[status(thm)],[478,theory(equality)])).
% cnf(480,negated_conjecture,($false),479,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 167
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 167
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 228
% # ...of the previous two non-trivial : 216
% # Contextual simplify-reflections : 0
% # Paramodulations : 228
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 84
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 56
% # Current number of unprocessed clauses: 199
% # ...number of literals in the above : 507
% # Clause-clause subsumption calls (NU) : 33
% # Rec. Clause-clause subsumption calls : 33
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 66 leaves, 1.32+/-0.856 terms/leaf
% # Paramod-from index: 33 leaves, 1.03+/-0.171 terms/leaf
% # Paramod-into index: 58 leaves, 1.17+/-0.530 terms/leaf
% # -------------------------------------------------
% # User time : 0.024 s
% # System time : 0.004 s
% # Total time : 0.028 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP6051/SEU321+1.tptp
%
%------------------------------------------------------------------------------