TSTP Solution File: SET592+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET592+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:13:17 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/SystemOnTPTP28974/SET592+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP28974/SET592+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28974/SET592+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 29070
% 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(2, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X1,X3))=>subset(X1,intersection(X2,X3))),file('/tmp/SRASS.s.p', intersection_of_subsets)).
% fof(3, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_defn)).
% fof(6, axiom,![X1]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set_defn)).
% fof(9, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(11, conjecture,![X1]:![X2]:![X3]:(((subset(X1,X2)&subset(X1,X3))&intersection(X2,X3)=empty_set)=>X1=empty_set),file('/tmp/SRASS.s.p', prove_th51)).
% fof(12, negated_conjecture,~(![X1]:![X2]:![X3]:(((subset(X1,X2)&subset(X1,X3))&intersection(X2,X3)=empty_set)=>X1=empty_set)),inference(assume_negation,[status(cth)],[11])).
% fof(13, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(18, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X1,X3)))|subset(X1,intersection(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(19, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X4,X6)))|subset(X4,intersection(X5,X6))),inference(variable_rename,[status(thm)],[18])).
% cnf(20,plain,(subset(X1,intersection(X2,X3))|~subset(X1,X3)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[3])).
% fof(22, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[22])).
% cnf(24,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[23])).
% fof(31, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[13])).
% cnf(32,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[31])).
% fof(48, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(49, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&(?[X7]:(member(X7,X4)&~(member(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[50])).
% fof(52, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk2_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk2_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[51])).
% cnf(54,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(62, negated_conjecture,?[X1]:?[X2]:?[X3]:(((subset(X1,X2)&subset(X1,X3))&intersection(X2,X3)=empty_set)&~(X1=empty_set)),inference(fof_nnf,[status(thm)],[12])).
% fof(63, negated_conjecture,?[X4]:?[X5]:?[X6]:(((subset(X4,X5)&subset(X4,X6))&intersection(X5,X6)=empty_set)&~(X4=empty_set)),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,(((subset(esk4_0,esk5_0)&subset(esk4_0,esk6_0))&intersection(esk5_0,esk6_0)=empty_set)&~(esk4_0=empty_set)),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(esk4_0!=empty_set),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,negated_conjecture,(intersection(esk5_0,esk6_0)=empty_set),inference(split_conjunct,[status(thm)],[64])).
% cnf(67,negated_conjecture,(subset(esk4_0,esk6_0)),inference(split_conjunct,[status(thm)],[64])).
% cnf(68,negated_conjecture,(subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[64])).
% cnf(77,plain,(subset(empty_set,X1)),inference(spm,[status(thm)],[32,54,theory(equality)])).
% cnf(92,negated_conjecture,(subset(X1,empty_set)|~subset(X1,esk6_0)|~subset(X1,esk5_0)),inference(spm,[status(thm)],[20,66,theory(equality)])).
% cnf(123,negated_conjecture,(subset(esk4_0,empty_set)|~subset(esk4_0,esk5_0)),inference(spm,[status(thm)],[92,67,theory(equality)])).
% cnf(126,negated_conjecture,(subset(esk4_0,empty_set)|$false),inference(rw,[status(thm)],[123,68,theory(equality)])).
% cnf(127,negated_conjecture,(subset(esk4_0,empty_set)),inference(cn,[status(thm)],[126,theory(equality)])).
% cnf(131,negated_conjecture,(empty_set=esk4_0|~subset(empty_set,esk4_0)),inference(spm,[status(thm)],[24,127,theory(equality)])).
% cnf(134,negated_conjecture,(empty_set=esk4_0|$false),inference(rw,[status(thm)],[131,77,theory(equality)])).
% cnf(135,negated_conjecture,(empty_set=esk4_0),inference(cn,[status(thm)],[134,theory(equality)])).
% cnf(136,negated_conjecture,($false),inference(sr,[status(thm)],[135,65,theory(equality)])).
% cnf(137,negated_conjecture,($false),136,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 30
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 29
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 55
% # ...of the previous two non-trivial : 40
% # Contextual simplify-reflections : 0
% # Paramodulations : 51
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 27
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 17
% # Current number of unprocessed clauses: 32
% # ...number of literals in the above : 82
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 6
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 29 leaves, 1.41+/-0.966 terms/leaf
% # Paramod-from index: 13 leaves, 1.15+/-0.361 terms/leaf
% # Paramod-into index: 27 leaves, 1.30+/-0.710 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.003 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP28974/SET592+3.tptp
%
%------------------------------------------------------------------------------