%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU112+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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:08:24 EST 2010
% Result : Theorem 7.66s
% Output : Solution 7.66s
% 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/SystemOnTPTP7966/SEU112+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7966/SEU112+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7966/SEU112+1.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 8062
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.95 CPU 4.03 WC
% PrfWatch: 5.93 CPU 6.04 WC
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(subset(X1,X2)=>subset(finite_subsets(X1),finite_subsets(X2))),file('/tmp/SRASS.s.p', t23_finsub_1)).
% fof(3, axiom,![X1]:![X2]:subset(X1,set_union2(X1,X2)),file('/tmp/SRASS.s.p', t7_xboole_1)).
% fof(4, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X3,X2))=>subset(set_union2(X1,X3),X2)),file('/tmp/SRASS.s.p', t8_xboole_1)).
% fof(12, axiom,![X1]:![X2]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(40, conjecture,![X1]:![X2]:subset(set_union2(finite_subsets(X1),finite_subsets(X2)),finite_subsets(set_union2(X1,X2))),file('/tmp/SRASS.s.p', t25_finsub_1)).
% fof(41, negated_conjecture,~(![X1]:![X2]:subset(set_union2(finite_subsets(X1),finite_subsets(X2)),finite_subsets(set_union2(X1,X2)))),inference(assume_negation,[status(cth)],[40])).
% fof(56, plain,![X1]:![X2]:(~(subset(X1,X2))|subset(finite_subsets(X1),finite_subsets(X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(57, plain,![X3]:![X4]:(~(subset(X3,X4))|subset(finite_subsets(X3),finite_subsets(X4))),inference(variable_rename,[status(thm)],[56])).
% cnf(58,plain,(subset(finite_subsets(X1),finite_subsets(X2))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[57])).
% fof(59, plain,![X3]:![X4]:subset(X3,set_union2(X3,X4)),inference(variable_rename,[status(thm)],[3])).
% cnf(60,plain,(subset(X1,set_union2(X1,X2))),inference(split_conjunct,[status(thm)],[59])).
% fof(61, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X3,X2)))|subset(set_union2(X1,X3),X2)),inference(fof_nnf,[status(thm)],[4])).
% fof(62, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X6,X5)))|subset(set_union2(X4,X6),X5)),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(subset(set_union2(X1,X2),X3)|~subset(X2,X3)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[62])).
% fof(84, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[12])).
% cnf(85,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[84])).
% fof(196, negated_conjecture,?[X1]:?[X2]:~(subset(set_union2(finite_subsets(X1),finite_subsets(X2)),finite_subsets(set_union2(X1,X2)))),inference(fof_nnf,[status(thm)],[41])).
% fof(197, negated_conjecture,?[X3]:?[X4]:~(subset(set_union2(finite_subsets(X3),finite_subsets(X4)),finite_subsets(set_union2(X3,X4)))),inference(variable_rename,[status(thm)],[196])).
% fof(198, negated_conjecture,~(subset(set_union2(finite_subsets(esk11_0),finite_subsets(esk12_0)),finite_subsets(set_union2(esk11_0,esk12_0)))),inference(skolemize,[status(esa)],[197])).
% cnf(199,negated_conjecture,(~subset(set_union2(finite_subsets(esk11_0),finite_subsets(esk12_0)),finite_subsets(set_union2(esk11_0,esk12_0)))),inference(split_conjunct,[status(thm)],[198])).
% cnf(256,plain,(subset(X1,set_union2(X2,X1))),inference(pm,[status(thm)],[60,85,theory(equality)])).
% cnf(280,plain,(subset(finite_subsets(X1),finite_subsets(set_union2(X1,X2)))),inference(pm,[status(thm)],[58,60,theory(equality)])).
% cnf(434,plain,(subset(finite_subsets(X1),finite_subsets(set_union2(X2,X1)))),inference(pm,[status(thm)],[58,256,theory(equality)])).
% cnf(977,plain,(subset(set_union2(X1,finite_subsets(X2)),finite_subsets(set_union2(X3,X2)))|~subset(X1,finite_subsets(set_union2(X3,X2)))),inference(pm,[status(thm)],[63,434,theory(equality)])).
% cnf(31542,plain,(subset(set_union2(finite_subsets(X1),finite_subsets(X2)),finite_subsets(set_union2(X1,X2)))),inference(pm,[status(thm)],[977,280,theory(equality)])).
% cnf(174545,negated_conjecture,($false),inference(rw,[status(thm)],[199,31542,theory(equality)])).
% cnf(174546,negated_conjecture,($false),inference(cn,[status(thm)],[174545,theory(equality)])).
% cnf(174547,negated_conjecture,($false),174546,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2689
% # ...of these trivial : 258
% # ...subsumed : 1072
% # ...remaining for further processing: 1359
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 36
% # Generated clauses : 170160
% # ...of the previous two non-trivial : 168116
% # Contextual simplify-reflections : 0
% # Paramodulations : 170136
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1323
% # Positive orientable unit clauses: 422
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 36
% # Non-unit-clauses : 864
% # Current number of unprocessed clauses: 165457
% # ...number of literals in the above : 338807
% # Clause-clause subsumption calls (NU) : 27759
% # Rec. Clause-clause subsumption calls : 22729
% # Unit Clause-clause subsumption calls : 5618
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4196
% # Indexed BW rewrite successes : 23
% # Backwards rewriting index: 775 leaves, 3.51+/-10.319 terms/leaf
% # Paramod-from index: 237 leaves, 3.30+/-6.959 terms/leaf
% # Paramod-into index: 676 leaves, 2.56+/-4.832 terms/leaf
% # -------------------------------------------------
% # User time : 3.671 s
% # System time : 0.173 s
% # Total time : 3.844 s
% # Maximum resident set size: 0 pages
% PrfWatch: 6.65 CPU 6.76 WC
% FINAL PrfWatch: 6.65 CPU 6.76 WC
% SZS output end Solution for /tmp/SystemOnTPTP7966/SEU112+1.tptp
%
%------------------------------------------------------------------------------