TSTP Solution File: SEU230+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU230+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 : 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 : Thu Dec 30 02:08:42 EST 2010
% Result : Theorem 3.69s
% Output : Solution 3.69s
% 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/SystemOnTPTP23151/SEU230+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23151/SEU230+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23151/SEU230+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 23247
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.058 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(18, axiom,![X1]:![X2]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(35, axiom,![X1]:![X2]:![X3]:(subset(unordered_pair(X1,X2),X3)<=>(in(X1,X3)&in(X2,X3))),file('/tmp/SRASS.s.p', t38_zfmisc_1)).
% fof(41, axiom,![X1]:succ(X1)=set_union2(X1,singleton(X1)),file('/tmp/SRASS.s.p', d1_ordinal1)).
% fof(83, axiom,![X1]:![X2]:subset(X1,set_union2(X1,X2)),file('/tmp/SRASS.s.p', t7_xboole_1)).
% fof(145, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(255, conjecture,![X1]:in(X1,succ(X1)),file('/tmp/SRASS.s.p', t10_ordinal1)).
% fof(256, negated_conjecture,~(![X1]:in(X1,succ(X1))),inference(assume_negation,[status(cth)],[255])).
% fof(350, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[18])).
% cnf(351,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[350])).
% fof(409, plain,![X1]:![X2]:![X3]:((~(subset(unordered_pair(X1,X2),X3))|(in(X1,X3)&in(X2,X3)))&((~(in(X1,X3))|~(in(X2,X3)))|subset(unordered_pair(X1,X2),X3))),inference(fof_nnf,[status(thm)],[35])).
% fof(410, plain,![X4]:![X5]:![X6]:((~(subset(unordered_pair(X4,X5),X6))|(in(X4,X6)&in(X5,X6)))&((~(in(X4,X6))|~(in(X5,X6)))|subset(unordered_pair(X4,X5),X6))),inference(variable_rename,[status(thm)],[409])).
% fof(411, plain,![X4]:![X5]:![X6]:(((in(X4,X6)|~(subset(unordered_pair(X4,X5),X6)))&(in(X5,X6)|~(subset(unordered_pair(X4,X5),X6))))&((~(in(X4,X6))|~(in(X5,X6)))|subset(unordered_pair(X4,X5),X6))),inference(distribute,[status(thm)],[410])).
% cnf(413,plain,(in(X2,X3)|~subset(unordered_pair(X1,X2),X3)),inference(split_conjunct,[status(thm)],[411])).
% fof(440, plain,![X2]:succ(X2)=set_union2(X2,singleton(X2)),inference(variable_rename,[status(thm)],[41])).
% cnf(441,plain,(succ(X1)=set_union2(X1,singleton(X1))),inference(split_conjunct,[status(thm)],[440])).
% fof(659, plain,![X3]:![X4]:subset(X3,set_union2(X3,X4)),inference(variable_rename,[status(thm)],[83])).
% cnf(660,plain,(subset(X1,set_union2(X1,X2))),inference(split_conjunct,[status(thm)],[659])).
% fof(943, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[145])).
% cnf(944,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[943])).
% fof(1380, negated_conjecture,?[X1]:~(in(X1,succ(X1))),inference(fof_nnf,[status(thm)],[256])).
% fof(1381, negated_conjecture,?[X2]:~(in(X2,succ(X2))),inference(variable_rename,[status(thm)],[1380])).
% fof(1382, negated_conjecture,~(in(esk90_0,succ(esk90_0))),inference(skolemize,[status(esa)],[1381])).
% cnf(1383,negated_conjecture,(~in(esk90_0,succ(esk90_0))),inference(split_conjunct,[status(thm)],[1382])).
% cnf(1388,plain,(set_union2(X1,unordered_pair(X1,X1))=succ(X1)),inference(rw,[status(thm)],[441,944,theory(equality)]),['unfolding']).
% cnf(1417,negated_conjecture,(~in(esk90_0,set_union2(esk90_0,unordered_pair(esk90_0,esk90_0)))),inference(rw,[status(thm)],[1383,1388,theory(equality)]),['unfolding']).
% cnf(1720,plain,(subset(X1,set_union2(X2,X1))),inference(spm,[status(thm)],[660,351,theory(equality)])).
% cnf(10713,plain,(in(X1,set_union2(X2,unordered_pair(X3,X1)))),inference(spm,[status(thm)],[413,1720,theory(equality)])).
% cnf(10796,negated_conjecture,($false),inference(rw,[status(thm)],[1417,10713,theory(equality)])).
% cnf(10797,negated_conjecture,($false),inference(cn,[status(thm)],[10796,theory(equality)])).
% cnf(10798,negated_conjecture,($false),10797,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1367
% # ...of these trivial : 18
% # ...subsumed : 334
% # ...remaining for further processing: 1015
% # Other redundant clauses eliminated : 91
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 17
% # Generated clauses : 8098
% # ...of the previous two non-trivial : 7611
% # Contextual simplify-reflections : 22
% # Paramodulations : 7953
% # Factorizations : 14
% # Equation resolutions : 131
% # Current number of processed clauses: 561
% # Positive orientable unit clauses: 69
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 76
% # Non-unit-clauses : 413
% # Current number of unprocessed clauses: 6896
% # ...number of literals in the above : 32675
% # Clause-clause subsumption calls (NU) : 11881
% # Rec. Clause-clause subsumption calls : 3283
% # Unit Clause-clause subsumption calls : 1675
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 77
% # Indexed BW rewrite successes : 58
% # Backwards rewriting index: 564 leaves, 1.63+/-2.708 terms/leaf
% # Paramod-from index: 225 leaves, 1.18+/-1.130 terms/leaf
% # Paramod-into index: 508 leaves, 1.49+/-2.184 terms/leaf
% # -------------------------------------------------
% # User time : 0.474 s
% # System time : 0.016 s
% # Total time : 0.490 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.80 CPU 0.92 WC
% FINAL PrfWatch: 0.80 CPU 0.92 WC
% SZS output end Solution for /tmp/SystemOnTPTP23151/SEU230+2.tptp
%
%------------------------------------------------------------------------------