TSTP Solution File: RNG055+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG055+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:07:51 EST 2010
% Result : Theorem 1.01s
% Output : Solution 1.01s
% 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/SystemOnTPTP16673/RNG055+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16673/RNG055+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16673/RNG055+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 16769
% 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(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mMulSc)).
% fof(18, axiom,(aScalar0(xE)&xE=sdtasasdt0(xp,xq)),file('/tmp/SRASS.s.p', m__1820)).
% fof(21, axiom,(aScalar0(xH)&xH=sdtasdt0(xA,xB)),file('/tmp/SRASS.s.p', m__1873)).
% fof(23, axiom,(aScalar0(xP)&xP=sdtasdt0(xE,xH)),file('/tmp/SRASS.s.p', m__1911)).
% fof(36, 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(39, 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(50, 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(65, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|aScalar0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(66, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|aScalar0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[65])).
% cnf(67,plain,(aScalar0(sdtasdt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[66])).
% cnf(106,plain,(aScalar0(xE)),inference(split_conjunct,[status(thm)],[18])).
% cnf(112,plain,(aScalar0(xH)),inference(split_conjunct,[status(thm)],[21])).
% cnf(115,plain,(xP=sdtasdt0(xE,xH)),inference(split_conjunct,[status(thm)],[23])).
% cnf(116,plain,(aScalar0(xP)),inference(split_conjunct,[status(thm)],[23])).
% fof(156, 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)],[36])).
% fof(157, 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)],[156])).
% fof(158, 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)],[157])).
% cnf(159,plain,(sdtasdt0(X3,X2)=sdtasdt0(X2,X3)|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[158])).
% cnf(160,plain,(sdtasdt0(sdtasdt0(X3,X2),X1)=sdtasdt0(X3,sdtasdt0(X2,X1))|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[158])).
% fof(171, 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)],[39])).
% fof(172, 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)],[171])).
% fof(173, 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)],[172])).
% cnf(175,plain,(sdtasdt0(X2,smndt0(X1))=smndt0(sdtasdt0(X2,X1))|~aScalar0(X1)|~aScalar0(X2)),inference(split_conjunct,[status(thm)],[173])).
% fof(207, plain,![X1]:(~(aScalar0(X1))|aScalar0(smndt0(X1))),inference(fof_nnf,[status(thm)],[50])).
% fof(208, plain,![X2]:(~(aScalar0(X2))|aScalar0(smndt0(X2))),inference(variable_rename,[status(thm)],[207])).
% cnf(209,plain,(aScalar0(smndt0(X1))|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[208])).
% cnf(233,negated_conjecture,(sdtasdt0(xP,xP)!=sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE))),inference(split_conjunct,[status(thm)],[64])).
% cnf(364,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)],[233,159,theory(equality)])).
% cnf(445,plain,(smndt0(xP)=sdtasdt0(xE,smndt0(xH))|~aScalar0(xE)|~aScalar0(xH)),inference(spm,[status(thm)],[175,115,theory(equality)])).
% cnf(461,plain,(smndt0(xP)=sdtasdt0(xE,smndt0(xH))|$false|~aScalar0(xH)),inference(rw,[status(thm)],[445,106,theory(equality)])).
% cnf(462,plain,(smndt0(xP)=sdtasdt0(xE,smndt0(xH))|$false|$false),inference(rw,[status(thm)],[461,112,theory(equality)])).
% cnf(463,plain,(smndt0(xP)=sdtasdt0(xE,smndt0(xH))),inference(cn,[status(thm)],[462,theory(equality)])).
% cnf(580,plain,(sdtasdt0(xP,X1)=sdtasdt0(xE,sdtasdt0(xH,X1))|~aScalar0(xE)|~aScalar0(xH)|~aScalar0(X1)),inference(spm,[status(thm)],[160,115,theory(equality)])).
% cnf(600,plain,(sdtasdt0(xP,X1)=sdtasdt0(xE,sdtasdt0(xH,X1))|$false|~aScalar0(xH)|~aScalar0(X1)),inference(rw,[status(thm)],[580,106,theory(equality)])).
% cnf(601,plain,(sdtasdt0(xP,X1)=sdtasdt0(xE,sdtasdt0(xH,X1))|$false|$false|~aScalar0(X1)),inference(rw,[status(thm)],[600,112,theory(equality)])).
% cnf(602,plain,(sdtasdt0(xP,X1)=sdtasdt0(xE,sdtasdt0(xH,X1))|~aScalar0(X1)),inference(cn,[status(thm)],[601,theory(equality)])).
% cnf(1094,plain,(aScalar0(smndt0(xP))|~aScalar0(smndt0(xH))|~aScalar0(xE)),inference(spm,[status(thm)],[67,463,theory(equality)])).
% cnf(1106,plain,(aScalar0(smndt0(xP))|~aScalar0(smndt0(xH))|$false),inference(rw,[status(thm)],[1094,106,theory(equality)])).
% cnf(1107,plain,(aScalar0(smndt0(xP))|~aScalar0(smndt0(xH))),inference(cn,[status(thm)],[1106,theory(equality)])).
% cnf(1885,plain,(aScalar0(smndt0(xP))|~aScalar0(xH)),inference(spm,[status(thm)],[1107,209,theory(equality)])).
% cnf(1886,plain,(aScalar0(smndt0(xP))|$false),inference(rw,[status(thm)],[1885,112,theory(equality)])).
% cnf(1887,plain,(aScalar0(smndt0(xP))),inference(cn,[status(thm)],[1886,theory(equality)])).
% cnf(2338,negated_conjecture,(sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH))!=sdtasdt0(xP,xP)|~aScalar0(sdtasdt0(xE,xE))|~aScalar0(X1)|~aScalar0(xH)),inference(spm,[status(thm)],[364,67,theory(equality)])).
% cnf(2343,negated_conjecture,(sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH))!=sdtasdt0(xP,xP)|~aScalar0(sdtasdt0(xE,xE))|~aScalar0(X1)|$false),inference(rw,[status(thm)],[2338,112,theory(equality)])).
% cnf(2344,negated_conjecture,(sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH))!=sdtasdt0(xP,xP)|~aScalar0(sdtasdt0(xE,xE))|~aScalar0(X1)),inference(cn,[status(thm)],[2343,theory(equality)])).
% cnf(2347,negated_conjecture,(sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH))!=sdtasdt0(xP,xP)|~aScalar0(X1)|~aScalar0(xE)),inference(spm,[status(thm)],[2344,67,theory(equality)])).
% cnf(2352,negated_conjecture,(sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH))!=sdtasdt0(xP,xP)|~aScalar0(X1)|$false),inference(rw,[status(thm)],[2347,106,theory(equality)])).
% cnf(2353,negated_conjecture,(sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH))!=sdtasdt0(xP,xP)|~aScalar0(X1)),inference(cn,[status(thm)],[2352,theory(equality)])).
% cnf(2358,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xE,sdtasdt0(xH,xH)))!=sdtasdt0(xP,xP)|~aScalar0(X1)|~aScalar0(xE)|~aScalar0(sdtasdt0(xH,xH))),inference(spm,[status(thm)],[2353,160,theory(equality)])).
% cnf(2367,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xE,sdtasdt0(xH,xH)))!=sdtasdt0(xP,xP)|~aScalar0(X1)|$false|~aScalar0(sdtasdt0(xH,xH))),inference(rw,[status(thm)],[2358,106,theory(equality)])).
% cnf(2368,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xE,sdtasdt0(xH,xH)))!=sdtasdt0(xP,xP)|~aScalar0(X1)|~aScalar0(sdtasdt0(xH,xH))),inference(cn,[status(thm)],[2367,theory(equality)])).
% cnf(2372,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xE,sdtasdt0(xH,xH)))!=sdtasdt0(xP,xP)|~aScalar0(X1)|~aScalar0(xH)),inference(spm,[status(thm)],[2368,67,theory(equality)])).
% cnf(2377,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xE,sdtasdt0(xH,xH)))!=sdtasdt0(xP,xP)|~aScalar0(X1)|$false),inference(rw,[status(thm)],[2372,112,theory(equality)])).
% cnf(2378,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xE,sdtasdt0(xH,xH)))!=sdtasdt0(xP,xP)|~aScalar0(X1)),inference(cn,[status(thm)],[2377,theory(equality)])).
% cnf(2381,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xP,xH))!=sdtasdt0(xP,xP)|~aScalar0(X1)|~aScalar0(xH)),inference(spm,[status(thm)],[2378,602,theory(equality)])).
% cnf(2386,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xP,xH))!=sdtasdt0(xP,xP)|~aScalar0(X1)|$false),inference(rw,[status(thm)],[2381,112,theory(equality)])).
% cnf(2387,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xP,xH))!=sdtasdt0(xP,xP)|~aScalar0(X1)),inference(cn,[status(thm)],[2386,theory(equality)])).
% cnf(2388,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xH,xP))!=sdtasdt0(xP,xP)|~aScalar0(X1)|~aScalar0(xH)|~aScalar0(xP)|~aScalar0(X2)),inference(spm,[status(thm)],[2387,159,theory(equality)])).
% cnf(2390,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xH,xP))!=sdtasdt0(xP,xP)|~aScalar0(X1)|$false|~aScalar0(xP)|~aScalar0(X2)),inference(rw,[status(thm)],[2388,112,theory(equality)])).
% cnf(2391,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xH,xP))!=sdtasdt0(xP,xP)|~aScalar0(X1)|$false|$false|~aScalar0(X2)),inference(rw,[status(thm)],[2390,116,theory(equality)])).
% cnf(2392,negated_conjecture,(sdtasdt0(xE,sdtasdt0(xH,xP))!=sdtasdt0(xP,xP)|~aScalar0(X1)|~aScalar0(X2)),inference(cn,[status(thm)],[2391,theory(equality)])).
% fof(2396, plain,(~(epred1_0)<=>![X1]:(~(sdtasdt0(xE,sdtasdt0(xH,xP))=sdtasdt0(xP,xP))|~(aScalar0(X1)))),introduced(definition),['split']).
% cnf(2397,plain,(epred1_0|~aScalar0(X1)|sdtasdt0(xE,sdtasdt0(xH,xP))!=sdtasdt0(xP,xP)),inference(split_equiv,[status(thm)],[2396])).
% fof(2398, plain,(~(epred2_0)<=>![X2]:~(aScalar0(X2))),introduced(definition),['split']).
% cnf(2399,plain,(epred2_0|~aScalar0(X2)),inference(split_equiv,[status(thm)],[2398])).
% cnf(2400,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[2392,2396,theory(equality)]),2398,theory(equality)]),['split']).
% cnf(2401,negated_conjecture,(epred2_0),inference(spm,[status(thm)],[2399,1887,theory(equality)])).
% cnf(2419,negated_conjecture,($false|~epred1_0),inference(rw,[status(thm)],[2400,2401,theory(equality)])).
% cnf(2420,negated_conjecture,(~epred1_0),inference(cn,[status(thm)],[2419,theory(equality)])).
% cnf(2422,negated_conjecture,(~aScalar0(X1)|sdtasdt0(xE,sdtasdt0(xH,xP))!=sdtasdt0(xP,xP)),inference(sr,[status(thm)],[2397,2420,theory(equality)])).
% cnf(2423,negated_conjecture,(~aScalar0(X1)|~aScalar0(xP)),inference(spm,[status(thm)],[2422,602,theory(equality)])).
% cnf(2424,negated_conjecture,(~aScalar0(X1)|$false),inference(rw,[status(thm)],[2423,116,theory(equality)])).
% cnf(2425,negated_conjecture,(~aScalar0(X1)),inference(cn,[status(thm)],[2424,theory(equality)])).
% cnf(2430,plain,($false),inference(sr,[status(thm)],[106,2425,theory(equality)])).
% cnf(2431,plain,($false),2430,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 164
% # ...of these trivial : 6
% # ...subsumed : 19
% # ...remaining for further processing: 139
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 8
% # Generated clauses : 781
% # ...of the previous two non-trivial : 696
% # Contextual simplify-reflections : 4
% # Paramodulations : 750
% # Factorizations : 2
% # Equation resolutions : 12
% # Current number of processed clauses: 110
% # Positive orientable unit clauses: 44
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 61
% # Current number of unprocessed clauses: 494
% # ...number of literals in the above : 1857
% # Clause-clause subsumption calls (NU) : 364
% # Rec. Clause-clause subsumption calls : 172
% # Unit Clause-clause subsumption calls : 122
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 154 leaves, 1.26+/-0.992 terms/leaf
% # Paramod-from index: 72 leaves, 1.07+/-0.304 terms/leaf
% # Paramod-into index: 126 leaves, 1.16+/-0.760 terms/leaf
% # -------------------------------------------------
% # User time : 0.046 s
% # System time : 0.002 s
% # Total time : 0.048 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.25 WC
% FINAL PrfWatch: 0.15 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP16673/RNG055+1.tptp
%
%------------------------------------------------------------------------------