TSTP Solution File: SEU238+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU238+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 : art03.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 02:21:06 EST 2010
% Result : Theorem 1.14s
% Output : Solution 1.14s
% 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/SystemOnTPTP6701/SEU238+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6701/SEU238+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6701/SEU238+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 6797
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(ordinal(X1)=>(being_limit_ordinal(X1)<=>![X2]:(ordinal(X2)=>(in(X2,X1)=>in(succ(X2),X1))))),file('/tmp/SRASS.s.p', t41_ordinal1)).
% fof(4, axiom,![X1]:in(X1,succ(X1)),file('/tmp/SRASS.s.p', t10_ordinal1)).
% fof(5, axiom,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),file('/tmp/SRASS.s.p', antisymmetry_r2_hidden)).
% fof(12, axiom,![X1]:succ(X1)=set_union2(X1,singleton(X1)),file('/tmp/SRASS.s.p', d1_ordinal1)).
% fof(13, axiom,![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>(in(X1,X2)<=>ordinal_subset(succ(X1),X2)))),file('/tmp/SRASS.s.p', t33_ordinal1)).
% fof(16, axiom,![X1]:(ordinal(X1)=>(((~(empty(succ(X1)))&epsilon_transitive(succ(X1)))&epsilon_connected(succ(X1)))&ordinal(succ(X1)))),file('/tmp/SRASS.s.p', fc3_ordinal1)).
% fof(24, axiom,![X1]:![X2]:(proper_subset(X1,X2)<=>(subset(X1,X2)&~(X1=X2))),file('/tmp/SRASS.s.p', d8_xboole_0)).
% fof(25, axiom,![X1]:![X2]:((ordinal(X1)&ordinal(X2))=>(ordinal_subset(X1,X2)<=>subset(X1,X2))),file('/tmp/SRASS.s.p', redefinition_r1_ordinal1)).
% fof(36, axiom,![X1]:(epsilon_transitive(X1)=>![X2]:(ordinal(X2)=>(proper_subset(X1,X2)=>in(X1,X2)))),file('/tmp/SRASS.s.p', t21_ordinal1)).
% fof(59, conjecture,![X1]:(ordinal(X1)=>(~((~(being_limit_ordinal(X1))&![X2]:(ordinal(X2)=>~(X1=succ(X2)))))&~((?[X2]:(ordinal(X2)&X1=succ(X2))&being_limit_ordinal(X1))))),file('/tmp/SRASS.s.p', t42_ordinal1)).
% fof(60, negated_conjecture,~(![X1]:(ordinal(X1)=>(~((~(being_limit_ordinal(X1))&![X2]:(ordinal(X2)=>~(X1=succ(X2)))))&~((?[X2]:(ordinal(X2)&X1=succ(X2))&being_limit_ordinal(X1)))))),inference(assume_negation,[status(cth)],[59])).
% fof(62, plain,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(65, plain,![X1]:(ordinal(X1)=>(((~(empty(succ(X1)))&epsilon_transitive(succ(X1)))&epsilon_connected(succ(X1)))&ordinal(succ(X1)))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(71, negated_conjecture,~(![X1]:(ordinal(X1)=>(~((~(being_limit_ordinal(X1))&![X2]:(ordinal(X2)=>~(X1=succ(X2)))))&~((?[X2]:(ordinal(X2)&X1=succ(X2))&being_limit_ordinal(X1)))))),inference(fof_simplification,[status(thm)],[60,theory(equality)])).
% fof(72, plain,![X1]:(~(ordinal(X1))|((~(being_limit_ordinal(X1))|![X2]:(~(ordinal(X2))|(~(in(X2,X1))|in(succ(X2),X1))))&(?[X2]:(ordinal(X2)&(in(X2,X1)&~(in(succ(X2),X1))))|being_limit_ordinal(X1)))),inference(fof_nnf,[status(thm)],[1])).
% fof(73, plain,![X3]:(~(ordinal(X3))|((~(being_limit_ordinal(X3))|![X4]:(~(ordinal(X4))|(~(in(X4,X3))|in(succ(X4),X3))))&(?[X5]:(ordinal(X5)&(in(X5,X3)&~(in(succ(X5),X3))))|being_limit_ordinal(X3)))),inference(variable_rename,[status(thm)],[72])).
% fof(74, plain,![X3]:(~(ordinal(X3))|((~(being_limit_ordinal(X3))|![X4]:(~(ordinal(X4))|(~(in(X4,X3))|in(succ(X4),X3))))&((ordinal(esk1_1(X3))&(in(esk1_1(X3),X3)&~(in(succ(esk1_1(X3)),X3))))|being_limit_ordinal(X3)))),inference(skolemize,[status(esa)],[73])).
% fof(75, plain,![X3]:![X4]:((((~(ordinal(X4))|(~(in(X4,X3))|in(succ(X4),X3)))|~(being_limit_ordinal(X3)))&((ordinal(esk1_1(X3))&(in(esk1_1(X3),X3)&~(in(succ(esk1_1(X3)),X3))))|being_limit_ordinal(X3)))|~(ordinal(X3))),inference(shift_quantors,[status(thm)],[74])).
% fof(76, plain,![X3]:![X4]:((((~(ordinal(X4))|(~(in(X4,X3))|in(succ(X4),X3)))|~(being_limit_ordinal(X3)))|~(ordinal(X3)))&(((ordinal(esk1_1(X3))|being_limit_ordinal(X3))|~(ordinal(X3)))&(((in(esk1_1(X3),X3)|being_limit_ordinal(X3))|~(ordinal(X3)))&((~(in(succ(esk1_1(X3)),X3))|being_limit_ordinal(X3))|~(ordinal(X3)))))),inference(distribute,[status(thm)],[75])).
% cnf(77,plain,(being_limit_ordinal(X1)|~ordinal(X1)|~in(succ(esk1_1(X1)),X1)),inference(split_conjunct,[status(thm)],[76])).
% cnf(78,plain,(being_limit_ordinal(X1)|in(esk1_1(X1),X1)|~ordinal(X1)),inference(split_conjunct,[status(thm)],[76])).
% cnf(79,plain,(being_limit_ordinal(X1)|ordinal(esk1_1(X1))|~ordinal(X1)),inference(split_conjunct,[status(thm)],[76])).
% cnf(80,plain,(in(succ(X2),X1)|~ordinal(X1)|~being_limit_ordinal(X1)|~in(X2,X1)|~ordinal(X2)),inference(split_conjunct,[status(thm)],[76])).
% fof(86, plain,![X2]:in(X2,succ(X2)),inference(variable_rename,[status(thm)],[4])).
% cnf(87,plain,(in(X1,succ(X1))),inference(split_conjunct,[status(thm)],[86])).
% fof(88, plain,![X1]:![X2]:(~(in(X1,X2))|~(in(X2,X1))),inference(fof_nnf,[status(thm)],[62])).
% fof(89, plain,![X3]:![X4]:(~(in(X3,X4))|~(in(X4,X3))),inference(variable_rename,[status(thm)],[88])).
% cnf(90,plain,(~in(X1,X2)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[89])).
% fof(113, plain,![X2]:succ(X2)=set_union2(X2,singleton(X2)),inference(variable_rename,[status(thm)],[12])).
% cnf(114,plain,(succ(X1)=set_union2(X1,singleton(X1))),inference(split_conjunct,[status(thm)],[113])).
% fof(115, plain,![X1]:(~(ordinal(X1))|![X2]:(~(ordinal(X2))|((~(in(X1,X2))|ordinal_subset(succ(X1),X2))&(~(ordinal_subset(succ(X1),X2))|in(X1,X2))))),inference(fof_nnf,[status(thm)],[13])).
% fof(116, plain,![X3]:(~(ordinal(X3))|![X4]:(~(ordinal(X4))|((~(in(X3,X4))|ordinal_subset(succ(X3),X4))&(~(ordinal_subset(succ(X3),X4))|in(X3,X4))))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X3]:![X4]:((~(ordinal(X4))|((~(in(X3,X4))|ordinal_subset(succ(X3),X4))&(~(ordinal_subset(succ(X3),X4))|in(X3,X4))))|~(ordinal(X3))),inference(shift_quantors,[status(thm)],[116])).
% fof(118, plain,![X3]:![X4]:((((~(in(X3,X4))|ordinal_subset(succ(X3),X4))|~(ordinal(X4)))|~(ordinal(X3)))&(((~(ordinal_subset(succ(X3),X4))|in(X3,X4))|~(ordinal(X4)))|~(ordinal(X3)))),inference(distribute,[status(thm)],[117])).
% cnf(120,plain,(ordinal_subset(succ(X1),X2)|~ordinal(X1)|~ordinal(X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[118])).
% fof(127, plain,![X1]:(~(ordinal(X1))|(((~(empty(succ(X1)))&epsilon_transitive(succ(X1)))&epsilon_connected(succ(X1)))&ordinal(succ(X1)))),inference(fof_nnf,[status(thm)],[65])).
% fof(128, plain,![X2]:(~(ordinal(X2))|(((~(empty(succ(X2)))&epsilon_transitive(succ(X2)))&epsilon_connected(succ(X2)))&ordinal(succ(X2)))),inference(variable_rename,[status(thm)],[127])).
% fof(129, plain,![X2]:((((~(empty(succ(X2)))|~(ordinal(X2)))&(epsilon_transitive(succ(X2))|~(ordinal(X2))))&(epsilon_connected(succ(X2))|~(ordinal(X2))))&(ordinal(succ(X2))|~(ordinal(X2)))),inference(distribute,[status(thm)],[128])).
% cnf(130,plain,(ordinal(succ(X1))|~ordinal(X1)),inference(split_conjunct,[status(thm)],[129])).
% cnf(132,plain,(epsilon_transitive(succ(X1))|~ordinal(X1)),inference(split_conjunct,[status(thm)],[129])).
% fof(152, plain,![X1]:![X2]:((~(proper_subset(X1,X2))|(subset(X1,X2)&~(X1=X2)))&((~(subset(X1,X2))|X1=X2)|proper_subset(X1,X2))),inference(fof_nnf,[status(thm)],[24])).
% fof(153, plain,![X3]:![X4]:((~(proper_subset(X3,X4))|(subset(X3,X4)&~(X3=X4)))&((~(subset(X3,X4))|X3=X4)|proper_subset(X3,X4))),inference(variable_rename,[status(thm)],[152])).
% fof(154, plain,![X3]:![X4]:(((subset(X3,X4)|~(proper_subset(X3,X4)))&(~(X3=X4)|~(proper_subset(X3,X4))))&((~(subset(X3,X4))|X3=X4)|proper_subset(X3,X4))),inference(distribute,[status(thm)],[153])).
% cnf(155,plain,(proper_subset(X1,X2)|X1=X2|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[154])).
% fof(158, plain,![X1]:![X2]:((~(ordinal(X1))|~(ordinal(X2)))|((~(ordinal_subset(X1,X2))|subset(X1,X2))&(~(subset(X1,X2))|ordinal_subset(X1,X2)))),inference(fof_nnf,[status(thm)],[25])).
% fof(159, plain,![X3]:![X4]:((~(ordinal(X3))|~(ordinal(X4)))|((~(ordinal_subset(X3,X4))|subset(X3,X4))&(~(subset(X3,X4))|ordinal_subset(X3,X4)))),inference(variable_rename,[status(thm)],[158])).
% fof(160, plain,![X3]:![X4]:(((~(ordinal_subset(X3,X4))|subset(X3,X4))|(~(ordinal(X3))|~(ordinal(X4))))&((~(subset(X3,X4))|ordinal_subset(X3,X4))|(~(ordinal(X3))|~(ordinal(X4))))),inference(distribute,[status(thm)],[159])).
% cnf(162,plain,(subset(X2,X1)|~ordinal(X1)|~ordinal(X2)|~ordinal_subset(X2,X1)),inference(split_conjunct,[status(thm)],[160])).
% fof(203, plain,![X1]:(~(epsilon_transitive(X1))|![X2]:(~(ordinal(X2))|(~(proper_subset(X1,X2))|in(X1,X2)))),inference(fof_nnf,[status(thm)],[36])).
% fof(204, plain,![X3]:(~(epsilon_transitive(X3))|![X4]:(~(ordinal(X4))|(~(proper_subset(X3,X4))|in(X3,X4)))),inference(variable_rename,[status(thm)],[203])).
% fof(205, plain,![X3]:![X4]:((~(ordinal(X4))|(~(proper_subset(X3,X4))|in(X3,X4)))|~(epsilon_transitive(X3))),inference(shift_quantors,[status(thm)],[204])).
% cnf(206,plain,(in(X1,X2)|~epsilon_transitive(X1)|~proper_subset(X1,X2)|~ordinal(X2)),inference(split_conjunct,[status(thm)],[205])).
% fof(277, negated_conjecture,?[X1]:(ordinal(X1)&((~(being_limit_ordinal(X1))&![X2]:(~(ordinal(X2))|~(X1=succ(X2))))|(?[X2]:(ordinal(X2)&X1=succ(X2))&being_limit_ordinal(X1)))),inference(fof_nnf,[status(thm)],[71])).
% fof(278, negated_conjecture,?[X3]:(ordinal(X3)&((~(being_limit_ordinal(X3))&![X4]:(~(ordinal(X4))|~(X3=succ(X4))))|(?[X5]:(ordinal(X5)&X3=succ(X5))&being_limit_ordinal(X3)))),inference(variable_rename,[status(thm)],[277])).
% fof(279, negated_conjecture,(ordinal(esk15_0)&((~(being_limit_ordinal(esk15_0))&![X4]:(~(ordinal(X4))|~(esk15_0=succ(X4))))|((ordinal(esk16_0)&esk15_0=succ(esk16_0))&being_limit_ordinal(esk15_0)))),inference(skolemize,[status(esa)],[278])).
% fof(280, negated_conjecture,![X4]:((((~(ordinal(X4))|~(esk15_0=succ(X4)))&~(being_limit_ordinal(esk15_0)))|((ordinal(esk16_0)&esk15_0=succ(esk16_0))&being_limit_ordinal(esk15_0)))&ordinal(esk15_0)),inference(shift_quantors,[status(thm)],[279])).
% fof(281, negated_conjecture,![X4]:(((((ordinal(esk16_0)|(~(ordinal(X4))|~(esk15_0=succ(X4))))&(esk15_0=succ(esk16_0)|(~(ordinal(X4))|~(esk15_0=succ(X4)))))&(being_limit_ordinal(esk15_0)|(~(ordinal(X4))|~(esk15_0=succ(X4)))))&(((ordinal(esk16_0)|~(being_limit_ordinal(esk15_0)))&(esk15_0=succ(esk16_0)|~(being_limit_ordinal(esk15_0))))&(being_limit_ordinal(esk15_0)|~(being_limit_ordinal(esk15_0)))))&ordinal(esk15_0)),inference(distribute,[status(thm)],[280])).
% cnf(282,negated_conjecture,(ordinal(esk15_0)),inference(split_conjunct,[status(thm)],[281])).
% cnf(284,negated_conjecture,(esk15_0=succ(esk16_0)|~being_limit_ordinal(esk15_0)),inference(split_conjunct,[status(thm)],[281])).
% cnf(285,negated_conjecture,(ordinal(esk16_0)|~being_limit_ordinal(esk15_0)),inference(split_conjunct,[status(thm)],[281])).
% cnf(286,negated_conjecture,(being_limit_ordinal(esk15_0)|esk15_0!=succ(X1)|~ordinal(X1)),inference(split_conjunct,[status(thm)],[281])).
% cnf(289,plain,(in(X1,set_union2(X1,singleton(X1)))),inference(rw,[status(thm)],[87,114,theory(equality)]),['unfolding']).
% cnf(290,negated_conjecture,(set_union2(esk16_0,singleton(esk16_0))=esk15_0|~being_limit_ordinal(esk15_0)),inference(rw,[status(thm)],[284,114,theory(equality)]),['unfolding']).
% cnf(291,plain,(ordinal(set_union2(X1,singleton(X1)))|~ordinal(X1)),inference(rw,[status(thm)],[130,114,theory(equality)]),['unfolding']).
% cnf(292,plain,(epsilon_transitive(set_union2(X1,singleton(X1)))|~ordinal(X1)),inference(rw,[status(thm)],[132,114,theory(equality)]),['unfolding']).
% cnf(296,negated_conjecture,(being_limit_ordinal(esk15_0)|set_union2(X1,singleton(X1))!=esk15_0|~ordinal(X1)),inference(rw,[status(thm)],[286,114,theory(equality)]),['unfolding']).
% cnf(297,plain,(being_limit_ordinal(X1)|~ordinal(X1)|~in(set_union2(esk1_1(X1),singleton(esk1_1(X1))),X1)),inference(rw,[status(thm)],[77,114,theory(equality)]),['unfolding']).
% cnf(299,plain,(ordinal_subset(set_union2(X1,singleton(X1)),X2)|~ordinal(X2)|~ordinal(X1)|~in(X1,X2)),inference(rw,[status(thm)],[120,114,theory(equality)]),['unfolding']).
% cnf(300,plain,(in(set_union2(X2,singleton(X2)),X1)|~ordinal(X2)|~ordinal(X1)|~being_limit_ordinal(X1)|~in(X2,X1)),inference(rw,[status(thm)],[80,114,theory(equality)]),['unfolding']).
% cnf(335,plain,(~in(set_union2(X1,singleton(X1)),X1)),inference(spm,[status(thm)],[90,289,theory(equality)])).
% cnf(392,plain,(in(X1,X2)|X1=X2|~epsilon_transitive(X1)|~ordinal(X2)|~subset(X1,X2)),inference(spm,[status(thm)],[206,155,theory(equality)])).
% cnf(408,plain,(subset(set_union2(X1,singleton(X1)),X2)|~ordinal(set_union2(X1,singleton(X1)))|~ordinal(X2)|~in(X1,X2)|~ordinal(X1)),inference(spm,[status(thm)],[162,299,theory(equality)])).
% cnf(489,plain,(~in(X1,X1)|~being_limit_ordinal(X1)|~ordinal(X1)),inference(spm,[status(thm)],[335,300,theory(equality)])).
% cnf(503,plain,(~being_limit_ordinal(set_union2(X1,singleton(X1)))|~ordinal(set_union2(X1,singleton(X1)))|~in(X1,set_union2(X1,singleton(X1)))|~ordinal(X1)),inference(spm,[status(thm)],[489,300,theory(equality)])).
% cnf(504,plain,(~being_limit_ordinal(set_union2(X1,singleton(X1)))|~ordinal(set_union2(X1,singleton(X1)))|$false|~ordinal(X1)),inference(rw,[status(thm)],[503,289,theory(equality)])).
% cnf(505,plain,(~being_limit_ordinal(set_union2(X1,singleton(X1)))|~ordinal(set_union2(X1,singleton(X1)))|~ordinal(X1)),inference(cn,[status(thm)],[504,theory(equality)])).
% cnf(518,plain,(~being_limit_ordinal(set_union2(X1,singleton(X1)))|~ordinal(X1)),inference(csr,[status(thm)],[505,291])).
% cnf(519,negated_conjecture,(~being_limit_ordinal(esk15_0)|~ordinal(esk16_0)),inference(spm,[status(thm)],[518,290,theory(equality)])).
% cnf(524,negated_conjecture,(~being_limit_ordinal(esk15_0)),inference(csr,[status(thm)],[519,285])).
% cnf(756,plain,(subset(set_union2(X1,singleton(X1)),X2)|~in(X1,X2)|~ordinal(X2)|~ordinal(X1)),inference(csr,[status(thm)],[408,291])).
% cnf(758,plain,(set_union2(X1,singleton(X1))=X2|in(set_union2(X1,singleton(X1)),X2)|~epsilon_transitive(set_union2(X1,singleton(X1)))|~ordinal(X2)|~in(X1,X2)|~ordinal(X1)),inference(spm,[status(thm)],[392,756,theory(equality)])).
% cnf(1608,plain,(set_union2(X1,singleton(X1))=X2|in(set_union2(X1,singleton(X1)),X2)|~in(X1,X2)|~ordinal(X2)|~ordinal(X1)),inference(csr,[status(thm)],[758,292])).
% cnf(1630,plain,(being_limit_ordinal(X1)|set_union2(esk1_1(X1),singleton(esk1_1(X1)))=X1|~ordinal(X1)|~in(esk1_1(X1),X1)|~ordinal(esk1_1(X1))),inference(spm,[status(thm)],[297,1608,theory(equality)])).
% cnf(2913,plain,(set_union2(esk1_1(X1),singleton(esk1_1(X1)))=X1|being_limit_ordinal(X1)|~in(esk1_1(X1),X1)|~ordinal(X1)),inference(csr,[status(thm)],[1630,79])).
% cnf(2914,plain,(set_union2(esk1_1(X1),singleton(esk1_1(X1)))=X1|being_limit_ordinal(X1)|~ordinal(X1)),inference(csr,[status(thm)],[2913,78])).
% cnf(2920,negated_conjecture,(being_limit_ordinal(esk15_0)|being_limit_ordinal(X1)|X1!=esk15_0|~ordinal(esk1_1(X1))|~ordinal(X1)),inference(spm,[status(thm)],[296,2914,theory(equality)])).
% cnf(2980,negated_conjecture,(being_limit_ordinal(X1)|X1!=esk15_0|~ordinal(esk1_1(X1))|~ordinal(X1)),inference(sr,[status(thm)],[2920,524,theory(equality)])).
% cnf(2993,negated_conjecture,(being_limit_ordinal(X1)|X1!=esk15_0|~ordinal(X1)),inference(csr,[status(thm)],[2980,79])).
% cnf(2998,negated_conjecture,(~ordinal(esk15_0)),inference(spm,[status(thm)],[524,2993,theory(equality)])).
% cnf(3025,negated_conjecture,($false),inference(rw,[status(thm)],[2998,282,theory(equality)])).
% cnf(3026,negated_conjecture,($false),inference(cn,[status(thm)],[3025,theory(equality)])).
% cnf(3027,negated_conjecture,($false),3026,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 785
% # ...of these trivial : 8
% # ...subsumed : 353
% # ...remaining for further processing: 424
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 9
% # Backward-rewritten : 23
% # Generated clauses : 1403
% # ...of the previous two non-trivial : 1251
% # Contextual simplify-reflections : 249
% # Paramodulations : 1399
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 390
% # Positive orientable unit clauses: 51
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 21
% # Non-unit-clauses : 317
% # Current number of unprocessed clauses: 476
% # ...number of literals in the above : 2318
% # Clause-clause subsumption calls (NU) : 5194
% # Rec. Clause-clause subsumption calls : 3081
% # Unit Clause-clause subsumption calls : 404
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 360 leaves, 1.17+/-0.581 terms/leaf
% # Paramod-from index: 169 leaves, 1.02+/-0.187 terms/leaf
% # Paramod-into index: 306 leaves, 1.12+/-0.462 terms/leaf
% # -------------------------------------------------
% # User time : 0.116 s
% # System time : 0.004 s
% # Total time : 0.120 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.33 WC
% FINAL PrfWatch: 0.24 CPU 0.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP6701/SEU238+1.tptp
%
%------------------------------------------------------------------------------