TSTP Solution File: SWC240+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC240+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 : art04.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:28:05 EST 2010
% Result : Theorem 1.42s
% Output : Solution 1.42s
% 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/SystemOnTPTP7625/SWC240+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7625/SWC240+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7625/SWC240+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 7721
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(4, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(11, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(18, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>![X3]:(ssList(X3)=>(memberP(cons(X2,X3),X1)<=>(X1=X2|memberP(X3,X1)))))),file('/tmp/SRASS.s.p', ax37)).
% fof(19, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(22, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(43, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssItem(hd(X1)))),file('/tmp/SRASS.s.p', ax22)).
% fof(57, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssList(tl(X1)))),file('/tmp/SRASS.s.p', ax24)).
% fof(67, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>cons(hd(X1),tl(X1))=X1)),file('/tmp/SRASS.s.p', ax78)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|nil=X1)|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X1)&![X8]:(ssItem(X8)=>(((~(memberP(X6,X8))|~(memberP(X7,X8)))|~(lt(X5,X8)))|leq(X5,X8)))))))|![X9]:(ssItem(X9)=>?[X10]:((ssItem(X10)&~(X9=X10))&memberP(X3,X10)))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|nil=X1)|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X1)&![X8]:(ssItem(X8)=>(((~(memberP(X6,X8))|~(memberP(X7,X8)))|~(lt(X5,X8)))|leq(X5,X8)))))))|![X9]:(ssItem(X9)=>?[X10]:((ssItem(X10)&~(X9=X10))&memberP(X3,X10))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(99, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[19,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|nil=X1)|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X1)&![X8]:(ssItem(X8)=>(((~(memberP(X6,X8))|~(memberP(X7,X8)))|~(lt(X5,X8)))|leq(X5,X8)))))))|![X9]:(ssItem(X9)=>?[X10]:((ssItem(X10)&~(X9=X10))&memberP(X3,X10))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(118, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(119, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[118])).
% fof(120, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[119])).
% cnf(121,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[120])).
% cnf(122,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[4])).
% fof(152, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[11])).
% fof(153, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[152])).
% cnf(154,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[153])).
% fof(181, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|![X3]:(~(ssList(X3))|((~(memberP(cons(X2,X3),X1))|(X1=X2|memberP(X3,X1)))&((~(X1=X2)&~(memberP(X3,X1)))|memberP(cons(X2,X3),X1)))))),inference(fof_nnf,[status(thm)],[18])).
% fof(182, plain,![X4]:(~(ssItem(X4))|![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))&((~(X4=X5)&~(memberP(X6,X4)))|memberP(cons(X5,X6),X4)))))),inference(variable_rename,[status(thm)],[181])).
% fof(183, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))&((~(X4=X5)&~(memberP(X6,X4)))|memberP(cons(X5,X6),X4))))|~(ssItem(X5)))|~(ssItem(X4))),inference(shift_quantors,[status(thm)],[182])).
% fof(184, plain,![X4]:![X5]:![X6]:(((((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4)))&(((((~(X4=X5)|memberP(cons(X5,X6),X4))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4)))&((((~(memberP(X6,X4))|memberP(cons(X5,X6),X4))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4))))),inference(distribute,[status(thm)],[183])).
% cnf(186,plain,(memberP(cons(X2,X3),X1)|~ssItem(X1)|~ssItem(X2)|~ssList(X3)|X1!=X2),inference(split_conjunct,[status(thm)],[184])).
% fof(188, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[99])).
% fof(189, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[188])).
% cnf(190,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[189])).
% fof(199, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[22])).
% fof(200, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[199])).
% fof(201, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[200])).
% cnf(202,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[201])).
% fof(359, plain,![X1]:(~(ssList(X1))|(nil=X1|ssItem(hd(X1)))),inference(fof_nnf,[status(thm)],[43])).
% fof(360, plain,![X2]:(~(ssList(X2))|(nil=X2|ssItem(hd(X2)))),inference(variable_rename,[status(thm)],[359])).
% cnf(361,plain,(ssItem(hd(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[360])).
% fof(432, plain,![X1]:(~(ssList(X1))|(nil=X1|ssList(tl(X1)))),inference(fof_nnf,[status(thm)],[57])).
% fof(433, plain,![X2]:(~(ssList(X2))|(nil=X2|ssList(tl(X2)))),inference(variable_rename,[status(thm)],[432])).
% cnf(434,plain,(ssList(tl(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[433])).
% fof(480, plain,![X1]:(~(ssList(X1))|(nil=X1|cons(hd(X1),tl(X1))=X1)),inference(fof_nnf,[status(thm)],[67])).
% fof(481, plain,![X2]:(~(ssList(X2))|(nil=X2|cons(hd(X2),tl(X2))=X2)),inference(variable_rename,[status(thm)],[480])).
% cnf(482,plain,(cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[481])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&~(nil=X1))&![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|![X7]:((~(ssList(X7))|~(app(app(X6,cons(X5,nil)),X7)=X1))|?[X8]:(ssItem(X8)&(((memberP(X6,X8)&memberP(X7,X8))<(X5,X8))&~(leq(X5,X8))))))))&?[X9]:(ssItem(X9)&![X10]:((~(ssItem(X10))|X9=X10)|~(memberP(X3,X10))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&((((X12=X14&X11=X13)&~(nil=X11))&![X15]:(~(ssItem(X15))|![X16]:(~(ssList(X16))|![X17]:((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=X11))|?[X18]:(ssItem(X18)&(((memberP(X16,X18)&memberP(X17,X18))<(X15,X18))&~(leq(X15,X18))))))))&?[X19]:(ssItem(X19)&![X20]:((~(ssItem(X20))|X19=X20)|~(memberP(X13,X20))))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((esk49_0=esk51_0&esk48_0=esk50_0)&~(nil=esk48_0))&![X15]:(~(ssItem(X15))|![X16]:(~(ssList(X16))|![X17]:((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0))|(ssItem(esk52_3(X15,X16,X17))&(((memberP(X16,esk52_3(X15,X16,X17))&memberP(X17,esk52_3(X15,X16,X17)))<(X15,esk52_3(X15,X16,X17)))&~(leq(X15,esk52_3(X15,X16,X17)))))))))&(ssItem(esk53_0)&![X20]:((~(ssItem(X20))|esk53_0=X20)|~(memberP(esk50_0,X20))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X15]:![X16]:![X17]:![X20]:((((((((~(ssItem(X20))|esk53_0=X20)|~(memberP(esk50_0,X20)))&ssItem(esk53_0))&(((((~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0))|(ssItem(esk52_3(X15,X16,X17))&(((memberP(X16,esk52_3(X15,X16,X17))&memberP(X17,esk52_3(X15,X16,X17)))<(X15,esk52_3(X15,X16,X17)))&~(leq(X15,esk52_3(X15,X16,X17))))))|~(ssList(X16)))|~(ssItem(X15)))&((esk49_0=esk51_0&esk48_0=esk50_0)&~(nil=esk48_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X15]:![X16]:![X17]:![X20]:((((((((~(ssItem(X20))|esk53_0=X20)|~(memberP(esk50_0,X20)))&ssItem(esk53_0))&(((((ssItem(esk52_3(X15,X16,X17))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0)))|~(ssList(X16)))|~(ssItem(X15)))&((((((memberP(X16,esk52_3(X15,X16,X17))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0)))|~(ssList(X16)))|~(ssItem(X15)))&(((memberP(X17,esk52_3(X15,X16,X17))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0)))|~(ssList(X16)))|~(ssItem(X15))))&(((lt(X15,esk52_3(X15,X16,X17))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0)))|~(ssList(X16)))|~(ssItem(X15))))&(((~(leq(X15,esk52_3(X15,X16,X17)))|(~(ssList(X17))|~(app(app(X16,cons(X15,nil)),X17)=esk48_0)))|~(ssList(X16)))|~(ssItem(X15)))))&((esk49_0=esk51_0&esk48_0=esk50_0)&~(nil=esk48_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(memberP(X2,esk52_3(X1,X2,X3))|~ssItem(X1)|~ssList(X2)|app(app(X2,cons(X1,nil)),X3)!=esk48_0|~ssList(X3)),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(ssItem(esk52_3(X1,X2,X3))|~ssItem(X1)|~ssList(X2)|app(app(X2,cons(X1,nil)),X3)!=esk48_0|~ssList(X3)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(esk53_0=X1|~memberP(esk50_0,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(594,negated_conjecture,(esk53_0=X1|~ssItem(X1)|~memberP(esk48_0,X1)),inference(rw,[status(thm)],[586,578,theory(equality)])).
% cnf(595,plain,(memberP(cons(X1,X2),X1)|~ssList(X2)|~ssItem(X1)),inference(er,[status(thm)],[186,theory(equality)])).
% cnf(697,plain,(memberP(X1,hd(X1))|nil=X1|~ssList(tl(X1))|~ssItem(hd(X1))|~ssList(X1)),inference(spm,[status(thm)],[595,482,theory(equality)])).
% cnf(1068,negated_conjecture,(~ssItem(esk52_3(X1,nil,X2))|app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssList(nil)|~ssItem(X1)),inference(spm,[status(thm)],[190,583,theory(equality)])).
% cnf(1073,negated_conjecture,(~ssItem(esk52_3(X1,nil,X2))|app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|$false|~ssItem(X1)),inference(rw,[status(thm)],[1068,122,theory(equality)])).
% cnf(1074,negated_conjecture,(~ssItem(esk52_3(X1,nil,X2))|app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[1073,theory(equality)])).
% cnf(1914,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1074,584,theory(equality)])).
% cnf(1915,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[1914,122,theory(equality)])).
% cnf(1916,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[1915,theory(equality)])).
% cnf(1919,negated_conjecture,(app(cons(X1,nil),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(cons(X1,nil))),inference(spm,[status(thm)],[1916,154,theory(equality)])).
% cnf(1998,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(cons(X1,nil))|~ssList(X2)|~ssItem(X1)),inference(spm,[status(thm)],[1919,202,theory(equality)])).
% cnf(2011,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1998,121,theory(equality)])).
% cnf(2012,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2011,122,theory(equality)])).
% cnf(2013,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2012,theory(equality)])).
% cnf(3250,plain,(nil=X1|memberP(X1,hd(X1))|~ssList(tl(X1))|~ssList(X1)),inference(csr,[status(thm)],[697,361])).
% cnf(3251,plain,(nil=X1|memberP(X1,hd(X1))|~ssList(X1)),inference(csr,[status(thm)],[3250,434])).
% cnf(3252,negated_conjecture,(esk53_0=hd(esk48_0)|nil=esk48_0|~ssItem(hd(esk48_0))|~ssList(esk48_0)),inference(spm,[status(thm)],[594,3251,theory(equality)])).
% cnf(3257,negated_conjecture,(esk53_0=hd(esk48_0)|nil=esk48_0|~ssItem(hd(esk48_0))|$false),inference(rw,[status(thm)],[3252,573,theory(equality)])).
% cnf(3258,negated_conjecture,(esk53_0=hd(esk48_0)|nil=esk48_0|~ssItem(hd(esk48_0))),inference(cn,[status(thm)],[3257,theory(equality)])).
% cnf(3259,negated_conjecture,(hd(esk48_0)=esk53_0|~ssItem(hd(esk48_0))),inference(sr,[status(thm)],[3258,577,theory(equality)])).
% cnf(3295,negated_conjecture,(hd(esk48_0)=esk53_0|nil=esk48_0|~ssList(esk48_0)),inference(spm,[status(thm)],[3259,361,theory(equality)])).
% cnf(3296,negated_conjecture,(hd(esk48_0)=esk53_0|nil=esk48_0|$false),inference(rw,[status(thm)],[3295,573,theory(equality)])).
% cnf(3297,negated_conjecture,(hd(esk48_0)=esk53_0|nil=esk48_0),inference(cn,[status(thm)],[3296,theory(equality)])).
% cnf(3298,negated_conjecture,(hd(esk48_0)=esk53_0),inference(sr,[status(thm)],[3297,577,theory(equality)])).
% cnf(3300,negated_conjecture,(cons(esk53_0,tl(esk48_0))=esk48_0|nil=esk48_0|~ssList(esk48_0)),inference(spm,[status(thm)],[482,3298,theory(equality)])).
% cnf(3314,negated_conjecture,(cons(esk53_0,tl(esk48_0))=esk48_0|nil=esk48_0|$false),inference(rw,[status(thm)],[3300,573,theory(equality)])).
% cnf(3315,negated_conjecture,(cons(esk53_0,tl(esk48_0))=esk48_0|nil=esk48_0),inference(cn,[status(thm)],[3314,theory(equality)])).
% cnf(3316,negated_conjecture,(cons(esk53_0,tl(esk48_0))=esk48_0),inference(sr,[status(thm)],[3315,577,theory(equality)])).
% cnf(3425,negated_conjecture,(~ssList(tl(esk48_0))|~ssItem(esk53_0)),inference(spm,[status(thm)],[2013,3316,theory(equality)])).
% cnf(3494,negated_conjecture,(~ssList(tl(esk48_0))|$false),inference(rw,[status(thm)],[3425,585,theory(equality)])).
% cnf(3495,negated_conjecture,(~ssList(tl(esk48_0))),inference(cn,[status(thm)],[3494,theory(equality)])).
% cnf(3574,negated_conjecture,(nil=esk48_0|~ssList(esk48_0)),inference(spm,[status(thm)],[3495,434,theory(equality)])).
% cnf(3575,negated_conjecture,(nil=esk48_0|$false),inference(rw,[status(thm)],[3574,573,theory(equality)])).
% cnf(3576,negated_conjecture,(nil=esk48_0),inference(cn,[status(thm)],[3575,theory(equality)])).
% cnf(3577,negated_conjecture,($false),inference(sr,[status(thm)],[3576,577,theory(equality)])).
% cnf(3578,negated_conjecture,($false),3577,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 665
% # ...of these trivial : 10
% # ...subsumed : 149
% # ...remaining for further processing: 506
% # Other redundant clauses eliminated : 100
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 7
% # Generated clauses : 1854
% # ...of the previous two non-trivial : 1614
% # Contextual simplify-reflections : 183
% # Paramodulations : 1726
% # Factorizations : 0
% # Equation resolutions : 128
% # Current number of processed clauses: 285
% # Positive orientable unit clauses: 19
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 262
% # Current number of unprocessed clauses: 1275
% # ...number of literals in the above : 9773
% # Clause-clause subsumption calls (NU) : 4174
% # Rec. Clause-clause subsumption calls : 1105
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 283 leaves, 1.42+/-1.202 terms/leaf
% # Paramod-from index: 144 leaves, 1.03+/-0.183 terms/leaf
% # Paramod-into index: 258 leaves, 1.27+/-0.941 terms/leaf
% # -------------------------------------------------
% # User time : 0.154 s
% # System time : 0.010 s
% # Total time : 0.164 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.33 CPU 0.40 WC
% FINAL PrfWatch: 0.33 CPU 0.40 WC
% SZS output end Solution for /tmp/SystemOnTPTP7625/SWC240+1.tptp
%
%------------------------------------------------------------------------------