TSTP Solution File: SEU146+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU146+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 : 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:17:47 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP27734/SEU146+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP27734/SEU146+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27734/SEU146+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 27830
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', d10_xboole_0)).
% fof(2, axiom,![X1]:![X2]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_r1_tarski)).
% fof(3, axiom,![X1]:subset(empty_set,X1),file('/tmp/SRASS.s.p', t2_xboole_1)).
% fof(4, axiom,![X1]:(subset(X1,empty_set)=>X1=empty_set),file('/tmp/SRASS.s.p', t3_xboole_1)).
% fof(5, axiom,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t37_xboole_1)).
% fof(6, axiom,![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2)),file('/tmp/SRASS.s.p', l2_zfmisc_1)).
% fof(11, axiom,![X1]:![X2]:![X3]:(subset(X1,X2)=>(in(X3,X1)|subset(X1,set_difference(X2,singleton(X3))))),file('/tmp/SRASS.s.p', l3_zfmisc_1)).
% fof(15, conjecture,![X1]:![X2]:(subset(X1,singleton(X2))<=>(X1=empty_set|X1=singleton(X2))),file('/tmp/SRASS.s.p', l4_zfmisc_1)).
% fof(16, negated_conjecture,~(![X1]:![X2]:(subset(X1,singleton(X2))<=>(X1=empty_set|X1=singleton(X2)))),inference(assume_negation,[status(cth)],[15])).
% fof(19, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(20, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[19])).
% fof(21, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[20])).
% cnf(22,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[21])).
% fof(25, plain,![X3]:![X4]:subset(X3,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(26,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X2]:subset(empty_set,X2),inference(variable_rename,[status(thm)],[3])).
% cnf(28,plain,(subset(empty_set,X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X1]:(~(subset(X1,empty_set))|X1=empty_set),inference(fof_nnf,[status(thm)],[4])).
% fof(30, plain,![X2]:(~(subset(X2,empty_set))|X2=empty_set),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(X1=empty_set|~subset(X1,empty_set)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, 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)],[5])).
% fof(33, 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)],[32])).
% cnf(34,plain,(set_difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[33])).
% fof(36, plain,![X1]:![X2]:((~(subset(singleton(X1),X2))|in(X1,X2))&(~(in(X1,X2))|subset(singleton(X1),X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(37, plain,![X3]:![X4]:((~(subset(singleton(X3),X4))|in(X3,X4))&(~(in(X3,X4))|subset(singleton(X3),X4))),inference(variable_rename,[status(thm)],[36])).
% cnf(38,plain,(subset(singleton(X1),X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[37])).
% fof(50, plain,![X1]:![X2]:![X3]:(~(subset(X1,X2))|(in(X3,X1)|subset(X1,set_difference(X2,singleton(X3))))),inference(fof_nnf,[status(thm)],[11])).
% fof(51, plain,![X4]:![X5]:![X6]:(~(subset(X4,X5))|(in(X6,X4)|subset(X4,set_difference(X5,singleton(X6))))),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(subset(X1,set_difference(X2,singleton(X3)))|in(X3,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[51])).
% fof(56, negated_conjecture,?[X1]:?[X2]:((~(subset(X1,singleton(X2)))|(~(X1=empty_set)&~(X1=singleton(X2))))&(subset(X1,singleton(X2))|(X1=empty_set|X1=singleton(X2)))),inference(fof_nnf,[status(thm)],[16])).
% fof(57, negated_conjecture,?[X3]:?[X4]:((~(subset(X3,singleton(X4)))|(~(X3=empty_set)&~(X3=singleton(X4))))&(subset(X3,singleton(X4))|(X3=empty_set|X3=singleton(X4)))),inference(variable_rename,[status(thm)],[56])).
% fof(58, negated_conjecture,((~(subset(esk3_0,singleton(esk4_0)))|(~(esk3_0=empty_set)&~(esk3_0=singleton(esk4_0))))&(subset(esk3_0,singleton(esk4_0))|(esk3_0=empty_set|esk3_0=singleton(esk4_0)))),inference(skolemize,[status(esa)],[57])).
% fof(59, negated_conjecture,(((~(esk3_0=empty_set)|~(subset(esk3_0,singleton(esk4_0))))&(~(esk3_0=singleton(esk4_0))|~(subset(esk3_0,singleton(esk4_0)))))&(subset(esk3_0,singleton(esk4_0))|(esk3_0=empty_set|esk3_0=singleton(esk4_0)))),inference(distribute,[status(thm)],[58])).
% cnf(60,negated_conjecture,(esk3_0=singleton(esk4_0)|esk3_0=empty_set|subset(esk3_0,singleton(esk4_0))),inference(split_conjunct,[status(thm)],[59])).
% cnf(61,negated_conjecture,(~subset(esk3_0,singleton(esk4_0))|esk3_0!=singleton(esk4_0)),inference(split_conjunct,[status(thm)],[59])).
% cnf(62,negated_conjecture,(~subset(esk3_0,singleton(esk4_0))|esk3_0!=empty_set),inference(split_conjunct,[status(thm)],[59])).
% cnf(72,negated_conjecture,(singleton(esk4_0)=esk3_0|esk3_0=empty_set|~subset(singleton(esk4_0),esk3_0)),inference(spm,[status(thm)],[22,60,theory(equality)])).
% cnf(75,plain,(in(X1,X2)|subset(X2,empty_set)|~subset(X2,X3)|~subset(X3,singleton(X1))),inference(spm,[status(thm)],[52,34,theory(equality)])).
% cnf(83,negated_conjecture,(in(esk4_0,X1)|subset(X1,empty_set)|singleton(esk4_0)=esk3_0|esk3_0=empty_set|~subset(X1,esk3_0)),inference(spm,[status(thm)],[75,60,theory(equality)])).
% cnf(87,negated_conjecture,(subset(singleton(esk4_0),X1)|singleton(esk4_0)=esk3_0|esk3_0=empty_set|subset(X1,empty_set)|~subset(X1,esk3_0)),inference(spm,[status(thm)],[38,83,theory(equality)])).
% cnf(97,negated_conjecture,(singleton(esk4_0)=esk3_0|esk3_0=empty_set|subset(esk3_0,empty_set)|~subset(esk3_0,esk3_0)),inference(spm,[status(thm)],[72,87,theory(equality)])).
% cnf(102,negated_conjecture,(singleton(esk4_0)=esk3_0|esk3_0=empty_set|subset(esk3_0,empty_set)|$false),inference(rw,[status(thm)],[97,26,theory(equality)])).
% cnf(103,negated_conjecture,(singleton(esk4_0)=esk3_0|esk3_0=empty_set|subset(esk3_0,empty_set)),inference(cn,[status(thm)],[102,theory(equality)])).
% cnf(104,negated_conjecture,(singleton(esk4_0)=esk3_0|esk3_0=empty_set),inference(csr,[status(thm)],[103,31])).
% cnf(112,negated_conjecture,(esk3_0=empty_set|~subset(esk3_0,esk3_0)),inference(spm,[status(thm)],[61,104,theory(equality)])).
% cnf(115,negated_conjecture,(esk3_0=empty_set|$false),inference(rw,[status(thm)],[112,26,theory(equality)])).
% cnf(116,negated_conjecture,(esk3_0=empty_set),inference(cn,[status(thm)],[115,theory(equality)])).
% cnf(122,negated_conjecture,($false|~subset(esk3_0,singleton(esk4_0))),inference(rw,[status(thm)],[62,116,theory(equality)])).
% cnf(123,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[122,116,theory(equality)]),28,theory(equality)])).
% cnf(124,negated_conjecture,($false),inference(cn,[status(thm)],[123,theory(equality)])).
% cnf(125,negated_conjecture,($false),124,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 31
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 30
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 3
% # Generated clauses : 40
% # ...of the previous two non-trivial : 32
% # Contextual simplify-reflections : 1
% # Paramodulations : 38
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 20
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 13
% # Current number of unprocessed clauses: 8
% # ...number of literals in the above : 25
% # Clause-clause subsumption calls (NU) : 63
% # Rec. Clause-clause subsumption calls : 38
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 24 leaves, 1.46+/-0.957 terms/leaf
% # Paramod-from index: 8 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 22 leaves, 1.14+/-0.343 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.002 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP27734/SEU146+1.tptp
%
%------------------------------------------------------------------------------