%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWC292-1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n020.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:03:06 EDT 2022 % Result : Unsatisfiable 1.26s 1.48s % Output : Refutation 1.26s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : SWC292-1 : TPTP v8.1.0. Released v2.4.0. % 0.08/0.13 % Command : run_spass %d %s % 0.13/0.34 % Computer : n020.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sun Jun 12 18:54:20 EDT 2022 % 0.13/0.34 % CPUTime : % 1.26/1.48 % 1.26/1.48 SPASS V 3.9 % 1.26/1.48 SPASS beiseite: Proof found. % 1.26/1.48 % SZS status Theorem % 1.26/1.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 1.26/1.48 SPASS derived 1906 clauses, backtracked 1652 clauses, performed 52 splits and kept 3297 clauses. % 1.26/1.48 SPASS allocated 77556 KBytes. % 1.26/1.48 SPASS spent 0:00:01.11 on the problem. % 1.26/1.48 0:00:00.04 for the input. % 1.26/1.48 0:00:00.00 for the FLOTTER CNF translation. % 1.26/1.48 0:00:00.01 for inferences. % 1.26/1.48 0:00:00.02 for the backtracking. % 1.26/1.48 0:00:00.87 for the reduction. % 1.26/1.48 % 1.26/1.48 % 1.26/1.48 Here is a proof with depth 2, length 86 : % 1.26/1.48 % SZS output start Refutation % 1.26/1.48 1[0:Inp] || -> ssList(sk1)*. % 1.26/1.48 2[0:Inp] || -> ssList(sk2)*. % 1.26/1.48 5[0:Inp] || -> equal(sk4,sk2)**. % 1.26/1.48 6[0:Inp] || -> equal(sk3,sk1)**. % 1.26/1.48 7[0:Inp] || strictorderedP(sk1)* -> . % 1.26/1.48 8[0:Inp] || equal(nil,sk4) -> equal(sk3,nil)**. % 1.26/1.48 9[0:Inp] || neq(sk4,nil)* -> ssItem(sk5). % 1.26/1.48 10[0:Inp] || neq(sk4,nil) -> equal(cons(sk5,nil),sk3)**. % 1.26/1.48 12[0:Inp] || -> equalelemsP(nil)*. % 1.26/1.48 13[0:Inp] || -> duplicatefreeP(nil)*. % 1.26/1.48 14[0:Inp] || -> strictorderedP(nil)*. % 1.26/1.48 15[0:Inp] || -> totalorderedP(nil)*. % 1.26/1.48 16[0:Inp] || -> strictorderP(nil)*. % 1.26/1.48 17[0:Inp] || -> totalorderP(nil)*. % 1.26/1.48 18[0:Inp] || -> cyclefreeP(nil)*. % 1.26/1.48 19[0:Inp] || -> ssList(nil)*. % 1.26/1.48 77[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*. % 1.26/1.48 83[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*. % 1.26/1.48 111[0:Inp] ssList(u) ssList(v) || -> equal(u,v) neq(u,v)*. % 1.26/1.48 113[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*. % 1.26/1.48 188[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.26/1.48 199[0:Rew:5.0,9.0] || neq(sk2,nil)* -> ssItem(sk5). % 1.26/1.48 201[0:Rew:6.0,8.1,5.0,8.0] || equal(nil,sk2)** -> equal(nil,sk1). % 1.26/1.48 202[0:Rew:6.0,10.1,5.0,10.0] || neq(sk2,nil) -> equal(cons(sk5,nil),sk1)**. % 1.26/1.48 288[0:Res:2.0,83.0] || -> ssItem(u)* duplicatefreeP(sk2)*. % 1.26/1.48 342[0:Res:2.0,111.1] ssList(u) || -> equal(sk2,u) neq(sk2,u)*. % 1.26/1.48 459[0:Res:1.0,83.0] || -> ssItem(u)* duplicatefreeP(sk1)*. % 1.26/1.48 474[0:Res:1.0,188.1] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u) equal(nil,sk1). % 1.26/1.48 561[1:Spt:83.1] || -> ssItem(u)*. % 1.26/1.48 571[1:MRR:77.0,561.0] || -> strictorderedP(cons(u,nil))*. % 1.26/1.48 592[1:MRR:113.1,113.0,561.0] || -> equal(u,v) neq(u,v)*. % 1.26/1.48 764[2:Spt:474.5] || -> equal(nil,sk1)**. % 1.26/1.48 828[2:Rew:764.0,14.0] || -> strictorderedP(sk1)*. % 1.26/1.48 872[2:MRR:828.0,7.0] || -> . % 1.26/1.48 961[2:Spt:872.0,474.5,764.0] || equal(nil,sk1)** -> . % 1.26/1.48 962[2:Spt:872.0,474.0,474.1,474.2,474.3,474.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u). % 1.26/1.48 967[2:MRR:201.1,961.0] || equal(nil,sk2)** -> . % 1.26/1.48 1069[1:SpR:202.1,571.0] || neq(sk2,nil)* -> strictorderedP(sk1). % 1.26/1.48 1078[1:MRR:1069.1,7.0] || neq(sk2,nil)* -> . % 1.26/1.48 1080[1:Res:592.1,1078.0] || -> equal(nil,sk2)**. % 1.26/1.48 1081[2:MRR:1080.0,967.0] || -> . % 1.26/1.48 1082[1:Spt:1081.0,83.0,83.2] ssList(u) || -> duplicatefreeP(u)*. % 1.26/1.48 1114[2:Spt:459.0] || -> ssItem(u)*. % 1.26/1.48 1120[2:MRR:77.0,1114.0] || -> strictorderedP(cons(u,nil))*. % 1.26/1.48 1143[2:MRR:113.1,113.0,1114.0] || -> equal(u,v) neq(u,v)*. % 1.26/1.48 1311[3:Spt:474.5] || -> equal(nil,sk1)**. % 1.26/1.48 1314[3:Rew:1311.0,14.0] || -> strictorderedP(sk1)*. % 1.26/1.48 1415[3:MRR:1314.0,7.0] || -> . % 1.26/1.48 1510[3:Spt:1415.0,474.5,1311.0] || equal(nil,sk1)** -> . % 1.26/1.48 1511[3:Spt:1415.0,474.0,474.1,474.2,474.3,474.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u). % 1.26/1.48 1516[3:MRR:201.1,1510.0] || equal(nil,sk2)** -> . % 1.26/1.48 1620[2:SpR:202.1,1120.0] || neq(sk2,nil)* -> strictorderedP(sk1). % 1.26/1.48 1627[2:MRR:1620.1,7.0] || neq(sk2,nil)* -> . % 1.26/1.48 1629[2:Res:1143.1,1627.0] || -> equal(nil,sk2)**. % 1.26/1.48 1630[3:MRR:1629.0,1516.0] || -> . % 1.26/1.48 1631[2:Spt:1630.0,459.1] || -> duplicatefreeP(sk1)*. % 1.26/1.48 1634[3:Spt:288.0] || -> ssItem(u)*. % 1.26/1.48 1644[3:MRR:77.0,1634.0] || -> strictorderedP(cons(u,nil))*. % 1.26/1.48 1665[3:MRR:113.1,113.0,1634.0] || -> equal(u,v) neq(u,v)*. % 1.26/1.48 1829[4:Spt:474.5] || -> equal(nil,sk1)**. % 1.26/1.48 1835[4:Rew:1829.0,14.0] || -> strictorderedP(sk1)*. % 1.26/1.48 1937[4:MRR:1835.0,7.0] || -> . % 1.26/1.48 2028[4:Spt:1937.0,474.5,1829.0] || equal(nil,sk1)** -> . % 1.26/1.48 2029[4:Spt:1937.0,474.0,474.1,474.2,474.3,474.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u). % 1.26/1.48 2034[4:MRR:201.1,2028.0] || equal(nil,sk2)** -> . % 1.26/1.48 2136[3:SpR:202.1,1644.0] || neq(sk2,nil)* -> strictorderedP(sk1). % 1.26/1.48 2145[3:MRR:2136.1,7.0] || neq(sk2,nil)* -> . % 1.26/1.48 2147[3:Res:1665.1,2145.0] || -> equal(nil,sk2)**. % 1.26/1.48 2148[4:MRR:2147.0,2034.0] || -> . % 1.26/1.48 2149[3:Spt:2148.0,288.1] || -> duplicatefreeP(sk2)*. % 1.26/1.48 2150[4:Spt:474.5] || -> equal(nil,sk1)**. % 1.26/1.48 2153[4:Rew:2150.0,14.0] || -> strictorderedP(sk1)*. % 1.26/1.48 2257[4:MRR:2153.0,7.0] || -> . % 1.26/1.48 2350[4:Spt:2257.0,474.5,2150.0] || equal(nil,sk1)** -> . % 1.26/1.48 2351[4:Spt:2257.0,474.0,474.1,474.2,474.3,474.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u). % 1.26/1.48 2357[4:MRR:201.1,2350.0] || equal(nil,sk2)** -> . % 1.26/1.48 2408[5:Spt:199.0] || neq(sk2,nil)* -> . % 1.26/1.48 2471[5:Res:342.2,2408.0] ssList(nil) || -> equal(nil,sk2)**. % 1.26/1.48 2472[5:SSi:2471.0,19.0,18.0,17.0,16.0,15.0,14.0,13.0,12.0] || -> equal(nil,sk2)**. % 1.26/1.48 2473[5:MRR:2472.0,2357.0] || -> . % 1.26/1.48 2474[5:Spt:2473.0,199.0,2408.0] || -> neq(sk2,nil)*. % 1.26/1.48 2475[5:Spt:2473.0,199.1] || -> ssItem(sk5)*. % 1.26/1.48 2477[5:MRR:202.0,2474.0] || -> equal(cons(sk5,nil),sk1)**. % 1.26/1.48 2482[5:SpR:2477.0,77.1] ssItem(sk5) || -> strictorderedP(sk1)*. % 1.26/1.48 2486[5:SSi:2482.0,2475.0] || -> strictorderedP(sk1)*. % 1.26/1.48 2487[5:MRR:2486.0,7.0] || -> . % 1.26/1.48 % SZS output end Refutation % 1.26/1.48 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause66 clause72 clause100 clause102 clause177 % 1.26/1.48 %------------------------------------------------------------------------------