TSTP Solution File: SEU325+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU325+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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 03:33:08 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP10922/SEU325+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10922/SEU325+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10922/SEU325+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 11018
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:?[X2]:element(X2,X1),file('/tmp/SRASS.s.p', existence_m1_subset_1)).
% fof(5, axiom,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(the_carrier(X1)))),file('/tmp/SRASS.s.p', fc1_struct_0)).
% fof(7, axiom,![X1]:(one_sorted_str(X1)=>cast_as_carrier_subset(X1)=the_carrier(X1)),file('/tmp/SRASS.s.p', d3_pre_topc)).
% fof(8, axiom,![X1]:(one_sorted_str(X1)=>![X2]:(element(X2,powerset(powerset(the_carrier(X1))))=>(is_a_cover_of_carrier(X1,X2)<=>cast_as_carrier_subset(X1)=union_of_subsets(the_carrier(X1),X2)))),file('/tmp/SRASS.s.p', d8_pre_topc)).
% fof(9, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(11, axiom,![X1]:?[X2]:(element(X2,powerset(X1))&empty(X2)),file('/tmp/SRASS.s.p', rc2_subset_1)).
% fof(14, axiom,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>element(union_of_subsets(X1,X2),powerset(X1))),file('/tmp/SRASS.s.p', dt_k5_setfam_1)).
% fof(18, axiom,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>union_of_subsets(X1,X2)=union(X2)),file('/tmp/SRASS.s.p', redefinition_k5_setfam_1)).
% fof(24, axiom,![X1]:![X2]:(X2=union(X1)<=>![X3]:(in(X3,X2)<=>?[X4]:(in(X3,X4)&in(X4,X1)))),file('/tmp/SRASS.s.p', d4_tarski)).
% fof(25, axiom,![X1]:![X2]:![X3]:~(((in(X1,X2)&element(X2,powerset(X3)))&empty(X3))),file('/tmp/SRASS.s.p', t5_subset)).
% fof(27, axiom,![X1]:![X2]:(element(X1,X2)=>(empty(X2)|in(X1,X2))),file('/tmp/SRASS.s.p', t2_subset)).
% fof(36, axiom,(((((empty(empty_set)&v1_membered(empty_set))&v2_membered(empty_set))&v3_membered(empty_set))&v4_membered(empty_set))&v5_membered(empty_set)),file('/tmp/SRASS.s.p', fc6_membered)).
% fof(49, conjecture,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(element(X2,powerset(powerset(the_carrier(X1))))=>~((is_a_cover_of_carrier(X1,X2)&X2=empty_set)))),file('/tmp/SRASS.s.p', t5_tops_2)).
% fof(50, negated_conjecture,~(![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(element(X2,powerset(powerset(the_carrier(X1))))=>~((is_a_cover_of_carrier(X1,X2)&X2=empty_set))))),inference(assume_negation,[status(cth)],[49])).
% fof(53, plain,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(the_carrier(X1)))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(59, negated_conjecture,~(![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(element(X2,powerset(powerset(the_carrier(X1))))=>~((is_a_cover_of_carrier(X1,X2)&X2=empty_set))))),inference(fof_simplification,[status(thm)],[50,theory(equality)])).
% fof(63, plain,![X3]:?[X4]:element(X4,X3),inference(variable_rename,[status(thm)],[2])).
% fof(64, plain,![X3]:element(esk2_1(X3),X3),inference(skolemize,[status(esa)],[63])).
% cnf(65,plain,(element(esk2_1(X1),X1)),inference(split_conjunct,[status(thm)],[64])).
% fof(76, plain,![X1]:((empty_carrier(X1)|~(one_sorted_str(X1)))|~(empty(the_carrier(X1)))),inference(fof_nnf,[status(thm)],[53])).
% fof(77, plain,![X2]:((empty_carrier(X2)|~(one_sorted_str(X2)))|~(empty(the_carrier(X2)))),inference(variable_rename,[status(thm)],[76])).
% cnf(78,plain,(empty_carrier(X1)|~empty(the_carrier(X1))|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[77])).
% fof(82, plain,![X1]:(~(one_sorted_str(X1))|cast_as_carrier_subset(X1)=the_carrier(X1)),inference(fof_nnf,[status(thm)],[7])).
% fof(83, plain,![X2]:(~(one_sorted_str(X2))|cast_as_carrier_subset(X2)=the_carrier(X2)),inference(variable_rename,[status(thm)],[82])).
% cnf(84,plain,(cast_as_carrier_subset(X1)=the_carrier(X1)|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[83])).
% fof(85, plain,![X1]:(~(one_sorted_str(X1))|![X2]:(~(element(X2,powerset(powerset(the_carrier(X1)))))|((~(is_a_cover_of_carrier(X1,X2))|cast_as_carrier_subset(X1)=union_of_subsets(the_carrier(X1),X2))&(~(cast_as_carrier_subset(X1)=union_of_subsets(the_carrier(X1),X2))|is_a_cover_of_carrier(X1,X2))))),inference(fof_nnf,[status(thm)],[8])).
% fof(86, plain,![X3]:(~(one_sorted_str(X3))|![X4]:(~(element(X4,powerset(powerset(the_carrier(X3)))))|((~(is_a_cover_of_carrier(X3,X4))|cast_as_carrier_subset(X3)=union_of_subsets(the_carrier(X3),X4))&(~(cast_as_carrier_subset(X3)=union_of_subsets(the_carrier(X3),X4))|is_a_cover_of_carrier(X3,X4))))),inference(variable_rename,[status(thm)],[85])).
% fof(87, plain,![X3]:![X4]:((~(element(X4,powerset(powerset(the_carrier(X3)))))|((~(is_a_cover_of_carrier(X3,X4))|cast_as_carrier_subset(X3)=union_of_subsets(the_carrier(X3),X4))&(~(cast_as_carrier_subset(X3)=union_of_subsets(the_carrier(X3),X4))|is_a_cover_of_carrier(X3,X4))))|~(one_sorted_str(X3))),inference(shift_quantors,[status(thm)],[86])).
% fof(88, plain,![X3]:![X4]:((((~(is_a_cover_of_carrier(X3,X4))|cast_as_carrier_subset(X3)=union_of_subsets(the_carrier(X3),X4))|~(element(X4,powerset(powerset(the_carrier(X3))))))|~(one_sorted_str(X3)))&(((~(cast_as_carrier_subset(X3)=union_of_subsets(the_carrier(X3),X4))|is_a_cover_of_carrier(X3,X4))|~(element(X4,powerset(powerset(the_carrier(X3))))))|~(one_sorted_str(X3)))),inference(distribute,[status(thm)],[87])).
% cnf(90,plain,(cast_as_carrier_subset(X1)=union_of_subsets(the_carrier(X1),X2)|~one_sorted_str(X1)|~element(X2,powerset(powerset(the_carrier(X1))))|~is_a_cover_of_carrier(X1,X2)),inference(split_conjunct,[status(thm)],[88])).
% fof(91, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[9])).
% fof(92, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[91])).
% cnf(93,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[92])).
% fof(100, plain,![X3]:?[X4]:(element(X4,powerset(X3))&empty(X4)),inference(variable_rename,[status(thm)],[11])).
% fof(101, plain,![X3]:(element(esk6_1(X3),powerset(X3))&empty(esk6_1(X3))),inference(skolemize,[status(esa)],[100])).
% cnf(102,plain,(empty(esk6_1(X1))),inference(split_conjunct,[status(thm)],[101])).
% cnf(103,plain,(element(esk6_1(X1),powerset(X1))),inference(split_conjunct,[status(thm)],[101])).
% fof(111, plain,![X1]:![X2]:(~(element(X2,powerset(powerset(X1))))|element(union_of_subsets(X1,X2),powerset(X1))),inference(fof_nnf,[status(thm)],[14])).
% fof(112, plain,![X3]:![X4]:(~(element(X4,powerset(powerset(X3))))|element(union_of_subsets(X3,X4),powerset(X3))),inference(variable_rename,[status(thm)],[111])).
% cnf(113,plain,(element(union_of_subsets(X1,X2),powerset(X1))|~element(X2,powerset(powerset(X1)))),inference(split_conjunct,[status(thm)],[112])).
% fof(124, plain,![X1]:![X2]:(~(element(X2,powerset(powerset(X1))))|union_of_subsets(X1,X2)=union(X2)),inference(fof_nnf,[status(thm)],[18])).
% fof(125, plain,![X3]:![X4]:(~(element(X4,powerset(powerset(X3))))|union_of_subsets(X3,X4)=union(X4)),inference(variable_rename,[status(thm)],[124])).
% cnf(126,plain,(union_of_subsets(X1,X2)=union(X2)|~element(X2,powerset(powerset(X1)))),inference(split_conjunct,[status(thm)],[125])).
% fof(143, plain,![X1]:![X2]:((~(X2=union(X1))|![X3]:((~(in(X3,X2))|?[X4]:(in(X3,X4)&in(X4,X1)))&(![X4]:(~(in(X3,X4))|~(in(X4,X1)))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|![X4]:(~(in(X3,X4))|~(in(X4,X1))))&(in(X3,X2)|?[X4]:(in(X3,X4)&in(X4,X1))))|X2=union(X1))),inference(fof_nnf,[status(thm)],[24])).
% fof(144, plain,![X5]:![X6]:((~(X6=union(X5))|![X7]:((~(in(X7,X6))|?[X8]:(in(X7,X8)&in(X8,X5)))&(![X9]:(~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))))&(?[X10]:((~(in(X10,X6))|![X11]:(~(in(X10,X11))|~(in(X11,X5))))&(in(X10,X6)|?[X12]:(in(X10,X12)&in(X12,X5))))|X6=union(X5))),inference(variable_rename,[status(thm)],[143])).
% fof(145, plain,![X5]:![X6]:((~(X6=union(X5))|![X7]:((~(in(X7,X6))|(in(X7,esk7_3(X5,X6,X7))&in(esk7_3(X5,X6,X7),X5)))&(![X9]:(~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))))&(((~(in(esk8_2(X5,X6),X6))|![X11]:(~(in(esk8_2(X5,X6),X11))|~(in(X11,X5))))&(in(esk8_2(X5,X6),X6)|(in(esk8_2(X5,X6),esk9_2(X5,X6))&in(esk9_2(X5,X6),X5))))|X6=union(X5))),inference(skolemize,[status(esa)],[144])).
% fof(146, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(esk8_2(X5,X6),X11))|~(in(X11,X5)))|~(in(esk8_2(X5,X6),X6)))&(in(esk8_2(X5,X6),X6)|(in(esk8_2(X5,X6),esk9_2(X5,X6))&in(esk9_2(X5,X6),X5))))|X6=union(X5))&((((~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))&(~(in(X7,X6))|(in(X7,esk7_3(X5,X6,X7))&in(esk7_3(X5,X6,X7),X5))))|~(X6=union(X5)))),inference(shift_quantors,[status(thm)],[145])).
% fof(147, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(esk8_2(X5,X6),X11))|~(in(X11,X5)))|~(in(esk8_2(X5,X6),X6)))|X6=union(X5))&(((in(esk8_2(X5,X6),esk9_2(X5,X6))|in(esk8_2(X5,X6),X6))|X6=union(X5))&((in(esk9_2(X5,X6),X5)|in(esk8_2(X5,X6),X6))|X6=union(X5))))&((((~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))|~(X6=union(X5)))&(((in(X7,esk7_3(X5,X6,X7))|~(in(X7,X6)))|~(X6=union(X5)))&((in(esk7_3(X5,X6,X7),X5)|~(in(X7,X6)))|~(X6=union(X5)))))),inference(distribute,[status(thm)],[146])).
% cnf(148,plain,(in(esk7_3(X2,X1,X3),X2)|X1!=union(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[147])).
% fof(154, plain,![X1]:![X2]:![X3]:((~(in(X1,X2))|~(element(X2,powerset(X3))))|~(empty(X3))),inference(fof_nnf,[status(thm)],[25])).
% fof(155, plain,![X4]:![X5]:![X6]:((~(in(X4,X5))|~(element(X5,powerset(X6))))|~(empty(X6))),inference(variable_rename,[status(thm)],[154])).
% cnf(156,plain,(~empty(X1)|~element(X2,powerset(X1))|~in(X3,X2)),inference(split_conjunct,[status(thm)],[155])).
% fof(161, plain,![X1]:![X2]:(~(element(X1,X2))|(empty(X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[27])).
% fof(162, plain,![X3]:![X4]:(~(element(X3,X4))|(empty(X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[161])).
% cnf(163,plain,(in(X1,X2)|empty(X2)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[162])).
% cnf(215,plain,(empty(empty_set)),inference(split_conjunct,[status(thm)],[36])).
% fof(261, negated_conjecture,?[X1]:((~(empty_carrier(X1))&one_sorted_str(X1))&?[X2]:(element(X2,powerset(powerset(the_carrier(X1))))&(is_a_cover_of_carrier(X1,X2)&X2=empty_set))),inference(fof_nnf,[status(thm)],[59])).
% fof(262, negated_conjecture,?[X3]:((~(empty_carrier(X3))&one_sorted_str(X3))&?[X4]:(element(X4,powerset(powerset(the_carrier(X3))))&(is_a_cover_of_carrier(X3,X4)&X4=empty_set))),inference(variable_rename,[status(thm)],[261])).
% fof(263, negated_conjecture,((~(empty_carrier(esk11_0))&one_sorted_str(esk11_0))&(element(esk12_0,powerset(powerset(the_carrier(esk11_0))))&(is_a_cover_of_carrier(esk11_0,esk12_0)&esk12_0=empty_set))),inference(skolemize,[status(esa)],[262])).
% cnf(264,negated_conjecture,(esk12_0=empty_set),inference(split_conjunct,[status(thm)],[263])).
% cnf(265,negated_conjecture,(is_a_cover_of_carrier(esk11_0,esk12_0)),inference(split_conjunct,[status(thm)],[263])).
% cnf(267,negated_conjecture,(one_sorted_str(esk11_0)),inference(split_conjunct,[status(thm)],[263])).
% cnf(268,negated_conjecture,(~empty_carrier(esk11_0)),inference(split_conjunct,[status(thm)],[263])).
% cnf(269,plain,(empty(esk12_0)),inference(rw,[status(thm)],[215,264,theory(equality)])).
% cnf(275,plain,(esk12_0=X1|~empty(X1)),inference(rw,[status(thm)],[93,264,theory(equality)])).
% cnf(279,plain,(esk12_0=esk6_1(X1)),inference(spm,[status(thm)],[275,102,theory(equality)])).
% cnf(399,plain,(in(esk2_1(X1),X1)|empty(X1)),inference(spm,[status(thm)],[163,65,theory(equality)])).
% cnf(663,plain,(element(esk12_0,powerset(X1))),inference(rw,[status(thm)],[103,279,theory(equality)])).
% cnf(681,plain,(union_of_subsets(X1,esk12_0)=union(esk12_0)),inference(spm,[status(thm)],[126,663,theory(equality)])).
% cnf(682,plain,(union_of_subsets(the_carrier(X1),esk12_0)=cast_as_carrier_subset(X1)|~is_a_cover_of_carrier(X1,esk12_0)|~one_sorted_str(X1)),inference(spm,[status(thm)],[90,663,theory(equality)])).
% cnf(726,plain,(element(union(esk12_0),powerset(X1))|~element(esk12_0,powerset(powerset(X1)))),inference(spm,[status(thm)],[113,681,theory(equality)])).
% cnf(727,plain,(element(union(esk12_0),powerset(X1))|$false),inference(rw,[status(thm)],[726,663,theory(equality)])).
% cnf(728,plain,(element(union(esk12_0),powerset(X1))),inference(cn,[status(thm)],[727,theory(equality)])).
% cnf(745,plain,(union_of_subsets(X1,union(esk12_0))=union(union(esk12_0))),inference(spm,[status(thm)],[126,728,theory(equality)])).
% cnf(765,plain,(~in(X1,union(esk12_0))|~empty(X2)),inference(spm,[status(thm)],[156,728,theory(equality)])).
% fof(921, plain,(~(epred3_0)<=>![X1]:~(in(X1,union(esk12_0)))),introduced(definition),['split']).
% cnf(922,plain,(epred3_0|~in(X1,union(esk12_0))),inference(split_equiv,[status(thm)],[921])).
% fof(923, plain,(~(epred4_0)<=>![X2]:~(empty(X2))),introduced(definition),['split']).
% cnf(924,plain,(epred4_0|~empty(X2)),inference(split_equiv,[status(thm)],[923])).
% cnf(925,plain,(~epred4_0|~epred3_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[765,921,theory(equality)]),923,theory(equality)]),['split']).
% cnf(926,plain,(epred4_0),inference(spm,[status(thm)],[924,269,theory(equality)])).
% cnf(929,plain,($false|~epred3_0),inference(rw,[status(thm)],[925,926,theory(equality)])).
% cnf(930,plain,(~epred3_0),inference(cn,[status(thm)],[929,theory(equality)])).
% cnf(941,plain,(~in(X1,union(esk12_0))),inference(sr,[status(thm)],[922,930,theory(equality)])).
% cnf(944,plain,(union(union(esk12_0))!=X1|~in(X2,X1)),inference(spm,[status(thm)],[941,148,theory(equality)])).
% cnf(1224,plain,(empty(union(esk12_0))),inference(spm,[status(thm)],[941,399,theory(equality)])).
% cnf(1244,plain,(esk12_0=union(esk12_0)),inference(spm,[status(thm)],[275,1224,theory(equality)])).
% cnf(1265,plain,(esk12_0!=X1|~in(X2,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[944,1244,theory(equality)]),1244,theory(equality)])).
% cnf(1276,plain,(union_of_subsets(X1,esk12_0)=union(union(esk12_0))),inference(rw,[status(thm)],[745,1244,theory(equality)])).
% cnf(1277,plain,(union_of_subsets(X1,esk12_0)=esk12_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1276,1244,theory(equality)]),1244,theory(equality)])).
% cnf(1302,plain,(empty(X1)|esk12_0!=X1),inference(spm,[status(thm)],[1265,399,theory(equality)])).
% cnf(1312,plain,(empty_carrier(X1)|~one_sorted_str(X1)|esk12_0!=the_carrier(X1)),inference(spm,[status(thm)],[78,1302,theory(equality)])).
% cnf(1315,negated_conjecture,(the_carrier(esk11_0)!=esk12_0|~one_sorted_str(esk11_0)),inference(spm,[status(thm)],[268,1312,theory(equality)])).
% cnf(1317,negated_conjecture,(the_carrier(esk11_0)!=esk12_0|$false),inference(rw,[status(thm)],[1315,267,theory(equality)])).
% cnf(1318,negated_conjecture,(the_carrier(esk11_0)!=esk12_0),inference(cn,[status(thm)],[1317,theory(equality)])).
% cnf(1321,negated_conjecture,(cast_as_carrier_subset(esk11_0)!=esk12_0|~one_sorted_str(esk11_0)),inference(spm,[status(thm)],[1318,84,theory(equality)])).
% cnf(1322,negated_conjecture,(cast_as_carrier_subset(esk11_0)!=esk12_0|$false),inference(rw,[status(thm)],[1321,267,theory(equality)])).
% cnf(1323,negated_conjecture,(cast_as_carrier_subset(esk11_0)!=esk12_0),inference(cn,[status(thm)],[1322,theory(equality)])).
% cnf(1864,plain,(esk12_0=cast_as_carrier_subset(X1)|~is_a_cover_of_carrier(X1,esk12_0)|~one_sorted_str(X1)),inference(rw,[status(thm)],[682,1277,theory(equality)])).
% cnf(1865,negated_conjecture,(cast_as_carrier_subset(esk11_0)=esk12_0|~one_sorted_str(esk11_0)),inference(spm,[status(thm)],[1864,265,theory(equality)])).
% cnf(1866,negated_conjecture,(cast_as_carrier_subset(esk11_0)=esk12_0|$false),inference(rw,[status(thm)],[1865,267,theory(equality)])).
% cnf(1867,negated_conjecture,(cast_as_carrier_subset(esk11_0)=esk12_0),inference(cn,[status(thm)],[1866,theory(equality)])).
% cnf(1868,negated_conjecture,($false),inference(sr,[status(thm)],[1867,1323,theory(equality)])).
% cnf(1869,negated_conjecture,($false),1868,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 673
% # ...of these trivial : 10
% # ...subsumed : 234
% # ...remaining for further processing: 429
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 36
% # Generated clauses : 1355
% # ...of the previous two non-trivial : 1267
% # Contextual simplify-reflections : 36
% # Paramodulations : 1338
% # Factorizations : 0
% # Equation resolutions : 8
% # Current number of processed clauses: 298
% # Positive orientable unit clauses: 35
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 18
% # Non-unit-clauses : 245
% # Current number of unprocessed clauses: 660
% # ...number of literals in the above : 2101
% # Clause-clause subsumption calls (NU) : 1611
% # Rec. Clause-clause subsumption calls : 1547
% # Unit Clause-clause subsumption calls : 1122
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 177 leaves, 1.19+/-0.608 terms/leaf
% # Paramod-from index: 83 leaves, 1.01+/-0.109 terms/leaf
% # Paramod-into index: 153 leaves, 1.10+/-0.399 terms/leaf
% # -------------------------------------------------
% # User time : 0.076 s
% # System time : 0.008 s
% # Total time : 0.084 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.26 WC
% FINAL PrfWatch: 0.18 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP10922/SEU325+1.tptp
%
%------------------------------------------------------------------------------