TSTP Solution File: SEU167+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU167+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 : art04.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:23:58 EST 2010
% Result : Theorem 1.35s
% Output : Solution 1.35s
% 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/SystemOnTPTP21429/SEU167+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21429/SEU167+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21429/SEU167+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 21525
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.025 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:(subset(X1,X2)=>(subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))&subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2)))),file('/tmp/SRASS.s.p', t118_zfmisc_1)).
% fof(3, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3)),file('/tmp/SRASS.s.p', t1_xboole_1)).
% fof(43, axiom,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', l32_xboole_1)).
% fof(97, conjecture,![X1]:![X2]:![X3]:![X4]:((subset(X1,X2)&subset(X3,X4))=>subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4))),file('/tmp/SRASS.s.p', t119_zfmisc_1)).
% fof(98, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:((subset(X1,X2)&subset(X3,X4))=>subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)))),inference(assume_negation,[status(cth)],[97])).
% fof(114, plain,![X1]:![X2]:![X3]:(~(subset(X1,X2))|(subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))&subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(115, plain,![X4]:![X5]:![X6]:(~(subset(X4,X5))|(subset(cartesian_product2(X4,X6),cartesian_product2(X5,X6))&subset(cartesian_product2(X6,X4),cartesian_product2(X6,X5)))),inference(variable_rename,[status(thm)],[114])).
% fof(116, plain,![X4]:![X5]:![X6]:((subset(cartesian_product2(X4,X6),cartesian_product2(X5,X6))|~(subset(X4,X5)))&(subset(cartesian_product2(X6,X4),cartesian_product2(X6,X5))|~(subset(X4,X5)))),inference(distribute,[status(thm)],[115])).
% cnf(117,plain,(subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[116])).
% cnf(118,plain,(subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[116])).
% fof(119, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X2,X3)))|subset(X1,X3)),inference(fof_nnf,[status(thm)],[3])).
% fof(120, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X5,X6)))|subset(X4,X6)),inference(variable_rename,[status(thm)],[119])).
% cnf(121,plain,(subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[120])).
% fof(281, 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)],[43])).
% fof(282, 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)],[281])).
% cnf(283,plain,(set_difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[282])).
% cnf(284,plain,(subset(X1,X2)|set_difference(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[282])).
% fof(466, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((subset(X1,X2)&subset(X3,X4))&~(subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)))),inference(fof_nnf,[status(thm)],[98])).
% fof(467, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((subset(X5,X6)&subset(X7,X8))&~(subset(cartesian_product2(X5,X7),cartesian_product2(X6,X8)))),inference(variable_rename,[status(thm)],[466])).
% fof(468, negated_conjecture,((subset(esk22_0,esk23_0)&subset(esk24_0,esk25_0))&~(subset(cartesian_product2(esk22_0,esk24_0),cartesian_product2(esk23_0,esk25_0)))),inference(skolemize,[status(esa)],[467])).
% cnf(469,negated_conjecture,(~subset(cartesian_product2(esk22_0,esk24_0),cartesian_product2(esk23_0,esk25_0))),inference(split_conjunct,[status(thm)],[468])).
% cnf(470,negated_conjecture,(subset(esk24_0,esk25_0)),inference(split_conjunct,[status(thm)],[468])).
% cnf(471,negated_conjecture,(subset(esk22_0,esk23_0)),inference(split_conjunct,[status(thm)],[468])).
% cnf(616,plain,(subset(X1,X2)|~subset(X1,X3)|set_difference(X3,X2)!=empty_set),inference(spm,[status(thm)],[121,284,theory(equality)])).
% cnf(643,plain,(set_difference(cartesian_product2(X1,X2),cartesian_product2(X1,X3))=empty_set|~subset(X2,X3)),inference(spm,[status(thm)],[283,117,theory(equality)])).
% cnf(4020,negated_conjecture,(set_difference(cartesian_product2(X1,esk24_0),cartesian_product2(X1,esk25_0))=empty_set),inference(spm,[status(thm)],[643,470,theory(equality)])).
% cnf(4081,negated_conjecture,(subset(X1,cartesian_product2(X2,esk25_0))|~subset(X1,cartesian_product2(X2,esk24_0))),inference(spm,[status(thm)],[616,4020,theory(equality)])).
% cnf(4594,negated_conjecture,(~subset(cartesian_product2(esk22_0,esk24_0),cartesian_product2(esk23_0,esk24_0))),inference(spm,[status(thm)],[469,4081,theory(equality)])).
% cnf(4718,negated_conjecture,(~subset(esk22_0,esk23_0)),inference(spm,[status(thm)],[4594,118,theory(equality)])).
% cnf(4719,negated_conjecture,($false),inference(rw,[status(thm)],[4718,471,theory(equality)])).
% cnf(4720,negated_conjecture,($false),inference(cn,[status(thm)],[4719,theory(equality)])).
% cnf(4721,negated_conjecture,($false),4720,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 667
% # ...of these trivial : 18
% # ...subsumed : 236
% # ...remaining for further processing: 413
% # Other redundant clauses eliminated : 60
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 3
% # Generated clauses : 3631
% # ...of the previous two non-trivial : 3153
% # Contextual simplify-reflections : 3
% # Paramodulations : 3533
% # Factorizations : 14
% # Equation resolutions : 84
% # Current number of processed clauses: 268
% # Positive orientable unit clauses: 47
% # Positive unorientable unit clauses: 6
% # Negative unit clauses : 29
% # Non-unit-clauses : 186
% # Current number of unprocessed clauses: 2725
% # ...number of literals in the above : 8634
% # Clause-clause subsumption calls (NU) : 1079
% # Rec. Clause-clause subsumption calls : 962
% # Unit Clause-clause subsumption calls : 119
% # Rewrite failures with RHS unbound : 18
% # Indexed BW rewrite attempts : 107
% # Indexed BW rewrite successes : 41
% # Backwards rewriting index: 196 leaves, 1.59+/-1.734 terms/leaf
% # Paramod-from index: 92 leaves, 1.25+/-0.564 terms/leaf
% # Paramod-into index: 172 leaves, 1.51+/-1.428 terms/leaf
% # -------------------------------------------------
% # User time : 0.141 s
% # System time : 0.010 s
% # Total time : 0.151 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.31 CPU 0.38 WC
% FINAL PrfWatch: 0.31 CPU 0.38 WC
% SZS output end Solution for /tmp/SystemOnTPTP21429/SEU167+2.tptp
%
%------------------------------------------------------------------------------