TSTP Solution File: NUM394+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM394+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 : art09.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:54 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP29624/NUM394+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29624/NUM394+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29624/NUM394+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 29720
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:((ordinal(X1)&ordinal(X2))=>(ordinal_subset(X1,X2)<=>subset(X1,X2))),file('/tmp/SRASS.s.p', redefinition_r1_ordinal1)).
% fof(5, axiom,![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>~(((~(in(X1,X2))&~(X1=X2))&~(in(X2,X1)))))),file('/tmp/SRASS.s.p', t24_ordinal1)).
% fof(10, axiom,![X1]:![X2]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_r1_tarski)).
% fof(13, axiom,![X1]:(ordinal(X1)=>(epsilon_transitive(X1)&epsilon_connected(X1))),file('/tmp/SRASS.s.p', cc1_ordinal1)).
% fof(18, axiom,![X1]:(epsilon_transitive(X1)<=>![X2]:(in(X2,X1)=>subset(X2,X1))),file('/tmp/SRASS.s.p', d2_ordinal1)).
% fof(36, conjecture,![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>(ordinal_subset(X1,X2)|in(X2,X1)))),file('/tmp/SRASS.s.p', t26_ordinal1)).
% fof(37, negated_conjecture,~(![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>(ordinal_subset(X1,X2)|in(X2,X1))))),inference(assume_negation,[status(cth)],[36])).
% fof(39, plain,![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>~(((~(in(X1,X2))&~(X1=X2))&~(in(X2,X1)))))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(51, 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)],[4])).
% fof(52, 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)],[51])).
% fof(53, 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)],[52])).
% cnf(54,plain,(ordinal_subset(X2,X1)|~ordinal(X1)|~ordinal(X2)|~subset(X2,X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(56, plain,![X1]:(~(ordinal(X1))|![X2]:(~(ordinal(X2))|((in(X1,X2)|X1=X2)|in(X2,X1)))),inference(fof_nnf,[status(thm)],[39])).
% fof(57, plain,![X3]:(~(ordinal(X3))|![X4]:(~(ordinal(X4))|((in(X3,X4)|X3=X4)|in(X4,X3)))),inference(variable_rename,[status(thm)],[56])).
% fof(58, plain,![X3]:![X4]:((~(ordinal(X4))|((in(X3,X4)|X3=X4)|in(X4,X3)))|~(ordinal(X3))),inference(shift_quantors,[status(thm)],[57])).
% cnf(59,plain,(in(X2,X1)|X1=X2|in(X1,X2)|~ordinal(X1)|~ordinal(X2)),inference(split_conjunct,[status(thm)],[58])).
% fof(72, plain,![X3]:![X4]:subset(X3,X3),inference(variable_rename,[status(thm)],[10])).
% cnf(73,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(80, plain,![X1]:(~(ordinal(X1))|(epsilon_transitive(X1)&epsilon_connected(X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(81, plain,![X2]:(~(ordinal(X2))|(epsilon_transitive(X2)&epsilon_connected(X2))),inference(variable_rename,[status(thm)],[80])).
% fof(82, plain,![X2]:((epsilon_transitive(X2)|~(ordinal(X2)))&(epsilon_connected(X2)|~(ordinal(X2)))),inference(distribute,[status(thm)],[81])).
% cnf(84,plain,(epsilon_transitive(X1)|~ordinal(X1)),inference(split_conjunct,[status(thm)],[82])).
% fof(99, plain,![X1]:((~(epsilon_transitive(X1))|![X2]:(~(in(X2,X1))|subset(X2,X1)))&(?[X2]:(in(X2,X1)&~(subset(X2,X1)))|epsilon_transitive(X1))),inference(fof_nnf,[status(thm)],[18])).
% fof(100, plain,![X3]:((~(epsilon_transitive(X3))|![X4]:(~(in(X4,X3))|subset(X4,X3)))&(?[X5]:(in(X5,X3)&~(subset(X5,X3)))|epsilon_transitive(X3))),inference(variable_rename,[status(thm)],[99])).
% fof(101, plain,![X3]:((~(epsilon_transitive(X3))|![X4]:(~(in(X4,X3))|subset(X4,X3)))&((in(esk5_1(X3),X3)&~(subset(esk5_1(X3),X3)))|epsilon_transitive(X3))),inference(skolemize,[status(esa)],[100])).
% fof(102, plain,![X3]:![X4]:(((~(in(X4,X3))|subset(X4,X3))|~(epsilon_transitive(X3)))&((in(esk5_1(X3),X3)&~(subset(esk5_1(X3),X3)))|epsilon_transitive(X3))),inference(shift_quantors,[status(thm)],[101])).
% fof(103, plain,![X3]:![X4]:(((~(in(X4,X3))|subset(X4,X3))|~(epsilon_transitive(X3)))&((in(esk5_1(X3),X3)|epsilon_transitive(X3))&(~(subset(esk5_1(X3),X3))|epsilon_transitive(X3)))),inference(distribute,[status(thm)],[102])).
% cnf(106,plain,(subset(X2,X1)|~epsilon_transitive(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[103])).
% fof(171, negated_conjecture,?[X1]:(ordinal(X1)&?[X2]:(ordinal(X2)&(~(ordinal_subset(X1,X2))&~(in(X2,X1))))),inference(fof_nnf,[status(thm)],[37])).
% fof(172, negated_conjecture,?[X3]:(ordinal(X3)&?[X4]:(ordinal(X4)&(~(ordinal_subset(X3,X4))&~(in(X4,X3))))),inference(variable_rename,[status(thm)],[171])).
% fof(173, negated_conjecture,(ordinal(esk14_0)&(ordinal(esk15_0)&(~(ordinal_subset(esk14_0,esk15_0))&~(in(esk15_0,esk14_0))))),inference(skolemize,[status(esa)],[172])).
% cnf(174,negated_conjecture,(~in(esk15_0,esk14_0)),inference(split_conjunct,[status(thm)],[173])).
% cnf(175,negated_conjecture,(~ordinal_subset(esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[173])).
% cnf(176,negated_conjecture,(ordinal(esk15_0)),inference(split_conjunct,[status(thm)],[173])).
% cnf(177,negated_conjecture,(ordinal(esk14_0)),inference(split_conjunct,[status(thm)],[173])).
% cnf(202,negated_conjecture,(~subset(esk14_0,esk15_0)|~ordinal(esk14_0)|~ordinal(esk15_0)),inference(spm,[status(thm)],[175,54,theory(equality)])).
% cnf(203,negated_conjecture,(~subset(esk14_0,esk15_0)|$false|~ordinal(esk15_0)),inference(rw,[status(thm)],[202,177,theory(equality)])).
% cnf(204,negated_conjecture,(~subset(esk14_0,esk15_0)|$false|$false),inference(rw,[status(thm)],[203,176,theory(equality)])).
% cnf(205,negated_conjecture,(~subset(esk14_0,esk15_0)),inference(cn,[status(thm)],[204,theory(equality)])).
% cnf(210,negated_conjecture,(X1=esk15_0|in(esk15_0,X1)|in(X1,esk15_0)|~ordinal(X1)),inference(spm,[status(thm)],[59,176,theory(equality)])).
% cnf(214,plain,(subset(X1,X2)|~in(X1,X2)|~ordinal(X2)),inference(spm,[status(thm)],[106,84,theory(equality)])).
% cnf(301,negated_conjecture,(esk14_0=esk15_0|in(esk14_0,esk15_0)|in(esk15_0,esk14_0)),inference(spm,[status(thm)],[210,177,theory(equality)])).
% cnf(303,negated_conjecture,(esk15_0=esk14_0|in(esk14_0,esk15_0)),inference(sr,[status(thm)],[301,174,theory(equality)])).
% cnf(332,negated_conjecture,(~ordinal(esk15_0)|~in(esk14_0,esk15_0)),inference(spm,[status(thm)],[205,214,theory(equality)])).
% cnf(335,negated_conjecture,($false|~in(esk14_0,esk15_0)),inference(rw,[status(thm)],[332,176,theory(equality)])).
% cnf(336,negated_conjecture,(~in(esk14_0,esk15_0)),inference(cn,[status(thm)],[335,theory(equality)])).
% cnf(337,negated_conjecture,(esk15_0=esk14_0),inference(sr,[status(thm)],[303,336,theory(equality)])).
% cnf(367,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[205,337,theory(equality)]),73,theory(equality)])).
% cnf(368,negated_conjecture,($false),inference(cn,[status(thm)],[367,theory(equality)])).
% cnf(369,negated_conjecture,($false),368,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 189
% # ...of these trivial : 3
% # ...subsumed : 17
% # ...remaining for further processing: 169
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 33
% # Generated clauses : 105
% # ...of the previous two non-trivial : 103
% # Contextual simplify-reflections : 8
% # Paramodulations : 104
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 76
% # Positive orientable unit clauses: 31
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 43
% # Current number of unprocessed clauses: 26
% # ...number of literals in the above : 72
% # Clause-clause subsumption calls (NU) : 101
% # Rec. Clause-clause subsumption calls : 92
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 83 leaves, 1.17+/-0.577 terms/leaf
% # Paramod-from index: 48 leaves, 1.04+/-0.200 terms/leaf
% # Paramod-into index: 72 leaves, 1.14+/-0.384 terms/leaf
% # -------------------------------------------------
% # User time : 0.024 s
% # System time : 0.002 s
% # Total time : 0.026 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/SystemOnTPTP29624/NUM394+1.tptp
%
%------------------------------------------------------------------------------