TSTP Solution File: SET062+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET062+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 : art03.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:07 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/SystemOnTPTP23668/SET062+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP23668/SET062+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23668/SET062+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 23764
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set_defn)).
% fof(3, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(5, conjecture,![X1]:subset(empty_set,X1),file('/tmp/SRASS.s.p', prove_empty_set_subset)).
% fof(6, negated_conjecture,~(![X1]:subset(empty_set,X1)),inference(assume_negation,[status(cth)],[5])).
% fof(7, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(11, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[7])).
% cnf(12,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[11])).
% fof(13, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(14, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&(?[X7]:(member(X7,X4)&~(member(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[13])).
% fof(15, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[14])).
% fof(16, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[15])).
% fof(17, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[16])).
% cnf(19,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[17])).
% fof(27, negated_conjecture,?[X1]:~(subset(empty_set,X1)),inference(fof_nnf,[status(thm)],[6])).
% fof(28, negated_conjecture,?[X2]:~(subset(empty_set,X2)),inference(variable_rename,[status(thm)],[27])).
% fof(29, negated_conjecture,~(subset(empty_set,esk3_0)),inference(skolemize,[status(esa)],[28])).
% cnf(30,negated_conjecture,(~subset(empty_set,esk3_0)),inference(split_conjunct,[status(thm)],[29])).
% cnf(31,plain,(subset(empty_set,X1)),inference(spm,[status(thm)],[12,19,theory(equality)])).
% cnf(39,negated_conjecture,($false),inference(rw,[status(thm)],[30,31,theory(equality)])).
% cnf(40,negated_conjecture,($false),inference(cn,[status(thm)],[39,theory(equality)])).
% cnf(41,negated_conjecture,($false),40,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 18
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 18
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 7
% # ...of the previous two non-trivial : 3
% # Contextual simplify-reflections : 0
% # Paramodulations : 7
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 9
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 5
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 2
% # Clause-clause subsumption calls (NU) : 2
% # Rec. Clause-clause subsumption calls : 2
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 12 leaves, 1.42+/-0.759 terms/leaf
% # Paramod-from index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 10 leaves, 1.20+/-0.400 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.005 s
% # Total time : 0.012 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/SystemOnTPTP23668/SET062+3.tptp
%
%------------------------------------------------------------------------------