%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SET148+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:41 EST 2010

% Result   : Theorem 1.10s
% Output   : Solution 1.10s
% 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/SystemOnTPTP3967/SET148+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP3967/SET148+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3967/SET148+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 4099
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(subset(X1,X2)=>intersection(X1,X2)=X1),file('/tmp/SRASS.s.p', subset_intersection)).
% fof(5, axiom,![X1]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_of_subset)).
% fof(8, conjecture,![X1]:intersection(X1,X1)=X1,file('/tmp/SRASS.s.p', prove_idempotency_of_intersection)).
% fof(9, negated_conjecture,~(![X1]:intersection(X1,X1)=X1),inference(assume_negation,[status(cth)],[8])).
% fof(12, plain,![X1]:![X2]:(~(subset(X1,X2))|intersection(X1,X2)=X1),inference(fof_nnf,[status(thm)],[2])).
% fof(13, plain,![X3]:![X4]:(~(subset(X3,X4))|intersection(X3,X4)=X3),inference(variable_rename,[status(thm)],[12])).
% cnf(14,plain,(intersection(X1,X2)=X1|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[13])).
% fof(27, plain,![X2]:subset(X2,X2),inference(variable_rename,[status(thm)],[5])).
% cnf(28,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(46, negated_conjecture,?[X1]:~(intersection(X1,X1)=X1),inference(fof_nnf,[status(thm)],[9])).
% fof(47, negated_conjecture,?[X2]:~(intersection(X2,X2)=X2),inference(variable_rename,[status(thm)],[46])).
% fof(48, negated_conjecture,~(intersection(esk3_0,esk3_0)=esk3_0),inference(skolemize,[status(esa)],[47])).
% cnf(49,negated_conjecture,(intersection(esk3_0,esk3_0)!=esk3_0),inference(split_conjunct,[status(thm)],[48])).
% cnf(56,negated_conjecture,(~subset(esk3_0,esk3_0)),inference(spm,[status(thm)],[49,14,theory(equality)])).
% cnf(59,negated_conjecture,($false),inference(rw,[status(thm)],[56,28,theory(equality)])).
% cnf(60,negated_conjecture,($false),inference(cn,[status(thm)],[59,theory(equality)])).
% cnf(61,negated_conjecture,($false),60,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 6
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 6
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 7
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 5
% # Factorizations                     : 0
% # Equation resolutions               : 2
% # Current number of processed clauses: 4
% #    Positive orientable unit clauses: 1
% #    Positive unorientable unit clauses: 1
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 1
% # Current number of unprocessed clauses: 11
% # ...number of literals in the above : 25
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 2
% # Indexed BW rewrite successes       : 2
% # Backwards rewriting index:     5 leaves,   1.40+/-0.490 terms/leaf
% # Paramod-from index:            2 leaves,   1.50+/-0.500 terms/leaf
% # Paramod-into index:            4 leaves,   1.25+/-0.433 terms/leaf
% # -------------------------------------------------
% # User time              : 0.006 s
% # System time            : 0.005 s
% # Total time             : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP3967/SET148+3.tptp
% 
%------------------------------------------------------------------------------