TSTP Solution File: SET813+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET813+4 : TPTP v5.0.0. Released v3.2.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 : Thu Dec 30 00:11:14 EST 2010
% Result : Theorem 0.95s
% Output : Solution 0.95s
% 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/SystemOnTPTP4636/SET813+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4636/SET813+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4636/SET813+4.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 4732
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X3]:![X1]:![X2]:(member(X3,union(X1,X2))<=>(member(X3,X1)|member(X3,X2))),file('/tmp/SRASS.s.p', union)).
% fof(4, axiom,![X1]:![X3]:(member(X3,suc(X1))<=>member(X3,union(X1,singleton(X1)))),file('/tmp/SRASS.s.p', successor)).
% fof(6, axiom,![X3]:![X1]:(member(X3,singleton(X1))<=>X3=X1),file('/tmp/SRASS.s.p', singleton)).
% fof(20, conjecture,![X1]:(member(X1,on)=>member(X1,suc(X1))),file('/tmp/SRASS.s.p', thV12)).
% fof(21, negated_conjecture,~(![X1]:(member(X1,on)=>member(X1,suc(X1)))),inference(assume_negation,[status(cth)],[20])).
% fof(32, plain,![X3]:![X1]:![X2]:((~(member(X3,union(X1,X2)))|(member(X3,X1)|member(X3,X2)))&((~(member(X3,X1))&~(member(X3,X2)))|member(X3,union(X1,X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(33, plain,![X4]:![X5]:![X6]:((~(member(X4,union(X5,X6)))|(member(X4,X5)|member(X4,X6)))&((~(member(X4,X5))&~(member(X4,X6)))|member(X4,union(X5,X6)))),inference(variable_rename,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:![X6]:((~(member(X4,union(X5,X6)))|(member(X4,X5)|member(X4,X6)))&((~(member(X4,X5))|member(X4,union(X5,X6)))&(~(member(X4,X6))|member(X4,union(X5,X6))))),inference(distribute,[status(thm)],[33])).
% cnf(35,plain,(member(X1,union(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[34])).
% fof(42, plain,![X1]:![X3]:((~(member(X3,suc(X1)))|member(X3,union(X1,singleton(X1))))&(~(member(X3,union(X1,singleton(X1))))|member(X3,suc(X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(43, plain,![X4]:![X5]:((~(member(X5,suc(X4)))|member(X5,union(X4,singleton(X4))))&(~(member(X5,union(X4,singleton(X4))))|member(X5,suc(X4)))),inference(variable_rename,[status(thm)],[42])).
% cnf(44,plain,(member(X1,suc(X2))|~member(X1,union(X2,singleton(X2)))),inference(split_conjunct,[status(thm)],[43])).
% fof(50, plain,![X3]:![X1]:((~(member(X3,singleton(X1)))|X3=X1)&(~(X3=X1)|member(X3,singleton(X1)))),inference(fof_nnf,[status(thm)],[6])).
% fof(51, plain,![X4]:![X5]:((~(member(X4,singleton(X5)))|X4=X5)&(~(X4=X5)|member(X4,singleton(X5)))),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(member(X1,singleton(X2))|X1!=X2),inference(split_conjunct,[status(thm)],[51])).
% fof(167, negated_conjecture,?[X1]:(member(X1,on)&~(member(X1,suc(X1)))),inference(fof_nnf,[status(thm)],[21])).
% fof(168, negated_conjecture,?[X2]:(member(X2,on)&~(member(X2,suc(X2)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,(member(esk14_0,on)&~(member(esk14_0,suc(esk14_0)))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~member(esk14_0,suc(esk14_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,plain,(member(X1,singleton(X1))),inference(er,[status(thm)],[52,theory(equality)])).
% cnf(326,plain,(member(X1,suc(X2))|~member(X1,singleton(X2))),inference(spm,[status(thm)],[44,35,theory(equality)])).
% cnf(886,negated_conjecture,(~member(esk14_0,singleton(esk14_0))),inference(spm,[status(thm)],[170,326,theory(equality)])).
% cnf(893,negated_conjecture,($false),inference(rw,[status(thm)],[886,172,theory(equality)])).
% cnf(894,negated_conjecture,($false),inference(cn,[status(thm)],[893,theory(equality)])).
% cnf(895,negated_conjecture,($false),894,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 204
% # ...of these trivial : 11
% # ...subsumed : 2
% # ...remaining for further processing: 191
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 684
% # ...of the previous two non-trivial : 659
% # Contextual simplify-reflections : 0
% # Paramodulations : 681
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 108
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 79
% # Current number of unprocessed clauses: 615
% # ...number of literals in the above : 2024
% # Clause-clause subsumption calls (NU) : 169
% # Rec. Clause-clause subsumption calls : 118
% # Unit Clause-clause subsumption calls : 81
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 35
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 98 leaves, 1.50+/-1.350 terms/leaf
% # Paramod-from index: 44 leaves, 1.09+/-0.468 terms/leaf
% # Paramod-into index: 90 leaves, 1.32+/-0.728 terms/leaf
% # -------------------------------------------------
% # User time : 0.041 s
% # System time : 0.007 s
% # Total time : 0.048 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP4636/SET813+4.tptp
%
%------------------------------------------------------------------------------