%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWC257-1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n014.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 : 600s % DateTime : Tue Jul 19 22:02:52 EDT 2022 % Result : Unsatisfiable 1.69s 1.85s % Output : Refutation 1.69s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SWC257-1 : TPTP v8.1.0. Released v2.4.0. % 0.06/0.12 % Command : run_spass %d %s % 0.12/0.33 % Computer : n014.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 : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sun Jun 12 15:18:37 EDT 2022 % 0.12/0.33 % CPUTime : % 1.69/1.85 % 1.69/1.85 SPASS V 3.9 % 1.69/1.85 SPASS beiseite: Proof found. % 1.69/1.85 % SZS status Theorem % 1.69/1.85 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.69/1.85 SPASS derived 2669 clauses, backtracked 2757 clauses, performed 59 splits and kept 4717 clauses. % 1.69/1.85 SPASS allocated 78218 KBytes. % 1.69/1.85 SPASS spent 0:00:01.48 on the problem. % 1.69/1.85 0:00:00.04 for the input. % 1.69/1.85 0:00:00.00 for the FLOTTER CNF translation. % 1.69/1.85 0:00:00.00 for inferences. % 1.69/1.85 0:00:00.02 for the backtracking. % 1.69/1.85 0:00:01.25 for the reduction. % 1.69/1.85 % 1.69/1.85 % 1.69/1.85 Here is a proof with depth 2, length 58 : % 1.69/1.85 % SZS output start Refutation % 1.69/1.85 1[0:Inp] || -> ssList(sk1)*. % 1.69/1.85 2[0:Inp] || -> ssList(sk2)*. % 1.69/1.85 6[0:Inp] || -> equal(sk3,sk1)**. % 1.69/1.85 7[0:Inp] || totalorderedP(sk1)* -> . % 1.69/1.85 9[0:Inp] || -> ssItem(sk5)* equal(nil,sk3). % 1.69/1.85 13[0:Inp] || -> equal(cons(sk5,nil),sk3)** equal(nil,sk3). % 1.69/1.85 19[0:Inp] || -> totalorderedP(nil)*. % 1.69/1.85 82[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*. % 1.69/1.85 87[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*. % 1.69/1.85 192[0:Inp] ssList(u) ssList(v) || equal(hd(v),hd(u))* equal(tl(v),tl(u)) -> equal(v,u) equal(nil,v) equal(nil,u). % 1.69/1.85 203[0:Rew:6.0,9.1] || -> ssItem(sk5)* equal(nil,sk1). % 1.69/1.85 207[0:Rew:6.0,13.1,6.0,13.0] || -> equal(nil,sk1) equal(cons(sk5,nil),sk1)**. % 1.69/1.85 296[0:Res:2.0,87.0] || -> ssItem(u)* duplicatefreeP(sk2)*. % 1.69/1.85 467[0:Res:1.0,87.0] || -> ssItem(u)* duplicatefreeP(sk1)*. % 1.69/1.85 482[0:Res:1.0,192.1] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u) equal(nil,sk1). % 1.69/1.85 564[1:Spt:87.1] || -> ssItem(u)*. % 1.69/1.85 573[1:MRR:82.0,564.0] || -> totalorderedP(cons(u,nil))*. % 1.69/1.85 769[2:Spt:482.5] || -> equal(nil,sk1)**. % 1.69/1.85 831[2:Rew:769.0,19.0] || -> totalorderedP(sk1)*. % 1.69/1.85 874[2:MRR:831.0,7.0] || -> . % 1.69/1.85 1181[2:Spt:874.0,482.5,769.0] || equal(nil,sk1)** -> . % 1.69/1.85 1182[2:Spt:874.0,482.0,482.1,482.2,482.3,482.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u). % 1.69/1.85 1188[2:MRR:207.0,1181.0] || -> equal(cons(sk5,nil),sk1)**. % 1.69/1.85 1409[2:SpR:1188.0,573.0] || -> totalorderedP(sk1)*. % 1.69/1.85 1414[2:MRR:1409.0,7.0] || -> . % 1.69/1.85 1417[1:Spt:1414.0,87.0,87.2] ssList(u) || -> duplicatefreeP(u)*. % 1.69/1.85 1433[2:Spt:467.0] || -> ssItem(u)*. % 1.69/1.85 1440[2:MRR:82.0,1433.0] || -> totalorderedP(cons(u,nil))*. % 1.69/1.85 1632[3:Spt:482.5] || -> equal(nil,sk1)**. % 1.69/1.85 1637[3:Rew:1632.0,19.0] || -> totalorderedP(sk1)*. % 1.69/1.85 1737[3:MRR:1637.0,7.0] || -> . % 1.69/1.85 2045[3:Spt:1737.0,482.5,1632.0] || equal(nil,sk1)** -> . % 1.69/1.85 2046[3:Spt:1737.0,482.0,482.1,482.2,482.3,482.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u). % 1.69/1.85 2052[3:MRR:207.0,2045.0] || -> equal(cons(sk5,nil),sk1)**. % 1.69/1.85 2271[3:SpR:2052.0,1440.0] || -> totalorderedP(sk1)*. % 1.69/1.85 2277[3:MRR:2271.0,7.0] || -> . % 1.69/1.85 2278[2:Spt:2277.0,467.1] || -> duplicatefreeP(sk1)*. % 1.69/1.85 2281[3:Spt:296.0] || -> ssItem(u)*. % 1.69/1.85 2290[3:MRR:82.0,2281.0] || -> totalorderedP(cons(u,nil))*. % 1.69/1.85 2478[4:Spt:482.5] || -> equal(nil,sk1)**. % 1.69/1.85 2483[4:Rew:2478.0,19.0] || -> totalorderedP(sk1)*. % 1.69/1.85 2583[4:MRR:2483.0,7.0] || -> . % 1.69/1.85 2890[4:Spt:2583.0,482.5,2478.0] || equal(nil,sk1)** -> . % 1.69/1.85 2891[4:Spt:2583.0,482.0,482.1,482.2,482.3,482.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u). % 1.69/1.85 2897[4:MRR:207.0,2890.0] || -> equal(cons(sk5,nil),sk1)**. % 1.69/1.85 3116[4:SpR:2897.0,2290.0] || -> totalorderedP(sk1)*. % 1.69/1.85 3121[4:MRR:3116.0,7.0] || -> . % 1.69/1.85 3123[3:Spt:3121.0,296.1] || -> duplicatefreeP(sk2)*. % 1.69/1.85 3124[4:Spt:482.5] || -> equal(nil,sk1)**. % 1.69/1.85 3129[4:Rew:3124.0,19.0] || -> totalorderedP(sk1)*. % 1.69/1.85 3231[4:MRR:3129.0,7.0] || -> . % 1.69/1.85 3322[4:Spt:3231.0,482.5,3124.0] || equal(nil,sk1)** -> . % 1.69/1.85 3323[4:Spt:3231.0,482.0,482.1,482.2,482.3,482.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u). % 1.69/1.85 3324[4:MRR:203.1,3322.0] || -> ssItem(sk5)*. % 1.69/1.85 3331[4:MRR:207.0,3322.0] || -> equal(cons(sk5,nil),sk1)**. % 1.69/1.85 3579[4:SpR:3331.0,82.1] ssItem(sk5) || -> totalorderedP(sk1)*. % 1.69/1.85 3580[4:SSi:3579.0,3324.0] || -> totalorderedP(sk1)*. % 1.69/1.85 3581[4:MRR:3580.0,7.0] || -> . % 1.69/1.85 % SZS output end Refutation % 1.69/1.85 Formulae used in the proof : co1_1 co1_2 co1_6 co1_7 co1_9 co1_13 clause4 clause67 clause72 clause177 % 1.69/1.85 %------------------------------------------------------------------------------