TSTP Solution File: SEU382+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU382+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 : 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:55 EST 2010
% Result : Theorem 59.84s
% Output : Solution 59.84s
% 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/SystemOnTPTP10685/SEU382+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10685/SEU382+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10685/SEU382+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 10817
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.501 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(108, axiom,![X1]:(the_carrier(incl_POSet(X1))=X1&the_InternalRel(incl_POSet(X1))=inclusion_order(X1)),file('/tmp/SRASS.s.p', t1_yellow_1)).
% fof(843, conjecture,![X1]:the_carrier(boole_POSet(X1))=powerset(X1),file('/tmp/SRASS.s.p', t4_waybel_7)).
% fof(844, negated_conjecture,~(![X1]:the_carrier(boole_POSet(X1))=powerset(X1)),inference(assume_negation,[status(cth)],[843])).
% fof(1105, plain,![X2]:boole_POSet(X2)=incl_POSet(powerset(X2)),inference(variable_rename,[status(thm)],[1])).
% cnf(1106,plain,(boole_POSet(X1)=incl_POSet(powerset(X1))),inference(split_conjunct,[status(thm)],[1105])).
% fof(1644, plain,![X2]:(the_carrier(incl_POSet(X2))=X2&the_InternalRel(incl_POSet(X2))=inclusion_order(X2)),inference(variable_rename,[status(thm)],[108])).
% cnf(1646,plain,(the_carrier(incl_POSet(X1))=X1),inference(split_conjunct,[status(thm)],[1644])).
% fof(7176, negated_conjecture,?[X1]:~(the_carrier(boole_POSet(X1))=powerset(X1)),inference(fof_nnf,[status(thm)],[844])).
% fof(7177, negated_conjecture,?[X2]:~(the_carrier(boole_POSet(X2))=powerset(X2)),inference(variable_rename,[status(thm)],[7176])).
% fof(7178, negated_conjecture,~(the_carrier(boole_POSet(esk532_0))=powerset(esk532_0)),inference(skolemize,[status(esa)],[7177])).
% cnf(7179,negated_conjecture,(the_carrier(boole_POSet(esk532_0))!=powerset(esk532_0)),inference(split_conjunct,[status(thm)],[7178])).
% cnf(7541,negated_conjecture,(the_carrier(incl_POSet(powerset(esk532_0)))!=powerset(esk532_0)),inference(rw,[status(thm)],[7179,1106,theory(equality)]),['unfolding']).
% cnf(8342,negated_conjecture,($false),inference(rw,[status(thm)],[7541,1646,theory(equality)])).
% cnf(8343,negated_conjecture,($false),inference(cn,[status(thm)],[8342,theory(equality)])).
% cnf(8344,negated_conjecture,($false),8343,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 28
% # ...of these trivial : 1
% # ...subsumed : 1
% # ...remaining for further processing: 26
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 25
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 3598
% # ...number of literals in the above : 16800
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 41 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 24 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 40 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.486 s
% # System time : 0.019 s
% # Total time : 0.505 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.21 CPU 1.29 WC
% FINAL PrfWatch: 1.21 CPU 1.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP10685/SEU382+2.tptp
%
%------------------------------------------------------------------------------