TSTP Solution File: SWC325+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC325+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 : art06.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:49:31 EST 2010
% Result : Theorem 1.33s
% Output : Solution 1.33s
% 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/SystemOnTPTP11039/SWC325+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11039/SWC325+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11039/SWC325+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 11135
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(5, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(17, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(38, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(43, axiom,![X1]:(ssList(X1)=>(frontsegP(nil,X1)<=>nil=X1)),file('/tmp/SRASS.s.p', ax46)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|?[X5]:(ssList(X5)&?[X6]:((ssList(X6)&app(X5,X6)=X2)&app(X6,X5)=X1)))|(~(nil=X3)&nil=X4))|(![X7]:(ssItem(X7)=>![X8]:(ssList(X8)=>(~(app(cons(X7,nil),X8)=X3)|~(app(X8,cons(X7,nil))=X4))))&neq(X4,nil))))))),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))|?[X5]:(ssList(X5)&?[X6]:((ssList(X6)&app(X5,X6)=X2)&app(X6,X5)=X1)))|(~(nil=X3)&nil=X4))|(![X7]:(ssItem(X7)=>![X8]:(ssList(X8)=>(~(app(cons(X7,nil),X8)=X3)|~(app(X8,cons(X7,nil))=X4))))&neq(X4,nil)))))))),inference(assume_negation,[status(cth)],[96])).
% fof(114, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[3])).
% fof(115, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[114])).
% fof(116, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[115])).
% fof(117, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssList(X4)))|~(ssList(X3)))&(((X3=X4|neq(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[116])).
% cnf(118,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[117])).
% fof(120, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(121, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[120])).
% fof(122, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[121])).
% cnf(123,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[122])).
% cnf(124,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(173, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(nil=app(X1,X2))|(nil=X2&nil=X1))&((~(nil=X2)|~(nil=X1))|nil=app(X1,X2))))),inference(fof_nnf,[status(thm)],[17])).
% fof(174, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))),inference(variable_rename,[status(thm)],[173])).
% fof(175, plain,![X3]:![X4]:((~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[174])).
% fof(176, plain,![X3]:![X4]:(((((nil=X4|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3)))&(((nil=X3|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3))))&((((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[175])).
% cnf(179,plain,(nil=X2|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[176])).
% fof(285, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(frontsegP(X1,X2))|?[X3]:(ssList(X3)&app(X2,X3)=X1))&(![X3]:(~(ssList(X3))|~(app(X2,X3)=X1))|frontsegP(X1,X2))))),inference(fof_nnf,[status(thm)],[38])).
% fof(286, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|?[X6]:(ssList(X6)&app(X5,X6)=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(variable_rename,[status(thm)],[285])).
% fof(287, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk18_2(X4,X5))&app(X5,esk18_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[286])).
% fof(288, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk18_2(X4,X5))&app(X5,esk18_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[287])).
% fof(289, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk18_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk18_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[288])).
% cnf(290,plain,(app(X2,esk18_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[289])).
% cnf(291,plain,(ssList(esk18_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[289])).
% fof(320, plain,![X1]:(~(ssList(X1))|((~(frontsegP(nil,X1))|nil=X1)&(~(nil=X1)|frontsegP(nil,X1)))),inference(fof_nnf,[status(thm)],[43])).
% fof(321, plain,![X2]:(~(ssList(X2))|((~(frontsegP(nil,X2))|nil=X2)&(~(nil=X2)|frontsegP(nil,X2)))),inference(variable_rename,[status(thm)],[320])).
% fof(322, plain,![X2]:(((~(frontsegP(nil,X2))|nil=X2)|~(ssList(X2)))&((~(nil=X2)|frontsegP(nil,X2))|~(ssList(X2)))),inference(distribute,[status(thm)],[321])).
% cnf(323,plain,(frontsegP(nil,X1)|~ssList(X1)|nil!=X1),inference(split_conjunct,[status(thm)],[322])).
% fof(567, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&![X5]:(~(ssList(X5))|![X6]:((~(ssList(X6))|~(app(X5,X6)=X2))|~(app(X6,X5)=X1))))&(nil=X3|~(nil=X4)))&(?[X7]:(ssItem(X7)&?[X8]:(ssList(X8)&(app(cons(X7,nil),X8)=X3&app(X8,cons(X7,nil))=X4)))|~(neq(X4,nil)))))))),inference(fof_nnf,[status(thm)],[97])).
% fof(568, negated_conjecture,?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&((((X10=X12&X9=X11)&![X13]:(~(ssList(X13))|![X14]:((~(ssList(X14))|~(app(X13,X14)=X10))|~(app(X14,X13)=X9))))&(nil=X11|~(nil=X12)))&(?[X15]:(ssItem(X15)&?[X16]:(ssList(X16)&(app(cons(X15,nil),X16)=X11&app(X16,cons(X15,nil))=X12)))|~(neq(X12,nil)))))))),inference(variable_rename,[status(thm)],[567])).
% fof(569, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((esk49_0=esk51_0&esk48_0=esk50_0)&![X13]:(~(ssList(X13))|![X14]:((~(ssList(X14))|~(app(X13,X14)=esk49_0))|~(app(X14,X13)=esk48_0))))&(nil=esk50_0|~(nil=esk51_0)))&((ssItem(esk52_0)&(ssList(esk53_0)&(app(cons(esk52_0,nil),esk53_0)=esk50_0&app(esk53_0,cons(esk52_0,nil))=esk51_0)))|~(neq(esk51_0,nil)))))))),inference(skolemize,[status(esa)],[568])).
% fof(570, negated_conjecture,![X13]:![X14]:((((((((((~(ssList(X14))|~(app(X13,X14)=esk49_0))|~(app(X14,X13)=esk48_0))|~(ssList(X13)))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk50_0|~(nil=esk51_0)))&((ssItem(esk52_0)&(ssList(esk53_0)&(app(cons(esk52_0,nil),esk53_0)=esk50_0&app(esk53_0,cons(esk52_0,nil))=esk51_0)))|~(neq(esk51_0,nil))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[569])).
% fof(571, negated_conjecture,![X13]:![X14]:((((((((((~(ssList(X14))|~(app(X13,X14)=esk49_0))|~(app(X14,X13)=esk48_0))|~(ssList(X13)))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk50_0|~(nil=esk51_0)))&((ssItem(esk52_0)|~(neq(esk51_0,nil)))&((ssList(esk53_0)|~(neq(esk51_0,nil)))&((app(cons(esk52_0,nil),esk53_0)=esk50_0|~(neq(esk51_0,nil)))&(app(esk53_0,cons(esk52_0,nil))=esk51_0|~(neq(esk51_0,nil)))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[570])).
% cnf(573,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk51_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(ssList(esk53_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(nil=esk50_0|nil!=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(~ssList(X1)|app(X2,X1)!=esk48_0|app(X1,X2)!=esk49_0|~ssList(X2)),inference(split_conjunct,[status(thm)],[571])).
% cnf(585,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[573,582,theory(equality)])).
% cnf(588,plain,(frontsegP(nil,nil)|~ssList(nil)),inference(er,[status(thm)],[323,theory(equality)])).
% cnf(589,plain,(frontsegP(nil,nil)|$false),inference(rw,[status(thm)],[588,124,theory(equality)])).
% cnf(590,plain,(frontsegP(nil,nil)),inference(cn,[status(thm)],[589,theory(equality)])).
% cnf(613,negated_conjecture,(app(X2,X1)!=esk50_0|app(X1,X2)!=esk49_0|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[583,581,theory(equality)])).
% cnf(614,negated_conjecture,(app(X2,X1)!=esk50_0|app(X1,X2)!=esk51_0|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[613,582,theory(equality)])).
% cnf(663,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[579,118,theory(equality)])).
% cnf(664,negated_conjecture,(ssList(esk53_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[578,118,theory(equality)])).
% cnf(665,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk51_0|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[576,118,theory(equality)])).
% cnf(666,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk50_0|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[577,118,theory(equality)])).
% cnf(667,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[663,124,theory(equality)])).
% cnf(668,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[667,585,theory(equality)])).
% cnf(669,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil),inference(cn,[status(thm)],[668,theory(equality)])).
% cnf(670,negated_conjecture,(ssList(esk53_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[664,124,theory(equality)])).
% cnf(671,negated_conjecture,(ssList(esk53_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[670,585,theory(equality)])).
% cnf(672,negated_conjecture,(ssList(esk53_0)|esk51_0=nil),inference(cn,[status(thm)],[671,theory(equality)])).
% cnf(673,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk51_0|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[665,124,theory(equality)])).
% cnf(674,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk51_0|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[673,585,theory(equality)])).
% cnf(675,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk51_0|esk51_0=nil),inference(cn,[status(thm)],[674,theory(equality)])).
% cnf(676,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk50_0|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[666,124,theory(equality)])).
% cnf(677,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk50_0|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[676,585,theory(equality)])).
% cnf(678,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk50_0|esk51_0=nil),inference(cn,[status(thm)],[677,theory(equality)])).
% cnf(1370,negated_conjecture,(esk51_0=nil|app(esk53_0,cons(esk52_0,nil))!=esk51_0|~ssList(cons(esk52_0,nil))|~ssList(esk53_0)),inference(spm,[status(thm)],[614,678,theory(equality)])).
% cnf(1427,plain,(ssList(esk18_2(nil,nil))|~ssList(nil)),inference(spm,[status(thm)],[291,590,theory(equality)])).
% cnf(1428,plain,(app(nil,esk18_2(nil,nil))=nil|~ssList(nil)),inference(spm,[status(thm)],[290,590,theory(equality)])).
% cnf(1431,plain,(ssList(esk18_2(nil,nil))|$false),inference(rw,[status(thm)],[1427,124,theory(equality)])).
% cnf(1432,plain,(ssList(esk18_2(nil,nil))),inference(cn,[status(thm)],[1431,theory(equality)])).
% cnf(1433,plain,(app(nil,esk18_2(nil,nil))=nil|$false),inference(rw,[status(thm)],[1428,124,theory(equality)])).
% cnf(1434,plain,(app(nil,esk18_2(nil,nil))=nil),inference(cn,[status(thm)],[1433,theory(equality)])).
% cnf(1444,negated_conjecture,(esk51_0=nil|app(esk53_0,cons(esk52_0,nil))!=esk51_0|~ssList(cons(esk52_0,nil))),inference(csr,[status(thm)],[1370,672])).
% cnf(1445,negated_conjecture,(esk51_0=nil|~ssList(cons(esk52_0,nil))),inference(csr,[status(thm)],[1444,675])).
% cnf(1446,negated_conjecture,(esk51_0=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1445,123,theory(equality)])).
% cnf(1447,negated_conjecture,(esk51_0=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1446,124,theory(equality)])).
% cnf(1448,negated_conjecture,(esk51_0=nil|~ssItem(esk52_0)),inference(cn,[status(thm)],[1447,theory(equality)])).
% cnf(1449,negated_conjecture,(esk51_0=nil),inference(csr,[status(thm)],[1448,669])).
% cnf(1459,negated_conjecture,(app(X1,X2)!=esk50_0|app(X2,X1)!=nil|~ssList(X1)|~ssList(X2)),inference(rw,[status(thm)],[614,1449,theory(equality)])).
% cnf(1466,negated_conjecture,(esk50_0=nil|$false),inference(rw,[status(thm)],[580,1449,theory(equality)])).
% cnf(1467,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[1466,theory(equality)])).
% cnf(1501,plain,(nil=esk18_2(nil,nil)|~ssList(esk18_2(nil,nil))|~ssList(nil)),inference(spm,[status(thm)],[179,1434,theory(equality)])).
% cnf(1518,plain,(nil=esk18_2(nil,nil)|$false|~ssList(nil)),inference(rw,[status(thm)],[1501,1432,theory(equality)])).
% cnf(1519,plain,(nil=esk18_2(nil,nil)|$false|$false),inference(rw,[status(thm)],[1518,124,theory(equality)])).
% cnf(1520,plain,(nil=esk18_2(nil,nil)),inference(cn,[status(thm)],[1519,theory(equality)])).
% cnf(1547,plain,(app(nil,nil)=nil),inference(rw,[status(thm)],[1434,1520,theory(equality)])).
% cnf(2141,negated_conjecture,(app(X1,X2)!=nil|app(X2,X1)!=nil|~ssList(X1)|~ssList(X2)),inference(rw,[status(thm)],[1459,1467,theory(equality)])).
% cnf(2153,negated_conjecture,(app(nil,nil)!=nil|~ssList(nil)),inference(spm,[status(thm)],[2141,1547,theory(equality)])).
% cnf(2164,negated_conjecture,($false|~ssList(nil)),inference(rw,[status(thm)],[2153,1547,theory(equality)])).
% cnf(2165,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2164,124,theory(equality)])).
% cnf(2166,negated_conjecture,($false),inference(cn,[status(thm)],[2165,theory(equality)])).
% cnf(2167,negated_conjecture,($false),2166,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 311
% # ...of these trivial : 2
% # ...subsumed : 48
% # ...remaining for further processing: 261
% # Other redundant clauses eliminated : 73
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 28
% # Generated clauses : 870
% # ...of the previous two non-trivial : 716
% # Contextual simplify-reflections : 44
% # Paramodulations : 773
% # Factorizations : 0
% # Equation resolutions : 97
% # Current number of processed clauses: 226
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 202
% # Current number of unprocessed clauses: 471
% # ...number of literals in the above : 3423
% # Clause-clause subsumption calls (NU) : 1359
% # Rec. Clause-clause subsumption calls : 647
% # Unit Clause-clause subsumption calls : 25
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 251 leaves, 1.35+/-1.107 terms/leaf
% # Paramod-from index: 121 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 218 leaves, 1.22+/-0.936 terms/leaf
% # -------------------------------------------------
% # User time : 0.087 s
% # System time : 0.003 s
% # Total time : 0.090 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.30 WC
% FINAL PrfWatch: 0.21 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP11039/SWC325+1.tptp
%
%------------------------------------------------------------------------------