TSTP Solution File: NUM414+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM414+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 : art05.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:55:04 EST 2010
% Result : Theorem 0.95s
% Output : Solution 0.95s
% 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/SystemOnTPTP30350/NUM414+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30350/NUM414+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30350/NUM414+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 30446
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(proper_subset(X1,X2)<=>(subset(X1,X2)&~(X1=X2))),file('/tmp/SRASS.s.p', d8_xboole_0)).
% fof(8, axiom,![X1]:![X2]:((ordinal(X1)&ordinal(X2))=>(ordinal_subset(X1,X2)|ordinal_subset(X2,X1))),file('/tmp/SRASS.s.p', connectedness_r1_ordinal1)).
% fof(13, axiom,![X1]:![X2]:((ordinal(X1)&ordinal(X2))=>(ordinal_subset(X1,X2)<=>subset(X1,X2))),file('/tmp/SRASS.s.p', redefinition_r1_ordinal1)).
% fof(42, conjecture,![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>~(((~(proper_subset(X1,X2))&~(X1=X2))&~(proper_subset(X2,X1)))))),file('/tmp/SRASS.s.p', t50_ordinal1)).
% fof(43, negated_conjecture,~(![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>~(((~(proper_subset(X1,X2))&~(X1=X2))&~(proper_subset(X2,X1))))))),inference(assume_negation,[status(cth)],[42])).
% fof(50, negated_conjecture,~(![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>~(((~(proper_subset(X1,X2))&~(X1=X2))&~(proper_subset(X2,X1))))))),inference(fof_simplification,[status(thm)],[43,theory(equality)])).
% fof(56, plain,![X1]:![X2]:((~(proper_subset(X1,X2))|(subset(X1,X2)&~(X1=X2)))&((~(subset(X1,X2))|X1=X2)|proper_subset(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(57, plain,![X3]:![X4]:((~(proper_subset(X3,X4))|(subset(X3,X4)&~(X3=X4)))&((~(subset(X3,X4))|X3=X4)|proper_subset(X3,X4))),inference(variable_rename,[status(thm)],[56])).
% fof(58, plain,![X3]:![X4]:(((subset(X3,X4)|~(proper_subset(X3,X4)))&(~(X3=X4)|~(proper_subset(X3,X4))))&((~(subset(X3,X4))|X3=X4)|proper_subset(X3,X4))),inference(distribute,[status(thm)],[57])).
% cnf(59,plain,(proper_subset(X1,X2)|X1=X2|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% fof(73, plain,![X1]:![X2]:((~(ordinal(X1))|~(ordinal(X2)))|(ordinal_subset(X1,X2)|ordinal_subset(X2,X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(74, plain,![X3]:![X4]:((~(ordinal(X3))|~(ordinal(X4)))|(ordinal_subset(X3,X4)|ordinal_subset(X4,X3))),inference(variable_rename,[status(thm)],[73])).
% cnf(75,plain,(ordinal_subset(X1,X2)|ordinal_subset(X2,X1)|~ordinal(X1)|~ordinal(X2)),inference(split_conjunct,[status(thm)],[74])).
% fof(86, 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)],[13])).
% fof(87, 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)],[86])).
% fof(88, 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)],[87])).
% cnf(90,plain,(subset(X2,X1)|~ordinal(X1)|~ordinal(X2)|~ordinal_subset(X2,X1)),inference(split_conjunct,[status(thm)],[88])).
% fof(213, negated_conjecture,?[X1]:(ordinal(X1)&?[X2]:(ordinal(X2)&((~(proper_subset(X1,X2))&~(X1=X2))&~(proper_subset(X2,X1))))),inference(fof_nnf,[status(thm)],[50])).
% fof(214, negated_conjecture,?[X3]:(ordinal(X3)&?[X4]:(ordinal(X4)&((~(proper_subset(X3,X4))&~(X3=X4))&~(proper_subset(X4,X3))))),inference(variable_rename,[status(thm)],[213])).
% fof(215, negated_conjecture,(ordinal(esk16_0)&(ordinal(esk17_0)&((~(proper_subset(esk16_0,esk17_0))&~(esk16_0=esk17_0))&~(proper_subset(esk17_0,esk16_0))))),inference(skolemize,[status(esa)],[214])).
% cnf(216,negated_conjecture,(~proper_subset(esk17_0,esk16_0)),inference(split_conjunct,[status(thm)],[215])).
% cnf(217,negated_conjecture,(esk16_0!=esk17_0),inference(split_conjunct,[status(thm)],[215])).
% cnf(218,negated_conjecture,(~proper_subset(esk16_0,esk17_0)),inference(split_conjunct,[status(thm)],[215])).
% cnf(219,negated_conjecture,(ordinal(esk17_0)),inference(split_conjunct,[status(thm)],[215])).
% cnf(220,negated_conjecture,(ordinal(esk16_0)),inference(split_conjunct,[status(thm)],[215])).
% cnf(266,negated_conjecture,(ordinal_subset(esk17_0,X1)|ordinal_subset(X1,esk17_0)|~ordinal(X1)),inference(spm,[status(thm)],[75,219,theory(equality)])).
% cnf(311,negated_conjecture,(ordinal_subset(esk16_0,esk17_0)|ordinal_subset(esk17_0,esk16_0)),inference(spm,[status(thm)],[266,220,theory(equality)])).
% cnf(341,negated_conjecture,(subset(esk17_0,esk16_0)|ordinal_subset(esk16_0,esk17_0)|~ordinal(esk17_0)|~ordinal(esk16_0)),inference(spm,[status(thm)],[90,311,theory(equality)])).
% cnf(342,negated_conjecture,(subset(esk17_0,esk16_0)|ordinal_subset(esk16_0,esk17_0)|$false|~ordinal(esk16_0)),inference(rw,[status(thm)],[341,219,theory(equality)])).
% cnf(343,negated_conjecture,(subset(esk17_0,esk16_0)|ordinal_subset(esk16_0,esk17_0)|$false|$false),inference(rw,[status(thm)],[342,220,theory(equality)])).
% cnf(344,negated_conjecture,(subset(esk17_0,esk16_0)|ordinal_subset(esk16_0,esk17_0)),inference(cn,[status(thm)],[343,theory(equality)])).
% cnf(365,negated_conjecture,(subset(esk16_0,esk17_0)|subset(esk17_0,esk16_0)|~ordinal(esk16_0)|~ordinal(esk17_0)),inference(spm,[status(thm)],[90,344,theory(equality)])).
% cnf(366,negated_conjecture,(subset(esk16_0,esk17_0)|subset(esk17_0,esk16_0)|$false|~ordinal(esk17_0)),inference(rw,[status(thm)],[365,220,theory(equality)])).
% cnf(367,negated_conjecture,(subset(esk16_0,esk17_0)|subset(esk17_0,esk16_0)|$false|$false),inference(rw,[status(thm)],[366,219,theory(equality)])).
% cnf(368,negated_conjecture,(subset(esk16_0,esk17_0)|subset(esk17_0,esk16_0)),inference(cn,[status(thm)],[367,theory(equality)])).
% cnf(369,negated_conjecture,(esk17_0=esk16_0|proper_subset(esk17_0,esk16_0)|subset(esk16_0,esk17_0)),inference(spm,[status(thm)],[59,368,theory(equality)])).
% cnf(371,negated_conjecture,(proper_subset(esk17_0,esk16_0)|subset(esk16_0,esk17_0)),inference(sr,[status(thm)],[369,217,theory(equality)])).
% cnf(372,negated_conjecture,(subset(esk16_0,esk17_0)),inference(sr,[status(thm)],[371,216,theory(equality)])).
% cnf(373,negated_conjecture,(esk16_0=esk17_0|proper_subset(esk16_0,esk17_0)),inference(spm,[status(thm)],[59,372,theory(equality)])).
% cnf(376,negated_conjecture,(proper_subset(esk16_0,esk17_0)),inference(sr,[status(thm)],[373,217,theory(equality)])).
% cnf(377,negated_conjecture,($false),inference(sr,[status(thm)],[376,218,theory(equality)])).
% cnf(378,negated_conjecture,($false),377,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 206
% # ...of these trivial : 6
% # ...subsumed : 5
% # ...remaining for further processing: 195
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 16
% # Generated clauses : 94
% # ...of the previous two non-trivial : 76
% # Contextual simplify-reflections : 4
% # Paramodulations : 90
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 94
% # Positive orientable unit clauses: 45
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 41
% # Current number of unprocessed clauses: 25
% # ...number of literals in the above : 63
% # Clause-clause subsumption calls (NU) : 97
% # Rec. Clause-clause subsumption calls : 82
% # Unit Clause-clause subsumption calls : 98
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 94 leaves, 1.18+/-0.583 terms/leaf
% # Paramod-from index: 59 leaves, 1.03+/-0.181 terms/leaf
% # Paramod-into index: 85 leaves, 1.08+/-0.275 terms/leaf
% # -------------------------------------------------
% # User time : 0.021 s
% # System time : 0.004 s
% # Total time : 0.025 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP30350/NUM414+1.tptp
%
%------------------------------------------------------------------------------