TSTP Solution File: SET063+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET063+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 : art07.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:54:28 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/SystemOnTPTP18621/SET063+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP18621/SET063+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18621/SET063+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 18717
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:subset(empty_set,X1),file('/tmp/SRASS.s.p', empty_set_subset)).
% fof(2, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_defn)).
% fof(7, conjecture,![X1]:(subset(X1,empty_set)=>X1=empty_set),file('/tmp/SRASS.s.p', prove_subset_of_empty_set_is_empty_set)).
% fof(8, negated_conjecture,~(![X1]:(subset(X1,empty_set)=>X1=empty_set)),inference(assume_negation,[status(cth)],[7])).
% fof(11, plain,![X2]:subset(empty_set,X2),inference(variable_rename,[status(thm)],[1])).
% cnf(12,plain,(subset(empty_set,X1)),inference(split_conjunct,[status(thm)],[11])).
% fof(13, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[2])).
% fof(14, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[13])).
% fof(15, 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)],[14])).
% cnf(16,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[15])).
% fof(37, negated_conjecture,?[X1]:(subset(X1,empty_set)&~(X1=empty_set)),inference(fof_nnf,[status(thm)],[8])).
% fof(38, negated_conjecture,?[X2]:(subset(X2,empty_set)&~(X2=empty_set)),inference(variable_rename,[status(thm)],[37])).
% fof(39, negated_conjecture,(subset(esk3_0,empty_set)&~(esk3_0=empty_set)),inference(skolemize,[status(esa)],[38])).
% cnf(40,negated_conjecture,(esk3_0!=empty_set),inference(split_conjunct,[status(thm)],[39])).
% cnf(41,negated_conjecture,(subset(esk3_0,empty_set)),inference(split_conjunct,[status(thm)],[39])).
% cnf(46,negated_conjecture,(empty_set=esk3_0|~subset(empty_set,esk3_0)),inference(spm,[status(thm)],[16,41,theory(equality)])).
% cnf(48,negated_conjecture,(empty_set=esk3_0|$false),inference(rw,[status(thm)],[46,12,theory(equality)])).
% cnf(49,negated_conjecture,(empty_set=esk3_0),inference(cn,[status(thm)],[48,theory(equality)])).
% cnf(50,negated_conjecture,($false),inference(sr,[status(thm)],[49,40,theory(equality)])).
% cnf(51,negated_conjecture,($false),50,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 19
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 19
% # 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: 6
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 5
% # ...number of literals in the above : 11
% # 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: 7 leaves, 1.29+/-0.700 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.010 s
% # System time : 0.003 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.17 WC
% FINAL PrfWatch: 0.08 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP18621/SET063+3.tptp
%
%------------------------------------------------------------------------------