0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : /export/starexec/sandbox/solver/bin/execute.py 240 /export/starexec/sandbox/benchmark/theBenchmark.p 0.13/0.33 % Computer : n011.cluster.edu 0.13/0.33 % Model : x86_64 x86_64 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 % Memory : 8042.1875MB 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 1920 0.13/0.33 % WCLimit : 240 0.13/0.33 % DateTime : Wed Jul 30 02:00:34 EDT 2025 0.13/0.33 % CPUTime : 0.13/0.33 SPASS-SCL-FOL version: 0.19/0.42 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode] 558.74/112.19 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 240 /export/starexec/sandbox/benchmark/theBenchmark.p 558.74/112.19 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 240 /export/starexec/sandbox/benchmark/theBenchmark.p 558.74/112.19 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 240 /export/starexec/sandbox/benchmark/theBenchmark.p 558.74/112.19 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 240 /export/starexec/sandbox/benchmark/theBenchmark.p 558.74/112.19 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 240 /export/starexec/sandbox/benchmark/theBenchmark.p 558.74/112.19 Execution lmodel_grow ended with status: unsatisfiable 558.74/112.19 Used heuristic: lmodel_grow 558.74/112.19 558.74/112.19 Input Clauses: 558.74/112.19 1:2:2:INP:TopTop: -> model(skf1(x0),x0),status(x0,x1,sap) 558.74/112.19 2:2:3:INP:TopTopTop: model(x0,x1) -> status(x2,x1,sap) 558.74/112.19 3:3:3:INP:TopTopTop: status(x0,x1,sap),model(x2,x0) -> model(skf2(x1),x1) 558.74/112.19 4:2:2:INP:TopTop: status(x0,x1,wca) -> model(skf3(x1),x1) 558.74/112.19 5:2:2:INP:TopTop: status(x0,x1,wca),model(skf4(x1),x1) -> 558.74/112.19 6:2:3:INP:TopTopTop: status(x0,x1,wca),model(x2,x0) -> 558.74/112.19 7:4:4:INP:TopTopTopTop: model(x0,x1) -> model(x2,x1),model(skf5(x3),x3),status(x3,x1,wca) 558.74/112.19 8:2:2:INP:TopTop: -> model(skf6(x0,x1),x0),status(x0,x1,thm) 558.74/112.19 9:2:2:INP:TopTop: model(skf6(x0,x1),x1) -> status(x0,x1,thm) 558.74/112.19 10:3:3:INP:TopTopTop: status(x0,x1,thm),model(x2,x0) -> model(x2,x1) 558.74/112.19 11:2:2:INP:TopTop: -> model(skf7(x0),x0),status(x0,x1,cax) 558.74/112.19 12:2:3:INP:TopTopTop: status(x0,x1,cax),model(x2,x0) -> 558.74/112.19 13:2:3:INP:TopTopTop: ren1(x0,x1,x2),model(x0,x1) -> 558.74/112.19 14:2:3:INP:TopTopTop: ren1(x0,x1,x2) -> model(x0,x2) 558.74/112.19 15:3:3:INP:TopTopTop: model(x0,x1) -> model(x0,x2),ren1(x0,x2,x1) 558.74/112.19 16:3:3:INP:TopTopTop: ren2(x0,x1,x2),model(x0,x1) -> model(x0,x2) 558.74/112.19 17:2:3:INP:TopTopTop: -> model(x0,x1),ren2(x0,x1,x2) 558.74/112.19 18:2:3:INP:TopTopTop: model(x0,x1) -> ren2(x0,x2,x1) 558.74/112.19 19:5:5:INP:TopTopTopTopTop: model(x0,x1),ren1(x2,x1,x3),ren2(skf8(x1,x3),x1,x3) -> model(x4,x3),status(x1,x3,wth) 558.74/112.19 20:2:2:INP:TopTop: status(x0,x1,wth) -> model(skf9(x0),x0) 558.74/112.19 21:2:2:INP:TopTop: status(x0,x1,wth) -> ren1(skf10(x0,x1),x0,x1) 558.74/112.19 22:2:2:INP:TopTop: status(x0,x1,wth),model(skf11(x1),x1) -> 558.74/112.19 23:2:3:INP:TopTopTop: status(x0,x1,wth) -> ren2(x2,x0,x1) 558.74/112.19 24:3:3:INP:TopTopTop: model(x0,x1),model(x0,not(x2)) -> status(x1,x2,csa) 558.74/112.19 25:2:2:INP:TopTop: status(x0,x1,csa) -> model(skf12(x0,x1),x0) 558.74/112.19 26:2:2:INP:TopTop: status(x0,x1,csa) -> model(skf12(x0,x1),not(x1)) 558.74/112.19 27:3:2:INP:TopTop: model(skf14(x0),x0) -> model(skf13(x1),x1),status(x1,x0,tca) 558.74/112.19 28:2:3:INP:TopTopTop: status(x0,x1,tca),model(x2,x0) -> 558.74/112.19 29:2:3:INP:TopTopTop: status(x0,x1,tca) -> model(x2,x1) 558.74/112.19 30:2:3:INP:TopTopTop: status(x0,x1,tau) -> model(x2,x0) 558.74/112.19 31:2:3:INP:TopTopTop: status(x0,x1,tau) -> model(x2,x1) 558.74/112.19 32:3:2:INP:TopTop: model(skf15(x0),x0),model(skf16(x1),x1) -> status(x0,x1,tau) 558.74/112.19 33:2:3:INP:TopTopTop: status(x0,x1,tac) -> model(x2,x1) 558.74/112.19 34:2:2:INP:TopTop: status(x0,x1,tac) -> model(skf17(x0),x0) 558.74/112.19 35:3:3:INP:TopTopTop: model(skf18(x0),x0),model(x1,x2) -> status(x2,x0,tac) 558.74/112.19 36:3:3:INP:TopTopTop: ren3(x0,x1,x2),model(x0,x1) -> model(x0,x2) 558.74/112.19 37:3:3:INP:TopTopTop: ren3(x0,x1,x2),model(x0,x2) -> model(x0,x1) 558.74/112.19 38:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> ren3(x0,x1,x2) 558.74/112.19 39:3:3:INP:TopTopTop: -> model(x0,x1),model(x0,x2),ren3(x0,x1,x2) 558.74/112.19 40:2:2:INP:TopTop: status(x0,x1,eqv) -> model(skf19(x0),x0) 558.74/112.19 41:2:3:INP:TopTopTop: status(x0,x1,eqv) -> ren3(x2,x1,x0) 558.74/112.19 42:3:3:INP:TopTopTop: model(x0,x1),ren3(skf20(x1,x2),x2,x1) -> status(x1,x2,eqv) 558.74/112.19 43:2:2:INP:TopTop: status(x0,x1,sat) -> model(skf21(x0,x1),x0) 558.74/112.19 44:2:2:INP:TopTop: status(x0,x1,sat) -> model(skf21(x0,x1),x1) 558.74/112.19 45:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> status(x1,x2,sat) 558.74/112.19 46:2:3:INP:TopTopTop: status(x0,x1,uns) -> model(x2,x0) 558.74/112.19 47:2:3:INP:TopTopTop: status(x0,x1,uns) -> model(x2,not(x1)) 558.74/112.19 48:3:2:INP:TopTop: model(skf22(x0),x0),model(skf23(x1),not(x1)) -> status(x0,x1,uns) 558.74/112.19 49:3:3:INP:TopTopTop: status(x0,x1,unp),model(x2,x1) -> model(skf24(x0),x0) 558.74/112.19 50:2:3:INP:TopTopTop: model(x0,x1) -> status(x1,x2,unp) 558.74/112.19 51:2:2:INP:TopTop: -> model(skf25(x0),x0),status(x1,x0,unp) 558.74/112.19 52:2:2:INP:TopTop: status(x0,x1,wtc),model(skf26(x0),x0) -> 558.74/112.19 53:2:3:INP:TopTopTop: status(x0,x1,wtc) -> model(x2,x1) 558.74/112.19 54:2:2:INP:TopTop: status(x0,x1,wtc) -> model(skf27(x0),x0) 558.74/112.19 55:4:4:INP:TopTopTopTop: model(skf28(x0),x0),model(x1,x2) -> model(x3,x2),status(x2,x0,wtc) 558.74/112.19 56:2:3:INP:TopTopTop: ren4(x0,x1,x2) -> model(x0,x1) 558.74/112.19 57:2:3:INP:TopTopTop: ren4(x0,x1,x2),model(x0,x2) -> 558.74/112.19 58:3:3:INP:TopTopTop: model(x0,x1) -> model(x0,x2),ren4(x0,x1,x2) 558.74/112.19 59:3:3:INP:TopTopTop: ren5(x0,x1,x2),model(x0,x1) -> model(x0,x2) 558.74/112.19 60:2:3:INP:TopTopTop: -> model(x0,x1),ren5(x0,x1,x2) 558.74/112.19 61:2:3:INP:TopTopTop: model(x0,x1) -> ren5(x0,x2,x1) 558.74/112.19 62:2:2:INP:TopTop: status(x0,x1,wec) -> ren4(skf29(x0,x1),x1,x0) 558.74/112.19 63:2:3:INP:TopTopTop: status(x0,x1,wec) -> ren5(x2,x0,x1) 558.74/112.19 64:2:2:INP:TopTop: status(x0,x1,wec) -> model(skf30(x0),x0) 558.74/112.19 65:4:4:INP:TopTopTopTop: ren4(x0,x1,x2),ren5(skf31(x2,x1),x2,x1),model(x3,x2) -> status(x2,x1,wec) 558.74/112.19 66:3:3:INP:TopTopTop: model(x0,x1) -> model(skf32(x2),x2),status(x2,x1,sca) 558.74/112.19 67:2:3:INP:TopTopTop: status(x0,x1,sca),model(x2,x0) -> 558.74/112.19 68:2:2:INP:TopTop: status(x0,x1,sca) -> model(skf33(x1),x1) 558.74/112.19 69:2:3:INP:TopTopTop: ren6(x0,x1,x2) -> model(x0,x1) 558.74/112.19 70:2:3:INP:TopTopTop: ren6(x0,x1,x2) -> model(x0,x2) 558.74/112.19 71:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> ren6(x0,x1,x2) 558.74/112.19 72:2:3:INP:TopTopTop: ren7(x0,x1,x2) -> model(x0,not(x1)) 558.74/112.19 73:2:3:INP:TopTopTop: ren7(x0,x1,x2) -> model(x0,x2) 558.74/112.19 74:3:3:INP:TopTopTop: model(x0,not(x1)),model(x0,x2) -> ren7(x0,x1,x2) 558.74/112.19 75:2:2:INP:TopTop: status(x0,x1,noc) -> ren6(skf34(x0,x1),x1,x0) 558.74/112.19 76:2:2:INP:TopTop: status(x0,x1,noc) -> ren7(skf35(x0,x1),x1,x0) 558.74/112.19 77:3:4:INP:TopTopTopTop: ren6(x0,x1,x2),ren7(x3,x1,x2) -> status(x2,x1,noc) 558.74/112.19 78:3:3:INP:TopTopTop: ren8(x0,x1),model(x2,x0) -> model(skf36(x1),x1) 558.74/112.19 79:3:3:INP:TopTopTop: ren8(x0,x1),model(x2,x1) -> model(skf37(x0),x0) 558.74/112.19 80:3:4:INP:TopTopTopTop: model(x0,x1),model(x2,x3) -> ren8(x1,x3) 558.74/112.19 81:3:2:INP:TopTop: -> model(skf38(x0),x0),model(skf39(x1),x1),ren8(x0,x1) 558.74/112.19 82:2:2:INP:TopTop: status(x0,x1,esa) -> ren8(x0,x1) 558.74/112.19 83:2:2:INP:TopTop: ren8(x0,x1) -> status(x0,x1,esa) 558.74/112.19 84:3:3:INP:TopTopTop: ren9(x0,x1,x2),model(x0,x1) -> model(x0,x2) 558.74/112.19 85:3:3:INP:TopTopTop: ren9(x0,x1,x2),model(x0,x2) -> model(x0,x1) 558.74/112.19 86:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> ren9(x0,x1,x2) 558.74/112.19 87:3:3:INP:TopTopTop: -> model(x0,x1),model(x0,x2),ren9(x0,x1,x2) 558.74/112.19 88:4:4:INP:TopTopTopTop: ren9(skf40(x0,x1),x1,x0),model(x2,x0) -> model(x3,x0),status(x0,x1,eth) 558.74/112.19 89:2:2:INP:TopTop: status(x0,x1,eth),model(skf41(x0),x0) -> 558.74/112.19 90:2:3:INP:TopTopTop: status(x0,x1,eth) -> ren9(x2,x1,x0) 558.74/112.19 91:2:2:INP:TopTop: status(x0,x1,eth) -> model(skf42(x0),x0) 558.74/112.19 92:3:4:INP:TopTopTopTop: nevera(x0,x1),status(x2,x3,x0),status(x2,x3,x1) -> 558.74/112.19 93:2:2:INP:TopTop: -> status(skf43(x0,x1),skf44(x0,x1),x0),nevera(x0,x1) 558.74/112.19 94:2:2:INP:TopTop: -> status(skf43(x0,x1),skf44(x0,x1),x1),nevera(x0,x1) 558.74/112.19 95:1:1:INP:Top: model(x0,skc45) -> 558.74/112.19 96:1:0:INP:: -> model(skc48,skc46) 558.74/112.19 97:1:0:INP:: model(skc49,skc47) -> 558.74/112.19 98:1:0:INP:: model(skc50,skc46) -> 558.74/112.19 99:1:0:INP:: -> model(skc50,skc47) 558.74/112.19 100:2:1:INP:Top: model(x0,skc46) -> model(x0,skc47) 558.74/112.19 101:2:2:INP:TopTop: nota(x0,x1),status(skf51(x0,x1),skf52(x0,x1),x1) -> 558.74/112.19 102:2:2:INP:TopTop: nota(x0,x1) -> status(skf51(x0,x1),skf52(x0,x1),x0) 558.74/112.19 103:3:4:INP:TopTopTopTop: status(x0,x1,x2) -> status(x0,x1,x3),nota(x2,x3) 558.74/112.19 104:1:0:INP:: model(skc54,skc53) -> 558.74/112.19 105:1:0:INP:: -> model(skc55,skc53) 558.74/112.19 106:3:4:INP:TopTopTopTop: status(x0,x1,x2),status(x0,x1,x3) -> mighta(x2,x3) 558.74/112.19 107:2:2:INP:TopTop: mighta(x0,x1) -> status(skf56(x0,x1),skf57(x0,x1),x0) 558.74/112.19 108:2:2:INP:TopTop: mighta(x0,x1) -> status(skf56(x0,x1),skf57(x0,x1),x1) 558.74/112.19 109:1:0:INP:: model(skc58,skc60) -> 558.74/112.19 110:1:0:INP:: -> model(skc61,skc60) 558.74/112.19 111:1:0:INP:: -> model(skc58,skc59) 558.74/112.19 112:1:1:INP:Top: -> model(x0,skc62) 558.74/112.19 113:2:2:INP:TopTop: model(x0,x1),model(x0,not(x1)) -> 558.74/112.19 114:2:2:INP:TopTop: -> model(x0,not(x1)),model(x0,x1) 558.74/112.19 115:3:4:INP:TopTopTopTop: isa(x0,x1),status(x2,x3,x0) -> status(x2,x3,x1) 558.74/112.19 116:2:2:INP:TopTop: -> status(skf63(x0,x1),skf64(x0,x1),x0),isa(x0,x1) 558.74/112.19 117:2:2:INP:TopTop: status(skf63(x0,x1),skf64(x0,x1),x1) -> isa(x0,x1) 558.74/112.19 118:3:4:INP:TopTopTopTop: ren10(x0,x1,x2,x3),status(x0,x1,x2) -> status(x0,x1,x3) 558.74/112.19 119:3:4:INP:TopTopTopTop: ren10(x0,x1,x2,x3),status(x0,x1,x3) -> status(x0,x1,x2) 558.74/112.19 120:3:4:INP:TopTopTopTop: status(x0,x1,x2),status(x0,x1,x3) -> ren10(x0,x1,x2,x3) 558.74/112.19 121:3:4:INP:TopTopTopTop: -> status(x0,x1,x2),status(x0,x1,x3),ren10(x0,x1,x2,x3) 558.74/112.19 122:2:2:INP:TopTop: -> ren10(skf65(x0,x1),skf66(x0,x1),x0,x1),xora(x0,x1) 558.74/112.19 123:2:4:INP:TopTopTopTop: xora(x0,x1),ren10(x2,x3,x0,x1) -> 558.74/112.19 124:2:0:INP:: model(skc69,skc68),model(skc70,skc67) -> 558.74/112.19 125:1:0:INP:: -> model(skc71,skc67) 558.74/112.19 126:1:0:INP:: -> model(skc71,skc68) 558.74/112.19 127:2:2:INP:TopTop: model(x0,x1),model(x0,not(x1)) -> 558.74/112.19 128:2:2:INP:TopTop: -> model(x0,x1),model(x0,not(x1)) 558.74/112.19 129:1:0:INP:: nota(sat,thm) -> 558.74/112.19 558.74/112.19 Predicates: model status nevera nota mighta isa xora ren1 ren2 ren3 ren4 ren5 ren6 ren7 ren8 ren9 ren10 558.74/112.19 Fol Constants: sap wca thm cax wth csa tca tau tac eqv sat uns unp wtc wec sca noc esa eth skc45 skc46 skc47 skc48 skc49 skc50 skc53 skc54 skc55 skc58 skc59 skc60 skc61 skc62 skc67 skc68 skc69 skc70 skc71 558.74/112.19 Fol Functions: not skf1 skf2 skf3 skf4 skf5 skf6 skf7 skf8 skf9 skf10 skf11 skf12 skf13 skf14 skf15 skf16 skf17 skf18 skf19 skf20 skf21 skf22 skf23 skf24 skf25 skf26 skf27 skf28 skf29 skf30 skf31 skf32 skf33 skf34 skf35 skf36 skf37 skf38 skf39 skf40 skf41 skf42 skf43 skf44 skf51 skf52 skf56 skf57 skf63 skf64 skf65 skf66 558.74/112.19 Problem Properties: 558.74/112.19 This is a full first-order problem without equality. 558.74/112.19 558.74/112.19 After reduction: Problem Properties: 558.74/112.19 This is a full first-order problem without equality. 558.74/112.19 558.74/112.19 558.74/112.19 Reduced Input Clauses: 558.74/112.19 1:2:2:INP:TopTop: -> model(skf1(x0),x0),status(x0,x1,sap) 558.74/112.19 2:2:3:INP:TopTopTop: model(x0,x1) -> status(x2,x1,sap) 558.74/112.19 3:3:3:INP:TopTopTop: status(x0,x1,sap),model(x2,x0) -> model(skf2(x1),x1) 558.74/112.19 4:2:2:INP:TopTop: status(x0,x1,wca) -> model(skf3(x1),x1) 558.74/112.19 5:2:2:INP:TopTop: status(x0,x1,wca),model(skf4(x1),x1) -> 558.74/112.19 6:2:3:INP:TopTopTop: status(x0,x1,wca),model(x2,x0) -> 558.74/112.19 7:4:4:INP:TopTopTopTop: model(x0,x1) -> model(x2,x1),model(skf5(x3),x3),status(x3,x1,wca) 558.74/112.19 8:2:2:INP:TopTop: -> model(skf6(x0,x1),x0),status(x0,x1,thm) 558.74/112.19 9:2:2:INP:TopTop: model(skf6(x0,x1),x1) -> status(x0,x1,thm) 558.74/112.19 10:3:3:INP:TopTopTop: status(x0,x1,thm),model(x2,x0) -> model(x2,x1) 558.74/112.19 11:2:2:INP:TopTop: -> model(skf7(x0),x0),status(x0,x1,cax) 558.74/112.19 12:2:3:INP:TopTopTop: status(x0,x1,cax),model(x2,x0) -> 558.74/112.19 13:2:3:INP:TopTopTop: ren1(x0,x1,x2),model(x0,x1) -> 558.74/112.19 14:2:3:INP:TopTopTop: ren1(x0,x1,x2) -> model(x0,x2) 558.74/112.19 15:3:3:INP:TopTopTop: model(x0,x1) -> model(x0,x2),ren1(x0,x2,x1) 558.74/112.19 16:3:3:INP:TopTopTop: ren2(x0,x1,x2),model(x0,x1) -> model(x0,x2) 558.74/112.19 17:2:3:INP:TopTopTop: -> model(x0,x1),ren2(x0,x1,x2) 558.74/112.19 18:2:3:INP:TopTopTop: model(x0,x1) -> ren2(x0,x2,x1) 558.74/112.19 19:5:5:INP:TopTopTopTopTop: model(x0,x1),ren1(x2,x1,x3),ren2(skf8(x1,x3),x1,x3) -> model(x4,x3),status(x1,x3,wth) 558.74/112.19 20:2:2:INP:TopTop: status(x0,x1,wth) -> model(skf9(x0),x0) 558.74/112.19 21:2:2:INP:TopTop: status(x0,x1,wth) -> ren1(skf10(x0,x1),x0,x1) 558.74/112.19 22:2:2:INP:TopTop: status(x0,x1,wth),model(skf11(x1),x1) -> 558.74/112.19 23:2:3:INP:TopTopTop: status(x0,x1,wth) -> ren2(x2,x0,x1) 558.74/112.19 24:3:3:INP:TopTopTop: model(x0,x1),model(x0,not(x2)) -> status(x1,x2,csa) 558.74/112.19 25:2:2:INP:TopTop: status(x0,x1,csa) -> model(skf12(x0,x1),x0) 558.74/112.19 26:2:2:INP:TopTop: status(x0,x1,csa) -> model(skf12(x0,x1),not(x1)) 558.74/112.19 27:3:2:INP:TopTop: model(skf14(x0),x0) -> model(skf13(x1),x1),status(x1,x0,tca) 558.74/112.19 28:2:3:INP:TopTopTop: status(x0,x1,tca),model(x2,x0) -> 558.74/112.19 29:2:3:INP:TopTopTop: status(x0,x1,tca) -> model(x2,x1) 558.74/112.19 30:2:3:INP:TopTopTop: status(x0,x1,tau) -> model(x2,x0) 558.74/112.19 31:2:3:INP:TopTopTop: status(x0,x1,tau) -> model(x2,x1) 558.74/112.19 32:3:2:INP:TopTop: model(skf15(x0),x0),model(skf16(x1),x1) -> status(x0,x1,tau) 558.74/112.19 33:2:3:INP:TopTopTop: status(x0,x1,tac) -> model(x2,x1) 558.74/112.19 34:2:2:INP:TopTop: status(x0,x1,tac) -> model(skf17(x0),x0) 558.74/112.19 35:3:3:INP:TopTopTop: model(skf18(x0),x0),model(x1,x2) -> status(x2,x0,tac) 558.74/112.19 36:3:3:INP:TopTopTop: ren3(x0,x1,x2),model(x0,x1) -> model(x0,x2) 558.74/112.19 37:3:3:INP:TopTopTop: ren3(x0,x1,x2),model(x0,x2) -> model(x0,x1) 558.74/112.19 38:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> ren3(x0,x1,x2) 558.74/112.19 39:3:3:INP:TopTopTop: -> model(x0,x1),model(x0,x2),ren3(x0,x1,x2) 558.74/112.19 40:2:2:INP:TopTop: status(x0,x1,eqv) -> model(skf19(x0),x0) 558.74/112.19 41:2:3:INP:TopTopTop: status(x0,x1,eqv) -> ren3(x2,x1,x0) 558.74/112.19 42:3:3:INP:TopTopTop: model(x0,x1),ren3(skf20(x1,x2),x2,x1) -> status(x1,x2,eqv) 558.74/112.19 43:2:2:INP:TopTop: status(x0,x1,sat) -> model(skf21(x0,x1),x0) 558.74/112.19 44:2:2:INP:TopTop: status(x0,x1,sat) -> model(skf21(x0,x1),x1) 558.74/112.19 45:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> status(x1,x2,sat) 558.74/112.19 46:2:3:INP:TopTopTop: status(x0,x1,uns) -> model(x2,x0) 558.74/112.19 47:2:3:INP:TopTopTop: status(x0,x1,uns) -> model(x2,not(x1)) 558.74/112.19 48:3:2:INP:TopTop: model(skf22(x0),x0),model(skf23(x1),not(x1)) -> status(x0,x1,uns) 558.74/112.19 49:3:3:INP:TopTopTop: status(x0,x1,unp),model(x2,x1) -> model(skf24(x0),x0) 558.74/112.19 50:2:3:INP:TopTopTop: model(x0,x1) -> status(x1,x2,unp) 558.74/112.19 51:2:2:INP:TopTop: -> model(skf25(x0),x0),status(x1,x0,unp) 558.74/112.19 52:2:2:INP:TopTop: status(x0,x1,wtc),model(skf26(x0),x0) -> 558.74/112.19 53:2:3:INP:TopTopTop: status(x0,x1,wtc) -> model(x2,x1) 558.74/112.19 54:2:2:INP:TopTop: status(x0,x1,wtc) -> model(skf27(x0),x0) 558.74/112.19 55:4:4:INP:TopTopTopTop: model(skf28(x0),x0),model(x1,x2) -> model(x3,x2),status(x2,x0,wtc) 558.74/112.19 56:2:3:INP:TopTopTop: ren4(x0,x1,x2) -> model(x0,x1) 558.74/112.19 57:2:3:INP:TopTopTop: ren4(x0,x1,x2),model(x0,x2) -> 558.74/112.19 58:3:3:INP:TopTopTop: model(x0,x1) -> model(x0,x2),ren4(x0,x1,x2) 558.74/112.19 59:3:3:INP:TopTopTop: ren5(x0,x1,x2),model(x0,x1) -> model(x0,x2) 558.74/112.19 60:2:3:INP:TopTopTop: -> model(x0,x1),ren5(x0,x1,x2) 558.74/112.19 61:2:3:INP:TopTopTop: model(x0,x1) -> ren5(x0,x2,x1) 558.74/112.19 62:2:2:INP:TopTop: status(x0,x1,wec) -> ren4(skf29(x0,x1),x1,x0) 558.74/112.19 63:2:3:INP:TopTopTop: status(x0,x1,wec) -> ren5(x2,x0,x1) 558.74/112.19 64:2:2:INP:TopTop: status(x0,x1,wec) -> model(skf30(x0),x0) 558.74/112.19 65:4:4:INP:TopTopTopTop: ren4(x0,x1,x2),ren5(skf31(x2,x1),x2,x1),model(x3,x2) -> status(x2,x1,wec) 558.74/112.19 66:3:3:INP:TopTopTop: model(x0,x1) -> model(skf32(x2),x2),status(x2,x1,sca) 558.74/112.19 67:2:3:INP:TopTopTop: status(x0,x1,sca),model(x2,x0) -> 558.74/112.19 68:2:2:INP:TopTop: status(x0,x1,sca) -> model(skf33(x1),x1) 558.74/112.19 69:2:3:INP:TopTopTop: ren6(x0,x1,x2) -> model(x0,x1) 558.74/112.19 70:2:3:INP:TopTopTop: ren6(x0,x1,x2) -> model(x0,x2) 558.74/112.19 71:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> ren6(x0,x1,x2) 558.74/112.19 72:2:3:INP:TopTopTop: ren7(x0,x1,x2) -> model(x0,not(x1)) 558.74/112.19 73:2:3:INP:TopTopTop: ren7(x0,x1,x2) -> model(x0,x2) 558.74/112.19 74:3:3:INP:TopTopTop: model(x0,not(x1)),model(x0,x2) -> ren7(x0,x1,x2) 558.74/112.19 75:2:2:INP:TopTop: status(x0,x1,noc) -> ren6(skf34(x0,x1),x1,x0) 558.74/112.19 76:2:2:INP:TopTop: status(x0,x1,noc) -> ren7(skf35(x0,x1),x1,x0) 558.74/112.19 77:3:4:INP:TopTopTopTop: ren6(x0,x1,x2),ren7(x3,x1,x2) -> status(x2,x1,noc) 558.74/112.19 78:3:3:INP:TopTopTop: ren8(x0,x1),model(x2,x0) -> model(skf36(x1),x1) 558.74/112.19 79:3:3:INP:TopTopTop: ren8(x0,x1),model(x2,x1) -> model(skf37(x0),x0) 558.74/112.19 80:3:4:INP:TopTopTopTop: model(x0,x1),model(x2,x3) -> ren8(x1,x3) 558.74/112.19 81:3:2:INP:TopTop: -> model(skf38(x0),x0),model(skf39(x1),x1),ren8(x0,x1) 558.74/112.19 82:2:2:INP:TopTop: status(x0,x1,esa) -> ren8(x0,x1) 558.74/112.19 83:2:2:INP:TopTop: ren8(x0,x1) -> status(x0,x1,esa) 558.74/112.19 84:3:3:INP:TopTopTop: ren9(x0,x1,x2),model(x0,x1) -> model(x0,x2) 558.74/112.19 85:3:3:INP:TopTopTop: ren9(x0,x1,x2),model(x0,x2) -> model(x0,x1) 558.74/112.19 86:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> ren9(x0,x1,x2) 558.74/112.19 87:3:3:INP:TopTopTop: -> model(x0,x1),model(x0,x2),ren9(x0,x1,x2) 558.74/112.19 88:4:4:INP:TopTopTopTop: ren9(skf40(x0,x1),x1,x0),model(x2,x0) -> model(x3,x0),status(x0,x1,eth) 558.74/112.19 89:2:2:INP:TopTop: status(x0,x1,eth),model(skf41(x0),x0) -> 558.74/112.19 90:2:3:INP:TopTopTop: status(x0,x1,eth) -> ren9(x2,x1,x0) 558.74/112.19 91:2:2:INP:TopTop: status(x0,x1,eth) -> model(skf42(x0),x0) 558.74/112.19 92:3:4:INP:TopTopTopTop: nevera(x0,x1),status(x2,x3,x0),status(x2,x3,x1) -> 558.74/112.19 93:2:2:INP:TopTop: -> status(skf43(x0,x1),skf44(x0,x1),x0),nevera(x0,x1) 558.74/112.19 94:2:2:INP:TopTop: -> status(skf43(x0,x1),skf44(x0,x1),x1),nevera(x0,x1) 558.74/112.19 95:1:1:INP:Top: model(x0,skc45) -> 558.74/112.19 96:1:0:INP:: -> model(skc48,skc46) 558.74/112.19 97:1:0:INP:: model(skc49,skc47) -> 558.74/112.19 98:1:0:INP:: model(skc50,skc46) -> 558.74/112.19 99:1:0:INP:: -> model(skc50,skc47) 558.74/112.19 100:2:1:INP:Top: model(x0,skc46) -> model(x0,skc47) 558.74/112.19 101:2:2:INP:TopTop: nota(x0,x1),status(skf51(x0,x1),skf52(x0,x1),x1) -> 558.74/112.19 102:2:2:INP:TopTop: nota(x0,x1) -> status(skf51(x0,x1),skf52(x0,x1),x0) 558.74/112.19 103:3:4:INP:TopTopTopTop: status(x0,x1,x2) -> status(x0,x1,x3),nota(x2,x3) 558.74/112.19 104:1:0:INP:: model(skc54,skc53) -> 558.74/112.19 105:1:0:INP:: -> model(skc55,skc53) 558.74/112.19 106:3:4:INP:TopTopTopTop: status(x0,x1,x2),status(x0,x1,x3) -> mighta(x2,x3) 558.74/112.19 107:2:2:INP:TopTop: mighta(x0,x1) -> status(skf56(x0,x1),skf57(x0,x1),x0) 558.74/112.19 108:2:2:INP:TopTop: mighta(x0,x1) -> status(skf56(x0,x1),skf57(x0,x1),x1) 558.74/112.19 109:1:0:INP:: model(skc58,skc60) -> 558.74/112.19 110:1:0:INP:: -> model(skc61,skc60) 558.74/112.19 111:1:0:INP:: -> model(skc58,skc59) 558.74/112.19 112:1:1:INP:Top: -> model(x0,skc62) 558.74/112.19 129:1:0:INP:: nota(sat,thm) -> 558.74/112.19 128:2:2:INP:TopTop: -> model(x0,x1),model(x0,not(x1)) 558.74/112.19 115:3:4:INP:TopTopTopTop: isa(x0,x1),status(x2,x3,x0) -> status(x2,x3,x1) 558.74/112.19 116:2:2:INP:TopTop: -> status(skf63(x0,x1),skf64(x0,x1),x0),isa(x0,x1) 558.74/112.19 117:2:2:INP:TopTop: status(skf63(x0,x1),skf64(x0,x1),x1) -> isa(x0,x1) 558.74/112.19 118:3:4:INP:TopTopTopTop: ren10(x0,x1,x2,x3),status(x0,x1,x2) -> status(x0,x1,x3) 558.74/112.19 119:3:4:INP:TopTopTopTop: ren10(x0,x1,x2,x3),status(x0,x1,x3) -> status(x0,x1,x2) 558.74/112.19 120:3:4:INP:TopTopTopTop: status(x0,x1,x2),status(x0,x1,x3) -> ren10(x0,x1,x2,x3) 558.74/112.19 121:3:4:INP:TopTopTopTop: -> status(x0,x1,x2),status(x0,x1,x3),ren10(x0,x1,x2,x3) 558.74/112.19 122:2:2:INP:TopTop: -> ren10(skf65(x0,x1),skf66(x0,x1),x0,x1),xora(x0,x1) 558.74/112.19 123:2:4:INP:TopTopTopTop: xora(x0,x1),ren10(x2,x3,x0,x1) -> 558.74/112.19 124:2:0:INP:: model(skc69,skc68),model(skc70,skc67) -> 558.74/112.19 125:1:0:INP:: -> model(skc71,skc67) 558.74/112.19 126:1:0:INP:: -> model(skc71,skc68) 558.74/112.19 127:2:2:INP:TopTop: model(x0,x1),model(x0,not(x1)) -> 558.74/112.19 558.74/112.19 Most General Atoms: ren1(x2,x1,x3) ren2(x2,x0,x1) ren3(x2,x1,x0) ren4(x0,x1,x2) ren5(x2,x0,x1) ren6(x0,x1,x2) ren7(x3,x1,x2) ren8(x1,x3) model(x3,x0) ren9(x2,x1,x0) nevera(x0,x1) status(x0,x1,x3) nota(x2,x3) mighta(x0,x1) isa(x0,x1) xora(x0,x1) ren10(x2,x3,x0,x1) 558.74/112.19 558.74/112.19 === Starting SPASS-SCL-FOL A Little Less Naive, considering 109 atoms initially, heuristics mode: lmodel_grow === 558.74/112.19 558.74/112.19 === Conflict found: 116:2:2:INP:TopTop: -> status(skf63(x0,x1),skf64(x0,x1),x0),isa(x0,x1) {x0 -> sap, x1 -> sap} 558.74/112.19 === Backtracking. Learning clause 130:1:1:[116.1,117.1]:Top: -> isa(x0,x0) 558.74/112.19 === Conflict found: 127:2:2:INP:TopTop: model(x0,x1),model(x0,not(x1)) -> {x0 -> skf12(sap,sap), x1 -> sap} 558.74/112.19 === Backtracking. Learning clause 131:2:3:[127.1,46.2,47.2]:TopTopTop: status(x0,x1,uns),status(x2,x0,uns) -> 558.74/112.19 === Conflict found: 101:2:2:INP:TopTop: nota(x0,x1),status(skf51(x0,x1),skf52(x0,x1),x1) -> {x0 -> sap, x1 -> sap} 558.74/112.19 === Backtracking. Learning clause 132:1:1:[101.2,102.2]:Top: nota(x0,x0) -> 558.74/112.19 === Conflict found: 120:3:4:INP:TopTopTopTop: status(x0,x1,x2),status(x0,x1,x3) -> ren10(x0,x1,x2,x3) {x0 -> sap, x1 -> sap, x2 -> sap, x3 -> sap} 558.74/112.19 === Backtracking. Learning clause 133:1:3:[120.1,121.1]:TopTopTop: -> ren10(x0,x1,x2,x2) 558.74/112.19 === Conflict found: 13:2:3:INP:TopTopTop: ren1(x0,x1,x2),model(x0,x1) -> {x0 -> sap, x1 -> sap, x2 -> sap} 558.74/112.19 === Backtracking. Learning clause 134:2:4:[13.2,14.2]:TopTopTopTop: ren1(x0,x1,x2),ren1(x0,x3,x1) -> 558.74/112.19 === Clause set with instances from active satisfied. Growing active. New size: 176 558.74/112.19 === Conflict found: 24:3:3:INP:TopTopTop: model(x0,x1),model(x0,not(x2)) -> status(x1,x2,csa) {x0 -> skf35(sap,sap), x1 -> sap, x2 -> sap} 558.74/112.19 === Backtracking. Learning clause 135:3:5:[24.1,73.2,72.2]:TopTopTopTopTop: ren7(x0,x1,x2),ren7(x0,x3,x4) -> status(x2,x3,csa) 558.74/112.19 === Clause set with instances from active satisfied. Growing active. New size: 262 558.74/112.19 === Conflict found: 10:3:3:INP:TopTopTop: status(x0,x1,thm),model(x2,x0) -> model(x2,x1) {x0 -> skc62, x1 -> skc71, x2 -> skc71} 558.74/112.19 === Backtracking. Learning clause 136:2:2:[10.2,112.1]:TopTop: status(skc62,x0,thm) -> model(x1,x0) 558.74/112.19 === Conflict found: 127:2:2:INP:TopTop: model(x0,x1),model(x0,not(x1)) -> {x0 -> skf35(sap,sap), x1 -> sap} 558.74/112.19 === Backtracking. Learning clause 137:2:4:[127.1,73.2,72.2]:TopTopTopTop: ren7(x0,x1,x2),ren7(x0,x2,x3) -> 558.74/112.19 === Conflict found: 18:2:3:INP:TopTopTop: model(x0,x1) -> ren2(x0,x2,x1) {x0 -> skf8(sap,sap), x1 -> sap, x2 -> sap} 558.74/112.19 === Backtracking. Learning clause 138:2:4:[18.1,17.1]:TopTopTopTop: -> ren2(x0,x1,x2),ren2(x0,x2,x3) 558.74/112.19 === Clause set with instances from active satisfied. Growing active. New size: 353 558.74/112.19 === Conflict found: 57:2:3:INP:TopTopTop: ren4(x0,x1,x2),model(x0,x2) -> {x0 -> skf29(sap,sap), x1 -> skc71, x2 -> skc71} 558.74/112.19 === Backtracking. Learning clause 139:2:3:[57.2,136.2]:TopTopTop: ren4(x0,x1,x2),status(skc62,x2,thm) -> 558.74/112.19 === Conflict found: 86:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> ren9(x0,x1,x2) {x0 -> skf40(sap,sap), x1 -> sap, x2 -> sap} 558.74/112.19 === Backtracking. Learning clause 140:2:2:[86.1,87.1,88.1,91.1]:TopTop: model(x0,x1) -> model(skf42(x1),x1) 558.74/112.19 === Conflict found: 57:2:3:INP:TopTopTop: ren4(x0,x1,x2),model(x0,x2) -> {x0 -> skf29(sap,sap), x1 -> skc71, x2 -> skc71} 558.74/112.19 === Backtracking. Learning clause 141:2:4:[57.2,56.2]:TopTopTopTop: ren4(x0,x1,x2),ren4(x0,x2,x3) -> 558.74/112.19 === Clause set with instances from active satisfied. Growing active. New size: 453 558.74/112.19 === Clause set with instances from active satisfied. Growing active. New size: 553 558.74/112.19 === Clause set with instances from active satisfied. Growing active. New size: 643 558.74/112.19 === Clause set with instances from active satisfied. Growing active. New size: 728 558.74/112.19 === Conflict found: 16:3:3:INP:TopTopTop: ren2(x0,x1,x2),model(x0,x1) -> model(x0,x2) {x0 -> sap, x1 -> skc71, x2 -> skc69} 558.74/112.19 === Backtracking. Learning clause 142:4:4:[16.1,23.2,24.1,25.1]:TopTopTopTop: model(x0,x1),status(x1,x2,wth),model(x0,not(x3)) -> model(skf12(x2,x3),x2) 558.74/112.19 === Clause set with instances from active satisfied. Growing active. New size: 822 558.74/112.19 === Conflict found: 76:2:2:INP:TopTop: status(x0,x1,noc) -> ren7(skf35(x0,x1),x1,x0) {x0 -> skc71, x1 -> skc71} 558.74/112.19 === Backtracking. Learning clause 143:2:2:[76.2,137.1,121.2]:TopTop: -> status(x0,x0,x1),ren10(x0,x0,x1,noc) 558.74/112.19 === Conflict found: 120:3:4:INP:TopTopTopTop: status(x0,x1,x2),status(x0,x1,x3) -> ren10(x0,x1,x2,x3) {x0 -> skc71, x1 -> sap, x2 -> skc69, x3 -> skc71} 558.74/112.19 === Backtracking. Learning clause 144:4:5:[120.1,115.3,103.2]:TopTopTopTopTop: isa(x0,x1),status(x2,x3,x4) -> ren10(x2,x3,x1,x0),nota(x4,x0) 558.74/112.19 === Conflict found: 115:3:4:INP:TopTopTopTop: isa(x0,x1),status(x2,x3,x0) -> status(x2,x3,x1) {x0 -> eth, x1 -> skc71, x2 -> sap, x3 -> wca} 558.74/112.19 === Backtracking. Learning clause 145:4:5:[115.2,121.1,115.2,117.2]:TopTopTopTopTop: isa(x0,x1),status(skf63(x1,x2),skf64(x1,x2),x2) -> ren10(x3,x4,x0,x1),status(x3,x4,x2) 558.74/112.19 === Clause set with instances from active satisfied. Growing active. New size: 920 558.74/112.19 === Conflict found: 103:3:4:INP:TopTopTopTop: status(x0,x1,x2) -> status(x0,x1,x3),nota(x2,x3) {x0 -> skc71, x1 -> skc70, x2 -> sat, x3 -> thm} 558.74/112.19 === Backtracking. Learning clause 147:5:5:[129.0,146.4,103.1,45.3,10.1,10.2]:TopTopTopTopTop: model(x0,x1),model(x0,x2),model(x3,x1),status(x2,x4,thm) -> model(x3,x4) 558.74/112.19 === Clause set with instances from active satisfied. Growing active. New size: 1022 558.74/112.19 === Conflict found: 41:2:3:INP:TopTopTop: status(x0,x1,eqv) -> ren3(x2,x1,x0) {x0 -> skc71, x1 -> skc67, x2 -> skc70} 558.74/112.19 === Backtracking. Learning clause 148:3:3:[41.2,37.1]:TopTopTop: status(x0,x1,eqv),model(x2,x0) -> model(x2,x1) 558.74/112.19 === Conflict found: 103:3:4:INP:TopTopTopTop: status(x0,x1,x2) -> status(x0,x1,x3),nota(x2,x3) {x0 -> skc71, x1 -> skc68, x2 -> sat, x3 -> thm} 558.74/112.19 === Backtracking. Learning clause 150:9:5:[129.0,149.9,103.2,147.4,45.3,124.1,148.3,147.5,36.3,41.2]:TopTopTopTopTop: model(skc70,x0),model(skc69,x0),model(x1,skc68),status(x2,skc67,eqv),model(x1,x3),model(skc70,x3),status(x2,x2,thm),model(x1,x4),status(x2,x4,eqv) -> 558.74/112.19 === Conflict found: 9:2:2:INP:TopTop: model(skf6(x0,x1),x1) -> status(x0,x1,thm) {x0 -> skf51(sap,sap), x1 -> skf51(sap,sap)} 558.74/112.19 === Backtracking. Learning clause 151:1:1:[9.1,8.1]:Top: -> status(x0,x0,thm) 558.74/112.19 === Conflict found: 150:9:5:[129.0,149.9,103.2,147.4,45.3,124.1,148.3,147.5,36.3,41.2]:TopTopTopTopTop: model(skc70,x0),model(skc69,x0),model(x1,skc68),status(x2,skc67,eqv),model(x1,x3),model(skc70,x3),status(x2,x2,thm),model(x1,x4),status(x2,x4,eqv) -> {x0 -> skc68, x1 -> skc71, x2 -> skc71, x3 -> skc68, x4 -> skc67} 558.74/112.19 === Backtracking. Learning clause 152:1:1:[150.7,151.1,147.5,112.1,147.5,112.1,103.2,129.1,45.3,126.1,36.3,125.1,112.1,41.2]:Top: status(x0,skc67,eqv) -> 558.74/112.19 === Clause set with instances from active satisfied. Growing active. New size: 1116 558.74/112.19 === Conflict found: 62:2:2:INP:TopTop: status(x0,x1,wec) -> ren4(skf29(x0,x1),x1,x0) {x0 -> skc71, x1 -> skc62} 558.74/112.19 === Backtracking. Learning clause 153:2:2:[62.2,139.1]:TopTop: status(x0,x1,wec),status(skc62,x0,thm) -> 558.74/112.19 === Conflict found: 147:5:5:[129.0,146.4,103.1,45.3,10.1,10.2]:TopTopTopTopTop: model(x0,x1),model(x0,x2),model(x3,x1),status(x2,x4,thm) -> model(x3,x4) {x0 -> skc69, x1 -> sap, x2 -> skc71, x3 -> skf29(skc69,sap), x4 -> skc70} 558.74/112.19 === Backtracking. Learning clause 154:5:7:[147.3,56.2,57.2]:TopTopTopTopTopTopTop: model(x0,x1),model(x0,x2),status(x2,x3,thm),ren4(x4,x1,x5),ren4(x4,x6,x3) -> 558.74/112.19 === Conflict found: 147:5:5:[129.0,146.4,103.1,45.3,10.1,10.2]:TopTopTopTopTop: model(x0,x1),model(x0,x2),model(x3,x1),status(x2,x4,thm) -> model(x3,x4) {x0 -> skf40(sap,sap), x1 -> skf51(sap,sap), x2 -> sap, x3 -> skc71, x4 -> sap} 558.74/112.19 === Backtracking. Learning clause 155:4:6:[147.3,33.2,33.2]:TopTopTopTopTopTop: model(x0,x1),status(x1,x2,thm),status(x3,x4,tac) -> model(x5,x2) 558.74/112.19 === Clause set with instances from active satisfied. Growing active. New size: 1223 558.74/112.19 === Conflict found: 147:5:5:[129.0,146.4,103.1,45.3,10.1,10.2]:TopTopTopTopTop: model(x0,x1),model(x0,x2),model(x3,x1),status(x2,x4,thm) -> model(x3,x4) {x0 -> skc61, x1 -> skc62, x2 -> skc60, x3 -> skc71, x4 -> skc60} 558.74/112.19 === Backtracking. Learning clause 156:4:4:[147.4,151.1,127.1]:TopTopTopTop: model(x0,x1),model(x0,x2),model(x3,x1),model(x3,not(x2)) -> 558.74/112.19 === Conflict found: 147:5:5:[129.0,146.4,103.1,45.3,10.1,10.2]:TopTopTopTopTop: model(x0,x1),model(x0,x2),model(x3,x1),status(x2,x4,thm) -> model(x3,x4) {x0 -> skc71, x1 -> skc68, x2 -> skc67, x3 -> skc70, x4 -> skc67} 558.74/112.19 === Backtracking. Learning clause 158:8:8:[129.0,157.8,147.4,151.1,147.5,103.2,45.3,36.3]:TopTopTopTopTopTopTopTop: model(x0,x1),model(x0,x2),model(x3,x4),model(x5,x4),model(x3,x1),ren3(x3,x6,x7),model(x3,x6) -> model(x5,x2) 558.74/112.19 === Conflict found: 147:5:5:[129.0,146.4,103.1,45.3,10.1,10.2]:TopTopTopTopTop: model(x0,x1),model(x0,x2),model(x3,x1),status(x2,x4,thm) -> model(x3,x4) {x0 -> skc71, x1 -> skc62, x2 -> skc67, x3 -> skc70, x4 -> skc67} 558.74/112.19 === Backtracking. Learning clause 159:4:2:[147.4,151.1,124.2]:TopTop: model(x0,x1),model(x0,skc67),model(skc70,x1),model(skc69,skc68) -> 558.74/112.19 === Conflict found: 147:5:5:[129.0,146.4,103.1,45.3,10.1,10.2]:TopTopTopTopTop: model(x0,x1),model(x0,x2),model(x3,x1),status(x2,x4,thm) -> model(x3,x4) {x0 -> skc71, x1 -> skc62, x2 -> skc60, x3 -> skc58, x4 -> skc60} 558.74/112.19 558.74/112.19 SZS status Unsatisfiable 558.74/112.19 558.74/112.19 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 558.74/112.19 558.74/112.19 SPASS-SCL-FOL Statistics: 558.74/112.19 Number of learned clauses: 27 558.74/112.19 Number of propagations: 7542 558.74/112.19 Number of decisions: 1834 558.74/112.19 Number of resolutions: 73 558.74/112.19 Number of condensations: 3 558.74/112.19 Number of sub resolutions: 3 558.74/112.19 Number of input literals (deduplicated): 109 558.74/112.19 Number of grows: 12 558.74/112.19 Number of considered ground atoms: 1223 558.74/112.19 558.74/112.19 Needed: 0:1:51.65 558.74/112.19 558.98/112.20 EOF