TSTP Solution File: SET599+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET599+3 : 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 23:14:14 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/SystemOnTPTP29492/SET599+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP29492/SET599+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29492/SET599+3.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 29588
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:symmetric_difference(X1,X2)=union(difference(X1,X2),difference(X2,X1)),file('/tmp/SRASS.s.p', symmetric_difference_defn)).
% fof(5, axiom,![X1]:![X2]:subset(X1,union(X1,X2)),file('/tmp/SRASS.s.p', subset_of_union)).
% fof(9, conjecture,![X1]:![X2]:subset(difference(X1,X2),symmetric_difference(X1,X2)),file('/tmp/SRASS.s.p', prove_th58)).
% fof(10, negated_conjecture,~(![X1]:![X2]:subset(difference(X1,X2),symmetric_difference(X1,X2))),inference(assume_negation,[status(cth)],[9])).
% fof(16, plain,![X3]:![X4]:symmetric_difference(X3,X4)=union(difference(X3,X4),difference(X4,X3)),inference(variable_rename,[status(thm)],[3])).
% cnf(17,plain,(symmetric_difference(X1,X2)=union(difference(X1,X2),difference(X2,X1))),inference(split_conjunct,[status(thm)],[16])).
% fof(24, plain,![X3]:![X4]:subset(X3,union(X3,X4)),inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(subset(X1,union(X1,X2))),inference(split_conjunct,[status(thm)],[24])).
% fof(45, negated_conjecture,?[X1]:?[X2]:~(subset(difference(X1,X2),symmetric_difference(X1,X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(46, negated_conjecture,?[X3]:?[X4]:~(subset(difference(X3,X4),symmetric_difference(X3,X4))),inference(variable_rename,[status(thm)],[45])).
% fof(47, negated_conjecture,~(subset(difference(esk3_0,esk4_0),symmetric_difference(esk3_0,esk4_0))),inference(skolemize,[status(esa)],[46])).
% cnf(48,negated_conjecture,(~subset(difference(esk3_0,esk4_0),symmetric_difference(esk3_0,esk4_0))),inference(split_conjunct,[status(thm)],[47])).
% cnf(50,negated_conjecture,(~subset(difference(esk3_0,esk4_0),union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)))),inference(rw,[status(thm)],[48,17,theory(equality)]),['unfolding']).
% cnf(51,negated_conjecture,($false),inference(rw,[status(thm)],[50,25,theory(equality)])).
% cnf(52,negated_conjecture,($false),inference(cn,[status(thm)],[51,theory(equality)])).
% cnf(53,negated_conjecture,($false),52,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 4
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 3
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 9
% # ...number of literals in the above : 21
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 4 leaves, 1.25+/-0.433 terms/leaf
% # Paramod-from index: 3 leaves, 1.33+/-0.471 terms/leaf
% # Paramod-into index: 3 leaves, 1.33+/-0.471 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.004 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP29492/SET599+3.tptp
%
%------------------------------------------------------------------------------