0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : /export/starexec/sandbox2/solver/bin/execute.py 240 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.12/0.33 % Computer : n013.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1920 0.12/0.33 % WCLimit : 240 0.12/0.33 % DateTime : Wed Jul 30 01:59:19 EDT 2025 0.12/0.33 % CPUTime : 0.12/0.33 SPASS-SCL-FOL version: 0.19/0.42 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode] 893.83/179.68 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 240 /export/starexec/sandbox2/benchmark/theBenchmark.p 893.83/179.68 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 240 /export/starexec/sandbox2/benchmark/theBenchmark.p 893.83/179.68 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 240 /export/starexec/sandbox2/benchmark/theBenchmark.p 893.83/179.68 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 240 /export/starexec/sandbox2/benchmark/theBenchmark.p 893.83/179.68 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 240 /export/starexec/sandbox2/benchmark/theBenchmark.p 893.83/179.68 Execution resolution_2 ended with status: unsatisfiable 893.83/179.68 Used heuristic: resolution_2 893.83/179.68 893.83/179.68 Input Clauses: 893.83/179.68 1:2:2:INP:TopTop: -> model(skf1(x0),x0),status(x0,x1,sap) 893.83/179.68 2:2:3:INP:TopTopTop: model(x0,x1) -> status(x2,x1,sap) 893.83/179.68 3:3:3:INP:TopTopTop: status(x0,x1,sap),model(x2,x0) -> model(skf2(x1),x1) 893.83/179.68 4:2:2:INP:TopTop: status(x0,x1,wca) -> model(skf3(x1),x1) 893.83/179.68 5:2:2:INP:TopTop: status(x0,x1,wca),model(skf4(x1),x1) -> 893.83/179.68 6:2:3:INP:TopTopTop: status(x0,x1,wca),model(x2,x0) -> 893.83/179.68 7:4:4:INP:TopTopTopTop: model(x0,x1) -> model(x2,x1),model(skf5(x3),x3),status(x3,x1,wca) 893.83/179.68 8:2:2:INP:TopTop: -> model(skf6(x0,x1),x0),status(x0,x1,thm) 893.83/179.68 9:2:2:INP:TopTop: model(skf6(x0,x1),x1) -> status(x0,x1,thm) 893.83/179.68 10:3:3:INP:TopTopTop: status(x0,x1,thm),model(x2,x0) -> model(x2,x1) 893.83/179.68 11:2:2:INP:TopTop: -> model(skf7(x0),x0),status(x0,x1,cax) 893.83/179.68 12:2:3:INP:TopTopTop: status(x0,x1,cax),model(x2,x0) -> 893.83/179.68 13:2:3:INP:TopTopTop: ren1(x0,x1,x2),model(x0,x1) -> 893.83/179.68 14:2:3:INP:TopTopTop: ren1(x0,x1,x2) -> model(x0,x2) 893.83/179.68 15:3:3:INP:TopTopTop: model(x0,x1) -> model(x0,x2),ren1(x0,x2,x1) 893.83/179.68 16:3:3:INP:TopTopTop: ren2(x0,x1,x2),model(x0,x1) -> model(x0,x2) 893.83/179.68 17:2:3:INP:TopTopTop: -> model(x0,x1),ren2(x0,x1,x2) 893.83/179.68 18:2:3:INP:TopTopTop: model(x0,x1) -> ren2(x0,x2,x1) 893.83/179.68 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) 893.83/179.68 20:2:2:INP:TopTop: status(x0,x1,wth) -> model(skf9(x0),x0) 893.83/179.68 21:2:2:INP:TopTop: status(x0,x1,wth) -> ren1(skf10(x0,x1),x0,x1) 893.83/179.68 22:2:2:INP:TopTop: status(x0,x1,wth),model(skf11(x1),x1) -> 893.83/179.68 23:2:3:INP:TopTopTop: status(x0,x1,wth) -> ren2(x2,x0,x1) 893.83/179.68 24:3:3:INP:TopTopTop: model(x0,x1),model(x0,not(x2)) -> status(x1,x2,csa) 893.83/179.68 25:2:2:INP:TopTop: status(x0,x1,csa) -> model(skf12(x0,x1),x0) 893.83/179.68 26:2:2:INP:TopTop: status(x0,x1,csa) -> model(skf12(x0,x1),not(x1)) 893.83/179.68 27:3:2:INP:TopTop: model(skf14(x0),x0) -> model(skf13(x1),x1),status(x1,x0,tca) 893.83/179.68 28:2:3:INP:TopTopTop: status(x0,x1,tca),model(x2,x0) -> 893.83/179.68 29:2:3:INP:TopTopTop: status(x0,x1,tca) -> model(x2,x1) 893.83/179.68 30:2:3:INP:TopTopTop: status(x0,x1,tau) -> model(x2,x0) 893.83/179.68 31:2:3:INP:TopTopTop: status(x0,x1,tau) -> model(x2,x1) 893.83/179.68 32:3:2:INP:TopTop: model(skf15(x0),x0),model(skf16(x1),x1) -> status(x0,x1,tau) 893.83/179.68 33:2:3:INP:TopTopTop: status(x0,x1,tac) -> model(x2,x1) 893.83/179.68 34:2:2:INP:TopTop: status(x0,x1,tac) -> model(skf17(x0),x0) 893.83/179.68 35:3:3:INP:TopTopTop: model(skf18(x0),x0),model(x1,x2) -> status(x2,x0,tac) 893.83/179.68 36:3:3:INP:TopTopTop: ren3(x0,x1,x2),model(x0,x1) -> model(x0,x2) 893.83/179.68 37:3:3:INP:TopTopTop: ren3(x0,x1,x2),model(x0,x2) -> model(x0,x1) 893.83/179.68 38:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> ren3(x0,x1,x2) 893.83/179.68 39:3:3:INP:TopTopTop: -> model(x0,x1),model(x0,x2),ren3(x0,x1,x2) 893.83/179.68 40:2:2:INP:TopTop: status(x0,x1,eqv) -> model(skf19(x0),x0) 893.83/179.68 41:2:3:INP:TopTopTop: status(x0,x1,eqv) -> ren3(x2,x1,x0) 893.83/179.68 42:3:3:INP:TopTopTop: model(x0,x1),ren3(skf20(x1,x2),x2,x1) -> status(x1,x2,eqv) 893.83/179.68 43:2:2:INP:TopTop: status(x0,x1,sat) -> model(skf21(x0,x1),x0) 893.83/179.68 44:2:2:INP:TopTop: status(x0,x1,sat) -> model(skf21(x0,x1),x1) 893.83/179.68 45:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> status(x1,x2,sat) 893.83/179.68 46:2:3:INP:TopTopTop: status(x0,x1,uns) -> model(x2,x0) 893.83/179.68 47:2:3:INP:TopTopTop: status(x0,x1,uns) -> model(x2,not(x1)) 893.83/179.68 48:3:2:INP:TopTop: model(skf22(x0),x0),model(skf23(x1),not(x1)) -> status(x0,x1,uns) 893.83/179.68 49:3:3:INP:TopTopTop: status(x0,x1,unp),model(x2,x1) -> model(skf24(x0),x0) 893.83/179.68 50:2:3:INP:TopTopTop: model(x0,x1) -> status(x1,x2,unp) 893.83/179.68 51:2:2:INP:TopTop: -> model(skf25(x0),x0),status(x1,x0,unp) 893.83/179.68 52:2:2:INP:TopTop: status(x0,x1,wtc),model(skf26(x0),x0) -> 893.83/179.68 53:2:3:INP:TopTopTop: status(x0,x1,wtc) -> model(x2,x1) 893.83/179.68 54:2:2:INP:TopTop: status(x0,x1,wtc) -> model(skf27(x0),x0) 893.83/179.68 55:4:4:INP:TopTopTopTop: model(skf28(x0),x0),model(x1,x2) -> model(x3,x2),status(x2,x0,wtc) 893.83/179.68 56:2:3:INP:TopTopTop: ren4(x0,x1,x2) -> model(x0,x1) 893.83/179.68 57:2:3:INP:TopTopTop: ren4(x0,x1,x2),model(x0,x2) -> 893.83/179.68 58:3:3:INP:TopTopTop: model(x0,x1) -> model(x0,x2),ren4(x0,x1,x2) 893.83/179.68 59:3:3:INP:TopTopTop: ren5(x0,x1,x2),model(x0,x1) -> model(x0,x2) 893.83/179.68 60:2:3:INP:TopTopTop: -> model(x0,x1),ren5(x0,x1,x2) 893.83/179.68 61:2:3:INP:TopTopTop: model(x0,x1) -> ren5(x0,x2,x1) 893.83/179.68 62:2:2:INP:TopTop: status(x0,x1,wec) -> ren4(skf29(x0,x1),x1,x0) 893.83/179.68 63:2:3:INP:TopTopTop: status(x0,x1,wec) -> ren5(x2,x0,x1) 893.83/179.68 64:2:2:INP:TopTop: status(x0,x1,wec) -> model(skf30(x0),x0) 893.83/179.68 65:4:4:INP:TopTopTopTop: ren4(x0,x1,x2),ren5(skf31(x2,x1),x2,x1),model(x3,x2) -> status(x2,x1,wec) 893.83/179.68 66:3:3:INP:TopTopTop: model(x0,x1) -> model(skf32(x2),x2),status(x2,x1,sca) 893.83/179.68 67:2:3:INP:TopTopTop: status(x0,x1,sca),model(x2,x0) -> 893.83/179.68 68:2:2:INP:TopTop: status(x0,x1,sca) -> model(skf33(x1),x1) 893.83/179.68 69:2:3:INP:TopTopTop: ren6(x0,x1,x2) -> model(x0,x1) 893.83/179.68 70:2:3:INP:TopTopTop: ren6(x0,x1,x2) -> model(x0,x2) 893.83/179.68 71:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> ren6(x0,x1,x2) 893.83/179.68 72:2:3:INP:TopTopTop: ren7(x0,x1,x2) -> model(x0,not(x1)) 893.83/179.68 73:2:3:INP:TopTopTop: ren7(x0,x1,x2) -> model(x0,x2) 893.83/179.68 74:3:3:INP:TopTopTop: model(x0,not(x1)),model(x0,x2) -> ren7(x0,x1,x2) 893.83/179.68 75:2:2:INP:TopTop: status(x0,x1,noc) -> ren6(skf34(x0,x1),x1,x0) 893.83/179.68 76:2:2:INP:TopTop: status(x0,x1,noc) -> ren7(skf35(x0,x1),x1,x0) 893.83/179.68 77:3:4:INP:TopTopTopTop: ren6(x0,x1,x2),ren7(x3,x1,x2) -> status(x2,x1,noc) 893.83/179.68 78:3:3:INP:TopTopTop: ren8(x0,x1),model(x2,x0) -> model(skf36(x1),x1) 893.83/179.68 79:3:3:INP:TopTopTop: ren8(x0,x1),model(x2,x1) -> model(skf37(x0),x0) 893.83/179.68 80:3:4:INP:TopTopTopTop: model(x0,x1),model(x2,x3) -> ren8(x1,x3) 893.83/179.68 81:3:2:INP:TopTop: -> model(skf38(x0),x0),model(skf39(x1),x1),ren8(x0,x1) 893.83/179.68 82:2:2:INP:TopTop: status(x0,x1,esa) -> ren8(x0,x1) 893.83/179.68 83:2:2:INP:TopTop: ren8(x0,x1) -> status(x0,x1,esa) 893.83/179.68 84:3:3:INP:TopTopTop: ren9(x0,x1,x2),model(x0,x1) -> model(x0,x2) 893.83/179.68 85:3:3:INP:TopTopTop: ren9(x0,x1,x2),model(x0,x2) -> model(x0,x1) 893.83/179.68 86:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> ren9(x0,x1,x2) 893.83/179.68 87:3:3:INP:TopTopTop: -> model(x0,x1),model(x0,x2),ren9(x0,x1,x2) 893.83/179.68 88:4:4:INP:TopTopTopTop: ren9(skf40(x0,x1),x1,x0),model(x2,x0) -> model(x3,x0),status(x0,x1,eth) 893.83/179.68 89:2:2:INP:TopTop: status(x0,x1,eth),model(skf41(x0),x0) -> 893.83/179.68 90:2:3:INP:TopTopTop: status(x0,x1,eth) -> ren9(x2,x1,x0) 893.83/179.68 91:2:2:INP:TopTop: status(x0,x1,eth) -> model(skf42(x0),x0) 893.83/179.68 92:3:4:INP:TopTopTopTop: nevera(x0,x1),status(x2,x3,x0),status(x2,x3,x1) -> 893.83/179.68 93:2:2:INP:TopTop: -> status(skf43(x0,x1),skf44(x0,x1),x0),nevera(x0,x1) 893.83/179.68 94:2:2:INP:TopTop: -> status(skf43(x0,x1),skf44(x0,x1),x1),nevera(x0,x1) 893.83/179.68 95:1:1:INP:Top: model(x0,skc45) -> 893.83/179.68 96:1:0:INP:: -> model(skc48,skc46) 893.83/179.68 97:1:0:INP:: model(skc49,skc47) -> 893.83/179.68 98:1:0:INP:: model(skc50,skc46) -> 893.83/179.68 99:1:0:INP:: -> model(skc50,skc47) 893.83/179.68 100:2:1:INP:Top: model(x0,skc46) -> model(x0,skc47) 893.83/179.68 101:2:2:INP:TopTop: nota(x0,x1),status(skf51(x0,x1),skf52(x0,x1),x1) -> 893.83/179.68 102:2:2:INP:TopTop: nota(x0,x1) -> status(skf51(x0,x1),skf52(x0,x1),x0) 893.83/179.68 103:3:4:INP:TopTopTopTop: status(x0,x1,x2) -> status(x0,x1,x3),nota(x2,x3) 893.83/179.68 104:1:0:INP:: model(skc54,skc53) -> 893.83/179.68 105:1:0:INP:: -> model(skc55,skc53) 893.83/179.68 106:3:4:INP:TopTopTopTop: status(x0,x1,x2),status(x0,x1,x3) -> mighta(x2,x3) 893.83/179.68 107:2:2:INP:TopTop: mighta(x0,x1) -> status(skf56(x0,x1),skf57(x0,x1),x0) 893.83/179.68 108:2:2:INP:TopTop: mighta(x0,x1) -> status(skf56(x0,x1),skf57(x0,x1),x1) 893.83/179.68 109:1:0:INP:: model(skc58,skc60) -> 893.83/179.68 110:1:0:INP:: -> model(skc61,skc60) 893.83/179.68 111:1:0:INP:: -> model(skc58,skc59) 893.83/179.68 112:1:1:INP:Top: -> model(x0,skc62) 893.83/179.68 113:2:2:INP:TopTop: model(x0,x1),model(x0,not(x1)) -> 893.83/179.68 114:2:2:INP:TopTop: -> model(x0,not(x1)),model(x0,x1) 893.83/179.68 115:3:4:INP:TopTopTopTop: isa(x0,x1),status(x2,x3,x0) -> status(x2,x3,x1) 893.83/179.68 116:2:2:INP:TopTop: -> status(skf63(x0,x1),skf64(x0,x1),x0),isa(x0,x1) 893.83/179.68 117:2:2:INP:TopTop: status(skf63(x0,x1),skf64(x0,x1),x1) -> isa(x0,x1) 893.83/179.68 118:3:4:INP:TopTopTopTop: ren10(x0,x1,x2,x3),status(x0,x1,x2) -> status(x0,x1,x3) 893.83/179.68 119:3:4:INP:TopTopTopTop: ren10(x0,x1,x2,x3),status(x0,x1,x3) -> status(x0,x1,x2) 893.83/179.68 120:3:4:INP:TopTopTopTop: status(x0,x1,x2),status(x0,x1,x3) -> ren10(x0,x1,x2,x3) 893.83/179.68 121:3:4:INP:TopTopTopTop: -> status(x0,x1,x2),status(x0,x1,x3),ren10(x0,x1,x2,x3) 893.83/179.68 122:2:2:INP:TopTop: -> ren10(skf65(x0,x1),skf66(x0,x1),x0,x1),xora(x0,x1) 893.83/179.68 123:2:4:INP:TopTopTopTop: xora(x0,x1),ren10(x2,x3,x0,x1) -> 893.83/179.68 124:2:0:INP:: model(skc69,skc68),model(skc70,skc67) -> 893.83/179.68 125:1:0:INP:: -> model(skc71,skc67) 893.83/179.68 126:1:0:INP:: -> model(skc71,skc68) 893.83/179.68 127:2:2:INP:TopTop: model(x0,x1),model(x0,not(x1)) -> 893.83/179.68 128:2:2:INP:TopTop: -> model(x0,x1),model(x0,not(x1)) 893.83/179.68 129:1:0:INP:: mighta(eqv,thm) -> 893.83/179.68 893.83/179.68 Predicates: model status nevera nota mighta isa xora ren1 ren2 ren3 ren4 ren5 ren6 ren7 ren8 ren9 ren10 893.83/179.68 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 893.83/179.68 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 893.83/179.68 Problem Properties: 893.83/179.68 This is a full first-order problem without equality. 893.83/179.68 893.83/179.68 After reduction: Problem Properties: 893.83/179.68 This is a full first-order problem without equality. 893.83/179.68 893.83/179.68 893.83/179.68 Reduced Input Clauses: 893.83/179.68 1:2:2:INP:TopTop: -> model(skf1(x0),x0),status(x0,x1,sap) 893.83/179.68 2:2:3:INP:TopTopTop: model(x0,x1) -> status(x2,x1,sap) 893.83/179.68 3:3:3:INP:TopTopTop: status(x0,x1,sap),model(x2,x0) -> model(skf2(x1),x1) 893.83/179.68 4:2:2:INP:TopTop: status(x0,x1,wca) -> model(skf3(x1),x1) 893.83/179.68 5:2:2:INP:TopTop: status(x0,x1,wca),model(skf4(x1),x1) -> 893.83/179.68 6:2:3:INP:TopTopTop: status(x0,x1,wca),model(x2,x0) -> 893.83/179.68 7:4:4:INP:TopTopTopTop: model(x0,x1) -> model(x2,x1),model(skf5(x3),x3),status(x3,x1,wca) 893.83/179.68 8:2:2:INP:TopTop: -> model(skf6(x0,x1),x0),status(x0,x1,thm) 893.83/179.68 9:2:2:INP:TopTop: model(skf6(x0,x1),x1) -> status(x0,x1,thm) 893.83/179.68 10:3:3:INP:TopTopTop: status(x0,x1,thm),model(x2,x0) -> model(x2,x1) 893.83/179.68 11:2:2:INP:TopTop: -> model(skf7(x0),x0),status(x0,x1,cax) 893.83/179.68 12:2:3:INP:TopTopTop: status(x0,x1,cax),model(x2,x0) -> 893.83/179.68 13:2:3:INP:TopTopTop: ren1(x0,x1,x2),model(x0,x1) -> 893.83/179.68 14:2:3:INP:TopTopTop: ren1(x0,x1,x2) -> model(x0,x2) 893.83/179.68 15:3:3:INP:TopTopTop: model(x0,x1) -> model(x0,x2),ren1(x0,x2,x1) 893.83/179.68 16:3:3:INP:TopTopTop: ren2(x0,x1,x2),model(x0,x1) -> model(x0,x2) 893.83/179.68 17:2:3:INP:TopTopTop: -> model(x0,x1),ren2(x0,x1,x2) 893.83/179.68 18:2:3:INP:TopTopTop: model(x0,x1) -> ren2(x0,x2,x1) 893.83/179.68 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) 893.83/179.68 20:2:2:INP:TopTop: status(x0,x1,wth) -> model(skf9(x0),x0) 893.83/179.68 21:2:2:INP:TopTop: status(x0,x1,wth) -> ren1(skf10(x0,x1),x0,x1) 893.83/179.68 22:2:2:INP:TopTop: status(x0,x1,wth),model(skf11(x1),x1) -> 893.83/179.68 23:2:3:INP:TopTopTop: status(x0,x1,wth) -> ren2(x2,x0,x1) 893.83/179.68 24:3:3:INP:TopTopTop: model(x0,x1),model(x0,not(x2)) -> status(x1,x2,csa) 893.83/179.68 25:2:2:INP:TopTop: status(x0,x1,csa) -> model(skf12(x0,x1),x0) 893.83/179.68 26:2:2:INP:TopTop: status(x0,x1,csa) -> model(skf12(x0,x1),not(x1)) 893.83/179.68 27:3:2:INP:TopTop: model(skf14(x0),x0) -> model(skf13(x1),x1),status(x1,x0,tca) 893.83/179.68 28:2:3:INP:TopTopTop: status(x0,x1,tca),model(x2,x0) -> 893.83/179.68 29:2:3:INP:TopTopTop: status(x0,x1,tca) -> model(x2,x1) 893.83/179.68 30:2:3:INP:TopTopTop: status(x0,x1,tau) -> model(x2,x0) 893.83/179.68 31:2:3:INP:TopTopTop: status(x0,x1,tau) -> model(x2,x1) 893.83/179.68 32:3:2:INP:TopTop: model(skf15(x0),x0),model(skf16(x1),x1) -> status(x0,x1,tau) 893.83/179.68 33:2:3:INP:TopTopTop: status(x0,x1,tac) -> model(x2,x1) 893.83/179.68 34:2:2:INP:TopTop: status(x0,x1,tac) -> model(skf17(x0),x0) 893.83/179.68 35:3:3:INP:TopTopTop: model(skf18(x0),x0),model(x1,x2) -> status(x2,x0,tac) 893.83/179.68 36:3:3:INP:TopTopTop: ren3(x0,x1,x2),model(x0,x1) -> model(x0,x2) 893.83/179.68 37:3:3:INP:TopTopTop: ren3(x0,x1,x2),model(x0,x2) -> model(x0,x1) 893.83/179.68 38:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> ren3(x0,x1,x2) 893.83/179.68 39:3:3:INP:TopTopTop: -> model(x0,x1),model(x0,x2),ren3(x0,x1,x2) 893.83/179.68 40:2:2:INP:TopTop: status(x0,x1,eqv) -> model(skf19(x0),x0) 893.83/179.68 41:2:3:INP:TopTopTop: status(x0,x1,eqv) -> ren3(x2,x1,x0) 893.83/179.68 42:3:3:INP:TopTopTop: model(x0,x1),ren3(skf20(x1,x2),x2,x1) -> status(x1,x2,eqv) 893.83/179.68 43:2:2:INP:TopTop: status(x0,x1,sat) -> model(skf21(x0,x1),x0) 893.83/179.68 44:2:2:INP:TopTop: status(x0,x1,sat) -> model(skf21(x0,x1),x1) 893.83/179.68 45:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> status(x1,x2,sat) 893.83/179.68 46:2:3:INP:TopTopTop: status(x0,x1,uns) -> model(x2,x0) 893.83/179.68 47:2:3:INP:TopTopTop: status(x0,x1,uns) -> model(x2,not(x1)) 893.83/179.68 48:3:2:INP:TopTop: model(skf22(x0),x0),model(skf23(x1),not(x1)) -> status(x0,x1,uns) 893.83/179.68 49:3:3:INP:TopTopTop: status(x0,x1,unp),model(x2,x1) -> model(skf24(x0),x0) 893.83/179.68 50:2:3:INP:TopTopTop: model(x0,x1) -> status(x1,x2,unp) 893.83/179.68 51:2:2:INP:TopTop: -> model(skf25(x0),x0),status(x1,x0,unp) 893.83/179.68 52:2:2:INP:TopTop: status(x0,x1,wtc),model(skf26(x0),x0) -> 893.83/179.68 53:2:3:INP:TopTopTop: status(x0,x1,wtc) -> model(x2,x1) 893.83/179.68 54:2:2:INP:TopTop: status(x0,x1,wtc) -> model(skf27(x0),x0) 893.83/179.68 55:4:4:INP:TopTopTopTop: model(skf28(x0),x0),model(x1,x2) -> model(x3,x2),status(x2,x0,wtc) 893.83/179.68 56:2:3:INP:TopTopTop: ren4(x0,x1,x2) -> model(x0,x1) 893.83/179.68 57:2:3:INP:TopTopTop: ren4(x0,x1,x2),model(x0,x2) -> 893.83/179.68 58:3:3:INP:TopTopTop: model(x0,x1) -> model(x0,x2),ren4(x0,x1,x2) 893.83/179.68 59:3:3:INP:TopTopTop: ren5(x0,x1,x2),model(x0,x1) -> model(x0,x2) 893.83/179.68 60:2:3:INP:TopTopTop: -> model(x0,x1),ren5(x0,x1,x2) 893.83/179.68 61:2:3:INP:TopTopTop: model(x0,x1) -> ren5(x0,x2,x1) 893.83/179.68 62:2:2:INP:TopTop: status(x0,x1,wec) -> ren4(skf29(x0,x1),x1,x0) 893.83/179.68 63:2:3:INP:TopTopTop: status(x0,x1,wec) -> ren5(x2,x0,x1) 893.83/179.68 64:2:2:INP:TopTop: status(x0,x1,wec) -> model(skf30(x0),x0) 893.83/179.68 65:4:4:INP:TopTopTopTop: ren4(x0,x1,x2),ren5(skf31(x2,x1),x2,x1),model(x3,x2) -> status(x2,x1,wec) 893.83/179.68 66:3:3:INP:TopTopTop: model(x0,x1) -> model(skf32(x2),x2),status(x2,x1,sca) 893.83/179.68 67:2:3:INP:TopTopTop: status(x0,x1,sca),model(x2,x0) -> 893.83/179.68 68:2:2:INP:TopTop: status(x0,x1,sca) -> model(skf33(x1),x1) 893.83/179.68 69:2:3:INP:TopTopTop: ren6(x0,x1,x2) -> model(x0,x1) 893.83/179.68 70:2:3:INP:TopTopTop: ren6(x0,x1,x2) -> model(x0,x2) 893.83/179.68 71:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> ren6(x0,x1,x2) 893.83/179.68 72:2:3:INP:TopTopTop: ren7(x0,x1,x2) -> model(x0,not(x1)) 893.83/179.68 73:2:3:INP:TopTopTop: ren7(x0,x1,x2) -> model(x0,x2) 893.83/179.68 74:3:3:INP:TopTopTop: model(x0,not(x1)),model(x0,x2) -> ren7(x0,x1,x2) 893.83/179.68 75:2:2:INP:TopTop: status(x0,x1,noc) -> ren6(skf34(x0,x1),x1,x0) 893.83/179.68 76:2:2:INP:TopTop: status(x0,x1,noc) -> ren7(skf35(x0,x1),x1,x0) 893.83/179.68 77:3:4:INP:TopTopTopTop: ren6(x0,x1,x2),ren7(x3,x1,x2) -> status(x2,x1,noc) 893.83/179.68 78:3:3:INP:TopTopTop: ren8(x0,x1),model(x2,x0) -> model(skf36(x1),x1) 893.83/179.68 79:3:3:INP:TopTopTop: ren8(x0,x1),model(x2,x1) -> model(skf37(x0),x0) 893.83/179.68 80:3:4:INP:TopTopTopTop: model(x0,x1),model(x2,x3) -> ren8(x1,x3) 893.83/179.68 81:3:2:INP:TopTop: -> model(skf38(x0),x0),model(skf39(x1),x1),ren8(x0,x1) 893.83/179.68 82:2:2:INP:TopTop: status(x0,x1,esa) -> ren8(x0,x1) 893.83/179.68 83:2:2:INP:TopTop: ren8(x0,x1) -> status(x0,x1,esa) 893.83/179.68 84:3:3:INP:TopTopTop: ren9(x0,x1,x2),model(x0,x1) -> model(x0,x2) 893.83/179.68 85:3:3:INP:TopTopTop: ren9(x0,x1,x2),model(x0,x2) -> model(x0,x1) 893.83/179.68 86:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> ren9(x0,x1,x2) 893.83/179.68 87:3:3:INP:TopTopTop: -> model(x0,x1),model(x0,x2),ren9(x0,x1,x2) 893.83/179.68 88:4:4:INP:TopTopTopTop: ren9(skf40(x0,x1),x1,x0),model(x2,x0) -> model(x3,x0),status(x0,x1,eth) 893.83/179.68 89:2:2:INP:TopTop: status(x0,x1,eth),model(skf41(x0),x0) -> 893.83/179.68 90:2:3:INP:TopTopTop: status(x0,x1,eth) -> ren9(x2,x1,x0) 893.83/179.68 91:2:2:INP:TopTop: status(x0,x1,eth) -> model(skf42(x0),x0) 893.83/179.68 92:3:4:INP:TopTopTopTop: nevera(x0,x1),status(x2,x3,x0),status(x2,x3,x1) -> 893.83/179.68 93:2:2:INP:TopTop: -> status(skf43(x0,x1),skf44(x0,x1),x0),nevera(x0,x1) 893.83/179.68 94:2:2:INP:TopTop: -> status(skf43(x0,x1),skf44(x0,x1),x1),nevera(x0,x1) 893.83/179.68 95:1:1:INP:Top: model(x0,skc45) -> 893.83/179.68 96:1:0:INP:: -> model(skc48,skc46) 893.83/179.68 97:1:0:INP:: model(skc49,skc47) -> 893.83/179.68 98:1:0:INP:: model(skc50,skc46) -> 893.83/179.68 99:1:0:INP:: -> model(skc50,skc47) 893.83/179.68 100:2:1:INP:Top: model(x0,skc46) -> model(x0,skc47) 893.83/179.68 101:2:2:INP:TopTop: nota(x0,x1),status(skf51(x0,x1),skf52(x0,x1),x1) -> 893.83/179.68 102:2:2:INP:TopTop: nota(x0,x1) -> status(skf51(x0,x1),skf52(x0,x1),x0) 893.83/179.68 103:3:4:INP:TopTopTopTop: status(x0,x1,x2) -> status(x0,x1,x3),nota(x2,x3) 893.83/179.68 104:1:0:INP:: model(skc54,skc53) -> 893.83/179.68 105:1:0:INP:: -> model(skc55,skc53) 893.83/179.68 106:3:4:INP:TopTopTopTop: status(x0,x1,x2),status(x0,x1,x3) -> mighta(x2,x3) 893.83/179.68 107:2:2:INP:TopTop: mighta(x0,x1) -> status(skf56(x0,x1),skf57(x0,x1),x0) 893.83/179.68 108:2:2:INP:TopTop: mighta(x0,x1) -> status(skf56(x0,x1),skf57(x0,x1),x1) 893.83/179.68 109:1:0:INP:: model(skc58,skc60) -> 893.83/179.68 110:1:0:INP:: -> model(skc61,skc60) 893.83/179.68 111:1:0:INP:: -> model(skc58,skc59) 893.83/179.68 112:1:1:INP:Top: -> model(x0,skc62) 893.83/179.68 129:1:0:INP:: mighta(eqv,thm) -> 893.83/179.68 128:2:2:INP:TopTop: -> model(x0,x1),model(x0,not(x1)) 893.83/179.68 115:3:4:INP:TopTopTopTop: isa(x0,x1),status(x2,x3,x0) -> status(x2,x3,x1) 893.83/179.68 116:2:2:INP:TopTop: -> status(skf63(x0,x1),skf64(x0,x1),x0),isa(x0,x1) 893.83/179.68 117:2:2:INP:TopTop: status(skf63(x0,x1),skf64(x0,x1),x1) -> isa(x0,x1) 893.83/179.68 118:3:4:INP:TopTopTopTop: ren10(x0,x1,x2,x3),status(x0,x1,x2) -> status(x0,x1,x3) 893.83/179.68 119:3:4:INP:TopTopTopTop: ren10(x0,x1,x2,x3),status(x0,x1,x3) -> status(x0,x1,x2) 893.83/179.68 120:3:4:INP:TopTopTopTop: status(x0,x1,x2),status(x0,x1,x3) -> ren10(x0,x1,x2,x3) 893.83/179.68 121:3:4:INP:TopTopTopTop: -> status(x0,x1,x2),status(x0,x1,x3),ren10(x0,x1,x2,x3) 893.83/179.68 122:2:2:INP:TopTop: -> ren10(skf65(x0,x1),skf66(x0,x1),x0,x1),xora(x0,x1) 893.83/179.68 123:2:4:INP:TopTopTopTop: xora(x0,x1),ren10(x2,x3,x0,x1) -> 893.83/179.68 124:2:0:INP:: model(skc69,skc68),model(skc70,skc67) -> 893.83/179.68 125:1:0:INP:: -> model(skc71,skc67) 893.83/179.68 126:1:0:INP:: -> model(skc71,skc68) 893.83/179.68 127:2:2:INP:TopTop: model(x0,x1),model(x0,not(x1)) -> 893.83/179.68 893.83/179.68 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) 893.83/179.68 893.83/179.68 === Starting SPASS-SCL-FOL A Little Less Naive, considering 109 atoms initially, heuristics mode: resolution_2 === 893.83/179.68 893.83/179.68 === Conflict found: 8:2:2:INP:TopTop: -> model(skf6(x0,x1),x0),status(x0,x1,thm) {x0 -> sap, x1 -> sap} 893.83/179.68 === Backtracking. Learning clause 130:2:2:[8.1,9.1,106.2]:TopTop: status(x0,x0,x1) -> mighta(x1,thm) 893.83/179.68 === Conflict found: 101:2:2:INP:TopTop: nota(x0,x1),status(skf51(x0,x1),skf52(x0,x1),x1) -> {x0 -> sap, x1 -> sap} 893.83/179.68 === Backtracking. Learning clause 131:1:1:[101.2,102.2]:Top: nota(x0,x0) -> 893.83/179.68 === Conflict found: 9:2:2:INP:TopTop: model(skf6(x0,x1),x1) -> status(x0,x1,thm) {x0 -> sap, x1 -> sap} 893.83/179.68 === Backtracking. Learning clause 132:1:1:[9.1,8.1]:Top: -> status(x0,x0,thm) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 142 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 30:2:3:INP:TopTopTop: status(x0,x1,tau) -> model(x2,x0) {x0 -> sap, x1 -> skc45, x2 -> skf1(skc45)} 893.83/179.68 === Backtracking. Learning clause 133:2:3:[30.2,2.1]:TopTopTop: status(x0,x1,tau) -> status(x2,x0,sap) 893.83/179.68 === Conflict found: 14:2:3:INP:TopTopTop: ren1(x0,x1,x2) -> model(x0,x2) {x0 -> skf1(skc45), x1 -> sap, x2 -> skc45} 893.83/179.68 === Backtracking. Learning clause 134:1:2:[14.2,95.1]:TopTop: ren1(x0,x1,skc45) -> 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 187 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 65:4:4:INP:TopTopTopTop: ren4(x0,x1,x2),ren5(skf31(x2,x1),x2,x1),model(x3,x2) -> status(x2,x1,wec) {x0 -> skc48, x1 -> sap, x2 -> skc46, x3 -> skc48} 893.83/179.68 === Backtracking. Learning clause 135:3:2:[65.3,96.1]:TopTop: ren4(x0,x1,skc46),ren5(skf31(skc46,x1),skc46,x1) -> status(skc46,x1,wec) 893.83/179.68 === Conflict found: 55:4:4:INP:TopTopTopTop: model(skf28(x0),x0),model(x1,x2) -> model(x3,x2),status(x2,x0,wtc) {x0 -> sap, x1 -> skc48, x2 -> skc46, x3 -> sap} 893.83/179.68 === Backtracking. Learning clause 136:3:2:[55.2,96.1]:TopTop: model(skf28(x0),x0) -> model(x1,skc46),status(skc46,x0,wtc) 893.83/179.68 === Conflict found: 42:3:3:INP:TopTopTop: model(x0,x1),ren3(skf20(x1,x2),x2,x1) -> status(x1,x2,eqv) {x0 -> skc48, x1 -> skc46, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 137:2:1:[42.1,96.1]:Top: ren3(skf20(skc46,x0),x0,skc46) -> status(skc46,x0,eqv) 893.83/179.68 === Conflict found: 35:3:3:INP:TopTopTop: model(skf18(x0),x0),model(x1,x2) -> status(x2,x0,tac) {x0 -> sap, x1 -> skc48, x2 -> skc46} 893.83/179.68 === Backtracking. Learning clause 138:2:1:[35.2,96.1]:Top: model(skf18(x0),x0) -> status(skc46,x0,tac) 893.83/179.68 === Conflict found: 67:2:3:INP:TopTopTop: status(x0,x1,sca),model(x2,x0) -> {x0 -> skc46, x1 -> sap, x2 -> skc48} 893.83/179.68 === Backtracking. Learning clause 139:1:1:[67.2,96.1]:Top: status(skc46,x0,sca) -> 893.83/179.68 === Conflict found: 17:2:3:INP:TopTopTop: -> model(x0,x1),ren2(x0,x1,x2) {x0 -> sap, x1 -> sap, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 140:2:4:[17.1,18.1]:TopTopTopTop: -> ren2(x0,x1,x2),ren2(x0,x3,x1) 893.83/179.68 === Conflict found: 116:2:2:INP:TopTop: -> status(skf63(x0,x1),skf64(x0,x1),x0),isa(x0,x1) {x0 -> sap, x1 -> sap} 893.83/179.68 === Backtracking. Learning clause 141:1:1:[116.1,117.1]:Top: -> isa(x0,x0) 893.83/179.68 === Conflict found: 87:3:3:INP:TopTopTop: -> model(x0,x1),model(x0,x2),ren9(x0,x1,x2) {x0 -> sap, x1 -> sap, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 142:1:2:[87.1,86.1]:TopTop: -> ren9(x0,x1,x1) 893.83/179.68 === Conflict found: 127:2:2:INP:TopTop: model(x0,x1),model(x0,not(x1)) -> {x0 -> skf12(sap,sap), x1 -> sap} 893.83/179.68 === Backtracking. Learning clause 143:1:1:[127.2,26.2,25.2]:Top: status(x0,x0,csa) -> 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 219 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 30:2:3:INP:TopTopTop: status(x0,x1,tau) -> model(x2,x0) {x0 -> sap, x1 -> skc47, x2 -> skc49} 893.83/179.68 === Backtracking. Learning clause 144:2:3:[30.2,28.2]:TopTopTop: status(x0,x1,tau),status(x0,x2,tca) -> 893.83/179.68 === Conflict found: 29:2:3:INP:TopTopTop: status(x0,x1,tca) -> model(x2,x1) {x0 -> sap, x1 -> skc47, x2 -> skc49} 893.83/179.68 === Backtracking. Learning clause 145:1:1:[29.2,97.1]:Top: status(x0,skc47,tca) -> 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 246 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 61:2:3:INP:TopTopTop: model(x0,x1) -> ren5(x0,x2,x1) {x0 -> skc50, x1 -> sap, x2 -> skc46} 893.83/179.68 === Backtracking. Learning clause 146:2:4:[61.1,30.2]:TopTopTopTop: status(x0,x1,tau) -> ren5(x2,x3,x0) 893.83/179.68 === Conflict found: 31:2:3:INP:TopTopTop: status(x0,x1,tau) -> model(x2,x1) {x0 -> sap, x1 -> skc46, x2 -> skc50} 893.83/179.68 === Backtracking. Learning clause 147:1:1:[31.2,98.1]:Top: status(x0,skc46,tau) -> 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 310 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 349 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 65:4:4:INP:TopTopTopTop: ren4(x0,x1,x2),ren5(skf31(x2,x1),x2,x1),model(x3,x2) -> status(x2,x1,wec) {x0 -> skc50, x1 -> sap, x2 -> skc47, x3 -> skc50} 893.83/179.68 === Backtracking. Learning clause 148:3:2:[65.3,99.1]:TopTop: ren4(x0,x1,skc47),ren5(skf31(skc47,x1),skc47,x1) -> status(skc47,x1,wec) 893.83/179.68 === Conflict found: 55:4:4:INP:TopTopTopTop: model(skf28(x0),x0),model(x1,x2) -> model(x3,x2),status(x2,x0,wtc) {x0 -> sap, x1 -> skc50, x2 -> skc47, x3 -> sap} 893.83/179.68 === Backtracking. Learning clause 149:3:3:[55.2,99.1,53.1]:TopTopTop: model(skf28(x0),x0) -> model(x1,skc47),model(x2,x0) 893.83/179.68 === Conflict found: 79:3:3:INP:TopTopTop: ren8(x0,x1),model(x2,x1) -> model(skf37(x0),x0) {x0 -> sap, x1 -> skc47, x2 -> skc50} 893.83/179.68 === Backtracking. Learning clause 150:2:1:[79.2,99.1]:Top: ren8(x0,skc47) -> model(skf37(x0),x0) 893.83/179.68 === Conflict found: 78:3:3:INP:TopTopTop: ren8(x0,x1),model(x2,x0) -> model(skf36(x1),x1) {x0 -> skc47, x1 -> sap, x2 -> skc50} 893.83/179.68 === Backtracking. Learning clause 151:2:1:[78.2,99.1]:Top: ren8(skc47,x0) -> model(skf36(x0),x0) 893.83/179.68 === Conflict found: 66:3:3:INP:TopTopTop: model(x0,x1) -> model(skf32(x2),x2),status(x2,x1,sca) {x0 -> skc50, x1 -> skc47, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 152:2:2:[66.1,99.1,67.1]:TopTop: model(x0,x1) -> model(skf32(x1),x1) 893.83/179.68 === Conflict found: 57:2:3:INP:TopTopTop: ren4(x0,x1,x2),model(x0,x2) -> {x0 -> skc50, x1 -> sap, x2 -> skc47} 893.83/179.68 === Backtracking. Learning clause 153:1:1:[57.2,99.1]:Top: ren4(skc50,x0,skc47) -> 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 382 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 69:2:3:INP:TopTopTop: ren6(x0,x1,x2) -> model(x0,x1) {x0 -> skc54, x1 -> sap, x2 -> skc53} 893.83/179.68 === Backtracking. Learning clause 154:2:4:[69.2,57.2]:TopTopTopTop: ren6(x0,x1,x2),ren4(x0,x3,x1) -> 893.83/179.68 === Conflict found: 56:2:3:INP:TopTopTop: ren4(x0,x1,x2) -> model(x0,x1) {x0 -> skc54, x1 -> skc53, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 155:1:1:[56.2,104.1]:Top: ren4(skc54,skc53,x0) -> 893.83/179.68 === Conflict found: 56:2:3:INP:TopTopTop: ren4(x0,x1,x2) -> model(x0,x1) {x0 -> sap, x1 -> sap, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 156:2:4:[56.2,57.2]:TopTopTopTop: ren4(x0,x1,x2),ren4(x0,x3,x1) -> 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 423 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 65:4:4:INP:TopTopTopTop: ren4(x0,x1,x2),ren5(skf31(x2,x1),x2,x1),model(x3,x2) -> status(x2,x1,wec) {x0 -> skc55, x1 -> sap, x2 -> skc53, x3 -> skc55} 893.83/179.68 === Backtracking. Learning clause 157:3:2:[65.3,105.1]:TopTop: ren4(x0,x1,skc53),ren5(skf31(skc53,x1),skc53,x1) -> status(skc53,x1,wec) 893.83/179.68 === Conflict found: 55:4:4:INP:TopTopTopTop: model(skf28(x0),x0),model(x1,x2) -> model(x3,x2),status(x2,x0,wtc) {x0 -> sap, x1 -> skc55, x2 -> skc53, x3 -> skf32(skc53)} 893.83/179.68 === Backtracking. Learning clause 158:3:3:[55.2,105.1,53.1]:TopTopTop: model(skf28(x0),x0) -> model(x1,skc53),model(x2,x0) 893.83/179.68 === Conflict found: 50:2:3:INP:TopTopTop: model(x0,x1) -> status(x1,x2,unp) {x0 -> skc55, x1 -> skc53, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 159:1:1:[50.1,105.1]:Top: -> status(skc53,x0,unp) 893.83/179.68 === Conflict found: 24:3:3:INP:TopTopTop: model(x0,x1),model(x0,not(x2)) -> status(x1,x2,csa) {x0 -> skc55, x1 -> sap, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 160:4:4:[24.1,158.3]:TopTopTopTop: model(x0,not(x1)),model(skf28(x2),x2) -> status(x2,x1,csa),model(x3,skc53) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 456 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 69:2:3:INP:TopTopTop: ren6(x0,x1,x2) -> model(x0,x1) {x0 -> skc58, x1 -> sap, x2 -> skc60} 893.83/179.68 === Backtracking. Learning clause 161:2:4:[69.2,61.1]:TopTopTopTop: ren6(x0,x1,x2) -> ren5(x0,x3,x1) 893.83/179.68 === Conflict found: 60:2:3:INP:TopTopTop: -> model(x0,x1),ren5(x0,x1,x2) {x0 -> skc58, x1 -> skc60, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 162:1:1:[60.1,109.1]:Top: -> ren5(skc58,skc60,x0) 893.83/179.68 === 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} 893.83/179.68 === Backtracking. Learning clause 163:2:2:[120.3,123.2,2.2,122.2]:TopTop: model(x0,x1) -> ren10(skf65(sap,sap),skf66(sap,sap),sap,sap) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 520 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 561 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 65:4:4:INP:TopTopTopTop: ren4(x0,x1,x2),ren5(skf31(x2,x1),x2,x1),model(x3,x2) -> status(x2,x1,wec) {x0 -> skc61, x1 -> sap, x2 -> skc60, x3 -> skc61} 893.83/179.68 === Backtracking. Learning clause 164:3:2:[65.3,110.1]:TopTop: ren4(x0,x1,skc60),ren5(skf31(skc60,x1),skc60,x1) -> status(skc60,x1,wec) 893.83/179.68 === Conflict found: 55:4:4:INP:TopTopTopTop: model(skf28(x0),x0),model(x1,x2) -> model(x3,x2),status(x2,x0,wtc) {x0 -> sap, x1 -> skc61, x2 -> skc60, x3 -> skf32(skc60)} 893.83/179.68 === Backtracking. Learning clause 165:3:3:[55.2,110.1,53.1]:TopTopTop: model(skf28(x0),x0) -> model(x1,skc60),model(x2,x0) 893.83/179.68 === Conflict found: 13:2:3:INP:TopTopTop: ren1(x0,x1,x2),model(x0,x1) -> {x0 -> skc61, x1 -> skc60, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 166:1:1:[13.2,110.1]:Top: ren1(skc61,skc60,x0) -> 893.83/179.68 === Conflict found: 59:3:3:INP:TopTopTop: ren5(x0,x1,x2),model(x0,x1) -> model(x0,x2) {x0 -> sap, x1 -> sap, x2 -> thm} 893.83/179.68 === Backtracking. Learning clause 167:4:4:[59.3,86.2]:TopTopTopTop: ren5(x0,x1,x2),model(x0,x1),model(x0,x3) -> ren9(x0,x3,x2) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 607 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 65:4:4:INP:TopTopTopTop: ren4(x0,x1,x2),ren5(skf31(x2,x1),x2,x1),model(x3,x2) -> status(x2,x1,wec) {x0 -> sap, x1 -> sap, x2 -> skc59, x3 -> skc58} 893.83/179.68 === Backtracking. Learning clause 168:3:2:[65.3,111.1]:TopTop: ren4(x0,x1,skc59),ren5(skf31(skc59,x1),skc59,x1) -> status(skc59,x1,wec) 893.83/179.68 === Conflict found: 55:4:4:INP:TopTopTopTop: model(skf28(x0),x0),model(x1,x2) -> model(x3,x2),status(x2,x0,wtc) {x0 -> sap, x1 -> skc58, x2 -> skc59, x3 -> skf32(skc59)} 893.83/179.68 === Backtracking. Learning clause 169:3:3:[55.2,111.1,53.1]:TopTopTop: model(skf28(x0),x0) -> model(x1,skc59),model(x2,x0) 893.83/179.68 === Conflict found: 12:2:3:INP:TopTopTop: status(x0,x1,cax),model(x2,x0) -> {x0 -> skc59, x1 -> sap, x2 -> skc58} 893.83/179.68 === Backtracking. Learning clause 170:1:1:[12.2,111.1]:Top: status(skc59,x0,cax) -> 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 654 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 6:2:3:INP:TopTopTop: status(x0,x1,wca),model(x2,x0) -> {x0 -> skc62, x1 -> sap, x2 -> skf32(skc62)} 893.83/179.68 === Backtracking. Learning clause 171:1:1:[6.2,112.1]:Top: status(skc62,x0,wca) -> 893.83/179.68 === Conflict found: 13:2:3:INP:TopTopTop: ren1(x0,x1,x2),model(x0,x1) -> {x0 -> skc61, x1 -> sap, x2 -> skc60} 893.83/179.68 === Backtracking. Learning clause 172:3:4:[13.2,165.3]:TopTopTopTop: ren1(x0,x1,x2),model(skf28(x1),x1) -> model(x3,skc60) 893.83/179.68 === Conflict found: 45:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> status(x1,x2,sat) {x0 -> skc48, x1 -> skc46, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 173:4:4:[45.2,165.3]:TopTopTopTop: model(x0,x1),model(skf28(x2),x2) -> status(x1,x2,sat),model(x3,skc60) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 698 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 65:4:4:INP:TopTopTopTop: ren4(x0,x1,x2),ren5(skf31(x2,x1),x2,x1),model(x3,x2) -> status(x2,x1,wec) {x0 -> sap, x1 -> sap, x2 -> skc67, x3 -> skc71} 893.83/179.68 === Backtracking. Learning clause 174:3:2:[65.3,125.1]:TopTop: ren4(x0,x1,skc67),ren5(skf31(skc67,x1),skc67,x1) -> status(skc67,x1,wec) 893.83/179.68 === Conflict found: 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) {x0 -> skc71, x1 -> skc67, x2 -> sap, x3 -> sap, x4 -> skf37(sap)} 893.83/179.68 === Backtracking. Learning clause 175:4:3:[19.1,125.1]:TopTopTop: ren1(x0,skc67,x1),ren2(skf8(skc67,x1),skc67,x1) -> model(x2,x1),status(skc67,x1,wth) 893.83/179.68 === Conflict found: 88:4:4:INP:TopTopTopTop: ren9(skf40(x0,x1),x1,x0),model(x2,x0) -> model(x3,x0),status(x0,x1,eth) {x0 -> skc67, x1 -> sap, x2 -> skc71, x3 -> skf32(skc67)} 893.83/179.68 === Backtracking. Learning clause 176:3:2:[88.2,125.1]:TopTop: ren9(skf40(skc67,x0),x0,skc67) -> model(x1,skc67),status(skc67,x0,eth) 893.83/179.68 === Conflict found: 7:4:4:INP:TopTopTopTop: model(x0,x1) -> model(x2,x1),model(skf5(x3),x3),status(x3,x1,wca) {x0 -> skc71, x1 -> skc67, x2 -> skf32(skc67), x3 -> sap} 893.83/179.68 === Backtracking. Learning clause 177:3:3:[7.1,125.1,6.1]:TopTopTop: model(x0,x1) -> model(x2,skc67),model(skf5(x1),x1) 893.83/179.68 === Conflict found: 152:2:2:[66.1,99.1,67.1]:TopTop: model(x0,x1) -> model(skf32(x1),x1) {x0 -> skc71, x1 -> skc67} 893.83/179.68 === Backtracking. Learning clause 178:1:0:[152.1,125.1]:: -> model(skf32(skc67),skc67) 893.83/179.68 === Conflict found: 35:3:3:INP:TopTopTop: model(skf18(x0),x0),model(x1,x2) -> status(x2,x0,tac) {x0 -> sap, x1 -> sap, x2 -> skc62} 893.83/179.68 === Backtracking. Learning clause 179:3:2:[35.1,165.3,112.1]:TopTop: model(skf28(x0),x0) -> status(skc62,x0,tac),model(x1,skc60) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 762 893.83/179.68 === Conflict found: 78:3:3:INP:TopTopTop: ren8(x0,x1),model(x2,x0) -> model(skf36(x1),x1) {x0 -> sap, x1 -> wca, x2 -> skc71} 893.83/179.68 === Backtracking. Learning clause 180:3:4:[78.3,2.1,82.2]:TopTopTopTop: model(x0,x1),status(x1,x2,esa) -> status(x3,x2,sap) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 808 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 2:2:3:INP:TopTopTop: model(x0,x1) -> status(x2,x1,sap) {x0 -> sap, x1 -> sap, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 181:2:2:[2.2,3.1]:TopTop: model(x0,x1) -> model(skf2(x1),x1) 893.83/179.68 === Conflict found: 127:2:2:INP:TopTop: model(x0,x1),model(x0,not(x1)) -> {x0 -> skc71, x1 -> skc68} 893.83/179.68 === Backtracking. Learning clause 182:1:0:[127.1,126.1]:: model(skc71,not(skc68)) -> 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 808 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 130:2:2:[8.1,9.1,106.2]:TopTop: status(x0,x0,x1) -> mighta(x1,thm) {x0 -> sap, x1 -> eqv} 893.83/179.68 === Backtracking. Learning clause 183:1:1:[130.2,129.1]:Top: status(x0,x0,eqv) -> 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 808 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 59:3:3:INP:TopTopTop: ren5(x0,x1,x2),model(x0,x1) -> model(x0,x2) {x0 -> skc50, x1 -> skc47, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 184:4:4:[59.3,45.2]:TopTopTopTop: ren5(x0,x1,x2),model(x0,x1),model(x0,x3) -> status(x3,x2,sat) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 813 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 106:3:4:INP:TopTopTopTop: status(x0,x1,x2),status(x0,x1,x3) -> mighta(x2,x3) {x0 -> sap, x1 -> sap, x2 -> thm, x3 -> sap} 893.83/179.68 === Backtracking. Learning clause 185:2:2:[106.1,132.1]:TopTop: status(x0,x0,x1) -> mighta(thm,x1) 893.83/179.68 === Conflict found: 185:2:2:[106.1,132.1]:TopTop: status(x0,x0,x1) -> mighta(thm,x1) {x0 -> sap, x1 -> thm} 893.83/179.68 === Backtracking. Learning clause 186:1:0:[185.1,132.1]:: -> mighta(thm,thm) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 877 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 880 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 21:2:2:INP:TopTop: status(x0,x1,wth) -> ren1(skf10(x0,x1),x0,x1) {x0 -> sap, x1 -> skc45} 893.83/179.68 === Backtracking. Learning clause 187:1:1:[21.2,134.1]:Top: status(x0,skc45,wth) -> 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 884 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 103:3:4:INP:TopTopTopTop: status(x0,x1,x2) -> status(x0,x1,x3),nota(x2,x3) {x0 -> skc46, x1 -> sap, x2 -> sap, x3 -> sca} 893.83/179.68 === Backtracking. Learning clause 188:2:2:[103.2,139.1]:TopTop: status(skc46,x0,x1) -> nota(x1,sca) 893.83/179.68 === Conflict found: 66:3:3:INP:TopTopTop: model(x0,x1) -> model(skf32(x2),x2),status(x2,x1,sca) {x0 -> sap, x1 -> sap, x2 -> skc46} 893.83/179.68 === Backtracking. Learning clause 189:2:2:[66.3,139.1]:TopTop: model(x0,x1) -> model(skf32(skc46),skc46) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 884 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 14:2:3:INP:TopTopTop: ren1(x0,x1,x2) -> model(x0,x2) {x0 -> sap, x1 -> sap, x2 -> wca} 893.83/179.68 === Backtracking. Learning clause 190:3:4:[14.2,74.2]:TopTopTopTop: ren1(x0,x1,x2),model(x0,not(x3)) -> ren7(x0,x3,x2) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 887 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 176:3:2:[88.2,125.1]:TopTop: ren9(skf40(skc67,x0),x0,skc67) -> model(x1,skc67),status(skc67,x0,eth) {x0 -> skc67, x1 -> sap} 893.83/179.68 === Backtracking. Learning clause 191:2:1:[176.1,142.1]:Top: -> model(x0,skc67),status(skc67,skc67,eth) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 951 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 955 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 119:3:4:INP:TopTopTopTop: ren10(x0,x1,x2,x3),status(x0,x1,x3) -> status(x0,x1,x2) {x0 -> sap, x1 -> sap, x2 -> csa, x3 -> sap} 893.83/179.68 === Backtracking. Learning clause 192:2:2:[119.3,143.1]:TopTop: ren10(x0,x0,csa,x1),status(x0,x0,x1) -> 893.83/179.68 === Conflict found: 115:3:4:INP:TopTopTopTop: isa(x0,x1),status(x2,x3,x0) -> status(x2,x3,x1) {x0 -> sap, x1 -> csa, x2 -> sap, x3 -> sap} 893.83/179.68 === Backtracking. Learning clause 193:2:2:[115.3,143.1,2.2]:TopTop: isa(sap,csa),model(x0,x1) -> 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 960 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 115:3:4:INP:TopTopTopTop: isa(x0,x1),status(x2,x3,x0) -> status(x2,x3,x1) {x0 -> sap, x1 -> tca, x2 -> sap, x3 -> skc47} 893.83/179.68 === Backtracking. Learning clause 194:2:2:[115.3,145.1]:TopTop: isa(x0,tca),status(x1,skc47,x0) -> 893.83/179.68 === Conflict found: 118:3:4:INP:TopTopTopTop: ren10(x0,x1,x2,x3),status(x0,x1,x2) -> status(x0,x1,x3) {x0 -> sap, x1 -> skc47, x2 -> sap, x3 -> tca} 893.83/179.68 === Backtracking. Learning clause 195:2:2:[118.3,145.1,2.2]:TopTop: ren10(x0,skc47,sap,tca),model(x1,skc47) -> 893.83/179.68 === Conflict found: 71:3:3:INP:TopTopTop: model(x0,x1),model(x0,x2) -> ren6(x0,x1,x2) {x0 -> skf4(skc62), x1 -> skc62, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 196:1:2:[71.1,112.1,60.1,161.1]:TopTop: -> ren5(x0,x1,skc62) 893.83/179.68 === Conflict found: 41:2:3:INP:TopTopTop: status(x0,x1,eqv) -> ren3(x2,x1,x0) {x0 -> skc59, x1 -> sap, x2 -> skc58} 893.83/179.68 === Backtracking. Learning clause 197:3:3:[41.2,37.1]:TopTopTop: status(x0,x1,eqv),model(x2,x0) -> model(x2,x1) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 965 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 103:3:4:INP:TopTopTopTop: status(x0,x1,x2) -> status(x0,x1,x3),nota(x2,x3) {x0 -> sap, x1 -> skc46, x2 -> sap, x3 -> tau} 893.83/179.68 === Backtracking. Learning clause 198:2:2:[103.2,147.1]:TopTop: status(x0,skc46,x1) -> nota(x1,tau) 893.83/179.68 === Conflict found: 32:3:2:INP:TopTop: model(skf15(x0),x0),model(skf16(x1),x1) -> status(x0,x1,tau) {x0 -> sap, x1 -> skc46} 893.83/179.68 === Backtracking. Learning clause 199:2:1:[32.3,147.1]:Top: model(skf15(x0),x0),model(skf16(skc46),skc46) -> 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 965 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 128:2:2:INP:TopTop: -> model(x0,x1),model(x0,not(x1)) {x0 -> sap, x1 -> sap} 893.83/179.68 === Backtracking. Learning clause 200:3:3:[128.1,59.2]:TopTopTop: ren5(x0,x1,x2) -> model(x0,not(x1)),model(x0,x2) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 1029 893.83/179.68 === Conflict found: 22:2:2:INP:TopTop: status(x0,x1,wth),model(skf11(x1),x1) -> {x0 -> sap, x1 -> thm} 893.83/179.68 === Backtracking. Learning clause 201:2:3:[22.2,33.2]:TopTopTop: status(x0,x1,wth),status(x2,x1,tac) -> 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 1029 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 58:3:3:INP:TopTopTop: model(x0,x1) -> model(x0,x2),ren4(x0,x1,x2) {x0 -> skc55, x1 -> skc53, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 202:3:4:[58.2,2.1]:TopTopTopTop: model(x0,x1) -> ren4(x0,x1,x2),status(x3,x2,sap) 893.83/179.68 === Conflict found: 7:4:4:INP:TopTopTopTop: model(x0,x1) -> model(x2,x1),model(skf5(x3),x3),status(x3,x1,wca) {x0 -> skf1(sap), x1 -> sap, x2 -> skf22(sap), x3 -> sap} 893.83/179.68 === Backtracking. Learning clause 203:2:3:[7.1,1.1,2.1,4.1,2.1,2.1]:TopTopTop: -> status(x0,x1,sap),status(x2,x0,sap) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 1041 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 185:2:2:[106.1,132.1]:TopTop: status(x0,x0,x1) -> mighta(thm,x1) {x0 -> skc53, x1 -> unp} 893.83/179.68 === Backtracking. Learning clause 204:1:0:[185.1,159.1]:: -> mighta(thm,unp) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 1041 893.83/179.68 === Restarting. 893.83/179.68 === 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} 893.83/179.68 === Backtracking. Learning clause 205:1:1:[120.1,203.1]:Top: -> ren10(x0,x0,sap,sap) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 1041 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 115:3:4:INP:TopTopTopTop: isa(x0,x1),status(x2,x3,x0) -> status(x2,x3,x1) {x0 -> sap, x1 -> wca, x2 -> skc62, x3 -> sap} 893.83/179.68 === Backtracking. Learning clause 206:3:4:[115.2,2.2]:TopTopTopTop: isa(sap,x0),model(x1,x2) -> status(x3,x2,x0) 893.83/179.68 === Conflict found: 39:3:3:INP:TopTopTop: -> model(x0,x1),model(x0,x2),ren3(x0,x1,x2) {x0 -> sap, x1 -> skc67, x2 -> skc67} 893.83/179.68 === Backtracking. Learning clause 207:1:2:[39.1,38.1]:TopTop: -> ren3(x0,x1,x1) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 1105 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 1110 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 121:3:4:INP:TopTopTopTop: -> status(x0,x1,x2),status(x0,x1,x3),ren10(x0,x1,x2,x3) {x0 -> skc59, x1 -> sap, x2 -> cax, x3 -> sap} 893.83/179.68 === Backtracking. Learning clause 208:2:2:[121.1,170.1]:TopTop: -> status(skc59,x0,x1),ren10(skc59,x0,cax,x1) 893.83/179.68 === Conflict found: 11:2:2:INP:TopTop: -> model(skf7(x0),x0),status(x0,x1,cax) {x0 -> skc59, x1 -> sap} 893.83/179.68 === Backtracking. Learning clause 209:1:0:[11.2,170.1]:: -> model(skf7(skc59),skc59) 893.83/179.68 === Conflict found: 85:3:3:INP:TopTopTop: ren9(x0,x1,x2),model(x0,x2) -> model(x0,x1) {x0 -> skc71, x1 -> sap, x2 -> skc67} 893.83/179.68 === Backtracking. Learning clause 210:3:4:[85.3,6.2]:TopTopTopTop: ren9(x0,x1,x2),model(x0,x2),status(x1,x3,wca) -> 893.83/179.68 === Conflict found: 5:2:2:INP:TopTop: status(x0,x1,wca),model(skf4(x1),x1) -> {x0 -> sap, x1 -> cax} 893.83/179.68 === Backtracking. Learning clause 211:3:3:[5.1,7.4]:TopTopTop: model(skf4(x0),x0) -> model(x1,x0),model(skf5(x2),x2) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 1113 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 121:3:4:INP:TopTopTopTop: -> status(x0,x1,x2),status(x0,x1,x3),ren10(x0,x1,x2,x3) {x0 -> skc62, x1 -> sap, x2 -> sap, x3 -> wca} 893.83/179.68 === Backtracking. Learning clause 212:2:2:[121.2,171.1]:TopTop: -> status(skc62,x0,x1),ren10(skc62,x0,x1,wca) 893.83/179.68 === Conflict found: 23:2:3:INP:TopTopTop: status(x0,x1,wth) -> ren2(x2,x0,x1) {x0 -> skc67, x1 -> sap, x2 -> skc71} 893.83/179.68 === Backtracking. Learning clause 213:3:3:[23.2,16.1]:TopTopTop: status(x0,x1,wth),model(x2,x0) -> model(x2,x1) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 1131 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 200:3:3:[128.1,59.2]:TopTopTop: ren5(x0,x1,x2) -> model(x0,not(x1)),model(x0,x2) {x0 -> skf32(skc67), x1 -> skc67, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 215:2:3:[163.0,214.1,200.2,163.1]:TopTopTop: ren5(x0,x1,x2) -> ren10(skf65(sap,sap),skf66(sap,sap),sap,sap) 893.83/179.68 === Conflict found: 163:2:2:[120.3,123.2,2.2,122.2]:TopTop: model(x0,x1) -> ren10(skf65(sap,sap),skf66(sap,sap),sap,sap) {x0 -> skf7(skc59), x1 -> skc59} 893.83/179.68 === Backtracking. Learning clause 216:1:0:[163.1,209.1]:: -> ren10(skf65(sap,sap),skf66(sap,sap),sap,sap) 893.83/179.68 === Conflict found: 42:3:3:INP:TopTopTop: model(x0,x1),ren3(skf20(x1,x2),x2,x1) -> status(x1,x2,eqv) {x0 -> skc49, x1 -> sap, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 218:1:1:[183.0,217.0,42.2,207.1,39.2,97.1]:Top: -> ren3(skc49,skc47,x0) 893.83/179.68 === Clause set with instances from active satisfied. Growing active. New size: 1169 893.83/179.68 === Restarting. 893.83/179.68 === Conflict found: 127:2:2:INP:TopTop: model(x0,x1),model(x0,not(x1)) -> {x0 -> skc71, x1 -> sap} 893.83/179.68 === Backtracking. Learning clause 219:2:3:[127.2,47.2,46.2]:TopTopTop: status(x0,x1,uns),status(x1,x2,uns) -> 893.83/179.68 === Conflict found: 42:3:3:INP:TopTopTop: model(x0,x1),ren3(skf20(x1,x2),x2,x1) -> status(x1,x2,eqv) {x0 -> skf5(sap), x1 -> sap, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 220:4:5:[42.3,183.1,7.3,6.1]:TopTopTopTopTop: ren3(skf20(x0,x0),x0,x0),model(x1,x2),model(x3,x0) -> model(x4,x2) 893.83/179.68 === Conflict found: 4:2:2:INP:TopTop: status(x0,x1,wca) -> model(skf3(x1),x1) {x0 -> sap, x1 -> thm} 893.83/179.68 === Backtracking. Learning clause 221:3:3:[4.1,7.4]:TopTopTop: model(x0,x1) -> model(skf3(x1),x1),model(skf5(x2),x2) 893.83/179.68 === Conflict found: 94:2:2:INP:TopTop: -> status(skf43(x0,x1),skf44(x0,x1),x1),nevera(x0,x1) {x0 -> thm, x1 -> sap} 893.83/179.68 === Backtracking. Learning clause 222:3:4:[94.2,92.1]:TopTopTopTop: status(x0,x1,x2),status(x0,x1,x3) -> status(skf43(x2,x3),skf44(x2,x3),x3) 893.83/179.68 === Conflict found: 42:3:3:INP:TopTopTop: model(x0,x1),ren3(skf20(x1,x2),x2,x1) -> status(x1,x2,eqv) {x0 -> skf5(sap), x1 -> sap, x2 -> sap} 893.83/179.68 === Backtracking. Learning clause 223:1:2:[42.2,207.1,183.1,7.2,6.1]:TopTop: model(x0,x1) -> 893.83/179.68 === Conflict found: 223:1:2:[42.2,207.1,183.1,7.2,6.1]:TopTop: model(x0,x1) -> {x0 -> skf7(skc59), x1 -> skc59} 893.83/179.68 893.83/179.68 SZS status Unsatisfiable 893.83/179.68 893.83/179.68 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 893.83/179.68 893.83/179.68 SPASS-SCL-FOL Statistics: 893.83/179.68 Number of learned clauses: 92 893.83/179.68 Number of propagations: 30699 893.83/179.68 Number of decisions: 4126 893.83/179.68 Number of resolutions: 121 893.83/179.68 Number of condensations: 6 893.83/179.68 Number of sub resolutions: 2 893.83/179.68 Number of input literals (deduplicated): 109 893.83/179.68 Number of grows: 39 893.83/179.68 Number of considered ground atoms: 1169 893.83/179.68 893.83/179.68 Needed: 0:2:59.13 893.83/179.68 893.83/179.69 EOF