TSTP Solution File: SET185+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET185+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 : art02.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:08:03 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/SystemOnTPTP28175/SET185+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP28175/SET185+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28175/SET185+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 28271
% 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(1, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_defn)).
% fof(2, axiom,![X1]:![X2]:union(X1,X2)=union(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_union)).
% fof(4, axiom,![X1]:![X2]:![X3]:(member(X3,union(X1,X2))<=>(member(X3,X1)|member(X3,X2))),file('/tmp/SRASS.s.p', union_defn)).
% fof(5, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(7, conjecture,![X1]:![X2]:(subset(X1,X2)=>union(X1,X2)=X2),file('/tmp/SRASS.s.p', prove_subset_union)).
% fof(8, negated_conjecture,~(![X1]:![X2]:(subset(X1,X2)=>union(X1,X2)=X2)),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(10, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[9])).
% fof(11, 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)],[10])).
% cnf(12,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[11])).
% fof(15, plain,![X3]:![X4]:union(X3,X4)=union(X4,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(16,plain,(union(X1,X2)=union(X2,X1)),inference(split_conjunct,[status(thm)],[15])).
% fof(19, plain,![X1]:![X2]:![X3]:((~(member(X3,union(X1,X2)))|(member(X3,X1)|member(X3,X2)))&((~(member(X3,X1))&~(member(X3,X2)))|member(X3,union(X1,X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(20, plain,![X4]:![X5]:![X6]:((~(member(X6,union(X4,X5)))|(member(X6,X4)|member(X6,X5)))&((~(member(X6,X4))&~(member(X6,X5)))|member(X6,union(X4,X5)))),inference(variable_rename,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:((~(member(X6,union(X4,X5)))|(member(X6,X4)|member(X6,X5)))&((~(member(X6,X4))|member(X6,union(X4,X5)))&(~(member(X6,X5))|member(X6,union(X4,X5))))),inference(distribute,[status(thm)],[20])).
% cnf(22,plain,(member(X1,union(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[21])).
% cnf(24,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))),inference(split_conjunct,[status(thm)],[21])).
% fof(25, 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)],[5])).
% fof(26, 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)],[25])).
% fof(27, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[27])).
% fof(29, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[28])).
% cnf(30,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[29])).
% cnf(31,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[29])).
% cnf(32,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(42, negated_conjecture,?[X1]:?[X2]:(subset(X1,X2)&~(union(X1,X2)=X2)),inference(fof_nnf,[status(thm)],[8])).
% fof(43, negated_conjecture,?[X3]:?[X4]:(subset(X3,X4)&~(union(X3,X4)=X4)),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,(subset(esk3_0,esk4_0)&~(union(esk3_0,esk4_0)=esk4_0)),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(union(esk3_0,esk4_0)!=esk4_0),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,negated_conjecture,(subset(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(51,negated_conjecture,(union(esk4_0,esk3_0)!=esk4_0),inference(rw,[status(thm)],[45,16,theory(equality)])).
% cnf(53,negated_conjecture,(member(X1,esk4_0)|~member(X1,esk3_0)),inference(spm,[status(thm)],[32,46,theory(equality)])).
% cnf(59,plain,(subset(X1,union(X2,X3))|~member(esk1_2(X1,union(X2,X3)),X3)),inference(spm,[status(thm)],[30,22,theory(equality)])).
% cnf(65,plain,(member(esk1_2(union(X1,X2),X3),X2)|member(esk1_2(union(X1,X2),X3),X1)|subset(union(X1,X2),X3)),inference(spm,[status(thm)],[24,31,theory(equality)])).
% cnf(77,negated_conjecture,(member(esk1_2(esk3_0,X1),esk4_0)|subset(esk3_0,X1)),inference(spm,[status(thm)],[53,31,theory(equality)])).
% cnf(87,negated_conjecture,(subset(esk3_0,union(X1,esk4_0))),inference(spm,[status(thm)],[59,77,theory(equality)])).
% cnf(88,plain,(subset(X1,union(X2,X1))),inference(spm,[status(thm)],[59,31,theory(equality)])).
% cnf(91,negated_conjecture,(subset(esk3_0,union(esk4_0,X1))),inference(spm,[status(thm)],[87,16,theory(equality)])).
% cnf(95,plain,(subset(X1,union(X1,X2))),inference(spm,[status(thm)],[88,16,theory(equality)])).
% cnf(98,negated_conjecture,(member(X1,union(esk4_0,X2))|~member(X1,esk3_0)),inference(spm,[status(thm)],[32,91,theory(equality)])).
% cnf(133,negated_conjecture,(subset(X1,union(esk4_0,X2))|~member(esk1_2(X1,union(esk4_0,X2)),esk3_0)),inference(spm,[status(thm)],[30,98,theory(equality)])).
% cnf(151,plain,(member(esk1_2(union(X4,X4),X5),X4)|subset(union(X4,X4),X5)),inference(ef,[status(thm)],[65,theory(equality)])).
% cnf(202,plain,(subset(union(X1,X1),X1)),inference(spm,[status(thm)],[30,151,theory(equality)])).
% cnf(223,plain,(X1=union(X1,X1)|~subset(X1,union(X1,X1))),inference(spm,[status(thm)],[12,202,theory(equality)])).
% cnf(229,plain,(X1=union(X1,X1)|$false),inference(rw,[status(thm)],[223,95,theory(equality)])).
% cnf(230,plain,(X1=union(X1,X1)),inference(cn,[status(thm)],[229,theory(equality)])).
% cnf(255,negated_conjecture,(subset(X1,esk4_0)|~member(esk1_2(X1,esk4_0),esk3_0)),inference(spm,[status(thm)],[133,230,theory(equality)])).
% cnf(282,negated_conjecture,(subset(union(X1,esk3_0),esk4_0)|member(esk1_2(union(X1,esk3_0),esk4_0),X1)),inference(spm,[status(thm)],[255,65,theory(equality)])).
% cnf(298,negated_conjecture,(subset(union(esk4_0,esk3_0),esk4_0)),inference(spm,[status(thm)],[30,282,theory(equality)])).
% cnf(306,negated_conjecture,(esk4_0=union(esk4_0,esk3_0)|~subset(esk4_0,union(esk4_0,esk3_0))),inference(spm,[status(thm)],[12,298,theory(equality)])).
% cnf(309,negated_conjecture,(esk4_0=union(esk4_0,esk3_0)|$false),inference(rw,[status(thm)],[306,95,theory(equality)])).
% cnf(310,negated_conjecture,(esk4_0=union(esk4_0,esk3_0)),inference(cn,[status(thm)],[309,theory(equality)])).
% cnf(311,negated_conjecture,($false),inference(sr,[status(thm)],[310,51,theory(equality)])).
% cnf(312,negated_conjecture,($false),311,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 94
% # ...of these trivial : 2
% # ...subsumed : 42
% # ...remaining for further processing: 50
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 218
% # ...of the previous two non-trivial : 177
% # Contextual simplify-reflections : 3
% # Paramodulations : 196
% # Factorizations : 20
% # Equation resolutions : 2
% # Current number of processed clauses: 43
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 33
% # Current number of unprocessed clauses: 83
% # ...number of literals in the above : 262
% # Clause-clause subsumption calls (NU) : 228
% # Rec. Clause-clause subsumption calls : 189
% # Unit Clause-clause subsumption calls : 24
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 28
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 61 leaves, 1.39+/-0.815 terms/leaf
% # Paramod-from index: 23 leaves, 1.39+/-0.706 terms/leaf
% # Paramod-into index: 53 leaves, 1.38+/-0.758 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.006 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP28175/SET185+3.tptp
%
%------------------------------------------------------------------------------