TSTP Solution File: RNG103+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG103+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 : art04.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:29 EST 2010
% Result : Theorem 1.83s
% Output : Solution 1.83s
% 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/SystemOnTPTP5723/RNG103+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5723/RNG103+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5723/RNG103+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 5819
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(7, axiom,![X1]:![X2]:![X3]:(((aElement0(X1)&aElement0(X2))&aElement0(X3))=>(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X2,X3),X1)=sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)))),file('/tmp/SRASS.s.p', mAMDistr)).
% fof(8, axiom,aElement0(xc),file('/tmp/SRASS.s.p', m__1905)).
% 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(42, conjecture,sdtpldt0(xx,xy)=sdtasdt0(xc,sdtpldt0(xu,xv)),file('/tmp/SRASS.s.p', m__)).
% fof(43, negated_conjecture,~(sdtpldt0(xx,xy)=sdtasdt0(xc,sdtpldt0(xu,xv))),inference(assume_negation,[status(cth)],[42])).
% fof(48, negated_conjecture,~(sdtpldt0(xx,xy)=sdtasdt0(xc,sdtpldt0(xu,xv))),inference(fof_simplification,[status(thm)],[43,theory(equality)])).
% fof(67, plain,![X1]:![X2]:![X3]:(((~(aElement0(X1))|~(aElement0(X2)))|~(aElement0(X3)))|(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X2,X3),X1)=sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(68, plain,![X4]:![X5]:![X6]:(((~(aElement0(X4))|~(aElement0(X5)))|~(aElement0(X6)))|(sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))&sdtasdt0(sdtpldt0(X5,X6),X4)=sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4)))),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,![X4]:![X5]:![X6]:((sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))|((~(aElement0(X4))|~(aElement0(X5)))|~(aElement0(X6))))&(sdtasdt0(sdtpldt0(X5,X6),X4)=sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))|((~(aElement0(X4))|~(aElement0(X5)))|~(aElement0(X6))))),inference(distribute,[status(thm)],[68])).
% cnf(71,plain,(sdtasdt0(X3,sdtpldt0(X2,X1))=sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))|~aElement0(X1)|~aElement0(X2)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[69])).
% cnf(72,plain,(aElement0(xc)),inference(split_conjunct,[status(thm)],[8])).
% cnf(82,plain,(sdtasdt0(xc,xu)=xx),inference(split_conjunct,[status(thm)],[10])).
% cnf(83,plain,(aElement0(xu)),inference(split_conjunct,[status(thm)],[10])).
% cnf(84,plain,(sdtasdt0(xc,xv)=xy),inference(split_conjunct,[status(thm)],[11])).
% cnf(85,plain,(aElement0(xv)),inference(split_conjunct,[status(thm)],[11])).
% cnf(255,negated_conjecture,(sdtpldt0(xx,xy)!=sdtasdt0(xc,sdtpldt0(xu,xv))),inference(split_conjunct,[status(thm)],[48])).
% cnf(620,plain,(sdtpldt0(sdtasdt0(xc,X1),xy)=sdtasdt0(xc,sdtpldt0(X1,xv))|~aElement0(xc)|~aElement0(X1)|~aElement0(xv)),inference(spm,[status(thm)],[71,84,theory(equality)])).
% cnf(655,plain,(sdtpldt0(sdtasdt0(xc,X1),xy)=sdtasdt0(xc,sdtpldt0(X1,xv))|$false|~aElement0(X1)|~aElement0(xv)),inference(rw,[status(thm)],[620,72,theory(equality)])).
% cnf(656,plain,(sdtpldt0(sdtasdt0(xc,X1),xy)=sdtasdt0(xc,sdtpldt0(X1,xv))|$false|~aElement0(X1)|$false),inference(rw,[status(thm)],[655,85,theory(equality)])).
% cnf(657,plain,(sdtpldt0(sdtasdt0(xc,X1),xy)=sdtasdt0(xc,sdtpldt0(X1,xv))|~aElement0(X1)),inference(cn,[status(thm)],[656,theory(equality)])).
% cnf(30179,plain,(sdtpldt0(xx,xy)=sdtasdt0(xc,sdtpldt0(xu,xv))|~aElement0(xu)),inference(spm,[status(thm)],[657,82,theory(equality)])).
% cnf(30287,plain,(sdtpldt0(xx,xy)=sdtasdt0(xc,sdtpldt0(xu,xv))|$false),inference(rw,[status(thm)],[30179,83,theory(equality)])).
% cnf(30288,plain,(sdtpldt0(xx,xy)=sdtasdt0(xc,sdtpldt0(xu,xv))),inference(cn,[status(thm)],[30287,theory(equality)])).
% cnf(30289,plain,($false),inference(sr,[status(thm)],[30288,255,theory(equality)])).
% cnf(30290,plain,($false),30289,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1359
% # ...of these trivial : 138
% # ...subsumed : 610
% # ...remaining for further processing: 611
% # Other redundant clauses eliminated : 38
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 8
% # Backward-rewritten : 27
% # Generated clauses : 10333
% # ...of the previous two non-trivial : 9160
% # Contextual simplify-reflections : 494
% # Paramodulations : 10278
% # Factorizations : 0
% # Equation resolutions : 55
% # Current number of processed clauses: 475
% # Positive orientable unit clauses: 158
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 315
% # Current number of unprocessed clauses: 7773
% # ...number of literals in the above : 36305
% # Clause-clause subsumption calls (NU) : 13700
% # Rec. Clause-clause subsumption calls : 9602
% # Unit Clause-clause subsumption calls : 36
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 13
% # Indexed BW rewrite successes : 12
% # Backwards rewriting index: 478 leaves, 1.22+/-0.903 terms/leaf
% # Paramod-from index: 309 leaves, 1.06+/-0.397 terms/leaf
% # Paramod-into index: 428 leaves, 1.15+/-0.635 terms/leaf
% # -------------------------------------------------
% # User time : 0.475 s
% # System time : 0.020 s
% # Total time : 0.495 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.98 CPU 1.07 WC
% FINAL PrfWatch: 0.98 CPU 1.07 WC
% SZS output end Solution for /tmp/SystemOnTPTP5723/RNG103+2.tptp
%
%------------------------------------------------------------------------------