TSTP Solution File: RNG104+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG104+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 : 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:47 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/SystemOnTPTP5805/RNG104+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5805/RNG104+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5805/RNG104+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 5901
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.021 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,((((?[X1]:(aElement0(X1)&sdtasdt0(xc,X1)=xx)&aElementOf0(xx,slsdtgt0(xc)))&?[X1]:(aElement0(X1)&sdtasdt0(xc,X1)=xy))&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])).
% fof(74, plain,((((?[X2]:(aElement0(X2)&sdtasdt0(xc,X2)=xx)&aElementOf0(xx,slsdtgt0(xc)))&?[X3]:(aElement0(X3)&sdtasdt0(xc,X3)=xy))&aElementOf0(xy,slsdtgt0(xc)))&aElement0(xz)),inference(variable_rename,[status(thm)],[9])).
% fof(75, plain,(((((aElement0(esk1_0)&sdtasdt0(xc,esk1_0)=xx)&aElementOf0(xx,slsdtgt0(xc)))&(aElement0(esk2_0)&sdtasdt0(xc,esk2_0)=xy))&aElementOf0(xy,slsdtgt0(xc)))&aElement0(xz)),inference(skolemize,[status(esa)],[74])).
% cnf(76,plain,(aElement0(xz)),inference(split_conjunct,[status(thm)],[75])).
% cnf(81,plain,(sdtasdt0(xc,esk1_0)=xx),inference(split_conjunct,[status(thm)],[75])).
% cnf(82,plain,(aElement0(esk1_0)),inference(split_conjunct,[status(thm)],[75])).
% cnf(83,plain,(sdtasdt0(xc,xu)=xx),inference(split_conjunct,[status(thm)],[10])).
% cnf(84,plain,(aElement0(xu)),inference(split_conjunct,[status(thm)],[10])).
% cnf(257,negated_conjecture,(sdtasdt0(xz,xx)!=sdtasdt0(xc,sdtasdt0(xu,xz))),inference(split_conjunct,[status(thm)],[49])).
% cnf(277,plain,(aElement0(xx)|~aElement0(esk1_0)|~aElement0(xc)),inference(spm,[status(thm)],[55,81,theory(equality)])).
% cnf(292,plain,(aElement0(xx)|$false|~aElement0(xc)),inference(rw,[status(thm)],[277,82,theory(equality)])).
% cnf(293,plain,(aElement0(xx)|$false|$false),inference(rw,[status(thm)],[292,73,theory(equality)])).
% cnf(294,plain,(aElement0(xx)),inference(cn,[status(thm)],[293,theory(equality)])).
% cnf(485,plain,(sdtasdt0(xx,X1)=sdtasdt0(xc,sdtasdt0(xu,X1))|~aElement0(X1)|~aElement0(xu)|~aElement0(xc)),inference(spm,[status(thm)],[67,83,theory(equality)])).
% cnf(510,plain,(sdtasdt0(xx,X1)=sdtasdt0(xc,sdtasdt0(xu,X1))|~aElement0(X1)|$false|~aElement0(xc)),inference(rw,[status(thm)],[485,84,theory(equality)])).
% cnf(511,plain,(sdtasdt0(xx,X1)=sdtasdt0(xc,sdtasdt0(xu,X1))|~aElement0(X1)|$false|$false),inference(rw,[status(thm)],[510,73,theory(equality)])).
% cnf(512,plain,(sdtasdt0(xx,X1)=sdtasdt0(xc,sdtasdt0(xu,X1))|~aElement0(X1)),inference(cn,[status(thm)],[511,theory(equality)])).
% cnf(1929,negated_conjecture,(sdtasdt0(xx,xz)!=sdtasdt0(xz,xx)|~aElement0(xz)),inference(spm,[status(thm)],[257,512,theory(equality)])).
% cnf(1958,negated_conjecture,(sdtasdt0(xx,xz)!=sdtasdt0(xz,xx)|$false),inference(rw,[status(thm)],[1929,76,theory(equality)])).
% cnf(1959,negated_conjecture,(sdtasdt0(xx,xz)!=sdtasdt0(xz,xx)),inference(cn,[status(thm)],[1958,theory(equality)])).
% cnf(2025,negated_conjecture,(~aElement0(xz)|~aElement0(xx)),inference(spm,[status(thm)],[1959,64,theory(equality)])).
% cnf(2027,negated_conjecture,($false|~aElement0(xx)),inference(rw,[status(thm)],[2025,76,theory(equality)])).
% cnf(2028,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2027,294,theory(equality)])).
% cnf(2029,negated_conjecture,($false),inference(cn,[status(thm)],[2028,theory(equality)])).
% cnf(2030,negated_conjecture,($false),2029,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 343
% # ...of these trivial : 18
% # ...subsumed : 51
% # ...remaining for further processing: 274
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 19
% # Backward-rewritten : 2
% # Generated clauses : 733
% # ...of the previous two non-trivial : 628
% # Contextual simplify-reflections : 16
% # Paramodulations : 710
% # Factorizations : 0
% # Equation resolutions : 23
% # Current number of processed clauses: 151
% # Positive orientable unit clauses: 26
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 122
% # Current number of unprocessed clauses: 425
% # ...number of literals in the above : 1969
% # Clause-clause subsumption calls (NU) : 709
% # Rec. Clause-clause subsumption calls : 489
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 174 leaves, 1.31+/-1.065 terms/leaf
% # Paramod-from index: 93 leaves, 1.06+/-0.246 terms/leaf
% # Paramod-into index: 155 leaves, 1.16+/-0.527 terms/leaf
% # -------------------------------------------------
% # User time : 0.066 s
% # System time : 0.004 s
% # Total time : 0.070 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.27 WC
% FINAL PrfWatch: 0.18 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP5805/RNG104+2.tptp
%
%------------------------------------------------------------------------------