TSTP Solution File: RNG105+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG105+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 : art03.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:38:01 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP13774/RNG105+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13774/RNG105+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13774/RNG105+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 13870
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>aElement0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB)).
% fof(2, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>aElement0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% 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(11, axiom,(aElement0(xv)&sdtasdt0(xc,xv)=xy),file('/tmp/SRASS.s.p', m__1979)).
% fof(12, axiom,sdtpldt0(xx,xy)=sdtasdt0(xc,sdtpldt0(xu,xv)),file('/tmp/SRASS.s.p', m__2010)).
% fof(13, axiom,sdtasdt0(xz,xx)=sdtasdt0(xc,sdtasdt0(xu,xz)),file('/tmp/SRASS.s.p', m__2043)).
% fof(44, conjecture,((?[X1]:(aElement0(X1)&sdtasdt0(xc,X1)=sdtpldt0(xx,xy))|aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)))&(?[X1]:(aElement0(X1)&sdtasdt0(xc,X1)=sdtasdt0(xz,xx))|aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)))),file('/tmp/SRASS.s.p', m__)).
% fof(45, negated_conjecture,~(((?[X1]:(aElement0(X1)&sdtasdt0(xc,X1)=sdtpldt0(xx,xy))|aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)))&(?[X1]:(aElement0(X1)&sdtasdt0(xc,X1)=sdtasdt0(xz,xx))|aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))))),inference(assume_negation,[status(cth)],[44])).
% fof(50, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|aElement0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(51, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|aElement0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(aElement0(sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[51])).
% 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(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(84,plain,(aElement0(xu)),inference(split_conjunct,[status(thm)],[10])).
% cnf(86,plain,(aElement0(xv)),inference(split_conjunct,[status(thm)],[11])).
% cnf(87,plain,(sdtpldt0(xx,xy)=sdtasdt0(xc,sdtpldt0(xu,xv))),inference(split_conjunct,[status(thm)],[12])).
% cnf(88,plain,(sdtasdt0(xz,xx)=sdtasdt0(xc,sdtasdt0(xu,xz))),inference(split_conjunct,[status(thm)],[13])).
% fof(258, negated_conjecture,((![X1]:(~(aElement0(X1))|~(sdtasdt0(xc,X1)=sdtpldt0(xx,xy)))&~(aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))))|(![X1]:(~(aElement0(X1))|~(sdtasdt0(xc,X1)=sdtasdt0(xz,xx)))&~(aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))))),inference(fof_nnf,[status(thm)],[45])).
% fof(259, negated_conjecture,((![X2]:(~(aElement0(X2))|~(sdtasdt0(xc,X2)=sdtpldt0(xx,xy)))&~(aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))))|(![X3]:(~(aElement0(X3))|~(sdtasdt0(xc,X3)=sdtasdt0(xz,xx)))&~(aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))))),inference(variable_rename,[status(thm)],[258])).
% fof(260, negated_conjecture,![X2]:![X3]:(((~(aElement0(X3))|~(sdtasdt0(xc,X3)=sdtasdt0(xz,xx)))&~(aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))))|((~(aElement0(X2))|~(sdtasdt0(xc,X2)=sdtpldt0(xx,xy)))&~(aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))))),inference(shift_quantors,[status(thm)],[259])).
% fof(261, negated_conjecture,![X2]:![X3]:((((~(aElement0(X2))|~(sdtasdt0(xc,X2)=sdtpldt0(xx,xy)))|(~(aElement0(X3))|~(sdtasdt0(xc,X3)=sdtasdt0(xz,xx))))&(~(aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)))|(~(aElement0(X3))|~(sdtasdt0(xc,X3)=sdtasdt0(xz,xx)))))&(((~(aElement0(X2))|~(sdtasdt0(xc,X2)=sdtpldt0(xx,xy)))|~(aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))))&(~(aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)))|~(aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)))))),inference(distribute,[status(thm)],[260])).
% cnf(265,negated_conjecture,(sdtasdt0(xc,X1)!=sdtasdt0(xz,xx)|~aElement0(X1)|sdtasdt0(xc,X2)!=sdtpldt0(xx,xy)|~aElement0(X2)),inference(split_conjunct,[status(thm)],[261])).
% fof(266, plain,(~(epred1_0)<=>![X2]:(~(sdtpldt0(xx,xy)=sdtasdt0(xc,X2))|~(aElement0(X2)))),introduced(definition),['split']).
% cnf(267,plain,(epred1_0|~aElement0(X2)|sdtpldt0(xx,xy)!=sdtasdt0(xc,X2)),inference(split_equiv,[status(thm)],[266])).
% fof(268, plain,(~(epred2_0)<=>![X1]:(~(sdtasdt0(xz,xx)=sdtasdt0(xc,X1))|~(aElement0(X1)))),introduced(definition),['split']).
% cnf(269,plain,(epred2_0|~aElement0(X1)|sdtasdt0(xz,xx)!=sdtasdt0(xc,X1)),inference(split_equiv,[status(thm)],[268])).
% cnf(270,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[265,266,theory(equality)]),268,theory(equality)]),['split']).
% cnf(272,negated_conjecture,(epred2_0|~aElement0(sdtasdt0(xu,xz))),inference(spm,[status(thm)],[269,88,theory(equality)])).
% cnf(313,negated_conjecture,(epred1_0|~aElement0(sdtpldt0(xu,xv))),inference(spm,[status(thm)],[267,87,theory(equality)])).
% cnf(1024,negated_conjecture,(epred2_0|~aElement0(xz)|~aElement0(xu)),inference(spm,[status(thm)],[272,55,theory(equality)])).
% cnf(1025,negated_conjecture,(epred2_0|$false|~aElement0(xu)),inference(rw,[status(thm)],[1024,76,theory(equality)])).
% cnf(1026,negated_conjecture,(epred2_0|$false|$false),inference(rw,[status(thm)],[1025,84,theory(equality)])).
% cnf(1027,negated_conjecture,(epred2_0),inference(cn,[status(thm)],[1026,theory(equality)])).
% cnf(1029,negated_conjecture,($false|~epred1_0),inference(rw,[status(thm)],[270,1027,theory(equality)])).
% cnf(1030,negated_conjecture,(~epred1_0),inference(cn,[status(thm)],[1029,theory(equality)])).
% cnf(1044,negated_conjecture,(~aElement0(sdtpldt0(xu,xv))),inference(sr,[status(thm)],[313,1030,theory(equality)])).
% cnf(1045,negated_conjecture,(~aElement0(xv)|~aElement0(xu)),inference(spm,[status(thm)],[1044,52,theory(equality)])).
% cnf(1046,negated_conjecture,($false|~aElement0(xu)),inference(rw,[status(thm)],[1045,86,theory(equality)])).
% cnf(1047,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1046,84,theory(equality)])).
% cnf(1048,negated_conjecture,($false),inference(cn,[status(thm)],[1047,theory(equality)])).
% cnf(1049,negated_conjecture,($false),1048,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 227
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 226
% # Other redundant clauses eliminated : 12
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 410
% # ...of the previous two non-trivial : 377
% # Contextual simplify-reflections : 0
% # Paramodulations : 386
% # Factorizations : 0
% # Equation resolutions : 21
% # Current number of processed clauses: 114
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 90
% # Current number of unprocessed clauses: 356
% # ...number of literals in the above : 1484
% # Clause-clause subsumption calls (NU) : 413
% # Rec. Clause-clause subsumption calls : 216
% # Unit Clause-clause subsumption calls : 41
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 143 leaves, 1.36+/-1.150 terms/leaf
% # Paramod-from index: 62 leaves, 1.08+/-0.272 terms/leaf
% # Paramod-into index: 128 leaves, 1.17+/-0.561 terms/leaf
% # -------------------------------------------------
% # User time : 0.049 s
% # System time : 0.004 s
% # Total time : 0.053 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.23 WC
% FINAL PrfWatch: 0.16 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP13774/RNG105+2.tptp
%
%------------------------------------------------------------------------------