TSTP Solution File: SET009+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET009+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 : art02.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:50:06 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP17847/SET009+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP17847/SET009+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17847/SET009+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 17943
% 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]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),file('/tmp/SRASS.s.p', difference_defn)).
% fof(3, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(4, conjecture,![X1]:![X2]:![X3]:(subset(X1,X2)=>subset(difference(X3,X2),difference(X3,X1))),file('/tmp/SRASS.s.p', prove_subset_difference)).
% fof(5, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(X1,X2)=>subset(difference(X3,X2),difference(X3,X1)))),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(9, plain,![X1]:![X2]:![X3]:((~(member(X3,difference(X1,X2)))|(member(X3,X1)&~(member(X3,X2))))&((~(member(X3,X1))|member(X3,X2))|member(X3,difference(X1,X2)))),inference(fof_nnf,[status(thm)],[6])).
% fof(10, plain,![X4]:![X5]:![X6]:((~(member(X6,difference(X4,X5)))|(member(X6,X4)&~(member(X6,X5))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(variable_rename,[status(thm)],[9])).
% fof(11, plain,![X4]:![X5]:![X6]:(((member(X6,X4)|~(member(X6,difference(X4,X5))))&(~(member(X6,X5))|~(member(X6,difference(X4,X5)))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(distribute,[status(thm)],[10])).
% cnf(12,plain,(member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[11])).
% cnf(13,plain,(~member(X1,difference(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[11])).
% cnf(14,plain,(member(X1,X2)|~member(X1,difference(X2,X3))),inference(split_conjunct,[status(thm)],[11])).
% fof(15, 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(16, 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)],[15])).
% fof(17, 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)],[16])).
% fof(18, 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)],[17])).
% fof(19, 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)],[18])).
% cnf(20,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[19])).
% cnf(22,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(23, negated_conjecture,?[X1]:?[X2]:?[X3]:(subset(X1,X2)&~(subset(difference(X3,X2),difference(X3,X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(24, negated_conjecture,?[X4]:?[X5]:?[X6]:(subset(X4,X5)&~(subset(difference(X6,X5),difference(X6,X4)))),inference(variable_rename,[status(thm)],[23])).
% fof(25, negated_conjecture,(subset(esk2_0,esk3_0)&~(subset(difference(esk4_0,esk3_0),difference(esk4_0,esk2_0)))),inference(skolemize,[status(esa)],[24])).
% cnf(26,negated_conjecture,(~subset(difference(esk4_0,esk3_0),difference(esk4_0,esk2_0))),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,negated_conjecture,(subset(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[25])).
% cnf(28,plain,(member(esk1_2(difference(X1,X2),X3),X1)|subset(difference(X1,X2),X3)),inference(spm,[status(thm)],[14,21,theory(equality)])).
% cnf(31,negated_conjecture,(member(X1,esk3_0)|~member(X1,esk2_0)),inference(spm,[status(thm)],[22,27,theory(equality)])).
% cnf(33,plain,(subset(difference(X1,X2),X3)|~member(esk1_2(difference(X1,X2),X3),X2)),inference(spm,[status(thm)],[13,21,theory(equality)])).
% cnf(34,plain,(subset(X1,difference(X2,X3))|member(esk1_2(X1,difference(X2,X3)),X3)|~member(esk1_2(X1,difference(X2,X3)),X2)),inference(spm,[status(thm)],[20,12,theory(equality)])).
% cnf(41,negated_conjecture,(subset(difference(X1,esk3_0),X2)|~member(esk1_2(difference(X1,esk3_0),X2),esk2_0)),inference(spm,[status(thm)],[33,31,theory(equality)])).
% cnf(59,plain,(member(esk1_2(difference(X1,X2),difference(X1,X3)),X3)|subset(difference(X1,X2),difference(X1,X3))),inference(spm,[status(thm)],[34,28,theory(equality)])).
% cnf(597,negated_conjecture,(subset(difference(X1,esk3_0),difference(X1,esk2_0))),inference(spm,[status(thm)],[41,59,theory(equality)])).
% cnf(611,negated_conjecture,($false),inference(rw,[status(thm)],[26,597,theory(equality)])).
% cnf(612,negated_conjecture,($false),inference(cn,[status(thm)],[611,theory(equality)])).
% cnf(613,negated_conjecture,($false),612,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 136
% # ...of these trivial : 2
% # ...subsumed : 38
% # ...remaining for further processing: 96
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 549
% # ...of the previous two non-trivial : 523
% # Contextual simplify-reflections : 9
% # Paramodulations : 541
% # Factorizations : 8
% # Equation resolutions : 0
% # Current number of processed clauses: 81
% # Positive orientable unit clauses: 31
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 49
% # Current number of unprocessed clauses: 347
% # ...number of literals in the above : 1053
% # Clause-clause subsumption calls (NU) : 1041
% # Rec. Clause-clause subsumption calls : 648
% # Unit Clause-clause subsumption calls : 171
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 75
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 100 leaves, 2.24+/-3.522 terms/leaf
% # Paramod-from index: 36 leaves, 1.56+/-1.480 terms/leaf
% # Paramod-into index: 89 leaves, 1.94+/-2.122 terms/leaf
% # -------------------------------------------------
% # User time : 0.036 s
% # System time : 0.002 s
% # Total time : 0.038 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP17847/SET009+3.tptp
%
%------------------------------------------------------------------------------