TSTP Solution File: SWC378+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC378+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:59:47 EST 2010
% Result : Theorem 1.37s
% Output : Solution 1.37s
% 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/SystemOnTPTP29804/SWC378+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29804/SWC378+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29804/SWC378+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 29900
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssItem(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(memberP(app(X2,X3),X1)<=>(memberP(X2,X1)|memberP(X3,X1)))))),file('/tmp/SRASS.s.p', ax36)).
% fof(6, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>app(app(X1,X2),X3)=app(X1,app(X2,X3))))),file('/tmp/SRASS.s.p', ax82)).
% 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)=X4))|~(app(X6,X5)=X3))))|![X7]:((~(ssItem(X7))|(~(memberP(X2,X7))&~(memberP(X1,X7))))|(memberP(X2,X7)&memberP(X1,X7))))))),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)=X4))|~(app(X6,X5)=X3))))|![X7]:((~(ssItem(X7))|(~(memberP(X2,X7))&~(memberP(X1,X7))))|(memberP(X2,X7)&memberP(X1,X7)))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, 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)=X4))|~(app(X6,X5)=X3))))|![X7]:((~(ssItem(X7))|(~(memberP(X2,X7))&~(memberP(X1,X7))))|(memberP(X2,X7)&memberP(X1,X7)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(113, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|((~(memberP(app(X2,X3),X1))|(memberP(X2,X1)|memberP(X3,X1)))&((~(memberP(X2,X1))&~(memberP(X3,X1)))|memberP(app(X2,X3),X1)))))),inference(fof_nnf,[status(thm)],[3])).
% fof(114, plain,![X4]:(~(ssItem(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))&((~(memberP(X5,X4))&~(memberP(X6,X4)))|memberP(app(X5,X6),X4)))))),inference(variable_rename,[status(thm)],[113])).
% fof(115, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))&((~(memberP(X5,X4))&~(memberP(X6,X4)))|memberP(app(X5,X6),X4))))|~(ssList(X5)))|~(ssItem(X4))),inference(shift_quantors,[status(thm)],[114])).
% fof(116, plain,![X4]:![X5]:![X6]:(((((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4)))&(((((~(memberP(X5,X4))|memberP(app(X5,X6),X4))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4)))&((((~(memberP(X6,X4))|memberP(app(X5,X6),X4))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4))))),inference(distribute,[status(thm)],[115])).
% cnf(117,plain,(memberP(app(X2,X3),X1)|~ssItem(X1)|~ssList(X2)|~ssList(X3)|~memberP(X3,X1)),inference(split_conjunct,[status(thm)],[116])).
% cnf(118,plain,(memberP(app(X2,X3),X1)|~ssItem(X1)|~ssList(X2)|~ssList(X3)|~memberP(X2,X1)),inference(split_conjunct,[status(thm)],[116])).
% cnf(119,plain,(memberP(X3,X1)|memberP(X2,X1)|~ssItem(X1)|~ssList(X2)|~ssList(X3)|~memberP(app(X2,X3),X1)),inference(split_conjunct,[status(thm)],[116])).
% fof(128, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|app(app(X1,X2),X3)=app(X1,app(X2,X3))))),inference(fof_nnf,[status(thm)],[6])).
% fof(129, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6))))),inference(variable_rename,[status(thm)],[128])).
% fof(130, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[129])).
% cnf(131,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[130])).
% fof(568, 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)=X4)&app(X6,X5)=X3)))&?[X7]:((ssItem(X7)&(memberP(X2,X7)|memberP(X1,X7)))&(~(memberP(X2,X7))|~(memberP(X1,X7)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:((((ssList(X11)&X9=X11)&X8=X10)&?[X12]:(ssList(X12)&?[X13]:((ssList(X13)&app(X12,X13)=X11)&app(X13,X12)=X10)))&?[X14]:((ssItem(X14)&(memberP(X9,X14)|memberP(X8,X14)))&(~(memberP(X9,X14))|~(memberP(X8,X14)))))))),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)&(ssList(esk52_0)&((ssList(esk53_0)&app(esk52_0,esk53_0)=esk51_0)&app(esk53_0,esk52_0)=esk50_0)))&((ssItem(esk54_0)&(memberP(esk49_0,esk54_0)|memberP(esk48_0,esk54_0)))&(~(memberP(esk49_0,esk54_0))|~(memberP(esk48_0,esk54_0)))))))),inference(skolemize,[status(esa)],[569])).
% cnf(571,negated_conjecture,(~memberP(esk48_0,esk54_0)|~memberP(esk49_0,esk54_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(572,negated_conjecture,(memberP(esk48_0,esk54_0)|memberP(esk49_0,esk54_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(573,negated_conjecture,(ssItem(esk54_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(574,negated_conjecture,(app(esk53_0,esk52_0)=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(575,negated_conjecture,(app(esk52_0,esk53_0)=esk51_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(576,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(577,negated_conjecture,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(578,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(579,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(582,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(583,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(586,negated_conjecture,(app(esk52_0,esk53_0)=esk49_0),inference(rw,[status(thm)],[575,579,theory(equality)])).
% cnf(587,negated_conjecture,(app(esk53_0,esk52_0)=esk48_0),inference(rw,[status(thm)],[574,578,theory(equality)])).
% cnf(703,negated_conjecture,(memberP(app(X1,esk49_0),esk54_0)|memberP(esk48_0,esk54_0)|~ssList(esk49_0)|~ssList(X1)|~ssItem(esk54_0)),inference(spm,[status(thm)],[117,572,theory(equality)])).
% cnf(704,negated_conjecture,(memberP(app(X1,esk49_0),esk54_0)|memberP(esk48_0,esk54_0)|$false|~ssList(X1)|~ssItem(esk54_0)),inference(rw,[status(thm)],[703,582,theory(equality)])).
% cnf(705,negated_conjecture,(memberP(app(X1,esk49_0),esk54_0)|memberP(esk48_0,esk54_0)|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[704,573,theory(equality)])).
% cnf(706,negated_conjecture,(memberP(app(X1,esk49_0),esk54_0)|memberP(esk48_0,esk54_0)|~ssList(X1)),inference(cn,[status(thm)],[705,theory(equality)])).
% cnf(886,negated_conjecture,(app(esk48_0,X1)=app(esk53_0,app(esk52_0,X1))|~ssList(X1)|~ssList(esk52_0)|~ssList(esk53_0)),inference(spm,[status(thm)],[131,587,theory(equality)])).
% cnf(887,negated_conjecture,(app(esk49_0,X1)=app(esk52_0,app(esk53_0,X1))|~ssList(X1)|~ssList(esk53_0)|~ssList(esk52_0)),inference(spm,[status(thm)],[131,586,theory(equality)])).
% cnf(893,negated_conjecture,(app(esk48_0,X1)=app(esk53_0,app(esk52_0,X1))|~ssList(X1)|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[886,577,theory(equality)])).
% cnf(894,negated_conjecture,(app(esk48_0,X1)=app(esk53_0,app(esk52_0,X1))|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[893,576,theory(equality)])).
% cnf(895,negated_conjecture,(app(esk48_0,X1)=app(esk53_0,app(esk52_0,X1))|~ssList(X1)),inference(cn,[status(thm)],[894,theory(equality)])).
% cnf(896,negated_conjecture,(app(esk49_0,X1)=app(esk52_0,app(esk53_0,X1))|~ssList(X1)|$false|~ssList(esk52_0)),inference(rw,[status(thm)],[887,576,theory(equality)])).
% cnf(897,negated_conjecture,(app(esk49_0,X1)=app(esk52_0,app(esk53_0,X1))|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[896,577,theory(equality)])).
% cnf(898,negated_conjecture,(app(esk49_0,X1)=app(esk52_0,app(esk53_0,X1))|~ssList(X1)),inference(cn,[status(thm)],[897,theory(equality)])).
% cnf(1748,negated_conjecture,(app(esk53_0,esk49_0)=app(esk48_0,esk53_0)|~ssList(esk53_0)),inference(spm,[status(thm)],[895,586,theory(equality)])).
% cnf(1781,negated_conjecture,(app(esk53_0,esk49_0)=app(esk48_0,esk53_0)|$false),inference(rw,[status(thm)],[1748,576,theory(equality)])).
% cnf(1782,negated_conjecture,(app(esk53_0,esk49_0)=app(esk48_0,esk53_0)),inference(cn,[status(thm)],[1781,theory(equality)])).
% cnf(1797,negated_conjecture,(memberP(app(esk48_0,esk53_0),esk54_0)|memberP(esk48_0,esk54_0)|~ssList(esk53_0)),inference(spm,[status(thm)],[706,1782,theory(equality)])).
% cnf(1841,negated_conjecture,(memberP(app(esk48_0,esk53_0),esk54_0)|memberP(esk48_0,esk54_0)|$false),inference(rw,[status(thm)],[1797,576,theory(equality)])).
% cnf(1842,negated_conjecture,(memberP(app(esk48_0,esk53_0),esk54_0)|memberP(esk48_0,esk54_0)),inference(cn,[status(thm)],[1841,theory(equality)])).
% cnf(1851,negated_conjecture,(memberP(esk48_0,esk54_0)|memberP(esk53_0,esk54_0)|~ssList(esk53_0)|~ssList(esk48_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[119,1842,theory(equality)])).
% cnf(1870,negated_conjecture,(memberP(esk48_0,esk54_0)|memberP(esk53_0,esk54_0)|$false|~ssList(esk48_0)|~ssItem(esk54_0)),inference(rw,[status(thm)],[1851,576,theory(equality)])).
% cnf(1871,negated_conjecture,(memberP(esk48_0,esk54_0)|memberP(esk53_0,esk54_0)|$false|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[1870,583,theory(equality)])).
% cnf(1872,negated_conjecture,(memberP(esk48_0,esk54_0)|memberP(esk53_0,esk54_0)|$false|$false|$false),inference(rw,[status(thm)],[1871,573,theory(equality)])).
% cnf(1873,negated_conjecture,(memberP(esk48_0,esk54_0)|memberP(esk53_0,esk54_0)),inference(cn,[status(thm)],[1872,theory(equality)])).
% cnf(1879,negated_conjecture,(memberP(app(esk53_0,X1),esk54_0)|memberP(esk48_0,esk54_0)|~ssList(X1)|~ssList(esk53_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[118,1873,theory(equality)])).
% cnf(1895,negated_conjecture,(memberP(app(esk53_0,X1),esk54_0)|memberP(esk48_0,esk54_0)|~ssList(X1)|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[1879,576,theory(equality)])).
% cnf(1896,negated_conjecture,(memberP(app(esk53_0,X1),esk54_0)|memberP(esk48_0,esk54_0)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[1895,573,theory(equality)])).
% cnf(1897,negated_conjecture,(memberP(app(esk53_0,X1),esk54_0)|memberP(esk48_0,esk54_0)|~ssList(X1)),inference(cn,[status(thm)],[1896,theory(equality)])).
% cnf(2006,negated_conjecture,(memberP(esk48_0,esk54_0)|~ssList(esk52_0)),inference(spm,[status(thm)],[1897,587,theory(equality)])).
% cnf(2027,negated_conjecture,(memberP(esk48_0,esk54_0)|$false),inference(rw,[status(thm)],[2006,577,theory(equality)])).
% cnf(2028,negated_conjecture,(memberP(esk48_0,esk54_0)),inference(cn,[status(thm)],[2027,theory(equality)])).
% cnf(2034,negated_conjecture,(memberP(app(X1,esk48_0),esk54_0)|~ssList(esk48_0)|~ssList(X1)|~ssItem(esk54_0)),inference(spm,[status(thm)],[117,2028,theory(equality)])).
% cnf(2050,negated_conjecture,($false|~memberP(esk49_0,esk54_0)),inference(rw,[status(thm)],[571,2028,theory(equality)])).
% cnf(2051,negated_conjecture,(~memberP(esk49_0,esk54_0)),inference(cn,[status(thm)],[2050,theory(equality)])).
% cnf(2062,negated_conjecture,(memberP(app(X1,esk48_0),esk54_0)|$false|~ssList(X1)|~ssItem(esk54_0)),inference(rw,[status(thm)],[2034,583,theory(equality)])).
% cnf(2063,negated_conjecture,(memberP(app(X1,esk48_0),esk54_0)|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[2062,573,theory(equality)])).
% cnf(2064,negated_conjecture,(memberP(app(X1,esk48_0),esk54_0)|~ssList(X1)),inference(cn,[status(thm)],[2063,theory(equality)])).
% cnf(2350,negated_conjecture,(app(esk52_0,esk48_0)=app(esk49_0,esk52_0)|~ssList(esk52_0)),inference(spm,[status(thm)],[898,587,theory(equality)])).
% cnf(2385,negated_conjecture,(app(esk52_0,esk48_0)=app(esk49_0,esk52_0)|$false),inference(rw,[status(thm)],[2350,577,theory(equality)])).
% cnf(2386,negated_conjecture,(app(esk52_0,esk48_0)=app(esk49_0,esk52_0)),inference(cn,[status(thm)],[2385,theory(equality)])).
% cnf(2403,negated_conjecture,(memberP(app(esk49_0,esk52_0),esk54_0)|~ssList(esk52_0)),inference(spm,[status(thm)],[2064,2386,theory(equality)])).
% cnf(2448,negated_conjecture,(memberP(app(esk49_0,esk52_0),esk54_0)|$false),inference(rw,[status(thm)],[2403,577,theory(equality)])).
% cnf(2449,negated_conjecture,(memberP(app(esk49_0,esk52_0),esk54_0)),inference(cn,[status(thm)],[2448,theory(equality)])).
% cnf(2460,negated_conjecture,(memberP(esk49_0,esk54_0)|memberP(esk52_0,esk54_0)|~ssList(esk52_0)|~ssList(esk49_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[119,2449,theory(equality)])).
% cnf(2479,negated_conjecture,(memberP(esk49_0,esk54_0)|memberP(esk52_0,esk54_0)|$false|~ssList(esk49_0)|~ssItem(esk54_0)),inference(rw,[status(thm)],[2460,577,theory(equality)])).
% cnf(2480,negated_conjecture,(memberP(esk49_0,esk54_0)|memberP(esk52_0,esk54_0)|$false|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[2479,582,theory(equality)])).
% cnf(2481,negated_conjecture,(memberP(esk49_0,esk54_0)|memberP(esk52_0,esk54_0)|$false|$false|$false),inference(rw,[status(thm)],[2480,573,theory(equality)])).
% cnf(2482,negated_conjecture,(memberP(esk49_0,esk54_0)|memberP(esk52_0,esk54_0)),inference(cn,[status(thm)],[2481,theory(equality)])).
% cnf(2483,negated_conjecture,(memberP(esk52_0,esk54_0)),inference(sr,[status(thm)],[2482,2051,theory(equality)])).
% cnf(2489,negated_conjecture,(memberP(app(esk52_0,X1),esk54_0)|~ssList(X1)|~ssList(esk52_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[118,2483,theory(equality)])).
% cnf(2505,negated_conjecture,(memberP(app(esk52_0,X1),esk54_0)|~ssList(X1)|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[2489,577,theory(equality)])).
% cnf(2506,negated_conjecture,(memberP(app(esk52_0,X1),esk54_0)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2505,573,theory(equality)])).
% cnf(2507,negated_conjecture,(memberP(app(esk52_0,X1),esk54_0)|~ssList(X1)),inference(cn,[status(thm)],[2506,theory(equality)])).
% cnf(3626,negated_conjecture,(memberP(esk49_0,esk54_0)|~ssList(esk53_0)),inference(spm,[status(thm)],[2507,586,theory(equality)])).
% cnf(3657,negated_conjecture,(memberP(esk49_0,esk54_0)|$false),inference(rw,[status(thm)],[3626,576,theory(equality)])).
% cnf(3658,negated_conjecture,(memberP(esk49_0,esk54_0)),inference(cn,[status(thm)],[3657,theory(equality)])).
% cnf(3659,negated_conjecture,($false),inference(sr,[status(thm)],[3658,2051,theory(equality)])).
% cnf(3660,negated_conjecture,($false),3659,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 409
% # ...of these trivial : 2
% # ...subsumed : 25
% # ...remaining for further processing: 382
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 15
% # Generated clauses : 1208
% # ...of the previous two non-trivial : 1061
% # Contextual simplify-reflections : 8
% # Paramodulations : 1115
% # Factorizations : 0
% # Equation resolutions : 93
% # Current number of processed clauses: 358
% # Positive orientable unit clauses: 75
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 280
% # Current number of unprocessed clauses: 791
% # ...number of literals in the above : 4381
% # Clause-clause subsumption calls (NU) : 2538
% # Rec. Clause-clause subsumption calls : 1744
% # Unit Clause-clause subsumption calls : 35
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 73
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 334 leaves, 1.36+/-1.162 terms/leaf
% # Paramod-from index: 163 leaves, 1.13+/-0.855 terms/leaf
% # Paramod-into index: 302 leaves, 1.25+/-1.054 terms/leaf
% # -------------------------------------------------
% # User time : 0.109 s
% # System time : 0.005 s
% # Total time : 0.114 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.27 CPU 0.35 WC
% FINAL PrfWatch: 0.27 CPU 0.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP29804/SWC378+1.tptp
%
%------------------------------------------------------------------------------