TSTP Solution File: SEU122+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU122+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 : art09.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:10:07 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP1994/SEU122+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP1994/SEU122+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1994/SEU122+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 2098
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(5, axiom,?[X1]:empty(X1),file('/tmp/SRASS.s.p', rc1_xboole_0)).
% fof(8, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(9, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(11, conjecture,![X1]:subset(empty_set,X1),file('/tmp/SRASS.s.p', t2_xboole_1)).
% fof(12, negated_conjecture,~(![X1]:subset(empty_set,X1)),inference(assume_negation,[status(cth)],[11])).
% fof(18, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(19, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[18])).
% fof(20, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[21])).
% cnf(24,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(29, plain,?[X2]:empty(X2),inference(variable_rename,[status(thm)],[5])).
% fof(30, plain,empty(esk2_0),inference(skolemize,[status(esa)],[29])).
% cnf(31,plain,(empty(esk2_0)),inference(split_conjunct,[status(thm)],[30])).
% fof(38, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(39, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[9])).
% fof(42, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[41])).
% cnf(43,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(45, negated_conjecture,?[X1]:~(subset(empty_set,X1)),inference(fof_nnf,[status(thm)],[12])).
% fof(46, negated_conjecture,?[X2]:~(subset(empty_set,X2)),inference(variable_rename,[status(thm)],[45])).
% fof(47, negated_conjecture,~(subset(empty_set,esk4_0)),inference(skolemize,[status(esa)],[46])).
% cnf(48,negated_conjecture,(~subset(empty_set,esk4_0)),inference(split_conjunct,[status(thm)],[47])).
% cnf(49,plain,(empty_set=esk2_0),inference(spm,[status(thm)],[43,31,theory(equality)])).
% cnf(52,plain,(subset(X1,X2)|~empty(X1)),inference(spm,[status(thm)],[40,24,theory(equality)])).
% cnf(57,negated_conjecture,(~subset(esk2_0,esk4_0)),inference(rw,[status(thm)],[48,49,theory(equality)])).
% cnf(60,negated_conjecture,(~empty(esk2_0)),inference(spm,[status(thm)],[57,52,theory(equality)])).
% cnf(62,negated_conjecture,($false),inference(rw,[status(thm)],[60,31,theory(equality)])).
% cnf(63,negated_conjecture,($false),inference(cn,[status(thm)],[62,theory(equality)])).
% cnf(64,negated_conjecture,($false),63,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 28
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 28
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 9
% # ...of the previous two non-trivial : 7
% # Contextual simplify-reflections : 0
% # Paramodulations : 9
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 13
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 8
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 4
% # Clause-clause subsumption calls (NU) : 4
% # Rec. Clause-clause subsumption calls : 4
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 13 leaves, 1.46+/-0.746 terms/leaf
% # Paramod-from index: 4 leaves, 1.25+/-0.433 terms/leaf
% # Paramod-into index: 12 leaves, 1.33+/-0.624 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.002 s
% # Total time : 0.014 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/SystemOnTPTP1994/SEU122+1.tptp
%
%------------------------------------------------------------------------------