TSTP Solution File: SWC002-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC002-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Aug 22 11:00:40 EDT 2023
% Result : Unsatisfiable 22.53s 8.79s
% Output : CNFRefutation 22.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 89
% Syntax : Number of formulae : 135 ( 16 unt; 76 typ; 0 def)
% Number of atoms : 202 ( 61 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 292 ( 149 ~; 143 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 85 ( 66 >; 19 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 57 ( 57 usr; 10 con; 0-3 aty)
% Number of variables : 52 (; 52 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ segmentP > rearsegP > neq > memberP > lt > leq > gt > geq > frontsegP > totalorderedP > totalorderP > strictorderedP > strictorderP > ssList > ssItem > singletonP > equalelemsP > duplicatefreeP > cyclefreeP > sk5 > skaf48 > skaf47 > skaf46 > skaf45 > skaf43 > skaf42 > cons > app > #nlpp > tl > skaf83 > skaf82 > skaf81 > skaf80 > skaf79 > skaf78 > skaf77 > skaf76 > skaf75 > skaf74 > skaf73 > skaf72 > skaf71 > skaf70 > skaf69 > skaf68 > skaf67 > skaf66 > skaf65 > skaf64 > skaf63 > skaf62 > skaf61 > skaf60 > skaf59 > skaf58 > skaf57 > skaf56 > skaf55 > skaf54 > skaf53 > skaf52 > skaf51 > skaf50 > skaf49 > skaf44 > hd > skac3 > skac2 > sk8 > sk7 > sk6 > sk4 > sk3 > sk2 > sk1 > nil
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(skaf56,type,
skaf56: $i > $i ).
tff(segmentP,type,
segmentP: ( $i * $i ) > $o ).
tff(totalorderedP,type,
totalorderedP: $i > $o ).
tff(equalelemsP,type,
equalelemsP: $i > $o ).
tff(skaf74,type,
skaf74: $i > $i ).
tff(skaf61,type,
skaf61: $i > $i ).
tff(skaf51,type,
skaf51: $i > $i ).
tff(skaf83,type,
skaf83: $i > $i ).
tff(skac2,type,
skac2: $i ).
tff(skaf63,type,
skaf63: $i > $i ).
tff(skaf62,type,
skaf62: $i > $i ).
tff(sk2,type,
sk2: $i ).
tff(skaf52,type,
skaf52: $i > $i ).
tff(skaf50,type,
skaf50: $i > $i ).
tff(skaf42,type,
skaf42: ( $i * $i ) > $i ).
tff(skaf44,type,
skaf44: $i > $i ).
tff(singletonP,type,
singletonP: $i > $o ).
tff(skaf67,type,
skaf67: $i > $i ).
tff(skaf75,type,
skaf75: $i > $i ).
tff(sk1,type,
sk1: $i ).
tff(skaf58,type,
skaf58: $i > $i ).
tff(skaf46,type,
skaf46: ( $i * $i ) > $i ).
tff(frontsegP,type,
frontsegP: ( $i * $i ) > $o ).
tff(skaf70,type,
skaf70: $i > $i ).
tff(totalorderP,type,
totalorderP: $i > $o ).
tff(ssItem,type,
ssItem: $i > $o ).
tff(sk6,type,
sk6: $i ).
tff(skaf82,type,
skaf82: $i > $i ).
tff(skaf47,type,
skaf47: ( $i * $i ) > $i ).
tff(sk5,type,
sk5: ( $i * $i * $i ) > $i ).
tff(skaf76,type,
skaf76: $i > $i ).
tff(skac3,type,
skac3: $i ).
tff(skaf80,type,
skaf80: $i > $i ).
tff(skaf59,type,
skaf59: $i > $i ).
tff(skaf53,type,
skaf53: $i > $i ).
tff(skaf45,type,
skaf45: ( $i * $i ) > $i ).
tff(hd,type,
hd: $i > $i ).
tff(app,type,
app: ( $i * $i ) > $i ).
tff(skaf72,type,
skaf72: $i > $i ).
tff(duplicatefreeP,type,
duplicatefreeP: $i > $o ).
tff(skaf64,type,
skaf64: $i > $i ).
tff(sk4,type,
sk4: $i ).
tff(sk8,type,
sk8: $i ).
tff(gt,type,
gt: ( $i * $i ) > $o ).
tff(skaf71,type,
skaf71: $i > $i ).
tff(skaf78,type,
skaf78: $i > $i ).
tff(skaf79,type,
skaf79: $i > $i ).
tff(rearsegP,type,
rearsegP: ( $i * $i ) > $o ).
tff(memberP,type,
memberP: ( $i * $i ) > $o ).
tff(skaf73,type,
skaf73: $i > $i ).
tff(ssList,type,
ssList: $i > $o ).
tff(cons,type,
cons: ( $i * $i ) > $i ).
tff(skaf54,type,
skaf54: $i > $i ).
tff(skaf77,type,
skaf77: $i > $i ).
tff(sk3,type,
sk3: $i ).
tff(skaf66,type,
skaf66: $i > $i ).
tff(strictorderP,type,
strictorderP: $i > $o ).
tff(skaf81,type,
skaf81: $i > $i ).
tff(geq,type,
geq: ( $i * $i ) > $o ).
tff(skaf60,type,
skaf60: $i > $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(lt,type,
lt: ( $i * $i ) > $o ).
tff(skaf69,type,
skaf69: $i > $i ).
tff(tl,type,
tl: $i > $i ).
tff(neq,type,
neq: ( $i * $i ) > $o ).
tff(skaf43,type,
skaf43: ( $i * $i ) > $i ).
tff(skaf48,type,
skaf48: ( $i * $i ) > $i ).
tff(skaf65,type,
skaf65: $i > $i ).
tff(skaf57,type,
skaf57: $i > $i ).
tff(sk7,type,
sk7: $i ).
tff(nil,type,
nil: $i ).
tff(skaf49,type,
skaf49: $i > $i ).
tff(skaf55,type,
skaf55: $i > $i ).
tff(skaf68,type,
skaf68: $i > $i ).
tff(strictorderedP,type,
strictorderedP: $i > $o ).
tff(cyclefreeP,type,
cyclefreeP: $i > $o ).
tff(f_1653,axiom,
( neq(sk2,nil)
| neq(sk2,nil) ),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1847,axiom,
( ssItem(sk6)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1851,axiom,
( ssList(sk7)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1855,axiom,
( ssList(sk8)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1863,axiom,
( ( app(sk7,sk8) = sk3 )
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1859,axiom,
( ( app(app(sk7,cons(sk6,nil)),sk8) = sk4 )
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1843,axiom,
! [A,B,C] :
( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk2 )
| ( app(B,C) != sk1 )
| ( A != sk5(C,B,A) )
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1782,axiom,
! [A,B,C] :
( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk2 )
| ( app(B,C) != sk1 )
| ssItem(sk5(C,B,A))
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1802,axiom,
! [A,B,C] :
( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk2 )
| ( app(B,C) != sk1 )
| memberP(sk2,sk5(C,B,A))
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1877,axiom,
! [A] :
( ~ ssItem(A)
| ( sk6 = A )
| ~ memberP(sk4,A)
| ~ geq(A,sk6)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1822,axiom,
! [A,B,C] :
( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk2 )
| ( app(B,C) != sk1 )
| geq(sk5(C,B,A),A)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(c_384,plain,
neq(sk2,nil),
inference(cnfTransformation,[status(thm)],[f_1653]) ).
tff(c_380,plain,
sk4 = sk2,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_416,plain,
( ~ neq(sk4,nil)
| ssItem(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1847]) ).
tff(c_439,plain,
( ~ neq(sk2,nil)
| ssItem(sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_416]) ).
tff(c_450,plain,
ssItem(sk6),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_439]) ).
tff(c_418,plain,
( ~ neq(sk4,nil)
| ssList(sk7) ),
inference(cnfTransformation,[status(thm)],[f_1851]) ).
tff(c_447,plain,
( ~ neq(sk2,nil)
| ssList(sk7) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_418]) ).
tff(c_466,plain,
ssList(sk7),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_447]) ).
tff(c_420,plain,
( ~ neq(sk4,nil)
| ssList(sk8) ),
inference(cnfTransformation,[status(thm)],[f_1855]) ).
tff(c_441,plain,
( ~ neq(sk2,nil)
| ssList(sk8) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_420]) ).
tff(c_454,plain,
ssList(sk8),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_441]) ).
tff(c_382,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1650]) ).
tff(c_424,plain,
( ~ neq(sk4,nil)
| ( app(sk7,sk8) = sk3 ) ),
inference(cnfTransformation,[status(thm)],[f_1863]) ).
tff(c_438,plain,
( ~ neq(sk4,nil)
| ( app(sk7,sk8) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_424]) ).
tff(c_442,plain,
( ~ neq(sk2,nil)
| ( app(sk7,sk8) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_438]) ).
tff(c_456,plain,
app(sk7,sk8) = sk1,
inference(demodulation,[status(thm),theory(equality)],[c_384,c_442]) ).
tff(c_422,plain,
( ~ neq(sk4,nil)
| ( app(app(sk7,cons(sk6,nil)),sk8) = sk4 ) ),
inference(cnfTransformation,[status(thm)],[f_1859]) ).
tff(c_448,plain,
( ~ neq(sk2,nil)
| ( app(app(sk7,cons(sk6,nil)),sk8) = sk2 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_422]) ).
tff(c_468,plain,
app(app(sk7,cons(sk6,nil)),sk8) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_384,c_448]) ).
tff(c_414,plain,
! [C_351,B_350,A_349] :
( ~ neq(sk4,nil)
| ( sk5(C_351,B_350,A_349) != A_349 )
| ( app(B_350,C_351) != sk1 )
| ( app(app(B_350,cons(A_349,nil)),C_351) != sk2 )
| ~ ssList(C_351)
| ~ ssList(B_350)
| ~ ssItem(A_349) ),
inference(cnfTransformation,[status(thm)],[f_1843]) ).
tff(c_443,plain,
! [C_351,B_350,A_349] :
( ~ neq(sk2,nil)
| ( sk5(C_351,B_350,A_349) != A_349 )
| ( app(B_350,C_351) != sk1 )
| ( app(app(B_350,cons(A_349,nil)),C_351) != sk2 )
| ~ ssList(C_351)
| ~ ssList(B_350)
| ~ ssItem(A_349) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_414]) ).
tff(c_20449,plain,
! [C_1575,B_1576,A_1577] :
( ( sk5(C_1575,B_1576,A_1577) != A_1577 )
| ( app(B_1576,C_1575) != sk1 )
| ( app(app(B_1576,cons(A_1577,nil)),C_1575) != sk2 )
| ~ ssList(C_1575)
| ~ ssList(B_1576)
| ~ ssItem(A_1577) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_443]) ).
tff(c_20483,plain,
( ( sk5(sk8,sk7,sk6) != sk6 )
| ( app(sk7,sk8) != sk1 )
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ ssItem(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_468,c_20449]) ).
tff(c_20494,plain,
sk5(sk8,sk7,sk6) != sk6,
inference(demodulation,[status(thm),theory(equality)],[c_450,c_466,c_454,c_456,c_20483]) ).
tff(c_408,plain,
! [C_342,B_341,A_340] :
( ~ neq(sk4,nil)
| ssItem(sk5(C_342,B_341,A_340))
| ( app(B_341,C_342) != sk1 )
| ( app(app(B_341,cons(A_340,nil)),C_342) != sk2 )
| ~ ssList(C_342)
| ~ ssList(B_341)
| ~ ssItem(A_340) ),
inference(cnfTransformation,[status(thm)],[f_1782]) ).
tff(c_446,plain,
! [C_342,B_341,A_340] :
( ~ neq(sk2,nil)
| ssItem(sk5(C_342,B_341,A_340))
| ( app(B_341,C_342) != sk1 )
| ( app(app(B_341,cons(A_340,nil)),C_342) != sk2 )
| ~ ssList(C_342)
| ~ ssList(B_341)
| ~ ssItem(A_340) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_408]) ).
tff(c_20811,plain,
! [C_1589,B_1590,A_1591] :
( ssItem(sk5(C_1589,B_1590,A_1591))
| ( app(B_1590,C_1589) != sk1 )
| ( app(app(B_1590,cons(A_1591,nil)),C_1589) != sk2 )
| ~ ssList(C_1589)
| ~ ssList(B_1590)
| ~ ssItem(A_1591) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_446]) ).
tff(c_20845,plain,
( ssItem(sk5(sk8,sk7,sk6))
| ( app(sk7,sk8) != sk1 )
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ ssItem(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_468,c_20811]) ).
tff(c_20856,plain,
ssItem(sk5(sk8,sk7,sk6)),
inference(demodulation,[status(thm),theory(equality)],[c_450,c_466,c_454,c_456,c_20845]) ).
tff(c_410,plain,
! [C_345,B_344,A_343] :
( ~ neq(sk4,nil)
| memberP(sk2,sk5(C_345,B_344,A_343))
| ( app(B_344,C_345) != sk1 )
| ( app(app(B_344,cons(A_343,nil)),C_345) != sk2 )
| ~ ssList(C_345)
| ~ ssList(B_344)
| ~ ssItem(A_343) ),
inference(cnfTransformation,[status(thm)],[f_1802]) ).
tff(c_445,plain,
! [C_345,B_344,A_343] :
( ~ neq(sk2,nil)
| memberP(sk2,sk5(C_345,B_344,A_343))
| ( app(B_344,C_345) != sk1 )
| ( app(app(B_344,cons(A_343,nil)),C_345) != sk2 )
| ~ ssList(C_345)
| ~ ssList(B_344)
| ~ ssItem(A_343) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_410]) ).
tff(c_21194,plain,
! [C_1603,B_1604,A_1605] :
( memberP(sk2,sk5(C_1603,B_1604,A_1605))
| ( app(B_1604,C_1603) != sk1 )
| ( app(app(B_1604,cons(A_1605,nil)),C_1603) != sk2 )
| ~ ssList(C_1603)
| ~ ssList(B_1604)
| ~ ssItem(A_1605) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_445]) ).
tff(c_21228,plain,
( memberP(sk2,sk5(sk8,sk7,sk6))
| ( app(sk7,sk8) != sk1 )
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ ssItem(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_468,c_21194]) ).
tff(c_21239,plain,
memberP(sk2,sk5(sk8,sk7,sk6)),
inference(demodulation,[status(thm),theory(equality)],[c_450,c_466,c_454,c_456,c_21228]) ).
tff(c_426,plain,
! [A_352] :
( ~ neq(sk4,nil)
| ~ geq(A_352,sk6)
| ~ memberP(sk4,A_352)
| ( sk6 = A_352 )
| ~ ssItem(A_352) ),
inference(cnfTransformation,[status(thm)],[f_1877]) ).
tff(c_440,plain,
! [A_352] :
( ~ neq(sk2,nil)
| ~ geq(A_352,sk6)
| ~ memberP(sk2,A_352)
| ( sk6 = A_352 )
| ~ ssItem(A_352) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_426]) ).
tff(c_452,plain,
! [A_352] :
( ~ geq(A_352,sk6)
| ~ memberP(sk2,A_352)
| ( sk6 = A_352 )
| ~ ssItem(A_352) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_440]) ).
tff(c_21254,plain,
( ~ geq(sk5(sk8,sk7,sk6),sk6)
| ( sk5(sk8,sk7,sk6) = sk6 )
| ~ ssItem(sk5(sk8,sk7,sk6)) ),
inference(resolution,[status(thm)],[c_21239,c_452]) ).
tff(c_21257,plain,
( ~ geq(sk5(sk8,sk7,sk6),sk6)
| ( sk5(sk8,sk7,sk6) = sk6 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_20856,c_21254]) ).
tff(c_21258,plain,
~ geq(sk5(sk8,sk7,sk6),sk6),
inference(negUnitSimplification,[status(thm)],[c_20494,c_21257]) ).
tff(c_412,plain,
! [C_348,B_347,A_346] :
( ~ neq(sk4,nil)
| geq(sk5(C_348,B_347,A_346),A_346)
| ( app(B_347,C_348) != sk1 )
| ( app(app(B_347,cons(A_346,nil)),C_348) != sk2 )
| ~ ssList(C_348)
| ~ ssList(B_347)
| ~ ssItem(A_346) ),
inference(cnfTransformation,[status(thm)],[f_1822]) ).
tff(c_444,plain,
! [C_348,B_347,A_346] :
( ~ neq(sk2,nil)
| geq(sk5(C_348,B_347,A_346),A_346)
| ( app(B_347,C_348) != sk1 )
| ( app(app(B_347,cons(A_346,nil)),C_348) != sk2 )
| ~ ssList(C_348)
| ~ ssList(B_347)
| ~ ssItem(A_346) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_412]) ).
tff(c_21382,plain,
! [C_1615,B_1616,A_1617] :
( geq(sk5(C_1615,B_1616,A_1617),A_1617)
| ( app(B_1616,C_1615) != sk1 )
| ( app(app(B_1616,cons(A_1617,nil)),C_1615) != sk2 )
| ~ ssList(C_1615)
| ~ ssList(B_1616)
| ~ ssItem(A_1617) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_444]) ).
tff(c_21407,plain,
( geq(sk5(sk8,sk7,sk6),sk6)
| ( app(sk7,sk8) != sk1 )
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ ssItem(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_468,c_21382]) ).
tff(c_21418,plain,
geq(sk5(sk8,sk7,sk6),sk6),
inference(demodulation,[status(thm),theory(equality)],[c_450,c_466,c_454,c_456,c_21407]) ).
tff(c_21420,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_21258,c_21418]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC002-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 21:41:53 EDT 2023
% 0.14/0.36 % CPUTime :
% 22.53/8.79 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 22.53/8.80
% 22.53/8.80 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 22.53/8.83
% 22.53/8.83 Inference rules
% 22.53/8.83 ----------------------
% 22.53/8.83 #Ref : 0
% 22.53/8.83 #Sup : 4470
% 22.53/8.83 #Fact : 0
% 22.53/8.83 #Define : 0
% 22.53/8.83 #Split : 30
% 22.53/8.83 #Chain : 0
% 22.53/8.83 #Close : 0
% 22.53/8.83
% 22.53/8.83 Ordering : KBO
% 22.53/8.83
% 22.53/8.83 Simplification rules
% 22.53/8.83 ----------------------
% 22.53/8.83 #Subsume : 420
% 22.53/8.83 #Demod : 5547
% 22.53/8.83 #Tautology : 1136
% 22.53/8.83 #SimpNegUnit : 37
% 22.53/8.83 #BackRed : 164
% 22.53/8.83
% 22.53/8.83 #Partial instantiations: 0
% 22.53/8.83 #Strategies tried : 1
% 22.53/8.83
% 22.53/8.83 Timing (in seconds)
% 22.53/8.83 ----------------------
% 22.53/8.83 Preprocessing : 0.91
% 22.53/8.83 Parsing : 0.46
% 22.53/8.83 CNF conversion : 0.07
% 22.53/8.83 Main loop : 6.84
% 22.53/8.83 Inferencing : 1.67
% 22.53/8.83 Reduction : 3.28
% 22.53/8.83 Demodulation : 2.50
% 22.53/8.83 BG Simplification : 0.11
% 22.53/8.83 Subsumption : 1.34
% 22.53/8.83 Abstraction : 0.10
% 22.53/8.83 MUC search : 0.00
% 22.53/8.83 Cooper : 0.00
% 22.53/8.83 Total : 7.81
% 22.53/8.83 Index Insertion : 0.00
% 22.53/8.83 Index Deletion : 0.00
% 22.53/8.83 Index Matching : 0.00
% 22.53/8.83 BG Taut test : 0.00
%------------------------------------------------------------------------------