TSTP Solution File: RNG077+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG077+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 : art02.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:24: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/SystemOnTPTP29965/RNG077+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29965/RNG077+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29965/RNG077+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 30061
% 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(7, axiom,![X1]:![X2]:((aScalar0(X1)&aScalar0(X2))=>aScalar0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mMulSc)).
% fof(8, 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(32, axiom,(aScalar0(xE)&xE=sdtasasdt0(xp,xq)),file('/tmp/SRASS.s.p', m__1820)).
% fof(35, axiom,(aScalar0(xH)&xH=sdtasdt0(xA,xB)),file('/tmp/SRASS.s.p', m__1873)).
% fof(37, 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(88, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|aScalar0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(89, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|aScalar0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[88])).
% cnf(90,plain,(aScalar0(sdtasdt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[89])).
% fof(91, 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)],[8])).
% fof(92, 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)],[91])).
% fof(93, 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)],[92])).
% cnf(94,plain,(sdtasdt0(X3,X2)=sdtasdt0(X2,X3)|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[93])).
% cnf(97,plain,(sdtpldt0(sdtpldt0(X3,X2),X1)=sdtpldt0(X3,sdtpldt0(X2,X1))|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[93])).
% cnf(176,plain,(aScalar0(xE)),inference(split_conjunct,[status(thm)],[32])).
% cnf(182,plain,(aScalar0(xH)),inference(split_conjunct,[status(thm)],[35])).
% cnf(185,plain,(xP=sdtasdt0(xE,xH)),inference(split_conjunct,[status(thm)],[37])).
% cnf(186,plain,(aScalar0(xP)),inference(split_conjunct,[status(thm)],[37])).
% cnf(247,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(248,negated_conjecture,(sdtpldt0(xP,sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH)))!=sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH))),inference(rw,[status(thm)],[247,185,theory(equality)])).
% cnf(446,plain,(sdtasdt0(xH,xE)=xP|~aScalar0(xE)|~aScalar0(xH)|~aScalar0(X1)),inference(spm,[status(thm)],[185,94,theory(equality)])).
% cnf(480,plain,(sdtasdt0(xH,xE)=xP|$false|~aScalar0(xH)|~aScalar0(X1)),inference(rw,[status(thm)],[446,176,theory(equality)])).
% cnf(481,plain,(sdtasdt0(xH,xE)=xP|$false|$false|~aScalar0(X1)),inference(rw,[status(thm)],[480,182,theory(equality)])).
% cnf(482,plain,(sdtasdt0(xH,xE)=xP|~aScalar0(X1)),inference(cn,[status(thm)],[481,theory(equality)])).
% cnf(1297,negated_conjecture,(sdtpldt0(xP,sdtpldt0(xP,sdtasdt0(xH,xH)))!=sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH))|~aScalar0(X1)),inference(spm,[status(thm)],[248,482,theory(equality)])).
% cnf(1345,negated_conjecture,(~aScalar0(X1)|~aScalar0(xP)|~aScalar0(sdtasdt0(xH,xH))),inference(spm,[status(thm)],[1297,97,theory(equality)])).
% cnf(1354,negated_conjecture,(~aScalar0(X1)|$false|~aScalar0(sdtasdt0(xH,xH))),inference(rw,[status(thm)],[1345,186,theory(equality)])).
% cnf(1355,negated_conjecture,(~aScalar0(X1)|~aScalar0(sdtasdt0(xH,xH))),inference(cn,[status(thm)],[1354,theory(equality)])).
% cnf(1358,negated_conjecture,(~aScalar0(X1)|~aScalar0(xH)),inference(spm,[status(thm)],[1355,90,theory(equality)])).
% cnf(1363,negated_conjecture,(~aScalar0(X1)|$false),inference(rw,[status(thm)],[1358,182,theory(equality)])).
% cnf(1364,negated_conjecture,(~aScalar0(X1)),inference(cn,[status(thm)],[1363,theory(equality)])).
% cnf(1369,plain,($false),inference(sr,[status(thm)],[176,1364,theory(equality)])).
% cnf(1370,plain,($false),1369,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 113
% # ...of these trivial : 0
% # ...subsumed : 12
% # ...remaining for further processing: 101
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 478
% # ...of the previous two non-trivial : 421
% # Contextual simplify-reflections : 0
% # Paramodulations : 453
% # Factorizations : 2
% # Equation resolutions : 10
% # Current number of processed clauses: 88
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 56
% # Current number of unprocessed clauses: 400
% # ...number of literals in the above : 1563
% # Clause-clause subsumption calls (NU) : 248
% # Rec. Clause-clause subsumption calls : 93
% # 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: 136 leaves, 1.29+/-1.051 terms/leaf
% # Paramod-from index: 58 leaves, 1.09+/-0.337 terms/leaf
% # Paramod-into index: 104 leaves, 1.19+/-0.833 terms/leaf
% # -------------------------------------------------
% # User time : 0.033 s
% # System time : 0.004 s
% # Total time : 0.037 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/SystemOnTPTP29965/RNG077+2.tptp
%
%------------------------------------------------------------------------------