TSTP Solution File: RNG055+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG055+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:08:12 EST 2010
% Result : Theorem 1.03s
% Output : Solution 1.03s
% 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/SystemOnTPTP16932/RNG055+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16932/RNG055+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16932/RNG055+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 17029
% 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(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mMulSc)).
% fof(26, axiom,(aScalar0(xE)&xE=sdtasasdt0(xp,xq)),file('/tmp/SRASS.s.p', m__1820)).
% fof(29, axiom,(aScalar0(xH)&xH=sdtasdt0(xA,xB)),file('/tmp/SRASS.s.p', m__1873)).
% fof(31, axiom,(aScalar0(xP)&xP=sdtasdt0(xE,xH)),file('/tmp/SRASS.s.p', m__1911)).
% fof(41, 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(45, axiom,![X1]:![X2]:((aScalar0(X1)&aScalar0(X2))=>(sdtasdt0(X1,smndt0(X2))=smndt0(sdtasdt0(X1,X2))&sdtasdt0(smndt0(X1),X2)=smndt0(sdtasdt0(X1,X2)))),file('/tmp/SRASS.s.p', mMNeg)).
% fof(51, axiom,![X1]:(aScalar0(X1)=>aScalar0(smndt0(X1))),file('/tmp/SRASS.s.p', mNegSc)).
% fof(57, conjecture,sdtasdt0(xP,xP)=sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)),file('/tmp/SRASS.s.p', m__)).
% fof(58, negated_conjecture,~(sdtasdt0(xP,xP)=sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE))),inference(assume_negation,[status(cth)],[57])).
% fof(64, negated_conjecture,~(sdtasdt0(xP,xP)=sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE))),inference(fof_simplification,[status(thm)],[58,theory(equality)])).
% fof(83, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|aScalar0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(84, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|aScalar0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[83])).
% cnf(85,plain,(aScalar0(sdtasdt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[84])).
% cnf(150,plain,(aScalar0(xE)),inference(split_conjunct,[status(thm)],[26])).
% cnf(156,plain,(aScalar0(xH)),inference(split_conjunct,[status(thm)],[29])).
% cnf(159,plain,(xP=sdtasdt0(xE,xH)),inference(split_conjunct,[status(thm)],[31])).
% cnf(160,plain,(aScalar0(xP)),inference(split_conjunct,[status(thm)],[31])).
% fof(184, 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)],[41])).
% fof(185, 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)],[184])).
% fof(186, 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)],[185])).
% cnf(187,plain,(sdtasdt0(X3,X2)=sdtasdt0(X2,X3)|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[186])).
% cnf(188,plain,(sdtasdt0(sdtasdt0(X3,X2),X1)=sdtasdt0(X3,sdtasdt0(X2,X1))|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[186])).
% fof(201, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|(sdtasdt0(X1,smndt0(X2))=smndt0(sdtasdt0(X1,X2))&sdtasdt0(smndt0(X1),X2)=smndt0(sdtasdt0(X1,X2)))),inference(fof_nnf,[status(thm)],[45])).
% fof(202, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|(sdtasdt0(X3,smndt0(X4))=smndt0(sdtasdt0(X3,X4))&sdtasdt0(smndt0(X3),X4)=smndt0(sdtasdt0(X3,X4)))),inference(variable_rename,[status(thm)],[201])).
% fof(203, plain,![X3]:![X4]:((sdtasdt0(X3,smndt0(X4))=smndt0(sdtasdt0(X3,X4))|(~(aScalar0(X3))|~(aScalar0(X4))))&(sdtasdt0(smndt0(X3),X4)=smndt0(sdtasdt0(X3,X4))|(~(aScalar0(X3))|~(aScalar0(X4))))),inference(distribute,[status(thm)],[202])).
% cnf(205,plain,(sdtasdt0(X2,smndt0(X1))=smndt0(sdtasdt0(X2,X1))|~aScalar0(X1)|~aScalar0(X2)),inference(split_conjunct,[status(thm)],[203])).
% fof(220, plain,![X1]:(~(aScalar0(X1))|aScalar0(smndt0(X1))),inference(fof_nnf,[status(thm)],[51])).
% fof(221, plain,![X2]:(~(aScalar0(X2))|aScalar0(smndt0(X2))),inference(variable_rename,[status(thm)],[220])).
% cnf(222,plain,(aScalar0(smndt0(X1))|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[221])).
% cnf(243,negated_conjecture,(sdtasdt0(xP,xP)!=sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE))),inference(split_conjunct,[status(thm)],[64])).
% cnf(391,negated_conjecture,(sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH))!=sdtasdt0(xP,xP)|~aScalar0(sdtasdt0(xH,xH))|~aScalar0(sdtasdt0(xE,xE))|~aScalar0(X1)),inference(spm,[status(thm)],[243,187,theory(equality)])).
% cnf(483,plain,(smndt0(xP)=sdtasdt0(xE,smndt0(xH))|~aScalar0(xE)|~aScalar0(xH)),inference(spm,[status(thm)],[205,159,theory(equality)])).
% cnf(499,plain,(smndt0(xP)=sdtasdt0(xE,smndt0(xH))|$false|~aScalar0(xH)),inference(rw,[status(thm)],[483,150,theory(equality)])).
% cnf(500,plain,(smndt0(xP)=sdtasdt0(xE,smndt0(xH))|$false|$false),inference(rw,[status(thm)],[499,156,theory(equality)])).
% cnf(501,plain,(smndt0(xP)=sdtasdt0(xE,smndt0(xH))),inference(cn,[status(thm)],[500,theory(equality)])).
% cnf(607,plain,(sdtasdt0(xP,X1)=sdtasdt0(xE,sdtasdt0(xH,X1))|~aScalar0(xE)|~aScalar0(xH)|~aScalar0(X1)),inference(spm,[status(thm)],[188,159,theory(equality)])).
% cnf(627,plain,(sdtasdt0(xP,X1)=sdtasdt0(xE,sdtasdt0(xH,X1))|$false|~aScalar0(xH)|~aScalar0(X1)),inference(rw,[status(thm)],[607,150,theory(equality)])).
% cnf(628,plain,(sdtasdt0(xP,X1)=sdtasdt0(xE,sdtasdt0(xH,X1))|$false|$false|~aScalar0(X1)),inference(rw,[status(thm)],[627,156,theory(equality)])).
% cnf(629,plain,(sdtasdt0(xP,X1)=sdtasdt0(xE,sdtasdt0(xH,X1))|~aScalar0(X1)),inference(cn,[status(thm)],[628,theory(equality)])).
% cnf(1133,plain,(aScalar0(smndt0(xP))|~aScalar0(smndt0(xH))|~aScalar0(xE)),inference(spm,[status(thm)],[85,501,theory(equality)])).
% cnf(1145,plain,(aScalar0(smndt0(xP))|~aScalar0(smndt0(xH))|$false),inference(rw,[status(thm)],[1133,150,theory(equality)])).
% cnf(1146,plain,(aScalar0(smndt0(xP))|~aScalar0(smndt0(xH))),inference(cn,[status(thm)],[1145,theory(equality)])).
% cnf(1929,plain,(aScalar0(smndt0(xP))|~aScalar0(xH)),inference(spm,[status(thm)],[1146,222,theory(equality)])).
% cnf(1930,plain,(aScalar0(smndt0(xP))|$false),inference(rw,[status(thm)],[1929,156,theory(equality)])).
% cnf(1931,plain,(aScalar0(smndt0(xP))),inference(cn,[status(thm)],[1930,theory(equality)])).
% cnf(2382,negated_conjecture,(sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH))!=sdtasdt0(xP,xP)|~aScalar0(sdtasdt0(xE,xE))|~aScalar0(X1)|~aScalar0(xH)),inference(spm,[status(thm)],[391,85,theory(equality)])).
% cnf(2387,negated_conjecture,(sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH))!=sdtasdt0(xP,xP)|~aScalar0(sdtasdt0(xE,xE))|~aScalar0(X1)|$false),inference(rw,[status(thm)],[2382,156,theory(equality)])).
% cnf(2388,negated_conjecture,(sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH))!=sdtasdt0(xP,xP)|~aScalar0(sdtasdt0(xE,xE))|~aScalar0(X1)),inference(cn,[status(thm)],[2387,theory(equality)])).
% cnf(2391,negated_conjecture,(sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH))!=sdtasdt0(xP,xP)|~aScalar0(X1)|~aScalar0(xE)),inference(spm,[status(thm)],[2388,85,theory(equality)])).
% cnf(2396,negated_conjecture,(sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH))!=sdtasdt0(xP,xP)|~aScalar0(X1)|$false),inference(rw,[status(thm)],[2391,150,theory(equality)])).
% cnf(2397,negated_conjecture,(sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH))!=sdtasdt0(xP,xP)|~aScalar0(X1)),inference(cn,[status(thm)],[2396,theory(equality)])).
% cnf(2402,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xE,sdtasdt0(xH,xH)))!=sdtasdt0(xP,xP)|~aScalar0(X1)|~aScalar0(xE)|~aScalar0(sdtasdt0(xH,xH))),inference(spm,[status(thm)],[2397,188,theory(equality)])).
% cnf(2411,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xE,sdtasdt0(xH,xH)))!=sdtasdt0(xP,xP)|~aScalar0(X1)|$false|~aScalar0(sdtasdt0(xH,xH))),inference(rw,[status(thm)],[2402,150,theory(equality)])).
% cnf(2412,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xE,sdtasdt0(xH,xH)))!=sdtasdt0(xP,xP)|~aScalar0(X1)|~aScalar0(sdtasdt0(xH,xH))),inference(cn,[status(thm)],[2411,theory(equality)])).
% cnf(2415,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xE,sdtasdt0(xH,xH)))!=sdtasdt0(xP,xP)|~aScalar0(X1)|~aScalar0(xH)),inference(spm,[status(thm)],[2412,85,theory(equality)])).
% cnf(2420,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xE,sdtasdt0(xH,xH)))!=sdtasdt0(xP,xP)|~aScalar0(X1)|$false),inference(rw,[status(thm)],[2415,156,theory(equality)])).
% cnf(2421,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xE,sdtasdt0(xH,xH)))!=sdtasdt0(xP,xP)|~aScalar0(X1)),inference(cn,[status(thm)],[2420,theory(equality)])).
% cnf(2424,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xP,xH))!=sdtasdt0(xP,xP)|~aScalar0(X1)|~aScalar0(xH)),inference(spm,[status(thm)],[2421,629,theory(equality)])).
% cnf(2429,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xP,xH))!=sdtasdt0(xP,xP)|~aScalar0(X1)|$false),inference(rw,[status(thm)],[2424,156,theory(equality)])).
% cnf(2430,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xP,xH))!=sdtasdt0(xP,xP)|~aScalar0(X1)),inference(cn,[status(thm)],[2429,theory(equality)])).
% cnf(2431,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xH,xP))!=sdtasdt0(xP,xP)|~aScalar0(X1)|~aScalar0(xH)|~aScalar0(xP)|~aScalar0(X2)),inference(spm,[status(thm)],[2430,187,theory(equality)])).
% cnf(2433,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xH,xP))!=sdtasdt0(xP,xP)|~aScalar0(X1)|$false|~aScalar0(xP)|~aScalar0(X2)),inference(rw,[status(thm)],[2431,156,theory(equality)])).
% cnf(2434,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xH,xP))!=sdtasdt0(xP,xP)|~aScalar0(X1)|$false|$false|~aScalar0(X2)),inference(rw,[status(thm)],[2433,160,theory(equality)])).
% cnf(2435,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xH,xP))!=sdtasdt0(xP,xP)|~aScalar0(X1)|~aScalar0(X2)),inference(cn,[status(thm)],[2434,theory(equality)])).
% fof(2439, plain,(~(epred1_0)<=>![X1]:(~(sdtasdt0(xE,sdtasdt0(xH,xP))=sdtasdt0(xP,xP))|~(aScalar0(X1)))),introduced(definition),['split']).
% cnf(2440,plain,(epred1_0|~aScalar0(X1)|sdtasdt0(xE,sdtasdt0(xH,xP))!=sdtasdt0(xP,xP)),inference(split_equiv,[status(thm)],[2439])).
% fof(2441, plain,(~(epred2_0)<=>![X2]:~(aScalar0(X2))),introduced(definition),['split']).
% cnf(2442,plain,(epred2_0|~aScalar0(X2)),inference(split_equiv,[status(thm)],[2441])).
% cnf(2443,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[2435,2439,theory(equality)]),2441,theory(equality)]),['split']).
% cnf(2445,negated_conjecture,(epred2_0),inference(spm,[status(thm)],[2442,1931,theory(equality)])).
% cnf(2463,negated_conjecture,($false|~epred1_0),inference(rw,[status(thm)],[2443,2445,theory(equality)])).
% cnf(2464,negated_conjecture,(~epred1_0),inference(cn,[status(thm)],[2463,theory(equality)])).
% cnf(2466,negated_conjecture,(~aScalar0(X1)|sdtasdt0(xE,sdtasdt0(xH,xP))!=sdtasdt0(xP,xP)),inference(sr,[status(thm)],[2440,2464,theory(equality)])).
% cnf(2467,negated_conjecture,(~aScalar0(X1)|~aScalar0(xP)),inference(spm,[status(thm)],[2466,629,theory(equality)])).
% cnf(2468,negated_conjecture,(~aScalar0(X1)|$false),inference(rw,[status(thm)],[2467,160,theory(equality)])).
% cnf(2469,negated_conjecture,(~aScalar0(X1)),inference(cn,[status(thm)],[2468,theory(equality)])).
% cnf(2474,plain,($false),inference(sr,[status(thm)],[150,2469,theory(equality)])).
% cnf(2475,plain,($false),2474,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 170
% # ...of these trivial : 8
% # ...subsumed : 18
% # ...remaining for further processing: 144
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 9
% # Generated clauses : 798
% # ...of the previous two non-trivial : 713
% # Contextual simplify-reflections : 3
% # Paramodulations : 767
% # Factorizations : 2
% # Equation resolutions : 12
% # Current number of processed clauses: 114
% # Positive orientable unit clauses: 46
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 63
% # Current number of unprocessed clauses: 508
% # ...number of literals in the above : 1906
% # Clause-clause subsumption calls (NU) : 349
% # Rec. Clause-clause subsumption calls : 157
% # Unit Clause-clause subsumption calls : 124
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 162 leaves, 1.25+/-0.969 terms/leaf
% # Paramod-from index: 76 leaves, 1.07+/-0.296 terms/leaf
% # Paramod-into index: 132 leaves, 1.15+/-0.744 terms/leaf
% # -------------------------------------------------
% # User time : 0.043 s
% # System time : 0.006 s
% # Total time : 0.049 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.25 WC
% FINAL PrfWatch: 0.17 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP16932/RNG055+2.tptp
%
%------------------------------------------------------------------------------