TSTP Solution File: SET638+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET638+3 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 : Wed Dec 29 23:20:19 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP32302/SET638+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP32302/SET638+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32302/SET638+3.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 32398
% 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(1, axiom,![X1]:![X2]:subset(intersection(X1,X2),X1),file('/tmp/SRASS.s.p', intersection_is_subset)).
% fof(2, axiom,![X1]:![X2]:(subset(X1,X2)=>intersection(X1,X2)=X1),file('/tmp/SRASS.s.p', subset_intersection)).
% fof(3, axiom,![X1]:union(X1,empty_set)=X1,file('/tmp/SRASS.s.p', union_empty_set)).
% fof(4, axiom,![X1]:![X2]:![X3]:intersection(X1,union(X2,X3))=union(intersection(X1,X2),intersection(X1,X3)),file('/tmp/SRASS.s.p', intersection_distributes_over_union)).
% fof(6, axiom,![X1]:![X2]:union(X1,X2)=union(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_union)).
% fof(7, axiom,![X1]:![X2]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(15, conjecture,![X1]:![X2]:![X3]:((subset(X1,union(X2,X3))&intersection(X1,X3)=empty_set)=>subset(X1,X2)),file('/tmp/SRASS.s.p', prove_th120)).
% fof(16, negated_conjecture,~(![X1]:![X2]:![X3]:((subset(X1,union(X2,X3))&intersection(X1,X3)=empty_set)=>subset(X1,X2))),inference(assume_negation,[status(cth)],[15])).
% fof(19, plain,![X3]:![X4]:subset(intersection(X3,X4),X3),inference(variable_rename,[status(thm)],[1])).
% cnf(20,plain,(subset(intersection(X1,X2),X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X1]:![X2]:(~(subset(X1,X2))|intersection(X1,X2)=X1),inference(fof_nnf,[status(thm)],[2])).
% fof(22, plain,![X3]:![X4]:(~(subset(X3,X4))|intersection(X3,X4)=X3),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(intersection(X1,X2)=X1|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X2]:union(X2,empty_set)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(25,plain,(union(X1,empty_set)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:![X6]:intersection(X4,union(X5,X6))=union(intersection(X4,X5),intersection(X4,X6)),inference(variable_rename,[status(thm)],[4])).
% cnf(27,plain,(intersection(X1,union(X2,X3))=union(intersection(X1,X2),intersection(X1,X3))),inference(split_conjunct,[status(thm)],[26])).
% fof(34, plain,![X3]:![X4]:union(X3,X4)=union(X4,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(35,plain,(union(X1,X2)=union(X2,X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[7])).
% cnf(37,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(77, negated_conjecture,?[X1]:?[X2]:?[X3]:((subset(X1,union(X2,X3))&intersection(X1,X3)=empty_set)&~(subset(X1,X2))),inference(fof_nnf,[status(thm)],[16])).
% fof(78, negated_conjecture,?[X4]:?[X5]:?[X6]:((subset(X4,union(X5,X6))&intersection(X4,X6)=empty_set)&~(subset(X4,X5))),inference(variable_rename,[status(thm)],[77])).
% fof(79, negated_conjecture,((subset(esk4_0,union(esk5_0,esk6_0))&intersection(esk4_0,esk6_0)=empty_set)&~(subset(esk4_0,esk5_0))),inference(skolemize,[status(esa)],[78])).
% cnf(80,negated_conjecture,(~subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[79])).
% cnf(81,negated_conjecture,(intersection(esk4_0,esk6_0)=empty_set),inference(split_conjunct,[status(thm)],[79])).
% cnf(82,negated_conjecture,(subset(esk4_0,union(esk5_0,esk6_0))),inference(split_conjunct,[status(thm)],[79])).
% cnf(88,plain,(subset(intersection(X2,X1),X1)),inference(spm,[status(thm)],[20,37,theory(equality)])).
% cnf(92,negated_conjecture,(subset(esk4_0,union(esk6_0,esk5_0))),inference(rw,[status(thm)],[82,35,theory(equality)])).
% cnf(133,negated_conjecture,(union(intersection(esk4_0,X1),empty_set)=intersection(esk4_0,union(X1,esk6_0))),inference(spm,[status(thm)],[27,81,theory(equality)])).
% cnf(143,negated_conjecture,(intersection(esk4_0,X1)=intersection(esk4_0,union(X1,esk6_0))),inference(rw,[status(thm)],[133,25,theory(equality)])).
% cnf(221,negated_conjecture,(intersection(esk4_0,X1)=esk4_0|~subset(esk4_0,union(X1,esk6_0))),inference(spm,[status(thm)],[23,143,theory(equality)])).
% cnf(253,negated_conjecture,(intersection(esk4_0,X1)=esk4_0|~subset(esk4_0,union(esk6_0,X1))),inference(spm,[status(thm)],[221,35,theory(equality)])).
% cnf(259,negated_conjecture,(intersection(esk4_0,esk5_0)=esk4_0),inference(spm,[status(thm)],[253,92,theory(equality)])).
% cnf(261,negated_conjecture,(subset(esk4_0,esk5_0)),inference(spm,[status(thm)],[88,259,theory(equality)])).
% cnf(268,negated_conjecture,($false),inference(sr,[status(thm)],[261,80,theory(equality)])).
% cnf(269,negated_conjecture,($false),268,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 47
% # ...of these trivial : 2
% # ...subsumed : 2
% # ...remaining for further processing: 43
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 2
% # Generated clauses : 148
% # ...of the previous two non-trivial : 101
% # Contextual simplify-reflections : 0
% # Paramodulations : 144
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 38
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 2
% # Non-unit-clauses : 20
% # Current number of unprocessed clauses: 80
% # ...number of literals in the above : 171
% # Clause-clause subsumption calls (NU) : 12
% # Rec. Clause-clause subsumption calls : 12
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 42 leaves, 1.40+/-0.927 terms/leaf
% # Paramod-from index: 20 leaves, 1.20+/-0.400 terms/leaf
% # Paramod-into index: 38 leaves, 1.37+/-0.871 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.004 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP32302/SET638+3.tptp
%
%------------------------------------------------------------------------------