TSTP Solution File: SET019+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET019+4 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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:52:04 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP19766/SET019+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP19766/SET019+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19766/SET019+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 19862
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(equal_set(X1,X2)<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_set)).
% fof(12, conjecture,![X1]:![X2]:((subset(X1,X2)&subset(X2,X1))=>equal_set(X1,X2)),file('/tmp/SRASS.s.p', thI02)).
% fof(13, negated_conjecture,~(![X1]:![X2]:((subset(X1,X2)&subset(X2,X1))=>equal_set(X1,X2))),inference(assume_negation,[status(cth)],[12])).
% fof(16, plain,![X1]:![X2]:((~(equal_set(X1,X2))|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|equal_set(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(17, plain,![X3]:![X4]:((~(equal_set(X3,X4))|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|equal_set(X3,X4))),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X3]:![X4]:(((subset(X3,X4)|~(equal_set(X3,X4)))&(subset(X4,X3)|~(equal_set(X3,X4))))&((~(subset(X3,X4))|~(subset(X4,X3)))|equal_set(X3,X4))),inference(distribute,[status(thm)],[17])).
% cnf(19,plain,(equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[18])).
% fof(80, negated_conjecture,?[X1]:?[X2]:((subset(X1,X2)&subset(X2,X1))&~(equal_set(X1,X2))),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X3]:?[X4]:((subset(X3,X4)&subset(X4,X3))&~(equal_set(X3,X4))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,((subset(esk4_0,esk5_0)&subset(esk5_0,esk4_0))&~(equal_set(esk4_0,esk5_0))),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(~equal_set(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,negated_conjecture,(subset(esk5_0,esk4_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(85,negated_conjecture,(subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(89,negated_conjecture,(~subset(esk5_0,esk4_0)|~subset(esk4_0,esk5_0)),inference(spm,[status(thm)],[83,19,theory(equality)])).
% cnf(92,negated_conjecture,($false|~subset(esk4_0,esk5_0)),inference(rw,[status(thm)],[89,84,theory(equality)])).
% cnf(93,negated_conjecture,($false|$false),inference(rw,[status(thm)],[92,85,theory(equality)])).
% cnf(94,negated_conjecture,($false),inference(cn,[status(thm)],[93,theory(equality)])).
% cnf(95,negated_conjecture,($false),94,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 41
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 41
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 6
% # ...of the previous two non-trivial : 3
% # Contextual simplify-reflections : 0
% # Paramodulations : 3
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 6
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 26
% # ...number of literals in the above : 55
% # Clause-clause subsumption calls (NU) : 15
% # Rec. Clause-clause subsumption calls : 15
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 8 leaves, 1.25+/-0.433 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 6 leaves, 1.17+/-0.373 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.004 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP19766/SET019+4.tptp
%
%------------------------------------------------------------------------------