TSTP Solution File: SEU152+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU152+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 : art03.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:19:43 EST 2010
% Result : Theorem 1.14s
% Output : Solution 1.14s
% 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/SystemOnTPTP29546/SEU152+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29546/SEU152+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29546/SEU152+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 29644
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(7, axiom,![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2)),file('/tmp/SRASS.s.p', l2_zfmisc_1)).
% fof(11, axiom,![X1]:set_union2(X1,empty_set)=X1,file('/tmp/SRASS.s.p', t1_boole)).
% fof(13, axiom,![X1]:![X2]:set_union2(X1,set_difference(X2,X1))=set_union2(X1,X2),file('/tmp/SRASS.s.p', t39_xboole_1)).
% fof(17, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(63, axiom,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', l32_xboole_1)).
% fof(75, conjecture,![X1]:![X2]:(in(X1,X2)=>set_union2(singleton(X1),X2)=X2),file('/tmp/SRASS.s.p', l23_zfmisc_1)).
% fof(76, negated_conjecture,~(![X1]:![X2]:(in(X1,X2)=>set_union2(singleton(X1),X2)=X2)),inference(assume_negation,[status(cth)],[75])).
% fof(90, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(91,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[90])).
% fof(120, plain,![X1]:![X2]:((~(subset(singleton(X1),X2))|in(X1,X2))&(~(in(X1,X2))|subset(singleton(X1),X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(121, plain,![X3]:![X4]:((~(subset(singleton(X3),X4))|in(X3,X4))&(~(in(X3,X4))|subset(singleton(X3),X4))),inference(variable_rename,[status(thm)],[120])).
% cnf(122,plain,(subset(singleton(X1),X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[121])).
% fof(132, plain,![X2]:set_union2(X2,empty_set)=X2,inference(variable_rename,[status(thm)],[11])).
% cnf(133,plain,(set_union2(X1,empty_set)=X1),inference(split_conjunct,[status(thm)],[132])).
% fof(140, plain,![X3]:![X4]:set_union2(X3,set_difference(X4,X3))=set_union2(X3,X4),inference(variable_rename,[status(thm)],[13])).
% cnf(141,plain,(set_union2(X1,set_difference(X2,X1))=set_union2(X1,X2)),inference(split_conjunct,[status(thm)],[140])).
% fof(166, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[17])).
% cnf(167,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[166])).
% fof(325, plain,![X1]:![X2]:((~(set_difference(X1,X2)=empty_set)|subset(X1,X2))&(~(subset(X1,X2))|set_difference(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[63])).
% fof(326, plain,![X3]:![X4]:((~(set_difference(X3,X4)=empty_set)|subset(X3,X4))&(~(subset(X3,X4))|set_difference(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[325])).
% cnf(327,plain,(set_difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[326])).
% fof(348, negated_conjecture,?[X1]:?[X2]:(in(X1,X2)&~(set_union2(singleton(X1),X2)=X2)),inference(fof_nnf,[status(thm)],[76])).
% fof(349, negated_conjecture,?[X3]:?[X4]:(in(X3,X4)&~(set_union2(singleton(X3),X4)=X4)),inference(variable_rename,[status(thm)],[348])).
% fof(350, negated_conjecture,(in(esk14_0,esk15_0)&~(set_union2(singleton(esk14_0),esk15_0)=esk15_0)),inference(skolemize,[status(esa)],[349])).
% cnf(351,negated_conjecture,(set_union2(singleton(esk14_0),esk15_0)!=esk15_0),inference(split_conjunct,[status(thm)],[350])).
% cnf(352,negated_conjecture,(in(esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[350])).
% cnf(361,plain,(subset(unordered_pair(X1,X1),X2)|~in(X1,X2)),inference(rw,[status(thm)],[122,167,theory(equality)]),['unfolding']).
% cnf(368,negated_conjecture,(set_union2(unordered_pair(esk14_0,esk14_0),esk15_0)!=esk15_0),inference(rw,[status(thm)],[351,167,theory(equality)]),['unfolding']).
% cnf(523,negated_conjecture,(subset(unordered_pair(esk14_0,esk14_0),esk15_0)),inference(spm,[status(thm)],[361,352,theory(equality)])).
% cnf(1536,negated_conjecture,(set_difference(unordered_pair(esk14_0,esk14_0),esk15_0)=empty_set),inference(spm,[status(thm)],[327,523,theory(equality)])).
% cnf(1570,negated_conjecture,(set_union2(esk15_0,empty_set)=set_union2(esk15_0,unordered_pair(esk14_0,esk14_0))),inference(spm,[status(thm)],[141,1536,theory(equality)])).
% cnf(1600,negated_conjecture,(esk15_0=set_union2(esk15_0,unordered_pair(esk14_0,esk14_0))),inference(rw,[status(thm)],[1570,133,theory(equality)])).
% cnf(1619,negated_conjecture,(set_union2(unordered_pair(esk14_0,esk14_0),esk15_0)=esk15_0),inference(rw,[status(thm)],[1600,91,theory(equality)])).
% cnf(1620,negated_conjecture,($false),inference(sr,[status(thm)],[1619,368,theory(equality)])).
% cnf(1621,negated_conjecture,($false),1620,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 239
% # ...of these trivial : 3
% # ...subsumed : 13
% # ...remaining for further processing: 223
% # Other redundant clauses eliminated : 41
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 1056
% # ...of the previous two non-trivial : 903
% # Contextual simplify-reflections : 0
% # Paramodulations : 990
% # Factorizations : 10
% # Equation resolutions : 56
% # Current number of processed clauses: 113
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 9
% # Non-unit-clauses : 79
% # Current number of unprocessed clauses: 876
% # ...number of literals in the above : 3092
% # Clause-clause subsumption calls (NU) : 275
% # Rec. Clause-clause subsumption calls : 257
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 4
% # Indexed BW rewrite attempts : 41
% # Indexed BW rewrite successes : 30
% # Backwards rewriting index: 73 leaves, 1.77+/-1.794 terms/leaf
% # Paramod-from index: 42 leaves, 1.36+/-0.684 terms/leaf
% # Paramod-into index: 68 leaves, 1.65+/-1.503 terms/leaf
% # -------------------------------------------------
% # User time : 0.057 s
% # System time : 0.004 s
% # Total time : 0.061 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.26 WC
% FINAL PrfWatch: 0.18 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP29546/SEU152+2.tptp
%
%------------------------------------------------------------------------------