TSTP Solution File: RNG104+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG104+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 22:37:38 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/SystemOnTPTP5546/RNG104+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5546/RNG104+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5546/RNG104+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 5642
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>aElement0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(5, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),file('/tmp/SRASS.s.p', mMulComm)).
% fof(6, axiom,![X1]:![X2]:![X3]:(((aElement0(X1)&aElement0(X2))&aElement0(X3))=>sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))),file('/tmp/SRASS.s.p', mMulAsso)).
% fof(8, axiom,aElement0(xc),file('/tmp/SRASS.s.p', m__1905)).
% fof(9, axiom,((aElementOf0(xx,slsdtgt0(xc))&aElementOf0(xy,slsdtgt0(xc)))&aElement0(xz)),file('/tmp/SRASS.s.p', m__1933)).
% fof(10, axiom,(aElement0(xu)&sdtasdt0(xc,xu)=xx),file('/tmp/SRASS.s.p', m__1956)).
% fof(43, conjecture,sdtasdt0(xz,xx)=sdtasdt0(xc,sdtasdt0(xu,xz)),file('/tmp/SRASS.s.p', m__)).
% fof(44, negated_conjecture,~(sdtasdt0(xz,xx)=sdtasdt0(xc,sdtasdt0(xu,xz))),inference(assume_negation,[status(cth)],[43])).
% fof(49, negated_conjecture,~(sdtasdt0(xz,xx)=sdtasdt0(xc,sdtasdt0(xu,xz))),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(53, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|aElement0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(54, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|aElement0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[53])).
% cnf(55,plain,(aElement0(sdtasdt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[54])).
% fof(62, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[5])).
% fof(63, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[62])).
% cnf(64,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[63])).
% fof(65, plain,![X1]:![X2]:![X3]:(((~(aElement0(X1))|~(aElement0(X2)))|~(aElement0(X3)))|sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(66, plain,![X4]:![X5]:![X6]:(((~(aElement0(X4))|~(aElement0(X5)))|~(aElement0(X6)))|sdtasdt0(sdtasdt0(X4,X5),X6)=sdtasdt0(X4,sdtasdt0(X5,X6))),inference(variable_rename,[status(thm)],[65])).
% cnf(67,plain,(sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[66])).
% cnf(73,plain,(aElement0(xc)),inference(split_conjunct,[status(thm)],[8])).
% cnf(74,plain,(aElement0(xz)),inference(split_conjunct,[status(thm)],[9])).
% cnf(77,plain,(sdtasdt0(xc,xu)=xx),inference(split_conjunct,[status(thm)],[10])).
% cnf(78,plain,(aElement0(xu)),inference(split_conjunct,[status(thm)],[10])).
% cnf(251,negated_conjecture,(sdtasdt0(xz,xx)!=sdtasdt0(xc,sdtasdt0(xu,xz))),inference(split_conjunct,[status(thm)],[49])).
% cnf(271,plain,(aElement0(xx)|~aElement0(xu)|~aElement0(xc)),inference(spm,[status(thm)],[55,77,theory(equality)])).
% cnf(284,plain,(aElement0(xx)|$false|~aElement0(xc)),inference(rw,[status(thm)],[271,78,theory(equality)])).
% cnf(285,plain,(aElement0(xx)|$false|$false),inference(rw,[status(thm)],[284,73,theory(equality)])).
% cnf(286,plain,(aElement0(xx)),inference(cn,[status(thm)],[285,theory(equality)])).
% cnf(473,plain,(sdtasdt0(xx,X1)=sdtasdt0(xc,sdtasdt0(xu,X1))|~aElement0(X1)|~aElement0(xu)|~aElement0(xc)),inference(spm,[status(thm)],[67,77,theory(equality)])).
% cnf(492,plain,(sdtasdt0(xx,X1)=sdtasdt0(xc,sdtasdt0(xu,X1))|~aElement0(X1)|$false|~aElement0(xc)),inference(rw,[status(thm)],[473,78,theory(equality)])).
% cnf(493,plain,(sdtasdt0(xx,X1)=sdtasdt0(xc,sdtasdt0(xu,X1))|~aElement0(X1)|$false|$false),inference(rw,[status(thm)],[492,73,theory(equality)])).
% cnf(494,plain,(sdtasdt0(xx,X1)=sdtasdt0(xc,sdtasdt0(xu,X1))|~aElement0(X1)),inference(cn,[status(thm)],[493,theory(equality)])).
% cnf(1144,negated_conjecture,(sdtasdt0(xx,xz)!=sdtasdt0(xz,xx)|~aElement0(xz)),inference(spm,[status(thm)],[251,494,theory(equality)])).
% cnf(1172,negated_conjecture,(sdtasdt0(xx,xz)!=sdtasdt0(xz,xx)|$false),inference(rw,[status(thm)],[1144,74,theory(equality)])).
% cnf(1173,negated_conjecture,(sdtasdt0(xx,xz)!=sdtasdt0(xz,xx)),inference(cn,[status(thm)],[1172,theory(equality)])).
% cnf(1281,negated_conjecture,(~aElement0(xz)|~aElement0(xx)),inference(spm,[status(thm)],[1173,64,theory(equality)])).
% cnf(1283,negated_conjecture,($false|~aElement0(xx)),inference(rw,[status(thm)],[1281,74,theory(equality)])).
% cnf(1284,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1283,286,theory(equality)])).
% cnf(1285,negated_conjecture,($false),inference(cn,[status(thm)],[1284,theory(equality)])).
% cnf(1286,negated_conjecture,($false),1285,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 271
% # ...of these trivial : 9
% # ...subsumed : 27
% # ...remaining for further processing: 235
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 1
% # Generated clauses : 482
% # ...of the previous two non-trivial : 413
% # Contextual simplify-reflections : 8
% # Paramodulations : 459
% # Factorizations : 0
% # Equation resolutions : 23
% # Current number of processed clauses: 126
% # Positive orientable unit clauses: 19
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 104
% # Current number of unprocessed clauses: 323
% # ...number of literals in the above : 1485
% # Clause-clause subsumption calls (NU) : 557
% # Rec. Clause-clause subsumption calls : 408
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 160 leaves, 1.36+/-1.109 terms/leaf
% # Paramod-from index: 77 leaves, 1.09+/-0.287 terms/leaf
% # Paramod-into index: 139 leaves, 1.20+/-0.565 terms/leaf
% # -------------------------------------------------
% # User time : 0.055 s
% # System time : 0.002 s
% # Total time : 0.057 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.24 WC
% FINAL PrfWatch: 0.16 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP5546/RNG104+1.tptp
%
%------------------------------------------------------------------------------