TSTP Solution File: SEU230+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU230+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 : 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:17 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP22892/SEU230+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22892/SEU230+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22892/SEU230+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 22988
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(10, axiom,![X1]:![X2]:![X3]:(X3=set_union2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)|in(X4,X2)))),file('/tmp/SRASS.s.p', d2_xboole_0)).
% fof(11, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(14, axiom,![X1]:succ(X1)=set_union2(X1,singleton(X1)),file('/tmp/SRASS.s.p', d1_ordinal1)).
% fof(38, conjecture,![X1]:in(X1,succ(X1)),file('/tmp/SRASS.s.p', t10_ordinal1)).
% fof(39, negated_conjecture,~(![X1]:in(X1,succ(X1))),inference(assume_negation,[status(cth)],[38])).
% fof(70, plain,![X1]:![X2]:![X3]:((~(X3=set_union2(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)|in(X4,X2)))&((~(in(X4,X1))&~(in(X4,X2)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))&~(in(X4,X2))))&(in(X4,X3)|(in(X4,X1)|in(X4,X2))))|X3=set_union2(X1,X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(71, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))&~(in(X9,X6))))&(in(X9,X7)|(in(X9,X5)|in(X9,X6))))|X7=set_union2(X5,X6))),inference(variable_rename,[status(thm)],[70])).
% fof(72, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))&~(in(esk4_3(X5,X6,X7),X6))))&(in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(skolemize,[status(esa)],[71])).
% fof(73, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7)))|~(X7=set_union2(X5,X6)))&(((~(in(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))&~(in(esk4_3(X5,X6,X7),X6))))&(in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(shift_quantors,[status(thm)],[72])).
% fof(74, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))|~(X7=set_union2(X5,X6)))&(((~(in(X8,X5))|in(X8,X7))|~(X7=set_union2(X5,X6)))&((~(in(X8,X6))|in(X8,X7))|~(X7=set_union2(X5,X6)))))&((((~(in(esk4_3(X5,X6,X7),X5))|~(in(esk4_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6))&((~(in(esk4_3(X5,X6,X7),X6))|~(in(esk4_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6)))&((in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X6)))|X7=set_union2(X5,X6)))),inference(distribute,[status(thm)],[73])).
% cnf(78,plain,(in(X4,X1)|X1!=set_union2(X2,X3)|~in(X4,X3)),inference(split_conjunct,[status(thm)],[74])).
% fof(81, plain,![X1]:![X2]:((~(X2=singleton(X1))|![X3]:((~(in(X3,X2))|X3=X1)&(~(X3=X1)|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(X3=X1))&(in(X3,X2)|X3=X1))|X2=singleton(X1))),inference(fof_nnf,[status(thm)],[11])).
% fof(82, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(X7=X4))&(in(X7,X5)|X7=X4))|X5=singleton(X4))),inference(variable_rename,[status(thm)],[81])).
% fof(83, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk5_2(X4,X5),X5))|~(esk5_2(X4,X5)=X4))&(in(esk5_2(X4,X5),X5)|esk5_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[82])).
% fof(84, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk5_2(X4,X5),X5))|~(esk5_2(X4,X5)=X4))&(in(esk5_2(X4,X5),X5)|esk5_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[83])).
% fof(85, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk5_2(X4,X5),X5))|~(esk5_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk5_2(X4,X5),X5)|esk5_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[84])).
% cnf(88,plain,(in(X3,X1)|X1!=singleton(X2)|X3!=X2),inference(split_conjunct,[status(thm)],[85])).
% fof(95, plain,![X2]:succ(X2)=set_union2(X2,singleton(X2)),inference(variable_rename,[status(thm)],[14])).
% cnf(96,plain,(succ(X1)=set_union2(X1,singleton(X1))),inference(split_conjunct,[status(thm)],[95])).
% fof(166, negated_conjecture,?[X1]:~(in(X1,succ(X1))),inference(fof_nnf,[status(thm)],[39])).
% fof(167, negated_conjecture,?[X2]:~(in(X2,succ(X2))),inference(variable_rename,[status(thm)],[166])).
% fof(168, negated_conjecture,~(in(esk13_0,succ(esk13_0))),inference(skolemize,[status(esa)],[167])).
% cnf(169,negated_conjecture,(~in(esk13_0,succ(esk13_0))),inference(split_conjunct,[status(thm)],[168])).
% cnf(171,negated_conjecture,(~in(esk13_0,set_union2(esk13_0,singleton(esk13_0)))),inference(rw,[status(thm)],[169,96,theory(equality)]),['unfolding']).
% cnf(175,plain,(in(X1,X2)|singleton(X1)!=X2),inference(er,[status(thm)],[88,theory(equality)])).
% cnf(186,plain,(in(X1,singleton(X1))),inference(er,[status(thm)],[175,theory(equality)])).
% cnf(209,plain,(in(X1,set_union2(X2,X3))|~in(X1,X3)),inference(er,[status(thm)],[78,theory(equality)])).
% cnf(292,negated_conjecture,(~in(esk13_0,singleton(esk13_0))),inference(spm,[status(thm)],[171,209,theory(equality)])).
% cnf(305,negated_conjecture,($false),inference(rw,[status(thm)],[292,186,theory(equality)])).
% cnf(306,negated_conjecture,($false),inference(cn,[status(thm)],[305,theory(equality)])).
% cnf(307,negated_conjecture,($false),306,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 125
% # ...of these trivial : 4
% # ...subsumed : 7
% # ...remaining for further processing: 114
% # Other redundant clauses eliminated : 10
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 106
% # ...of the previous two non-trivial : 58
% # Contextual simplify-reflections : 2
% # Paramodulations : 85
% # Factorizations : 6
% # Equation resolutions : 15
% # Current number of processed clauses: 57
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 6
% # Non-unit-clauses : 27
% # Current number of unprocessed clauses: 33
% # ...number of literals in the above : 116
% # Clause-clause subsumption calls (NU) : 61
% # Rec. Clause-clause subsumption calls : 61
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 29
% # Indexed BW rewrite successes : 23
% # Backwards rewriting index: 59 leaves, 1.27+/-0.880 terms/leaf
% # Paramod-from index: 32 leaves, 1.12+/-0.484 terms/leaf
% # Paramod-into index: 58 leaves, 1.22+/-0.767 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.004 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP22892/SEU230+1.tptp
%
%------------------------------------------------------------------------------