TSTP Solution File: NUM393+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM393+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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 : Wed Dec 29 18:49:39 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP16785/NUM393+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16785/NUM393+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16785/NUM393+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 16881
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(inclusion_comparable(X1,X2)<=>(subset(X1,X2)|subset(X2,X1))),file('/tmp/SRASS.s.p', d9_xboole_0)).
% fof(5, axiom,![X1]:![X2]:((ordinal(X1)&ordinal(X2))=>(ordinal_subset(X1,X2)|ordinal_subset(X2,X1))),file('/tmp/SRASS.s.p', connectedness_r1_ordinal1)).
% fof(8, axiom,![X1]:![X2]:((ordinal(X1)&ordinal(X2))=>(ordinal_subset(X1,X2)<=>subset(X1,X2))),file('/tmp/SRASS.s.p', redefinition_r1_ordinal1)).
% fof(37, conjecture,![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>inclusion_comparable(X1,X2))),file('/tmp/SRASS.s.p', t25_ordinal1)).
% fof(38, negated_conjecture,~(![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>inclusion_comparable(X1,X2)))),inference(assume_negation,[status(cth)],[37])).
% fof(47, plain,![X1]:![X2]:((~(inclusion_comparable(X1,X2))|(subset(X1,X2)|subset(X2,X1)))&((~(subset(X1,X2))&~(subset(X2,X1)))|inclusion_comparable(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(48, plain,![X3]:![X4]:((~(inclusion_comparable(X3,X4))|(subset(X3,X4)|subset(X4,X3)))&((~(subset(X3,X4))&~(subset(X4,X3)))|inclusion_comparable(X3,X4))),inference(variable_rename,[status(thm)],[47])).
% fof(49, plain,![X3]:![X4]:((~(inclusion_comparable(X3,X4))|(subset(X3,X4)|subset(X4,X3)))&((~(subset(X3,X4))|inclusion_comparable(X3,X4))&(~(subset(X4,X3))|inclusion_comparable(X3,X4)))),inference(distribute,[status(thm)],[48])).
% cnf(50,plain,(inclusion_comparable(X1,X2)|~subset(X2,X1)),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,plain,(inclusion_comparable(X1,X2)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[49])).
% fof(55, plain,![X1]:![X2]:((~(ordinal(X1))|~(ordinal(X2)))|(ordinal_subset(X1,X2)|ordinal_subset(X2,X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(56, plain,![X3]:![X4]:((~(ordinal(X3))|~(ordinal(X4)))|(ordinal_subset(X3,X4)|ordinal_subset(X4,X3))),inference(variable_rename,[status(thm)],[55])).
% cnf(57,plain,(ordinal_subset(X1,X2)|ordinal_subset(X2,X1)|~ordinal(X1)|~ordinal(X2)),inference(split_conjunct,[status(thm)],[56])).
% fof(64, plain,![X1]:![X2]:((~(ordinal(X1))|~(ordinal(X2)))|((~(ordinal_subset(X1,X2))|subset(X1,X2))&(~(subset(X1,X2))|ordinal_subset(X1,X2)))),inference(fof_nnf,[status(thm)],[8])).
% fof(65, plain,![X3]:![X4]:((~(ordinal(X3))|~(ordinal(X4)))|((~(ordinal_subset(X3,X4))|subset(X3,X4))&(~(subset(X3,X4))|ordinal_subset(X3,X4)))),inference(variable_rename,[status(thm)],[64])).
% fof(66, plain,![X3]:![X4]:(((~(ordinal_subset(X3,X4))|subset(X3,X4))|(~(ordinal(X3))|~(ordinal(X4))))&((~(subset(X3,X4))|ordinal_subset(X3,X4))|(~(ordinal(X3))|~(ordinal(X4))))),inference(distribute,[status(thm)],[65])).
% cnf(68,plain,(subset(X2,X1)|~ordinal(X1)|~ordinal(X2)|~ordinal_subset(X2,X1)),inference(split_conjunct,[status(thm)],[66])).
% fof(170, negated_conjecture,?[X1]:(ordinal(X1)&?[X2]:(ordinal(X2)&~(inclusion_comparable(X1,X2)))),inference(fof_nnf,[status(thm)],[38])).
% fof(171, negated_conjecture,?[X3]:(ordinal(X3)&?[X4]:(ordinal(X4)&~(inclusion_comparable(X3,X4)))),inference(variable_rename,[status(thm)],[170])).
% fof(172, negated_conjecture,(ordinal(esk13_0)&(ordinal(esk14_0)&~(inclusion_comparable(esk13_0,esk14_0)))),inference(skolemize,[status(esa)],[171])).
% cnf(173,negated_conjecture,(~inclusion_comparable(esk13_0,esk14_0)),inference(split_conjunct,[status(thm)],[172])).
% cnf(174,negated_conjecture,(ordinal(esk14_0)),inference(split_conjunct,[status(thm)],[172])).
% cnf(175,negated_conjecture,(ordinal(esk13_0)),inference(split_conjunct,[status(thm)],[172])).
% cnf(181,negated_conjecture,(~subset(esk14_0,esk13_0)),inference(spm,[status(thm)],[173,50,theory(equality)])).
% cnf(182,negated_conjecture,(~subset(esk13_0,esk14_0)),inference(spm,[status(thm)],[173,51,theory(equality)])).
% cnf(200,negated_conjecture,(ordinal_subset(esk14_0,X1)|ordinal_subset(X1,esk14_0)|~ordinal(X1)),inference(spm,[status(thm)],[57,174,theory(equality)])).
% cnf(234,negated_conjecture,(ordinal_subset(esk13_0,esk14_0)|ordinal_subset(esk14_0,esk13_0)),inference(spm,[status(thm)],[200,175,theory(equality)])).
% cnf(250,negated_conjecture,(subset(esk14_0,esk13_0)|ordinal_subset(esk13_0,esk14_0)|~ordinal(esk14_0)|~ordinal(esk13_0)),inference(spm,[status(thm)],[68,234,theory(equality)])).
% cnf(251,negated_conjecture,(subset(esk14_0,esk13_0)|ordinal_subset(esk13_0,esk14_0)|$false|~ordinal(esk13_0)),inference(rw,[status(thm)],[250,174,theory(equality)])).
% cnf(252,negated_conjecture,(subset(esk14_0,esk13_0)|ordinal_subset(esk13_0,esk14_0)|$false|$false),inference(rw,[status(thm)],[251,175,theory(equality)])).
% cnf(253,negated_conjecture,(subset(esk14_0,esk13_0)|ordinal_subset(esk13_0,esk14_0)),inference(cn,[status(thm)],[252,theory(equality)])).
% cnf(254,negated_conjecture,(ordinal_subset(esk13_0,esk14_0)),inference(sr,[status(thm)],[253,181,theory(equality)])).
% cnf(255,negated_conjecture,(subset(esk13_0,esk14_0)|~ordinal(esk13_0)|~ordinal(esk14_0)),inference(spm,[status(thm)],[68,254,theory(equality)])).
% cnf(257,negated_conjecture,(subset(esk13_0,esk14_0)|$false|~ordinal(esk14_0)),inference(rw,[status(thm)],[255,175,theory(equality)])).
% cnf(258,negated_conjecture,(subset(esk13_0,esk14_0)|$false|$false),inference(rw,[status(thm)],[257,174,theory(equality)])).
% cnf(259,negated_conjecture,(subset(esk13_0,esk14_0)),inference(cn,[status(thm)],[258,theory(equality)])).
% cnf(260,negated_conjecture,($false),inference(sr,[status(thm)],[259,182,theory(equality)])).
% cnf(261,negated_conjecture,($false),260,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 142
% # ...of these trivial : 3
% # ...subsumed : 3
% # ...remaining for further processing: 136
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 7
% # Generated clauses : 54
% # ...of the previous two non-trivial : 39
% # Contextual simplify-reflections : 2
% # Paramodulations : 54
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 69
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 32
% # Current number of unprocessed clauses: 10
% # ...number of literals in the above : 27
% # Clause-clause subsumption calls (NU) : 46
% # Rec. Clause-clause subsumption calls : 39
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 67 leaves, 1.24+/-0.671 terms/leaf
% # Paramod-from index: 43 leaves, 1.05+/-0.211 terms/leaf
% # Paramod-into index: 64 leaves, 1.16+/-0.475 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.005 s
% # Total time : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP16785/NUM393+1.tptp
%
%------------------------------------------------------------------------------