TSTP Solution File: SEU382+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU382+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 : art04.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 04:26:30 EST 2010
% Result : Theorem 1.24s
% Output : Solution 1.24s
% 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/SystemOnTPTP10426/SEU382+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10426/SEU382+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10426/SEU382+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 10522
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.029 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:boole_POSet(X1)=incl_POSet(powerset(X1)),file('/tmp/SRASS.s.p', t4_yellow_1)).
% fof(13, axiom,![X1]:(rel_str(X1)=>(strict_rel_str(X1)=>X1=rel_str_of(the_carrier(X1),the_InternalRel(X1)))),file('/tmp/SRASS.s.p', abstractness_v1_orders_2)).
% fof(18, axiom,![X1]:![X2]:(relation_of2(X2,X1,X1)=>![X3]:![X4]:(rel_str_of(X1,X2)=rel_str_of(X3,X4)=>(X1=X3&X2=X4))),file('/tmp/SRASS.s.p', free_g1_orders_2)).
% fof(26, axiom,![X1]:(rel_str(X1)=>relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))),file('/tmp/SRASS.s.p', dt_u1_orders_2)).
% fof(27, axiom,![X1]:incl_POSet(X1)=rel_str_of(X1,inclusion_order(X1)),file('/tmp/SRASS.s.p', d1_yellow_1)).
% fof(29, axiom,![X1]:![X2]:![X3]:(relation_of2_as_subset(X3,X1,X2)<=>relation_of2(X3,X1,X2)),file('/tmp/SRASS.s.p', redefinition_m2_relset_1)).
% fof(45, axiom,![X1]:(strict_rel_str(incl_POSet(X1))&rel_str(incl_POSet(X1))),file('/tmp/SRASS.s.p', dt_k2_yellow_1)).
% fof(89, conjecture,![X1]:the_carrier(boole_POSet(X1))=powerset(X1),file('/tmp/SRASS.s.p', t4_waybel_7)).
% fof(90, negated_conjecture,~(![X1]:the_carrier(boole_POSet(X1))=powerset(X1)),inference(assume_negation,[status(cth)],[89])).
% fof(134, plain,![X2]:boole_POSet(X2)=incl_POSet(powerset(X2)),inference(variable_rename,[status(thm)],[1])).
% cnf(135,plain,(boole_POSet(X1)=incl_POSet(powerset(X1))),inference(split_conjunct,[status(thm)],[134])).
% fof(168, plain,![X1]:(~(rel_str(X1))|(~(strict_rel_str(X1))|X1=rel_str_of(the_carrier(X1),the_InternalRel(X1)))),inference(fof_nnf,[status(thm)],[13])).
% fof(169, plain,![X2]:(~(rel_str(X2))|(~(strict_rel_str(X2))|X2=rel_str_of(the_carrier(X2),the_InternalRel(X2)))),inference(variable_rename,[status(thm)],[168])).
% cnf(170,plain,(X1=rel_str_of(the_carrier(X1),the_InternalRel(X1))|~strict_rel_str(X1)|~rel_str(X1)),inference(split_conjunct,[status(thm)],[169])).
% fof(187, plain,![X1]:![X2]:(~(relation_of2(X2,X1,X1))|![X3]:![X4]:(~(rel_str_of(X1,X2)=rel_str_of(X3,X4))|(X1=X3&X2=X4))),inference(fof_nnf,[status(thm)],[18])).
% fof(188, plain,![X5]:![X6]:(~(relation_of2(X6,X5,X5))|![X7]:![X8]:(~(rel_str_of(X5,X6)=rel_str_of(X7,X8))|(X5=X7&X6=X8))),inference(variable_rename,[status(thm)],[187])).
% fof(189, plain,![X5]:![X6]:![X7]:![X8]:((~(rel_str_of(X5,X6)=rel_str_of(X7,X8))|(X5=X7&X6=X8))|~(relation_of2(X6,X5,X5))),inference(shift_quantors,[status(thm)],[188])).
% fof(190, plain,![X5]:![X6]:![X7]:![X8]:(((X5=X7|~(rel_str_of(X5,X6)=rel_str_of(X7,X8)))|~(relation_of2(X6,X5,X5)))&((X6=X8|~(rel_str_of(X5,X6)=rel_str_of(X7,X8)))|~(relation_of2(X6,X5,X5)))),inference(distribute,[status(thm)],[189])).
% cnf(192,plain,(X2=X3|~relation_of2(X1,X2,X2)|rel_str_of(X2,X1)!=rel_str_of(X3,X4)),inference(split_conjunct,[status(thm)],[190])).
% fof(218, plain,![X1]:(~(rel_str(X1))|relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))),inference(fof_nnf,[status(thm)],[26])).
% fof(219, plain,![X2]:(~(rel_str(X2))|relation_of2_as_subset(the_InternalRel(X2),the_carrier(X2),the_carrier(X2))),inference(variable_rename,[status(thm)],[218])).
% cnf(220,plain,(relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))|~rel_str(X1)),inference(split_conjunct,[status(thm)],[219])).
% fof(221, plain,![X2]:incl_POSet(X2)=rel_str_of(X2,inclusion_order(X2)),inference(variable_rename,[status(thm)],[27])).
% cnf(222,plain,(incl_POSet(X1)=rel_str_of(X1,inclusion_order(X1))),inference(split_conjunct,[status(thm)],[221])).
% fof(225, plain,![X1]:![X2]:![X3]:((~(relation_of2_as_subset(X3,X1,X2))|relation_of2(X3,X1,X2))&(~(relation_of2(X3,X1,X2))|relation_of2_as_subset(X3,X1,X2))),inference(fof_nnf,[status(thm)],[29])).
% fof(226, plain,![X4]:![X5]:![X6]:((~(relation_of2_as_subset(X6,X4,X5))|relation_of2(X6,X4,X5))&(~(relation_of2(X6,X4,X5))|relation_of2_as_subset(X6,X4,X5))),inference(variable_rename,[status(thm)],[225])).
% cnf(228,plain,(relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3)),inference(split_conjunct,[status(thm)],[226])).
% fof(300, plain,![X2]:(strict_rel_str(incl_POSet(X2))&rel_str(incl_POSet(X2))),inference(variable_rename,[status(thm)],[45])).
% cnf(301,plain,(rel_str(incl_POSet(X1))),inference(split_conjunct,[status(thm)],[300])).
% cnf(302,plain,(strict_rel_str(incl_POSet(X1))),inference(split_conjunct,[status(thm)],[300])).
% fof(610, negated_conjecture,?[X1]:~(the_carrier(boole_POSet(X1))=powerset(X1)),inference(fof_nnf,[status(thm)],[90])).
% fof(611, negated_conjecture,?[X2]:~(the_carrier(boole_POSet(X2))=powerset(X2)),inference(variable_rename,[status(thm)],[610])).
% fof(612, negated_conjecture,~(the_carrier(boole_POSet(esk22_0))=powerset(esk22_0)),inference(skolemize,[status(esa)],[611])).
% cnf(613,negated_conjecture,(the_carrier(boole_POSet(esk22_0))!=powerset(esk22_0)),inference(split_conjunct,[status(thm)],[612])).
% cnf(662,negated_conjecture,(the_carrier(incl_POSet(powerset(esk22_0)))!=powerset(esk22_0)),inference(rw,[status(thm)],[613,135,theory(equality)]),['unfolding']).
% cnf(664,plain,(rel_str(rel_str_of(X1,inclusion_order(X1)))),inference(rw,[status(thm)],[301,222,theory(equality)]),['unfolding']).
% cnf(670,plain,(strict_rel_str(rel_str_of(X1,inclusion_order(X1)))),inference(rw,[status(thm)],[302,222,theory(equality)]),['unfolding']).
% cnf(721,negated_conjecture,(the_carrier(rel_str_of(powerset(esk22_0),inclusion_order(powerset(esk22_0))))!=powerset(esk22_0)),inference(rw,[status(thm)],[662,222,theory(equality)]),['unfolding']).
% cnf(881,plain,(relation_of2(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))|~rel_str(X1)),inference(spm,[status(thm)],[228,220,theory(equality)])).
% cnf(1360,plain,(the_carrier(X1)=X2|rel_str_of(the_carrier(X1),the_InternalRel(X1))!=rel_str_of(X2,X3)|~rel_str(X1)),inference(spm,[status(thm)],[192,881,theory(equality)])).
% cnf(1455,plain,(the_carrier(X1)=X2|X1!=rel_str_of(X2,X3)|~rel_str(X1)|~strict_rel_str(X1)),inference(spm,[status(thm)],[1360,170,theory(equality)])).
% cnf(1467,plain,(the_carrier(rel_str_of(X1,X2))=X1|~strict_rel_str(rel_str_of(X1,X2))|~rel_str(rel_str_of(X1,X2))),inference(er,[status(thm)],[1455,theory(equality)])).
% cnf(1479,negated_conjecture,(~strict_rel_str(rel_str_of(powerset(esk22_0),inclusion_order(powerset(esk22_0))))|~rel_str(rel_str_of(powerset(esk22_0),inclusion_order(powerset(esk22_0))))),inference(spm,[status(thm)],[721,1467,theory(equality)])).
% cnf(1480,negated_conjecture,($false|~rel_str(rel_str_of(powerset(esk22_0),inclusion_order(powerset(esk22_0))))),inference(rw,[status(thm)],[1479,670,theory(equality)])).
% cnf(1481,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1480,664,theory(equality)])).
% cnf(1482,negated_conjecture,($false),inference(cn,[status(thm)],[1481,theory(equality)])).
% cnf(1483,negated_conjecture,($false),1482,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 537
% # ...of these trivial : 40
% # ...subsumed : 51
% # ...remaining for further processing: 446
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 5
% # Generated clauses : 268
% # ...of the previous two non-trivial : 165
% # Contextual simplify-reflections : 46
% # Paramodulations : 256
% # Factorizations : 0
% # Equation resolutions : 9
% # Current number of processed clauses: 248
% # Positive orientable unit clauses: 120
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 18
% # Non-unit-clauses : 110
% # Current number of unprocessed clauses: 57
% # ...number of literals in the above : 236
% # Clause-clause subsumption calls (NU) : 2002
% # Rec. Clause-clause subsumption calls : 808
% # Unit Clause-clause subsumption calls : 183
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 13
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 242 leaves, 1.13+/-0.579 terms/leaf
% # Paramod-from index: 153 leaves, 1.01+/-0.114 terms/leaf
% # Paramod-into index: 231 leaves, 1.09+/-0.396 terms/leaf
% # -------------------------------------------------
% # User time : 0.057 s
% # System time : 0.006 s
% # Total time : 0.063 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.25 WC
% FINAL PrfWatch: 0.18 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP10426/SEU382+1.tptp
%
%------------------------------------------------------------------------------