TSTP Solution File: SEU120+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU120+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 01:09:36 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP8487/SEU120+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8487/SEU120+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8487/SEU120+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 8583
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>set_intersection2(X1,X2)=empty_set),file('/tmp/SRASS.s.p', d7_xboole_0)).
% fof(6, axiom,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),file('/tmp/SRASS.s.p', d1_xboole_0)).
% fof(12, conjecture,![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(13, negated_conjecture,~(![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~(in(X3,set_intersection2(X1,X2)))))&~((?[X3]:in(X3,set_intersection2(X1,X2))&disjoint(X1,X2))))),inference(assume_negation,[status(cth)],[12])).
% fof(15, plain,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(17, negated_conjecture,~(![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)],[13,theory(equality)])).
% fof(26, plain,![X1]:![X2]:((~(disjoint(X1,X2))|set_intersection2(X1,X2)=empty_set)&(~(set_intersection2(X1,X2)=empty_set)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(27, plain,![X3]:![X4]:((~(disjoint(X3,X4))|set_intersection2(X3,X4)=empty_set)&(~(set_intersection2(X3,X4)=empty_set)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[26])).
% cnf(28,plain,(disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,plain,(set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[27])).
% fof(32, plain,![X1]:((~(X1=empty_set)|![X2]:~(in(X2,X1)))&(?[X2]:in(X2,X1)|X1=empty_set)),inference(fof_nnf,[status(thm)],[15])).
% fof(33, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(?[X5]:in(X5,X3)|X3=empty_set)),inference(variable_rename,[status(thm)],[32])).
% fof(34, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(in(esk1_1(X3),X3)|X3=empty_set)),inference(skolemize,[status(esa)],[33])).
% fof(35, plain,![X3]:![X4]:((~(in(X4,X3))|~(X3=empty_set))&(in(esk1_1(X3),X3)|X3=empty_set)),inference(shift_quantors,[status(thm)],[34])).
% cnf(36,plain,(X1=empty_set|in(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[35])).
% cnf(37,plain,(X1!=empty_set|~in(X2,X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(47, negated_conjecture,?[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)],[17])).
% fof(48, negated_conjecture,?[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)],[47])).
% fof(49, negated_conjecture,((~(disjoint(esk4_0,esk5_0))&![X6]:~(in(X6,set_intersection2(esk4_0,esk5_0))))|(in(esk6_0,set_intersection2(esk4_0,esk5_0))&disjoint(esk4_0,esk5_0))),inference(skolemize,[status(esa)],[48])).
% fof(50, negated_conjecture,![X6]:((~(in(X6,set_intersection2(esk4_0,esk5_0)))&~(disjoint(esk4_0,esk5_0)))|(in(esk6_0,set_intersection2(esk4_0,esk5_0))&disjoint(esk4_0,esk5_0))),inference(shift_quantors,[status(thm)],[49])).
% fof(51, negated_conjecture,![X6]:(((in(esk6_0,set_intersection2(esk4_0,esk5_0))|~(in(X6,set_intersection2(esk4_0,esk5_0))))&(disjoint(esk4_0,esk5_0)|~(in(X6,set_intersection2(esk4_0,esk5_0)))))&((in(esk6_0,set_intersection2(esk4_0,esk5_0))|~(disjoint(esk4_0,esk5_0)))&(disjoint(esk4_0,esk5_0)|~(disjoint(esk4_0,esk5_0))))),inference(distribute,[status(thm)],[50])).
% cnf(53,negated_conjecture,(in(esk6_0,set_intersection2(esk4_0,esk5_0))|~disjoint(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[51])).
% cnf(54,negated_conjecture,(disjoint(esk4_0,esk5_0)|~in(X1,set_intersection2(esk4_0,esk5_0))),inference(split_conjunct,[status(thm)],[51])).
% cnf(56,negated_conjecture,(empty_set!=set_intersection2(esk4_0,esk5_0)|~disjoint(esk4_0,esk5_0)),inference(spm,[status(thm)],[37,53,theory(equality)])).
% cnf(65,negated_conjecture,(disjoint(esk4_0,esk5_0)|empty_set=set_intersection2(esk4_0,esk5_0)),inference(spm,[status(thm)],[54,36,theory(equality)])).
% cnf(70,negated_conjecture,(set_intersection2(esk4_0,esk5_0)!=empty_set),inference(csr,[status(thm)],[56,28])).
% cnf(71,negated_conjecture,(disjoint(esk4_0,esk5_0)),inference(sr,[status(thm)],[65,70,theory(equality)])).
% cnf(72,negated_conjecture,(set_intersection2(esk4_0,esk5_0)=empty_set),inference(spm,[status(thm)],[29,71,theory(equality)])).
% cnf(79,negated_conjecture,($false),inference(sr,[status(thm)],[72,70,theory(equality)])).
% cnf(80,negated_conjecture,($false),79,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 32
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 32
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 14
% # ...of the previous two non-trivial : 9
% # Contextual simplify-reflections : 1
% # Paramodulations : 14
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 15
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 8
% # Current number of unprocessed clauses: 4
% # ...number of literals in the above : 6
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 6
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 20 leaves, 1.20+/-0.510 terms/leaf
% # Paramod-from index: 6 leaves, 1.33+/-0.745 terms/leaf
% # Paramod-into index: 17 leaves, 1.24+/-0.546 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.006 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP8487/SEU120+1.tptp
%
%------------------------------------------------------------------------------