%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU129+2 : TPTP v5.0.0. Released v3.3.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 : Thu Dec 30 01:12:00 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP16198/SEU129+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16198/SEU129+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16198/SEU129+2.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 16294
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:subset(set_intersection2(X1,X2),X1),file('/tmp/SRASS.s.p', t17_xboole_1)).
% fof(3, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X1,X3))=>subset(X1,set_intersection2(X2,X3))),file('/tmp/SRASS.s.p', t19_xboole_1)).
% fof(4, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3)),file('/tmp/SRASS.s.p', t1_xboole_1)).
% fof(5, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(37, conjecture,![X1]:![X2]:![X3]:(subset(X1,X2)=>subset(set_intersection2(X1,X3),set_intersection2(X2,X3))),file('/tmp/SRASS.s.p', t26_xboole_1)).
% fof(38, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(X1,X2)=>subset(set_intersection2(X1,X3),set_intersection2(X2,X3)))),inference(assume_negation,[status(cth)],[37])).
% fof(48, plain,![X3]:![X4]:subset(set_intersection2(X3,X4),X3),inference(variable_rename,[status(thm)],[2])).
% cnf(49,plain,(subset(set_intersection2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X1,X3)))|subset(X1,set_intersection2(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(51, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X4,X6)))|subset(X4,set_intersection2(X5,X6))),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(subset(X1,set_intersection2(X2,X3))|~subset(X1,X3)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[51])).
% fof(53, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X2,X3)))|subset(X1,X3)),inference(fof_nnf,[status(thm)],[4])).
% fof(54, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X5,X6)))|subset(X4,X6)),inference(variable_rename,[status(thm)],[53])).
% cnf(55,plain,(subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[54])).
% fof(56, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[5])).
% cnf(57,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(172, negated_conjecture,?[X1]:?[X2]:?[X3]:(subset(X1,X2)&~(subset(set_intersection2(X1,X3),set_intersection2(X2,X3)))),inference(fof_nnf,[status(thm)],[38])).
% fof(173, negated_conjecture,?[X4]:?[X5]:?[X6]:(subset(X4,X5)&~(subset(set_intersection2(X4,X6),set_intersection2(X5,X6)))),inference(variable_rename,[status(thm)],[172])).
% fof(174, negated_conjecture,(subset(esk9_0,esk10_0)&~(subset(set_intersection2(esk9_0,esk11_0),set_intersection2(esk10_0,esk11_0)))),inference(skolemize,[status(esa)],[173])).
% cnf(175,negated_conjecture,(~subset(set_intersection2(esk9_0,esk11_0),set_intersection2(esk10_0,esk11_0))),inference(split_conjunct,[status(thm)],[174])).
% cnf(176,negated_conjecture,(subset(esk9_0,esk10_0)),inference(split_conjunct,[status(thm)],[174])).
% cnf(187,plain,(subset(set_intersection2(X2,X1),X1)),inference(spm,[status(thm)],[49,57,theory(equality)])).
% cnf(231,negated_conjecture,(subset(X1,esk10_0)|~subset(X1,esk9_0)),inference(spm,[status(thm)],[55,176,theory(equality)])).
% cnf(236,negated_conjecture,(~subset(set_intersection2(esk9_0,esk11_0),esk11_0)|~subset(set_intersection2(esk9_0,esk11_0),esk10_0)),inference(spm,[status(thm)],[175,52,theory(equality)])).
% cnf(612,negated_conjecture,($false|~subset(set_intersection2(esk9_0,esk11_0),esk10_0)),inference(rw,[status(thm)],[236,187,theory(equality)])).
% cnf(613,negated_conjecture,(~subset(set_intersection2(esk9_0,esk11_0),esk10_0)),inference(cn,[status(thm)],[612,theory(equality)])).
% cnf(629,negated_conjecture,(~subset(set_intersection2(esk9_0,esk11_0),esk9_0)),inference(spm,[status(thm)],[613,231,theory(equality)])).
% cnf(636,negated_conjecture,($false),inference(rw,[status(thm)],[629,49,theory(equality)])).
% cnf(637,negated_conjecture,($false),inference(cn,[status(thm)],[636,theory(equality)])).
% cnf(638,negated_conjecture,($false),637,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 122
% # ...of these trivial : 1
% # ...subsumed : 2
% # ...remaining for further processing: 119
% # Other redundant clauses eliminated : 17
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 406
% # ...of the previous two non-trivial : 332
% # Contextual simplify-reflections : 0
% # Paramodulations : 377
% # Factorizations : 6
% # Equation resolutions : 23
% # Current number of processed clauses: 64
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 6
% # Non-unit-clauses : 41
% # Current number of unprocessed clauses: 315
% # ...number of literals in the above : 1014
% # Clause-clause subsumption calls (NU) : 115
% # Rec. Clause-clause subsumption calls : 111
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 29
% # Indexed BW rewrite successes : 25
% # Backwards rewriting index: 49 leaves, 1.59+/-1.339 terms/leaf
% # Paramod-from index: 24 leaves, 1.46+/-0.763 terms/leaf
% # Paramod-into index: 45 leaves, 1.49+/-1.088 terms/leaf
% # -------------------------------------------------
% # User time : 0.026 s
% # System time : 0.004 s
% # Total time : 0.030 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP16198/SEU129+2.tptp
%
%------------------------------------------------------------------------------