%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWC205-1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n017.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:27 EDT 2022 % Result : Unsatisfiable 1.40s 1.65s % Output : Refutation 1.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWC205-1 : TPTP v8.1.0. Released v2.4.0. % 0.07/0.13 % Command : run_spass %d %s % 0.13/0.34 % Computer : n017.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.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Sun Jun 12 09:17:52 EDT 2022 % 0.13/0.35 % CPUTime : % 1.40/1.65 % 1.40/1.65 SPASS V 3.9 % 1.40/1.65 SPASS beiseite: Proof found. % 1.40/1.65 % SZS status Theorem % 1.40/1.65 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 1.40/1.65 SPASS derived 2265 clauses, backtracked 2159 clauses, performed 55 splits and kept 3770 clauses. % 1.40/1.65 SPASS allocated 78002 KBytes. % 1.40/1.65 SPASS spent 0:00:01.27 on the problem. % 1.40/1.65 0:00:00.04 for the input. % 1.40/1.65 0:00:00.00 for the FLOTTER CNF translation. % 1.40/1.65 0:00:00.00 for inferences. % 1.40/1.65 0:00:00.02 for the backtracking. % 1.40/1.65 0:00:00.98 for the reduction. % 1.40/1.65 % 1.40/1.65 % 1.40/1.65 Here is a proof with depth 2, length 92 : % 1.40/1.65 % SZS output start Refutation % 1.40/1.65 1[0:Inp] || -> ssList(sk1)*. % 1.40/1.65 2[0:Inp] || -> ssList(sk2)*. % 1.40/1.65 5[0:Inp] || -> equal(sk4,sk2)**. % 1.40/1.65 6[0:Inp] || -> equal(sk3,sk1)**. % 1.40/1.65 7[0:Inp] || -> neq(sk2,nil)*. % 1.40/1.65 8[0:Inp] || neq(sk1,nil)* -> . % 1.40/1.65 9[0:Inp] || equal(nil,sk3)** -> equal(nil,sk4). % 1.40/1.65 10[0:Inp] || equal(nil,sk4)** -> equal(nil,sk3). % 1.40/1.65 11[0:Inp] || -> equalelemsP(nil)*. % 1.40/1.65 12[0:Inp] || -> duplicatefreeP(nil)*. % 1.40/1.65 13[0:Inp] || -> strictorderedP(nil)*. % 1.40/1.65 14[0:Inp] || -> totalorderedP(nil)*. % 1.40/1.65 15[0:Inp] || -> strictorderP(nil)*. % 1.40/1.65 16[0:Inp] || -> totalorderP(nil)*. % 1.40/1.65 17[0:Inp] || -> cyclefreeP(nil)*. % 1.40/1.65 18[0:Inp] || -> ssList(nil)*. % 1.40/1.65 82[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*. % 1.40/1.65 110[0:Inp] ssList(u) ssList(v) || -> equal(u,v) neq(u,v)*. % 1.40/1.65 112[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*. % 1.40/1.65 187[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.40/1.65 198[0:Rew:6.0,10.1,5.0,10.0] || equal(nil,sk2)** -> equal(nil,sk1). % 1.40/1.65 199[0:Rew:5.0,9.1,6.0,9.0] || equal(nil,sk1)** -> equal(nil,sk2). % 1.40/1.65 285[0:Res:2.0,82.0] || -> ssItem(u)* duplicatefreeP(sk2)*. % 1.40/1.65 300[0:Res:2.0,187.1] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u) equal(nil,sk2). % 1.40/1.65 456[0:Res:1.0,82.0] || -> ssItem(u)* duplicatefreeP(sk1)*. % 1.40/1.65 510[0:Res:1.0,110.1] ssList(u) || -> equal(sk1,u) neq(sk1,u)*. % 1.40/1.65 560[1:Spt:82.1] || -> ssItem(u)*. % 1.40/1.65 590[1:MRR:112.1,112.0,560.0] || -> equal(u,v) neq(u,v)*. % 1.40/1.65 764[2:Spt:300.5] || -> equal(nil,sk2)**. % 1.40/1.65 769[2:Rew:764.0,198.0] || equal(sk2,sk2) -> equal(nil,sk1)**. % 1.40/1.65 837[2:Rew:764.0,7.0] || -> neq(sk2,sk2)*. % 1.40/1.65 838[2:Rew:764.0,8.0] || neq(sk1,sk2)* -> . % 1.40/1.65 894[2:Obv:769.0] || -> equal(nil,sk1)**. % 1.40/1.65 895[2:Rew:764.0,894.0] || -> equal(sk2,sk1)**. % 1.40/1.65 988[2:Rew:895.0,837.0] || -> neq(sk1,sk1)*. % 1.40/1.65 989[2:Rew:895.0,838.0] || neq(sk1,sk1)* -> . % 1.40/1.65 1007[2:MRR:989.0,988.0] || -> . % 1.40/1.65 1186[2:Spt:1007.0,300.5,764.0] || equal(nil,sk2)** -> . % 1.40/1.65 1187[2:Spt:1007.0,300.0,300.1,300.2,300.3,300.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u). % 1.40/1.65 1192[2:MRR:199.1,1186.0] || equal(nil,sk1)** -> . % 1.40/1.65 1255[1:Res:590.1,8.0] || -> equal(nil,sk1)**. % 1.40/1.65 1256[2:MRR:1255.0,1192.0] || -> . % 1.40/1.65 1257[1:Spt:1256.0,82.0,82.2] ssList(u) || -> duplicatefreeP(u)*. % 1.40/1.65 1275[2:Spt:456.0] || -> ssItem(u)*. % 1.40/1.65 1303[2:MRR:112.1,112.0,1275.0] || -> equal(u,v) neq(u,v)*. % 1.40/1.65 1473[3:Spt:300.5] || -> equal(nil,sk2)**. % 1.40/1.65 1482[3:Rew:1473.0,7.0] || -> neq(sk2,sk2)*. % 1.40/1.65 1490[3:Rew:1473.0,8.0] || neq(sk1,sk2)* -> . % 1.40/1.65 1533[3:Rew:1473.0,198.0] || equal(sk2,sk2) -> equal(nil,sk1)**. % 1.40/1.65 1602[3:Obv:1533.0] || -> equal(nil,sk1)**. % 1.40/1.65 1603[3:Rew:1473.0,1602.0] || -> equal(sk2,sk1)**. % 1.40/1.65 1693[3:Rew:1603.0,1482.0] || -> neq(sk1,sk1)*. % 1.40/1.65 1698[3:Rew:1603.0,1490.0] || neq(sk1,sk1)* -> . % 1.40/1.65 1715[3:MRR:1698.0,1693.0] || -> . % 1.40/1.65 1893[3:Spt:1715.0,300.5,1473.0] || equal(nil,sk2)** -> . % 1.40/1.65 1894[3:Spt:1715.0,300.0,300.1,300.2,300.3,300.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u). % 1.40/1.65 1899[3:MRR:199.1,1893.0] || equal(nil,sk1)** -> . % 1.40/1.65 1961[2:Res:1303.1,8.0] || -> equal(nil,sk1)**. % 1.40/1.65 1962[3:MRR:1961.0,1899.0] || -> . % 1.40/1.65 1963[2:Spt:1962.0,456.1] || -> duplicatefreeP(sk1)*. % 1.40/1.65 1966[3:Spt:285.0] || -> ssItem(u)*. % 1.40/1.65 1996[3:MRR:112.1,112.0,1966.0] || -> equal(u,v) neq(u,v)*. % 1.40/1.65 2162[4:Spt:300.5] || -> equal(nil,sk2)**. % 1.40/1.65 2178[4:Rew:2162.0,7.0] || -> neq(sk2,sk2)*. % 1.40/1.65 2179[4:Rew:2162.0,8.0] || neq(sk1,sk2)* -> . % 1.40/1.65 2222[4:Rew:2162.0,198.0] || equal(sk2,sk2) -> equal(nil,sk1)**. % 1.40/1.65 2291[4:Obv:2222.0] || -> equal(nil,sk1)**. % 1.40/1.65 2292[4:Rew:2162.0,2291.0] || -> equal(sk2,sk1)**. % 1.40/1.65 2386[4:Rew:2292.0,2178.0] || -> neq(sk1,sk1)*. % 1.40/1.65 2387[4:Rew:2292.0,2179.0] || neq(sk1,sk1)* -> . % 1.40/1.65 2404[4:MRR:2387.0,2386.0] || -> . % 1.40/1.65 2582[4:Spt:2404.0,300.5,2162.0] || equal(nil,sk2)** -> . % 1.40/1.65 2583[4:Spt:2404.0,300.0,300.1,300.2,300.3,300.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u). % 1.40/1.65 2588[4:MRR:199.1,2582.0] || equal(nil,sk1)** -> . % 1.40/1.65 2650[3:Res:1996.1,8.0] || -> equal(nil,sk1)**. % 1.40/1.65 2651[4:MRR:2650.0,2588.0] || -> . % 1.40/1.65 2652[3:Spt:2651.0,285.1] || -> duplicatefreeP(sk2)*. % 1.40/1.65 2653[4:Spt:300.5] || -> equal(nil,sk2)**. % 1.40/1.65 2662[4:Rew:2653.0,7.0] || -> neq(sk2,sk2)*. % 1.40/1.65 2670[4:Rew:2653.0,8.0] || neq(sk1,sk2)* -> . % 1.40/1.65 2714[4:Rew:2653.0,198.0] || equal(sk2,sk2) -> equal(nil,sk1)**. % 1.40/1.65 2780[4:Obv:2714.0] || -> equal(nil,sk1)**. % 1.40/1.65 2781[4:Rew:2653.0,2780.0] || -> equal(sk2,sk1)**. % 1.40/1.65 2876[4:Rew:2781.0,2662.0] || -> neq(sk1,sk1)*. % 1.40/1.65 2881[4:Rew:2781.0,2670.0] || neq(sk1,sk1)* -> . % 1.40/1.65 2896[4:MRR:2881.0,2876.0] || -> . % 1.40/1.65 3089[4:Spt:2896.0,300.5,2653.0] || equal(nil,sk2)** -> . % 1.40/1.65 3090[4:Spt:2896.0,300.0,300.1,300.2,300.3,300.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u). % 1.40/1.65 3096[4:MRR:199.1,3089.0] || equal(nil,sk1)** -> . % 1.40/1.65 3189[0:Res:510.2,8.0] ssList(nil) || -> equal(nil,sk1)**. % 1.40/1.65 3190[0:SSi:3189.0,18.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0] || -> equal(nil,sk1)**. % 1.40/1.65 3191[4:MRR:3190.0,3096.0] || -> . % 1.40/1.65 % SZS output end Refutation % 1.40/1.65 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 clause72 clause100 clause102 clause177 % 1.40/1.65 %------------------------------------------------------------------------------