TSTP Solution File: SET985+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET985+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 : art09.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:29:49 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/SystemOnTPTP1662/SET985+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP1662/SET985+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1662/SET985+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 1759
% 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(4, axiom,empty(empty_set),file('/tmp/SRASS.s.p', fc1_xboole_0)).
% fof(5, axiom,![X1]:subset(empty_set,X1),file('/tmp/SRASS.s.p', t2_xboole_1)).
% fof(6, axiom,![X1]:![X2]:![X3]:![X4]:(subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))=>(cartesian_product2(X1,X2)=empty_set|(subset(X1,X3)&subset(X2,X4)))),file('/tmp/SRASS.s.p', t138_zfmisc_1)).
% fof(7, axiom,![X1]:![X2]:(cartesian_product2(X1,X2)=empty_set<=>(X1=empty_set|X2=empty_set)),file('/tmp/SRASS.s.p', t113_zfmisc_1)).
% fof(8, conjecture,![X1]:(~(empty(X1))=>![X2]:![X3]:![X4]:((subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|subset(cartesian_product2(X2,X1),cartesian_product2(X4,X3)))=>subset(X2,X4))),file('/tmp/SRASS.s.p', t139_zfmisc_1)).
% fof(9, negated_conjecture,~(![X1]:(~(empty(X1))=>![X2]:![X3]:![X4]:((subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|subset(cartesian_product2(X2,X1),cartesian_product2(X4,X3)))=>subset(X2,X4)))),inference(assume_negation,[status(cth)],[8])).
% fof(11, negated_conjecture,~(![X1]:(~(empty(X1))=>![X2]:![X3]:![X4]:((subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|subset(cartesian_product2(X2,X1),cartesian_product2(X4,X3)))=>subset(X2,X4)))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% cnf(20,plain,(empty(empty_set)),inference(split_conjunct,[status(thm)],[4])).
% fof(21, plain,![X2]:subset(empty_set,X2),inference(variable_rename,[status(thm)],[5])).
% cnf(22,plain,(subset(empty_set,X1)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X1]:![X2]:![X3]:![X4]:(~(subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4)))|(cartesian_product2(X1,X2)=empty_set|(subset(X1,X3)&subset(X2,X4)))),inference(fof_nnf,[status(thm)],[6])).
% fof(24, plain,![X5]:![X6]:![X7]:![X8]:(~(subset(cartesian_product2(X5,X6),cartesian_product2(X7,X8)))|(cartesian_product2(X5,X6)=empty_set|(subset(X5,X7)&subset(X6,X8)))),inference(variable_rename,[status(thm)],[23])).
% fof(25, plain,![X5]:![X6]:![X7]:![X8]:(((subset(X5,X7)|cartesian_product2(X5,X6)=empty_set)|~(subset(cartesian_product2(X5,X6),cartesian_product2(X7,X8))))&((subset(X6,X8)|cartesian_product2(X5,X6)=empty_set)|~(subset(cartesian_product2(X5,X6),cartesian_product2(X7,X8))))),inference(distribute,[status(thm)],[24])).
% cnf(26,plain,(cartesian_product2(X1,X2)=empty_set|subset(X2,X4)|~subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(cartesian_product2(X1,X2)=empty_set|subset(X1,X3)|~subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[25])).
% fof(28, plain,![X1]:![X2]:((~(cartesian_product2(X1,X2)=empty_set)|(X1=empty_set|X2=empty_set))&((~(X1=empty_set)&~(X2=empty_set))|cartesian_product2(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[7])).
% fof(29, plain,![X3]:![X4]:((~(cartesian_product2(X3,X4)=empty_set)|(X3=empty_set|X4=empty_set))&((~(X3=empty_set)&~(X4=empty_set))|cartesian_product2(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X3]:![X4]:((~(cartesian_product2(X3,X4)=empty_set)|(X3=empty_set|X4=empty_set))&((~(X3=empty_set)|cartesian_product2(X3,X4)=empty_set)&(~(X4=empty_set)|cartesian_product2(X3,X4)=empty_set))),inference(distribute,[status(thm)],[29])).
% cnf(33,plain,(X1=empty_set|X2=empty_set|cartesian_product2(X2,X1)!=empty_set),inference(split_conjunct,[status(thm)],[30])).
% fof(34, negated_conjecture,?[X1]:(~(empty(X1))&?[X2]:?[X3]:?[X4]:((subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|subset(cartesian_product2(X2,X1),cartesian_product2(X4,X3)))&~(subset(X2,X4)))),inference(fof_nnf,[status(thm)],[11])).
% fof(35, negated_conjecture,?[X5]:(~(empty(X5))&?[X6]:?[X7]:?[X8]:((subset(cartesian_product2(X5,X6),cartesian_product2(X7,X8))|subset(cartesian_product2(X6,X5),cartesian_product2(X8,X7)))&~(subset(X6,X8)))),inference(variable_rename,[status(thm)],[34])).
% fof(36, negated_conjecture,(~(empty(esk3_0))&((subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0))|subset(cartesian_product2(esk4_0,esk3_0),cartesian_product2(esk6_0,esk5_0)))&~(subset(esk4_0,esk6_0)))),inference(skolemize,[status(esa)],[35])).
% cnf(37,negated_conjecture,(~subset(esk4_0,esk6_0)),inference(split_conjunct,[status(thm)],[36])).
% cnf(38,negated_conjecture,(subset(cartesian_product2(esk4_0,esk3_0),cartesian_product2(esk6_0,esk5_0))|subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0))),inference(split_conjunct,[status(thm)],[36])).
% cnf(39,negated_conjecture,(~empty(esk3_0)),inference(split_conjunct,[status(thm)],[36])).
% cnf(56,negated_conjecture,(cartesian_product2(esk4_0,esk3_0)=empty_set|subset(esk4_0,esk6_0)|subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0))),inference(spm,[status(thm)],[27,38,theory(equality)])).
% cnf(58,negated_conjecture,(cartesian_product2(esk4_0,esk3_0)=empty_set|subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0))),inference(sr,[status(thm)],[56,37,theory(equality)])).
% cnf(69,negated_conjecture,(cartesian_product2(esk3_0,esk4_0)=empty_set|subset(esk4_0,esk6_0)|cartesian_product2(esk4_0,esk3_0)=empty_set),inference(spm,[status(thm)],[26,58,theory(equality)])).
% cnf(74,negated_conjecture,(cartesian_product2(esk3_0,esk4_0)=empty_set|cartesian_product2(esk4_0,esk3_0)=empty_set),inference(sr,[status(thm)],[69,37,theory(equality)])).
% cnf(77,negated_conjecture,(empty_set=esk4_0|empty_set=esk3_0|cartesian_product2(esk3_0,esk4_0)=empty_set),inference(spm,[status(thm)],[33,74,theory(equality)])).
% cnf(82,negated_conjecture,(esk4_0=empty_set|esk3_0=empty_set),inference(csr,[status(thm)],[77,33])).
% cnf(83,negated_conjecture,(esk3_0=empty_set|~subset(empty_set,esk6_0)),inference(spm,[status(thm)],[37,82,theory(equality)])).
% cnf(88,negated_conjecture,(esk3_0=empty_set|$false),inference(rw,[status(thm)],[83,22,theory(equality)])).
% cnf(89,negated_conjecture,(esk3_0=empty_set),inference(cn,[status(thm)],[88,theory(equality)])).
% cnf(99,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[39,89,theory(equality)]),20,theory(equality)])).
% cnf(100,negated_conjecture,($false),inference(cn,[status(thm)],[99,theory(equality)])).
% cnf(101,negated_conjecture,($false),100,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 31
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 31
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 35
% # ...of the previous two non-trivial : 28
% # Contextual simplify-reflections : 1
% # Paramodulations : 35
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 12
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 5
% # Current number of unprocessed clauses: 8
% # ...number of literals in the above : 25
% # Clause-clause subsumption calls (NU) : 19
% # Rec. Clause-clause subsumption calls : 19
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 15 leaves, 1.33+/-0.699 terms/leaf
% # Paramod-from index: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 14 leaves, 1.21+/-0.558 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.004 s
% # Total time : 0.014 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/SystemOnTPTP1662/SET985+1.tptp
%
%------------------------------------------------------------------------------