TSTP Solution File: SEU134+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU134+1 : TPTP v5.0.0. Released v3.3.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 : Thu Dec 30 01:12:58 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP15707/SEU134+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP15707/SEU134+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15707/SEU134+1.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 15803
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', l32_xboole_1)).
% fof(14, conjecture,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t37_xboole_1)).
% fof(15, negated_conjecture,~(![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2))),inference(assume_negation,[status(cth)],[14])).
% fof(24, plain,![X1]:![X2]:((~(set_difference(X1,X2)=empty_set)|subset(X1,X2))&(~(subset(X1,X2))|set_difference(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[4])).
% fof(25, plain,![X3]:![X4]:((~(set_difference(X3,X4)=empty_set)|subset(X3,X4))&(~(subset(X3,X4))|set_difference(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[24])).
% cnf(26,plain,(set_difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(subset(X1,X2)|set_difference(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[25])).
% fof(49, negated_conjecture,?[X1]:?[X2]:((~(set_difference(X1,X2)=empty_set)|~(subset(X1,X2)))&(set_difference(X1,X2)=empty_set|subset(X1,X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(50, negated_conjecture,?[X3]:?[X4]:((~(set_difference(X3,X4)=empty_set)|~(subset(X3,X4)))&(set_difference(X3,X4)=empty_set|subset(X3,X4))),inference(variable_rename,[status(thm)],[49])).
% fof(51, negated_conjecture,((~(set_difference(esk3_0,esk4_0)=empty_set)|~(subset(esk3_0,esk4_0)))&(set_difference(esk3_0,esk4_0)=empty_set|subset(esk3_0,esk4_0))),inference(skolemize,[status(esa)],[50])).
% cnf(52,negated_conjecture,(subset(esk3_0,esk4_0)|set_difference(esk3_0,esk4_0)=empty_set),inference(split_conjunct,[status(thm)],[51])).
% cnf(53,negated_conjecture,(~subset(esk3_0,esk4_0)|set_difference(esk3_0,esk4_0)!=empty_set),inference(split_conjunct,[status(thm)],[51])).
% cnf(58,negated_conjecture,(set_difference(esk3_0,esk4_0)!=empty_set),inference(spm,[status(thm)],[53,27,theory(equality)])).
% cnf(62,negated_conjecture,(subset(esk3_0,esk4_0)),inference(sr,[status(thm)],[52,58,theory(equality)])).
% cnf(63,negated_conjecture,(set_difference(esk3_0,esk4_0)=empty_set),inference(spm,[status(thm)],[26,62,theory(equality)])).
% cnf(66,negated_conjecture,($false),inference(sr,[status(thm)],[63,58,theory(equality)])).
% cnf(67,negated_conjecture,($false),66,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 30
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 30
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 10
% # ...of the previous two non-trivial : 8
% # Contextual simplify-reflections : 0
% # Paramodulations : 9
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 14
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 6
% # Current number of unprocessed clauses: 5
% # ...number of literals in the above : 7
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 17 leaves, 1.18+/-0.381 terms/leaf
% # Paramod-from index: 6 leaves, 1.17+/-0.373 terms/leaf
% # Paramod-into index: 15 leaves, 1.13+/-0.340 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.002 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.16 WC
% FINAL PrfWatch: 0.09 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP15707/SEU134+1.tptp
%
%------------------------------------------------------------------------------