TSTP Solution File: SET974+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET974+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:01 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP6644/SET974+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6644/SET974+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6644/SET974+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 6766
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~(in(X3,set_intersection2(X1,X2)))))&~((?[X3]:in(X3,set_intersection2(X1,X2))&disjoint(X1,X2)))),file('/tmp/SRASS.s.p', t4_xboole_0)).
% fof(8, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:~((in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5)))&![X6]:![X7]:~(((X1=ordered_pair(X6,X7)&in(X6,set_intersection2(X2,X4)))&in(X7,set_intersection2(X3,X5)))))),file('/tmp/SRASS.s.p', t104_zfmisc_1)).
% fof(12, conjecture,![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(13, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:((disjoint(X1,X2)|disjoint(X3,X4))=>disjoint(cartesian_product2(X1,X3),cartesian_product2(X2,X4)))),inference(assume_negation,[status(cth)],[12])).
% fof(15, plain,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~(in(X3,set_intersection2(X1,X2)))))&~((?[X3]:in(X3,set_intersection2(X1,X2))&disjoint(X1,X2)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(24, plain,![X1]:![X2]:((disjoint(X1,X2)|?[X3]:in(X3,set_intersection2(X1,X2)))&(![X3]:~(in(X3,set_intersection2(X1,X2)))|~(disjoint(X1,X2)))),inference(fof_nnf,[status(thm)],[15])).
% fof(25, plain,![X4]:![X5]:((disjoint(X4,X5)|?[X6]:in(X6,set_intersection2(X4,X5)))&(![X7]:~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:((disjoint(X4,X5)|in(esk1_2(X4,X5),set_intersection2(X4,X5)))&(![X7]:~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))),inference(skolemize,[status(esa)],[25])).
% fof(27, plain,![X4]:![X5]:![X7]:((~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))&(disjoint(X4,X5)|in(esk1_2(X4,X5),set_intersection2(X4,X5)))),inference(shift_quantors,[status(thm)],[26])).
% cnf(28,plain,(in(esk1_2(X1,X2),set_intersection2(X1,X2))|disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,plain,(~disjoint(X1,X2)|~in(X3,set_intersection2(X1,X2))),inference(split_conjunct,[status(thm)],[27])).
% fof(40, plain,![X1]:![X2]:![X3]:![X4]:![X5]:(~(in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5))))|?[X6]:?[X7]:((X1=ordered_pair(X6,X7)&in(X6,set_intersection2(X2,X4)))&in(X7,set_intersection2(X3,X5)))),inference(fof_nnf,[status(thm)],[8])).
% fof(41, plain,![X8]:![X9]:![X10]:![X11]:![X12]:(~(in(X8,set_intersection2(cartesian_product2(X9,X10),cartesian_product2(X11,X12))))|?[X13]:?[X14]:((X8=ordered_pair(X13,X14)&in(X13,set_intersection2(X9,X11)))&in(X14,set_intersection2(X10,X12)))),inference(variable_rename,[status(thm)],[40])).
% fof(42, plain,![X8]:![X9]:![X10]:![X11]:![X12]:(~(in(X8,set_intersection2(cartesian_product2(X9,X10),cartesian_product2(X11,X12))))|((X8=ordered_pair(esk4_5(X8,X9,X10,X11,X12),esk5_5(X8,X9,X10,X11,X12))&in(esk4_5(X8,X9,X10,X11,X12),set_intersection2(X9,X11)))&in(esk5_5(X8,X9,X10,X11,X12),set_intersection2(X10,X12)))),inference(skolemize,[status(esa)],[41])).
% fof(43, plain,![X8]:![X9]:![X10]:![X11]:![X12]:(((X8=ordered_pair(esk4_5(X8,X9,X10,X11,X12),esk5_5(X8,X9,X10,X11,X12))|~(in(X8,set_intersection2(cartesian_product2(X9,X10),cartesian_product2(X11,X12)))))&(in(esk4_5(X8,X9,X10,X11,X12),set_intersection2(X9,X11))|~(in(X8,set_intersection2(cartesian_product2(X9,X10),cartesian_product2(X11,X12))))))&(in(esk5_5(X8,X9,X10,X11,X12),set_intersection2(X10,X12))|~(in(X8,set_intersection2(cartesian_product2(X9,X10),cartesian_product2(X11,X12)))))),inference(distribute,[status(thm)],[42])).
% cnf(44,plain,(in(esk5_5(X1,X2,X3,X4,X5),set_intersection2(X3,X5))|~in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5)))),inference(split_conjunct,[status(thm)],[43])).
% cnf(45,plain,(in(esk4_5(X1,X2,X3,X4,X5),set_intersection2(X2,X4))|~in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5)))),inference(split_conjunct,[status(thm)],[43])).
% fof(53, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((disjoint(X1,X2)|disjoint(X3,X4))&~(disjoint(cartesian_product2(X1,X3),cartesian_product2(X2,X4)))),inference(fof_nnf,[status(thm)],[13])).
% fof(54, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((disjoint(X5,X6)|disjoint(X7,X8))&~(disjoint(cartesian_product2(X5,X7),cartesian_product2(X6,X8)))),inference(variable_rename,[status(thm)],[53])).
% fof(55, negated_conjecture,((disjoint(esk6_0,esk7_0)|disjoint(esk8_0,esk9_0))&~(disjoint(cartesian_product2(esk6_0,esk8_0),cartesian_product2(esk7_0,esk9_0)))),inference(skolemize,[status(esa)],[54])).
% cnf(56,negated_conjecture,(~disjoint(cartesian_product2(esk6_0,esk8_0),cartesian_product2(esk7_0,esk9_0))),inference(split_conjunct,[status(thm)],[55])).
% cnf(57,negated_conjecture,(disjoint(esk8_0,esk9_0)|disjoint(esk6_0,esk7_0)),inference(split_conjunct,[status(thm)],[55])).
% cnf(85,plain,(~disjoint(X3,X5)|~in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5)))),inference(spm,[status(thm)],[29,44,theory(equality)])).
% cnf(86,plain,(~disjoint(X2,X4)|~in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5)))),inference(spm,[status(thm)],[29,45,theory(equality)])).
% cnf(189,plain,(disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|~disjoint(X2,X4)),inference(spm,[status(thm)],[85,28,theory(equality)])).
% cnf(192,negated_conjecture,(~disjoint(esk8_0,esk9_0)),inference(spm,[status(thm)],[56,189,theory(equality)])).
% cnf(193,negated_conjecture,(disjoint(esk6_0,esk7_0)),inference(sr,[status(thm)],[57,192,theory(equality)])).
% cnf(213,plain,(disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))|~disjoint(X1,X3)),inference(spm,[status(thm)],[86,28,theory(equality)])).
% cnf(216,negated_conjecture,(~disjoint(esk6_0,esk7_0)),inference(spm,[status(thm)],[56,213,theory(equality)])).
% cnf(217,negated_conjecture,($false),inference(rw,[status(thm)],[216,193,theory(equality)])).
% cnf(218,negated_conjecture,($false),inference(cn,[status(thm)],[217,theory(equality)])).
% cnf(219,negated_conjecture,($false),218,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 104
% # ...of these trivial : 0
% # ...subsumed : 46
% # ...remaining for further processing: 58
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 152
% # ...of the previous two non-trivial : 135
% # Contextual simplify-reflections : 0
% # Paramodulations : 151
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 41
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 7
% # Non-unit-clauses : 28
% # Current number of unprocessed clauses: 61
% # ...number of literals in the above : 116
% # Clause-clause subsumption calls (NU) : 216
% # Rec. Clause-clause subsumption calls : 213
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 46 leaves, 1.85+/-1.876 terms/leaf
% # Paramod-from index: 14 leaves, 1.43+/-0.623 terms/leaf
% # Paramod-into index: 45 leaves, 1.49+/-1.147 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.006 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.40 WC
% FINAL PrfWatch: 0.10 CPU 0.40 WC
% SZS output end Solution for /tmp/SystemOnTPTP6644/SET974+1.tptp
%
%------------------------------------------------------------------------------