TSTP Solution File: SEU429+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU429+1 : TPTP v5.0.0. Released v3.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 05:53:19 EST 2010
% Result : Theorem 0.98s
% Output : Solution 0.98s
% 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/SystemOnTPTP17955/SEU429+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17955/SEU429+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17955/SEU429+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 18051
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X1]:![X2]:![X3]:![X4]:(((~(v1_xboole_0(X1))&m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1))))&m2_relset_1(X4,X1,X2))=>m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2)))),file('/tmp/SRASS.s.p', s8_domain_1__e1_38__relset_2)).
% fof(51, conjecture,![X1]:(~(v1_xboole_0(X1))=>![X2]:![X3]:(m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))=>![X4]:(m2_relset_1(X4,X1,X2)=>m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2)))))),file('/tmp/SRASS.s.p', t28_relset_2)).
% fof(52, negated_conjecture,~(![X1]:(~(v1_xboole_0(X1))=>![X2]:![X3]:(m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))=>![X4]:(m2_relset_1(X4,X1,X2)=>m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))))))),inference(assume_negation,[status(cth)],[51])).
% fof(55, plain,![X1]:![X2]:![X3]:![X4]:(((~(v1_xboole_0(X1))&m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1))))&m2_relset_1(X4,X1,X2))=>m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2)))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(60, negated_conjecture,~(![X1]:(~(v1_xboole_0(X1))=>![X2]:![X3]:(m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))=>![X4]:(m2_relset_1(X4,X1,X2)=>m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))))))),inference(fof_simplification,[status(thm)],[52,theory(equality)])).
% fof(79, plain,![X1]:![X2]:![X3]:![X4]:(((v1_xboole_0(X1)|~(m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))))|~(m2_relset_1(X4,X1,X2)))|m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2)))),inference(fof_nnf,[status(thm)],[55])).
% fof(80, plain,![X5]:![X6]:![X7]:![X8]:(((v1_xboole_0(X5)|~(m1_subset_1(X7,k1_zfmisc_1(k1_zfmisc_1(X5)))))|~(m2_relset_1(X8,X5,X6)))|m1_subset_1(a_4_1_relset_2(X5,X6,X7,X8),k1_zfmisc_1(k1_zfmisc_1(X6)))),inference(variable_rename,[status(thm)],[79])).
% cnf(81,plain,(m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2)))|v1_xboole_0(X1)|~m2_relset_1(X4,X1,X2)|~m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))),inference(split_conjunct,[status(thm)],[80])).
% fof(218, negated_conjecture,?[X1]:(~(v1_xboole_0(X1))&?[X2]:?[X3]:(m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))&?[X4]:(m2_relset_1(X4,X1,X2)&~(m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))))))),inference(fof_nnf,[status(thm)],[60])).
% fof(219, negated_conjecture,?[X5]:(~(v1_xboole_0(X5))&?[X6]:?[X7]:(m1_subset_1(X7,k1_zfmisc_1(k1_zfmisc_1(X5)))&?[X8]:(m2_relset_1(X8,X5,X6)&~(m1_subset_1(a_4_1_relset_2(X5,X6,X7,X8),k1_zfmisc_1(k1_zfmisc_1(X6))))))),inference(variable_rename,[status(thm)],[218])).
% fof(220, negated_conjecture,(~(v1_xboole_0(esk13_0))&(m1_subset_1(esk15_0,k1_zfmisc_1(k1_zfmisc_1(esk13_0)))&(m2_relset_1(esk16_0,esk13_0,esk14_0)&~(m1_subset_1(a_4_1_relset_2(esk13_0,esk14_0,esk15_0,esk16_0),k1_zfmisc_1(k1_zfmisc_1(esk14_0))))))),inference(skolemize,[status(esa)],[219])).
% cnf(221,negated_conjecture,(~m1_subset_1(a_4_1_relset_2(esk13_0,esk14_0,esk15_0,esk16_0),k1_zfmisc_1(k1_zfmisc_1(esk14_0)))),inference(split_conjunct,[status(thm)],[220])).
% cnf(222,negated_conjecture,(m2_relset_1(esk16_0,esk13_0,esk14_0)),inference(split_conjunct,[status(thm)],[220])).
% cnf(223,negated_conjecture,(m1_subset_1(esk15_0,k1_zfmisc_1(k1_zfmisc_1(esk13_0)))),inference(split_conjunct,[status(thm)],[220])).
% cnf(224,negated_conjecture,(~v1_xboole_0(esk13_0)),inference(split_conjunct,[status(thm)],[220])).
% cnf(279,negated_conjecture,(v1_xboole_0(esk13_0)|~m2_relset_1(esk16_0,esk13_0,esk14_0)|~m1_subset_1(esk15_0,k1_zfmisc_1(k1_zfmisc_1(esk13_0)))),inference(spm,[status(thm)],[221,81,theory(equality)])).
% cnf(280,negated_conjecture,(v1_xboole_0(esk13_0)|$false|~m1_subset_1(esk15_0,k1_zfmisc_1(k1_zfmisc_1(esk13_0)))),inference(rw,[status(thm)],[279,222,theory(equality)])).
% cnf(281,negated_conjecture,(v1_xboole_0(esk13_0)|$false|$false),inference(rw,[status(thm)],[280,223,theory(equality)])).
% cnf(282,negated_conjecture,(v1_xboole_0(esk13_0)),inference(cn,[status(thm)],[281,theory(equality)])).
% cnf(283,negated_conjecture,($false),inference(sr,[status(thm)],[282,224,theory(equality)])).
% cnf(284,negated_conjecture,($false),283,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 58
% # ...of these trivial : 2
% # ...subsumed : 0
% # ...remaining for further processing: 56
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 53
% # ...of the previous two non-trivial : 44
% # Contextual simplify-reflections : 0
% # Paramodulations : 51
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 56
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 30
% # Current number of unprocessed clauses: 52
% # ...number of literals in the above : 137
% # Clause-clause subsumption calls (NU) : 12
% # Rec. Clause-clause subsumption calls : 10
% # 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: 82 leaves, 1.26+/-0.601 terms/leaf
% # Paramod-from index: 38 leaves, 1.05+/-0.223 terms/leaf
% # Paramod-into index: 76 leaves, 1.11+/-0.347 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.003 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.19 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP17955/SEU429+1.tptp
%
%------------------------------------------------------------------------------