%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG070+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 : 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:18 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP27528/RNG070+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27528/RNG070+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27528/RNG070+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 27624
% 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(1, axiom,![X1]:![X2]:((aScalar0(X1)&aScalar0(X2))=>aScalar0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mSumSc)).
% fof(10, axiom,![X1]:![X2]:((aScalar0(X1)&aScalar0(X2))=>(sdtlseqdt0(X1,X2)|sdtlseqdt0(X2,X1))),file('/tmp/SRASS.s.p', mLETot)).
% fof(28, axiom,(aScalar0(xR)&xR=sdtasdt0(xC,xG)),file('/tmp/SRASS.s.p', m__1892)).
% fof(29, axiom,(aScalar0(xP)&xP=sdtasdt0(xE,xH)),file('/tmp/SRASS.s.p', m__1911)).
% fof(30, axiom,(aScalar0(xS)&xS=sdtasdt0(xF,xD)),file('/tmp/SRASS.s.p', m__1930)).
% fof(36, axiom,~(sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS))),file('/tmp/SRASS.s.p', m__2590)).
% fof(61, conjecture,sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),file('/tmp/SRASS.s.p', m__)).
% fof(62, negated_conjecture,~(sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP))),inference(assume_negation,[status(cth)],[61])).
% fof(63, plain,~(sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS))),inference(fof_simplification,[status(thm)],[36,theory(equality)])).
% fof(69, negated_conjecture,~(sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP))),inference(fof_simplification,[status(thm)],[62,theory(equality)])).
% fof(70, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|aScalar0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(71, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|aScalar0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[70])).
% cnf(72,plain,(aScalar0(sdtpldt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[71])).
% fof(103, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|(sdtlseqdt0(X1,X2)|sdtlseqdt0(X2,X1))),inference(fof_nnf,[status(thm)],[10])).
% fof(104, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|(sdtlseqdt0(X3,X4)|sdtlseqdt0(X4,X3))),inference(variable_rename,[status(thm)],[103])).
% cnf(105,plain,(sdtlseqdt0(X1,X2)|sdtlseqdt0(X2,X1)|~aScalar0(X1)|~aScalar0(X2)),inference(split_conjunct,[status(thm)],[104])).
% cnf(143,plain,(aScalar0(xR)),inference(split_conjunct,[status(thm)],[28])).
% cnf(145,plain,(aScalar0(xP)),inference(split_conjunct,[status(thm)],[29])).
% cnf(147,plain,(aScalar0(xS)),inference(split_conjunct,[status(thm)],[30])).
% cnf(154,plain,(~sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS))),inference(split_conjunct,[status(thm)],[63])).
% cnf(242,negated_conjecture,(~sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP))),inference(split_conjunct,[status(thm)],[69])).
% cnf(352,negated_conjecture,(sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS))|~aScalar0(sdtpldt0(xR,xS))|~aScalar0(sdtpldt0(xP,xP))),inference(spm,[status(thm)],[242,105,theory(equality)])).
% cnf(354,negated_conjecture,(~aScalar0(sdtpldt0(xR,xS))|~aScalar0(sdtpldt0(xP,xP))),inference(sr,[status(thm)],[352,154,theory(equality)])).
% cnf(1160,negated_conjecture,(~aScalar0(sdtpldt0(xP,xP))|~aScalar0(xS)|~aScalar0(xR)),inference(spm,[status(thm)],[354,72,theory(equality)])).
% cnf(1161,negated_conjecture,(~aScalar0(sdtpldt0(xP,xP))|$false|~aScalar0(xR)),inference(rw,[status(thm)],[1160,147,theory(equality)])).
% cnf(1162,negated_conjecture,(~aScalar0(sdtpldt0(xP,xP))|$false|$false),inference(rw,[status(thm)],[1161,143,theory(equality)])).
% cnf(1163,negated_conjecture,(~aScalar0(sdtpldt0(xP,xP))),inference(cn,[status(thm)],[1162,theory(equality)])).
% cnf(1166,negated_conjecture,(~aScalar0(xP)),inference(spm,[status(thm)],[1163,72,theory(equality)])).
% cnf(1171,negated_conjecture,($false),inference(rw,[status(thm)],[1166,145,theory(equality)])).
% cnf(1172,negated_conjecture,($false),inference(cn,[status(thm)],[1171,theory(equality)])).
% cnf(1173,negated_conjecture,($false),1172,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 92
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 92
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 390
% # ...of the previous two non-trivial : 342
% # Contextual simplify-reflections : 0
% # Paramodulations : 378
% # Factorizations : 2
% # Equation resolutions : 10
% # Current number of processed clauses: 92
% # Positive orientable unit clauses: 37
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 51
% # Current number of unprocessed clauses: 340
% # ...number of literals in the above : 1351
% # Clause-clause subsumption calls (NU) : 238
% # Rec. Clause-clause subsumption calls : 83
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 134 leaves, 1.30+/-1.058 terms/leaf
% # Paramod-from index: 65 leaves, 1.08+/-0.319 terms/leaf
% # Paramod-into index: 109 leaves, 1.18+/-0.815 terms/leaf
% # -------------------------------------------------
% # User time : 0.026 s
% # System time : 0.008 s
% # Total time : 0.034 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP27528/RNG070+1.tptp
%
%------------------------------------------------------------------------------