TSTP Solution File: SWC002+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC002+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 : art05.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 06:48:05 EST 2010
% Result : Theorem 73.90s
% Output : Solution 74.78s
% 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/SystemOnTPTP13005/SWC002+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 ... :ax1:ax2:ax3:ax15:ax16:ax17:ax18:ax19:ax20:ax21:ax26:ax27:ax28:ax36:ax37:ax38:ax79:ax80:ax81:ax82:ax83:ax84:ax87:ax88:ax89:ax13:ax14:ax4:ax85:ax86:ax23:ax25:ax44:ax22:ax75:ax59:ax61:ax63:ax65:ax68:ax71:ax73:ax5:ax6:ax7:ax32:ax24:ax46:ax52:ax58:ax76:ax8:ax9:ax10:ax11:ax12:ax43:ax50:ax56:ax78:ax29:ax45:ax30:ax31:ax33:ax34:ax39:ax40:ax42:ax47:ax49:ax51:ax53:ax55:ax57:ax60:ax62:ax64:ax66:ax69:ax72:ax74:ax90:ax67:ax70:ax41:ax48:ax54:ax77:ax92:ax93:ax94:ax95:ax91:ax35 (95)
% SZS status THM for /tmp/SystemOnTPTP13005/SWC002+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP13005/SWC002+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 13652
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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))|(((~(neq(X2,nil))|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:(((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X2)&app(X6,X7)=X1)&![X8]:(ssItem(X8)=>((~(memberP(X2,X8))|~(geq(X8,X5)))|X5=X8))))))|![X9]:(ssItem(X9)=>![X10]:(ssList(X10)=>![X11]:(ssList(X11)=>((~(app(app(X10,cons(X9,nil)),X11)=X4)|~(app(X10,X11)=X3))|?[X12]:(((ssItem(X12)&~(X9=X12))&memberP(X4,X12))&geq(X12,X9)))))))&(~(neq(X2,nil))|neq(X4,nil)))))))),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))|(((~(neq(X2,nil))|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:(((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X2)&app(X6,X7)=X1)&![X8]:(ssItem(X8)=>((~(memberP(X2,X8))|~(geq(X8,X5)))|X5=X8))))))|![X9]:(ssItem(X9)=>![X10]:(ssList(X10)=>![X11]:(ssList(X11)=>((~(app(app(X10,cons(X9,nil)),X11)=X4)|~(app(X10,X11)=X3))|?[X12]:(((ssItem(X12)&~(X9=X12))&memberP(X4,X12))&geq(X12,X9)))))))&(~(neq(X2,nil))|neq(X4,nil))))))))),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))|(((~(neq(X2,nil))|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:(((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X2)&app(X6,X7)=X1)&![X8]:(ssItem(X8)=>((~(memberP(X2,X8))|~(geq(X8,X5)))|X5=X8))))))|![X9]:(ssItem(X9)=>![X10]:(ssList(X10)=>![X11]:(ssList(X11)=>((~(app(app(X10,cons(X9,nil)),X11)=X4)|~(app(X10,X11)=X3))|?[X12]:(((ssItem(X12)&~(X9=X12))&memberP(X4,X12))&geq(X12,X9)))))))&(~(neq(X2,nil))|neq(X4,nil))))))))),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)&(((neq(X2,nil)&![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|![X7]:(((~(ssList(X7))|~(app(app(X6,cons(X5,nil)),X7)=X2))|~(app(X6,X7)=X1))|?[X8]:(ssItem(X8)&((memberP(X2,X8)&geq(X8,X5))&~(X5=X8)))))))&?[X9]:(ssItem(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&((app(app(X10,cons(X9,nil)),X11)=X4&app(X10,X11)=X3)&![X12]:(((~(ssItem(X12))|X9=X12)|~(memberP(X4,X12)))|~(geq(X12,X9))))))))|(neq(X2,nil)&~(neq(X4,nil))))))))),inference(fof_nnf,[status(thm)],[3])).
% fof(5, negated_conjecture,?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&((X14=X16&X13=X15)&(((neq(X14,nil)&![X17]:(~(ssItem(X17))|![X18]:(~(ssList(X18))|![X19]:(((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=X14))|~(app(X18,X19)=X13))|?[X20]:(ssItem(X20)&((memberP(X14,X20)&geq(X20,X17))&~(X17=X20)))))))&?[X21]:(ssItem(X21)&?[X22]:(ssList(X22)&?[X23]:(ssList(X23)&((app(app(X22,cons(X21,nil)),X23)=X16&app(X22,X23)=X15)&![X24]:(((~(ssItem(X24))|X21=X24)|~(memberP(X16,X24)))|~(geq(X24,X21))))))))|(neq(X14,nil)&~(neq(X16,nil))))))))),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)&(((neq(esk2_0,nil)&![X17]:(~(ssItem(X17))|![X18]:(~(ssList(X18))|![X19]:(((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk2_0))|~(app(X18,X19)=esk1_0))|(ssItem(esk5_3(X17,X18,X19))&((memberP(esk2_0,esk5_3(X17,X18,X19))&geq(esk5_3(X17,X18,X19),X17))&~(X17=esk5_3(X17,X18,X19))))))))&(ssItem(esk6_0)&(ssList(esk7_0)&(ssList(esk8_0)&((app(app(esk7_0,cons(esk6_0,nil)),esk8_0)=esk4_0&app(esk7_0,esk8_0)=esk3_0)&![X24]:(((~(ssItem(X24))|esk6_0=X24)|~(memberP(esk4_0,X24)))|~(geq(X24,esk6_0))))))))|(neq(esk2_0,nil)&~(neq(esk4_0,nil))))))))),inference(skolemize,[status(esa)],[5])).
% fof(7, negated_conjecture,![X17]:![X18]:![X19]:![X24]:((((((((((((((~(ssItem(X24))|esk6_0=X24)|~(memberP(esk4_0,X24)))|~(geq(X24,esk6_0)))&(app(app(esk7_0,cons(esk6_0,nil)),esk8_0)=esk4_0&app(esk7_0,esk8_0)=esk3_0))&ssList(esk8_0))&ssList(esk7_0))&ssItem(esk6_0))&((((((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk2_0))|~(app(X18,X19)=esk1_0))|(ssItem(esk5_3(X17,X18,X19))&((memberP(esk2_0,esk5_3(X17,X18,X19))&geq(esk5_3(X17,X18,X19),X17))&~(X17=esk5_3(X17,X18,X19)))))|~(ssList(X18)))|~(ssItem(X17)))&neq(esk2_0,nil)))|(neq(esk2_0,nil)&~(neq(esk4_0,nil))))&(esk2_0=esk4_0&esk1_0=esk3_0))&ssList(esk4_0))&ssList(esk3_0))&ssList(esk2_0))&ssList(esk1_0)),inference(shift_quantors,[status(thm)],[6])).
% fof(8, negated_conjecture,![X17]:![X18]:![X19]:![X24]:((((((((((((neq(esk2_0,nil)|(((~(ssItem(X24))|esk6_0=X24)|~(memberP(esk4_0,X24)))|~(geq(X24,esk6_0))))&(~(neq(esk4_0,nil))|(((~(ssItem(X24))|esk6_0=X24)|~(memberP(esk4_0,X24)))|~(geq(X24,esk6_0)))))&(((neq(esk2_0,nil)|app(app(esk7_0,cons(esk6_0,nil)),esk8_0)=esk4_0)&(~(neq(esk4_0,nil))|app(app(esk7_0,cons(esk6_0,nil)),esk8_0)=esk4_0))&((neq(esk2_0,nil)|app(esk7_0,esk8_0)=esk3_0)&(~(neq(esk4_0,nil))|app(esk7_0,esk8_0)=esk3_0))))&((neq(esk2_0,nil)|ssList(esk8_0))&(~(neq(esk4_0,nil))|ssList(esk8_0))))&((neq(esk2_0,nil)|ssList(esk7_0))&(~(neq(esk4_0,nil))|ssList(esk7_0))))&((neq(esk2_0,nil)|ssItem(esk6_0))&(~(neq(esk4_0,nil))|ssItem(esk6_0))))&((((neq(esk2_0,nil)|(((ssItem(esk5_3(X17,X18,X19))|((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk2_0))|~(app(X18,X19)=esk1_0)))|~(ssList(X18)))|~(ssItem(X17))))&(~(neq(esk4_0,nil))|(((ssItem(esk5_3(X17,X18,X19))|((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk2_0))|~(app(X18,X19)=esk1_0)))|~(ssList(X18)))|~(ssItem(X17)))))&((((neq(esk2_0,nil)|(((memberP(esk2_0,esk5_3(X17,X18,X19))|((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk2_0))|~(app(X18,X19)=esk1_0)))|~(ssList(X18)))|~(ssItem(X17))))&(~(neq(esk4_0,nil))|(((memberP(esk2_0,esk5_3(X17,X18,X19))|((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk2_0))|~(app(X18,X19)=esk1_0)))|~(ssList(X18)))|~(ssItem(X17)))))&((neq(esk2_0,nil)|(((geq(esk5_3(X17,X18,X19),X17)|((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk2_0))|~(app(X18,X19)=esk1_0)))|~(ssList(X18)))|~(ssItem(X17))))&(~(neq(esk4_0,nil))|(((geq(esk5_3(X17,X18,X19),X17)|((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk2_0))|~(app(X18,X19)=esk1_0)))|~(ssList(X18)))|~(ssItem(X17))))))&((neq(esk2_0,nil)|(((~(X17=esk5_3(X17,X18,X19))|((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk2_0))|~(app(X18,X19)=esk1_0)))|~(ssList(X18)))|~(ssItem(X17))))&(~(neq(esk4_0,nil))|(((~(X17=esk5_3(X17,X18,X19))|((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk2_0))|~(app(X18,X19)=esk1_0)))|~(ssList(X18)))|~(ssItem(X17)))))))&((neq(esk2_0,nil)|neq(esk2_0,nil))&(~(neq(esk4_0,nil))|neq(esk2_0,nil)))))&(esk2_0=esk4_0&esk1_0=esk3_0))&ssList(esk4_0))&ssList(esk3_0))&ssList(esk2_0))&ssList(esk1_0)),inference(distribute,[status(thm)],[7])).
% cnf(13,negated_conjecture,(esk1_0=esk3_0),inference(split_conjunct,[status(thm)],[8])).
% cnf(14,negated_conjecture,(esk2_0=esk4_0),inference(split_conjunct,[status(thm)],[8])).
% cnf(16,negated_conjecture,(neq(esk2_0,nil)|neq(esk2_0,nil)),inference(split_conjunct,[status(thm)],[8])).
% cnf(17,negated_conjecture,(~ssItem(X1)|~ssList(X2)|app(X2,X3)!=esk1_0|app(app(X2,cons(X1,nil)),X3)!=esk2_0|~ssList(X3)|X1!=esk5_3(X1,X2,X3)|~neq(esk4_0,nil)),inference(split_conjunct,[status(thm)],[8])).
% cnf(19,negated_conjecture,(geq(esk5_3(X1,X2,X3),X1)|~ssItem(X1)|~ssList(X2)|app(X2,X3)!=esk1_0|app(app(X2,cons(X1,nil)),X3)!=esk2_0|~ssList(X3)|~neq(esk4_0,nil)),inference(split_conjunct,[status(thm)],[8])).
% cnf(21,negated_conjecture,(memberP(esk2_0,esk5_3(X1,X2,X3))|~ssItem(X1)|~ssList(X2)|app(X2,X3)!=esk1_0|app(app(X2,cons(X1,nil)),X3)!=esk2_0|~ssList(X3)|~neq(esk4_0,nil)),inference(split_conjunct,[status(thm)],[8])).
% cnf(23,negated_conjecture,(ssItem(esk5_3(X1,X2,X3))|~ssItem(X1)|~ssList(X2)|app(X2,X3)!=esk1_0|app(app(X2,cons(X1,nil)),X3)!=esk2_0|~ssList(X3)|~neq(esk4_0,nil)),inference(split_conjunct,[status(thm)],[8])).
% cnf(25,negated_conjecture,(ssItem(esk6_0)|~neq(esk4_0,nil)),inference(split_conjunct,[status(thm)],[8])).
% cnf(27,negated_conjecture,(ssList(esk7_0)|~neq(esk4_0,nil)),inference(split_conjunct,[status(thm)],[8])).
% cnf(29,negated_conjecture,(ssList(esk8_0)|~neq(esk4_0,nil)),inference(split_conjunct,[status(thm)],[8])).
% cnf(31,negated_conjecture,(app(esk7_0,esk8_0)=esk3_0|~neq(esk4_0,nil)),inference(split_conjunct,[status(thm)],[8])).
% cnf(33,negated_conjecture,(app(app(esk7_0,cons(esk6_0,nil)),esk8_0)=esk4_0|~neq(esk4_0,nil)),inference(split_conjunct,[status(thm)],[8])).
% cnf(35,negated_conjecture,(esk6_0=X1|~geq(X1,esk6_0)|~memberP(esk4_0,X1)|~ssItem(X1)|~neq(esk4_0,nil)),inference(split_conjunct,[status(thm)],[8])).
% cnf(42,negated_conjecture,(ssList(esk7_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[27,14,theory(equality)]),16,theory(equality)])).
% cnf(43,negated_conjecture,(ssList(esk7_0)),inference(cn,[status(thm)],[42,theory(equality)])).
% cnf(44,negated_conjecture,(ssList(esk8_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[29,14,theory(equality)]),16,theory(equality)])).
% cnf(45,negated_conjecture,(ssList(esk8_0)),inference(cn,[status(thm)],[44,theory(equality)])).
% cnf(46,negated_conjecture,(ssItem(esk6_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[25,14,theory(equality)]),16,theory(equality)])).
% cnf(47,negated_conjecture,(ssItem(esk6_0)),inference(cn,[status(thm)],[46,theory(equality)])).
% cnf(53,negated_conjecture,(app(esk7_0,esk8_0)=esk1_0|~neq(esk4_0,nil)),inference(rw,[status(thm)],[31,13,theory(equality)])).
% cnf(54,negated_conjecture,(app(esk7_0,esk8_0)=esk1_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[53,14,theory(equality)]),16,theory(equality)])).
% cnf(55,negated_conjecture,(app(esk7_0,esk8_0)=esk1_0),inference(cn,[status(thm)],[54,theory(equality)])).
% cnf(60,negated_conjecture,(app(app(esk7_0,cons(esk6_0,nil)),esk8_0)=esk2_0|~neq(esk4_0,nil)),inference(rw,[status(thm)],[33,14,theory(equality)])).
% cnf(61,negated_conjecture,(app(app(esk7_0,cons(esk6_0,nil)),esk8_0)=esk2_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[60,14,theory(equality)]),16,theory(equality)])).
% cnf(62,negated_conjecture,(app(app(esk7_0,cons(esk6_0,nil)),esk8_0)=esk2_0),inference(cn,[status(thm)],[61,theory(equality)])).
% cnf(63,negated_conjecture,(esk6_0=X1|~ssItem(X1)|~geq(X1,esk6_0)|~memberP(esk2_0,X1)|~neq(esk4_0,nil)),inference(rw,[status(thm)],[35,14,theory(equality)])).
% cnf(64,negated_conjecture,(esk6_0=X1|~ssItem(X1)|~geq(X1,esk6_0)|~memberP(esk2_0,X1)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[63,14,theory(equality)]),16,theory(equality)])).
% cnf(65,negated_conjecture,(esk6_0=X1|~ssItem(X1)|~geq(X1,esk6_0)|~memberP(esk2_0,X1)),inference(cn,[status(thm)],[64,theory(equality)])).
% cnf(67,negated_conjecture,(app(X2,X3)!=esk1_0|esk5_3(X1,X2,X3)!=X1|app(app(X2,cons(X1,nil)),X3)!=esk2_0|~ssList(X3)|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[17,14,theory(equality)]),16,theory(equality)])).
% cnf(68,negated_conjecture,(app(X2,X3)!=esk1_0|esk5_3(X1,X2,X3)!=X1|app(app(X2,cons(X1,nil)),X3)!=esk2_0|~ssList(X3)|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[67,theory(equality)])).
% cnf(70,negated_conjecture,(ssItem(esk5_3(X1,X2,X3))|app(X2,X3)!=esk1_0|app(app(X2,cons(X1,nil)),X3)!=esk2_0|~ssList(X3)|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[23,14,theory(equality)]),16,theory(equality)])).
% cnf(71,negated_conjecture,(ssItem(esk5_3(X1,X2,X3))|app(X2,X3)!=esk1_0|app(app(X2,cons(X1,nil)),X3)!=esk2_0|~ssList(X3)|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[70,theory(equality)])).
% cnf(74,negated_conjecture,(memberP(esk2_0,esk5_3(X1,X2,X3))|app(X2,X3)!=esk1_0|app(app(X2,cons(X1,nil)),X3)!=esk2_0|~ssList(X3)|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[21,14,theory(equality)]),16,theory(equality)])).
% cnf(75,negated_conjecture,(memberP(esk2_0,esk5_3(X1,X2,X3))|app(X2,X3)!=esk1_0|app(app(X2,cons(X1,nil)),X3)!=esk2_0|~ssList(X3)|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[74,theory(equality)])).
% cnf(76,negated_conjecture,(geq(esk5_3(X1,X2,X3),X1)|app(X2,X3)!=esk1_0|app(app(X2,cons(X1,nil)),X3)!=esk2_0|~ssList(X3)|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[19,14,theory(equality)]),16,theory(equality)])).
% cnf(77,negated_conjecture,(geq(esk5_3(X1,X2,X3),X1)|app(X2,X3)!=esk1_0|app(app(X2,cons(X1,nil)),X3)!=esk2_0|~ssList(X3)|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[76,theory(equality)])).
% cnf(78,negated_conjecture,(app(esk7_0,esk8_0)!=esk1_0|esk5_3(esk6_0,esk7_0,esk8_0)!=esk6_0|~ssItem(esk6_0)|~ssList(esk8_0)|~ssList(esk7_0)),inference(spm,[status(thm)],[68,62,theory(equality)])).
% cnf(79,negated_conjecture,($false|esk5_3(esk6_0,esk7_0,esk8_0)!=esk6_0|~ssItem(esk6_0)|~ssList(esk8_0)|~ssList(esk7_0)),inference(rw,[status(thm)],[78,55,theory(equality)])).
% cnf(80,negated_conjecture,($false|esk5_3(esk6_0,esk7_0,esk8_0)!=esk6_0|$false|~ssList(esk8_0)|~ssList(esk7_0)),inference(rw,[status(thm)],[79,47,theory(equality)])).
% cnf(81,negated_conjecture,($false|esk5_3(esk6_0,esk7_0,esk8_0)!=esk6_0|$false|$false|~ssList(esk7_0)),inference(rw,[status(thm)],[80,45,theory(equality)])).
% cnf(82,negated_conjecture,($false|esk5_3(esk6_0,esk7_0,esk8_0)!=esk6_0|$false|$false|$false),inference(rw,[status(thm)],[81,43,theory(equality)])).
% cnf(83,negated_conjecture,(esk5_3(esk6_0,esk7_0,esk8_0)!=esk6_0),inference(cn,[status(thm)],[82,theory(equality)])).
% cnf(84,negated_conjecture,(esk6_0=esk5_3(X1,X2,X3)|~geq(esk5_3(X1,X2,X3),esk6_0)|~ssItem(esk5_3(X1,X2,X3))|app(app(X2,cons(X1,nil)),X3)!=esk2_0|app(X2,X3)!=esk1_0|~ssItem(X1)|~ssList(X3)|~ssList(X2)),inference(spm,[status(thm)],[65,75,theory(equality)])).
% cnf(91,negated_conjecture,(esk5_3(X1,X2,X3)=esk6_0|app(app(X2,cons(X1,nil)),X3)!=esk2_0|app(X2,X3)!=esk1_0|~geq(esk5_3(X1,X2,X3),esk6_0)|~ssItem(X1)|~ssList(X3)|~ssList(X2)),inference(csr,[status(thm)],[84,71])).
% cnf(92,negated_conjecture,(esk5_3(esk6_0,X1,X2)=esk6_0|app(app(X1,cons(esk6_0,nil)),X2)!=esk2_0|app(X1,X2)!=esk1_0|~ssItem(esk6_0)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[91,77,theory(equality)])).
% cnf(93,negated_conjecture,(esk5_3(esk6_0,X1,X2)=esk6_0|app(app(X1,cons(esk6_0,nil)),X2)!=esk2_0|app(X1,X2)!=esk1_0|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[92,47,theory(equality)])).
% cnf(94,negated_conjecture,(esk5_3(esk6_0,X1,X2)=esk6_0|app(app(X1,cons(esk6_0,nil)),X2)!=esk2_0|app(X1,X2)!=esk1_0|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[93,theory(equality)])).
% cnf(95,negated_conjecture,(esk5_3(esk6_0,esk7_0,esk8_0)=esk6_0|app(esk7_0,esk8_0)!=esk1_0|~ssList(esk8_0)|~ssList(esk7_0)),inference(spm,[status(thm)],[94,62,theory(equality)])).
% cnf(96,negated_conjecture,(esk5_3(esk6_0,esk7_0,esk8_0)=esk6_0|$false|~ssList(esk8_0)|~ssList(esk7_0)),inference(rw,[status(thm)],[95,55,theory(equality)])).
% cnf(97,negated_conjecture,(esk5_3(esk6_0,esk7_0,esk8_0)=esk6_0|$false|$false|~ssList(esk7_0)),inference(rw,[status(thm)],[96,45,theory(equality)])).
% cnf(98,negated_conjecture,(esk5_3(esk6_0,esk7_0,esk8_0)=esk6_0|$false|$false|$false),inference(rw,[status(thm)],[97,43,theory(equality)])).
% cnf(99,negated_conjecture,(esk5_3(esk6_0,esk7_0,esk8_0)=esk6_0),inference(cn,[status(thm)],[98,theory(equality)])).
% cnf(100,negated_conjecture,($false),inference(sr,[status(thm)],[99,83,theory(equality)])).
% cnf(101,negated_conjecture,($false),100,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 47
% # ...of these trivial : 13
% # ...subsumed : 0
% # ...remaining for further processing: 34
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 5
% # ...of the previous two non-trivial : 4
% # Contextual simplify-reflections : 1
% # Paramodulations : 5
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 19
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 7
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 12
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 36 leaves, 1.28+/-0.606 terms/leaf
% # Paramod-from index: 13 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 29 leaves, 1.14+/-0.433 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.005 s
% # Total time : 0.014 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/SystemOnTPTP13005/SWC002+1.tptp
%
%------------------------------------------------------------------------------