%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET008+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 22:54:45 EST 2010
% Result : Theorem 1.17s
% Output : Solution 1.17s
% 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/SystemOnTPTP27217/SET008+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27217/SET008+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27217/SET008+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 27349
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(2, axiom,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),file('/tmp/SRASS.s.p', difference_defn)).
% fof(3, axiom,![X1]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set_defn)).
% fof(4, axiom,![X1]:![X2]:![X3]:(member(X3,intersection(X1,X2))<=>(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersection_defn)).
% fof(5, axiom,![X1]:![X2]:(X1=X2<=>![X3]:(member(X3,X1)<=>member(X3,X2))),file('/tmp/SRASS.s.p', equal_member_defn)).
% fof(10, conjecture,![X1]:![X2]:intersection(difference(X1,X2),X2)=empty_set,file('/tmp/SRASS.s.p', prove_intersection_difference_empty_set)).
% fof(11, negated_conjecture,~(![X1]:![X2]:intersection(difference(X1,X2),X2)=empty_set),inference(assume_negation,[status(cth)],[10])).
% fof(12, plain,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(13, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(15, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(16,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[15])).
% fof(17, plain,![X1]:![X2]:![X3]:((~(member(X3,difference(X1,X2)))|(member(X3,X1)&~(member(X3,X2))))&((~(member(X3,X1))|member(X3,X2))|member(X3,difference(X1,X2)))),inference(fof_nnf,[status(thm)],[12])).
% fof(18, plain,![X4]:![X5]:![X6]:((~(member(X6,difference(X4,X5)))|(member(X6,X4)&~(member(X6,X5))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X4]:![X5]:![X6]:(((member(X6,X4)|~(member(X6,difference(X4,X5))))&(~(member(X6,X5))|~(member(X6,difference(X4,X5)))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(distribute,[status(thm)],[18])).
% cnf(21,plain,(~member(X1,difference(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[19])).
% fof(23, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[13])).
% cnf(24,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X1]:![X2]:![X3]:((~(member(X3,intersection(X1,X2)))|(member(X3,X1)&member(X3,X2)))&((~(member(X3,X1))|~(member(X3,X2)))|member(X3,intersection(X1,X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(26, plain,![X4]:![X5]:![X6]:((~(member(X6,intersection(X4,X5)))|(member(X6,X4)&member(X6,X5)))&((~(member(X6,X4))|~(member(X6,X5)))|member(X6,intersection(X4,X5)))),inference(variable_rename,[status(thm)],[25])).
% fof(27, plain,![X4]:![X5]:![X6]:(((member(X6,X4)|~(member(X6,intersection(X4,X5))))&(member(X6,X5)|~(member(X6,intersection(X4,X5)))))&((~(member(X6,X4))|~(member(X6,X5)))|member(X6,intersection(X4,X5)))),inference(distribute,[status(thm)],[26])).
% cnf(29,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[27])).
% cnf(30,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[27])).
% fof(31, plain,![X1]:![X2]:((~(X1=X2)|![X3]:((~(member(X3,X1))|member(X3,X2))&(~(member(X3,X2))|member(X3,X1))))&(?[X3]:((~(member(X3,X1))|~(member(X3,X2)))&(member(X3,X1)|member(X3,X2)))|X1=X2)),inference(fof_nnf,[status(thm)],[5])).
% fof(32, plain,![X4]:![X5]:((~(X4=X5)|![X6]:((~(member(X6,X4))|member(X6,X5))&(~(member(X6,X5))|member(X6,X4))))&(?[X7]:((~(member(X7,X4))|~(member(X7,X5)))&(member(X7,X4)|member(X7,X5)))|X4=X5)),inference(variable_rename,[status(thm)],[31])).
% fof(33, plain,![X4]:![X5]:((~(X4=X5)|![X6]:((~(member(X6,X4))|member(X6,X5))&(~(member(X6,X5))|member(X6,X4))))&(((~(member(esk1_2(X4,X5),X4))|~(member(esk1_2(X4,X5),X5)))&(member(esk1_2(X4,X5),X4)|member(esk1_2(X4,X5),X5)))|X4=X5)),inference(skolemize,[status(esa)],[32])).
% fof(34, plain,![X4]:![X5]:![X6]:((((~(member(X6,X4))|member(X6,X5))&(~(member(X6,X5))|member(X6,X4)))|~(X4=X5))&(((~(member(esk1_2(X4,X5),X4))|~(member(esk1_2(X4,X5),X5)))&(member(esk1_2(X4,X5),X4)|member(esk1_2(X4,X5),X5)))|X4=X5)),inference(shift_quantors,[status(thm)],[33])).
% fof(35, plain,![X4]:![X5]:![X6]:((((~(member(X6,X4))|member(X6,X5))|~(X4=X5))&((~(member(X6,X5))|member(X6,X4))|~(X4=X5)))&(((~(member(esk1_2(X4,X5),X4))|~(member(esk1_2(X4,X5),X5)))|X4=X5)&((member(esk1_2(X4,X5),X4)|member(esk1_2(X4,X5),X5))|X4=X5))),inference(distribute,[status(thm)],[34])).
% cnf(36,plain,(X1=X2|member(esk1_2(X1,X2),X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(62, negated_conjecture,?[X1]:?[X2]:~(intersection(difference(X1,X2),X2)=empty_set),inference(fof_nnf,[status(thm)],[11])).
% fof(63, negated_conjecture,?[X3]:?[X4]:~(intersection(difference(X3,X4),X4)=empty_set),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,~(intersection(difference(esk4_0,esk5_0),esk5_0)=empty_set),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(intersection(difference(esk4_0,esk5_0),esk5_0)!=empty_set),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,negated_conjecture,(intersection(esk5_0,difference(esk4_0,esk5_0))!=empty_set),inference(rw,[status(thm)],[65,16,theory(equality)])).
% cnf(102,plain,(empty_set=X1|member(esk1_2(empty_set,X1),X1)),inference(spm,[status(thm)],[24,36,theory(equality)])).
% cnf(112,plain,(member(esk1_2(X1,intersection(X2,X3)),X3)|X1=intersection(X2,X3)|member(esk1_2(X1,intersection(X2,X3)),X1)),inference(spm,[status(thm)],[29,36,theory(equality)])).
% cnf(121,plain,(member(esk1_2(empty_set,intersection(X1,X2)),X1)|empty_set=intersection(X1,X2)),inference(spm,[status(thm)],[30,102,theory(equality)])).
% cnf(143,plain,(intersection(difference(X1,X2),X3)=empty_set|~member(esk1_2(empty_set,intersection(difference(X1,X2),X3)),X2)),inference(spm,[status(thm)],[21,121,theory(equality)])).
% cnf(2691,plain,(intersection(difference(X1,X2),X2)=empty_set|member(esk1_2(empty_set,intersection(difference(X1,X2),X2)),empty_set)),inference(spm,[status(thm)],[143,112,theory(equality)])).
% cnf(2715,plain,(intersection(difference(X1,X2),X2)=empty_set),inference(sr,[status(thm)],[2691,24,theory(equality)])).
% cnf(2717,plain,(intersection(X2,difference(X1,X2))=empty_set),inference(rw,[status(thm)],[2715,16,theory(equality)])).
% cnf(2778,negated_conjecture,($false),inference(rw,[status(thm)],[66,2717,theory(equality)])).
% cnf(2779,negated_conjecture,($false),inference(cn,[status(thm)],[2778,theory(equality)])).
% cnf(2780,negated_conjecture,($false),2779,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 334
% # ...of these trivial : 4
% # ...subsumed : 194
% # ...remaining for further processing: 136
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 1863
% # ...of the previous two non-trivial : 1216
% # Contextual simplify-reflections : 10
% # Paramodulations : 1847
% # Factorizations : 14
% # Equation resolutions : 2
% # Current number of processed clauses: 113
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 96
% # Current number of unprocessed clauses: 917
% # ...number of literals in the above : 2805
% # Clause-clause subsumption calls (NU) : 1478
% # Rec. Clause-clause subsumption calls : 1376
% # Unit Clause-clause subsumption calls : 81
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 18
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 77 leaves, 1.81+/-1.387 terms/leaf
% # Paramod-from index: 37 leaves, 1.89+/-1.351 terms/leaf
% # Paramod-into index: 76 leaves, 1.68+/-1.320 terms/leaf
% # -------------------------------------------------
% # User time : 0.053 s
% # System time : 0.005 s
% # Total time : 0.058 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.24 WC
% FINAL PrfWatch: 0.17 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP27217/SET008+3.tptp
%
%------------------------------------------------------------------------------