TSTP Solution File: SET978+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET978+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 : art05.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:28:35 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP7421/SET978+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP7421/SET978+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7421/SET978+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 7517
% 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(2, axiom,![X1]:![X2]:![X3]:![X4]:((disjoint(X1,X2)|disjoint(X3,X4))=>disjoint(cartesian_product2(X1,X3),cartesian_product2(X2,X4))),file('/tmp/SRASS.s.p', t127_zfmisc_1)).
% fof(3, axiom,![X1]:![X2]:(~(X1=X2)=>disjoint(singleton(X1),singleton(X2))),file('/tmp/SRASS.s.p', t17_zfmisc_1)).
% fof(6, conjecture,![X1]:![X2]:![X3]:![X4]:(~(X1=X2)=>(disjoint(cartesian_product2(singleton(X1),X3),cartesian_product2(singleton(X2),X4))&disjoint(cartesian_product2(X3,singleton(X1)),cartesian_product2(X4,singleton(X2))))),file('/tmp/SRASS.s.p', t131_zfmisc_1)).
% fof(7, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(~(X1=X2)=>(disjoint(cartesian_product2(singleton(X1),X3),cartesian_product2(singleton(X2),X4))&disjoint(cartesian_product2(X3,singleton(X1)),cartesian_product2(X4,singleton(X2)))))),inference(assume_negation,[status(cth)],[6])).
% fof(12, plain,![X1]:![X2]:![X3]:![X4]:((~(disjoint(X1,X2))&~(disjoint(X3,X4)))|disjoint(cartesian_product2(X1,X3),cartesian_product2(X2,X4))),inference(fof_nnf,[status(thm)],[2])).
% fof(13, plain,![X5]:![X6]:![X7]:![X8]:((~(disjoint(X5,X6))&~(disjoint(X7,X8)))|disjoint(cartesian_product2(X5,X7),cartesian_product2(X6,X8))),inference(variable_rename,[status(thm)],[12])).
% fof(14, plain,![X5]:![X6]:![X7]:![X8]:((~(disjoint(X5,X6))|disjoint(cartesian_product2(X5,X7),cartesian_product2(X6,X8)))&(~(disjoint(X7,X8))|disjoint(cartesian_product2(X5,X7),cartesian_product2(X6,X8)))),inference(distribute,[status(thm)],[13])).
% cnf(15,plain,(disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|~disjoint(X2,X4)),inference(split_conjunct,[status(thm)],[14])).
% cnf(16,plain,(disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|~disjoint(X1,X3)),inference(split_conjunct,[status(thm)],[14])).
% fof(17, plain,![X1]:![X2]:(X1=X2|disjoint(singleton(X1),singleton(X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(18, plain,![X3]:![X4]:(X3=X4|disjoint(singleton(X3),singleton(X4))),inference(variable_rename,[status(thm)],[17])).
% cnf(19,plain,(disjoint(singleton(X1),singleton(X2))|X1=X2),inference(split_conjunct,[status(thm)],[18])).
% fof(26, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:(~(X1=X2)&(~(disjoint(cartesian_product2(singleton(X1),X3),cartesian_product2(singleton(X2),X4)))|~(disjoint(cartesian_product2(X3,singleton(X1)),cartesian_product2(X4,singleton(X2)))))),inference(fof_nnf,[status(thm)],[7])).
% fof(27, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:(~(X5=X6)&(~(disjoint(cartesian_product2(singleton(X5),X7),cartesian_product2(singleton(X6),X8)))|~(disjoint(cartesian_product2(X7,singleton(X5)),cartesian_product2(X8,singleton(X6)))))),inference(variable_rename,[status(thm)],[26])).
% fof(28, negated_conjecture,(~(esk3_0=esk4_0)&(~(disjoint(cartesian_product2(singleton(esk3_0),esk5_0),cartesian_product2(singleton(esk4_0),esk6_0)))|~(disjoint(cartesian_product2(esk5_0,singleton(esk3_0)),cartesian_product2(esk6_0,singleton(esk4_0)))))),inference(skolemize,[status(esa)],[27])).
% cnf(29,negated_conjecture,(~disjoint(cartesian_product2(esk5_0,singleton(esk3_0)),cartesian_product2(esk6_0,singleton(esk4_0)))|~disjoint(cartesian_product2(singleton(esk3_0),esk5_0),cartesian_product2(singleton(esk4_0),esk6_0))),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,negated_conjecture,(esk3_0!=esk4_0),inference(split_conjunct,[status(thm)],[28])).
% cnf(35,negated_conjecture,(~disjoint(cartesian_product2(esk5_0,singleton(esk3_0)),cartesian_product2(esk6_0,singleton(esk4_0)))|~disjoint(singleton(esk3_0),singleton(esk4_0))),inference(spm,[status(thm)],[29,16,theory(equality)])).
% cnf(46,negated_conjecture,(~disjoint(singleton(esk3_0),singleton(esk4_0))),inference(csr,[status(thm)],[35,15])).
% cnf(47,negated_conjecture,(esk3_0=esk4_0),inference(spm,[status(thm)],[46,19,theory(equality)])).
% cnf(48,negated_conjecture,($false),inference(sr,[status(thm)],[47,30,theory(equality)])).
% cnf(49,negated_conjecture,($false),48,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 27
% # ...of these trivial : 0
% # ...subsumed : 5
% # ...remaining for further processing: 22
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 14
% # ...of the previous two non-trivial : 13
% # Contextual simplify-reflections : 3
% # Paramodulations : 14
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 14
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 8
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 4
% # Clause-clause subsumption calls (NU) : 61
% # Rec. Clause-clause subsumption calls : 61
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 25 leaves, 1.28+/-1.001 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 24 leaves, 1.08+/-0.276 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.005 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP7421/SET978+1.tptp
%
%------------------------------------------------------------------------------