TSTP Solution File: RNG050+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG050+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 22:10:50 EST 2010
% Result : Theorem 1.17s
% Output : Solution 1.17s
% 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/SystemOnTPTP12550/RNG050+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12550/RNG050+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12550/RNG050+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 12682
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:((aVector0(X1)&aVector0(X2))=>((aDimensionOf0(X1)=aDimensionOf0(X2)&aDimensionOf0(X2)=sz00)=>sdtasasdt0(X1,X2)=sz0z00)),file('/tmp/SRASS.s.p', mDefSPZ)).
% fof(2, axiom,aVector0(xs),file('/tmp/SRASS.s.p', m__1542)).
% fof(7, axiom,aScalar0(sz0z00),file('/tmp/SRASS.s.p', mSZeroSc)).
% fof(14, axiom,![X1]:(aScalar0(X1)=>sdtlseqdt0(sz0z00,sdtasdt0(X1,X1))),file('/tmp/SRASS.s.p', mSqPos)).
% fof(36, axiom,![X1]:(aScalar0(X1)=>(((((((sdtpldt0(X1,sz0z00)=X1&sdtpldt0(sz0z00,X1)=X1)&sdtasdt0(X1,sz0z00)=sz0z00)&sdtasdt0(sz0z00,X1)=sz0z00)&sdtpldt0(X1,smndt0(X1))=sz0z00)&sdtpldt0(smndt0(X1),X1)=sz0z00)&smndt0(smndt0(X1))=X1)&smndt0(sz0z00)=sz0z00)),file('/tmp/SRASS.s.p', mScZero)).
% fof(39, conjecture,((~(aDimensionOf0(xs)=sz00)=>sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)))=>sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs))),file('/tmp/SRASS.s.p', m__)).
% fof(40, negated_conjecture,~(((~(aDimensionOf0(xs)=sz00)=>sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)))=>sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)))),inference(assume_negation,[status(cth)],[39])).
% fof(46, plain,![X1]:![X2]:((~(aVector0(X1))|~(aVector0(X2)))|((~(aDimensionOf0(X1)=aDimensionOf0(X2))|~(aDimensionOf0(X2)=sz00))|sdtasasdt0(X1,X2)=sz0z00)),inference(fof_nnf,[status(thm)],[1])).
% fof(47, plain,![X3]:![X4]:((~(aVector0(X3))|~(aVector0(X4)))|((~(aDimensionOf0(X3)=aDimensionOf0(X4))|~(aDimensionOf0(X4)=sz00))|sdtasasdt0(X3,X4)=sz0z00)),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(sdtasasdt0(X1,X2)=sz0z00|aDimensionOf0(X2)!=sz00|aDimensionOf0(X1)!=aDimensionOf0(X2)|~aVector0(X2)|~aVector0(X1)),inference(split_conjunct,[status(thm)],[47])).
% cnf(49,plain,(aVector0(xs)),inference(split_conjunct,[status(thm)],[2])).
% cnf(62,plain,(aScalar0(sz0z00)),inference(split_conjunct,[status(thm)],[7])).
% fof(81, plain,![X1]:(~(aScalar0(X1))|sdtlseqdt0(sz0z00,sdtasdt0(X1,X1))),inference(fof_nnf,[status(thm)],[14])).
% fof(82, plain,![X2]:(~(aScalar0(X2))|sdtlseqdt0(sz0z00,sdtasdt0(X2,X2))),inference(variable_rename,[status(thm)],[81])).
% cnf(83,plain,(sdtlseqdt0(sz0z00,sdtasdt0(X1,X1))|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[82])).
% fof(164, plain,![X1]:(~(aScalar0(X1))|(((((((sdtpldt0(X1,sz0z00)=X1&sdtpldt0(sz0z00,X1)=X1)&sdtasdt0(X1,sz0z00)=sz0z00)&sdtasdt0(sz0z00,X1)=sz0z00)&sdtpldt0(X1,smndt0(X1))=sz0z00)&sdtpldt0(smndt0(X1),X1)=sz0z00)&smndt0(smndt0(X1))=X1)&smndt0(sz0z00)=sz0z00)),inference(fof_nnf,[status(thm)],[36])).
% fof(165, plain,![X2]:(~(aScalar0(X2))|(((((((sdtpldt0(X2,sz0z00)=X2&sdtpldt0(sz0z00,X2)=X2)&sdtasdt0(X2,sz0z00)=sz0z00)&sdtasdt0(sz0z00,X2)=sz0z00)&sdtpldt0(X2,smndt0(X2))=sz0z00)&sdtpldt0(smndt0(X2),X2)=sz0z00)&smndt0(smndt0(X2))=X2)&smndt0(sz0z00)=sz0z00)),inference(variable_rename,[status(thm)],[164])).
% fof(166, plain,![X2]:((((((((sdtpldt0(X2,sz0z00)=X2|~(aScalar0(X2)))&(sdtpldt0(sz0z00,X2)=X2|~(aScalar0(X2))))&(sdtasdt0(X2,sz0z00)=sz0z00|~(aScalar0(X2))))&(sdtasdt0(sz0z00,X2)=sz0z00|~(aScalar0(X2))))&(sdtpldt0(X2,smndt0(X2))=sz0z00|~(aScalar0(X2))))&(sdtpldt0(smndt0(X2),X2)=sz0z00|~(aScalar0(X2))))&(smndt0(smndt0(X2))=X2|~(aScalar0(X2))))&(smndt0(sz0z00)=sz0z00|~(aScalar0(X2)))),inference(distribute,[status(thm)],[165])).
% cnf(171,plain,(sdtasdt0(sz0z00,X1)=sz0z00|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[166])).
% fof(179, negated_conjecture,((aDimensionOf0(xs)=sz00|sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)))&~(sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)))),inference(fof_nnf,[status(thm)],[40])).
% cnf(180,negated_conjecture,(~sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs))),inference(split_conjunct,[status(thm)],[179])).
% cnf(181,negated_conjecture,(sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs))|aDimensionOf0(xs)=sz00),inference(split_conjunct,[status(thm)],[179])).
% cnf(182,negated_conjecture,(aDimensionOf0(xs)=sz00),inference(sr,[status(thm)],[181,180,theory(equality)])).
% cnf(192,plain,(sdtlseqdt0(sz0z00,sz0z00)|~aScalar0(sz0z00)),inference(spm,[status(thm)],[83,171,theory(equality)])).
% cnf(194,plain,(sdtlseqdt0(sz0z00,sz0z00)|$false),inference(rw,[status(thm)],[192,62,theory(equality)])).
% cnf(195,plain,(sdtlseqdt0(sz0z00,sz0z00)),inference(cn,[status(thm)],[194,theory(equality)])).
% cnf(305,negated_conjecture,(sdtasasdt0(X1,xs)=sz0z00|aDimensionOf0(X1)!=sz00|~aVector0(xs)|~aVector0(X1)),inference(spm,[status(thm)],[48,182,theory(equality)])).
% cnf(307,negated_conjecture,(sdtasasdt0(X1,xs)=sz0z00|aDimensionOf0(X1)!=sz00|$false|~aVector0(X1)),inference(rw,[status(thm)],[305,49,theory(equality)])).
% cnf(308,negated_conjecture,(sdtasasdt0(X1,xs)=sz0z00|aDimensionOf0(X1)!=sz00|~aVector0(X1)),inference(cn,[status(thm)],[307,theory(equality)])).
% cnf(311,negated_conjecture,(sdtasasdt0(xs,xs)=sz0z00|~aVector0(xs)),inference(spm,[status(thm)],[308,182,theory(equality)])).
% cnf(312,negated_conjecture,(sdtasasdt0(xs,xs)=sz0z00|$false),inference(rw,[status(thm)],[311,49,theory(equality)])).
% cnf(313,negated_conjecture,(sdtasasdt0(xs,xs)=sz0z00),inference(cn,[status(thm)],[312,theory(equality)])).
% cnf(316,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[180,313,theory(equality)]),195,theory(equality)])).
% cnf(317,negated_conjecture,($false),inference(cn,[status(thm)],[316,theory(equality)])).
% cnf(318,negated_conjecture,($false),317,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 56
% # ...of these trivial : 3
% # ...subsumed : 8
% # ...remaining for further processing: 45
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 3
% # Generated clauses : 62
% # ...of the previous two non-trivial : 43
% # Contextual simplify-reflections : 0
% # Paramodulations : 55
% # Factorizations : 2
% # Equation resolutions : 5
% # Current number of processed clauses: 39
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 30
% # Current number of unprocessed clauses: 32
% # ...number of literals in the above : 143
% # Clause-clause subsumption calls (NU) : 35
% # Rec. Clause-clause subsumption calls : 28
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 49 leaves, 1.22+/-0.464 terms/leaf
% # Paramod-from index: 27 leaves, 1.07+/-0.378 terms/leaf
% # Paramod-into index: 41 leaves, 1.15+/-0.417 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.006 s
% # Total time : 0.019 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP12550/RNG050+1.tptp
%
%------------------------------------------------------------------------------