TSTP Solution File: RNG077+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG077+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:29:06 EST 2010
% Result : Theorem 1.22s
% Output : Solution 1.22s
% 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/SystemOnTPTP30261/RNG077+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30261/RNG077+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30261/RNG077+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 30393
% 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(2, axiom,![X1]:![X2]:((aScalar0(X1)&aScalar0(X2))=>aScalar0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mMulSc)).
% fof(3, axiom,![X1]:![X2]:![X3]:(((aScalar0(X1)&aScalar0(X2))&aScalar0(X3))=>(((sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))&sdtpldt0(X1,X2)=sdtpldt0(X2,X1))&sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3)))&sdtasdt0(X1,X2)=sdtasdt0(X2,X1))),file('/tmp/SRASS.s.p', mArith)).
% fof(24, axiom,(aScalar0(xE)&xE=sdtasasdt0(xp,xq)),file('/tmp/SRASS.s.p', m__1820)).
% fof(27, axiom,(aScalar0(xH)&xH=sdtasdt0(xA,xB)),file('/tmp/SRASS.s.p', m__1873)).
% fof(29, axiom,(aScalar0(xP)&xP=sdtasdt0(xE,xH)),file('/tmp/SRASS.s.p', m__1911)).
% fof(59, conjecture,sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH))=sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),file('/tmp/SRASS.s.p', m__)).
% fof(60, negated_conjecture,~(sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH))=sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH)))),inference(assume_negation,[status(cth)],[59])).
% fof(66, negated_conjecture,~(sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH))=sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH)))),inference(fof_simplification,[status(thm)],[60,theory(equality)])).
% fof(70, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|aScalar0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(71, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|aScalar0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[70])).
% cnf(72,plain,(aScalar0(sdtasdt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[71])).
% fof(73, plain,![X1]:![X2]:![X3]:(((~(aScalar0(X1))|~(aScalar0(X2)))|~(aScalar0(X3)))|(((sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))&sdtpldt0(X1,X2)=sdtpldt0(X2,X1))&sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3)))&sdtasdt0(X1,X2)=sdtasdt0(X2,X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(74, plain,![X4]:![X5]:![X6]:(((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6)))|(((sdtpldt0(sdtpldt0(X4,X5),X6)=sdtpldt0(X4,sdtpldt0(X5,X6))&sdtpldt0(X4,X5)=sdtpldt0(X5,X4))&sdtasdt0(sdtasdt0(X4,X5),X6)=sdtasdt0(X4,sdtasdt0(X5,X6)))&sdtasdt0(X4,X5)=sdtasdt0(X5,X4))),inference(variable_rename,[status(thm)],[73])).
% fof(75, plain,![X4]:![X5]:![X6]:((((sdtpldt0(sdtpldt0(X4,X5),X6)=sdtpldt0(X4,sdtpldt0(X5,X6))|((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6))))&(sdtpldt0(X4,X5)=sdtpldt0(X5,X4)|((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6)))))&(sdtasdt0(sdtasdt0(X4,X5),X6)=sdtasdt0(X4,sdtasdt0(X5,X6))|((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6)))))&(sdtasdt0(X4,X5)=sdtasdt0(X5,X4)|((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6))))),inference(distribute,[status(thm)],[74])).
% cnf(76,plain,(sdtasdt0(X3,X2)=sdtasdt0(X2,X3)|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[75])).
% cnf(79,plain,(sdtpldt0(sdtpldt0(X3,X2),X1)=sdtpldt0(X3,sdtpldt0(X2,X1))|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[75])).
% cnf(132,plain,(aScalar0(xE)),inference(split_conjunct,[status(thm)],[24])).
% cnf(138,plain,(aScalar0(xH)),inference(split_conjunct,[status(thm)],[27])).
% cnf(141,plain,(xP=sdtasdt0(xE,xH)),inference(split_conjunct,[status(thm)],[29])).
% cnf(142,plain,(aScalar0(xP)),inference(split_conjunct,[status(thm)],[29])).
% cnf(237,negated_conjecture,(sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH))!=sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH)))),inference(split_conjunct,[status(thm)],[66])).
% cnf(238,negated_conjecture,(sdtpldt0(xP,sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH)))!=sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH))),inference(rw,[status(thm)],[237,141,theory(equality)])).
% cnf(408,plain,(sdtasdt0(xH,xE)=xP|~aScalar0(xE)|~aScalar0(xH)|~aScalar0(X1)),inference(spm,[status(thm)],[141,76,theory(equality)])).
% cnf(442,plain,(sdtasdt0(xH,xE)=xP|$false|~aScalar0(xH)|~aScalar0(X1)),inference(rw,[status(thm)],[408,132,theory(equality)])).
% cnf(443,plain,(sdtasdt0(xH,xE)=xP|$false|$false|~aScalar0(X1)),inference(rw,[status(thm)],[442,138,theory(equality)])).
% cnf(444,plain,(sdtasdt0(xH,xE)=xP|~aScalar0(X1)),inference(cn,[status(thm)],[443,theory(equality)])).
% cnf(1258,negated_conjecture,(sdtpldt0(xP,sdtpldt0(xP,sdtasdt0(xH,xH)))!=sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH))|~aScalar0(X1)),inference(spm,[status(thm)],[238,444,theory(equality)])).
% cnf(1306,negated_conjecture,(~aScalar0(X1)|~aScalar0(xP)|~aScalar0(sdtasdt0(xH,xH))),inference(spm,[status(thm)],[1258,79,theory(equality)])).
% cnf(1315,negated_conjecture,(~aScalar0(X1)|$false|~aScalar0(sdtasdt0(xH,xH))),inference(rw,[status(thm)],[1306,142,theory(equality)])).
% cnf(1316,negated_conjecture,(~aScalar0(X1)|~aScalar0(sdtasdt0(xH,xH))),inference(cn,[status(thm)],[1315,theory(equality)])).
% cnf(1319,negated_conjecture,(~aScalar0(X1)|~aScalar0(xH)),inference(spm,[status(thm)],[1316,72,theory(equality)])).
% cnf(1324,negated_conjecture,(~aScalar0(X1)|$false),inference(rw,[status(thm)],[1319,138,theory(equality)])).
% cnf(1325,negated_conjecture,(~aScalar0(X1)),inference(cn,[status(thm)],[1324,theory(equality)])).
% cnf(1330,plain,($false),inference(sr,[status(thm)],[132,1325,theory(equality)])).
% cnf(1331,plain,($false),1330,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 108
% # ...of these trivial : 0
% # ...subsumed : 11
% # ...remaining for further processing: 97
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 462
% # ...of the previous two non-trivial : 405
% # Contextual simplify-reflections : 0
% # Paramodulations : 437
% # Factorizations : 2
% # Equation resolutions : 10
% # Current number of processed clauses: 84
% # Positive orientable unit clauses: 25
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 54
% # Current number of unprocessed clauses: 385
% # ...number of literals in the above : 1513
% # Clause-clause subsumption calls (NU) : 249
% # Rec. Clause-clause subsumption calls : 94
% # Unit Clause-clause subsumption calls : 39
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 128 leaves, 1.31+/-1.081 terms/leaf
% # Paramod-from index: 54 leaves, 1.09+/-0.348 terms/leaf
% # Paramod-into index: 98 leaves, 1.20+/-0.857 terms/leaf
% # -------------------------------------------------
% # User time : 0.029 s
% # System time : 0.005 s
% # Total time : 0.034 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/SystemOnTPTP30261/RNG077+1.tptp
%
%------------------------------------------------------------------------------