TSTP Solution File: SET902+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET902+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 00:17:18 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP31656/SET902+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31656/SET902+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31656/SET902+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 31752
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(2, axiom,![X1]:![X2]:set_union2(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence_k2_xboole_0)).
% fof(3, axiom,![X1]:~(singleton(X1)=empty_set),file('/tmp/SRASS.s.p', l1_zfmisc_1)).
% fof(4, axiom,![X1]:![X2]:(subset(X1,singleton(X2))<=>(X1=empty_set|X1=singleton(X2))),file('/tmp/SRASS.s.p', l4_zfmisc_1)).
% fof(11, axiom,![X1]:![X2]:subset(X1,set_union2(X1,X2)),file('/tmp/SRASS.s.p', t7_xboole_1)).
% fof(12, conjecture,![X1]:![X2]:![X3]:~((((singleton(X1)=set_union2(X2,X3)&~((X2=singleton(X1)&X3=singleton(X1))))&~((X2=empty_set&X3=singleton(X1))))&~((X2=singleton(X1)&X3=empty_set)))),file('/tmp/SRASS.s.p', t43_zfmisc_1)).
% fof(13, negated_conjecture,~(![X1]:![X2]:![X3]:~((((singleton(X1)=set_union2(X2,X3)&~((X2=singleton(X1)&X3=singleton(X1))))&~((X2=empty_set&X3=singleton(X1))))&~((X2=singleton(X1)&X3=empty_set))))),inference(assume_negation,[status(cth)],[12])).
% fof(17, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(18,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,![X3]:![X4]:set_union2(X3,X3)=X3,inference(variable_rename,[status(thm)],[2])).
% cnf(20,plain,(set_union2(X1,X1)=X1),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X2]:~(singleton(X2)=empty_set),inference(variable_rename,[status(thm)],[3])).
% cnf(22,plain,(singleton(X1)!=empty_set),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X1]:![X2]:((~(subset(X1,singleton(X2)))|(X1=empty_set|X1=singleton(X2)))&((~(X1=empty_set)&~(X1=singleton(X2)))|subset(X1,singleton(X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(24, plain,![X3]:![X4]:((~(subset(X3,singleton(X4)))|(X3=empty_set|X3=singleton(X4)))&((~(X3=empty_set)&~(X3=singleton(X4)))|subset(X3,singleton(X4)))),inference(variable_rename,[status(thm)],[23])).
% fof(25, plain,![X3]:![X4]:((~(subset(X3,singleton(X4)))|(X3=empty_set|X3=singleton(X4)))&((~(X3=empty_set)|subset(X3,singleton(X4)))&(~(X3=singleton(X4))|subset(X3,singleton(X4))))),inference(distribute,[status(thm)],[24])).
% cnf(28,plain,(X1=singleton(X2)|X1=empty_set|~subset(X1,singleton(X2))),inference(split_conjunct,[status(thm)],[25])).
% fof(44, plain,![X3]:![X4]:subset(X3,set_union2(X3,X4)),inference(variable_rename,[status(thm)],[11])).
% cnf(45,plain,(subset(X1,set_union2(X1,X2))),inference(split_conjunct,[status(thm)],[44])).
% fof(46, negated_conjecture,?[X1]:?[X2]:?[X3]:(((singleton(X1)=set_union2(X2,X3)&(~(X2=singleton(X1))|~(X3=singleton(X1))))&(~(X2=empty_set)|~(X3=singleton(X1))))&(~(X2=singleton(X1))|~(X3=empty_set))),inference(fof_nnf,[status(thm)],[13])).
% fof(47, negated_conjecture,?[X4]:?[X5]:?[X6]:(((singleton(X4)=set_union2(X5,X6)&(~(X5=singleton(X4))|~(X6=singleton(X4))))&(~(X5=empty_set)|~(X6=singleton(X4))))&(~(X5=singleton(X4))|~(X6=empty_set))),inference(variable_rename,[status(thm)],[46])).
% fof(48, negated_conjecture,(((singleton(esk3_0)=set_union2(esk4_0,esk5_0)&(~(esk4_0=singleton(esk3_0))|~(esk5_0=singleton(esk3_0))))&(~(esk4_0=empty_set)|~(esk5_0=singleton(esk3_0))))&(~(esk4_0=singleton(esk3_0))|~(esk5_0=empty_set))),inference(skolemize,[status(esa)],[47])).
% cnf(49,negated_conjecture,(esk5_0!=empty_set|esk4_0!=singleton(esk3_0)),inference(split_conjunct,[status(thm)],[48])).
% cnf(50,negated_conjecture,(esk5_0!=singleton(esk3_0)|esk4_0!=empty_set),inference(split_conjunct,[status(thm)],[48])).
% cnf(51,negated_conjecture,(esk5_0!=singleton(esk3_0)|esk4_0!=singleton(esk3_0)),inference(split_conjunct,[status(thm)],[48])).
% cnf(52,negated_conjecture,(singleton(esk3_0)=set_union2(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[48])).
% cnf(58,negated_conjecture,(subset(esk4_0,singleton(esk3_0))),inference(spm,[status(thm)],[45,52,theory(equality)])).
% cnf(64,plain,(subset(X1,set_union2(X2,X1))),inference(spm,[status(thm)],[45,18,theory(equality)])).
% cnf(73,negated_conjecture,(singleton(esk3_0)=esk4_0|empty_set=esk4_0),inference(spm,[status(thm)],[28,58,theory(equality)])).
% cnf(77,negated_conjecture,(esk4_0=empty_set|esk4_0!=esk5_0),inference(spm,[status(thm)],[51,73,theory(equality)])).
% cnf(83,negated_conjecture,(subset(esk5_0,singleton(esk3_0))),inference(spm,[status(thm)],[64,52,theory(equality)])).
% cnf(90,negated_conjecture,(singleton(esk3_0)=esk5_0|empty_set=esk5_0),inference(spm,[status(thm)],[28,83,theory(equality)])).
% cnf(100,negated_conjecture,(esk5_0=esk4_0|esk4_0=empty_set|esk5_0=empty_set),inference(spm,[status(thm)],[73,90,theory(equality)])).
% cnf(103,negated_conjecture,(esk5_0=empty_set|esk4_0=empty_set),inference(csr,[status(thm)],[100,77])).
% cnf(104,negated_conjecture,(esk4_0=empty_set|singleton(esk3_0)!=esk4_0),inference(spm,[status(thm)],[49,103,theory(equality)])).
% cnf(110,negated_conjecture,(esk4_0=empty_set),inference(csr,[status(thm)],[104,73])).
% cnf(127,negated_conjecture,(set_union2(empty_set,esk5_0)=singleton(esk3_0)),inference(rw,[status(thm)],[52,110,theory(equality)])).
% cnf(130,negated_conjecture,(singleton(esk3_0)!=esk5_0|$false),inference(rw,[status(thm)],[50,110,theory(equality)])).
% cnf(131,negated_conjecture,(singleton(esk3_0)!=esk5_0),inference(cn,[status(thm)],[130,theory(equality)])).
% cnf(142,negated_conjecture,(esk5_0=empty_set),inference(sr,[status(thm)],[90,131,theory(equality)])).
% cnf(154,negated_conjecture,(empty_set=singleton(esk3_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[127,142,theory(equality)]),20,theory(equality)])).
% cnf(155,negated_conjecture,($false),inference(sr,[status(thm)],[154,22,theory(equality)])).
% cnf(156,negated_conjecture,($false),155,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 46
% # ...of these trivial : 1
% # ...subsumed : 6
% # ...remaining for further processing: 39
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 21
% # Generated clauses : 52
% # ...of the previous two non-trivial : 36
% # Contextual simplify-reflections : 2
% # Paramodulations : 48
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 17
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 5
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 4
% # Clause-clause subsumption calls (NU) : 17
% # Rec. Clause-clause subsumption calls : 16
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 17 leaves, 1.35+/-0.588 terms/leaf
% # Paramod-from index: 8 leaves, 1.38+/-0.696 terms/leaf
% # Paramod-into index: 15 leaves, 1.33+/-0.596 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.005 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.18 WC
% FINAL PrfWatch: 0.12 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP31656/SET902+1.tptp
%
%------------------------------------------------------------------------------