TSTP Solution File: RNG112+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG112+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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 22:40:08 EST 2010
% Result : Theorem 1.06s
% Output : Solution 1.06s
% 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/SystemOnTPTP14810/RNG112+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14810/RNG112+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14810/RNG112+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 14906
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(7, axiom,(aIdeal0(xI)&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),file('/tmp/SRASS.s.p', m__2174)).
% fof(9, axiom,?[X1]:(aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))&~(X1=sz00)),file('/tmp/SRASS.s.p', m__2228)).
% fof(10, axiom,![X1]:((aElementOf0(X1,xI)&~(X1=sz00))=>?[X2]:((aElementOf0(X2,xI)&~(X2=sz00))&![X3]:((aElementOf0(X3,xI)&~(X3=sz00))=>~(iLess0(sbrdtbr0(X3),sbrdtbr0(X2)))))),file('/tmp/SRASS.s.p', m__2351)).
% fof(46, conjecture,?[X1]:((aElementOf0(X1,xI)&~(X1=sz00))&![X2]:((aElementOf0(X2,xI)&~(X2=sz00))=>~(iLess0(sbrdtbr0(X2),sbrdtbr0(X1))))),file('/tmp/SRASS.s.p', m__)).
% fof(47, negated_conjecture,~(?[X1]:((aElementOf0(X1,xI)&~(X1=sz00))&![X2]:((aElementOf0(X2,xI)&~(X2=sz00))=>~(iLess0(sbrdtbr0(X2),sbrdtbr0(X1)))))),inference(assume_negation,[status(cth)],[46])).
% fof(48, plain,![X1]:((aElementOf0(X1,xI)&~(X1=sz00))=>?[X2]:((aElementOf0(X2,xI)&~(X2=sz00))&![X3]:((aElementOf0(X3,xI)&~(X3=sz00))=>~(iLess0(sbrdtbr0(X3),sbrdtbr0(X2)))))),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(53, negated_conjecture,~(?[X1]:((aElementOf0(X1,xI)&~(X1=sz00))&![X2]:((aElementOf0(X2,xI)&~(X2=sz00))=>~(iLess0(sbrdtbr0(X2),sbrdtbr0(X1)))))),inference(fof_simplification,[status(thm)],[47,theory(equality)])).
% cnf(65,plain,(xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),inference(split_conjunct,[status(thm)],[7])).
% fof(71, plain,?[X2]:(aElementOf0(X2,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))&~(X2=sz00)),inference(variable_rename,[status(thm)],[9])).
% fof(72, plain,(aElementOf0(esk1_0,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))&~(esk1_0=sz00)),inference(skolemize,[status(esa)],[71])).
% cnf(73,plain,(esk1_0!=sz00),inference(split_conjunct,[status(thm)],[72])).
% cnf(74,plain,(aElementOf0(esk1_0,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))),inference(split_conjunct,[status(thm)],[72])).
% fof(75, plain,![X1]:((~(aElementOf0(X1,xI))|X1=sz00)|?[X2]:((aElementOf0(X2,xI)&~(X2=sz00))&![X3]:((~(aElementOf0(X3,xI))|X3=sz00)|~(iLess0(sbrdtbr0(X3),sbrdtbr0(X2)))))),inference(fof_nnf,[status(thm)],[48])).
% fof(76, plain,![X4]:((~(aElementOf0(X4,xI))|X4=sz00)|?[X5]:((aElementOf0(X5,xI)&~(X5=sz00))&![X6]:((~(aElementOf0(X6,xI))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(X5)))))),inference(variable_rename,[status(thm)],[75])).
% fof(77, plain,![X4]:((~(aElementOf0(X4,xI))|X4=sz00)|((aElementOf0(esk2_1(X4),xI)&~(esk2_1(X4)=sz00))&![X6]:((~(aElementOf0(X6,xI))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(esk2_1(X4))))))),inference(skolemize,[status(esa)],[76])).
% fof(78, plain,![X4]:![X6]:((((~(aElementOf0(X6,xI))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(esk2_1(X4)))))&(aElementOf0(esk2_1(X4),xI)&~(esk2_1(X4)=sz00)))|(~(aElementOf0(X4,xI))|X4=sz00)),inference(shift_quantors,[status(thm)],[77])).
% fof(79, plain,![X4]:![X6]:((((~(aElementOf0(X6,xI))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(esk2_1(X4)))))|(~(aElementOf0(X4,xI))|X4=sz00))&((aElementOf0(esk2_1(X4),xI)|(~(aElementOf0(X4,xI))|X4=sz00))&(~(esk2_1(X4)=sz00)|(~(aElementOf0(X4,xI))|X4=sz00)))),inference(distribute,[status(thm)],[78])).
% cnf(80,plain,(X1=sz00|~aElementOf0(X1,xI)|esk2_1(X1)!=sz00),inference(split_conjunct,[status(thm)],[79])).
% cnf(81,plain,(X1=sz00|aElementOf0(esk2_1(X1),xI)|~aElementOf0(X1,xI)),inference(split_conjunct,[status(thm)],[79])).
% cnf(82,plain,(X1=sz00|X2=sz00|~aElementOf0(X1,xI)|~iLess0(sbrdtbr0(X2),sbrdtbr0(esk2_1(X1)))|~aElementOf0(X2,xI)),inference(split_conjunct,[status(thm)],[79])).
% fof(271, negated_conjecture,![X1]:((~(aElementOf0(X1,xI))|X1=sz00)|?[X2]:((aElementOf0(X2,xI)&~(X2=sz00))&iLess0(sbrdtbr0(X2),sbrdtbr0(X1)))),inference(fof_nnf,[status(thm)],[53])).
% fof(272, negated_conjecture,![X3]:((~(aElementOf0(X3,xI))|X3=sz00)|?[X4]:((aElementOf0(X4,xI)&~(X4=sz00))&iLess0(sbrdtbr0(X4),sbrdtbr0(X3)))),inference(variable_rename,[status(thm)],[271])).
% fof(273, negated_conjecture,![X3]:((~(aElementOf0(X3,xI))|X3=sz00)|((aElementOf0(esk23_1(X3),xI)&~(esk23_1(X3)=sz00))&iLess0(sbrdtbr0(esk23_1(X3)),sbrdtbr0(X3)))),inference(skolemize,[status(esa)],[272])).
% fof(274, negated_conjecture,![X3]:(((aElementOf0(esk23_1(X3),xI)|(~(aElementOf0(X3,xI))|X3=sz00))&(~(esk23_1(X3)=sz00)|(~(aElementOf0(X3,xI))|X3=sz00)))&(iLess0(sbrdtbr0(esk23_1(X3)),sbrdtbr0(X3))|(~(aElementOf0(X3,xI))|X3=sz00))),inference(distribute,[status(thm)],[273])).
% cnf(275,negated_conjecture,(X1=sz00|iLess0(sbrdtbr0(esk23_1(X1)),sbrdtbr0(X1))|~aElementOf0(X1,xI)),inference(split_conjunct,[status(thm)],[274])).
% cnf(276,negated_conjecture,(X1=sz00|~aElementOf0(X1,xI)|esk23_1(X1)!=sz00),inference(split_conjunct,[status(thm)],[274])).
% cnf(277,negated_conjecture,(X1=sz00|aElementOf0(esk23_1(X1),xI)|~aElementOf0(X1,xI)),inference(split_conjunct,[status(thm)],[274])).
% cnf(393,negated_conjecture,(sz00=X1|sz00=esk23_1(esk2_1(X1))|sz00=esk2_1(X1)|~aElementOf0(esk23_1(esk2_1(X1)),xI)|~aElementOf0(X1,xI)|~aElementOf0(esk2_1(X1),xI)),inference(spm,[status(thm)],[82,275,theory(equality)])).
% cnf(450,plain,(aElementOf0(esk1_0,xI)),inference(rw,[status(thm)],[74,65,theory(equality)])).
% cnf(1099,negated_conjecture,(esk23_1(esk2_1(X1))=sz00|esk2_1(X1)=sz00|sz00=X1|~aElementOf0(esk23_1(esk2_1(X1)),xI)|~aElementOf0(X1,xI)),inference(csr,[status(thm)],[393,81])).
% cnf(1100,negated_conjecture,(esk23_1(esk2_1(X1))=sz00|sz00=X1|~aElementOf0(esk23_1(esk2_1(X1)),xI)|~aElementOf0(X1,xI)),inference(csr,[status(thm)],[1099,80])).
% cnf(1101,negated_conjecture,(esk23_1(esk2_1(X1))=sz00|sz00=X1|sz00=esk2_1(X1)|~aElementOf0(X1,xI)|~aElementOf0(esk2_1(X1),xI)),inference(spm,[status(thm)],[1100,277,theory(equality)])).
% cnf(2614,negated_conjecture,(esk23_1(esk2_1(X1))=sz00|esk2_1(X1)=sz00|sz00=X1|~aElementOf0(X1,xI)),inference(csr,[status(thm)],[1101,81])).
% cnf(2615,negated_conjecture,(esk23_1(esk2_1(X1))=sz00|sz00=X1|~aElementOf0(X1,xI)),inference(csr,[status(thm)],[2614,80])).
% cnf(2616,negated_conjecture,(sz00=esk2_1(X1)|sz00=X1|~aElementOf0(esk2_1(X1),xI)|~aElementOf0(X1,xI)),inference(spm,[status(thm)],[276,2615,theory(equality)])).
% cnf(2655,negated_conjecture,(esk2_1(X1)=sz00|sz00=X1|~aElementOf0(X1,xI)),inference(csr,[status(thm)],[2616,81])).
% cnf(2656,negated_conjecture,(sz00=X1|~aElementOf0(X1,xI)),inference(csr,[status(thm)],[2655,80])).
% cnf(2662,negated_conjecture,(sz00=esk1_0),inference(spm,[status(thm)],[2656,450,theory(equality)])).
% cnf(2684,negated_conjecture,($false),inference(sr,[status(thm)],[2662,73,theory(equality)])).
% cnf(2685,negated_conjecture,($false),2684,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 431
% # ...of these trivial : 11
% # ...subsumed : 148
% # ...remaining for further processing: 272
% # Other redundant clauses eliminated : 32
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 27
% # Backward-rewritten : 3
% # Generated clauses : 1308
% # ...of the previous two non-trivial : 1069
% # Contextual simplify-reflections : 103
% # Paramodulations : 1240
% # Factorizations : 0
% # Equation resolutions : 68
% # Current number of processed clauses: 242
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 207
% # Current number of unprocessed clauses: 668
% # ...number of literals in the above : 3517
% # Clause-clause subsumption calls (NU) : 1358
% # Rec. Clause-clause subsumption calls : 1006
% # Unit Clause-clause subsumption calls : 40
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 215 leaves, 1.33+/-1.136 terms/leaf
% # Paramod-from index: 123 leaves, 1.07+/-0.260 terms/leaf
% # Paramod-into index: 189 leaves, 1.22+/-0.643 terms/leaf
% # -------------------------------------------------
% # User time : 0.085 s
% # System time : 0.005 s
% # Total time : 0.090 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.29 WC
% FINAL PrfWatch: 0.21 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP14810/RNG112+1.tptp
%
%------------------------------------------------------------------------------