TSTP Solution File: SET602+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET602+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 : art05.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:39 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/SystemOnTPTP31832/SET602+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP31832/SET602+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31832/SET602+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 31928
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', difference_empty_set)).
% fof(5, axiom,![X1]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_of_subset)).
% fof(8, conjecture,![X1]:difference(X1,X1)=empty_set,file('/tmp/SRASS.s.p', prove_self_difference_is_empty_set)).
% fof(9, negated_conjecture,~(![X1]:difference(X1,X1)=empty_set),inference(assume_negation,[status(cth)],[8])).
% fof(13, plain,![X1]:![X2]:((~(difference(X1,X2)=empty_set)|subset(X1,X2))&(~(subset(X1,X2))|difference(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[1])).
% fof(14, plain,![X3]:![X4]:((~(difference(X3,X4)=empty_set)|subset(X3,X4))&(~(subset(X3,X4))|difference(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[13])).
% cnf(15,plain,(difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[14])).
% fof(31, plain,![X2]:subset(X2,X2),inference(variable_rename,[status(thm)],[5])).
% cnf(32,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(47, negated_conjecture,?[X1]:~(difference(X1,X1)=empty_set),inference(fof_nnf,[status(thm)],[9])).
% fof(48, negated_conjecture,?[X2]:~(difference(X2,X2)=empty_set),inference(variable_rename,[status(thm)],[47])).
% fof(49, negated_conjecture,~(difference(esk3_0,esk3_0)=empty_set),inference(skolemize,[status(esa)],[48])).
% cnf(50,negated_conjecture,(difference(esk3_0,esk3_0)!=empty_set),inference(split_conjunct,[status(thm)],[49])).
% cnf(55,negated_conjecture,(~subset(esk3_0,esk3_0)),inference(spm,[status(thm)],[50,15,theory(equality)])).
% cnf(56,negated_conjecture,($false),inference(rw,[status(thm)],[55,32,theory(equality)])).
% cnf(57,negated_conjecture,($false),inference(cn,[status(thm)],[56,theory(equality)])).
% cnf(58,negated_conjecture,($false),57,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 20
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 20
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 3
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 1
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 4
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 10
% # ...number of literals in the above : 23
% # Clause-clause subsumption calls (NU) : 4
% # Rec. Clause-clause subsumption calls : 4
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 7 leaves, 1.14+/-0.350 terms/leaf
% # Paramod-from index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 6 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.003 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.16 WC
% FINAL PrfWatch: 0.08 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP31832/SET602+3.tptp
%
%------------------------------------------------------------------------------