%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET146+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 23:07:19 EST 2010
% Result : Theorem 1.11s
% Output : Solution 1.11s
% 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/SystemOnTPTP3618/SET146+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3618/SET146+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3618/SET146+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 3750
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(2, axiom,![X1]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set_defn)).
% fof(3, axiom,![X1]:![X2]:![X3]:(member(X3,intersection(X1,X2))<=>(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersection_defn)).
% fof(4, axiom,![X1]:![X2]:(X1=X2<=>![X3]:(member(X3,X1)<=>member(X3,X2))),file('/tmp/SRASS.s.p', equal_member_defn)).
% fof(9, conjecture,![X1]:intersection(X1,empty_set)=empty_set,file('/tmp/SRASS.s.p', prove_th61)).
% fof(10, negated_conjecture,~(![X1]:intersection(X1,empty_set)=empty_set),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(13, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(14,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[13])).
% fof(15, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[11])).
% cnf(16,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[15])).
% fof(17, 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)],[3])).
% fof(18, 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)],[17])).
% fof(19, 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)],[18])).
% cnf(22,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[19])).
% fof(23, 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)],[4])).
% fof(24, 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)],[23])).
% fof(25, 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)],[24])).
% fof(26, 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)],[25])).
% fof(27, 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)],[26])).
% cnf(28,plain,(X1=X2|member(esk1_2(X1,X2),X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(54, negated_conjecture,?[X1]:~(intersection(X1,empty_set)=empty_set),inference(fof_nnf,[status(thm)],[10])).
% fof(55, negated_conjecture,?[X2]:~(intersection(X2,empty_set)=empty_set),inference(variable_rename,[status(thm)],[54])).
% fof(56, negated_conjecture,~(intersection(esk4_0,empty_set)=empty_set),inference(skolemize,[status(esa)],[55])).
% cnf(57,negated_conjecture,(intersection(esk4_0,empty_set)!=empty_set),inference(split_conjunct,[status(thm)],[56])).
% cnf(58,negated_conjecture,(intersection(empty_set,esk4_0)!=empty_set),inference(rw,[status(thm)],[57,14,theory(equality)])).
% cnf(86,plain,(empty_set=X1|member(esk1_2(empty_set,X1),X1)),inference(spm,[status(thm)],[16,28,theory(equality)])).
% cnf(98,plain,(member(esk1_2(empty_set,intersection(X1,X2)),X1)|empty_set=intersection(X1,X2)),inference(spm,[status(thm)],[22,86,theory(equality)])).
% cnf(102,plain,(intersection(empty_set,X1)=empty_set),inference(spm,[status(thm)],[16,98,theory(equality)])).
% cnf(113,negated_conjecture,($false),inference(rw,[status(thm)],[58,102,theory(equality)])).
% cnf(114,negated_conjecture,($false),inference(cn,[status(thm)],[113,theory(equality)])).
% cnf(115,negated_conjecture,($false),114,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 42
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 40
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 51
% # ...of the previous two non-trivial : 37
% # Contextual simplify-reflections : 0
% # Paramodulations : 47
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 21
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 15
% # Current number of unprocessed clauses: 27
% # ...number of literals in the above : 66
% # Clause-clause subsumption calls (NU) : 9
% # Rec. Clause-clause subsumption calls : 8
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 22 leaves, 1.50+/-0.941 terms/leaf
% # Paramod-from index: 11 leaves, 1.18+/-0.386 terms/leaf
% # Paramod-into index: 21 leaves, 1.38+/-0.785 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.005 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP3618/SET146+3.tptp
%
%------------------------------------------------------------------------------