TSTP Solution File: SET583+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET583+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 23:16:50 EST 2010
% Result : Theorem 1.11s
% Output : Solution 1.11s
% 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/SystemOnTPTP10944/SET583+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10944/SET583+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10944/SET583+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 11076
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_defn)).
% fof(4, conjecture,![X1]:![X2]:((subset(X1,X2)&subset(X2,X1))=>X1=X2),file('/tmp/SRASS.s.p', prove_extensionality)).
% fof(5, negated_conjecture,~(![X1]:![X2]:((subset(X1,X2)&subset(X2,X1))=>X1=X2)),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(7, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[6])).
% fof(8, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[7])).
% cnf(9,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[8])).
% fof(22, negated_conjecture,?[X1]:?[X2]:((subset(X1,X2)&subset(X2,X1))&~(X1=X2)),inference(fof_nnf,[status(thm)],[5])).
% fof(23, negated_conjecture,?[X3]:?[X4]:((subset(X3,X4)&subset(X4,X3))&~(X3=X4)),inference(variable_rename,[status(thm)],[22])).
% fof(24, negated_conjecture,((subset(esk2_0,esk3_0)&subset(esk3_0,esk2_0))&~(esk2_0=esk3_0)),inference(skolemize,[status(esa)],[23])).
% cnf(25,negated_conjecture,(esk2_0!=esk3_0),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,negated_conjecture,(subset(esk3_0,esk2_0)),inference(split_conjunct,[status(thm)],[24])).
% cnf(27,negated_conjecture,(subset(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[24])).
% cnf(32,negated_conjecture,(esk2_0=esk3_0|~subset(esk2_0,esk3_0)),inference(spm,[status(thm)],[9,26,theory(equality)])).
% cnf(34,negated_conjecture,(esk2_0=esk3_0|$false),inference(rw,[status(thm)],[32,27,theory(equality)])).
% cnf(35,negated_conjecture,(esk2_0=esk3_0),inference(cn,[status(thm)],[34,theory(equality)])).
% cnf(36,negated_conjecture,($false),inference(sr,[status(thm)],[35,25,theory(equality)])).
% cnf(37,negated_conjecture,($false),36,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 15
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 15
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 4
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 2
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 5
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 3
% # ...number of literals in the above : 7
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 1
% # 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: 6 leaves, 1.33+/-0.745 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 5 leaves, 1.20+/-0.400 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.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP10944/SET583+3.tptp
%
%------------------------------------------------------------------------------