TSTP Solution File: SET983+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET983+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:29:26 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/SystemOnTPTP7939/SET983+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP7939/SET983+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7939/SET983+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 8035
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4))=set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),file('/tmp/SRASS.s.p', t123_zfmisc_1)).
% fof(3, axiom,![X1]:![X2]:![X3]:(X3=set_intersection2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&in(X4,X2)))),file('/tmp/SRASS.s.p', d3_xboole_0)).
% fof(8, conjecture,![X1]:![X2]:![X3]:![X4]:![X5]:((in(X1,cartesian_product2(X2,X3))&in(X1,cartesian_product2(X4,X5)))=>in(X1,cartesian_product2(set_intersection2(X2,X4),set_intersection2(X3,X5)))),file('/tmp/SRASS.s.p', t137_zfmisc_1)).
% fof(9, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:![X5]:((in(X1,cartesian_product2(X2,X3))&in(X1,cartesian_product2(X4,X5)))=>in(X1,cartesian_product2(set_intersection2(X2,X4),set_intersection2(X3,X5))))),inference(assume_negation,[status(cth)],[8])).
% fof(15, plain,![X5]:![X6]:![X7]:![X8]:cartesian_product2(set_intersection2(X5,X6),set_intersection2(X7,X8))=set_intersection2(cartesian_product2(X5,X7),cartesian_product2(X6,X8)),inference(variable_rename,[status(thm)],[2])).
% cnf(16,plain,(cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4))=set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4))),inference(split_conjunct,[status(thm)],[15])).
% fof(17, plain,![X1]:![X2]:![X3]:((~(X3=set_intersection2(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)&in(X4,X2)))&((~(in(X4,X1))|~(in(X4,X2)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))|~(in(X4,X2))))&(in(X4,X3)|(in(X4,X1)&in(X4,X2))))|X3=set_intersection2(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(18, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))|~(in(X9,X6))))&(in(X9,X7)|(in(X9,X5)&in(X9,X6))))|X7=set_intersection2(X5,X6))),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))|~(in(esk1_3(X5,X6,X7),X6))))&(in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)&in(esk1_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(skolemize,[status(esa)],[18])).
% fof(20, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7)))|~(X7=set_intersection2(X5,X6)))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))|~(in(esk1_3(X5,X6,X7),X6))))&(in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)&in(esk1_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(shift_quantors,[status(thm)],[19])).
% fof(21, plain,![X5]:![X6]:![X7]:![X8]:(((((in(X8,X5)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6)))&((in(X8,X6)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6))))&(((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))|~(X7=set_intersection2(X5,X6))))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))|~(in(esk1_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))&(((in(esk1_3(X5,X6,X7),X5)|in(esk1_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))&((in(esk1_3(X5,X6,X7),X6)|in(esk1_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))))),inference(distribute,[status(thm)],[20])).
% cnf(25,plain,(in(X4,X1)|X1!=set_intersection2(X2,X3)|~in(X4,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[21])).
% fof(38, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:?[X5]:((in(X1,cartesian_product2(X2,X3))&in(X1,cartesian_product2(X4,X5)))&~(in(X1,cartesian_product2(set_intersection2(X2,X4),set_intersection2(X3,X5))))),inference(fof_nnf,[status(thm)],[9])).
% fof(39, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:?[X10]:((in(X6,cartesian_product2(X7,X8))&in(X6,cartesian_product2(X9,X10)))&~(in(X6,cartesian_product2(set_intersection2(X7,X9),set_intersection2(X8,X10))))),inference(variable_rename,[status(thm)],[38])).
% fof(40, negated_conjecture,((in(esk4_0,cartesian_product2(esk5_0,esk6_0))&in(esk4_0,cartesian_product2(esk7_0,esk8_0)))&~(in(esk4_0,cartesian_product2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk8_0))))),inference(skolemize,[status(esa)],[39])).
% cnf(41,negated_conjecture,(~in(esk4_0,cartesian_product2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk8_0)))),inference(split_conjunct,[status(thm)],[40])).
% cnf(42,negated_conjecture,(in(esk4_0,cartesian_product2(esk7_0,esk8_0))),inference(split_conjunct,[status(thm)],[40])).
% cnf(43,negated_conjecture,(in(esk4_0,cartesian_product2(esk5_0,esk6_0))),inference(split_conjunct,[status(thm)],[40])).
% cnf(68,plain,(in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2)),inference(er,[status(thm)],[25,theory(equality)])).
% cnf(106,plain,(in(X1,cartesian_product2(set_intersection2(X2,X4),set_intersection2(X3,X5)))|~in(X1,cartesian_product2(X4,X5))|~in(X1,cartesian_product2(X2,X3))),inference(spm,[status(thm)],[68,16,theory(equality)])).
% cnf(699,negated_conjecture,(~in(esk4_0,cartesian_product2(esk7_0,esk8_0))|~in(esk4_0,cartesian_product2(esk5_0,esk6_0))),inference(spm,[status(thm)],[41,106,theory(equality)])).
% cnf(731,negated_conjecture,($false|~in(esk4_0,cartesian_product2(esk5_0,esk6_0))),inference(rw,[status(thm)],[699,42,theory(equality)])).
% cnf(732,negated_conjecture,($false|$false),inference(rw,[status(thm)],[731,43,theory(equality)])).
% cnf(733,negated_conjecture,($false),inference(cn,[status(thm)],[732,theory(equality)])).
% cnf(734,negated_conjecture,($false),733,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 180
% # ...of these trivial : 3
% # ...subsumed : 95
% # ...remaining for further processing: 82
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 674
% # ...of the previous two non-trivial : 609
% # Contextual simplify-reflections : 0
% # Paramodulations : 644
% # Factorizations : 20
% # Equation resolutions : 10
% # Current number of processed clauses: 67
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 4
% # Non-unit-clauses : 57
% # Current number of unprocessed clauses: 459
% # ...number of literals in the above : 1337
% # Clause-clause subsumption calls (NU) : 2099
% # Rec. Clause-clause subsumption calls : 1765
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 58 leaves, 2.81+/-2.903 terms/leaf
% # Paramod-from index: 10 leaves, 2.70+/-2.532 terms/leaf
% # Paramod-into index: 50 leaves, 2.22+/-2.335 terms/leaf
% # -------------------------------------------------
% # User time : 0.036 s
% # System time : 0.002 s
% # Total time : 0.038 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.21 WC
% FINAL PrfWatch: 0.13 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP7939/SET983+1.tptp
%
%------------------------------------------------------------------------------