%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM435+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 : art05.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 18:59:38 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/SystemOnTPTP32307/NUM435+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32307/NUM435+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32307/NUM435+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 32403
% 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(4, axiom,![X1]:![X2]:((aInteger0(X1)&aInteger0(X2))=>aInteger0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mIntMult)).
% fof(9, axiom,![X1]:![X2]:![X3]:(((aInteger0(X1)&aInteger0(X2))&aInteger0(X3))=>sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(sdtasdt0(X1,X2),X3)),file('/tmp/SRASS.s.p', mMulAsso)).
% fof(10, axiom,![X1]:![X2]:((aInteger0(X1)&aInteger0(X2))=>sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),file('/tmp/SRASS.s.p', mMulComm)).
% fof(17, axiom,(((((aInteger0(xa)&aInteger0(xb))&aInteger0(xp))&~(xp=sz00))&aInteger0(xq))&~(xq=sz00)),file('/tmp/SRASS.s.p', m__979)).
% fof(19, axiom,(aInteger0(xm)&sdtasdt0(sdtasdt0(xp,xq),xm)=sdtpldt0(xa,smndt0(xb))),file('/tmp/SRASS.s.p', m__1032)).
% fof(26, conjecture,sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,sdtasdt0(xp,xm)),file('/tmp/SRASS.s.p', m__)).
% fof(27, negated_conjecture,~(sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,sdtasdt0(xp,xm))),inference(assume_negation,[status(cth)],[26])).
% fof(29, negated_conjecture,~(sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,sdtasdt0(xp,xm))),inference(fof_simplification,[status(thm)],[27,theory(equality)])).
% fof(37, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|aInteger0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(38, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|aInteger0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(aInteger0(sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[38])).
% fof(56, plain,![X1]:![X2]:![X3]:(((~(aInteger0(X1))|~(aInteger0(X2)))|~(aInteger0(X3)))|sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(sdtasdt0(X1,X2),X3)),inference(fof_nnf,[status(thm)],[9])).
% fof(57, plain,![X4]:![X5]:![X6]:(((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|sdtasdt0(X4,sdtasdt0(X5,X6))=sdtasdt0(sdtasdt0(X4,X5),X6)),inference(variable_rename,[status(thm)],[56])).
% cnf(58,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(sdtasdt0(X1,X2),X3)|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(59, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[10])).
% fof(60, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[60])).
% cnf(85,plain,(aInteger0(xq)),inference(split_conjunct,[status(thm)],[17])).
% cnf(87,plain,(aInteger0(xp)),inference(split_conjunct,[status(thm)],[17])).
% cnf(91,plain,(sdtasdt0(sdtasdt0(xp,xq),xm)=sdtpldt0(xa,smndt0(xb))),inference(split_conjunct,[status(thm)],[19])).
% cnf(92,plain,(aInteger0(xm)),inference(split_conjunct,[status(thm)],[19])).
% cnf(121,negated_conjecture,(sdtpldt0(xa,smndt0(xb))!=sdtasdt0(xq,sdtasdt0(xp,xm))),inference(split_conjunct,[status(thm)],[29])).
% cnf(122,negated_conjecture,(sdtasdt0(xq,sdtasdt0(xp,xm))!=sdtasdt0(sdtasdt0(xp,xq),xm)),inference(rw,[status(thm)],[121,91,theory(equality)])).
% cnf(151,negated_conjecture,(sdtasdt0(xm,sdtasdt0(xp,xq))!=sdtasdt0(xq,sdtasdt0(xp,xm))|~aInteger0(sdtasdt0(xp,xq))|~aInteger0(xm)),inference(spm,[status(thm)],[122,61,theory(equality)])).
% cnf(166,negated_conjecture,(sdtasdt0(xm,sdtasdt0(xp,xq))!=sdtasdt0(xq,sdtasdt0(xp,xm))|~aInteger0(sdtasdt0(xp,xq))|$false),inference(rw,[status(thm)],[151,92,theory(equality)])).
% cnf(167,negated_conjecture,(sdtasdt0(xm,sdtasdt0(xp,xq))!=sdtasdt0(xq,sdtasdt0(xp,xm))|~aInteger0(sdtasdt0(xp,xq))),inference(cn,[status(thm)],[166,theory(equality)])).
% cnf(251,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(X2,sdtasdt0(X3,X1))|~aInteger0(sdtasdt0(X2,X3))|~aInteger0(X1)|~aInteger0(X3)|~aInteger0(X2)),inference(spm,[status(thm)],[61,58,theory(equality)])).
% cnf(406,negated_conjecture,(sdtasdt0(xm,sdtasdt0(xp,xq))!=sdtasdt0(xq,sdtasdt0(xp,xm))|~aInteger0(xq)|~aInteger0(xp)),inference(spm,[status(thm)],[167,39,theory(equality)])).
% cnf(407,negated_conjecture,(sdtasdt0(xm,sdtasdt0(xp,xq))!=sdtasdt0(xq,sdtasdt0(xp,xm))|$false|~aInteger0(xp)),inference(rw,[status(thm)],[406,85,theory(equality)])).
% cnf(408,negated_conjecture,(sdtasdt0(xm,sdtasdt0(xp,xq))!=sdtasdt0(xq,sdtasdt0(xp,xm))|$false|$false),inference(rw,[status(thm)],[407,87,theory(equality)])).
% cnf(409,negated_conjecture,(sdtasdt0(xm,sdtasdt0(xp,xq))!=sdtasdt0(xq,sdtasdt0(xp,xm))),inference(cn,[status(thm)],[408,theory(equality)])).
% cnf(3980,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(X2,sdtasdt0(X3,X1))|~aInteger0(X1)|~aInteger0(X3)|~aInteger0(X2)),inference(csr,[status(thm)],[251,39])).
% cnf(3988,negated_conjecture,(sdtasdt0(xq,sdtasdt0(xm,xp))!=sdtasdt0(xq,sdtasdt0(xp,xm))|~aInteger0(xq)|~aInteger0(xp)|~aInteger0(xm)),inference(spm,[status(thm)],[409,3980,theory(equality)])).
% cnf(4121,negated_conjecture,(sdtasdt0(xq,sdtasdt0(xm,xp))!=sdtasdt0(xq,sdtasdt0(xp,xm))|$false|~aInteger0(xp)|~aInteger0(xm)),inference(rw,[status(thm)],[3988,85,theory(equality)])).
% cnf(4122,negated_conjecture,(sdtasdt0(xq,sdtasdt0(xm,xp))!=sdtasdt0(xq,sdtasdt0(xp,xm))|$false|$false|~aInteger0(xm)),inference(rw,[status(thm)],[4121,87,theory(equality)])).
% cnf(4123,negated_conjecture,(sdtasdt0(xq,sdtasdt0(xm,xp))!=sdtasdt0(xq,sdtasdt0(xp,xm))|$false|$false|$false),inference(rw,[status(thm)],[4122,92,theory(equality)])).
% cnf(4124,negated_conjecture,(sdtasdt0(xq,sdtasdt0(xm,xp))!=sdtasdt0(xq,sdtasdt0(xp,xm))),inference(cn,[status(thm)],[4123,theory(equality)])).
% cnf(4308,negated_conjecture,(~aInteger0(xm)|~aInteger0(xp)),inference(spm,[status(thm)],[4124,61,theory(equality)])).
% cnf(4311,negated_conjecture,($false|~aInteger0(xp)),inference(rw,[status(thm)],[4308,92,theory(equality)])).
% cnf(4312,negated_conjecture,($false|$false),inference(rw,[status(thm)],[4311,87,theory(equality)])).
% cnf(4313,negated_conjecture,($false),inference(cn,[status(thm)],[4312,theory(equality)])).
% cnf(4314,negated_conjecture,($false),4313,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 307
% # ...of these trivial : 18
% # ...subsumed : 118
% # ...remaining for further processing: 171
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 6
% # Generated clauses : 1562
% # ...of the previous two non-trivial : 1214
% # Contextual simplify-reflections : 34
% # Paramodulations : 1556
% # Factorizations : 0
% # Equation resolutions : 6
% # Current number of processed clauses: 119
% # Positive orientable unit clauses: 33
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 80
% # Current number of unprocessed clauses: 966
% # ...number of literals in the above : 3905
% # Clause-clause subsumption calls (NU) : 1197
% # Rec. Clause-clause subsumption calls : 923
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 135 leaves, 1.29+/-0.806 terms/leaf
% # Paramod-from index: 87 leaves, 1.09+/-0.326 terms/leaf
% # Paramod-into index: 125 leaves, 1.22+/-0.664 terms/leaf
% # -------------------------------------------------
% # User time : 0.075 s
% # System time : 0.004 s
% # Total time : 0.079 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.31 WC
% FINAL PrfWatch: 0.22 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP32307/NUM435+1.tptp
%
%------------------------------------------------------------------------------