TSTP Solution File: SEU141+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU141+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 : art07.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:15:31 EST 2010
% Result : Theorem 1.02s
% Output : Solution 1.02s
% 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/SystemOnTPTP18644/SEU141+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18644/SEU141+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18644/SEU141+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 18740
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(7, axiom,![X1]:![X2]:set_difference(X1,set_difference(X1,X2))=set_intersection2(X1,X2),file('/tmp/SRASS.s.p', t48_xboole_1)).
% fof(10, axiom,![X1]:![X2]:subset(set_difference(X1,X2),X1),file('/tmp/SRASS.s.p', t36_xboole_1)).
% fof(17, axiom,![X1]:![X2]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_r1_tarski)).
% fof(20, axiom,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', l32_xboole_1)).
% fof(23, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>set_intersection2(X1,X2)=empty_set),file('/tmp/SRASS.s.p', d7_xboole_0)).
% fof(24, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', d10_xboole_0)).
% fof(57, conjecture,![X1]:![X2]:(disjoint(X1,X2)<=>set_difference(X1,X2)=X1),file('/tmp/SRASS.s.p', t83_xboole_1)).
% fof(58, negated_conjecture,~(![X1]:![X2]:(disjoint(X1,X2)<=>set_difference(X1,X2)=X1)),inference(assume_negation,[status(cth)],[57])).
% fof(91, plain,![X3]:![X4]:set_difference(X3,set_difference(X3,X4))=set_intersection2(X3,X4),inference(variable_rename,[status(thm)],[7])).
% cnf(92,plain,(set_difference(X1,set_difference(X1,X2))=set_intersection2(X1,X2)),inference(split_conjunct,[status(thm)],[91])).
% fof(99, plain,![X3]:![X4]:subset(set_difference(X3,X4),X3),inference(variable_rename,[status(thm)],[10])).
% cnf(100,plain,(subset(set_difference(X1,X2),X1)),inference(split_conjunct,[status(thm)],[99])).
% fof(120, plain,![X3]:![X4]:subset(X3,X3),inference(variable_rename,[status(thm)],[17])).
% cnf(121,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[120])).
% fof(131, 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)],[20])).
% fof(132, 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)],[131])).
% cnf(133,plain,(set_difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[132])).
% cnf(134,plain,(subset(X1,X2)|set_difference(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[132])).
% fof(142, plain,![X1]:![X2]:((~(disjoint(X1,X2))|set_intersection2(X1,X2)=empty_set)&(~(set_intersection2(X1,X2)=empty_set)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[23])).
% fof(143, plain,![X3]:![X4]:((~(disjoint(X3,X4))|set_intersection2(X3,X4)=empty_set)&(~(set_intersection2(X3,X4)=empty_set)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[142])).
% cnf(144,plain,(disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[143])).
% cnf(145,plain,(set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[143])).
% fof(146, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[24])).
% fof(147, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[146])).
% fof(148, 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)],[147])).
% cnf(149,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[148])).
% fof(262, negated_conjecture,?[X1]:?[X2]:((~(disjoint(X1,X2))|~(set_difference(X1,X2)=X1))&(disjoint(X1,X2)|set_difference(X1,X2)=X1)),inference(fof_nnf,[status(thm)],[58])).
% fof(263, negated_conjecture,?[X3]:?[X4]:((~(disjoint(X3,X4))|~(set_difference(X3,X4)=X3))&(disjoint(X3,X4)|set_difference(X3,X4)=X3)),inference(variable_rename,[status(thm)],[262])).
% fof(264, negated_conjecture,((~(disjoint(esk11_0,esk12_0))|~(set_difference(esk11_0,esk12_0)=esk11_0))&(disjoint(esk11_0,esk12_0)|set_difference(esk11_0,esk12_0)=esk11_0)),inference(skolemize,[status(esa)],[263])).
% cnf(265,negated_conjecture,(set_difference(esk11_0,esk12_0)=esk11_0|disjoint(esk11_0,esk12_0)),inference(split_conjunct,[status(thm)],[264])).
% cnf(266,negated_conjecture,(set_difference(esk11_0,esk12_0)!=esk11_0|~disjoint(esk11_0,esk12_0)),inference(split_conjunct,[status(thm)],[264])).
% cnf(275,plain,(set_difference(X1,set_difference(X1,X2))=empty_set|~disjoint(X1,X2)),inference(rw,[status(thm)],[145,92,theory(equality)]),['unfolding']).
% cnf(276,plain,(disjoint(X1,X2)|set_difference(X1,set_difference(X1,X2))!=empty_set),inference(rw,[status(thm)],[144,92,theory(equality)]),['unfolding']).
% cnf(311,negated_conjecture,(set_difference(esk11_0,set_difference(esk11_0,esk12_0))=empty_set|set_difference(esk11_0,esk12_0)=esk11_0),inference(spm,[status(thm)],[275,265,theory(equality)])).
% cnf(312,negated_conjecture,(set_difference(esk11_0,esk12_0)!=esk11_0|set_difference(esk11_0,set_difference(esk11_0,esk12_0))!=empty_set),inference(spm,[status(thm)],[266,276,theory(equality)])).
% cnf(1179,negated_conjecture,(set_difference(esk11_0,esk12_0)!=esk11_0|~subset(esk11_0,set_difference(esk11_0,esk12_0))),inference(spm,[status(thm)],[312,133,theory(equality)])).
% cnf(1237,negated_conjecture,(subset(esk11_0,set_difference(esk11_0,esk12_0))|set_difference(esk11_0,esk12_0)=esk11_0),inference(spm,[status(thm)],[134,311,theory(equality)])).
% cnf(1356,negated_conjecture,(set_difference(esk11_0,esk12_0)=esk11_0|~subset(set_difference(esk11_0,esk12_0),esk11_0)),inference(spm,[status(thm)],[149,1237,theory(equality)])).
% cnf(1375,negated_conjecture,(set_difference(esk11_0,esk12_0)=esk11_0|$false),inference(rw,[status(thm)],[1356,100,theory(equality)])).
% cnf(1376,negated_conjecture,(set_difference(esk11_0,esk12_0)=esk11_0),inference(cn,[status(thm)],[1375,theory(equality)])).
% cnf(1403,negated_conjecture,($false|~subset(esk11_0,set_difference(esk11_0,esk12_0))),inference(rw,[status(thm)],[1179,1376,theory(equality)])).
% cnf(1404,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1403,1376,theory(equality)]),121,theory(equality)])).
% cnf(1405,negated_conjecture,($false),inference(cn,[status(thm)],[1404,theory(equality)])).
% cnf(1406,negated_conjecture,($false),1405,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 177
% # ...of these trivial : 1
% # ...subsumed : 11
% # ...remaining for further processing: 165
% # Other redundant clauses eliminated : 42
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 11
% # Generated clauses : 921
% # ...of the previous two non-trivial : 745
% # Contextual simplify-reflections : 2
% # Paramodulations : 862
% # Factorizations : 8
% # Equation resolutions : 51
% # Current number of processed clauses: 77
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 3
% # Non-unit-clauses : 56
% # Current number of unprocessed clauses: 594
% # ...number of literals in the above : 2106
% # Clause-clause subsumption calls (NU) : 216
% # Rec. Clause-clause subsumption calls : 202
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 27
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 50 leaves, 1.82+/-1.519 terms/leaf
% # Paramod-from index: 29 leaves, 1.38+/-0.665 terms/leaf
% # Paramod-into index: 45 leaves, 1.69+/-1.297 terms/leaf
% # -------------------------------------------------
% # User time : 0.045 s
% # System time : 0.006 s
% # Total time : 0.051 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.23 WC
% FINAL PrfWatch: 0.14 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP18644/SEU141+2.tptp
%
%------------------------------------------------------------------------------