TSTP Solution File: SEU143+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU143+2 : TPTP v5.0.0. Released v3.3.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 : Thu Dec 30 01:16:37 EST 2010
% Result : Theorem 1.03s
% Output : Solution 1.03s
% 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/SystemOnTPTP19680/SEU143+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19680/SEU143+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19680/SEU143+2.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 19776
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(8, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(9, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(18, axiom,?[X1]:empty(X1),file('/tmp/SRASS.s.p', rc1_xboole_0)).
% fof(33, axiom,![X1]:![X2]:![X3]:(X3=unordered_pair(X1,X2)<=>![X4]:(in(X4,X3)<=>(X4=X1|X4=X2))),file('/tmp/SRASS.s.p', d2_tarski)).
% fof(52, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(64, conjecture,![X1]:~(singleton(X1)=empty_set),file('/tmp/SRASS.s.p', l1_zfmisc_1)).
% fof(65, negated_conjecture,~(![X1]:~(singleton(X1)=empty_set)),inference(assume_negation,[status(cth)],[64])).
% fof(102, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[8])).
% cnf(103,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[102])).
% fof(104, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[9])).
% fof(105, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[104])).
% cnf(106,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[105])).
% fof(128, plain,?[X2]:empty(X2),inference(variable_rename,[status(thm)],[18])).
% fof(129, plain,empty(esk3_0),inference(skolemize,[status(esa)],[128])).
% cnf(130,plain,(empty(esk3_0)),inference(split_conjunct,[status(thm)],[129])).
% fof(175, plain,![X1]:![X2]:![X3]:((~(X3=unordered_pair(X1,X2))|![X4]:((~(in(X4,X3))|(X4=X1|X4=X2))&((~(X4=X1)&~(X4=X2))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(X4=X1)&~(X4=X2)))&(in(X4,X3)|(X4=X1|X4=X2)))|X3=unordered_pair(X1,X2))),inference(fof_nnf,[status(thm)],[33])).
% fof(176, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(X9=X5)&~(X9=X6)))&(in(X9,X7)|(X9=X5|X9=X6)))|X7=unordered_pair(X5,X6))),inference(variable_rename,[status(thm)],[175])).
% fof(177, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(((~(in(esk6_3(X5,X6,X7),X7))|(~(esk6_3(X5,X6,X7)=X5)&~(esk6_3(X5,X6,X7)=X6)))&(in(esk6_3(X5,X6,X7),X7)|(esk6_3(X5,X6,X7)=X5|esk6_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[176])).
% fof(178, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7)))|~(X7=unordered_pair(X5,X6)))&(((~(in(esk6_3(X5,X6,X7),X7))|(~(esk6_3(X5,X6,X7)=X5)&~(esk6_3(X5,X6,X7)=X6)))&(in(esk6_3(X5,X6,X7),X7)|(esk6_3(X5,X6,X7)=X5|esk6_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[177])).
% fof(179, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))|~(X7=unordered_pair(X5,X6)))&(((~(X8=X5)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))&((~(X8=X6)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))))&((((~(esk6_3(X5,X6,X7)=X5)|~(in(esk6_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk6_3(X5,X6,X7)=X6)|~(in(esk6_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk6_3(X5,X6,X7),X7)|(esk6_3(X5,X6,X7)=X5|esk6_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[178])).
% cnf(183,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X3),inference(split_conjunct,[status(thm)],[179])).
% fof(267, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[52])).
% fof(268, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[267])).
% cnf(269,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[268])).
% fof(299, negated_conjecture,?[X1]:singleton(X1)=empty_set,inference(fof_nnf,[status(thm)],[65])).
% fof(300, negated_conjecture,?[X2]:singleton(X2)=empty_set,inference(variable_rename,[status(thm)],[299])).
% fof(301, negated_conjecture,singleton(esk13_0)=empty_set,inference(skolemize,[status(esa)],[300])).
% cnf(302,negated_conjecture,(singleton(esk13_0)=empty_set),inference(split_conjunct,[status(thm)],[301])).
% cnf(303,negated_conjecture,(unordered_pair(esk13_0,esk13_0)=empty_set),inference(rw,[status(thm)],[302,103,theory(equality)]),['unfolding']).
% cnf(331,plain,(in(X1,X2)|unordered_pair(X3,X1)!=X2),inference(er,[status(thm)],[183,theory(equality)])).
% cnf(342,plain,(empty_set=esk3_0),inference(spm,[status(thm)],[106,130,theory(equality)])).
% cnf(403,plain,(in(X1,unordered_pair(X2,X1))),inference(er,[status(thm)],[331,theory(equality)])).
% cnf(1186,negated_conjecture,(unordered_pair(esk13_0,esk13_0)=esk3_0),inference(rw,[status(thm)],[303,342,theory(equality)])).
% cnf(1206,plain,(~empty(unordered_pair(X1,X2))),inference(spm,[status(thm)],[269,403,theory(equality)])).
% cnf(1233,negated_conjecture,(~empty(esk3_0)),inference(spm,[status(thm)],[1206,1186,theory(equality)])).
% cnf(1238,negated_conjecture,($false),inference(rw,[status(thm)],[1233,130,theory(equality)])).
% cnf(1239,negated_conjecture,($false),inference(cn,[status(thm)],[1238,theory(equality)])).
% cnf(1240,negated_conjecture,($false),1239,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 190
% # ...of these trivial : 1
% # ...subsumed : 7
% # ...remaining for further processing: 182
% # Other redundant clauses eliminated : 35
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 15
% # Generated clauses : 748
% # ...of the previous two non-trivial : 635
% # Contextual simplify-reflections : 0
% # Paramodulations : 687
% # Factorizations : 14
% # Equation resolutions : 47
% # Current number of processed clauses: 76
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 3
% # Non-unit-clauses : 58
% # Current number of unprocessed clauses: 430
% # ...number of literals in the above : 1486
% # Clause-clause subsumption calls (NU) : 238
% # Rec. Clause-clause subsumption calls : 220
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 4
% # Indexed BW rewrite attempts : 31
% # Indexed BW rewrite successes : 23
% # Backwards rewriting index: 48 leaves, 2.00+/-1.915 terms/leaf
% # Paramod-from index: 29 leaves, 1.48+/-0.771 terms/leaf
% # Paramod-into index: 47 leaves, 1.77+/-1.462 terms/leaf
% # -------------------------------------------------
% # User time : 0.044 s
% # System time : 0.005 s
% # Total time : 0.049 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.23 WC
% FINAL PrfWatch: 0.15 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP19680/SEU143+2.tptp
%
%------------------------------------------------------------------------------