TSTP Solution File: RNG069+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG069+2 : TPTP v5.0.0. Released v4.0.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 22:21:07 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/SystemOnTPTP27269/RNG069+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27269/RNG069+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27269/RNG069+2.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 27365
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X1]:![X2]:((aScalar0(X1)&aScalar0(X2))=>aScalar0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mSumSc)).
% fof(9, axiom,![X1]:![X2]:![X3]:(((aScalar0(X1)&aScalar0(X2))&aScalar0(X3))=>(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X1,X2),X3)=sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3)))),file('/tmp/SRASS.s.p', mDistr)).
% fof(10, axiom,![X1]:![X2]:![X3]:![X4]:((((aScalar0(X1)&aScalar0(X2))&aScalar0(X3))&aScalar0(X4))=>sdtasdt0(sdtpldt0(X1,X2),sdtpldt0(X3,X4))=sdtpldt0(sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X1,X4)),sdtpldt0(sdtasdt0(X2,X3),sdtasdt0(X2,X4)))),file('/tmp/SRASS.s.p', mDistr2)).
% fof(36, axiom,(aScalar0(xR)&xR=sdtasdt0(xC,xG)),file('/tmp/SRASS.s.p', m__1892)).
% fof(37, axiom,(aScalar0(xP)&xP=sdtasdt0(xE,xH)),file('/tmp/SRASS.s.p', m__1911)).
% fof(38, axiom,(aScalar0(xS)&xS=sdtasdt0(xF,xD)),file('/tmp/SRASS.s.p', m__1930)).
% fof(39, axiom,(aScalar0(xN)&xN=sdtasdt0(xR,xS)),file('/tmp/SRASS.s.p', m__1949)).
% fof(45, axiom,sdtlseqdt0(sdtpldt0(sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP)),sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xR,xS)),sdtpldt0(sdtasdt0(xS,xR),sdtasdt0(xS,xS)))),file('/tmp/SRASS.s.p', m__2580)).
% fof(62, conjecture,sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))),file('/tmp/SRASS.s.p', m__)).
% fof(63, negated_conjecture,~(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)))),inference(assume_negation,[status(cth)],[62])).
% fof(69, negated_conjecture,~(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)))),inference(fof_simplification,[status(thm)],[63,theory(equality)])).
% fof(88, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|aScalar0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(89, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|aScalar0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[88])).
% cnf(90,plain,(aScalar0(sdtpldt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[89])).
% fof(101, plain,![X1]:![X2]:![X3]:(((~(aScalar0(X1))|~(aScalar0(X2)))|~(aScalar0(X3)))|(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X1,X2),X3)=sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3)))),inference(fof_nnf,[status(thm)],[9])).
% fof(102, plain,![X4]:![X5]:![X6]:(((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6)))|(sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))&sdtasdt0(sdtpldt0(X4,X5),X6)=sdtpldt0(sdtasdt0(X4,X6),sdtasdt0(X5,X6)))),inference(variable_rename,[status(thm)],[101])).
% fof(103, plain,![X4]:![X5]:![X6]:((sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))|((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6))))&(sdtasdt0(sdtpldt0(X4,X5),X6)=sdtpldt0(sdtasdt0(X4,X6),sdtasdt0(X5,X6))|((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6))))),inference(distribute,[status(thm)],[102])).
% cnf(104,plain,(sdtasdt0(sdtpldt0(X3,X2),X1)=sdtpldt0(sdtasdt0(X3,X1),sdtasdt0(X2,X1))|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[103])).
% cnf(105,plain,(sdtasdt0(X3,sdtpldt0(X2,X1))=sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[103])).
% fof(106, plain,![X1]:![X2]:![X3]:![X4]:((((~(aScalar0(X1))|~(aScalar0(X2)))|~(aScalar0(X3)))|~(aScalar0(X4)))|sdtasdt0(sdtpldt0(X1,X2),sdtpldt0(X3,X4))=sdtpldt0(sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X1,X4)),sdtpldt0(sdtasdt0(X2,X3),sdtasdt0(X2,X4)))),inference(fof_nnf,[status(thm)],[10])).
% fof(107, plain,![X5]:![X6]:![X7]:![X8]:((((~(aScalar0(X5))|~(aScalar0(X6)))|~(aScalar0(X7)))|~(aScalar0(X8)))|sdtasdt0(sdtpldt0(X5,X6),sdtpldt0(X7,X8))=sdtpldt0(sdtpldt0(sdtasdt0(X5,X7),sdtasdt0(X5,X8)),sdtpldt0(sdtasdt0(X6,X7),sdtasdt0(X6,X8)))),inference(variable_rename,[status(thm)],[106])).
% cnf(108,plain,(sdtasdt0(sdtpldt0(X1,X2),sdtpldt0(X3,X4))=sdtpldt0(sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X1,X4)),sdtpldt0(sdtasdt0(X2,X3),sdtasdt0(X2,X4)))|~aScalar0(X4)|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[107])).
% cnf(187,plain,(aScalar0(xR)),inference(split_conjunct,[status(thm)],[36])).
% cnf(189,plain,(aScalar0(xP)),inference(split_conjunct,[status(thm)],[37])).
% cnf(191,plain,(aScalar0(xS)),inference(split_conjunct,[status(thm)],[38])).
% cnf(192,plain,(xN=sdtasdt0(xR,xS)),inference(split_conjunct,[status(thm)],[39])).
% cnf(199,plain,(sdtlseqdt0(sdtpldt0(sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP)),sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xR,xS)),sdtpldt0(sdtasdt0(xS,xR),sdtasdt0(xS,xS))))),inference(split_conjunct,[status(thm)],[45])).
% cnf(253,negated_conjecture,(~sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)))),inference(split_conjunct,[status(thm)],[69])).
% cnf(254,plain,(sdtlseqdt0(sdtpldt0(sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP)),sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),xN),sdtpldt0(sdtasdt0(xS,xR),sdtasdt0(xS,xS))))),inference(rw,[status(thm)],[199,192,theory(equality)])).
% cnf(937,plain,(sdtpldt0(sdtasdt0(xR,X1),xN)=sdtasdt0(xR,sdtpldt0(X1,xS))|~aScalar0(xR)|~aScalar0(X1)|~aScalar0(xS)),inference(spm,[status(thm)],[105,192,theory(equality)])).
% cnf(972,plain,(sdtpldt0(sdtasdt0(xR,X1),xN)=sdtasdt0(xR,sdtpldt0(X1,xS))|$false|~aScalar0(X1)|~aScalar0(xS)),inference(rw,[status(thm)],[937,187,theory(equality)])).
% cnf(973,plain,(sdtpldt0(sdtasdt0(xR,X1),xN)=sdtasdt0(xR,sdtpldt0(X1,xS))|$false|~aScalar0(X1)|$false),inference(rw,[status(thm)],[972,191,theory(equality)])).
% cnf(974,plain,(sdtpldt0(sdtasdt0(xR,X1),xN)=sdtasdt0(xR,sdtpldt0(X1,xS))|~aScalar0(X1)),inference(cn,[status(thm)],[973,theory(equality)])).
% cnf(1163,plain,(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),xN),sdtpldt0(sdtasdt0(xS,xR),sdtasdt0(xS,xS))))|~aScalar0(xP)),inference(spm,[status(thm)],[254,108,theory(equality)])).
% cnf(1224,plain,(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),xN),sdtpldt0(sdtasdt0(xS,xR),sdtasdt0(xS,xS))))|$false),inference(rw,[status(thm)],[1163,189,theory(equality)])).
% cnf(1225,plain,(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),xN),sdtpldt0(sdtasdt0(xS,xR),sdtasdt0(xS,xS))))),inference(cn,[status(thm)],[1224,theory(equality)])).
% cnf(1652,plain,(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),xN),sdtasdt0(xS,sdtpldt0(xR,xS))))|~aScalar0(xS)|~aScalar0(xR)),inference(spm,[status(thm)],[1225,105,theory(equality)])).
% cnf(1678,plain,(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),xN),sdtasdt0(xS,sdtpldt0(xR,xS))))|$false|~aScalar0(xR)),inference(rw,[status(thm)],[1652,191,theory(equality)])).
% cnf(1679,plain,(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),xN),sdtasdt0(xS,sdtpldt0(xR,xS))))|$false|$false),inference(rw,[status(thm)],[1678,187,theory(equality)])).
% cnf(1680,plain,(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),xN),sdtasdt0(xS,sdtpldt0(xR,xS))))),inference(cn,[status(thm)],[1679,theory(equality)])).
% cnf(4231,plain,(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtpldt0(sdtasdt0(xR,sdtpldt0(xR,xS)),sdtasdt0(xS,sdtpldt0(xR,xS))))|~aScalar0(xR)),inference(spm,[status(thm)],[1680,974,theory(equality)])).
% cnf(4273,plain,(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtpldt0(sdtasdt0(xR,sdtpldt0(xR,xS)),sdtasdt0(xS,sdtpldt0(xR,xS))))|$false),inference(rw,[status(thm)],[4231,187,theory(equality)])).
% cnf(4274,plain,(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtpldt0(sdtasdt0(xR,sdtpldt0(xR,xS)),sdtasdt0(xS,sdtpldt0(xR,xS))))),inference(cn,[status(thm)],[4273,theory(equality)])).
% cnf(4352,plain,(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)))|~aScalar0(xR)|~aScalar0(xS)|~aScalar0(sdtpldt0(xR,xS))),inference(spm,[status(thm)],[4274,104,theory(equality)])).
% cnf(4359,plain,(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)))|$false|~aScalar0(xS)|~aScalar0(sdtpldt0(xR,xS))),inference(rw,[status(thm)],[4352,187,theory(equality)])).
% cnf(4360,plain,(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)))|$false|$false|~aScalar0(sdtpldt0(xR,xS))),inference(rw,[status(thm)],[4359,191,theory(equality)])).
% cnf(4361,plain,(sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)))|~aScalar0(sdtpldt0(xR,xS))),inference(cn,[status(thm)],[4360,theory(equality)])).
% cnf(4362,plain,(~aScalar0(sdtpldt0(xR,xS))),inference(sr,[status(thm)],[4361,253,theory(equality)])).
% cnf(4378,plain,(~aScalar0(xS)|~aScalar0(xR)),inference(spm,[status(thm)],[4362,90,theory(equality)])).
% cnf(4379,plain,($false|~aScalar0(xR)),inference(rw,[status(thm)],[4378,191,theory(equality)])).
% cnf(4380,plain,($false|$false),inference(rw,[status(thm)],[4379,187,theory(equality)])).
% cnf(4381,plain,($false),inference(cn,[status(thm)],[4380,theory(equality)])).
% cnf(4382,plain,($false),4381,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 265
% # ...of these trivial : 7
% # ...subsumed : 50
% # ...remaining for further processing: 208
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 22
% # Backward-rewritten : 18
% # Generated clauses : 1404
% # ...of the previous two non-trivial : 1104
% # Contextual simplify-reflections : 37
% # Paramodulations : 1390
% # Factorizations : 2
% # Equation resolutions : 12
% # Current number of processed clauses: 168
% # Positive orientable unit clauses: 93
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 72
% # Current number of unprocessed clauses: 770
% # ...number of literals in the above : 2814
% # Clause-clause subsumption calls (NU) : 530
% # Rec. Clause-clause subsumption calls : 360
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 26
% # Indexed BW rewrite successes : 20
% # Backwards rewriting index: 250 leaves, 1.19+/-0.802 terms/leaf
% # Paramod-from index: 119 leaves, 1.09+/-0.317 terms/leaf
% # Paramod-into index: 211 leaves, 1.13+/-0.614 terms/leaf
% # -------------------------------------------------
% # User time : 0.073 s
% # System time : 0.004 s
% # Total time : 0.077 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/SystemOnTPTP27269/RNG069+2.tptp
%
%------------------------------------------------------------------------------