%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU193+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 : 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:39:10 EST 2010
% Result : Theorem 123.05s
% Output : Solution 124.45s
% 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/SystemOnTPTP28746/SEU193+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~t88_relat_1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... dt_k7_relat_1:
% CSA axiom dt_k7_relat_1 found
% Looking for CSA axiom ... reflexivity_r1_tarski:
% CSA axiom reflexivity_r1_tarski found
% Looking for CSA axiom ... t1_xboole_1:
% CSA axiom t1_xboole_1 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... d10_xboole_0: CSA axiom d10_xboole_0 found
% Looking for CSA axiom ... d3_tarski:
% CSA axiom d3_tarski found
% Looking for CSA axiom ... t86_relat_1:
% CSA axiom t86_relat_1 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... antisymmetry_r2_hidden:
% CSA axiom antisymmetry_r2_hidden found
% Looking for CSA axiom ... antisymmetry_r2_xboole_0:
% CSA axiom antisymmetry_r2_xboole_0 found
% Looking for CSA axiom ... irreflexivity_r2_xboole_0:
% CSA axiom irreflexivity_r2_xboole_0 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... rc1_xboole_0:
% CSA axiom rc1_xboole_0 found
% Looking for CSA axiom ... rc2_xboole_0:
% CSA axiom rc2_xboole_0 found
% Looking for CSA axiom ... symmetry_r1_xboole_0:
% CSA axiom symmetry_r1_xboole_0 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... d3_relat_1:
% CSA axiom d3_relat_1 found
% Looking for CSA axiom ... cc1_relat_1:
% CSA axiom cc1_relat_1 found
% Looking for CSA axiom ... rc1_relat_1:
% CSA axiom rc1_relat_1 found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc2_relat_1:
% CSA axiom rc2_relat_1 found
% Looking for CSA axiom ... t2_xboole_1:
% CSA axiom t2_xboole_1 found
% Looking for CSA axiom ... fc2_relat_1:
% CSA axiom fc2_relat_1 found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... t25_relat_1:
% CSA axiom t25_relat_1 found
% Looking for CSA axiom ... d11_relat_1:
% CSA axiom d11_relat_1 found
% Looking for CSA axiom ... dt_k4_relat_1:
% CSA axiom dt_k4_relat_1 found
% ---- Iteration 8 (21 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :dt_k4_relat_1:d11_relat_1:t25_relat_1:fc2_relat_1:t2_xboole_1:rc2_relat_1:rc1_relat_1:cc1_relat_1:d3_relat_1:symmetry_r1_xboole_0:rc2_xboole_0:rc1_xboole_0:irreflexivity_r2_xboole_0:antisymmetry_r2_xboole_0:antisymmetry_r2_hidden:t86_relat_1:d3_tarski:d10_xboole_0:t1_xboole_1:reflexivity_r1_tarski:dt_k7_relat_1 (21)
% Unselected axioms are ... :dt_k5_relat_1:dt_k6_relat_1:t17_xboole_1:t19_xboole_1:t26_xboole_1:t33_xboole_1:t36_xboole_1:t44_relat_1:t45_relat_1:t7_xboole_1:t8_xboole_1:t118_zfmisc_1:t119_zfmisc_1:t60_xboole_1:t63_xboole_1:t21_relat_1:t30_relat_1:involutiveness_k4_relat_1:existence_m1_subset_1:fc4_relat_1:fc5_relat_1:fc7_relat_1:dt_k3_subset_1:dt_k7_setfam_1:fc10_relat_1:fc6_relat_1:fc8_relat_1:fc9_relat_1:t46_relat_1:t47_relat_1:t64_relat_1:t65_relat_1:commutativity_k2_xboole_0:commutativity_k3_xboole_0:d4_relat_1:d5_relat_1:d8_relat_1:dt_k2_subset_1:dt_k5_setfam_1:dt_k6_setfam_1:dt_k6_subset_1:idempotence_k2_xboole_0:idempotence_k3_xboole_0:l2_zfmisc_1:l55_zfmisc_1:t106_zfmisc_1:t33_zfmisc_1:t37_relat_1:t37_zfmisc_1:t3_subset:t56_relat_1:d10_relat_1:d1_xboole_0:d7_relat_1:l50_zfmisc_1:t12_xboole_1:t38_zfmisc_1:t3_xboole_1:t6_zfmisc_1:t8_boole:t92_zfmisc_1:t9_tarski:d1_tarski:d2_tarski:d2_xboole_0:d3_xboole_0:d4_xboole_0:d8_xboole_0:t28_xboole_1:t3_xboole_0:d4_tarski:t20_relat_1:t2_tarski:t60_relat_1:t74_relat_1:t45_xboole_1:t71_relat_1:t7_boole:d1_zfmisc_1:d2_zfmisc_1:d6_relat_1:fc1_zfmisc_1:l32_xboole_1:l3_zfmisc_1:l4_zfmisc_1:t37_xboole_1:t39_zfmisc_1:d1_relat_1:fc1_subset_1:fc1_xboole_0:t1_zfmisc_1:fc2_subset_1:fc2_xboole_0:fc3_subset_1:fc3_xboole_0:fc4_subset_1:t1_subset:d2_subset_1:d5_tarski:l3_subset_1:l71_subset_1:rc1_subset_1:rc2_subset_1:t136_zfmisc_1:t2_subset:t4_subset:commutativity_k2_tarski:l1_zfmisc_1:l23_zfmisc_1:l25_zfmisc_1:l28_zfmisc_1:t10_zfmisc_1:t1_boole:t2_boole:t39_xboole_1:t40_xboole_1:t46_setfam_1:t46_zfmisc_1:t48_xboole_1:t65_zfmisc_1:t6_boole:d1_setfam_1:d5_subset_1:redefinition_k5_setfam_1:redefinition_k6_setfam_1:redefinition_k6_subset_1:t3_boole:t43_subset_1:t4_boole:t69_enumset1:t83_xboole_1:t8_zfmisc_1:t99_zfmisc_1:t9_zfmisc_1:d4_subset_1:d7_xboole_0:t4_xboole_0:t5_subset:involutiveness_k3_subset_1:involutiveness_k7_setfam_1:t50_subset_1:t54_subset_1:d8_setfam_1:t47_setfam_1:t48_setfam_1:dt_k1_relat_1:dt_k1_setfam_1:dt_k1_tarski:dt_k1_xboole_0:dt_k1_zfmisc_1:dt_k2_relat_1:dt_k2_tarski:dt_k2_xboole_0:dt_k2_zfmisc_1:dt_k3_relat_1:dt_k3_tarski:dt_k3_xboole_0:dt_k4_tarski:dt_k4_xboole_0:dt_m1_subset_1 (160)
% SZS status THM for /tmp/SystemOnTPTP28746/SEU193+2.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP28746/SEU193+2.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 32164
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:(relation(X1)=>![X2]:![X3]:(relation(X3)=>(X3=relation_dom_restriction(X1,X2)<=>![X4]:![X5]:(in(ordered_pair(X4,X5),X3)<=>(in(X4,X2)&in(ordered_pair(X4,X5),X1)))))),file('/tmp/SRASS.s.p', d11_relat_1)).
% fof(9, axiom,![X1]:(relation(X1)=>![X2]:(relation(X2)=>(subset(X1,X2)<=>![X3]:![X4]:(in(ordered_pair(X3,X4),X1)=>in(ordered_pair(X3,X4),X2))))),file('/tmp/SRASS.s.p', d3_relat_1)).
% fof(21, axiom,![X1]:![X2]:(relation(X1)=>relation(relation_dom_restriction(X1,X2))),file('/tmp/SRASS.s.p', dt_k7_relat_1)).
% fof(22, conjecture,![X1]:![X2]:(relation(X2)=>subset(relation_dom_restriction(X2,X1),X2)),file('/tmp/SRASS.s.p', t88_relat_1)).
% fof(23, negated_conjecture,~(![X1]:![X2]:(relation(X2)=>subset(relation_dom_restriction(X2,X1),X2))),inference(assume_negation,[status(cth)],[22])).
% fof(32, plain,![X1]:(~(relation(X1))|![X2]:![X3]:(~(relation(X3))|((~(X3=relation_dom_restriction(X1,X2))|![X4]:![X5]:((~(in(ordered_pair(X4,X5),X3))|(in(X4,X2)&in(ordered_pair(X4,X5),X1)))&((~(in(X4,X2))|~(in(ordered_pair(X4,X5),X1)))|in(ordered_pair(X4,X5),X3))))&(?[X4]:?[X5]:((~(in(ordered_pair(X4,X5),X3))|(~(in(X4,X2))|~(in(ordered_pair(X4,X5),X1))))&(in(ordered_pair(X4,X5),X3)|(in(X4,X2)&in(ordered_pair(X4,X5),X1))))|X3=relation_dom_restriction(X1,X2))))),inference(fof_nnf,[status(thm)],[2])).
% fof(33, plain,![X6]:(~(relation(X6))|![X7]:![X8]:(~(relation(X8))|((~(X8=relation_dom_restriction(X6,X7))|![X9]:![X10]:((~(in(ordered_pair(X9,X10),X8))|(in(X9,X7)&in(ordered_pair(X9,X10),X6)))&((~(in(X9,X7))|~(in(ordered_pair(X9,X10),X6)))|in(ordered_pair(X9,X10),X8))))&(?[X11]:?[X12]:((~(in(ordered_pair(X11,X12),X8))|(~(in(X11,X7))|~(in(ordered_pair(X11,X12),X6))))&(in(ordered_pair(X11,X12),X8)|(in(X11,X7)&in(ordered_pair(X11,X12),X6))))|X8=relation_dom_restriction(X6,X7))))),inference(variable_rename,[status(thm)],[32])).
% fof(34, plain,![X6]:(~(relation(X6))|![X7]:![X8]:(~(relation(X8))|((~(X8=relation_dom_restriction(X6,X7))|![X9]:![X10]:((~(in(ordered_pair(X9,X10),X8))|(in(X9,X7)&in(ordered_pair(X9,X10),X6)))&((~(in(X9,X7))|~(in(ordered_pair(X9,X10),X6)))|in(ordered_pair(X9,X10),X8))))&(((~(in(ordered_pair(esk1_3(X6,X7,X8),esk2_3(X6,X7,X8)),X8))|(~(in(esk1_3(X6,X7,X8),X7))|~(in(ordered_pair(esk1_3(X6,X7,X8),esk2_3(X6,X7,X8)),X6))))&(in(ordered_pair(esk1_3(X6,X7,X8),esk2_3(X6,X7,X8)),X8)|(in(esk1_3(X6,X7,X8),X7)&in(ordered_pair(esk1_3(X6,X7,X8),esk2_3(X6,X7,X8)),X6))))|X8=relation_dom_restriction(X6,X7))))),inference(skolemize,[status(esa)],[33])).
% fof(35, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((((((~(in(ordered_pair(X9,X10),X8))|(in(X9,X7)&in(ordered_pair(X9,X10),X6)))&((~(in(X9,X7))|~(in(ordered_pair(X9,X10),X6)))|in(ordered_pair(X9,X10),X8)))|~(X8=relation_dom_restriction(X6,X7)))&(((~(in(ordered_pair(esk1_3(X6,X7,X8),esk2_3(X6,X7,X8)),X8))|(~(in(esk1_3(X6,X7,X8),X7))|~(in(ordered_pair(esk1_3(X6,X7,X8),esk2_3(X6,X7,X8)),X6))))&(in(ordered_pair(esk1_3(X6,X7,X8),esk2_3(X6,X7,X8)),X8)|(in(esk1_3(X6,X7,X8),X7)&in(ordered_pair(esk1_3(X6,X7,X8),esk2_3(X6,X7,X8)),X6))))|X8=relation_dom_restriction(X6,X7)))|~(relation(X8)))|~(relation(X6))),inference(shift_quantors,[status(thm)],[34])).
% fof(36, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((((((in(X9,X7)|~(in(ordered_pair(X9,X10),X8)))|~(X8=relation_dom_restriction(X6,X7)))|~(relation(X8)))|~(relation(X6)))&((((in(ordered_pair(X9,X10),X6)|~(in(ordered_pair(X9,X10),X8)))|~(X8=relation_dom_restriction(X6,X7)))|~(relation(X8)))|~(relation(X6))))&(((((~(in(X9,X7))|~(in(ordered_pair(X9,X10),X6)))|in(ordered_pair(X9,X10),X8))|~(X8=relation_dom_restriction(X6,X7)))|~(relation(X8)))|~(relation(X6))))&(((((~(in(ordered_pair(esk1_3(X6,X7,X8),esk2_3(X6,X7,X8)),X8))|(~(in(esk1_3(X6,X7,X8),X7))|~(in(ordered_pair(esk1_3(X6,X7,X8),esk2_3(X6,X7,X8)),X6))))|X8=relation_dom_restriction(X6,X7))|~(relation(X8)))|~(relation(X6)))&(((((in(esk1_3(X6,X7,X8),X7)|in(ordered_pair(esk1_3(X6,X7,X8),esk2_3(X6,X7,X8)),X8))|X8=relation_dom_restriction(X6,X7))|~(relation(X8)))|~(relation(X6)))&((((in(ordered_pair(esk1_3(X6,X7,X8),esk2_3(X6,X7,X8)),X6)|in(ordered_pair(esk1_3(X6,X7,X8),esk2_3(X6,X7,X8)),X8))|X8=relation_dom_restriction(X6,X7))|~(relation(X8)))|~(relation(X6)))))),inference(distribute,[status(thm)],[35])).
% cnf(41,plain,(in(ordered_pair(X4,X5),X1)|~relation(X1)|~relation(X2)|X2!=relation_dom_restriction(X1,X3)|~in(ordered_pair(X4,X5),X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(65, plain,![X1]:(~(relation(X1))|![X2]:(~(relation(X2))|((~(subset(X1,X2))|![X3]:![X4]:(~(in(ordered_pair(X3,X4),X1))|in(ordered_pair(X3,X4),X2)))&(?[X3]:?[X4]:(in(ordered_pair(X3,X4),X1)&~(in(ordered_pair(X3,X4),X2)))|subset(X1,X2))))),inference(fof_nnf,[status(thm)],[9])).
% fof(66, plain,![X5]:(~(relation(X5))|![X6]:(~(relation(X6))|((~(subset(X5,X6))|![X7]:![X8]:(~(in(ordered_pair(X7,X8),X5))|in(ordered_pair(X7,X8),X6)))&(?[X9]:?[X10]:(in(ordered_pair(X9,X10),X5)&~(in(ordered_pair(X9,X10),X6)))|subset(X5,X6))))),inference(variable_rename,[status(thm)],[65])).
% fof(67, plain,![X5]:(~(relation(X5))|![X6]:(~(relation(X6))|((~(subset(X5,X6))|![X7]:![X8]:(~(in(ordered_pair(X7,X8),X5))|in(ordered_pair(X7,X8),X6)))&((in(ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)),X5)&~(in(ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)),X6)))|subset(X5,X6))))),inference(skolemize,[status(esa)],[66])).
% fof(68, plain,![X5]:![X6]:![X7]:![X8]:(((((~(in(ordered_pair(X7,X8),X5))|in(ordered_pair(X7,X8),X6))|~(subset(X5,X6)))&((in(ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)),X5)&~(in(ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)),X6)))|subset(X5,X6)))|~(relation(X6)))|~(relation(X5))),inference(shift_quantors,[status(thm)],[67])).
% fof(69, plain,![X5]:![X6]:![X7]:![X8]:(((((~(in(ordered_pair(X7,X8),X5))|in(ordered_pair(X7,X8),X6))|~(subset(X5,X6)))|~(relation(X6)))|~(relation(X5)))&((((in(ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)),X5)|subset(X5,X6))|~(relation(X6)))|~(relation(X5)))&(((~(in(ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)),X6))|subset(X5,X6))|~(relation(X6)))|~(relation(X5))))),inference(distribute,[status(thm)],[68])).
% cnf(70,plain,(subset(X1,X2)|~relation(X1)|~relation(X2)|~in(ordered_pair(esk5_2(X1,X2),esk6_2(X1,X2)),X2)),inference(split_conjunct,[status(thm)],[69])).
% cnf(71,plain,(subset(X1,X2)|in(ordered_pair(esk5_2(X1,X2),esk6_2(X1,X2)),X1)|~relation(X1)|~relation(X2)),inference(split_conjunct,[status(thm)],[69])).
% fof(115, plain,![X1]:![X2]:(~(relation(X1))|relation(relation_dom_restriction(X1,X2))),inference(fof_nnf,[status(thm)],[21])).
% fof(116, plain,![X3]:![X4]:(~(relation(X3))|relation(relation_dom_restriction(X3,X4))),inference(variable_rename,[status(thm)],[115])).
% cnf(117,plain,(relation(relation_dom_restriction(X1,X2))|~relation(X1)),inference(split_conjunct,[status(thm)],[116])).
% fof(118, negated_conjecture,?[X1]:?[X2]:(relation(X2)&~(subset(relation_dom_restriction(X2,X1),X2))),inference(fof_nnf,[status(thm)],[23])).
% fof(119, negated_conjecture,?[X3]:?[X4]:(relation(X4)&~(subset(relation_dom_restriction(X4,X3),X4))),inference(variable_rename,[status(thm)],[118])).
% fof(120, negated_conjecture,(relation(esk11_0)&~(subset(relation_dom_restriction(esk11_0,esk10_0),esk11_0))),inference(skolemize,[status(esa)],[119])).
% cnf(121,negated_conjecture,(~subset(relation_dom_restriction(esk11_0,esk10_0),esk11_0)),inference(split_conjunct,[status(thm)],[120])).
% cnf(122,negated_conjecture,(relation(esk11_0)),inference(split_conjunct,[status(thm)],[120])).
% cnf(161,plain,(in(ordered_pair(esk5_2(X1,X2),esk6_2(X1,X2)),X3)|subset(X1,X2)|relation_dom_restriction(X3,X4)!=X1|~relation(X1)|~relation(X3)|~relation(X2)),inference(spm,[status(thm)],[41,71,theory(equality)])).
% cnf(1061,plain,(subset(relation_dom_restriction(X1,X2),X3)|in(ordered_pair(esk5_2(relation_dom_restriction(X1,X2),X3),esk6_2(relation_dom_restriction(X1,X2),X3)),X1)|~relation(relation_dom_restriction(X1,X2))|~relation(X1)|~relation(X3)),inference(er,[status(thm)],[161,theory(equality)])).
% cnf(16619,plain,(subset(relation_dom_restriction(X1,X2),X3)|in(ordered_pair(esk5_2(relation_dom_restriction(X1,X2),X3),esk6_2(relation_dom_restriction(X1,X2),X3)),X1)|~relation(X1)|~relation(X3)),inference(csr,[status(thm)],[1061,117])).
% cnf(16653,plain,(subset(relation_dom_restriction(X1,X2),X1)|~relation(X1)|~relation(relation_dom_restriction(X1,X2))),inference(spm,[status(thm)],[70,16619,theory(equality)])).
% cnf(16660,plain,(subset(relation_dom_restriction(X1,X2),X1)|~relation(X1)),inference(csr,[status(thm)],[16653,117])).
% cnf(16700,negated_conjecture,(~relation(esk11_0)),inference(spm,[status(thm)],[121,16660,theory(equality)])).
% cnf(16726,negated_conjecture,($false),inference(rw,[status(thm)],[16700,122,theory(equality)])).
% cnf(16727,negated_conjecture,($false),inference(cn,[status(thm)],[16726,theory(equality)])).
% cnf(16728,negated_conjecture,($false),16727,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2390
% # ...of these trivial : 0
% # ...subsumed : 1906
% # ...remaining for further processing: 484
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 41
% # Backward-rewritten : 7
% # Generated clauses : 11229
% # ...of the previous two non-trivial : 10227
% # Contextual simplify-reflections : 2946
% # Paramodulations : 11178
% # Factorizations : 0
% # Equation resolutions : 9
% # Current number of processed clauses: 380
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 361
% # Current number of unprocessed clauses: 7477
% # ...number of literals in the above : 53144
% # Clause-clause subsumption calls (NU) : 108245
% # Rec. Clause-clause subsumption calls : 32362
% # Unit Clause-clause subsumption calls : 588
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 236 leaves, 2.88+/-4.054 terms/leaf
% # Paramod-from index: 51 leaves, 1.84+/-2.042 terms/leaf
% # Paramod-into index: 203 leaves, 2.24+/-2.448 terms/leaf
% # -------------------------------------------------
% # User time : 0.692 s
% # System time : 0.025 s
% # Total time : 0.717 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.06 CPU 1.11 WC
% FINAL PrfWatch: 1.06 CPU 1.11 WC
% SZS output end Solution for /tmp/SystemOnTPTP28746/SEU193+2.tptp
%
%------------------------------------------------------------------------------