TSTP Solution File: RNG080+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG080+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 : art04.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:27:05 EST 2010
% Result : Theorem 14.47s
% Output : Solution 14.47s
% 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/SystemOnTPTP31285/RNG080+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31285/RNG080+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31285/RNG080+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 31381
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.94 CPU 2.03 WC
% PrfWatch: 3.54 CPU 4.03 WC
% PrfWatch: 5.18 CPU 6.04 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.16 CPU 8.04 WC
% PrfWatch: 9.16 CPU 10.05 WC
% PrfWatch: 11.14 CPU 12.05 WC
% PrfWatch: 13.14 CPU 14.06 WC
% # SZS output start CNFRefutation.
% fof(13, axiom,![X1]:![X2]:((aVector0(X1)&aVector0(X2))=>((aDimensionOf0(X1)=aDimensionOf0(X2)&~(aDimensionOf0(X2)=sz00))=>sdtasasdt0(X1,X2)=sdtpldt0(sdtasasdt0(sziznziztdt0(X1),sziznziztdt0(X2)),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),sdtlbdtrb0(X2,aDimensionOf0(X2)))))),file('/tmp/SRASS.s.p', mDefSPN)).
% fof(14, axiom,(aVector0(xs)&aVector0(xt)),file('/tmp/SRASS.s.p', m__1678)).
% fof(16, axiom,aDimensionOf0(xs)=aDimensionOf0(xt),file('/tmp/SRASS.s.p', m__1678_01)).
% fof(17, axiom,~(aDimensionOf0(xs)=sz00),file('/tmp/SRASS.s.p', m__1692)).
% fof(18, axiom,(aVector0(xp)&xp=sziznziztdt0(xs)),file('/tmp/SRASS.s.p', m__1709)).
% fof(19, axiom,(aVector0(xq)&xq=sziznziztdt0(xt)),file('/tmp/SRASS.s.p', m__1726)).
% fof(20, axiom,(aScalar0(xA)&xA=sdtlbdtrb0(xs,aDimensionOf0(xs))),file('/tmp/SRASS.s.p', m__1746)).
% fof(21, axiom,(aScalar0(xB)&xB=sdtlbdtrb0(xt,aDimensionOf0(xt))),file('/tmp/SRASS.s.p', m__1766)).
% fof(22, axiom,(aScalar0(xC)&xC=sdtasasdt0(xp,xp)),file('/tmp/SRASS.s.p', m__1783)).
% fof(23, axiom,(aScalar0(xD)&xD=sdtasasdt0(xq,xq)),file('/tmp/SRASS.s.p', m__1800)).
% fof(24, axiom,(aScalar0(xE)&xE=sdtasasdt0(xp,xq)),file('/tmp/SRASS.s.p', m__1820)).
% fof(25, axiom,(aScalar0(xF)&xF=sdtasdt0(xA,xA)),file('/tmp/SRASS.s.p', m__1837)).
% fof(26, axiom,(aScalar0(xG)&xG=sdtasdt0(xB,xB)),file('/tmp/SRASS.s.p', m__1854)).
% fof(27, axiom,(aScalar0(xH)&xH=sdtasdt0(xA,xB)),file('/tmp/SRASS.s.p', m__1873)).
% fof(34, axiom,sdtlseqdt0(sdtasdt0(sdtpldt0(xE,xH),sdtpldt0(xE,xH)),sdtasdt0(sdtpldt0(xC,xF),sdtpldt0(xD,xG))),file('/tmp/SRASS.s.p', m__2733)).
% fof(59, conjecture,sdtlseqdt0(sdtasdt0(sdtasasdt0(xs,xt),sdtasasdt0(xs,xt)),sdtasdt0(sdtasasdt0(xs,xs),sdtasasdt0(xt,xt))),file('/tmp/SRASS.s.p', m__)).
% fof(60, negated_conjecture,~(sdtlseqdt0(sdtasdt0(sdtasasdt0(xs,xt),sdtasasdt0(xs,xt)),sdtasdt0(sdtasasdt0(xs,xs),sdtasasdt0(xt,xt)))),inference(assume_negation,[status(cth)],[59])).
% fof(66, negated_conjecture,~(sdtlseqdt0(sdtasdt0(sdtasasdt0(xs,xt),sdtasasdt0(xs,xt)),sdtasdt0(sdtasasdt0(xs,xs),sdtasasdt0(xt,xt)))),inference(fof_simplification,[status(thm)],[60,theory(equality)])).
% fof(109, plain,![X1]:![X2]:((~(aVector0(X1))|~(aVector0(X2)))|((~(aDimensionOf0(X1)=aDimensionOf0(X2))|aDimensionOf0(X2)=sz00)|sdtasasdt0(X1,X2)=sdtpldt0(sdtasasdt0(sziznziztdt0(X1),sziznziztdt0(X2)),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),sdtlbdtrb0(X2,aDimensionOf0(X2)))))),inference(fof_nnf,[status(thm)],[13])).
% fof(110, plain,![X3]:![X4]:((~(aVector0(X3))|~(aVector0(X4)))|((~(aDimensionOf0(X3)=aDimensionOf0(X4))|aDimensionOf0(X4)=sz00)|sdtasasdt0(X3,X4)=sdtpldt0(sdtasasdt0(sziznziztdt0(X3),sziznziztdt0(X4)),sdtasdt0(sdtlbdtrb0(X3,aDimensionOf0(X3)),sdtlbdtrb0(X4,aDimensionOf0(X4)))))),inference(variable_rename,[status(thm)],[109])).
% cnf(111,plain,(sdtasasdt0(X1,X2)=sdtpldt0(sdtasasdt0(sziznziztdt0(X1),sziznziztdt0(X2)),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),sdtlbdtrb0(X2,aDimensionOf0(X2))))|aDimensionOf0(X2)=sz00|aDimensionOf0(X1)!=aDimensionOf0(X2)|~aVector0(X2)|~aVector0(X1)),inference(split_conjunct,[status(thm)],[110])).
% cnf(112,plain,(aVector0(xt)),inference(split_conjunct,[status(thm)],[14])).
% cnf(113,plain,(aVector0(xs)),inference(split_conjunct,[status(thm)],[14])).
% cnf(117,plain,(aDimensionOf0(xs)=aDimensionOf0(xt)),inference(split_conjunct,[status(thm)],[16])).
% cnf(118,plain,(aDimensionOf0(xs)!=sz00),inference(split_conjunct,[status(thm)],[17])).
% cnf(119,plain,(xp=sziznziztdt0(xs)),inference(split_conjunct,[status(thm)],[18])).
% cnf(121,plain,(xq=sziznziztdt0(xt)),inference(split_conjunct,[status(thm)],[19])).
% cnf(123,plain,(xA=sdtlbdtrb0(xs,aDimensionOf0(xs))),inference(split_conjunct,[status(thm)],[20])).
% cnf(125,plain,(xB=sdtlbdtrb0(xt,aDimensionOf0(xt))),inference(split_conjunct,[status(thm)],[21])).
% cnf(127,plain,(xC=sdtasasdt0(xp,xp)),inference(split_conjunct,[status(thm)],[22])).
% cnf(129,plain,(xD=sdtasasdt0(xq,xq)),inference(split_conjunct,[status(thm)],[23])).
% cnf(131,plain,(xE=sdtasasdt0(xp,xq)),inference(split_conjunct,[status(thm)],[24])).
% cnf(133,plain,(xF=sdtasdt0(xA,xA)),inference(split_conjunct,[status(thm)],[25])).
% cnf(135,plain,(xG=sdtasdt0(xB,xB)),inference(split_conjunct,[status(thm)],[26])).
% cnf(137,plain,(xH=sdtasdt0(xA,xB)),inference(split_conjunct,[status(thm)],[27])).
% cnf(149,plain,(sdtlseqdt0(sdtasdt0(sdtpldt0(xE,xH),sdtpldt0(xE,xH)),sdtasdt0(sdtpldt0(xC,xF),sdtpldt0(xD,xG)))),inference(split_conjunct,[status(thm)],[34])).
% cnf(237,negated_conjecture,(~sdtlseqdt0(sdtasdt0(sdtasasdt0(xs,xt),sdtasasdt0(xs,xt)),sdtasdt0(sdtasasdt0(xs,xs),sdtasasdt0(xt,xt)))),inference(split_conjunct,[status(thm)],[66])).
% cnf(238,plain,(sdtlbdtrb0(xt,aDimensionOf0(xs))=xB),inference(rw,[status(thm)],[125,117,theory(equality)])).
% cnf(1078,plain,(sdtpldt0(sdtasasdt0(sziznziztdt0(X1),sziznziztdt0(X1)),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),sdtlbdtrb0(X1,aDimensionOf0(X1))))=sdtasasdt0(X1,X1)|aDimensionOf0(X1)=sz00|~aVector0(X1)),inference(er,[status(thm)],[111,theory(equality)])).
% cnf(1079,plain,(sdtpldt0(sdtasasdt0(sziznziztdt0(X1),sziznziztdt0(xt)),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),sdtlbdtrb0(xt,aDimensionOf0(xs))))=sdtasasdt0(X1,xt)|aDimensionOf0(xs)=sz00|aDimensionOf0(X1)!=aDimensionOf0(xs)|~aVector0(xt)|~aVector0(X1)),inference(spm,[status(thm)],[111,117,theory(equality)])).
% cnf(1081,plain,(sdtpldt0(sdtasasdt0(sziznziztdt0(X1),xq),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),xB))=sdtasasdt0(X1,xt)|aDimensionOf0(xs)=sz00|aDimensionOf0(X1)!=aDimensionOf0(xs)|~aVector0(xt)|~aVector0(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1079,121,theory(equality)]),238,theory(equality)])).
% cnf(1082,plain,(sdtpldt0(sdtasasdt0(sziznziztdt0(X1),xq),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),xB))=sdtasasdt0(X1,xt)|aDimensionOf0(xs)=sz00|aDimensionOf0(X1)!=aDimensionOf0(xs)|$false|~aVector0(X1)),inference(rw,[status(thm)],[1081,112,theory(equality)])).
% cnf(1083,plain,(sdtpldt0(sdtasasdt0(sziznziztdt0(X1),xq),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),xB))=sdtasasdt0(X1,xt)|aDimensionOf0(xs)=sz00|aDimensionOf0(X1)!=aDimensionOf0(xs)|~aVector0(X1)),inference(cn,[status(thm)],[1082,theory(equality)])).
% cnf(1084,plain,(sdtpldt0(sdtasasdt0(sziznziztdt0(X1),xq),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),xB))=sdtasasdt0(X1,xt)|aDimensionOf0(X1)!=aDimensionOf0(xs)|~aVector0(X1)),inference(sr,[status(thm)],[1083,118,theory(equality)])).
% cnf(527851,plain,(sdtpldt0(sdtasasdt0(sziznziztdt0(xt),sziznziztdt0(xt)),sdtasdt0(sdtlbdtrb0(xt,aDimensionOf0(xs)),sdtlbdtrb0(xt,aDimensionOf0(xs))))=sdtasasdt0(xt,xt)|aDimensionOf0(xs)=sz00|~aVector0(xt)),inference(spm,[status(thm)],[1078,117,theory(equality)])).
% cnf(527852,plain,(sdtpldt0(sdtasasdt0(sziznziztdt0(xs),sziznziztdt0(xs)),sdtasdt0(xA,xA))=sdtasasdt0(xs,xs)|aDimensionOf0(xs)=sz00|~aVector0(xs)),inference(spm,[status(thm)],[1078,123,theory(equality)])).
% cnf(527869,plain,(sdtpldt0(xD,xG)=sdtasasdt0(xt,xt)|aDimensionOf0(xs)=sz00|~aVector0(xt)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[527851,121,theory(equality)]),121,theory(equality)]),129,theory(equality)]),238,theory(equality)]),238,theory(equality)]),135,theory(equality)])).
% cnf(527870,plain,(sdtpldt0(xD,xG)=sdtasasdt0(xt,xt)|aDimensionOf0(xs)=sz00|$false),inference(rw,[status(thm)],[527869,112,theory(equality)])).
% cnf(527871,plain,(sdtpldt0(xD,xG)=sdtasasdt0(xt,xt)|aDimensionOf0(xs)=sz00),inference(cn,[status(thm)],[527870,theory(equality)])).
% cnf(527872,plain,(sdtasasdt0(xt,xt)=sdtpldt0(xD,xG)),inference(sr,[status(thm)],[527871,118,theory(equality)])).
% cnf(527873,plain,(sdtpldt0(xC,xF)=sdtasasdt0(xs,xs)|aDimensionOf0(xs)=sz00|~aVector0(xs)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[527852,119,theory(equality)]),119,theory(equality)]),127,theory(equality)]),133,theory(equality)])).
% cnf(527874,plain,(sdtpldt0(xC,xF)=sdtasasdt0(xs,xs)|aDimensionOf0(xs)=sz00|$false),inference(rw,[status(thm)],[527873,113,theory(equality)])).
% cnf(527875,plain,(sdtpldt0(xC,xF)=sdtasasdt0(xs,xs)|aDimensionOf0(xs)=sz00),inference(cn,[status(thm)],[527874,theory(equality)])).
% cnf(527876,plain,(sdtasasdt0(xs,xs)=sdtpldt0(xC,xF)),inference(sr,[status(thm)],[527875,118,theory(equality)])).
% cnf(527949,negated_conjecture,(~sdtlseqdt0(sdtasdt0(sdtasasdt0(xs,xt),sdtasasdt0(xs,xt)),sdtasdt0(sdtasasdt0(xs,xs),sdtpldt0(xD,xG)))),inference(rw,[status(thm)],[237,527872,theory(equality)])).
% cnf(528016,negated_conjecture,(~sdtlseqdt0(sdtasdt0(sdtasasdt0(xs,xt),sdtasasdt0(xs,xt)),sdtasdt0(sdtpldt0(xC,xF),sdtpldt0(xD,xG)))),inference(rw,[status(thm)],[527949,527876,theory(equality)])).
% cnf(528033,plain,(sdtpldt0(sdtasasdt0(sziznziztdt0(xs),xq),sdtasdt0(sdtlbdtrb0(xs,aDimensionOf0(xs)),xB))=sdtasasdt0(xs,xt)|~aVector0(xs)),inference(er,[status(thm)],[1084,theory(equality)])).
% cnf(528036,plain,(sdtpldt0(xE,xH)=sdtasasdt0(xs,xt)|~aVector0(xs)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[528033,119,theory(equality)]),131,theory(equality)]),123,theory(equality)]),137,theory(equality)])).
% cnf(528037,plain,(sdtpldt0(xE,xH)=sdtasasdt0(xs,xt)|$false),inference(rw,[status(thm)],[528036,113,theory(equality)])).
% cnf(528038,plain,(sdtpldt0(xE,xH)=sdtasasdt0(xs,xt)),inference(cn,[status(thm)],[528037,theory(equality)])).
% cnf(528046,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[528016,528038,theory(equality)]),528038,theory(equality)]),149,theory(equality)])).
% cnf(528047,negated_conjecture,($false),inference(cn,[status(thm)],[528046,theory(equality)])).
% cnf(528048,negated_conjecture,($false),528047,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3092
% # ...of these trivial : 419
% # ...subsumed : 956
% # ...remaining for further processing: 1717
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 113
% # Backward-rewritten : 307
% # Generated clauses : 149735
% # ...of the previous two non-trivial : 137602
% # Contextual simplify-reflections : 317
% # Paramodulations : 149705
% # Factorizations : 4
% # Equation resolutions : 26
% # Current number of processed clauses: 1297
% # Positive orientable unit clauses: 829
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 466
% # Current number of unprocessed clauses: 107436
% # ...number of literals in the above : 384235
% # Clause-clause subsumption calls (NU) : 18465
% # Rec. Clause-clause subsumption calls : 7917
% # Unit Clause-clause subsumption calls : 25
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3314
% # Indexed BW rewrite successes : 124
% # Backwards rewriting index: 1497 leaves, 1.38+/-1.865 terms/leaf
% # Paramod-from index: 798 leaves, 1.43+/-2.265 terms/leaf
% # Paramod-into index: 1329 leaves, 1.36+/-1.904 terms/leaf
% # -------------------------------------------------
% # User time : 5.982 s
% # System time : 0.280 s
% # Total time : 6.262 s
% # Maximum resident set size: 0 pages
% PrfWatch: 13.59 CPU 14.51 WC
% FINAL PrfWatch: 13.59 CPU 14.51 WC
% SZS output end Solution for /tmp/SystemOnTPTP31285/RNG080+1.tptp
%
%------------------------------------------------------------------------------