TSTP Solution File: RNG070+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG070+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 : 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:21:28 EST 2010
% Result : Theorem 1.00s
% Output : Solution 1.00s
% 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/SystemOnTPTP1744/RNG070+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1744/RNG070+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1744/RNG070+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 1841
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.018 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(15, axiom,![X1]:![X2]:((aScalar0(X1)&aScalar0(X2))=>(sdtlseqdt0(X1,X2)|sdtlseqdt0(X2,X1))),file('/tmp/SRASS.s.p', mLETot)).
% 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(44, 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)],[44,theory(equality)])).
% fof(69, negated_conjecture,~(sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP))),inference(fof_simplification,[status(thm)],[62,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(121, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|(sdtlseqdt0(X1,X2)|sdtlseqdt0(X2,X1))),inference(fof_nnf,[status(thm)],[15])).
% fof(122, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|(sdtlseqdt0(X3,X4)|sdtlseqdt0(X4,X3))),inference(variable_rename,[status(thm)],[121])).
% cnf(123,plain,(sdtlseqdt0(X1,X2)|sdtlseqdt0(X2,X1)|~aScalar0(X1)|~aScalar0(X2)),inference(split_conjunct,[status(thm)],[122])).
% 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(198,plain,(~sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS))),inference(split_conjunct,[status(thm)],[63])).
% cnf(252,negated_conjecture,(~sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP))),inference(split_conjunct,[status(thm)],[69])).
% cnf(369,negated_conjecture,(sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS))|~aScalar0(sdtpldt0(xR,xS))|~aScalar0(sdtpldt0(xP,xP))),inference(spm,[status(thm)],[252,123,theory(equality)])).
% cnf(371,negated_conjecture,(~aScalar0(sdtpldt0(xR,xS))|~aScalar0(sdtpldt0(xP,xP))),inference(sr,[status(thm)],[369,198,theory(equality)])).
% cnf(1199,negated_conjecture,(~aScalar0(sdtpldt0(xP,xP))|~aScalar0(xS)|~aScalar0(xR)),inference(spm,[status(thm)],[371,90,theory(equality)])).
% cnf(1200,negated_conjecture,(~aScalar0(sdtpldt0(xP,xP))|$false|~aScalar0(xR)),inference(rw,[status(thm)],[1199,191,theory(equality)])).
% cnf(1201,negated_conjecture,(~aScalar0(sdtpldt0(xP,xP))|$false|$false),inference(rw,[status(thm)],[1200,187,theory(equality)])).
% cnf(1202,negated_conjecture,(~aScalar0(sdtpldt0(xP,xP))),inference(cn,[status(thm)],[1201,theory(equality)])).
% cnf(1205,negated_conjecture,(~aScalar0(xP)),inference(spm,[status(thm)],[1202,90,theory(equality)])).
% cnf(1210,negated_conjecture,($false),inference(rw,[status(thm)],[1205,189,theory(equality)])).
% cnf(1211,negated_conjecture,($false),inference(cn,[status(thm)],[1210,theory(equality)])).
% cnf(1212,negated_conjecture,($false),1211,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 96
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 96
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 406
% # ...of the previous two non-trivial : 358
% # Contextual simplify-reflections : 0
% # Paramodulations : 394
% # Factorizations : 2
% # Equation resolutions : 10
% # Current number of processed clauses: 96
% # Positive orientable unit clauses: 39
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 53
% # Current number of unprocessed clauses: 356
% # ...number of literals in the above : 1403
% # 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: 142 leaves, 1.28+/-1.030 terms/leaf
% # Paramod-from index: 69 leaves, 1.07+/-0.310 terms/leaf
% # Paramod-into index: 115 leaves, 1.17+/-0.794 terms/leaf
% # -------------------------------------------------
% # User time : 0.030 s
% # System time : 0.006 s
% # Total time : 0.036 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP1744/RNG070+2.tptp
%
%------------------------------------------------------------------------------