TSTP Solution File: SWC343+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC343+1 : TPTP v5.0.0. Released v2.4.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 07:53:44 EST 2010
% Result : Theorem 76.30s
% Output : Solution 76.75s
% 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/SystemOnTPTP27324/SWC343+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~co1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... (0)
% Unselected axioms are ... :ax2:ax12:ax16:ax17:ax18:ax19:ax20:ax21:ax26:ax27:ax28:ax33:ax34:ax68:ax69:ax79:ax80:ax81:ax82:ax83:ax84:ax90:ax70:ax10:ax3:ax13:ax14:ax4:ax85:ax86:ax23:ax25:ax44:ax22:ax37:ax75:ax92:ax93:ax59:ax61:ax63:ax65:ax71:ax73:ax5:ax6:ax7:ax36:ax91:ax24:ax46:ax52:ax58:ax76:ax8:ax9:ax11:ax35:ax43:ax50:ax56:ax78:ax38:ax29:ax45:ax30:ax31:ax39:ax40:ax42:ax47:ax49:ax51:ax53:ax55:ax57:ax60:ax62:ax64:ax66:ax72:ax74:ax88:ax89:ax94:ax95:ax1:ax87:ax67:ax41:ax48:ax54:ax15:ax77:ax32 (95)
% SZS status THM for /tmp/SystemOnTPTP27324/SWC343+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP27324/SWC343+1.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 27827
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(strictorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)<(X8,X6))))))))|(~(nil=X4)&nil=X3))|(?[X10]:(((ssList(X10)&app(X1,X10)=X2)&![X11]:(ssItem(X11)=>![X12]:(ssList(X12)=>(~(app(cons(X11,nil),X12)=X10)|![X13]:(ssItem(X13)=>![X14]:(ssList(X14)=>(~(app(X14,cons(X13,nil))=X1)|~(lt(X13,X11)))))))))&strictorderedP(X1))&(~(nil=X1)|nil=X2))))))),file('/tmp/SRASS.s.p', co1)).
% fof(2, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(strictorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)<(X8,X6))))))))|(~(nil=X4)&nil=X3))|(?[X10]:(((ssList(X10)&app(X1,X10)=X2)&![X11]:(ssItem(X11)=>![X12]:(ssList(X12)=>(~(app(cons(X11,nil),X12)=X10)|![X13]:(ssItem(X13)=>![X14]:(ssList(X14)=>(~(app(X14,cons(X13,nil))=X1)|~(lt(X13,X11)))))))))&strictorderedP(X1))&(~(nil=X1)|nil=X2)))))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(strictorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)<(X8,X6))))))))|(~(nil=X4)&nil=X3))|(?[X10]:(((ssList(X10)&app(X1,X10)=X2)&![X11]:(ssItem(X11)=>![X12]:(ssList(X12)=>(~(app(cons(X11,nil),X12)=X10)|![X13]:(ssItem(X13)=>![X14]:(ssList(X14)=>(~(app(X14,cons(X13,nil))=X1)|~(lt(X13,X11)))))))))&strictorderedP(X1))&(~(nil=X1)|nil=X2)))))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(4, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&?[X5]:(ssList(X5)&((app(X3,X5)=X4&strictorderedP(X3))&![X6]:(~(ssItem(X6))|![X7]:((~(ssList(X7))|~(app(cons(X6,nil),X7)=X5))|![X8]:(~(ssItem(X8))|![X9]:((~(ssList(X9))|~(app(X9,cons(X8,nil))=X3))|~(lt(X8,X6)))))))))&(nil=X4|~(nil=X3)))&(![X10]:(((~(ssList(X10))|~(app(X1,X10)=X2))|?[X11]:(ssItem(X11)&?[X12]:(ssList(X12)&(app(cons(X11,nil),X12)=X10&?[X13]:(ssItem(X13)&?[X14]:(ssList(X14)&(app(X14,cons(X13,nil))=X1<(X13,X11))))))))|~(strictorderedP(X1)))|(nil=X1&~(nil=X2)))))))),inference(fof_nnf,[status(thm)],[3])).
% fof(5, negated_conjecture,?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&?[X18]:(ssList(X18)&((((X16=X18&X15=X17)&?[X19]:(ssList(X19)&((app(X17,X19)=X18&strictorderedP(X17))&![X20]:(~(ssItem(X20))|![X21]:((~(ssList(X21))|~(app(cons(X20,nil),X21)=X19))|![X22]:(~(ssItem(X22))|![X23]:((~(ssList(X23))|~(app(X23,cons(X22,nil))=X17))|~(lt(X22,X20)))))))))&(nil=X18|~(nil=X17)))&(![X24]:(((~(ssList(X24))|~(app(X15,X24)=X16))|?[X25]:(ssItem(X25)&?[X26]:(ssList(X26)&(app(cons(X25,nil),X26)=X24&?[X27]:(ssItem(X27)&?[X28]:(ssList(X28)&(app(X28,cons(X27,nil))=X15<(X27,X25))))))))|~(strictorderedP(X15)))|(nil=X15&~(nil=X16)))))))),inference(variable_rename,[status(thm)],[4])).
% fof(6, negated_conjecture,(ssList(esk1_0)&(ssList(esk2_0)&(ssList(esk3_0)&(ssList(esk4_0)&((((esk2_0=esk4_0&esk1_0=esk3_0)&(ssList(esk5_0)&((app(esk3_0,esk5_0)=esk4_0&strictorderedP(esk3_0))&![X20]:(~(ssItem(X20))|![X21]:((~(ssList(X21))|~(app(cons(X20,nil),X21)=esk5_0))|![X22]:(~(ssItem(X22))|![X23]:((~(ssList(X23))|~(app(X23,cons(X22,nil))=esk3_0))|~(lt(X22,X20)))))))))&(nil=esk4_0|~(nil=esk3_0)))&(![X24]:(((~(ssList(X24))|~(app(esk1_0,X24)=esk2_0))|(ssItem(esk6_1(X24))&(ssList(esk7_1(X24))&(app(cons(esk6_1(X24),nil),esk7_1(X24))=X24&(ssItem(esk8_1(X24))&(ssList(esk9_1(X24))&(app(esk9_1(X24),cons(esk8_1(X24),nil))=esk1_0<(esk8_1(X24),esk6_1(X24)))))))))|~(strictorderedP(esk1_0)))|(nil=esk1_0&~(nil=esk2_0)))))))),inference(skolemize,[status(esa)],[5])).
% fof(7, negated_conjecture,![X20]:![X21]:![X22]:![X23]:![X24]:(((((((((~(ssList(X24))|~(app(esk1_0,X24)=esk2_0))|(ssItem(esk6_1(X24))&(ssList(esk7_1(X24))&(app(cons(esk6_1(X24),nil),esk7_1(X24))=X24&(ssItem(esk8_1(X24))&(ssList(esk9_1(X24))&(app(esk9_1(X24),cons(esk8_1(X24),nil))=esk1_0<(esk8_1(X24),esk6_1(X24)))))))))|~(strictorderedP(esk1_0)))|(nil=esk1_0&~(nil=esk2_0)))&(((((((((~(ssList(X23))|~(app(X23,cons(X22,nil))=esk3_0))|~(lt(X22,X20)))|~(ssItem(X22)))|(~(ssList(X21))|~(app(cons(X20,nil),X21)=esk5_0)))|~(ssItem(X20)))&(app(esk3_0,esk5_0)=esk4_0&strictorderedP(esk3_0)))&ssList(esk5_0))&(esk2_0=esk4_0&esk1_0=esk3_0))&(nil=esk4_0|~(nil=esk3_0))))&ssList(esk4_0))&ssList(esk3_0))&ssList(esk2_0))&ssList(esk1_0)),inference(shift_quantors,[status(thm)],[6])).
% fof(8, negated_conjecture,![X20]:![X21]:![X22]:![X23]:![X24]:((((((((nil=esk1_0|((ssItem(esk6_1(X24))|(~(ssList(X24))|~(app(esk1_0,X24)=esk2_0)))|~(strictorderedP(esk1_0))))&(~(nil=esk2_0)|((ssItem(esk6_1(X24))|(~(ssList(X24))|~(app(esk1_0,X24)=esk2_0)))|~(strictorderedP(esk1_0)))))&(((nil=esk1_0|((ssList(esk7_1(X24))|(~(ssList(X24))|~(app(esk1_0,X24)=esk2_0)))|~(strictorderedP(esk1_0))))&(~(nil=esk2_0)|((ssList(esk7_1(X24))|(~(ssList(X24))|~(app(esk1_0,X24)=esk2_0)))|~(strictorderedP(esk1_0)))))&(((nil=esk1_0|((app(cons(esk6_1(X24),nil),esk7_1(X24))=X24|(~(ssList(X24))|~(app(esk1_0,X24)=esk2_0)))|~(strictorderedP(esk1_0))))&(~(nil=esk2_0)|((app(cons(esk6_1(X24),nil),esk7_1(X24))=X24|(~(ssList(X24))|~(app(esk1_0,X24)=esk2_0)))|~(strictorderedP(esk1_0)))))&(((nil=esk1_0|((ssItem(esk8_1(X24))|(~(ssList(X24))|~(app(esk1_0,X24)=esk2_0)))|~(strictorderedP(esk1_0))))&(~(nil=esk2_0)|((ssItem(esk8_1(X24))|(~(ssList(X24))|~(app(esk1_0,X24)=esk2_0)))|~(strictorderedP(esk1_0)))))&(((nil=esk1_0|((ssList(esk9_1(X24))|(~(ssList(X24))|~(app(esk1_0,X24)=esk2_0)))|~(strictorderedP(esk1_0))))&(~(nil=esk2_0)|((ssList(esk9_1(X24))|(~(ssList(X24))|~(app(esk1_0,X24)=esk2_0)))|~(strictorderedP(esk1_0)))))&(((nil=esk1_0|((app(esk9_1(X24),cons(esk8_1(X24),nil))=esk1_0|(~(ssList(X24))|~(app(esk1_0,X24)=esk2_0)))|~(strictorderedP(esk1_0))))&(~(nil=esk2_0)|((app(esk9_1(X24),cons(esk8_1(X24),nil))=esk1_0|(~(ssList(X24))|~(app(esk1_0,X24)=esk2_0)))|~(strictorderedP(esk1_0)))))&((nil=esk1_0|((lt(esk8_1(X24),esk6_1(X24))|(~(ssList(X24))|~(app(esk1_0,X24)=esk2_0)))|~(strictorderedP(esk1_0))))&(~(nil=esk2_0)|((lt(esk8_1(X24),esk6_1(X24))|(~(ssList(X24))|~(app(esk1_0,X24)=esk2_0)))|~(strictorderedP(esk1_0)))))))))))&(((((((((~(ssList(X23))|~(app(X23,cons(X22,nil))=esk3_0))|~(lt(X22,X20)))|~(ssItem(X22)))|(~(ssList(X21))|~(app(cons(X20,nil),X21)=esk5_0)))|~(ssItem(X20)))&(app(esk3_0,esk5_0)=esk4_0&strictorderedP(esk3_0)))&ssList(esk5_0))&(esk2_0=esk4_0&esk1_0=esk3_0))&(nil=esk4_0|~(nil=esk3_0))))&ssList(esk4_0))&ssList(esk3_0))&ssList(esk2_0))&ssList(esk1_0)),inference(distribute,[status(thm)],[7])).
% cnf(13,negated_conjecture,(nil=esk4_0|nil!=esk3_0),inference(split_conjunct,[status(thm)],[8])).
% cnf(14,negated_conjecture,(esk1_0=esk3_0),inference(split_conjunct,[status(thm)],[8])).
% cnf(15,negated_conjecture,(esk2_0=esk4_0),inference(split_conjunct,[status(thm)],[8])).
% cnf(16,negated_conjecture,(ssList(esk5_0)),inference(split_conjunct,[status(thm)],[8])).
% cnf(17,negated_conjecture,(strictorderedP(esk3_0)),inference(split_conjunct,[status(thm)],[8])).
% cnf(18,negated_conjecture,(app(esk3_0,esk5_0)=esk4_0),inference(split_conjunct,[status(thm)],[8])).
% cnf(19,negated_conjecture,(~ssItem(X1)|app(cons(X1,nil),X2)!=esk5_0|~ssList(X2)|~ssItem(X3)|~lt(X3,X1)|app(X4,cons(X3,nil))!=esk3_0|~ssList(X4)),inference(split_conjunct,[status(thm)],[8])).
% cnf(20,negated_conjecture,(lt(esk8_1(X1),esk6_1(X1))|~strictorderedP(esk1_0)|app(esk1_0,X1)!=esk2_0|~ssList(X1)|nil!=esk2_0),inference(split_conjunct,[status(thm)],[8])).
% cnf(21,negated_conjecture,(lt(esk8_1(X1),esk6_1(X1))|nil=esk1_0|~strictorderedP(esk1_0)|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(split_conjunct,[status(thm)],[8])).
% cnf(22,negated_conjecture,(app(esk9_1(X1),cons(esk8_1(X1),nil))=esk1_0|~strictorderedP(esk1_0)|app(esk1_0,X1)!=esk2_0|~ssList(X1)|nil!=esk2_0),inference(split_conjunct,[status(thm)],[8])).
% cnf(23,negated_conjecture,(app(esk9_1(X1),cons(esk8_1(X1),nil))=esk1_0|nil=esk1_0|~strictorderedP(esk1_0)|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(split_conjunct,[status(thm)],[8])).
% cnf(24,negated_conjecture,(ssList(esk9_1(X1))|~strictorderedP(esk1_0)|app(esk1_0,X1)!=esk2_0|~ssList(X1)|nil!=esk2_0),inference(split_conjunct,[status(thm)],[8])).
% cnf(25,negated_conjecture,(ssList(esk9_1(X1))|nil=esk1_0|~strictorderedP(esk1_0)|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(split_conjunct,[status(thm)],[8])).
% cnf(26,negated_conjecture,(ssItem(esk8_1(X1))|~strictorderedP(esk1_0)|app(esk1_0,X1)!=esk2_0|~ssList(X1)|nil!=esk2_0),inference(split_conjunct,[status(thm)],[8])).
% cnf(27,negated_conjecture,(ssItem(esk8_1(X1))|nil=esk1_0|~strictorderedP(esk1_0)|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(split_conjunct,[status(thm)],[8])).
% cnf(28,negated_conjecture,(app(cons(esk6_1(X1),nil),esk7_1(X1))=X1|~strictorderedP(esk1_0)|app(esk1_0,X1)!=esk2_0|~ssList(X1)|nil!=esk2_0),inference(split_conjunct,[status(thm)],[8])).
% cnf(29,negated_conjecture,(app(cons(esk6_1(X1),nil),esk7_1(X1))=X1|nil=esk1_0|~strictorderedP(esk1_0)|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(split_conjunct,[status(thm)],[8])).
% cnf(30,negated_conjecture,(ssList(esk7_1(X1))|~strictorderedP(esk1_0)|app(esk1_0,X1)!=esk2_0|~ssList(X1)|nil!=esk2_0),inference(split_conjunct,[status(thm)],[8])).
% cnf(31,negated_conjecture,(ssList(esk7_1(X1))|nil=esk1_0|~strictorderedP(esk1_0)|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(split_conjunct,[status(thm)],[8])).
% cnf(32,negated_conjecture,(ssItem(esk6_1(X1))|~strictorderedP(esk1_0)|app(esk1_0,X1)!=esk2_0|~ssList(X1)|nil!=esk2_0),inference(split_conjunct,[status(thm)],[8])).
% cnf(33,negated_conjecture,(ssItem(esk6_1(X1))|nil=esk1_0|~strictorderedP(esk1_0)|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(split_conjunct,[status(thm)],[8])).
% cnf(36,negated_conjecture,(strictorderedP(esk1_0)),inference(rw,[status(thm)],[17,14,theory(equality)])).
% cnf(37,negated_conjecture,(esk2_0=nil|esk3_0!=nil),inference(rw,[status(thm)],[13,15,theory(equality)])).
% cnf(38,negated_conjecture,(esk2_0=nil|esk1_0!=nil),inference(rw,[status(thm)],[37,14,theory(equality)])).
% cnf(39,negated_conjecture,(app(esk1_0,esk5_0)=esk4_0),inference(rw,[status(thm)],[18,14,theory(equality)])).
% cnf(40,negated_conjecture,(app(esk1_0,esk5_0)=esk2_0),inference(rw,[status(thm)],[39,15,theory(equality)])).
% cnf(41,negated_conjecture,(esk1_0=nil|ssList(esk7_1(X1))|app(esk1_0,X1)!=esk2_0|~ssList(X1)|$false),inference(rw,[status(thm)],[31,36,theory(equality)])).
% cnf(42,negated_conjecture,(esk1_0=nil|ssList(esk7_1(X1))|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(cn,[status(thm)],[41,theory(equality)])).
% cnf(43,negated_conjecture,(nil=esk1_0|ssList(esk7_1(esk5_0))|~ssList(esk5_0)),inference(spm,[status(thm)],[42,40,theory(equality)])).
% cnf(44,negated_conjecture,(nil=esk1_0|ssList(esk7_1(esk5_0))|$false),inference(rw,[status(thm)],[43,16,theory(equality)])).
% cnf(45,negated_conjecture,(nil=esk1_0|ssList(esk7_1(esk5_0))),inference(cn,[status(thm)],[44,theory(equality)])).
% cnf(46,negated_conjecture,(ssList(esk7_1(X1))|esk2_0!=nil|app(esk1_0,X1)!=esk2_0|~ssList(X1)|$false),inference(rw,[status(thm)],[30,36,theory(equality)])).
% cnf(47,negated_conjecture,(ssList(esk7_1(X1))|esk2_0!=nil|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(cn,[status(thm)],[46,theory(equality)])).
% cnf(48,negated_conjecture,(ssList(esk9_1(X1))|esk2_0!=nil|app(esk1_0,X1)!=esk2_0|~ssList(X1)|$false),inference(rw,[status(thm)],[24,36,theory(equality)])).
% cnf(49,negated_conjecture,(ssList(esk9_1(X1))|esk2_0!=nil|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(cn,[status(thm)],[48,theory(equality)])).
% cnf(50,negated_conjecture,(ssItem(esk6_1(X1))|esk2_0!=nil|app(esk1_0,X1)!=esk2_0|~ssList(X1)|$false),inference(rw,[status(thm)],[32,36,theory(equality)])).
% cnf(51,negated_conjecture,(ssItem(esk6_1(X1))|esk2_0!=nil|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(cn,[status(thm)],[50,theory(equality)])).
% cnf(52,negated_conjecture,(ssItem(esk8_1(X1))|esk2_0!=nil|app(esk1_0,X1)!=esk2_0|~ssList(X1)|$false),inference(rw,[status(thm)],[26,36,theory(equality)])).
% cnf(53,negated_conjecture,(ssItem(esk8_1(X1))|esk2_0!=nil|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(cn,[status(thm)],[52,theory(equality)])).
% cnf(54,negated_conjecture,(esk1_0=nil|ssList(esk9_1(X1))|app(esk1_0,X1)!=esk2_0|~ssList(X1)|$false),inference(rw,[status(thm)],[25,36,theory(equality)])).
% cnf(55,negated_conjecture,(esk1_0=nil|ssList(esk9_1(X1))|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(cn,[status(thm)],[54,theory(equality)])).
% cnf(56,negated_conjecture,(nil=esk1_0|ssList(esk9_1(esk5_0))|~ssList(esk5_0)),inference(spm,[status(thm)],[55,40,theory(equality)])).
% cnf(57,negated_conjecture,(nil=esk1_0|ssList(esk9_1(esk5_0))|$false),inference(rw,[status(thm)],[56,16,theory(equality)])).
% cnf(58,negated_conjecture,(nil=esk1_0|ssList(esk9_1(esk5_0))),inference(cn,[status(thm)],[57,theory(equality)])).
% cnf(59,negated_conjecture,(esk1_0=nil|ssItem(esk6_1(X1))|app(esk1_0,X1)!=esk2_0|~ssList(X1)|$false),inference(rw,[status(thm)],[33,36,theory(equality)])).
% cnf(60,negated_conjecture,(esk1_0=nil|ssItem(esk6_1(X1))|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(cn,[status(thm)],[59,theory(equality)])).
% cnf(61,negated_conjecture,(nil=esk1_0|ssItem(esk6_1(esk5_0))|~ssList(esk5_0)),inference(spm,[status(thm)],[60,40,theory(equality)])).
% cnf(62,negated_conjecture,(nil=esk1_0|ssItem(esk6_1(esk5_0))|$false),inference(rw,[status(thm)],[61,16,theory(equality)])).
% cnf(63,negated_conjecture,(nil=esk1_0|ssItem(esk6_1(esk5_0))),inference(cn,[status(thm)],[62,theory(equality)])).
% cnf(64,negated_conjecture,(esk1_0=nil|ssItem(esk8_1(X1))|app(esk1_0,X1)!=esk2_0|~ssList(X1)|$false),inference(rw,[status(thm)],[27,36,theory(equality)])).
% cnf(65,negated_conjecture,(esk1_0=nil|ssItem(esk8_1(X1))|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(cn,[status(thm)],[64,theory(equality)])).
% cnf(66,negated_conjecture,(nil=esk1_0|ssItem(esk8_1(esk5_0))|~ssList(esk5_0)),inference(spm,[status(thm)],[65,40,theory(equality)])).
% cnf(67,negated_conjecture,(nil=esk1_0|ssItem(esk8_1(esk5_0))|$false),inference(rw,[status(thm)],[66,16,theory(equality)])).
% cnf(68,negated_conjecture,(nil=esk1_0|ssItem(esk8_1(esk5_0))),inference(cn,[status(thm)],[67,theory(equality)])).
% cnf(69,negated_conjecture,(lt(esk8_1(X1),esk6_1(X1))|esk2_0!=nil|app(esk1_0,X1)!=esk2_0|~ssList(X1)|$false),inference(rw,[status(thm)],[20,36,theory(equality)])).
% cnf(70,negated_conjecture,(lt(esk8_1(X1),esk6_1(X1))|esk2_0!=nil|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(cn,[status(thm)],[69,theory(equality)])).
% cnf(71,negated_conjecture,(esk1_0=nil|lt(esk8_1(X1),esk6_1(X1))|app(esk1_0,X1)!=esk2_0|~ssList(X1)|$false),inference(rw,[status(thm)],[21,36,theory(equality)])).
% cnf(72,negated_conjecture,(esk1_0=nil|lt(esk8_1(X1),esk6_1(X1))|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(cn,[status(thm)],[71,theory(equality)])).
% cnf(73,negated_conjecture,(nil=esk1_0|lt(esk8_1(esk5_0),esk6_1(esk5_0))|~ssList(esk5_0)),inference(spm,[status(thm)],[72,40,theory(equality)])).
% cnf(74,negated_conjecture,(nil=esk1_0|lt(esk8_1(esk5_0),esk6_1(esk5_0))|$false),inference(rw,[status(thm)],[73,16,theory(equality)])).
% cnf(75,negated_conjecture,(nil=esk1_0|lt(esk8_1(esk5_0),esk6_1(esk5_0))),inference(cn,[status(thm)],[74,theory(equality)])).
% cnf(76,negated_conjecture,(app(esk9_1(X1),cons(esk8_1(X1),nil))=esk1_0|esk2_0!=nil|app(esk1_0,X1)!=esk2_0|~ssList(X1)|$false),inference(rw,[status(thm)],[22,36,theory(equality)])).
% cnf(77,negated_conjecture,(app(esk9_1(X1),cons(esk8_1(X1),nil))=esk1_0|esk2_0!=nil|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(cn,[status(thm)],[76,theory(equality)])).
% cnf(78,negated_conjecture,(esk1_0=nil|app(esk9_1(X1),cons(esk8_1(X1),nil))=esk1_0|app(esk1_0,X1)!=esk2_0|~ssList(X1)|$false),inference(rw,[status(thm)],[23,36,theory(equality)])).
% cnf(79,negated_conjecture,(esk1_0=nil|app(esk9_1(X1),cons(esk8_1(X1),nil))=esk1_0|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(cn,[status(thm)],[78,theory(equality)])).
% cnf(80,negated_conjecture,(app(esk9_1(esk5_0),cons(esk8_1(esk5_0),nil))=esk1_0|nil=esk1_0|~ssList(esk5_0)),inference(spm,[status(thm)],[79,40,theory(equality)])).
% cnf(81,negated_conjecture,(app(esk9_1(esk5_0),cons(esk8_1(esk5_0),nil))=esk1_0|nil=esk1_0|$false),inference(rw,[status(thm)],[80,16,theory(equality)])).
% cnf(82,negated_conjecture,(app(esk9_1(esk5_0),cons(esk8_1(esk5_0),nil))=esk1_0|nil=esk1_0),inference(cn,[status(thm)],[81,theory(equality)])).
% cnf(83,negated_conjecture,(app(cons(esk6_1(X1),nil),esk7_1(X1))=X1|esk2_0!=nil|app(esk1_0,X1)!=esk2_0|~ssList(X1)|$false),inference(rw,[status(thm)],[28,36,theory(equality)])).
% cnf(84,negated_conjecture,(app(cons(esk6_1(X1),nil),esk7_1(X1))=X1|esk2_0!=nil|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(cn,[status(thm)],[83,theory(equality)])).
% cnf(85,negated_conjecture,(esk1_0=nil|app(cons(esk6_1(X1),nil),esk7_1(X1))=X1|app(esk1_0,X1)!=esk2_0|~ssList(X1)|$false),inference(rw,[status(thm)],[29,36,theory(equality)])).
% cnf(86,negated_conjecture,(esk1_0=nil|app(cons(esk6_1(X1),nil),esk7_1(X1))=X1|app(esk1_0,X1)!=esk2_0|~ssList(X1)),inference(cn,[status(thm)],[85,theory(equality)])).
% cnf(87,negated_conjecture,(app(cons(esk6_1(esk5_0),nil),esk7_1(esk5_0))=esk5_0|nil=esk1_0|~ssList(esk5_0)),inference(spm,[status(thm)],[86,40,theory(equality)])).
% cnf(88,negated_conjecture,(app(cons(esk6_1(esk5_0),nil),esk7_1(esk5_0))=esk5_0|nil=esk1_0|$false),inference(rw,[status(thm)],[87,16,theory(equality)])).
% cnf(89,negated_conjecture,(app(cons(esk6_1(esk5_0),nil),esk7_1(esk5_0))=esk5_0|nil=esk1_0),inference(cn,[status(thm)],[88,theory(equality)])).
% cnf(90,negated_conjecture,(app(X4,cons(X3,nil))!=esk1_0|app(cons(X1,nil),X2)!=esk5_0|~ssList(X4)|~ssList(X2)|~ssItem(X3)|~ssItem(X1)|~lt(X3,X1)),inference(rw,[status(thm)],[19,14,theory(equality)])).
% cnf(91,negated_conjecture,(nil=esk1_0|app(cons(X1,nil),X2)!=esk5_0|~lt(esk8_1(esk5_0),X1)|~ssItem(esk8_1(esk5_0))|~ssItem(X1)|~ssList(esk9_1(esk5_0))|~ssList(X2)),inference(spm,[status(thm)],[90,82,theory(equality)])).
% cnf(92,negated_conjecture,(nil=esk1_0|app(cons(X1,nil),X2)!=esk5_0|~lt(esk8_1(esk5_0),X1)|~ssItem(esk8_1(esk5_0))|~ssItem(X1)|~ssList(X2)),inference(csr,[status(thm)],[91,58])).
% cnf(93,negated_conjecture,(nil=esk1_0|app(cons(X1,nil),X2)!=esk5_0|~lt(esk8_1(esk5_0),X1)|~ssItem(X1)|~ssList(X2)),inference(csr,[status(thm)],[92,68])).
% cnf(94,negated_conjecture,(nil=esk1_0|app(cons(esk6_1(esk5_0),nil),X1)!=esk5_0|~ssItem(esk6_1(esk5_0))|~ssList(X1)),inference(spm,[status(thm)],[93,75,theory(equality)])).
% cnf(95,negated_conjecture,(nil=esk1_0|app(cons(esk6_1(esk5_0),nil),X1)!=esk5_0|~ssList(X1)),inference(csr,[status(thm)],[94,63])).
% cnf(96,negated_conjecture,(nil=esk1_0|~ssList(esk7_1(esk5_0))),inference(spm,[status(thm)],[95,89,theory(equality)])).
% cnf(97,negated_conjecture,(nil=esk1_0),inference(csr,[status(thm)],[96,45])).
% cnf(110,negated_conjecture,(app(X1,cons(X2,esk1_0))!=esk1_0|app(cons(X3,nil),X4)!=esk5_0|~lt(X2,X3)|~ssItem(X2)|~ssItem(X3)|~ssList(X1)|~ssList(X4)),inference(rw,[status(thm)],[90,97,theory(equality)])).
% cnf(111,negated_conjecture,(app(X1,cons(X2,esk1_0))!=esk1_0|app(cons(X3,esk1_0),X4)!=esk5_0|~lt(X2,X3)|~ssItem(X2)|~ssItem(X3)|~ssList(X1)|~ssList(X4)),inference(rw,[status(thm)],[110,97,theory(equality)])).
% cnf(112,negated_conjecture,(app(cons(esk6_1(X1),esk1_0),esk7_1(X1))=X1|app(esk1_0,X1)!=esk2_0|nil!=esk2_0|~ssList(X1)),inference(rw,[status(thm)],[84,97,theory(equality)])).
% cnf(113,negated_conjecture,(app(cons(esk6_1(X1),esk1_0),esk7_1(X1))=X1|app(esk1_0,X1)!=esk2_0|esk1_0!=esk2_0|~ssList(X1)),inference(rw,[status(thm)],[112,97,theory(equality)])).
% cnf(116,negated_conjecture,(app(esk9_1(X1),cons(esk8_1(X1),esk1_0))=esk1_0|app(esk1_0,X1)!=esk2_0|nil!=esk2_0|~ssList(X1)),inference(rw,[status(thm)],[77,97,theory(equality)])).
% cnf(117,negated_conjecture,(app(esk9_1(X1),cons(esk8_1(X1),esk1_0))=esk1_0|app(esk1_0,X1)!=esk2_0|esk1_0!=esk2_0|~ssList(X1)),inference(rw,[status(thm)],[116,97,theory(equality)])).
% cnf(120,negated_conjecture,(lt(esk8_1(X1),esk6_1(X1))|app(esk1_0,X1)!=esk2_0|esk1_0!=esk2_0|~ssList(X1)),inference(rw,[status(thm)],[70,97,theory(equality)])).
% cnf(122,negated_conjecture,(ssItem(esk8_1(X1))|app(esk1_0,X1)!=esk2_0|esk1_0!=esk2_0|~ssList(X1)),inference(rw,[status(thm)],[53,97,theory(equality)])).
% cnf(123,negated_conjecture,(ssItem(esk6_1(X1))|app(esk1_0,X1)!=esk2_0|esk1_0!=esk2_0|~ssList(X1)),inference(rw,[status(thm)],[51,97,theory(equality)])).
% cnf(124,negated_conjecture,(ssList(esk9_1(X1))|app(esk1_0,X1)!=esk2_0|esk1_0!=esk2_0|~ssList(X1)),inference(rw,[status(thm)],[49,97,theory(equality)])).
% cnf(125,negated_conjecture,(ssList(esk7_1(X1))|app(esk1_0,X1)!=esk2_0|esk1_0!=esk2_0|~ssList(X1)),inference(rw,[status(thm)],[47,97,theory(equality)])).
% cnf(131,negated_conjecture,(esk1_0=esk2_0|nil!=esk1_0),inference(rw,[status(thm)],[38,97,theory(equality)])).
% cnf(132,negated_conjecture,(esk1_0=esk2_0|$false),inference(rw,[status(thm)],[131,97,theory(equality)])).
% cnf(133,negated_conjecture,(esk1_0=esk2_0),inference(cn,[status(thm)],[132,theory(equality)])).
% cnf(134,negated_conjecture,(app(esk1_0,esk5_0)=esk1_0),inference(rw,[status(thm)],[40,133,theory(equality)])).
% cnf(137,negated_conjecture,(ssItem(esk8_1(X1))|app(esk1_0,X1)!=esk1_0|esk2_0!=esk1_0|~ssList(X1)),inference(rw,[status(thm)],[122,133,theory(equality)])).
% cnf(138,negated_conjecture,(ssItem(esk8_1(X1))|app(esk1_0,X1)!=esk1_0|$false|~ssList(X1)),inference(rw,[status(thm)],[137,133,theory(equality)])).
% cnf(139,negated_conjecture,(ssItem(esk8_1(X1))|app(esk1_0,X1)!=esk1_0|~ssList(X1)),inference(cn,[status(thm)],[138,theory(equality)])).
% cnf(140,negated_conjecture,(ssItem(esk8_1(esk5_0))|~ssList(esk5_0)),inference(spm,[status(thm)],[139,134,theory(equality)])).
% cnf(141,negated_conjecture,(ssItem(esk8_1(esk5_0))|$false),inference(rw,[status(thm)],[140,16,theory(equality)])).
% cnf(142,negated_conjecture,(ssItem(esk8_1(esk5_0))),inference(cn,[status(thm)],[141,theory(equality)])).
% cnf(143,negated_conjecture,(ssItem(esk6_1(X1))|app(esk1_0,X1)!=esk1_0|esk2_0!=esk1_0|~ssList(X1)),inference(rw,[status(thm)],[123,133,theory(equality)])).
% cnf(144,negated_conjecture,(ssItem(esk6_1(X1))|app(esk1_0,X1)!=esk1_0|$false|~ssList(X1)),inference(rw,[status(thm)],[143,133,theory(equality)])).
% cnf(145,negated_conjecture,(ssItem(esk6_1(X1))|app(esk1_0,X1)!=esk1_0|~ssList(X1)),inference(cn,[status(thm)],[144,theory(equality)])).
% cnf(146,negated_conjecture,(ssItem(esk6_1(esk5_0))|~ssList(esk5_0)),inference(spm,[status(thm)],[145,134,theory(equality)])).
% cnf(147,negated_conjecture,(ssItem(esk6_1(esk5_0))|$false),inference(rw,[status(thm)],[146,16,theory(equality)])).
% cnf(148,negated_conjecture,(ssItem(esk6_1(esk5_0))),inference(cn,[status(thm)],[147,theory(equality)])).
% cnf(149,negated_conjecture,(ssList(esk9_1(X1))|app(esk1_0,X1)!=esk1_0|esk2_0!=esk1_0|~ssList(X1)),inference(rw,[status(thm)],[124,133,theory(equality)])).
% cnf(150,negated_conjecture,(ssList(esk9_1(X1))|app(esk1_0,X1)!=esk1_0|$false|~ssList(X1)),inference(rw,[status(thm)],[149,133,theory(equality)])).
% cnf(151,negated_conjecture,(ssList(esk9_1(X1))|app(esk1_0,X1)!=esk1_0|~ssList(X1)),inference(cn,[status(thm)],[150,theory(equality)])).
% cnf(152,negated_conjecture,(ssList(esk9_1(esk5_0))|~ssList(esk5_0)),inference(spm,[status(thm)],[151,134,theory(equality)])).
% cnf(153,negated_conjecture,(ssList(esk9_1(esk5_0))|$false),inference(rw,[status(thm)],[152,16,theory(equality)])).
% cnf(154,negated_conjecture,(ssList(esk9_1(esk5_0))),inference(cn,[status(thm)],[153,theory(equality)])).
% cnf(155,negated_conjecture,(ssList(esk7_1(X1))|app(esk1_0,X1)!=esk1_0|esk2_0!=esk1_0|~ssList(X1)),inference(rw,[status(thm)],[125,133,theory(equality)])).
% cnf(156,negated_conjecture,(ssList(esk7_1(X1))|app(esk1_0,X1)!=esk1_0|$false|~ssList(X1)),inference(rw,[status(thm)],[155,133,theory(equality)])).
% cnf(157,negated_conjecture,(ssList(esk7_1(X1))|app(esk1_0,X1)!=esk1_0|~ssList(X1)),inference(cn,[status(thm)],[156,theory(equality)])).
% cnf(158,negated_conjecture,(ssList(esk7_1(esk5_0))|~ssList(esk5_0)),inference(spm,[status(thm)],[157,134,theory(equality)])).
% cnf(159,negated_conjecture,(ssList(esk7_1(esk5_0))|$false),inference(rw,[status(thm)],[158,16,theory(equality)])).
% cnf(160,negated_conjecture,(ssList(esk7_1(esk5_0))),inference(cn,[status(thm)],[159,theory(equality)])).
% cnf(161,negated_conjecture,(lt(esk8_1(X1),esk6_1(X1))|app(esk1_0,X1)!=esk1_0|esk2_0!=esk1_0|~ssList(X1)),inference(rw,[status(thm)],[120,133,theory(equality)])).
% cnf(162,negated_conjecture,(lt(esk8_1(X1),esk6_1(X1))|app(esk1_0,X1)!=esk1_0|$false|~ssList(X1)),inference(rw,[status(thm)],[161,133,theory(equality)])).
% cnf(163,negated_conjecture,(lt(esk8_1(X1),esk6_1(X1))|app(esk1_0,X1)!=esk1_0|~ssList(X1)),inference(cn,[status(thm)],[162,theory(equality)])).
% cnf(164,negated_conjecture,(lt(esk8_1(esk5_0),esk6_1(esk5_0))|~ssList(esk5_0)),inference(spm,[status(thm)],[163,134,theory(equality)])).
% cnf(165,negated_conjecture,(lt(esk8_1(esk5_0),esk6_1(esk5_0))|$false),inference(rw,[status(thm)],[164,16,theory(equality)])).
% cnf(166,negated_conjecture,(lt(esk8_1(esk5_0),esk6_1(esk5_0))),inference(cn,[status(thm)],[165,theory(equality)])).
% cnf(167,negated_conjecture,(app(esk9_1(X1),cons(esk8_1(X1),esk1_0))=esk1_0|app(esk1_0,X1)!=esk1_0|esk2_0!=esk1_0|~ssList(X1)),inference(rw,[status(thm)],[117,133,theory(equality)])).
% cnf(168,negated_conjecture,(app(esk9_1(X1),cons(esk8_1(X1),esk1_0))=esk1_0|app(esk1_0,X1)!=esk1_0|$false|~ssList(X1)),inference(rw,[status(thm)],[167,133,theory(equality)])).
% cnf(169,negated_conjecture,(app(esk9_1(X1),cons(esk8_1(X1),esk1_0))=esk1_0|app(esk1_0,X1)!=esk1_0|~ssList(X1)),inference(cn,[status(thm)],[168,theory(equality)])).
% cnf(170,negated_conjecture,(app(esk9_1(esk5_0),cons(esk8_1(esk5_0),esk1_0))=esk1_0|~ssList(esk5_0)),inference(spm,[status(thm)],[169,134,theory(equality)])).
% cnf(171,negated_conjecture,(app(esk9_1(esk5_0),cons(esk8_1(esk5_0),esk1_0))=esk1_0|$false),inference(rw,[status(thm)],[170,16,theory(equality)])).
% cnf(172,negated_conjecture,(app(esk9_1(esk5_0),cons(esk8_1(esk5_0),esk1_0))=esk1_0),inference(cn,[status(thm)],[171,theory(equality)])).
% cnf(173,negated_conjecture,(app(cons(X1,esk1_0),X2)!=esk5_0|~lt(esk8_1(esk5_0),X1)|~ssItem(esk8_1(esk5_0))|~ssItem(X1)|~ssList(esk9_1(esk5_0))|~ssList(X2)),inference(spm,[status(thm)],[111,172,theory(equality)])).
% cnf(174,negated_conjecture,(app(cons(X1,esk1_0),X2)!=esk5_0|~lt(esk8_1(esk5_0),X1)|$false|~ssItem(X1)|~ssList(esk9_1(esk5_0))|~ssList(X2)),inference(rw,[status(thm)],[173,142,theory(equality)])).
% cnf(175,negated_conjecture,(app(cons(X1,esk1_0),X2)!=esk5_0|~lt(esk8_1(esk5_0),X1)|$false|~ssItem(X1)|$false|~ssList(X2)),inference(rw,[status(thm)],[174,154,theory(equality)])).
% cnf(176,negated_conjecture,(app(cons(X1,esk1_0),X2)!=esk5_0|~lt(esk8_1(esk5_0),X1)|~ssItem(X1)|~ssList(X2)),inference(cn,[status(thm)],[175,theory(equality)])).
% cnf(177,negated_conjecture,(app(cons(esk6_1(esk5_0),esk1_0),X1)!=esk5_0|~ssItem(esk6_1(esk5_0))|~ssList(X1)),inference(spm,[status(thm)],[176,166,theory(equality)])).
% cnf(178,negated_conjecture,(app(cons(esk6_1(esk5_0),esk1_0),X1)!=esk5_0|$false|~ssList(X1)),inference(rw,[status(thm)],[177,148,theory(equality)])).
% cnf(179,negated_conjecture,(app(cons(esk6_1(esk5_0),esk1_0),X1)!=esk5_0|~ssList(X1)),inference(cn,[status(thm)],[178,theory(equality)])).
% cnf(180,negated_conjecture,(app(cons(esk6_1(X1),esk1_0),esk7_1(X1))=X1|app(esk1_0,X1)!=esk1_0|esk2_0!=esk1_0|~ssList(X1)),inference(rw,[status(thm)],[113,133,theory(equality)])).
% cnf(181,negated_conjecture,(app(cons(esk6_1(X1),esk1_0),esk7_1(X1))=X1|app(esk1_0,X1)!=esk1_0|$false|~ssList(X1)),inference(rw,[status(thm)],[180,133,theory(equality)])).
% cnf(182,negated_conjecture,(app(cons(esk6_1(X1),esk1_0),esk7_1(X1))=X1|app(esk1_0,X1)!=esk1_0|~ssList(X1)),inference(cn,[status(thm)],[181,theory(equality)])).
% cnf(183,negated_conjecture,(app(cons(esk6_1(esk5_0),esk1_0),esk7_1(esk5_0))=esk5_0|~ssList(esk5_0)),inference(spm,[status(thm)],[182,134,theory(equality)])).
% cnf(184,negated_conjecture,(app(cons(esk6_1(esk5_0),esk1_0),esk7_1(esk5_0))=esk5_0|$false),inference(rw,[status(thm)],[183,16,theory(equality)])).
% cnf(185,negated_conjecture,(app(cons(esk6_1(esk5_0),esk1_0),esk7_1(esk5_0))=esk5_0),inference(cn,[status(thm)],[184,theory(equality)])).
% cnf(186,negated_conjecture,(~ssList(esk7_1(esk5_0))),inference(spm,[status(thm)],[179,185,theory(equality)])).
% cnf(187,negated_conjecture,($false),inference(rw,[status(thm)],[186,160,theory(equality)])).
% cnf(188,negated_conjecture,($false),inference(cn,[status(thm)],[187,theory(equality)])).
% cnf(189,negated_conjecture,($false),188,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 55
% # ...of these trivial : 2
% # ...subsumed : 0
% # ...remaining for further processing: 53
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 28
% # Generated clauses : 20
% # ...of the previous two non-trivial : 30
% # Contextual simplify-reflections : 4
% # Paramodulations : 20
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 25
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 10
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 4
% # Rec. Clause-clause subsumption calls : 4
% # 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: 46 leaves, 1.15+/-0.509 terms/leaf
% # Paramod-from index: 15 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 28 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.005 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP27324/SWC343+1.tptp
%
%------------------------------------------------------------------------------